./Ultimate.py --spec /mnt/goblint-svcomp/goblint-bench/bench/concrat/properties/no-data-race.prp --file /mnt/goblint-svcomp/goblint-bench/bench/concrat/race-challenges/per-thread-array-init.i --full-output --architecture 32bit


--------------------------------------------------------------------------------


Checking for data races
Using default analysis
Version 2329fc70
Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/data -tc /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/config/AutomizerReach.xml -i /mnt/goblint-svcomp/goblint-bench/bench/concrat/race-challenges/per-thread-array-init.i -s /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! data-race) )

 --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 5eada723a39865b57f214314c8375dd1968473302a42084b76575a29cb3c57af
--- Real Ultimate output ---
This is Ultimate 0.2.2-dev-2329fc7
[2024-03-09 02:46:21,246 INFO  L177        SettingsManager]: Resetting all preferences to default values...
[2024-03-09 02:46:21,247 INFO  L181        SettingsManager]: Resetting UltimateCore preferences to default values
[2024-03-09 02:46:21,269 INFO  L184        SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring...
[2024-03-09 02:46:21,269 INFO  L181        SettingsManager]: Resetting Boogie Preprocessor preferences to default values
[2024-03-09 02:46:21,270 INFO  L181        SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values
[2024-03-09 02:46:21,271 INFO  L181        SettingsManager]: Resetting Abstract Interpretation preferences to default values
[2024-03-09 02:46:21,272 INFO  L181        SettingsManager]: Resetting LassoRanker preferences to default values
[2024-03-09 02:46:21,273 INFO  L181        SettingsManager]: Resetting Reaching Definitions preferences to default values
[2024-03-09 02:46:21,273 INFO  L181        SettingsManager]: Resetting SyntaxChecker preferences to default values
[2024-03-09 02:46:21,274 INFO  L181        SettingsManager]: Resetting Sifa preferences to default values
[2024-03-09 02:46:21,275 INFO  L184        SettingsManager]: Büchi Program Product provides no preferences, ignoring...
[2024-03-09 02:46:21,275 INFO  L181        SettingsManager]: Resetting LTL2Aut preferences to default values
[2024-03-09 02:46:21,276 INFO  L181        SettingsManager]: Resetting PEA to Boogie preferences to default values
[2024-03-09 02:46:21,277 INFO  L181        SettingsManager]: Resetting BlockEncodingV2 preferences to default values
[2024-03-09 02:46:21,277 INFO  L181        SettingsManager]: Resetting ChcToBoogie preferences to default values
[2024-03-09 02:46:21,278 INFO  L181        SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values
[2024-03-09 02:46:21,279 INFO  L181        SettingsManager]: Resetting BuchiAutomizer preferences to default values
[2024-03-09 02:46:21,280 INFO  L181        SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values
[2024-03-09 02:46:21,281 INFO  L181        SettingsManager]: Resetting CodeCheck preferences to default values
[2024-03-09 02:46:21,282 INFO  L181        SettingsManager]: Resetting InvariantSynthesis preferences to default values
[2024-03-09 02:46:21,283 INFO  L181        SettingsManager]: Resetting RCFGBuilder preferences to default values
[2024-03-09 02:46:21,283 INFO  L181        SettingsManager]: Resetting Referee preferences to default values
[2024-03-09 02:46:21,284 INFO  L181        SettingsManager]: Resetting TraceAbstraction preferences to default values
[2024-03-09 02:46:21,286 INFO  L184        SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring...
[2024-03-09 02:46:21,287 INFO  L184        SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring...
[2024-03-09 02:46:21,287 INFO  L181        SettingsManager]: Resetting TreeAutomizer preferences to default values
[2024-03-09 02:46:21,287 INFO  L181        SettingsManager]: Resetting IcfgToChc preferences to default values
[2024-03-09 02:46:21,288 INFO  L181        SettingsManager]: Resetting IcfgTransformer preferences to default values
[2024-03-09 02:46:21,288 INFO  L184        SettingsManager]: ReqToTest provides no preferences, ignoring...
[2024-03-09 02:46:21,288 INFO  L181        SettingsManager]: Resetting Boogie Printer preferences to default values
[2024-03-09 02:46:21,289 INFO  L181        SettingsManager]: Resetting ChcSmtPrinter preferences to default values
[2024-03-09 02:46:21,289 INFO  L181        SettingsManager]: Resetting ReqPrinter preferences to default values
[2024-03-09 02:46:21,290 INFO  L181        SettingsManager]: Resetting Witness Printer preferences to default values
[2024-03-09 02:46:21,290 INFO  L184        SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring...
[2024-03-09 02:46:21,291 INFO  L181        SettingsManager]: Resetting CDTParser preferences to default values
[2024-03-09 02:46:21,291 INFO  L184        SettingsManager]: AutomataScriptParser provides no preferences, ignoring...
[2024-03-09 02:46:21,291 INFO  L184        SettingsManager]: ReqParser provides no preferences, ignoring...
[2024-03-09 02:46:21,291 INFO  L181        SettingsManager]: Resetting SmtParser preferences to default values
[2024-03-09 02:46:21,292 INFO  L181        SettingsManager]: Resetting Witness Parser preferences to default values
[2024-03-09 02:46:21,292 INFO  L188        SettingsManager]: Finished resetting all preferences to default values...
[2024-03-09 02:46:21,293 INFO  L101        SettingsManager]: Beginning loading settings from /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf
[2024-03-09 02:46:21,307 INFO  L113        SettingsManager]: Loading preferences was successful
[2024-03-09 02:46:21,308 INFO  L115        SettingsManager]: Preferences different from defaults after loading the file:
[2024-03-09 02:46:21,308 INFO  L136        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2024-03-09 02:46:21,308 INFO  L138        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2024-03-09 02:46:21,308 INFO  L136        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2024-03-09 02:46:21,309 INFO  L138        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2024-03-09 02:46:21,309 INFO  L136        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2024-03-09 02:46:21,309 INFO  L138        SettingsManager]:  * Create parallel compositions if possible=false
[2024-03-09 02:46:21,309 INFO  L138        SettingsManager]:  * Use SBE=true
[2024-03-09 02:46:21,309 INFO  L136        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2024-03-09 02:46:21,310 INFO  L138        SettingsManager]:  * sizeof long=4
[2024-03-09 02:46:21,310 INFO  L138        SettingsManager]:  * Check unreachability of error function in SV-COMP mode=false
[2024-03-09 02:46:21,310 INFO  L138        SettingsManager]:  * Overapproximate operations on floating types=true
[2024-03-09 02:46:21,310 INFO  L138        SettingsManager]:  * sizeof POINTER=4
[2024-03-09 02:46:21,310 INFO  L138        SettingsManager]:  * Check division by zero=IGNORE
[2024-03-09 02:46:21,310 INFO  L138        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2024-03-09 02:46:21,310 INFO  L138        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2024-03-09 02:46:21,310 INFO  L138        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2024-03-09 02:46:21,310 INFO  L138        SettingsManager]:  * Check absence of data races in concurrent programs=true
[2024-03-09 02:46:21,311 INFO  L138        SettingsManager]:  * sizeof long double=12
[2024-03-09 02:46:21,311 INFO  L138        SettingsManager]:  * Check if freed pointer was valid=false
[2024-03-09 02:46:21,311 INFO  L138        SettingsManager]:  * Use constant arrays=true
[2024-03-09 02:46:21,311 INFO  L138        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2024-03-09 02:46:21,311 INFO  L136        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2024-03-09 02:46:21,311 INFO  L138        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2024-03-09 02:46:21,311 INFO  L138        SettingsManager]:  * SMT solver=External_DefaultMode
[2024-03-09 02:46:21,311 INFO  L138        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2024-03-09 02:46:21,311 INFO  L136        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2024-03-09 02:46:21,312 INFO  L138        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2024-03-09 02:46:21,312 INFO  L138        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles
[2024-03-09 02:46:21,312 INFO  L138        SettingsManager]:  * Trace refinement strategy=CAMEL
[2024-03-09 02:46:21,312 INFO  L138        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2024-03-09 02:46:21,312 INFO  L138        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2024-03-09 02:46:21,312 INFO  L138        SettingsManager]:  * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true
[2024-03-09 02:46:21,312 INFO  L138        SettingsManager]:  * Order on configurations for Petri net unfoldings=DBO
[2024-03-09 02:46:21,312 INFO  L138        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2024-03-09 02:46:21,312 INFO  L138        SettingsManager]:  * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC
[2024-03-09 02:46:21,312 INFO  L138        SettingsManager]:  * Looper check in Petri net analysis=SEMANTIC
WARNING: An illegal reflective access operation has occurred
WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int)
WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1
WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations
WARNING: All illegal access operations will be denied in a future release
Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! data-race) )


Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 5eada723a39865b57f214314c8375dd1968473302a42084b76575a29cb3c57af
[2024-03-09 02:46:21,484 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2024-03-09 02:46:21,505 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2024-03-09 02:46:21,508 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2024-03-09 02:46:21,509 INFO  L271        PluginConnector]: Initializing CDTParser...
[2024-03-09 02:46:21,509 INFO  L275        PluginConnector]: CDTParser initialized
[2024-03-09 02:46:21,511 INFO  L432   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /mnt/goblint-svcomp/goblint-bench/bench/concrat/race-challenges/per-thread-array-init.i
[2024-03-09 02:46:22,528 INFO  L500              CDTParser]: Created temporary CDT project at NULL
[2024-03-09 02:46:22,837 INFO  L351              CDTParser]: Found 1 translation units.
[2024-03-09 02:46:22,838 INFO  L172              CDTParser]: Scanning /mnt/goblint-svcomp/goblint-bench/bench/concrat/race-challenges/per-thread-array-init.i
[2024-03-09 02:46:22,848 INFO  L394              CDTParser]: About to delete temporary CDT project at /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/data/18ec9fc92/505ea4d046fa4316bcf2b4e05faf68b2/FLAGa4a2ce18a
[2024-03-09 02:46:23,151 INFO  L402              CDTParser]: Successfully deleted /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/data/18ec9fc92/505ea4d046fa4316bcf2b4e05faf68b2
[2024-03-09 02:46:23,153 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2024-03-09 02:46:23,154 INFO  L131        ToolchainWalker]: Walking toolchain with 6 elements.
[2024-03-09 02:46:23,155 INFO  L113        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2024-03-09 02:46:23,155 INFO  L271        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2024-03-09 02:46:23,158 INFO  L275        PluginConnector]: CACSL2BoogieTranslator initialized
[2024-03-09 02:46:23,159 INFO  L185        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 02:46:23" (1/1) ...
[2024-03-09 02:46:23,159 INFO  L205        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@208bcd0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:46:23, skipping insertion in model container
[2024-03-09 02:46:23,159 INFO  L185        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 02:46:23" (1/1) ...
[2024-03-09 02:46:23,164 INFO  L145         MainTranslator]: Starting translation in SV-COMP mode 
[2024-03-09 02:46:23,199 INFO  L178         MainTranslator]: Built tables and reachable declarations
[2024-03-09 02:46:23,317 WARN  L611        FunctionHandler]: implicit declaration of function __builtin_bswap16
[2024-03-09 02:46:23,444 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2024-03-09 02:46:23,450 INFO  L203         MainTranslator]: Completed pre-run
[2024-03-09 02:46:23,460 WARN  L611        FunctionHandler]: implicit declaration of function __builtin_bswap16
[2024-03-09 02:46:23,485 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2024-03-09 02:46:23,519 INFO  L208         MainTranslator]: Completed translation
[2024-03-09 02:46:23,519 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:46:23 WrapperNode
[2024-03-09 02:46:23,519 INFO  L132        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2024-03-09 02:46:23,520 INFO  L113        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2024-03-09 02:46:23,520 INFO  L271        PluginConnector]: Initializing Boogie Procedure Inliner...
[2024-03-09 02:46:23,520 INFO  L275        PluginConnector]: Boogie Procedure Inliner initialized
[2024-03-09 02:46:23,526 INFO  L185        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:46:23" (1/1) ...
[2024-03-09 02:46:23,542 INFO  L185        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:46:23" (1/1) ...
[2024-03-09 02:46:23,590 INFO  L138                Inliner]: procedures = 266, calls = 27, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 112
[2024-03-09 02:46:23,590 INFO  L132        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2024-03-09 02:46:23,591 INFO  L113        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2024-03-09 02:46:23,591 INFO  L271        PluginConnector]: Initializing Boogie Preprocessor...
[2024-03-09 02:46:23,591 INFO  L275        PluginConnector]: Boogie Preprocessor initialized
[2024-03-09 02:46:23,598 INFO  L185        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:46:23" (1/1) ...
[2024-03-09 02:46:23,599 INFO  L185        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:46:23" (1/1) ...
[2024-03-09 02:46:23,602 INFO  L185        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:46:23" (1/1) ...
[2024-03-09 02:46:23,602 INFO  L185        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:46:23" (1/1) ...
[2024-03-09 02:46:23,622 INFO  L185        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:46:23" (1/1) ...
[2024-03-09 02:46:23,626 INFO  L185        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:46:23" (1/1) ...
[2024-03-09 02:46:23,628 INFO  L185        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:46:23" (1/1) ...
[2024-03-09 02:46:23,629 INFO  L185        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:46:23" (1/1) ...
[2024-03-09 02:46:23,631 INFO  L132        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2024-03-09 02:46:23,632 INFO  L113        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2024-03-09 02:46:23,632 INFO  L271        PluginConnector]: Initializing RCFGBuilder...
[2024-03-09 02:46:23,632 INFO  L275        PluginConnector]: RCFGBuilder initialized
[2024-03-09 02:46:23,633 INFO  L185        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:46:23" (1/1) ...
[2024-03-09 02:46:23,638 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2024-03-09 02:46:23,645 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2024-03-09 02:46:23,655 INFO  L229       MonitoredProcess]: Starting monitored process 1 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null)
[2024-03-09 02:46:23,662 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process
[2024-03-09 02:46:23,690 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack
[2024-03-09 02:46:23,690 INFO  L130     BoogieDeclarations]: Found specification of procedure read~$Pointer$
[2024-03-09 02:46:23,690 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc
[2024-03-09 02:46:23,690 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~$Pointer$
[2024-03-09 02:46:23,691 INFO  L130     BoogieDeclarations]: Found specification of procedure read~int
[2024-03-09 02:46:23,691 INFO  L130     BoogieDeclarations]: Found specification of procedure write~int
[2024-03-09 02:46:23,691 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap
[2024-03-09 02:46:23,691 INFO  L130     BoogieDeclarations]: Found specification of procedure thread
[2024-03-09 02:46:23,691 INFO  L138     BoogieDeclarations]: Found implementation of procedure thread
[2024-03-09 02:46:23,691 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2024-03-09 02:46:23,692 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2024-03-09 02:46:23,693 WARN  L209             CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement
[2024-03-09 02:46:23,834 INFO  L235             CfgBuilder]: Building ICFG
[2024-03-09 02:46:23,836 INFO  L261             CfgBuilder]: Building CFG for each procedure with an implementation
[2024-03-09 02:46:24,052 INFO  L276             CfgBuilder]: Performing block encoding
[2024-03-09 02:46:24,059 INFO  L295             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2024-03-09 02:46:24,059 INFO  L300             CfgBuilder]: Removed 2 assume(true) statements.
[2024-03-09 02:46:24,061 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.03 02:46:24 BoogieIcfgContainer
[2024-03-09 02:46:24,062 INFO  L132        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2024-03-09 02:46:24,064 INFO  L113        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2024-03-09 02:46:24,064 INFO  L271        PluginConnector]: Initializing TraceAbstraction...
[2024-03-09 02:46:24,066 INFO  L275        PluginConnector]: TraceAbstraction initialized
[2024-03-09 02:46:24,067 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.03 02:46:23" (1/3) ...
[2024-03-09 02:46:24,067 INFO  L205        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f270c87 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 02:46:24, skipping insertion in model container
[2024-03-09 02:46:24,067 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:46:23" (2/3) ...
[2024-03-09 02:46:24,068 INFO  L205        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f270c87 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 02:46:24, skipping insertion in model container
[2024-03-09 02:46:24,068 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.03 02:46:24" (3/3) ...
[2024-03-09 02:46:24,069 INFO  L112   eAbstractionObserver]: Analyzing ICFG per-thread-array-init.i
[2024-03-09 02:46:24,075 WARN  L145   ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program
[2024-03-09 02:46:24,083 INFO  L203   ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2024-03-09 02:46:24,083 INFO  L162   ceAbstractionStarter]: Applying trace abstraction to program that has 9 error locations.
[2024-03-09 02:46:24,084 INFO  L515   ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances.
[2024-03-09 02:46:24,129 INFO  L144    ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions.
[2024-03-09 02:46:24,159 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 136 places, 137 transitions, 282 flow
[2024-03-09 02:46:24,221 INFO  L130       PetriNetUnfolder]: 6/218 cut-off events.
[2024-03-09 02:46:24,221 INFO  L131       PetriNetUnfolder]: For 1/1 co-relation queries the response was YES.
[2024-03-09 02:46:24,226 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 224 conditions, 218 events. 6/218 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 369 event pairs, 0 based on Foata normal form. 0/192 useless extension candidates. Maximal degree in co-relation 109. Up to 4 conditions per place. 
[2024-03-09 02:46:24,226 INFO  L82        GeneralOperation]: Start removeDead. Operand has 136 places, 137 transitions, 282 flow
[2024-03-09 02:46:24,230 INFO  L88        GeneralOperation]: Finished RemoveDead, result has has 136 places, 137 transitions, 282 flow
[2024-03-09 02:46:24,234 INFO  L124   etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation.
[2024-03-09 02:46:24,242 INFO  L131   etLargeBlockEncoding]: Starting large block encoding on Petri net that has 136 places, 137 transitions, 282 flow
[2024-03-09 02:46:24,244 INFO  L113        LiptonReduction]: Starting Lipton reduction on Petri net that has 136 places, 137 transitions, 282 flow
[2024-03-09 02:46:24,245 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 136 places, 137 transitions, 282 flow
[2024-03-09 02:46:24,295 INFO  L130       PetriNetUnfolder]: 6/218 cut-off events.
[2024-03-09 02:46:24,296 INFO  L131       PetriNetUnfolder]: For 1/1 co-relation queries the response was YES.
[2024-03-09 02:46:24,297 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 224 conditions, 218 events. 6/218 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 369 event pairs, 0 based on Foata normal form. 0/192 useless extension candidates. Maximal degree in co-relation 109. Up to 4 conditions per place. 
[2024-03-09 02:46:24,300 INFO  L119        LiptonReduction]: Number of co-enabled transitions 2314
[2024-03-09 02:46:26,932 INFO  L134        LiptonReduction]: Checked pairs total: 11734
[2024-03-09 02:46:26,933 INFO  L136        LiptonReduction]: Total number of compositions: 80
[2024-03-09 02:46:26,944 INFO  L356      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2024-03-09 02:46:26,950 INFO  L357      AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@4c0288a2, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=<UNSUPPORTED>, UseSemiCommutativity=<UNSUPPORTED>, Solver=<NOT_USED>, SolverTimeout=<NOT_USED>]
[2024-03-09 02:46:26,950 INFO  L358      AbstractCegarLoop]: Starting to check reachability of 11 error locations.
[2024-03-09 02:46:26,953 INFO  L130       PetriNetUnfolder]: 0/14 cut-off events.
[2024-03-09 02:46:26,953 INFO  L131       PetriNetUnfolder]: For 0/0 co-relation queries the response was YES.
[2024-03-09 02:46:26,953 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-03-09 02:46:26,954 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1]
[2024-03-09 02:46:26,954 INFO  L420      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (and 8 more)] ===
[2024-03-09 02:46:26,958 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-09 02:46:26,958 INFO  L85        PathProgramCache]: Analyzing trace with hash -466745586, now seen corresponding path program 1 times
[2024-03-09 02:46:26,965 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-09 02:46:26,965 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [375204138]
[2024-03-09 02:46:26,965 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 02:46:26,966 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-09 02:46:27,053 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 02:46:27,346 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-09 02:46:27,346 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-09 02:46:27,346 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [375204138]
[2024-03-09 02:46:27,347 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [375204138] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-09 02:46:27,347 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-09 02:46:27,347 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-03-09 02:46:27,348 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [141968740]
[2024-03-09 02:46:27,349 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-09 02:46:27,355 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-03-09 02:46:27,355 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-09 02:46:27,369 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-03-09 02:46:27,370 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2024-03-09 02:46:27,754 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 107 out of 217
[2024-03-09 02:46:27,757 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 64 transitions, 136 flow. Second operand  has 6 states, 6 states have (on average 108.0) internal successors, (648), 6 states have internal predecessors, (648), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 02:46:27,758 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-09 02:46:27,758 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 217
[2024-03-09 02:46:27,758 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-09 02:46:27,893 INFO  L130       PetriNetUnfolder]: 55/285 cut-off events.
[2024-03-09 02:46:27,894 INFO  L131       PetriNetUnfolder]: For 4/4 co-relation queries the response was YES.
[2024-03-09 02:46:27,895 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 469 conditions, 285 events. 55/285 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 1269 event pairs, 36 based on Foata normal form. 0/255 useless extension candidates. Maximal degree in co-relation 345. Up to 109 conditions per place. 
[2024-03-09 02:46:27,897 INFO  L137   encePairwiseOnDemand]: 200/217 looper letters, 39 selfloop transitions, 10 changer transitions 5/82 dead transitions.
[2024-03-09 02:46:27,897 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 82 transitions, 280 flow
[2024-03-09 02:46:27,898 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-03-09 02:46:27,900 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-03-09 02:46:27,908 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 699 transitions.
[2024-03-09 02:46:27,911 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5368663594470046
[2024-03-09 02:46:27,912 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 699 transitions.
[2024-03-09 02:46:27,912 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 699 transitions.
[2024-03-09 02:46:27,914 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-09 02:46:27,916 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 699 transitions.
[2024-03-09 02:46:27,920 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 116.5) internal successors, (699), 6 states have internal predecessors, (699), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 02:46:27,926 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 217.0) internal successors, (1519), 7 states have internal predecessors, (1519), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 02:46:27,927 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 217.0) internal successors, (1519), 7 states have internal predecessors, (1519), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 02:46:27,928 INFO  L175             Difference]: Start difference. First operand has 66 places, 64 transitions, 136 flow. Second operand 6 states and 699 transitions.
[2024-03-09 02:46:27,929 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 82 transitions, 280 flow
[2024-03-09 02:46:27,931 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 82 transitions, 280 flow, removed 0 selfloop flow, removed 0 redundant places.
[2024-03-09 02:46:27,933 INFO  L231             Difference]: Finished difference. Result has 72 places, 65 transitions, 190 flow
[2024-03-09 02:46:27,934 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=217, PETRI_DIFFERENCE_MINUEND_FLOW=130, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=190, PETRI_PLACES=72, PETRI_TRANSITIONS=65}
[2024-03-09 02:46:27,937 INFO  L288   CegarLoopForPetriNet]: 66 programPoint places, 6 predicate places.
[2024-03-09 02:46:27,937 INFO  L495      AbstractCegarLoop]: Abstraction has has 72 places, 65 transitions, 190 flow
[2024-03-09 02:46:27,938 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 108.0) internal successors, (648), 6 states have internal predecessors, (648), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 02:46:27,938 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-03-09 02:46:27,938 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1]
[2024-03-09 02:46:27,938 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2024-03-09 02:46:27,939 INFO  L420      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (and 8 more)] ===
[2024-03-09 02:46:27,939 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-09 02:46:27,939 INFO  L85        PathProgramCache]: Analyzing trace with hash -1582124417, now seen corresponding path program 1 times
[2024-03-09 02:46:27,939 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-09 02:46:27,939 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1608919399]
[2024-03-09 02:46:27,940 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 02:46:27,940 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-09 02:46:27,953 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 02:46:27,987 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-09 02:46:27,988 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-09 02:46:27,988 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1608919399]
[2024-03-09 02:46:27,988 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1608919399] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-09 02:46:27,988 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-09 02:46:27,988 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-03-09 02:46:27,989 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1532085375]
[2024-03-09 02:46:27,989 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-09 02:46:27,990 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2024-03-09 02:46:27,990 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-09 02:46:27,990 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2024-03-09 02:46:27,991 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2024-03-09 02:46:28,048 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 126 out of 217
[2024-03-09 02:46:28,049 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 65 transitions, 190 flow. Second operand  has 4 states, 4 states have (on average 126.75) internal successors, (507), 4 states have internal predecessors, (507), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 02:46:28,049 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-09 02:46:28,049 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 126 of 217
[2024-03-09 02:46:28,050 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-09 02:46:28,144 INFO  L130       PetriNetUnfolder]: 28/243 cut-off events.
[2024-03-09 02:46:28,144 INFO  L131       PetriNetUnfolder]: For 33/33 co-relation queries the response was YES.
[2024-03-09 02:46:28,145 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 423 conditions, 243 events. 28/243 cut-off events. For 33/33 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 991 event pairs, 0 based on Foata normal form. 0/223 useless extension candidates. Maximal degree in co-relation 308. Up to 79 conditions per place. 
[2024-03-09 02:46:28,145 INFO  L137   encePairwiseOnDemand]: 213/217 looper letters, 27 selfloop transitions, 3 changer transitions 1/75 dead transitions.
[2024-03-09 02:46:28,146 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 75 transitions, 279 flow
[2024-03-09 02:46:28,146 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2024-03-09 02:46:28,147 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 4 states.
[2024-03-09 02:46:28,150 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 536 transitions.
[2024-03-09 02:46:28,151 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.6175115207373272
[2024-03-09 02:46:28,151 INFO  L72            ComplementDD]: Start complementDD. Operand 4 states and 536 transitions.
[2024-03-09 02:46:28,151 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 4 states and 536 transitions.
[2024-03-09 02:46:28,152 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-09 02:46:28,152 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 536 transitions.
[2024-03-09 02:46:28,155 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 5 states, 4 states have (on average 134.0) internal successors, (536), 4 states have internal predecessors, (536), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 02:46:28,158 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 5 states, 5 states have (on average 217.0) internal successors, (1085), 5 states have internal predecessors, (1085), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 02:46:28,159 INFO  L81            ComplementDD]: Finished complementDD. Result  has 5 states, 5 states have (on average 217.0) internal successors, (1085), 5 states have internal predecessors, (1085), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 02:46:28,159 INFO  L175             Difference]: Start difference. First operand has 72 places, 65 transitions, 190 flow. Second operand 4 states and 536 transitions.
[2024-03-09 02:46:28,159 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 75 transitions, 279 flow
[2024-03-09 02:46:28,161 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 75 transitions, 268 flow, removed 3 selfloop flow, removed 1 redundant places.
[2024-03-09 02:46:28,162 INFO  L231             Difference]: Finished difference. Result has 76 places, 66 transitions, 196 flow
[2024-03-09 02:46:28,162 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=217, PETRI_DIFFERENCE_MINUEND_FLOW=180, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=196, PETRI_PLACES=76, PETRI_TRANSITIONS=66}
[2024-03-09 02:46:28,163 INFO  L288   CegarLoopForPetriNet]: 66 programPoint places, 10 predicate places.
[2024-03-09 02:46:28,163 INFO  L495      AbstractCegarLoop]: Abstraction has has 76 places, 66 transitions, 196 flow
[2024-03-09 02:46:28,164 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 126.75) internal successors, (507), 4 states have internal predecessors, (507), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 02:46:28,164 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-03-09 02:46:28,164 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1]
[2024-03-09 02:46:28,164 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2024-03-09 02:46:28,164 INFO  L420      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (and 8 more)] ===
[2024-03-09 02:46:28,165 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-09 02:46:28,165 INFO  L85        PathProgramCache]: Analyzing trace with hash -1563206581, now seen corresponding path program 1 times
[2024-03-09 02:46:28,165 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-09 02:46:28,165 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1877726510]
[2024-03-09 02:46:28,166 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 02:46:28,166 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-09 02:46:28,193 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 02:46:28,330 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-09 02:46:28,331 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-09 02:46:28,331 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1877726510]
[2024-03-09 02:46:28,331 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1877726510] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-09 02:46:28,331 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-09 02:46:28,331 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-03-09 02:46:28,331 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [409879035]
[2024-03-09 02:46:28,332 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-09 02:46:28,332 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-03-09 02:46:28,332 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-09 02:46:28,332 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-03-09 02:46:28,333 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2024-03-09 02:46:28,575 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 107 out of 217
[2024-03-09 02:46:28,576 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 66 transitions, 196 flow. Second operand  has 6 states, 6 states have (on average 108.16666666666667) internal successors, (649), 6 states have internal predecessors, (649), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 02:46:28,576 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-09 02:46:28,576 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 217
[2024-03-09 02:46:28,577 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-09 02:46:28,693 INFO  L130       PetriNetUnfolder]: 56/263 cut-off events.
[2024-03-09 02:46:28,694 INFO  L131       PetriNetUnfolder]: For 23/23 co-relation queries the response was YES.
[2024-03-09 02:46:28,694 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 532 conditions, 263 events. 56/263 cut-off events. For 23/23 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 1164 event pairs, 34 based on Foata normal form. 0/251 useless extension candidates. Maximal degree in co-relation 429. Up to 106 conditions per place. 
[2024-03-09 02:46:28,695 INFO  L137   encePairwiseOnDemand]: 204/217 looper letters, 38 selfloop transitions, 6 changer transitions 5/76 dead transitions.
[2024-03-09 02:46:28,695 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 76 transitions, 316 flow
[2024-03-09 02:46:28,696 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-03-09 02:46:28,696 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-03-09 02:46:28,697 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 694 transitions.
[2024-03-09 02:46:28,698 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.533026113671275
[2024-03-09 02:46:28,698 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 694 transitions.
[2024-03-09 02:46:28,698 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 694 transitions.
[2024-03-09 02:46:28,698 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-09 02:46:28,698 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 694 transitions.
[2024-03-09 02:46:28,700 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 115.66666666666667) internal successors, (694), 6 states have internal predecessors, (694), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 02:46:28,702 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 217.0) internal successors, (1519), 7 states have internal predecessors, (1519), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 02:46:28,703 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 217.0) internal successors, (1519), 7 states have internal predecessors, (1519), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 02:46:28,703 INFO  L175             Difference]: Start difference. First operand has 76 places, 66 transitions, 196 flow. Second operand 6 states and 694 transitions.
[2024-03-09 02:46:28,703 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 76 transitions, 316 flow
[2024-03-09 02:46:28,704 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 76 transitions, 314 flow, removed 0 selfloop flow, removed 1 redundant places.
[2024-03-09 02:46:28,705 INFO  L231             Difference]: Finished difference. Result has 82 places, 63 transitions, 220 flow
[2024-03-09 02:46:28,705 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=217, PETRI_DIFFERENCE_MINUEND_FLOW=188, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=220, PETRI_PLACES=82, PETRI_TRANSITIONS=63}
[2024-03-09 02:46:28,706 INFO  L288   CegarLoopForPetriNet]: 66 programPoint places, 16 predicate places.
[2024-03-09 02:46:28,706 INFO  L495      AbstractCegarLoop]: Abstraction has has 82 places, 63 transitions, 220 flow
[2024-03-09 02:46:28,707 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 108.16666666666667) internal successors, (649), 6 states have internal predecessors, (649), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 02:46:28,707 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-03-09 02:46:28,707 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-09 02:46:28,707 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2024-03-09 02:46:28,707 INFO  L420      AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (and 8 more)] ===
[2024-03-09 02:46:28,708 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-09 02:46:28,708 INFO  L85        PathProgramCache]: Analyzing trace with hash 1686589458, now seen corresponding path program 1 times
[2024-03-09 02:46:28,708 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-09 02:46:28,708 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1649264998]
[2024-03-09 02:46:28,708 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 02:46:28,708 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-09 02:46:28,722 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 02:46:28,889 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-09 02:46:28,890 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-09 02:46:28,890 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1649264998]
[2024-03-09 02:46:28,890 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1649264998] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-09 02:46:28,890 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-09 02:46:28,890 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-03-09 02:46:28,890 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [569499539]
[2024-03-09 02:46:28,891 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-09 02:46:28,891 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-03-09 02:46:28,891 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-09 02:46:28,892 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-03-09 02:46:28,892 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2024-03-09 02:46:29,146 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 87 out of 217
[2024-03-09 02:46:29,147 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 63 transitions, 220 flow. Second operand  has 6 states, 6 states have (on average 88.66666666666667) internal successors, (532), 6 states have internal predecessors, (532), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 02:46:29,147 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-09 02:46:29,147 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 217
[2024-03-09 02:46:29,147 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-09 02:46:29,290 INFO  L130       PetriNetUnfolder]: 248/664 cut-off events.
[2024-03-09 02:46:29,291 INFO  L131       PetriNetUnfolder]: For 179/179 co-relation queries the response was YES.
[2024-03-09 02:46:29,292 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 1536 conditions, 664 events. 248/664 cut-off events. For 179/179 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 3155 event pairs, 205 based on Foata normal form. 0/649 useless extension candidates. Maximal degree in co-relation 1388. Up to 546 conditions per place. 
[2024-03-09 02:46:29,294 INFO  L137   encePairwiseOnDemand]: 207/217 looper letters, 60 selfloop transitions, 22 changer transitions 0/91 dead transitions.
[2024-03-09 02:46:29,294 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 91 transitions, 440 flow
[2024-03-09 02:46:29,295 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-03-09 02:46:29,295 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-03-09 02:46:29,296 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 600 transitions.
[2024-03-09 02:46:29,296 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.4608294930875576
[2024-03-09 02:46:29,296 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 600 transitions.
[2024-03-09 02:46:29,297 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 600 transitions.
[2024-03-09 02:46:29,297 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-09 02:46:29,297 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 600 transitions.
[2024-03-09 02:46:29,298 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 100.0) internal successors, (600), 6 states have internal predecessors, (600), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 02:46:29,300 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 217.0) internal successors, (1519), 7 states have internal predecessors, (1519), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 02:46:29,301 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 217.0) internal successors, (1519), 7 states have internal predecessors, (1519), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 02:46:29,301 INFO  L175             Difference]: Start difference. First operand has 82 places, 63 transitions, 220 flow. Second operand 6 states and 600 transitions.
[2024-03-09 02:46:29,301 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 91 transitions, 440 flow
[2024-03-09 02:46:29,303 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 91 transitions, 411 flow, removed 6 selfloop flow, removed 9 redundant places.
[2024-03-09 02:46:29,305 INFO  L231             Difference]: Finished difference. Result has 81 places, 83 transitions, 318 flow
[2024-03-09 02:46:29,305 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=217, PETRI_DIFFERENCE_MINUEND_FLOW=191, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=318, PETRI_PLACES=81, PETRI_TRANSITIONS=83}
[2024-03-09 02:46:29,306 INFO  L288   CegarLoopForPetriNet]: 66 programPoint places, 15 predicate places.
[2024-03-09 02:46:29,306 INFO  L495      AbstractCegarLoop]: Abstraction has has 81 places, 83 transitions, 318 flow
[2024-03-09 02:46:29,306 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 88.66666666666667) internal successors, (532), 6 states have internal predecessors, (532), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 02:46:29,306 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-03-09 02:46:29,306 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-09 02:46:29,307 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2024-03-09 02:46:29,307 INFO  L420      AbstractCegarLoop]: === Iteration 5 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (and 8 more)] ===
[2024-03-09 02:46:29,307 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-09 02:46:29,307 INFO  L85        PathProgramCache]: Analyzing trace with hash -922523745, now seen corresponding path program 1 times
[2024-03-09 02:46:29,307 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-09 02:46:29,308 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1730571243]
[2024-03-09 02:46:29,308 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 02:46:29,308 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-09 02:46:29,327 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 02:46:29,584 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-09 02:46:29,585 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-09 02:46:29,585 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1730571243]
[2024-03-09 02:46:29,585 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1730571243] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-09 02:46:29,585 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-09 02:46:29,585 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-03-09 02:46:29,586 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1178656375]
[2024-03-09 02:46:29,586 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-09 02:46:29,586 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-03-09 02:46:29,586 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-09 02:46:29,587 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-03-09 02:46:29,587 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2024-03-09 02:46:29,939 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 121 out of 217
[2024-03-09 02:46:29,940 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 83 transitions, 318 flow. Second operand  has 6 states, 6 states have (on average 123.83333333333333) internal successors, (743), 6 states have internal predecessors, (743), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 02:46:29,940 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-09 02:46:29,941 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 217
[2024-03-09 02:46:29,941 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-09 02:46:30,168 INFO  L130       PetriNetUnfolder]: 155/510 cut-off events.
[2024-03-09 02:46:30,169 INFO  L131       PetriNetUnfolder]: For 266/290 co-relation queries the response was YES.
[2024-03-09 02:46:30,169 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 1322 conditions, 510 events. 155/510 cut-off events. For 266/290 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 2586 event pairs, 24 based on Foata normal form. 0/486 useless extension candidates. Maximal degree in co-relation 1196. Up to 198 conditions per place. 
[2024-03-09 02:46:30,171 INFO  L137   encePairwiseOnDemand]: 207/217 looper letters, 78 selfloop transitions, 28 changer transitions 26/159 dead transitions.
[2024-03-09 02:46:30,171 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 159 transitions, 867 flow
[2024-03-09 02:46:30,172 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-03-09 02:46:30,172 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-03-09 02:46:30,173 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 827 transitions.
[2024-03-09 02:46:30,173 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.6351766513056836
[2024-03-09 02:46:30,173 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 827 transitions.
[2024-03-09 02:46:30,174 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 827 transitions.
[2024-03-09 02:46:30,174 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-09 02:46:30,174 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 827 transitions.
[2024-03-09 02:46:30,176 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 137.83333333333334) internal successors, (827), 6 states have internal predecessors, (827), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 02:46:30,177 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 217.0) internal successors, (1519), 7 states have internal predecessors, (1519), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 02:46:30,178 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 217.0) internal successors, (1519), 7 states have internal predecessors, (1519), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 02:46:30,178 INFO  L175             Difference]: Start difference. First operand has 81 places, 83 transitions, 318 flow. Second operand 6 states and 827 transitions.
[2024-03-09 02:46:30,178 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 159 transitions, 867 flow
[2024-03-09 02:46:30,180 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 159 transitions, 852 flow, removed 0 selfloop flow, removed 1 redundant places.
[2024-03-09 02:46:30,182 INFO  L231             Difference]: Finished difference. Result has 90 places, 96 transitions, 543 flow
[2024-03-09 02:46:30,182 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=217, PETRI_DIFFERENCE_MINUEND_FLOW=315, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=543, PETRI_PLACES=90, PETRI_TRANSITIONS=96}
[2024-03-09 02:46:30,183 INFO  L288   CegarLoopForPetriNet]: 66 programPoint places, 24 predicate places.
[2024-03-09 02:46:30,183 INFO  L495      AbstractCegarLoop]: Abstraction has has 90 places, 96 transitions, 543 flow
[2024-03-09 02:46:30,183 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 123.83333333333333) internal successors, (743), 6 states have internal predecessors, (743), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 02:46:30,184 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-03-09 02:46:30,184 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-09 02:46:30,184 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2024-03-09 02:46:30,184 INFO  L420      AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (and 8 more)] ===
[2024-03-09 02:46:30,184 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-09 02:46:30,184 INFO  L85        PathProgramCache]: Analyzing trace with hash -258605338, now seen corresponding path program 1 times
[2024-03-09 02:46:30,185 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-09 02:46:30,185 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1650515050]
[2024-03-09 02:46:30,185 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 02:46:30,185 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-09 02:46:30,206 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 02:46:30,456 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2024-03-09 02:46:30,456 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-09 02:46:30,456 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1650515050]
[2024-03-09 02:46:30,457 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1650515050] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-09 02:46:30,457 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-09 02:46:30,457 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-03-09 02:46:30,458 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1096889608]
[2024-03-09 02:46:30,458 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-09 02:46:30,458 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-03-09 02:46:30,459 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-09 02:46:30,459 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-03-09 02:46:30,459 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2024-03-09 02:46:30,869 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 117 out of 217
[2024-03-09 02:46:30,870 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 96 transitions, 543 flow. Second operand  has 6 states, 6 states have (on average 120.16666666666667) internal successors, (721), 6 states have internal predecessors, (721), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 02:46:30,870 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-09 02:46:30,870 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 217
[2024-03-09 02:46:30,870 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-09 02:46:30,983 INFO  L130       PetriNetUnfolder]: 87/375 cut-off events.
[2024-03-09 02:46:30,983 INFO  L131       PetriNetUnfolder]: For 415/446 co-relation queries the response was YES.
[2024-03-09 02:46:30,984 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 1106 conditions, 375 events. 87/375 cut-off events. For 415/446 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1830 event pairs, 22 based on Foata normal form. 7/377 useless extension candidates. Maximal degree in co-relation 984. Up to 165 conditions per place. 
[2024-03-09 02:46:30,985 INFO  L137   encePairwiseOnDemand]: 211/217 looper letters, 40 selfloop transitions, 0 changer transitions 21/103 dead transitions.
[2024-03-09 02:46:30,985 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 103 transitions, 679 flow
[2024-03-09 02:46:30,986 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-03-09 02:46:30,986 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-03-09 02:46:30,987 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 734 transitions.
[2024-03-09 02:46:30,988 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5637480798771122
[2024-03-09 02:46:30,988 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 734 transitions.
[2024-03-09 02:46:30,988 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 734 transitions.
[2024-03-09 02:46:30,988 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-09 02:46:30,988 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 734 transitions.
[2024-03-09 02:46:30,990 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 122.33333333333333) internal successors, (734), 6 states have internal predecessors, (734), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 02:46:30,991 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 217.0) internal successors, (1519), 7 states have internal predecessors, (1519), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 02:46:30,992 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 217.0) internal successors, (1519), 7 states have internal predecessors, (1519), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 02:46:30,992 INFO  L175             Difference]: Start difference. First operand has 90 places, 96 transitions, 543 flow. Second operand 6 states and 734 transitions.
[2024-03-09 02:46:30,992 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 103 transitions, 679 flow
[2024-03-09 02:46:30,994 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 103 transitions, 655 flow, removed 12 selfloop flow, removed 0 redundant places.
[2024-03-09 02:46:30,996 INFO  L231             Difference]: Finished difference. Result has 84 places, 82 transitions, 486 flow
[2024-03-09 02:46:30,996 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=217, PETRI_DIFFERENCE_MINUEND_FLOW=517, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=95, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=95, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=486, PETRI_PLACES=84, PETRI_TRANSITIONS=82}
[2024-03-09 02:46:30,996 INFO  L288   CegarLoopForPetriNet]: 66 programPoint places, 18 predicate places.
[2024-03-09 02:46:30,997 INFO  L495      AbstractCegarLoop]: Abstraction has has 84 places, 82 transitions, 486 flow
[2024-03-09 02:46:30,997 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 120.16666666666667) internal successors, (721), 6 states have internal predecessors, (721), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 02:46:30,997 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-03-09 02:46:30,997 INFO  L209   CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-09 02:46:30,998 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2024-03-09 02:46:30,998 INFO  L420      AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (and 8 more)] ===
[2024-03-09 02:46:30,998 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-09 02:46:30,998 INFO  L85        PathProgramCache]: Analyzing trace with hash 1523886304, now seen corresponding path program 1 times
[2024-03-09 02:46:30,998 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-09 02:46:30,999 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1171306312]
[2024-03-09 02:46:30,999 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 02:46:30,999 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-09 02:46:31,026 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 02:46:32,109 INFO  L134       CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-09 02:46:32,109 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-09 02:46:32,110 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1171306312]
[2024-03-09 02:46:32,110 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1171306312] provided 0 perfect and 1 imperfect interpolant sequences
[2024-03-09 02:46:32,110 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [825984386]
[2024-03-09 02:46:32,110 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 02:46:32,111 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-03-09 02:46:32,111 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2024-03-09 02:46:32,112 INFO  L229       MonitoredProcess]: Starting monitored process 2 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-03-09 02:46:32,117 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process
[2024-03-09 02:46:32,266 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 02:46:32,271 INFO  L263         TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 45 conjunts are in the unsatisfiable core
[2024-03-09 02:46:32,281 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2024-03-09 02:46:32,480 INFO  L321             Elim1Store]: treesize reduction 36, result has 23.4 percent of original size
[2024-03-09 02:46:32,481 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 50 treesize of output 49
[2024-03-09 02:46:32,863 INFO  L321             Elim1Store]: treesize reduction 36, result has 23.4 percent of original size
[2024-03-09 02:46:32,864 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 64 treesize of output 62
[2024-03-09 02:46:32,873 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-09 02:46:32,873 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20
[2024-03-09 02:46:33,046 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13
[2024-03-09 02:46:33,049 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12
[2024-03-09 02:46:33,105 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11
[2024-03-09 02:46:33,143 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27
[2024-03-09 02:46:33,210 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 42
[2024-03-09 02:46:33,265 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 57
[2024-03-09 02:46:33,326 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-09 02:46:33,327 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-09 02:46:33,328 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-09 02:46:33,329 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-09 02:46:33,332 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-09 02:46:33,332 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 59 treesize of output 67
[2024-03-09 02:46:33,377 INFO  L134       CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-09 02:46:33,378 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2024-03-09 02:46:34,827 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 24
[2024-03-09 02:46:36,936 WARN  L837   $PredicateComparison]: unable to prove that (forall ((v_ArrVal_407 (Array Int Int))) (not (= |c_ULTIMATE.start_main_~#is~0#1.base| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_407) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|)))) is different from false
[2024-03-09 02:46:37,062 INFO  L134       CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 5 not checked.
[2024-03-09 02:46:37,063 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [825984386] provided 0 perfect and 2 imperfect interpolant sequences
[2024-03-09 02:46:37,063 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-03-09 02:46:37,063 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 14, 15] total 44
[2024-03-09 02:46:37,064 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1511580601]
[2024-03-09 02:46:37,064 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-03-09 02:46:37,065 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 46 states
[2024-03-09 02:46:37,065 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-09 02:46:37,066 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants.
[2024-03-09 02:46:37,067 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=198, Invalid=1777, Unknown=9, NotChecked=86, Total=2070
[2024-03-09 02:46:37,488 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 48 out of 217
[2024-03-09 02:46:37,490 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 82 transitions, 486 flow. Second operand  has 46 states, 46 states have (on average 50.45652173913044) internal successors, (2321), 46 states have internal predecessors, (2321), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 02:46:37,490 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-09 02:46:37,490 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 48 of 217
[2024-03-09 02:46:37,490 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-09 02:46:40,281 INFO  L130       PetriNetUnfolder]: 444/1028 cut-off events.
[2024-03-09 02:46:40,282 INFO  L131       PetriNetUnfolder]: For 1223/1223 co-relation queries the response was YES.
[2024-03-09 02:46:40,283 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 3621 conditions, 1028 events. 444/1028 cut-off events. For 1223/1223 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 5036 event pairs, 10 based on Foata normal form. 0/1017 useless extension candidates. Maximal degree in co-relation 3601. Up to 240 conditions per place. 
[2024-03-09 02:46:40,288 INFO  L137   encePairwiseOnDemand]: 202/217 looper letters, 203 selfloop transitions, 46 changer transitions 0/250 dead transitions.
[2024-03-09 02:46:40,288 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 250 transitions, 1918 flow
[2024-03-09 02:46:40,288 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. 
[2024-03-09 02:46:40,289 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 19 states.
[2024-03-09 02:46:40,291 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 1057 transitions.
[2024-03-09 02:46:40,292 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.2563667232597623
[2024-03-09 02:46:40,292 INFO  L72            ComplementDD]: Start complementDD. Operand 19 states and 1057 transitions.
[2024-03-09 02:46:40,292 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 19 states and 1057 transitions.
[2024-03-09 02:46:40,293 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-09 02:46:40,293 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 19 states and 1057 transitions.
[2024-03-09 02:46:40,295 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 20 states, 19 states have (on average 55.63157894736842) internal successors, (1057), 19 states have internal predecessors, (1057), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 02:46:40,299 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 20 states, 20 states have (on average 217.0) internal successors, (4340), 20 states have internal predecessors, (4340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 02:46:40,300 INFO  L81            ComplementDD]: Finished complementDD. Result  has 20 states, 20 states have (on average 217.0) internal successors, (4340), 20 states have internal predecessors, (4340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 02:46:40,300 INFO  L175             Difference]: Start difference. First operand has 84 places, 82 transitions, 486 flow. Second operand 19 states and 1057 transitions.
[2024-03-09 02:46:40,300 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 250 transitions, 1918 flow
[2024-03-09 02:46:40,306 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 250 transitions, 1915 flow, removed 0 selfloop flow, removed 1 redundant places.
[2024-03-09 02:46:40,308 INFO  L231             Difference]: Finished difference. Result has 95 places, 122 transitions, 975 flow
[2024-03-09 02:46:40,309 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=217, PETRI_DIFFERENCE_MINUEND_FLOW=484, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=975, PETRI_PLACES=95, PETRI_TRANSITIONS=122}
[2024-03-09 02:46:40,309 INFO  L288   CegarLoopForPetriNet]: 66 programPoint places, 29 predicate places.
[2024-03-09 02:46:40,309 INFO  L495      AbstractCegarLoop]: Abstraction has has 95 places, 122 transitions, 975 flow
[2024-03-09 02:46:40,310 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 46 states, 46 states have (on average 50.45652173913044) internal successors, (2321), 46 states have internal predecessors, (2321), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 02:46:40,310 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-03-09 02:46:40,310 INFO  L209   CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-09 02:46:40,316 INFO  L540       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0
[2024-03-09 02:46:40,514 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-03-09 02:46:40,514 INFO  L420      AbstractCegarLoop]: === Iteration 8 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (and 8 more)] ===
[2024-03-09 02:46:40,515 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-09 02:46:40,515 INFO  L85        PathProgramCache]: Analyzing trace with hash 25350279, now seen corresponding path program 1 times
[2024-03-09 02:46:40,515 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-09 02:46:40,516 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1118920604]
[2024-03-09 02:46:40,516 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 02:46:40,516 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-09 02:46:40,557 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 02:46:41,755 INFO  L134       CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-09 02:46:41,755 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-09 02:46:41,755 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1118920604]
[2024-03-09 02:46:41,755 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1118920604] provided 0 perfect and 1 imperfect interpolant sequences
[2024-03-09 02:46:41,755 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [348334096]
[2024-03-09 02:46:41,755 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 02:46:41,755 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-03-09 02:46:41,756 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2024-03-09 02:46:41,757 INFO  L229       MonitoredProcess]: Starting monitored process 3 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-03-09 02:46:41,767 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process
[2024-03-09 02:46:41,910 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 02:46:41,912 INFO  L263         TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 58 conjunts are in the unsatisfiable core
[2024-03-09 02:46:41,921 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2024-03-09 02:46:42,106 INFO  L321             Elim1Store]: treesize reduction 36, result has 23.4 percent of original size
[2024-03-09 02:46:42,106 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 57 treesize of output 57
[2024-03-09 02:46:42,119 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-09 02:46:42,120 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20
[2024-03-09 02:46:42,542 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-09 02:46:42,543 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 21
[2024-03-09 02:46:42,580 INFO  L321             Elim1Store]: treesize reduction 36, result has 23.4 percent of original size
[2024-03-09 02:46:42,580 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 57 treesize of output 54
[2024-03-09 02:46:42,739 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7
[2024-03-09 02:46:42,799 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-09 02:46:42,800 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20
[2024-03-09 02:46:42,860 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-09 02:46:42,861 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-09 02:46:42,865 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32
[2024-03-09 02:46:42,936 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-09 02:46:42,937 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-09 02:46:42,937 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-09 02:46:42,938 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 44
[2024-03-09 02:46:43,078 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10
[2024-03-09 02:46:43,085 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12
[2024-03-09 02:46:43,091 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-09 02:46:43,092 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37
[2024-03-09 02:46:43,151 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-09 02:46:43,152 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37
[2024-03-09 02:46:43,188 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-09 02:46:43,189 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37
[2024-03-09 02:46:43,217 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-09 02:46:43,218 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37
[2024-03-09 02:46:43,309 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-09 02:46:43,310 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-09 02:46:43,311 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-09 02:46:43,313 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-09 02:46:43,314 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-09 02:46:43,314 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-09 02:46:43,315 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-09 02:46:43,317 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-09 02:46:43,318 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 50 treesize of output 58
[2024-03-09 02:46:43,362 INFO  L134       CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-09 02:46:43,362 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2024-03-09 02:46:43,573 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_#t~mem8#1.offset| (* |c_ULTIMATE.start_main_~i~1#1| 4)))) (and (forall ((v_ArrVal_599 (Array Int Int)) (v_ArrVal_600 Int)) (= (select (select (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_599))) (store .cse0 |c_ULTIMATE.start_main_#t~mem8#1.base| (store (select .cse0 |c_ULTIMATE.start_main_#t~mem8#1.base|) .cse1 v_ArrVal_600))) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) 0)) (forall ((v_ArrVal_599 (Array Int Int)) (v_ArrVal_600 Int)) (= (select (select (let ((.cse2 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_599))) (store .cse2 |c_ULTIMATE.start_main_#t~mem8#1.base| (store (select .cse2 |c_ULTIMATE.start_main_#t~mem8#1.base|) .cse1 v_ArrVal_600))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 1)) 0)) (forall ((v_ArrVal_599 (Array Int Int)) (v_ArrVal_600 Int)) (= (select (select (let ((.cse3 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_599))) (store .cse3 |c_ULTIMATE.start_main_#t~mem8#1.base| (store (select .cse3 |c_ULTIMATE.start_main_#t~mem8#1.base|) .cse1 v_ArrVal_600))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 2)) 0)) (forall ((v_ArrVal_599 (Array Int Int)) (v_ArrVal_600 Int)) (= (select (select (let ((.cse4 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_599))) (store .cse4 |c_ULTIMATE.start_main_#t~mem8#1.base| (store (select .cse4 |c_ULTIMATE.start_main_#t~mem8#1.base|) .cse1 v_ArrVal_600))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 3)) 0)))) is different from false
[2024-03-09 02:46:43,662 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)) (.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)) (.cse3 (* |c_ULTIMATE.start_main_~i~1#1| 4))) (and (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_33| Int)) (or (not (<= .cse0 |v_ULTIMATE.start_main_#t~mem8#1.offset_33|)) (forall ((v_ArrVal_599 (Array Int Int)) (v_ArrVal_600 Int)) (= (select (select (let ((.cse1 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_599))) (store .cse1 .cse2 (store (select .cse1 .cse2) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_33| .cse3) v_ArrVal_600))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 2)) 0)))) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_33| Int)) (or (not (<= .cse0 |v_ULTIMATE.start_main_#t~mem8#1.offset_33|)) (forall ((v_ArrVal_599 (Array Int Int)) (v_ArrVal_600 Int)) (= (select (select (let ((.cse4 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_599))) (store .cse4 .cse2 (store (select .cse4 .cse2) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_33| .cse3) v_ArrVal_600))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 1)) 0)))) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_33| Int)) (or (not (<= .cse0 |v_ULTIMATE.start_main_#t~mem8#1.offset_33|)) (forall ((v_ArrVal_599 (Array Int Int)) (v_ArrVal_600 Int)) (= (select (select (let ((.cse5 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_599))) (store .cse5 .cse2 (store (select .cse5 .cse2) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_33| .cse3) v_ArrVal_600))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 3)) 0)))) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_33| Int)) (or (not (<= .cse0 |v_ULTIMATE.start_main_#t~mem8#1.offset_33|)) (forall ((v_ArrVal_599 (Array Int Int)) (v_ArrVal_600 Int)) (= (select (select (let ((.cse6 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_599))) (store .cse6 .cse2 (store (select .cse6 .cse2) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_33| .cse3) v_ArrVal_600))) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) 0)))))) is different from false
[2024-03-09 02:46:45,714 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse3 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)) (.cse1 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)) (.cse0 (+ |c_ULTIMATE.start_main_~i~1#1| 1))) (and (forall ((|v_ULTIMATE.start_main_~i~1#1_62| Int)) (or (not (<= .cse0 |v_ULTIMATE.start_main_~i~1#1_62|)) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_33| Int)) (or (not (<= .cse1 |v_ULTIMATE.start_main_#t~mem8#1.offset_33|)) (forall ((v_ArrVal_599 (Array Int Int)) (v_ArrVal_600 Int)) (= (select (select (let ((.cse2 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_599))) (store .cse2 .cse3 (store (select .cse2 .cse3) (+ (* |v_ULTIMATE.start_main_~i~1#1_62| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_33|) v_ArrVal_600))) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) 0)))))) (forall ((|v_ULTIMATE.start_main_~i~1#1_62| Int)) (or (not (<= .cse0 |v_ULTIMATE.start_main_~i~1#1_62|)) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_33| Int)) (or (not (<= .cse1 |v_ULTIMATE.start_main_#t~mem8#1.offset_33|)) (forall ((v_ArrVal_599 (Array Int Int)) (v_ArrVal_600 Int)) (= (select (select (let ((.cse4 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_599))) (store .cse4 .cse3 (store (select .cse4 .cse3) (+ (* |v_ULTIMATE.start_main_~i~1#1_62| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_33|) v_ArrVal_600))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 1)) 0)))))) (forall ((|v_ULTIMATE.start_main_~i~1#1_62| Int)) (or (not (<= .cse0 |v_ULTIMATE.start_main_~i~1#1_62|)) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_33| Int)) (or (not (<= .cse1 |v_ULTIMATE.start_main_#t~mem8#1.offset_33|)) (forall ((v_ArrVal_599 (Array Int Int)) (v_ArrVal_600 Int)) (= (select (select (let ((.cse5 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_599))) (store .cse5 .cse3 (store (select .cse5 .cse3) (+ (* |v_ULTIMATE.start_main_~i~1#1_62| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_33|) v_ArrVal_600))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 3)) 0)))))) (forall ((|v_ULTIMATE.start_main_~i~1#1_62| Int)) (or (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_33| Int)) (or (forall ((v_ArrVal_599 (Array Int Int)) (v_ArrVal_600 Int)) (= 0 (select (select (let ((.cse6 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_599))) (store .cse6 .cse3 (store (select .cse6 .cse3) (+ (* |v_ULTIMATE.start_main_~i~1#1_62| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_33|) v_ArrVal_600))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 2)))) (not (<= .cse1 |v_ULTIMATE.start_main_#t~mem8#1.offset_33|)))) (not (<= .cse0 |v_ULTIMATE.start_main_~i~1#1_62|)))))) is different from false
[2024-03-09 02:46:47,777 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse6 (+ c_threadThread1of1ForFork0_~p~0.offset 3))) (let ((.cse0 (+ |c_ULTIMATE.start_main_~i~1#1| 1)) (.cse4 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)) (.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)) (.cse3 (store |c_#race| c_threadThread1of1ForFork0_~p~0.base (store (select |c_#race| c_threadThread1of1ForFork0_~p~0.base) .cse6 0)))) (and (forall ((|v_ULTIMATE.start_main_~i~1#1_62| Int)) (or (not (<= .cse0 |v_ULTIMATE.start_main_~i~1#1_62|)) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_33| Int)) (or (forall ((v_ArrVal_599 (Array Int Int)) (v_ArrVal_600 Int)) (= (select (select (let ((.cse1 (store .cse3 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_599))) (store .cse1 .cse2 (store (select .cse1 .cse2) (+ (* |v_ULTIMATE.start_main_~i~1#1_62| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_33|) v_ArrVal_600))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 2)) 0)) (not (<= .cse4 |v_ULTIMATE.start_main_#t~mem8#1.offset_33|)))))) (forall ((|v_ULTIMATE.start_main_~i~1#1_62| Int)) (or (not (<= .cse0 |v_ULTIMATE.start_main_~i~1#1_62|)) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_33| Int)) (or (not (<= .cse4 |v_ULTIMATE.start_main_#t~mem8#1.offset_33|)) (forall ((v_ArrVal_599 (Array Int Int)) (v_ArrVal_600 Int)) (= (select (select (let ((.cse5 (store .cse3 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_599))) (store .cse5 .cse2 (store (select .cse5 .cse2) (+ (* |v_ULTIMATE.start_main_~i~1#1_62| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_33|) v_ArrVal_600))) c_threadThread1of1ForFork0_~p~0.base) .cse6) 0)))))) (forall ((|v_ULTIMATE.start_main_~i~1#1_62| Int)) (or (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_33| Int)) (or (not (<= .cse4 |v_ULTIMATE.start_main_#t~mem8#1.offset_33|)) (forall ((v_ArrVal_599 (Array Int Int)) (v_ArrVal_600 Int)) (= (select (select (let ((.cse7 (store .cse3 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_599))) (store .cse7 .cse2 (store (select .cse7 .cse2) (+ (* |v_ULTIMATE.start_main_~i~1#1_62| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_33|) v_ArrVal_600))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 1)) 0)))) (not (<= .cse0 |v_ULTIMATE.start_main_~i~1#1_62|)))) (forall ((|v_ULTIMATE.start_main_~i~1#1_62| Int)) (or (not (<= .cse0 |v_ULTIMATE.start_main_~i~1#1_62|)) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_33| Int)) (or (not (<= .cse4 |v_ULTIMATE.start_main_#t~mem8#1.offset_33|)) (forall ((v_ArrVal_599 (Array Int Int)) (v_ArrVal_600 Int)) (= 0 (select (select (let ((.cse8 (store .cse3 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_599))) (store .cse8 .cse2 (store (select .cse8 .cse2) (+ (* |v_ULTIMATE.start_main_~i~1#1_62| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_33|) v_ArrVal_600))) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset)))))))))) is different from false
[2024-03-09 02:46:49,845 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse5 (+ c_threadThread1of1ForFork0_~p~0.offset 2)) (.cse9 (+ c_threadThread1of1ForFork0_~p~0.offset 3))) (let ((.cse1 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)) (.cse3 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)) (.cse4 (store |c_#race| c_threadThread1of1ForFork0_~p~0.base (store (store (select |c_#race| c_threadThread1of1ForFork0_~p~0.base) .cse5 0) .cse9 0))) (.cse0 (+ |c_ULTIMATE.start_main_~i~1#1| 1))) (and (forall ((|v_ULTIMATE.start_main_~i~1#1_62| Int)) (or (not (<= .cse0 |v_ULTIMATE.start_main_~i~1#1_62|)) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_33| Int)) (or (not (<= .cse1 |v_ULTIMATE.start_main_#t~mem8#1.offset_33|)) (forall ((v_ArrVal_599 (Array Int Int)) (v_ArrVal_600 Int)) (= (select (select (let ((.cse2 (store .cse4 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_599))) (store .cse2 .cse3 (store (select .cse2 .cse3) (+ (* |v_ULTIMATE.start_main_~i~1#1_62| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_33|) v_ArrVal_600))) c_threadThread1of1ForFork0_~p~0.base) .cse5) 0)))))) (forall ((|v_ULTIMATE.start_main_~i~1#1_62| Int)) (or (not (<= .cse0 |v_ULTIMATE.start_main_~i~1#1_62|)) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_33| Int)) (or (not (<= .cse1 |v_ULTIMATE.start_main_#t~mem8#1.offset_33|)) (forall ((v_ArrVal_599 (Array Int Int)) (v_ArrVal_600 Int)) (= (select (select (let ((.cse6 (store .cse4 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_599))) (store .cse6 .cse3 (store (select .cse6 .cse3) (+ (* |v_ULTIMATE.start_main_~i~1#1_62| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_33|) v_ArrVal_600))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 1)) 0)))))) (forall ((|v_ULTIMATE.start_main_~i~1#1_62| Int)) (or (not (<= .cse0 |v_ULTIMATE.start_main_~i~1#1_62|)) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_33| Int)) (or (not (<= .cse1 |v_ULTIMATE.start_main_#t~mem8#1.offset_33|)) (forall ((v_ArrVal_599 (Array Int Int)) (v_ArrVal_600 Int)) (= (select (select (let ((.cse7 (store .cse4 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_599))) (store .cse7 .cse3 (store (select .cse7 .cse3) (+ (* |v_ULTIMATE.start_main_~i~1#1_62| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_33|) v_ArrVal_600))) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) 0)))))) (forall ((|v_ULTIMATE.start_main_~i~1#1_62| Int)) (or (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_33| Int)) (or (not (<= .cse1 |v_ULTIMATE.start_main_#t~mem8#1.offset_33|)) (forall ((v_ArrVal_599 (Array Int Int)) (v_ArrVal_600 Int)) (= (select (select (let ((.cse8 (store .cse4 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_599))) (store .cse8 .cse3 (store (select .cse8 .cse3) (+ (* |v_ULTIMATE.start_main_~i~1#1_62| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_33|) v_ArrVal_600))) c_threadThread1of1ForFork0_~p~0.base) .cse9) 0)))) (not (<= .cse0 |v_ULTIMATE.start_main_~i~1#1_62|))))))) is different from false
[2024-03-09 02:46:51,336 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse8 (+ c_threadThread1of1ForFork0_~p~0.offset 1)) (.cse5 (+ c_threadThread1of1ForFork0_~p~0.offset 2)) (.cse10 (+ c_threadThread1of1ForFork0_~p~0.offset 3))) (let ((.cse1 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)) (.cse3 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)) (.cse4 (store |c_#race| c_threadThread1of1ForFork0_~p~0.base (store (store (store (select |c_#race| c_threadThread1of1ForFork0_~p~0.base) .cse8 0) .cse5 0) .cse10 0))) (.cse0 (+ |c_ULTIMATE.start_main_~i~1#1| 1))) (and (forall ((|v_ULTIMATE.start_main_~i~1#1_62| Int)) (or (not (<= .cse0 |v_ULTIMATE.start_main_~i~1#1_62|)) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_33| Int)) (or (not (<= .cse1 |v_ULTIMATE.start_main_#t~mem8#1.offset_33|)) (forall ((v_ArrVal_599 (Array Int Int)) (v_ArrVal_600 Int)) (= (select (select (let ((.cse2 (store .cse4 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_599))) (store .cse2 .cse3 (store (select .cse2 .cse3) (+ (* |v_ULTIMATE.start_main_~i~1#1_62| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_33|) v_ArrVal_600))) c_threadThread1of1ForFork0_~p~0.base) .cse5) 0)))))) (forall ((|v_ULTIMATE.start_main_~i~1#1_62| Int)) (or (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_33| Int)) (or (not (<= .cse1 |v_ULTIMATE.start_main_#t~mem8#1.offset_33|)) (forall ((v_ArrVal_599 (Array Int Int)) (v_ArrVal_600 Int)) (= (select (select (let ((.cse6 (store .cse4 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_599))) (store .cse6 .cse3 (store (select .cse6 .cse3) (+ (* |v_ULTIMATE.start_main_~i~1#1_62| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_33|) v_ArrVal_600))) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) 0)))) (not (<= .cse0 |v_ULTIMATE.start_main_~i~1#1_62|)))) (forall ((|v_ULTIMATE.start_main_~i~1#1_62| Int)) (or (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_33| Int)) (or (not (<= .cse1 |v_ULTIMATE.start_main_#t~mem8#1.offset_33|)) (forall ((v_ArrVal_599 (Array Int Int)) (v_ArrVal_600 Int)) (= (select (select (let ((.cse7 (store .cse4 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_599))) (store .cse7 .cse3 (store (select .cse7 .cse3) (+ (* |v_ULTIMATE.start_main_~i~1#1_62| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_33|) v_ArrVal_600))) c_threadThread1of1ForFork0_~p~0.base) .cse8) 0)))) (not (<= .cse0 |v_ULTIMATE.start_main_~i~1#1_62|)))) (forall ((|v_ULTIMATE.start_main_~i~1#1_62| Int)) (or (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_33| Int)) (or (not (<= .cse1 |v_ULTIMATE.start_main_#t~mem8#1.offset_33|)) (forall ((v_ArrVal_599 (Array Int Int)) (v_ArrVal_600 Int)) (= (select (select (let ((.cse9 (store .cse4 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_599))) (store .cse9 .cse3 (store (select .cse9 .cse3) (+ (* |v_ULTIMATE.start_main_~i~1#1_62| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_33|) v_ArrVal_600))) c_threadThread1of1ForFork0_~p~0.base) .cse10) 0)))) (not (<= .cse0 |v_ULTIMATE.start_main_~i~1#1_62|))))))) is different from false
[2024-03-09 02:46:51,381 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-09 02:46:51,382 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 81 treesize of output 74
[2024-03-09 02:46:51,395 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-09 02:46:51,395 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 248 treesize of output 236
[2024-03-09 02:46:51,406 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 230 treesize of output 214
[2024-03-09 02:46:51,436 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 120 treesize of output 112
[2024-03-09 02:46:51,516 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-09 02:46:51,516 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 215 treesize of output 193
[2024-03-09 02:46:51,687 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-09 02:46:51,688 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 81 treesize of output 74
[2024-03-09 02:46:51,695 INFO  L173   IndexEqualityManager]: detected equality via solver
[2024-03-09 02:46:51,709 INFO  L321             Elim1Store]: treesize reduction 8, result has 33.3 percent of original size
[2024-03-09 02:46:51,710 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 144 treesize of output 130
[2024-03-09 02:46:51,723 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 61
[2024-03-09 02:46:51,733 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 158 treesize of output 132
[2024-03-09 02:46:51,779 INFO  L321             Elim1Store]: treesize reduction 38, result has 2.6 percent of original size
[2024-03-09 02:46:51,779 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 81 treesize of output 1
[2024-03-09 02:46:51,790 INFO  L321             Elim1Store]: treesize reduction 38, result has 2.6 percent of original size
[2024-03-09 02:46:51,790 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 79 treesize of output 1
[2024-03-09 02:46:52,335 WARN  L837   $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_main_#t~mem12#1.base_28| Int) (v_ArrVal_584 (Array Int Int)) (v_ArrVal_585 (Array Int Int))) (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_584))) (or (forall ((v_ArrVal_587 (Array Int Int))) (not (= (select (select .cse0 |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|) (select (select (store .cse0 |v_ULTIMATE.start_main_#t~mem12#1.base_28| v_ArrVal_587) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)))) (forall ((v_ArrVal_586 (Array Int Int))) (let ((.cse1 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_585))) (< (select (select .cse1 |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|) (+ (select (select (store .cse1 |v_ULTIMATE.start_main_#t~mem12#1.base_28| v_ArrVal_586) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|) 1)))) (not (<= |v_ULTIMATE.start_main_#t~mem12#1.base_28| (select (select .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|)))))) (forall ((v_ArrVal_584 (Array Int Int))) (not (= |c_ULTIMATE.start_main_~#is~0#1.base| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_584) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|))))) is different from false
[2024-03-09 02:46:52,434 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|))) (and (forall ((|v_ULTIMATE.start_main_#t~mem12#1.base_28| Int) (v_ArrVal_584 (Array Int Int)) (v_ArrVal_585 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_584))) (or (forall ((v_ArrVal_586 (Array Int Int))) (let ((.cse0 (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_585))) (< (select (select .cse0 |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|) (+ (select (select (store .cse0 |v_ULTIMATE.start_main_#t~mem12#1.base_28| v_ArrVal_586) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|) 1)))) (forall ((v_ArrVal_587 (Array Int Int))) (not (= (select (select (store .cse2 |v_ULTIMATE.start_main_#t~mem12#1.base_28| v_ArrVal_587) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|) (select (select .cse2 |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)))) (not (<= |v_ULTIMATE.start_main_#t~mem12#1.base_28| (select (select .cse2 |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|)))))) (forall ((v_ArrVal_584 (Array Int Int))) (not (= |c_ULTIMATE.start_main_~#is~0#1.base| (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_584) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)))))) is different from false
[2024-03-09 02:46:52,438 INFO  L134       CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked.
[2024-03-09 02:46:52,438 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [348334096] provided 0 perfect and 2 imperfect interpolant sequences
[2024-03-09 02:46:52,438 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-03-09 02:46:52,439 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 15, 16] total 47
[2024-03-09 02:46:52,439 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1103069522]
[2024-03-09 02:46:52,439 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-03-09 02:46:52,440 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 49 states
[2024-03-09 02:46:52,440 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-09 02:46:52,440 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants.
[2024-03-09 02:46:52,441 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=213, Invalid=1449, Unknown=10, NotChecked=680, Total=2352
[2024-03-09 02:46:52,457 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 50 out of 217
[2024-03-09 02:46:52,460 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 122 transitions, 975 flow. Second operand  has 49 states, 49 states have (on average 52.30612244897959) internal successors, (2563), 49 states have internal predecessors, (2563), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 02:46:52,460 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-09 02:46:52,460 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 50 of 217
[2024-03-09 02:46:52,460 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-09 02:47:13,283 WARN  L233               SmtUtils]: Spent 6.08s on a formula simplification. DAG size of input: 86 DAG size of output: 40 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)
[2024-03-09 02:47:17,395 INFO  L130       PetriNetUnfolder]: 465/1121 cut-off events.
[2024-03-09 02:47:17,395 INFO  L131       PetriNetUnfolder]: For 2148/2148 co-relation queries the response was YES.
[2024-03-09 02:47:17,398 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 4453 conditions, 1121 events. 465/1121 cut-off events. For 2148/2148 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 5837 event pairs, 117 based on Foata normal form. 16/1126 useless extension candidates. Maximal degree in co-relation 4423. Up to 747 conditions per place. 
[2024-03-09 02:47:17,405 INFO  L137   encePairwiseOnDemand]: 195/217 looper letters, 189 selfloop transitions, 59 changer transitions 0/249 dead transitions.
[2024-03-09 02:47:17,405 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 249 transitions, 2221 flow
[2024-03-09 02:47:17,405 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. 
[2024-03-09 02:47:17,405 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 26 states.
[2024-03-09 02:47:17,409 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 1456 transitions.
[2024-03-09 02:47:17,409 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.25806451612903225
[2024-03-09 02:47:17,409 INFO  L72            ComplementDD]: Start complementDD. Operand 26 states and 1456 transitions.
[2024-03-09 02:47:17,409 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 26 states and 1456 transitions.
[2024-03-09 02:47:17,410 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-09 02:47:17,410 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 26 states and 1456 transitions.
[2024-03-09 02:47:17,413 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 27 states, 26 states have (on average 56.0) internal successors, (1456), 26 states have internal predecessors, (1456), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 02:47:17,417 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 27 states, 27 states have (on average 217.0) internal successors, (5859), 27 states have internal predecessors, (5859), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 02:47:17,418 INFO  L81            ComplementDD]: Finished complementDD. Result  has 27 states, 27 states have (on average 217.0) internal successors, (5859), 27 states have internal predecessors, (5859), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 02:47:17,418 INFO  L175             Difference]: Start difference. First operand has 95 places, 122 transitions, 975 flow. Second operand 26 states and 1456 transitions.
[2024-03-09 02:47:17,418 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 249 transitions, 2221 flow
[2024-03-09 02:47:17,426 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 249 transitions, 2192 flow, removed 0 selfloop flow, removed 3 redundant places.
[2024-03-09 02:47:17,429 INFO  L231             Difference]: Finished difference. Result has 125 places, 166 transitions, 1528 flow
[2024-03-09 02:47:17,429 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=217, PETRI_DIFFERENCE_MINUEND_FLOW=956, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=122, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=82, PETRI_DIFFERENCE_SUBTRAHEND_STATES=26, PETRI_FLOW=1528, PETRI_PLACES=125, PETRI_TRANSITIONS=166}
[2024-03-09 02:47:17,429 INFO  L288   CegarLoopForPetriNet]: 66 programPoint places, 59 predicate places.
[2024-03-09 02:47:17,429 INFO  L495      AbstractCegarLoop]: Abstraction has has 125 places, 166 transitions, 1528 flow
[2024-03-09 02:47:17,430 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 49 states, 49 states have (on average 52.30612244897959) internal successors, (2563), 49 states have internal predecessors, (2563), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 02:47:17,430 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-03-09 02:47:17,430 INFO  L209   CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-09 02:47:17,436 INFO  L552       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0
[2024-03-09 02:47:17,631 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,3 /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-03-09 02:47:17,632 INFO  L420      AbstractCegarLoop]: === Iteration 9 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (and 8 more)] ===
[2024-03-09 02:47:17,632 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-09 02:47:17,633 INFO  L85        PathProgramCache]: Analyzing trace with hash 1794755639, now seen corresponding path program 2 times
[2024-03-09 02:47:17,633 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-09 02:47:17,633 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2045720919]
[2024-03-09 02:47:17,634 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 02:47:17,634 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-09 02:47:17,671 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 02:47:18,969 INFO  L134       CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-09 02:47:18,969 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-09 02:47:18,969 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2045720919]
[2024-03-09 02:47:18,969 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2045720919] provided 0 perfect and 1 imperfect interpolant sequences
[2024-03-09 02:47:18,969 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1235292212]
[2024-03-09 02:47:18,969 INFO  L93    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2024-03-09 02:47:18,969 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-03-09 02:47:18,970 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2024-03-09 02:47:18,971 INFO  L229       MonitoredProcess]: Starting monitored process 4 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-03-09 02:47:18,977 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process
[2024-03-09 02:47:19,142 INFO  L228   tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2024-03-09 02:47:19,142 INFO  L229   tOrderPrioritization]: Conjunction of SSA is unsat
[2024-03-09 02:47:19,144 INFO  L263         TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 58 conjunts are in the unsatisfiable core
[2024-03-09 02:47:19,150 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2024-03-09 02:47:19,344 INFO  L321             Elim1Store]: treesize reduction 36, result has 23.4 percent of original size
[2024-03-09 02:47:19,344 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 57 treesize of output 57
[2024-03-09 02:47:19,352 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-09 02:47:19,353 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20
[2024-03-09 02:47:19,778 INFO  L321             Elim1Store]: treesize reduction 36, result has 23.4 percent of original size
[2024-03-09 02:47:19,778 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 57 treesize of output 54
[2024-03-09 02:47:19,789 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-09 02:47:19,790 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 21
[2024-03-09 02:47:19,982 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7
[2024-03-09 02:47:20,046 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-09 02:47:20,046 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20
[2024-03-09 02:47:20,105 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-09 02:47:20,106 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-09 02:47:20,107 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32
[2024-03-09 02:47:20,259 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10
[2024-03-09 02:47:20,265 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12
[2024-03-09 02:47:20,273 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-09 02:47:20,274 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 30
[2024-03-09 02:47:20,337 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-09 02:47:20,338 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 30
[2024-03-09 02:47:20,369 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-09 02:47:20,369 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 30
[2024-03-09 02:47:20,406 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-09 02:47:20,407 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 30
[2024-03-09 02:47:20,481 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-09 02:47:20,482 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-09 02:47:20,482 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-09 02:47:20,483 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 44
[2024-03-09 02:47:20,558 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-09 02:47:20,559 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-09 02:47:20,560 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-09 02:47:20,562 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-09 02:47:20,565 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-09 02:47:20,566 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-09 02:47:20,567 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-09 02:47:20,569 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-09 02:47:20,570 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 50 treesize of output 58
[2024-03-09 02:47:20,619 INFO  L134       CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-09 02:47:20,620 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2024-03-09 02:47:20,942 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_#t~mem8#1.offset| (* |c_ULTIMATE.start_main_~i~1#1| 4))) (.cse3 (+ c_threadThread1of1ForFork0_~p~0.offset 3))) (and (forall ((v_ArrVal_779 (Array Int Int)) (v_ArrVal_782 Int)) (= 0 (select (select (let ((.cse0 (let ((.cse2 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_779))) (store .cse2 c_threadThread1of1ForFork0_~p~0.base (store (select .cse2 c_threadThread1of1ForFork0_~p~0.base) .cse3 0))))) (store .cse0 |c_ULTIMATE.start_main_#t~mem8#1.base| (store (select .cse0 |c_ULTIMATE.start_main_#t~mem8#1.base|) .cse1 v_ArrVal_782))) c_threadThread1of1ForFork0_~p~0.base) .cse3))) (forall ((v_ArrVal_779 (Array Int Int)) (v_ArrVal_782 Int)) (= (select (select (let ((.cse4 (let ((.cse5 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_779))) (store .cse5 c_threadThread1of1ForFork0_~p~0.base (store (select .cse5 c_threadThread1of1ForFork0_~p~0.base) .cse3 0))))) (store .cse4 |c_ULTIMATE.start_main_#t~mem8#1.base| (store (select .cse4 |c_ULTIMATE.start_main_#t~mem8#1.base|) .cse1 v_ArrVal_782))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 2)) 0)) (forall ((v_ArrVal_779 (Array Int Int)) (v_ArrVal_782 Int)) (= (select (select (let ((.cse6 (let ((.cse7 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_779))) (store .cse7 c_threadThread1of1ForFork0_~p~0.base (store (select .cse7 c_threadThread1of1ForFork0_~p~0.base) .cse3 0))))) (store .cse6 |c_ULTIMATE.start_main_#t~mem8#1.base| (store (select .cse6 |c_ULTIMATE.start_main_#t~mem8#1.base|) .cse1 v_ArrVal_782))) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) 0)) (forall ((v_ArrVal_779 (Array Int Int)) (v_ArrVal_782 Int)) (= 0 (select (select (let ((.cse8 (let ((.cse9 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_779))) (store .cse9 c_threadThread1of1ForFork0_~p~0.base (store (select .cse9 c_threadThread1of1ForFork0_~p~0.base) .cse3 0))))) (store .cse8 |c_ULTIMATE.start_main_#t~mem8#1.base| (store (select .cse8 |c_ULTIMATE.start_main_#t~mem8#1.base|) .cse1 v_ArrVal_782))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 1)))))) is different from false
[2024-03-09 02:47:21,018 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)) (.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)) (.cse3 (* |c_ULTIMATE.start_main_~i~1#1| 4)) (.cse5 (+ c_threadThread1of1ForFork0_~p~0.offset 3))) (and (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_35| Int)) (or (not (<= .cse0 |v_ULTIMATE.start_main_#t~mem8#1.offset_35|)) (forall ((v_ArrVal_779 (Array Int Int)) (v_ArrVal_782 Int)) (= (select (select (let ((.cse1 (let ((.cse4 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_779))) (store .cse4 c_threadThread1of1ForFork0_~p~0.base (store (select .cse4 c_threadThread1of1ForFork0_~p~0.base) .cse5 0))))) (store .cse1 .cse2 (store (select .cse1 .cse2) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_35| .cse3) v_ArrVal_782))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 2)) 0)))) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_35| Int)) (or (not (<= .cse0 |v_ULTIMATE.start_main_#t~mem8#1.offset_35|)) (forall ((v_ArrVal_779 (Array Int Int)) (v_ArrVal_782 Int)) (= (select (select (let ((.cse6 (let ((.cse7 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_779))) (store .cse7 c_threadThread1of1ForFork0_~p~0.base (store (select .cse7 c_threadThread1of1ForFork0_~p~0.base) .cse5 0))))) (store .cse6 .cse2 (store (select .cse6 .cse2) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_35| .cse3) v_ArrVal_782))) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) 0)))) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_35| Int)) (or (not (<= .cse0 |v_ULTIMATE.start_main_#t~mem8#1.offset_35|)) (forall ((v_ArrVal_779 (Array Int Int)) (v_ArrVal_782 Int)) (= (select (select (let ((.cse8 (let ((.cse9 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_779))) (store .cse9 c_threadThread1of1ForFork0_~p~0.base (store (select .cse9 c_threadThread1of1ForFork0_~p~0.base) .cse5 0))))) (store .cse8 .cse2 (store (select .cse8 .cse2) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_35| .cse3) v_ArrVal_782))) c_threadThread1of1ForFork0_~p~0.base) .cse5) 0)))) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_35| Int)) (or (not (<= .cse0 |v_ULTIMATE.start_main_#t~mem8#1.offset_35|)) (forall ((v_ArrVal_779 (Array Int Int)) (v_ArrVal_782 Int)) (= (select (select (let ((.cse10 (let ((.cse11 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_779))) (store .cse11 c_threadThread1of1ForFork0_~p~0.base (store (select .cse11 c_threadThread1of1ForFork0_~p~0.base) .cse5 0))))) (store .cse10 .cse2 (store (select .cse10 .cse2) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_35| .cse3) v_ArrVal_782))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 1)) 0)))))) is different from false
[2024-03-09 02:47:23,081 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)) (.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)) (.cse4 (+ c_threadThread1of1ForFork0_~p~0.offset 3)) (.cse5 (+ |c_ULTIMATE.start_main_~i~1#1| 1))) (and (forall ((|v_ULTIMATE.start_main_~i~1#1_64| Int)) (or (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_35| Int)) (or (not (<= .cse0 |v_ULTIMATE.start_main_#t~mem8#1.offset_35|)) (forall ((v_ArrVal_779 (Array Int Int)) (v_ArrVal_782 Int)) (= (select (select (let ((.cse1 (let ((.cse3 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_779))) (store .cse3 c_threadThread1of1ForFork0_~p~0.base (store (select .cse3 c_threadThread1of1ForFork0_~p~0.base) .cse4 0))))) (store .cse1 .cse2 (store (select .cse1 .cse2) (+ (* |v_ULTIMATE.start_main_~i~1#1_64| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_35|) v_ArrVal_782))) c_threadThread1of1ForFork0_~p~0.base) .cse4) 0)))) (not (<= .cse5 |v_ULTIMATE.start_main_~i~1#1_64|)))) (forall ((|v_ULTIMATE.start_main_~i~1#1_64| Int)) (or (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_35| Int)) (or (not (<= .cse0 |v_ULTIMATE.start_main_#t~mem8#1.offset_35|)) (forall ((v_ArrVal_779 (Array Int Int)) (v_ArrVal_782 Int)) (= (select (select (let ((.cse6 (let ((.cse7 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_779))) (store .cse7 c_threadThread1of1ForFork0_~p~0.base (store (select .cse7 c_threadThread1of1ForFork0_~p~0.base) .cse4 0))))) (store .cse6 .cse2 (store (select .cse6 .cse2) (+ (* |v_ULTIMATE.start_main_~i~1#1_64| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_35|) v_ArrVal_782))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 2)) 0)))) (not (<= .cse5 |v_ULTIMATE.start_main_~i~1#1_64|)))) (forall ((|v_ULTIMATE.start_main_~i~1#1_64| Int)) (or (not (<= .cse5 |v_ULTIMATE.start_main_~i~1#1_64|)) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_35| Int)) (or (not (<= .cse0 |v_ULTIMATE.start_main_#t~mem8#1.offset_35|)) (forall ((v_ArrVal_779 (Array Int Int)) (v_ArrVal_782 Int)) (= (select (select (let ((.cse8 (let ((.cse9 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_779))) (store .cse9 c_threadThread1of1ForFork0_~p~0.base (store (select .cse9 c_threadThread1of1ForFork0_~p~0.base) .cse4 0))))) (store .cse8 .cse2 (store (select .cse8 .cse2) (+ (* |v_ULTIMATE.start_main_~i~1#1_64| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_35|) v_ArrVal_782))) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) 0)))))) (forall ((|v_ULTIMATE.start_main_~i~1#1_64| Int)) (or (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_35| Int)) (or (not (<= .cse0 |v_ULTIMATE.start_main_#t~mem8#1.offset_35|)) (forall ((v_ArrVal_779 (Array Int Int)) (v_ArrVal_782 Int)) (= (select (select (let ((.cse10 (let ((.cse11 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_779))) (store .cse11 c_threadThread1of1ForFork0_~p~0.base (store (select .cse11 c_threadThread1of1ForFork0_~p~0.base) .cse4 0))))) (store .cse10 .cse2 (store (select .cse10 .cse2) (+ (* |v_ULTIMATE.start_main_~i~1#1_64| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_35|) v_ArrVal_782))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 1)) 0)))) (not (<= .cse5 |v_ULTIMATE.start_main_~i~1#1_64|)))))) is different from false
[2024-03-09 02:47:25,170 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse6 (+ c_threadThread1of1ForFork0_~p~0.offset 2))) (let ((.cse0 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)) (.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)) (.cse4 (+ c_threadThread1of1ForFork0_~p~0.offset 3)) (.cse5 (store |c_#race| c_threadThread1of1ForFork0_~p~0.base (store (select |c_#race| c_threadThread1of1ForFork0_~p~0.base) .cse6 0))) (.cse7 (+ |c_ULTIMATE.start_main_~i~1#1| 1))) (and (forall ((|v_ULTIMATE.start_main_~i~1#1_64| Int)) (or (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_35| Int)) (or (not (<= .cse0 |v_ULTIMATE.start_main_#t~mem8#1.offset_35|)) (forall ((v_ArrVal_779 (Array Int Int)) (v_ArrVal_782 Int)) (= (select (select (let ((.cse1 (let ((.cse3 (store .cse5 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_779))) (store .cse3 c_threadThread1of1ForFork0_~p~0.base (store (select .cse3 c_threadThread1of1ForFork0_~p~0.base) .cse4 0))))) (store .cse1 .cse2 (store (select .cse1 .cse2) (+ (* |v_ULTIMATE.start_main_~i~1#1_64| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_35|) v_ArrVal_782))) c_threadThread1of1ForFork0_~p~0.base) .cse6) 0)))) (not (<= .cse7 |v_ULTIMATE.start_main_~i~1#1_64|)))) (forall ((|v_ULTIMATE.start_main_~i~1#1_64| Int)) (or (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_35| Int)) (or (not (<= .cse0 |v_ULTIMATE.start_main_#t~mem8#1.offset_35|)) (forall ((v_ArrVal_779 (Array Int Int)) (v_ArrVal_782 Int)) (= (select (select (let ((.cse8 (let ((.cse9 (store .cse5 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_779))) (store .cse9 c_threadThread1of1ForFork0_~p~0.base (store (select .cse9 c_threadThread1of1ForFork0_~p~0.base) .cse4 0))))) (store .cse8 .cse2 (store (select .cse8 .cse2) (+ (* |v_ULTIMATE.start_main_~i~1#1_64| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_35|) v_ArrVal_782))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 1)) 0)))) (not (<= .cse7 |v_ULTIMATE.start_main_~i~1#1_64|)))) (forall ((|v_ULTIMATE.start_main_~i~1#1_64| Int)) (or (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_35| Int)) (or (not (<= .cse0 |v_ULTIMATE.start_main_#t~mem8#1.offset_35|)) (forall ((v_ArrVal_779 (Array Int Int)) (v_ArrVal_782 Int)) (= (select (select (let ((.cse10 (let ((.cse11 (store .cse5 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_779))) (store .cse11 c_threadThread1of1ForFork0_~p~0.base (store (select .cse11 c_threadThread1of1ForFork0_~p~0.base) .cse4 0))))) (store .cse10 .cse2 (store (select .cse10 .cse2) (+ (* |v_ULTIMATE.start_main_~i~1#1_64| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_35|) v_ArrVal_782))) c_threadThread1of1ForFork0_~p~0.base) .cse4) 0)))) (not (<= .cse7 |v_ULTIMATE.start_main_~i~1#1_64|)))) (forall ((|v_ULTIMATE.start_main_~i~1#1_64| Int)) (or (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_35| Int)) (or (not (<= .cse0 |v_ULTIMATE.start_main_#t~mem8#1.offset_35|)) (forall ((v_ArrVal_779 (Array Int Int)) (v_ArrVal_782 Int)) (= (select (select (let ((.cse12 (let ((.cse13 (store .cse5 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_779))) (store .cse13 c_threadThread1of1ForFork0_~p~0.base (store (select .cse13 c_threadThread1of1ForFork0_~p~0.base) .cse4 0))))) (store .cse12 .cse2 (store (select .cse12 .cse2) (+ (* |v_ULTIMATE.start_main_~i~1#1_64| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_35|) v_ArrVal_782))) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) 0)))) (not (<= .cse7 |v_ULTIMATE.start_main_~i~1#1_64|))))))) is different from false
[2024-03-09 02:47:27,256 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse14 (+ c_threadThread1of1ForFork0_~p~0.offset 1)) (.cse9 (+ c_threadThread1of1ForFork0_~p~0.offset 2))) (let ((.cse0 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)) (.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)) (.cse4 (+ c_threadThread1of1ForFork0_~p~0.offset 3)) (.cse5 (store |c_#race| c_threadThread1of1ForFork0_~p~0.base (store (store (select |c_#race| c_threadThread1of1ForFork0_~p~0.base) .cse14 0) .cse9 0))) (.cse6 (+ |c_ULTIMATE.start_main_~i~1#1| 1))) (and (forall ((|v_ULTIMATE.start_main_~i~1#1_64| Int)) (or (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_35| Int)) (or (not (<= .cse0 |v_ULTIMATE.start_main_#t~mem8#1.offset_35|)) (forall ((v_ArrVal_779 (Array Int Int)) (v_ArrVal_782 Int)) (= (select (select (let ((.cse1 (let ((.cse3 (store .cse5 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_779))) (store .cse3 c_threadThread1of1ForFork0_~p~0.base (store (select .cse3 c_threadThread1of1ForFork0_~p~0.base) .cse4 0))))) (store .cse1 .cse2 (store (select .cse1 .cse2) (+ (* |v_ULTIMATE.start_main_~i~1#1_64| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_35|) v_ArrVal_782))) c_threadThread1of1ForFork0_~p~0.base) .cse4) 0)))) (not (<= .cse6 |v_ULTIMATE.start_main_~i~1#1_64|)))) (forall ((|v_ULTIMATE.start_main_~i~1#1_64| Int)) (or (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_35| Int)) (or (not (<= .cse0 |v_ULTIMATE.start_main_#t~mem8#1.offset_35|)) (forall ((v_ArrVal_779 (Array Int Int)) (v_ArrVal_782 Int)) (= (select (select (let ((.cse7 (let ((.cse8 (store .cse5 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_779))) (store .cse8 c_threadThread1of1ForFork0_~p~0.base (store (select .cse8 c_threadThread1of1ForFork0_~p~0.base) .cse4 0))))) (store .cse7 .cse2 (store (select .cse7 .cse2) (+ (* |v_ULTIMATE.start_main_~i~1#1_64| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_35|) v_ArrVal_782))) c_threadThread1of1ForFork0_~p~0.base) .cse9) 0)))) (not (<= .cse6 |v_ULTIMATE.start_main_~i~1#1_64|)))) (forall ((|v_ULTIMATE.start_main_~i~1#1_64| Int)) (or (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_35| Int)) (or (not (<= .cse0 |v_ULTIMATE.start_main_#t~mem8#1.offset_35|)) (forall ((v_ArrVal_779 (Array Int Int)) (v_ArrVal_782 Int)) (= (select (select (let ((.cse10 (let ((.cse11 (store .cse5 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_779))) (store .cse11 c_threadThread1of1ForFork0_~p~0.base (store (select .cse11 c_threadThread1of1ForFork0_~p~0.base) .cse4 0))))) (store .cse10 .cse2 (store (select .cse10 .cse2) (+ (* |v_ULTIMATE.start_main_~i~1#1_64| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_35|) v_ArrVal_782))) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) 0)))) (not (<= .cse6 |v_ULTIMATE.start_main_~i~1#1_64|)))) (forall ((|v_ULTIMATE.start_main_~i~1#1_64| Int)) (or (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_35| Int)) (or (not (<= .cse0 |v_ULTIMATE.start_main_#t~mem8#1.offset_35|)) (forall ((v_ArrVal_779 (Array Int Int)) (v_ArrVal_782 Int)) (= (select (select (let ((.cse12 (let ((.cse13 (store .cse5 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_779))) (store .cse13 c_threadThread1of1ForFork0_~p~0.base (store (select .cse13 c_threadThread1of1ForFork0_~p~0.base) .cse4 0))))) (store .cse12 .cse2 (store (select .cse12 .cse2) (+ (* |v_ULTIMATE.start_main_~i~1#1_64| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_35|) v_ArrVal_782))) c_threadThread1of1ForFork0_~p~0.base) .cse14) 0)))) (not (<= .cse6 |v_ULTIMATE.start_main_~i~1#1_64|))))))) is different from false
[2024-03-09 02:47:27,297 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-09 02:47:27,297 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 133 treesize of output 90
[2024-03-09 02:47:27,320 INFO  L321             Elim1Store]: treesize reduction 8, result has 33.3 percent of original size
[2024-03-09 02:47:27,320 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 646 treesize of output 618
[2024-03-09 02:47:27,340 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 456 treesize of output 448
[2024-03-09 02:47:27,362 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 434 treesize of output 416
[2024-03-09 02:47:27,524 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-09 02:47:27,525 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 133 treesize of output 90
[2024-03-09 02:47:27,552 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-09 02:47:27,552 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 758 treesize of output 722
[2024-03-09 02:47:27,572 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 768 treesize of output 732
[2024-03-09 02:47:28,142 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 13
[2024-03-09 02:47:28,153 INFO  L321             Elim1Store]: treesize reduction 28, result has 3.4 percent of original size
[2024-03-09 02:47:28,153 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 131 treesize of output 1
[2024-03-09 02:47:28,166 INFO  L321             Elim1Store]: treesize reduction 28, result has 3.4 percent of original size
[2024-03-09 02:47:28,166 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 133 treesize of output 1
[2024-03-09 02:47:28,730 WARN  L837   $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_767 (Array Int Int))) (not (= |c_ULTIMATE.start_main_~#is~0#1.base| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_767) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)))) (forall ((v_ArrVal_766 (Array Int Int)) (v_ArrVal_767 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem12#1.base_30| Int)) (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_767))) (or (forall ((v_ArrVal_768 (Array Int Int))) (not (= (select (select .cse0 |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|) (select (select (store .cse0 |v_ULTIMATE.start_main_#t~mem12#1.base_30| v_ArrVal_768) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)))) (not (<= |v_ULTIMATE.start_main_#t~mem12#1.base_30| (select (select .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (forall ((v_ArrVal_769 (Array Int Int))) (let ((.cse1 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_766))) (< (select (select .cse1 |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|) (+ (select (select (store .cse1 |v_ULTIMATE.start_main_#t~mem12#1.base_30| v_ArrVal_769) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|) 1)))))))) is different from false
[2024-03-09 02:47:28,831 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|))) (and (forall ((v_ArrVal_766 (Array Int Int)) (v_ArrVal_767 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem12#1.base_30| Int)) (let ((.cse0 (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_767))) (or (not (<= |v_ULTIMATE.start_main_#t~mem12#1.base_30| (select (select .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (forall ((v_ArrVal_769 (Array Int Int))) (let ((.cse1 (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_766))) (< (select (select .cse1 |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|) (+ 1 (select (select (store .cse1 |v_ULTIMATE.start_main_#t~mem12#1.base_30| v_ArrVal_769) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|))))) (forall ((v_ArrVal_768 (Array Int Int))) (not (= (select (select (store .cse0 |v_ULTIMATE.start_main_#t~mem12#1.base_30| v_ArrVal_768) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|) (select (select .cse0 |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|))))))) (forall ((v_ArrVal_767 (Array Int Int))) (not (= |c_ULTIMATE.start_main_~#is~0#1.base| (select (select (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_767) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)))))) is different from false
[2024-03-09 02:47:28,834 INFO  L134       CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked.
[2024-03-09 02:47:28,834 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1235292212] provided 0 perfect and 2 imperfect interpolant sequences
[2024-03-09 02:47:28,834 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-03-09 02:47:28,834 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 15, 16] total 47
[2024-03-09 02:47:28,834 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [600461970]
[2024-03-09 02:47:28,834 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-03-09 02:47:28,835 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 49 states
[2024-03-09 02:47:28,835 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-09 02:47:28,836 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants.
[2024-03-09 02:47:28,837 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=1551, Unknown=9, NotChecked=602, Total=2352
[2024-03-09 02:47:28,870 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 50 out of 217
[2024-03-09 02:47:28,873 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 125 places, 166 transitions, 1528 flow. Second operand  has 49 states, 49 states have (on average 52.30612244897959) internal successors, (2563), 49 states have internal predecessors, (2563), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 02:47:28,873 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-09 02:47:28,873 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 50 of 217
[2024-03-09 02:47:28,873 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-09 02:47:55,313 WARN  L233               SmtUtils]: Spent 8.52s on a formula simplification. DAG size of input: 75 DAG size of output: 58 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)
[2024-03-09 02:47:58,774 INFO  L130       PetriNetUnfolder]: 512/1267 cut-off events.
[2024-03-09 02:47:58,775 INFO  L131       PetriNetUnfolder]: For 4567/4567 co-relation queries the response was YES.
[2024-03-09 02:47:58,780 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 5900 conditions, 1267 events. 512/1267 cut-off events. For 4567/4567 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 7007 event pairs, 122 based on Foata normal form. 20/1287 useless extension candidates. Maximal degree in co-relation 5864. Up to 748 conditions per place. 
[2024-03-09 02:47:58,786 INFO  L137   encePairwiseOnDemand]: 195/217 looper letters, 224 selfloop transitions, 76 changer transitions 0/301 dead transitions.
[2024-03-09 02:47:58,786 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 153 places, 301 transitions, 3071 flow
[2024-03-09 02:47:58,787 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. 
[2024-03-09 02:47:58,787 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 29 states.
[2024-03-09 02:47:58,790 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 1627 transitions.
[2024-03-09 02:47:58,790 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.25854123629429526
[2024-03-09 02:47:58,790 INFO  L72            ComplementDD]: Start complementDD. Operand 29 states and 1627 transitions.
[2024-03-09 02:47:58,790 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 29 states and 1627 transitions.
[2024-03-09 02:47:58,791 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-09 02:47:58,791 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 29 states and 1627 transitions.
[2024-03-09 02:47:58,794 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 30 states, 29 states have (on average 56.10344827586207) internal successors, (1627), 29 states have internal predecessors, (1627), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 02:47:58,799 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 30 states, 30 states have (on average 217.0) internal successors, (6510), 30 states have internal predecessors, (6510), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 02:47:58,799 INFO  L81            ComplementDD]: Finished complementDD. Result  has 30 states, 30 states have (on average 217.0) internal successors, (6510), 30 states have internal predecessors, (6510), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 02:47:58,800 INFO  L175             Difference]: Start difference. First operand has 125 places, 166 transitions, 1528 flow. Second operand 29 states and 1627 transitions.
[2024-03-09 02:47:58,800 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 153 places, 301 transitions, 3071 flow
[2024-03-09 02:47:58,816 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 145 places, 301 transitions, 3013 flow, removed 17 selfloop flow, removed 8 redundant places.
[2024-03-09 02:47:58,820 INFO  L231             Difference]: Finished difference. Result has 158 places, 197 transitions, 2103 flow
[2024-03-09 02:47:58,820 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=217, PETRI_DIFFERENCE_MINUEND_FLOW=1474, PETRI_DIFFERENCE_MINUEND_PLACES=117, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=166, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=46, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=98, PETRI_DIFFERENCE_SUBTRAHEND_STATES=29, PETRI_FLOW=2103, PETRI_PLACES=158, PETRI_TRANSITIONS=197}
[2024-03-09 02:47:58,820 INFO  L288   CegarLoopForPetriNet]: 66 programPoint places, 92 predicate places.
[2024-03-09 02:47:58,821 INFO  L495      AbstractCegarLoop]: Abstraction has has 158 places, 197 transitions, 2103 flow
[2024-03-09 02:47:58,822 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 49 states, 49 states have (on average 52.30612244897959) internal successors, (2563), 49 states have internal predecessors, (2563), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 02:47:58,822 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-03-09 02:47:58,822 INFO  L209   CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-09 02:47:58,829 INFO  L552       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0
[2024-03-09 02:47:59,022 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-03-09 02:47:59,023 INFO  L420      AbstractCegarLoop]: === Iteration 10 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (and 8 more)] ===
[2024-03-09 02:47:59,023 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-09 02:47:59,024 INFO  L85        PathProgramCache]: Analyzing trace with hash -220015865, now seen corresponding path program 3 times
[2024-03-09 02:47:59,024 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-09 02:47:59,024 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [657609730]
[2024-03-09 02:47:59,024 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 02:47:59,024 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-09 02:47:59,050 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 02:48:00,149 INFO  L134       CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-09 02:48:00,149 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-09 02:48:00,149 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [657609730]
[2024-03-09 02:48:00,150 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [657609730] provided 0 perfect and 1 imperfect interpolant sequences
[2024-03-09 02:48:00,150 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1005755434]
[2024-03-09 02:48:00,150 INFO  L93    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2
[2024-03-09 02:48:00,150 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-03-09 02:48:00,150 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2024-03-09 02:48:00,152 INFO  L229       MonitoredProcess]: Starting monitored process 5 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-03-09 02:48:00,153 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process
[2024-03-09 02:48:00,384 INFO  L228   tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s)
[2024-03-09 02:48:00,384 INFO  L229   tOrderPrioritization]: Conjunction of SSA is unsat
[2024-03-09 02:48:00,387 INFO  L263         TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 56 conjunts are in the unsatisfiable core
[2024-03-09 02:48:00,394 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2024-03-09 02:48:00,699 INFO  L321             Elim1Store]: treesize reduction 36, result has 23.4 percent of original size
[2024-03-09 02:48:00,700 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 57 treesize of output 57
[2024-03-09 02:48:00,707 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-09 02:48:00,708 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20
[2024-03-09 02:48:01,244 INFO  L321             Elim1Store]: treesize reduction 36, result has 23.4 percent of original size
[2024-03-09 02:48:01,244 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 57 treesize of output 54
[2024-03-09 02:48:01,253 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-09 02:48:01,254 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 21
[2024-03-09 02:48:01,533 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12
[2024-03-09 02:48:01,538 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10
[2024-03-09 02:48:01,608 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7
[2024-03-09 02:48:01,649 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-09 02:48:01,650 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20
[2024-03-09 02:48:01,709 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-09 02:48:01,710 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-09 02:48:01,711 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32
[2024-03-09 02:48:01,782 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-09 02:48:01,783 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-09 02:48:01,784 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-09 02:48:01,784 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 44
[2024-03-09 02:48:01,875 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-09 02:48:01,877 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-09 02:48:01,879 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-09 02:48:01,880 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-09 02:48:01,882 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-09 02:48:01,883 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-09 02:48:01,884 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-09 02:48:01,887 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-09 02:48:01,887 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 50 treesize of output 58
[2024-03-09 02:48:01,941 INFO  L134       CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-09 02:48:01,941 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2024-03-09 02:48:03,660 WARN  L837   $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_#t~mem12#1.base_32| Int) (v_ArrVal_951 (Array Int Int)) (v_ArrVal_950 (Array Int Int))) (or (< (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|) (+ (select (select (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_main_#t~mem12#1.base_32| v_ArrVal_950) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|) 1)) (not (= (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_#t~mem12#1.base_32| v_ArrVal_951) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|) (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|))) (not (<= |v_ULTIMATE.start_main_#t~mem12#1.base_32| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|))))) is different from false
[2024-03-09 02:48:03,737 WARN  L837   $PredicateComparison]: unable to prove that (forall ((v_ArrVal_948 (Array Int Int)) (v_ArrVal_949 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem12#1.base_32| Int) (v_ArrVal_951 (Array Int Int)) (v_ArrVal_950 (Array Int Int))) (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_948))) (or (not (<= |v_ULTIMATE.start_main_#t~mem12#1.base_32| (select (select .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (not (= (select (select (store .cse0 |v_ULTIMATE.start_main_#t~mem12#1.base_32| v_ArrVal_951) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|) (select (select .cse0 |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|))) (let ((.cse1 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_949))) (< (select (select .cse1 |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|) (+ (select (select (store .cse1 |v_ULTIMATE.start_main_#t~mem12#1.base_32| v_ArrVal_950) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|) 1)))))) is different from false
[2024-03-09 02:48:03,919 INFO  L134       CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked.
[2024-03-09 02:48:03,920 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1005755434] provided 0 perfect and 2 imperfect interpolant sequences
[2024-03-09 02:48:03,920 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-03-09 02:48:03,920 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 14, 15] total 44
[2024-03-09 02:48:03,920 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1513264784]
[2024-03-09 02:48:03,920 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-03-09 02:48:03,921 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 46 states
[2024-03-09 02:48:03,921 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-09 02:48:03,921 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants.
[2024-03-09 02:48:03,922 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=204, Invalid=1681, Unknown=15, NotChecked=170, Total=2070
[2024-03-09 02:48:04,886 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 50 out of 217
[2024-03-09 02:48:04,889 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 158 places, 197 transitions, 2103 flow. Second operand  has 46 states, 46 states have (on average 52.45652173913044) internal successors, (2413), 46 states have internal predecessors, (2413), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 02:48:04,889 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-09 02:48:04,889 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 50 of 217
[2024-03-09 02:48:04,889 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-09 02:48:10,125 INFO  L130       PetriNetUnfolder]: 583/1419 cut-off events.
[2024-03-09 02:48:10,126 INFO  L131       PetriNetUnfolder]: For 8989/8989 co-relation queries the response was YES.
[2024-03-09 02:48:10,131 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 7507 conditions, 1419 events. 583/1419 cut-off events. For 8989/8989 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 8023 event pairs, 11 based on Foata normal form. 20/1439 useless extension candidates. Maximal degree in co-relation 7458. Up to 221 conditions per place. 
[2024-03-09 02:48:10,136 INFO  L137   encePairwiseOnDemand]: 197/217 looper letters, 306 selfloop transitions, 126 changer transitions 0/433 dead transitions.
[2024-03-09 02:48:10,136 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 183 places, 433 transitions, 4980 flow
[2024-03-09 02:48:10,137 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. 
[2024-03-09 02:48:10,137 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 26 states.
[2024-03-09 02:48:10,139 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 1508 transitions.
[2024-03-09 02:48:10,139 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.2672811059907834
[2024-03-09 02:48:10,139 INFO  L72            ComplementDD]: Start complementDD. Operand 26 states and 1508 transitions.
[2024-03-09 02:48:10,139 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 26 states and 1508 transitions.
[2024-03-09 02:48:10,140 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-09 02:48:10,140 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 26 states and 1508 transitions.
[2024-03-09 02:48:10,142 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 27 states, 26 states have (on average 58.0) internal successors, (1508), 26 states have internal predecessors, (1508), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 02:48:10,146 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 27 states, 27 states have (on average 217.0) internal successors, (5859), 27 states have internal predecessors, (5859), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 02:48:10,147 INFO  L81            ComplementDD]: Finished complementDD. Result  has 27 states, 27 states have (on average 217.0) internal successors, (5859), 27 states have internal predecessors, (5859), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 02:48:10,147 INFO  L175             Difference]: Start difference. First operand has 158 places, 197 transitions, 2103 flow. Second operand 26 states and 1508 transitions.
[2024-03-09 02:48:10,147 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 183 places, 433 transitions, 4980 flow
[2024-03-09 02:48:10,174 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 167 places, 433 transitions, 4881 flow, removed 17 selfloop flow, removed 16 redundant places.
[2024-03-09 02:48:10,178 INFO  L231             Difference]: Finished difference. Result has 176 places, 276 transitions, 3337 flow
[2024-03-09 02:48:10,179 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=217, PETRI_DIFFERENCE_MINUEND_FLOW=2029, PETRI_DIFFERENCE_MINUEND_PLACES=142, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=197, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=56, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=113, PETRI_DIFFERENCE_SUBTRAHEND_STATES=26, PETRI_FLOW=3337, PETRI_PLACES=176, PETRI_TRANSITIONS=276}
[2024-03-09 02:48:10,179 INFO  L288   CegarLoopForPetriNet]: 66 programPoint places, 110 predicate places.
[2024-03-09 02:48:10,179 INFO  L495      AbstractCegarLoop]: Abstraction has has 176 places, 276 transitions, 3337 flow
[2024-03-09 02:48:10,180 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 46 states, 46 states have (on average 52.45652173913044) internal successors, (2413), 46 states have internal predecessors, (2413), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 02:48:10,180 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-03-09 02:48:10,180 INFO  L209   CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-09 02:48:10,186 INFO  L540       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0
[2024-03-09 02:48:10,380 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-03-09 02:48:10,381 INFO  L420      AbstractCegarLoop]: === Iteration 11 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (and 8 more)] ===
[2024-03-09 02:48:10,382 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-09 02:48:10,382 INFO  L85        PathProgramCache]: Analyzing trace with hash 644595303, now seen corresponding path program 4 times
[2024-03-09 02:48:10,382 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-09 02:48:10,382 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [329073098]
[2024-03-09 02:48:10,382 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 02:48:10,383 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-09 02:48:10,425 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 02:48:11,530 INFO  L134       CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-09 02:48:11,530 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-09 02:48:11,530 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [329073098]
[2024-03-09 02:48:11,530 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [329073098] provided 0 perfect and 1 imperfect interpolant sequences
[2024-03-09 02:48:11,530 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [898313687]
[2024-03-09 02:48:11,530 INFO  L93    rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST
[2024-03-09 02:48:11,531 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-03-09 02:48:11,531 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2024-03-09 02:48:11,532 INFO  L229       MonitoredProcess]: Starting monitored process 6 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-03-09 02:48:11,534 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process
[2024-03-09 02:48:12,113 INFO  L228   tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s)
[2024-03-09 02:48:12,114 INFO  L229   tOrderPrioritization]: Conjunction of SSA is unsat
[2024-03-09 02:48:12,117 INFO  L263         TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 64 conjunts are in the unsatisfiable core
[2024-03-09 02:48:12,123 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2024-03-09 02:48:12,397 INFO  L321             Elim1Store]: treesize reduction 36, result has 23.4 percent of original size
[2024-03-09 02:48:12,397 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 50 treesize of output 49
[2024-03-09 02:48:12,412 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-09 02:48:12,413 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16
[2024-03-09 02:48:12,981 INFO  L321             Elim1Store]: treesize reduction 36, result has 23.4 percent of original size
[2024-03-09 02:48:12,982 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 64 treesize of output 62
[2024-03-09 02:48:12,992 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-09 02:48:12,993 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25
[2024-03-09 02:48:13,209 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7
[2024-03-09 02:48:13,399 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-09 02:48:13,400 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20
[2024-03-09 02:48:13,468 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-09 02:48:13,469 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-09 02:48:13,470 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32
[2024-03-09 02:48:13,556 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-09 02:48:13,558 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-09 02:48:13,559 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-09 02:48:13,560 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 44
[2024-03-09 02:48:13,647 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10
[2024-03-09 02:48:13,655 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12
[2024-03-09 02:48:13,663 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-09 02:48:13,664 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37
[2024-03-09 02:48:13,736 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-09 02:48:13,737 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37
[2024-03-09 02:48:13,761 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-09 02:48:13,762 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37
[2024-03-09 02:48:13,786 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-09 02:48:13,786 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37
[2024-03-09 02:48:13,899 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-09 02:48:13,901 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-09 02:48:13,903 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-09 02:48:13,905 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-09 02:48:13,906 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-09 02:48:13,907 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-09 02:48:13,908 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-09 02:48:13,911 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-09 02:48:13,911 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 50 treesize of output 58
[2024-03-09 02:48:13,963 INFO  L134       CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-09 02:48:13,963 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2024-03-09 02:48:14,128 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_#t~mem8#1.offset| (* |c_ULTIMATE.start_main_~i~1#1| 4)))) (and (forall ((v_ArrVal_1143 Int) (v_ArrVal_1141 (Array Int Int))) (= (select (select (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1141))) (store .cse0 |c_ULTIMATE.start_main_#t~mem8#1.base| (store (select .cse0 |c_ULTIMATE.start_main_#t~mem8#1.base|) .cse1 v_ArrVal_1143))) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) 0)) (forall ((v_ArrVal_1143 Int) (v_ArrVal_1141 (Array Int Int))) (= (select (select (let ((.cse2 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1141))) (store .cse2 |c_ULTIMATE.start_main_#t~mem8#1.base| (store (select .cse2 |c_ULTIMATE.start_main_#t~mem8#1.base|) .cse1 v_ArrVal_1143))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 1)) 0)) (forall ((v_ArrVal_1143 Int) (v_ArrVal_1141 (Array Int Int))) (= (select (select (let ((.cse3 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1141))) (store .cse3 |c_ULTIMATE.start_main_#t~mem8#1.base| (store (select .cse3 |c_ULTIMATE.start_main_#t~mem8#1.base|) .cse1 v_ArrVal_1143))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 3)) 0)) (forall ((v_ArrVal_1143 Int) (v_ArrVal_1141 (Array Int Int))) (= (select (select (let ((.cse4 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1141))) (store .cse4 |c_ULTIMATE.start_main_#t~mem8#1.base| (store (select .cse4 |c_ULTIMATE.start_main_#t~mem8#1.base|) .cse1 v_ArrVal_1143))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 2)) 0)))) is different from false
[2024-03-09 02:48:14,211 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)) (.cse3 (* |c_ULTIMATE.start_main_~i~1#1| 4)) (.cse0 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|))) (and (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_39| Int)) (or (not (<= .cse0 |v_ULTIMATE.start_main_#t~mem8#1.offset_39|)) (forall ((v_ArrVal_1143 Int) (v_ArrVal_1141 (Array Int Int))) (= (select (select (let ((.cse1 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1141))) (store .cse1 .cse2 (store (select .cse1 .cse2) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_39| .cse3) v_ArrVal_1143))) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) 0)))) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_39| Int)) (or (not (<= .cse0 |v_ULTIMATE.start_main_#t~mem8#1.offset_39|)) (forall ((v_ArrVal_1143 Int) (v_ArrVal_1141 (Array Int Int))) (= (select (select (let ((.cse4 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1141))) (store .cse4 .cse2 (store (select .cse4 .cse2) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_39| .cse3) v_ArrVal_1143))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 2)) 0)))) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_39| Int)) (or (not (<= .cse0 |v_ULTIMATE.start_main_#t~mem8#1.offset_39|)) (forall ((v_ArrVal_1143 Int) (v_ArrVal_1141 (Array Int Int))) (= (select (select (let ((.cse5 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1141))) (store .cse5 .cse2 (store (select .cse5 .cse2) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_39| .cse3) v_ArrVal_1143))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 1)) 0)))) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_39| Int)) (or (forall ((v_ArrVal_1143 Int) (v_ArrVal_1141 (Array Int Int))) (= (select (select (let ((.cse6 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1141))) (store .cse6 .cse2 (store (select .cse6 .cse2) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_39| .cse3) v_ArrVal_1143))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 3)) 0)) (not (<= .cse0 |v_ULTIMATE.start_main_#t~mem8#1.offset_39|)))))) is different from false
[2024-03-09 02:48:40,876 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse8 (+ c_threadThread1of1ForFork0_~p~0.offset 1)) (.cse4 (+ c_threadThread1of1ForFork0_~p~0.offset 2)) (.cse10 (+ c_threadThread1of1ForFork0_~p~0.offset 3))) (let ((.cse0 (+ |c_ULTIMATE.start_main_~i~1#1| 1)) (.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)) (.cse3 (store |c_#race| c_threadThread1of1ForFork0_~p~0.base (store (store (store (select |c_#race| c_threadThread1of1ForFork0_~p~0.base) .cse8 0) .cse4 0) .cse10 0))) (.cse5 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|))) (and (forall ((|v_ULTIMATE.start_main_~i~1#1_68| Int)) (or (not (<= .cse0 |v_ULTIMATE.start_main_~i~1#1_68|)) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_39| Int)) (or (forall ((v_ArrVal_1143 Int) (v_ArrVal_1141 (Array Int Int))) (= (select (select (let ((.cse1 (store .cse3 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1141))) (store .cse1 .cse2 (store (select .cse1 .cse2) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_39| (* |v_ULTIMATE.start_main_~i~1#1_68| 4)) v_ArrVal_1143))) c_threadThread1of1ForFork0_~p~0.base) .cse4) 0)) (not (<= .cse5 |v_ULTIMATE.start_main_#t~mem8#1.offset_39|)))))) (forall ((|v_ULTIMATE.start_main_~i~1#1_68| Int)) (or (not (<= .cse0 |v_ULTIMATE.start_main_~i~1#1_68|)) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_39| Int)) (or (not (<= .cse5 |v_ULTIMATE.start_main_#t~mem8#1.offset_39|)) (forall ((v_ArrVal_1143 Int) (v_ArrVal_1141 (Array Int Int))) (= (select (select (let ((.cse6 (store .cse3 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1141))) (store .cse6 .cse2 (store (select .cse6 .cse2) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_39| (* |v_ULTIMATE.start_main_~i~1#1_68| 4)) v_ArrVal_1143))) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) 0)))))) (forall ((|v_ULTIMATE.start_main_~i~1#1_68| Int)) (or (not (<= .cse0 |v_ULTIMATE.start_main_~i~1#1_68|)) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_39| Int)) (or (forall ((v_ArrVal_1143 Int) (v_ArrVal_1141 (Array Int Int))) (= (select (select (let ((.cse7 (store .cse3 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1141))) (store .cse7 .cse2 (store (select .cse7 .cse2) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_39| (* |v_ULTIMATE.start_main_~i~1#1_68| 4)) v_ArrVal_1143))) c_threadThread1of1ForFork0_~p~0.base) .cse8) 0)) (not (<= .cse5 |v_ULTIMATE.start_main_#t~mem8#1.offset_39|)))))) (forall ((|v_ULTIMATE.start_main_~i~1#1_68| Int)) (or (not (<= .cse0 |v_ULTIMATE.start_main_~i~1#1_68|)) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_39| Int)) (or (forall ((v_ArrVal_1143 Int) (v_ArrVal_1141 (Array Int Int))) (= (select (select (let ((.cse9 (store .cse3 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1141))) (store .cse9 .cse2 (store (select .cse9 .cse2) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_39| (* |v_ULTIMATE.start_main_~i~1#1_68| 4)) v_ArrVal_1143))) c_threadThread1of1ForFork0_~p~0.base) .cse10) 0)) (not (<= .cse5 |v_ULTIMATE.start_main_#t~mem8#1.offset_39|))))))))) is different from false
[2024-03-09 02:48:40,953 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-09 02:48:40,954 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 81 treesize of output 74
[2024-03-09 02:48:40,967 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-09 02:48:40,967 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 352 treesize of output 326
[2024-03-09 02:48:40,978 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 320 treesize of output 300
[2024-03-09 02:48:41,071 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 242 treesize of output 226
[2024-03-09 02:48:41,401 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-09 02:48:41,401 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 132 treesize of output 110
[2024-03-09 02:48:41,454 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-09 02:48:41,454 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 81 treesize of output 74
[2024-03-09 02:48:41,461 INFO  L173   IndexEqualityManager]: detected equality via solver
[2024-03-09 02:48:41,477 INFO  L321             Elim1Store]: treesize reduction 8, result has 33.3 percent of original size
[2024-03-09 02:48:41,478 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 144 treesize of output 130
[2024-03-09 02:48:41,491 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 61
[2024-03-09 02:48:41,500 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 158 treesize of output 132
[2024-03-09 02:48:41,541 INFO  L321             Elim1Store]: treesize reduction 38, result has 2.6 percent of original size
[2024-03-09 02:48:41,541 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 79 treesize of output 1
[2024-03-09 02:48:41,565 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-09 02:48:41,565 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 81 treesize of output 74
[2024-03-09 02:48:41,571 INFO  L173   IndexEqualityManager]: detected equality via solver
[2024-03-09 02:48:41,586 INFO  L321             Elim1Store]: treesize reduction 8, result has 33.3 percent of original size
[2024-03-09 02:48:41,587 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 144 treesize of output 130
[2024-03-09 02:48:41,600 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 61
[2024-03-09 02:48:41,611 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 158 treesize of output 132
[2024-03-09 02:48:50,495 WARN  L837   $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1127 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_1127) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|) |c_ULTIMATE.start_main_~#is~0#1.base|))) (forall ((v_ArrVal_1127 (Array Int Int)) (v_ArrVal_1126 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_1127))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (or (forall ((v_ArrVal_1128 (Array Int Int))) (let ((.cse0 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_1126))) (< (select (select .cse0 |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|) (+ (select (select (store .cse0 .cse1 v_ArrVal_1128) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|) 1)))) (forall ((v_ArrVal_1129 (Array Int Int))) (not (= (select (select .cse2 |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|) (select (select (store .cse2 .cse1 v_ArrVal_1129) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|))))))))) is different from false
[2024-03-09 02:48:50,589 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|))) (and (forall ((|v_ULTIMATE.start_main_#t~mem8#1.base_40| Int)) (or (forall ((v_ArrVal_1127 (Array Int Int))) (not (= |c_ULTIMATE.start_main_~#is~0#1.base| (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_#t~mem8#1.base_40| v_ArrVal_1127) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)))) (not (<= |v_ULTIMATE.start_main_#t~mem8#1.base_40| .cse0)))) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.base_40| Int)) (or (not (<= |v_ULTIMATE.start_main_#t~mem8#1.base_40| .cse0)) (forall ((v_ArrVal_1127 (Array Int Int)) (v_ArrVal_1126 (Array Int Int))) (let ((.cse1 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_#t~mem8#1.base_40| v_ArrVal_1127))) (let ((.cse2 (select (select .cse1 |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (or (forall ((v_ArrVal_1129 (Array Int Int))) (not (= (select (select (store .cse1 .cse2 v_ArrVal_1129) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|) (select (select .cse1 |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)))) (forall ((v_ArrVal_1128 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_main_#t~mem8#1.base_40| v_ArrVal_1126))) (< (select (select .cse3 |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|) (+ (select (select (store .cse3 .cse2 v_ArrVal_1128) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|) 1)))))))))))) is different from false
[2024-03-09 02:48:50,594 INFO  L134       CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked.
[2024-03-09 02:48:50,594 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [898313687] provided 0 perfect and 2 imperfect interpolant sequences
[2024-03-09 02:48:50,594 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-03-09 02:48:50,594 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 15, 16] total 47
[2024-03-09 02:48:50,595 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [716603617]
[2024-03-09 02:48:50,595 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-03-09 02:48:50,595 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 49 states
[2024-03-09 02:48:50,595 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-09 02:48:50,596 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants.
[2024-03-09 02:48:50,597 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=235, Invalid=1624, Unknown=53, NotChecked=440, Total=2352
[2024-03-09 02:48:50,734 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 50 out of 217
[2024-03-09 02:48:50,738 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 176 places, 276 transitions, 3337 flow. Second operand  has 49 states, 49 states have (on average 52.30612244897959) internal successors, (2563), 49 states have internal predecessors, (2563), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 02:48:50,739 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-09 02:48:50,739 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 50 of 217
[2024-03-09 02:48:50,739 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-09 02:49:08,118 WARN  L233               SmtUtils]: Spent 12.45s on a formula simplification. DAG size of input: 76 DAG size of output: 59 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)
[2024-03-09 02:49:10,842 WARN  L539   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1]
[2024-03-09 02:49:15,964 WARN  L539   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1]
[2024-03-09 02:49:17,972 WARN  L539   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1]
[2024-03-09 02:49:20,121 WARN  L539   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1]
[2024-03-09 02:49:22,587 WARN  L539   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1]
[2024-03-09 02:49:24,596 WARN  L539   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1]
[2024-03-09 02:49:26,607 WARN  L539   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1]
[2024-03-09 02:49:30,489 INFO  L130       PetriNetUnfolder]: 646/1650 cut-off events.
[2024-03-09 02:49:30,489 INFO  L131       PetriNetUnfolder]: For 15655/15655 co-relation queries the response was YES.
[2024-03-09 02:49:30,498 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 9754 conditions, 1650 events. 646/1650 cut-off events. For 15655/15655 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 10085 event pairs, 141 based on Foata normal form. 16/1666 useless extension candidates. Maximal degree in co-relation 9696. Up to 956 conditions per place. 
[2024-03-09 02:49:30,507 INFO  L137   encePairwiseOnDemand]: 193/217 looper letters, 287 selfloop transitions, 140 changer transitions 0/428 dead transitions.
[2024-03-09 02:49:30,507 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 200 places, 428 transitions, 5728 flow
[2024-03-09 02:49:30,509 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. 
[2024-03-09 02:49:30,509 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 25 states.
[2024-03-09 02:49:30,510 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 1426 transitions.
[2024-03-09 02:49:30,510 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.26285714285714284
[2024-03-09 02:49:30,510 INFO  L72            ComplementDD]: Start complementDD. Operand 25 states and 1426 transitions.
[2024-03-09 02:49:30,511 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 25 states and 1426 transitions.
[2024-03-09 02:49:30,511 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-09 02:49:30,511 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 25 states and 1426 transitions.
[2024-03-09 02:49:30,513 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 26 states, 25 states have (on average 57.04) internal successors, (1426), 25 states have internal predecessors, (1426), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 02:49:30,517 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 26 states, 26 states have (on average 217.0) internal successors, (5642), 26 states have internal predecessors, (5642), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 02:49:30,518 INFO  L81            ComplementDD]: Finished complementDD. Result  has 26 states, 26 states have (on average 217.0) internal successors, (5642), 26 states have internal predecessors, (5642), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 02:49:30,518 INFO  L175             Difference]: Start difference. First operand has 176 places, 276 transitions, 3337 flow. Second operand 25 states and 1426 transitions.
[2024-03-09 02:49:30,518 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 200 places, 428 transitions, 5728 flow
[2024-03-09 02:49:30,567 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 189 places, 428 transitions, 5449 flow, removed 81 selfloop flow, removed 11 redundant places.
[2024-03-09 02:49:30,572 INFO  L231             Difference]: Finished difference. Result has 200 places, 335 transitions, 4525 flow
[2024-03-09 02:49:30,573 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=217, PETRI_DIFFERENCE_MINUEND_FLOW=3158, PETRI_DIFFERENCE_MINUEND_PLACES=165, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=276, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=87, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=158, PETRI_DIFFERENCE_SUBTRAHEND_STATES=25, PETRI_FLOW=4525, PETRI_PLACES=200, PETRI_TRANSITIONS=335}
[2024-03-09 02:49:30,573 INFO  L288   CegarLoopForPetriNet]: 66 programPoint places, 134 predicate places.
[2024-03-09 02:49:30,573 INFO  L495      AbstractCegarLoop]: Abstraction has has 200 places, 335 transitions, 4525 flow
[2024-03-09 02:49:30,574 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 49 states, 49 states have (on average 52.30612244897959) internal successors, (2563), 49 states have internal predecessors, (2563), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 02:49:30,574 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-03-09 02:49:30,574 INFO  L209   CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-09 02:49:30,583 INFO  L540       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0
[2024-03-09 02:49:30,775 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10
[2024-03-09 02:49:30,775 INFO  L420      AbstractCegarLoop]: === Iteration 12 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (and 8 more)] ===
[2024-03-09 02:49:30,776 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-09 02:49:30,776 INFO  L85        PathProgramCache]: Analyzing trace with hash 898501185, now seen corresponding path program 5 times
[2024-03-09 02:49:30,776 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-09 02:49:30,776 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [18732235]
[2024-03-09 02:49:30,776 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 02:49:30,777 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-09 02:49:30,848 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 02:49:31,946 INFO  L134       CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-09 02:49:31,947 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-09 02:49:31,947 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [18732235]
[2024-03-09 02:49:31,947 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [18732235] provided 0 perfect and 1 imperfect interpolant sequences
[2024-03-09 02:49:31,947 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [915210031]
[2024-03-09 02:49:31,947 INFO  L93    rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1
[2024-03-09 02:49:31,947 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-03-09 02:49:31,948 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2024-03-09 02:49:31,949 INFO  L229       MonitoredProcess]: Starting monitored process 7 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-03-09 02:49:31,950 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process
[2024-03-09 02:49:32,296 INFO  L228   tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2024-03-09 02:49:32,297 INFO  L229   tOrderPrioritization]: Conjunction of SSA is unsat
[2024-03-09 02:49:32,300 INFO  L263         TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 63 conjunts are in the unsatisfiable core
[2024-03-09 02:49:32,307 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2024-03-09 02:49:32,623 INFO  L321             Elim1Store]: treesize reduction 36, result has 23.4 percent of original size
[2024-03-09 02:49:32,623 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 57 treesize of output 57
[2024-03-09 02:49:32,634 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-09 02:49:32,635 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20
[2024-03-09 02:49:33,185 INFO  L321             Elim1Store]: treesize reduction 36, result has 23.4 percent of original size
[2024-03-09 02:49:33,186 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 64 treesize of output 62
[2024-03-09 02:49:33,201 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-09 02:49:33,202 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25
[2024-03-09 02:49:33,486 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7
[2024-03-09 02:49:33,588 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-09 02:49:33,589 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20
[2024-03-09 02:49:33,834 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10
[2024-03-09 02:49:33,850 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-09 02:49:33,850 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 39
[2024-03-09 02:49:33,866 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-09 02:49:33,866 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 23
[2024-03-09 02:49:33,929 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-09 02:49:33,930 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-09 02:49:33,931 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32
[2024-03-09 02:49:34,007 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-09 02:49:34,008 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 30
[2024-03-09 02:49:34,042 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-09 02:49:34,043 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-09 02:49:34,044 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-09 02:49:34,045 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 44
[2024-03-09 02:49:34,130 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-09 02:49:34,131 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37
[2024-03-09 02:49:34,174 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-09 02:49:34,175 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37
[2024-03-09 02:49:34,301 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-09 02:49:34,303 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-09 02:49:34,305 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-09 02:49:34,306 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-09 02:49:34,307 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-09 02:49:34,308 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-09 02:49:34,309 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-09 02:49:34,312 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-09 02:49:34,312 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 50 treesize of output 58
[2024-03-09 02:49:34,418 INFO  L134       CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-09 02:49:34,418 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2024-03-09 02:49:34,664 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_#t~mem8#1.offset| (* |c_ULTIMATE.start_main_~i~1#1| 4)))) (and (forall ((v_ArrVal_1323 (Array Int Int)) (v_ArrVal_1325 Int)) (= (select (select (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1323))) (store .cse0 |c_ULTIMATE.start_main_#t~mem8#1.base| (store (select .cse0 |c_ULTIMATE.start_main_#t~mem8#1.base|) .cse1 v_ArrVal_1325))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 2)) 0)) (forall ((v_ArrVal_1323 (Array Int Int)) (v_ArrVal_1325 Int)) (= (select (select (let ((.cse2 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1323))) (store .cse2 |c_ULTIMATE.start_main_#t~mem8#1.base| (store (select .cse2 |c_ULTIMATE.start_main_#t~mem8#1.base|) .cse1 v_ArrVal_1325))) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) 0)) (forall ((v_ArrVal_1323 (Array Int Int)) (v_ArrVal_1325 Int)) (= (select (select (let ((.cse3 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1323))) (store .cse3 |c_ULTIMATE.start_main_#t~mem8#1.base| (store (select .cse3 |c_ULTIMATE.start_main_#t~mem8#1.base|) .cse1 v_ArrVal_1325))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 3)) 0)) (forall ((v_ArrVal_1323 (Array Int Int)) (v_ArrVal_1325 Int)) (= (select (select (let ((.cse4 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1323))) (store .cse4 |c_ULTIMATE.start_main_#t~mem8#1.base| (store (select .cse4 |c_ULTIMATE.start_main_#t~mem8#1.base|) .cse1 v_ArrVal_1325))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 1)) 0)))) is different from false
[2024-03-09 02:49:41,174 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_#t~mem8#1.offset| (* |c_ULTIMATE.start_main_~i~1#1| 4))) (.cse3 (+ c_threadThread1of1ForFork0_~p~0.offset 3))) (and (forall ((v_ArrVal_1323 (Array Int Int)) (v_ArrVal_1325 Int) (v_ArrVal_1319 (Array Int Int))) (= (select (select (let ((.cse0 (store (let ((.cse2 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1319))) (store .cse2 c_threadThread1of1ForFork0_~p~0.base (store (select .cse2 c_threadThread1of1ForFork0_~p~0.base) .cse3 0))) |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1323))) (store .cse0 |c_ULTIMATE.start_main_#t~mem8#1.base| (store (select .cse0 |c_ULTIMATE.start_main_#t~mem8#1.base|) .cse1 v_ArrVal_1325))) c_threadThread1of1ForFork0_~p~0.base) .cse3) 0)) (forall ((v_ArrVal_1323 (Array Int Int)) (v_ArrVal_1325 Int) (v_ArrVal_1319 (Array Int Int))) (= (select (select (let ((.cse4 (store (let ((.cse5 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1319))) (store .cse5 c_threadThread1of1ForFork0_~p~0.base (store (select .cse5 c_threadThread1of1ForFork0_~p~0.base) .cse3 0))) |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1323))) (store .cse4 |c_ULTIMATE.start_main_#t~mem8#1.base| (store (select .cse4 |c_ULTIMATE.start_main_#t~mem8#1.base|) .cse1 v_ArrVal_1325))) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) 0)) (forall ((v_ArrVal_1323 (Array Int Int)) (v_ArrVal_1325 Int) (v_ArrVal_1319 (Array Int Int))) (= (select (select (let ((.cse6 (store (let ((.cse7 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1319))) (store .cse7 c_threadThread1of1ForFork0_~p~0.base (store (select .cse7 c_threadThread1of1ForFork0_~p~0.base) .cse3 0))) |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1323))) (store .cse6 |c_ULTIMATE.start_main_#t~mem8#1.base| (store (select .cse6 |c_ULTIMATE.start_main_#t~mem8#1.base|) .cse1 v_ArrVal_1325))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 1)) 0)) (forall ((v_ArrVal_1323 (Array Int Int)) (v_ArrVal_1325 Int) (v_ArrVal_1319 (Array Int Int))) (= (select (select (let ((.cse8 (store (let ((.cse9 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1319))) (store .cse9 c_threadThread1of1ForFork0_~p~0.base (store (select .cse9 c_threadThread1of1ForFork0_~p~0.base) .cse3 0))) |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1323))) (store .cse8 |c_ULTIMATE.start_main_#t~mem8#1.base| (store (select .cse8 |c_ULTIMATE.start_main_#t~mem8#1.base|) .cse1 v_ArrVal_1325))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 2)) 0)))) is different from false
[2024-03-09 02:49:41,762 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)) (.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)) (.cse3 (* |c_ULTIMATE.start_main_~i~1#1| 4)) (.cse7 (+ c_threadThread1of1ForFork0_~p~0.offset 2)) (.cse5 (+ c_threadThread1of1ForFork0_~p~0.offset 3))) (and (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_41| Int)) (or (not (<= .cse0 |v_ULTIMATE.start_main_#t~mem8#1.offset_41|)) (forall ((v_ArrVal_1316 (Array Int Int)) (v_ArrVal_1323 (Array Int Int)) (v_ArrVal_1325 Int) (v_ArrVal_1319 (Array Int Int))) (= (select (select (let ((.cse1 (store (let ((.cse4 (store (let ((.cse6 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1316))) (store .cse6 c_threadThread1of1ForFork0_~p~0.base (store (select .cse6 c_threadThread1of1ForFork0_~p~0.base) .cse7 0))) |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1319))) (store .cse4 c_threadThread1of1ForFork0_~p~0.base (store (select .cse4 c_threadThread1of1ForFork0_~p~0.base) .cse5 0))) |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1323))) (store .cse1 .cse2 (store (select .cse1 .cse2) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_41| .cse3) v_ArrVal_1325))) c_threadThread1of1ForFork0_~p~0.base) .cse7) 0)))) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_41| Int)) (or (not (<= .cse0 |v_ULTIMATE.start_main_#t~mem8#1.offset_41|)) (forall ((v_ArrVal_1316 (Array Int Int)) (v_ArrVal_1323 (Array Int Int)) (v_ArrVal_1325 Int) (v_ArrVal_1319 (Array Int Int))) (= (select (select (let ((.cse8 (store (let ((.cse9 (store (let ((.cse10 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1316))) (store .cse10 c_threadThread1of1ForFork0_~p~0.base (store (select .cse10 c_threadThread1of1ForFork0_~p~0.base) .cse7 0))) |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1319))) (store .cse9 c_threadThread1of1ForFork0_~p~0.base (store (select .cse9 c_threadThread1of1ForFork0_~p~0.base) .cse5 0))) |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1323))) (store .cse8 .cse2 (store (select .cse8 .cse2) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_41| .cse3) v_ArrVal_1325))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 1)) 0)))) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_41| Int)) (or (not (<= .cse0 |v_ULTIMATE.start_main_#t~mem8#1.offset_41|)) (forall ((v_ArrVal_1316 (Array Int Int)) (v_ArrVal_1323 (Array Int Int)) (v_ArrVal_1325 Int) (v_ArrVal_1319 (Array Int Int))) (= (select (select (let ((.cse11 (store (let ((.cse12 (store (let ((.cse13 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1316))) (store .cse13 c_threadThread1of1ForFork0_~p~0.base (store (select .cse13 c_threadThread1of1ForFork0_~p~0.base) .cse7 0))) |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1319))) (store .cse12 c_threadThread1of1ForFork0_~p~0.base (store (select .cse12 c_threadThread1of1ForFork0_~p~0.base) .cse5 0))) |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1323))) (store .cse11 .cse2 (store (select .cse11 .cse2) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_41| .cse3) v_ArrVal_1325))) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) 0)))) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_41| Int)) (or (not (<= .cse0 |v_ULTIMATE.start_main_#t~mem8#1.offset_41|)) (forall ((v_ArrVal_1316 (Array Int Int)) (v_ArrVal_1323 (Array Int Int)) (v_ArrVal_1325 Int) (v_ArrVal_1319 (Array Int Int))) (= (select (select (let ((.cse14 (store (let ((.cse15 (store (let ((.cse16 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1316))) (store .cse16 c_threadThread1of1ForFork0_~p~0.base (store (select .cse16 c_threadThread1of1ForFork0_~p~0.base) .cse7 0))) |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1319))) (store .cse15 c_threadThread1of1ForFork0_~p~0.base (store (select .cse15 c_threadThread1of1ForFork0_~p~0.base) .cse5 0))) |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1323))) (store .cse14 .cse2 (store (select .cse14 .cse2) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_41| .cse3) v_ArrVal_1325))) c_threadThread1of1ForFork0_~p~0.base) .cse5) 0)))))) is different from false
[2024-03-09 02:49:43,874 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse3 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)) (.cse5 (+ c_threadThread1of1ForFork0_~p~0.offset 3)) (.cse7 (+ c_threadThread1of1ForFork0_~p~0.offset 2)) (.cse1 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)) (.cse0 (+ |c_ULTIMATE.start_main_~i~1#1| 1))) (and (forall ((|v_ULTIMATE.start_main_~i~1#1_70| Int)) (or (not (<= .cse0 |v_ULTIMATE.start_main_~i~1#1_70|)) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_41| Int)) (or (not (<= .cse1 |v_ULTIMATE.start_main_#t~mem8#1.offset_41|)) (forall ((v_ArrVal_1316 (Array Int Int)) (v_ArrVal_1323 (Array Int Int)) (v_ArrVal_1325 Int) (v_ArrVal_1319 (Array Int Int))) (= (select (select (let ((.cse2 (store (let ((.cse4 (store (let ((.cse6 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1316))) (store .cse6 c_threadThread1of1ForFork0_~p~0.base (store (select .cse6 c_threadThread1of1ForFork0_~p~0.base) .cse7 0))) |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1319))) (store .cse4 c_threadThread1of1ForFork0_~p~0.base (store (select .cse4 c_threadThread1of1ForFork0_~p~0.base) .cse5 0))) |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1323))) (store .cse2 .cse3 (store (select .cse2 .cse3) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_41| (* |v_ULTIMATE.start_main_~i~1#1_70| 4)) v_ArrVal_1325))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 1)) 0)))))) (forall ((|v_ULTIMATE.start_main_~i~1#1_70| Int)) (or (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_41| Int)) (or (forall ((v_ArrVal_1316 (Array Int Int)) (v_ArrVal_1323 (Array Int Int)) (v_ArrVal_1325 Int) (v_ArrVal_1319 (Array Int Int))) (= (select (select (let ((.cse8 (store (let ((.cse9 (store (let ((.cse10 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1316))) (store .cse10 c_threadThread1of1ForFork0_~p~0.base (store (select .cse10 c_threadThread1of1ForFork0_~p~0.base) .cse7 0))) |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1319))) (store .cse9 c_threadThread1of1ForFork0_~p~0.base (store (select .cse9 c_threadThread1of1ForFork0_~p~0.base) .cse5 0))) |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1323))) (store .cse8 .cse3 (store (select .cse8 .cse3) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_41| (* |v_ULTIMATE.start_main_~i~1#1_70| 4)) v_ArrVal_1325))) c_threadThread1of1ForFork0_~p~0.base) .cse7) 0)) (not (<= .cse1 |v_ULTIMATE.start_main_#t~mem8#1.offset_41|)))) (not (<= .cse0 |v_ULTIMATE.start_main_~i~1#1_70|)))) (forall ((|v_ULTIMATE.start_main_~i~1#1_70| Int)) (or (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_41| Int)) (or (not (<= .cse1 |v_ULTIMATE.start_main_#t~mem8#1.offset_41|)) (forall ((v_ArrVal_1316 (Array Int Int)) (v_ArrVal_1323 (Array Int Int)) (v_ArrVal_1325 Int) (v_ArrVal_1319 (Array Int Int))) (= (select (select (let ((.cse11 (store (let ((.cse12 (store (let ((.cse13 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1316))) (store .cse13 c_threadThread1of1ForFork0_~p~0.base (store (select .cse13 c_threadThread1of1ForFork0_~p~0.base) .cse7 0))) |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1319))) (store .cse12 c_threadThread1of1ForFork0_~p~0.base (store (select .cse12 c_threadThread1of1ForFork0_~p~0.base) .cse5 0))) |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1323))) (store .cse11 .cse3 (store (select .cse11 .cse3) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_41| (* |v_ULTIMATE.start_main_~i~1#1_70| 4)) v_ArrVal_1325))) c_threadThread1of1ForFork0_~p~0.base) .cse5) 0)))) (not (<= .cse0 |v_ULTIMATE.start_main_~i~1#1_70|)))) (forall ((|v_ULTIMATE.start_main_~i~1#1_70| Int)) (or (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_41| Int)) (or (forall ((v_ArrVal_1316 (Array Int Int)) (v_ArrVal_1323 (Array Int Int)) (v_ArrVal_1325 Int) (v_ArrVal_1319 (Array Int Int))) (= (select (select (let ((.cse14 (store (let ((.cse15 (store (let ((.cse16 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1316))) (store .cse16 c_threadThread1of1ForFork0_~p~0.base (store (select .cse16 c_threadThread1of1ForFork0_~p~0.base) .cse7 0))) |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1319))) (store .cse15 c_threadThread1of1ForFork0_~p~0.base (store (select .cse15 c_threadThread1of1ForFork0_~p~0.base) .cse5 0))) |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1323))) (store .cse14 .cse3 (store (select .cse14 .cse3) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_41| (* |v_ULTIMATE.start_main_~i~1#1_70| 4)) v_ArrVal_1325))) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) 0)) (not (<= .cse1 |v_ULTIMATE.start_main_#t~mem8#1.offset_41|)))) (not (<= .cse0 |v_ULTIMATE.start_main_~i~1#1_70|)))))) is different from false
[2024-03-09 02:49:46,006 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse8 (+ c_threadThread1of1ForFork0_~p~0.offset 1))) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)) (.cse4 (+ c_threadThread1of1ForFork0_~p~0.offset 3)) (.cse6 (+ c_threadThread1of1ForFork0_~p~0.offset 2)) (.cse7 (store |c_#race| c_threadThread1of1ForFork0_~p~0.base (store (select |c_#race| c_threadThread1of1ForFork0_~p~0.base) .cse8 0))) (.cse9 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)) (.cse0 (+ |c_ULTIMATE.start_main_~i~1#1| 1))) (and (forall ((|v_ULTIMATE.start_main_~i~1#1_70| Int)) (or (not (<= .cse0 |v_ULTIMATE.start_main_~i~1#1_70|)) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_41| Int)) (or (forall ((v_ArrVal_1316 (Array Int Int)) (v_ArrVal_1323 (Array Int Int)) (v_ArrVal_1325 Int) (v_ArrVal_1319 (Array Int Int))) (= (select (select (let ((.cse1 (store (let ((.cse3 (store (let ((.cse5 (store .cse7 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1316))) (store .cse5 c_threadThread1of1ForFork0_~p~0.base (store (select .cse5 c_threadThread1of1ForFork0_~p~0.base) .cse6 0))) |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1319))) (store .cse3 c_threadThread1of1ForFork0_~p~0.base (store (select .cse3 c_threadThread1of1ForFork0_~p~0.base) .cse4 0))) |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1323))) (store .cse1 .cse2 (store (select .cse1 .cse2) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_41| (* |v_ULTIMATE.start_main_~i~1#1_70| 4)) v_ArrVal_1325))) c_threadThread1of1ForFork0_~p~0.base) .cse8) 0)) (not (<= .cse9 |v_ULTIMATE.start_main_#t~mem8#1.offset_41|)))))) (forall ((|v_ULTIMATE.start_main_~i~1#1_70| Int)) (or (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_41| Int)) (or (forall ((v_ArrVal_1316 (Array Int Int)) (v_ArrVal_1323 (Array Int Int)) (v_ArrVal_1325 Int) (v_ArrVal_1319 (Array Int Int))) (= (select (select (let ((.cse10 (store (let ((.cse11 (store (let ((.cse12 (store .cse7 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1316))) (store .cse12 c_threadThread1of1ForFork0_~p~0.base (store (select .cse12 c_threadThread1of1ForFork0_~p~0.base) .cse6 0))) |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1319))) (store .cse11 c_threadThread1of1ForFork0_~p~0.base (store (select .cse11 c_threadThread1of1ForFork0_~p~0.base) .cse4 0))) |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1323))) (store .cse10 .cse2 (store (select .cse10 .cse2) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_41| (* |v_ULTIMATE.start_main_~i~1#1_70| 4)) v_ArrVal_1325))) c_threadThread1of1ForFork0_~p~0.base) .cse6) 0)) (not (<= .cse9 |v_ULTIMATE.start_main_#t~mem8#1.offset_41|)))) (not (<= .cse0 |v_ULTIMATE.start_main_~i~1#1_70|)))) (forall ((|v_ULTIMATE.start_main_~i~1#1_70| Int)) (or (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_41| Int)) (or (not (<= .cse9 |v_ULTIMATE.start_main_#t~mem8#1.offset_41|)) (forall ((v_ArrVal_1316 (Array Int Int)) (v_ArrVal_1323 (Array Int Int)) (v_ArrVal_1325 Int) (v_ArrVal_1319 (Array Int Int))) (= (select (select (let ((.cse13 (store (let ((.cse14 (store (let ((.cse15 (store .cse7 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1316))) (store .cse15 c_threadThread1of1ForFork0_~p~0.base (store (select .cse15 c_threadThread1of1ForFork0_~p~0.base) .cse6 0))) |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1319))) (store .cse14 c_threadThread1of1ForFork0_~p~0.base (store (select .cse14 c_threadThread1of1ForFork0_~p~0.base) .cse4 0))) |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1323))) (store .cse13 .cse2 (store (select .cse13 .cse2) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_41| (* |v_ULTIMATE.start_main_~i~1#1_70| 4)) v_ArrVal_1325))) c_threadThread1of1ForFork0_~p~0.base) .cse4) 0)))) (not (<= .cse0 |v_ULTIMATE.start_main_~i~1#1_70|)))) (forall ((|v_ULTIMATE.start_main_~i~1#1_70| Int)) (or (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_41| Int)) (or (forall ((v_ArrVal_1316 (Array Int Int)) (v_ArrVal_1323 (Array Int Int)) (v_ArrVal_1325 Int) (v_ArrVal_1319 (Array Int Int))) (= (select (select (let ((.cse16 (store (let ((.cse17 (store (let ((.cse18 (store .cse7 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1316))) (store .cse18 c_threadThread1of1ForFork0_~p~0.base (store (select .cse18 c_threadThread1of1ForFork0_~p~0.base) .cse6 0))) |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1319))) (store .cse17 c_threadThread1of1ForFork0_~p~0.base (store (select .cse17 c_threadThread1of1ForFork0_~p~0.base) .cse4 0))) |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1323))) (store .cse16 .cse2 (store (select .cse16 .cse2) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_41| (* |v_ULTIMATE.start_main_~i~1#1_70| 4)) v_ArrVal_1325))) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) 0)) (not (<= .cse9 |v_ULTIMATE.start_main_#t~mem8#1.offset_41|)))) (not (<= .cse0 |v_ULTIMATE.start_main_~i~1#1_70|))))))) is different from false
[2024-03-09 02:49:46,062 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-09 02:49:46,062 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 233 treesize of output 148
[2024-03-09 02:49:46,158 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-09 02:49:46,160 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 343284 treesize of output 341968
[2024-03-09 02:49:47,206 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 401526 treesize of output 385754
[2024-03-09 02:49:48,478 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 405546 treesize of output 398590
[2024-03-09 02:49:49,881 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 407818 treesize of output 402038
[2024-03-09 02:49:55,976 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 16078 treesize of output 15936
[2024-03-09 02:49:58,264 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-09 02:49:58,266 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 388988 treesize of output 388596
[2024-03-09 02:50:34,560 WARN  L233               SmtUtils]: Spent 9.27s on a formula simplification. DAG size of input: 252 DAG size of output: 252 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)
[2024-03-09 02:50:45,945 WARN  L233               SmtUtils]: Spent 5.12s on a formula simplification. DAG size of input: 246 DAG size of output: 246 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)
[2024-03-09 02:50:54,901 WARN  L233               SmtUtils]: Spent 8.54s on a formula simplification. DAG size of input: 246 DAG size of output: 246 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)
[2024-03-09 02:51:04,415 WARN  L233               SmtUtils]: Spent 8.67s on a formula simplification. DAG size of input: 246 DAG size of output: 246 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)
[2024-03-09 02:51:13,891 WARN  L233               SmtUtils]: Spent 5.26s on a formula simplification. DAG size of input: 199 DAG size of output: 199 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)
[2024-03-09 02:52:32,497 WARN  L233               SmtUtils]: Spent 5.05s on a formula simplification. DAG size of input: 622 DAG size of output: 622 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)
[2024-03-09 02:52:42,540 WARN  L233               SmtUtils]: Spent 8.83s on a formula simplification. DAG size of input: 620 DAG size of output: 620 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)
[2024-03-09 02:52:59,876 WARN  L233               SmtUtils]: Spent 15.40s on a formula simplification. DAG size of input: 540 DAG size of output: 540 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)
[2024-03-09 02:53:16,439 WARN  L233               SmtUtils]: Spent 15.60s on a formula simplification. DAG size of input: 538 DAG size of output: 538 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)
[2024-03-09 02:53:33,600 WARN  L233               SmtUtils]: Spent 15.24s on a formula simplification. DAG size of input: 534 DAG size of output: 534 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)
[2024-03-09 02:54:48,139 WARN  L233               SmtUtils]: Spent 12.45s on a formula simplification. DAG size of input: 267 DAG size of output: 267 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)
[2024-03-09 02:54:59,516 WARN  L233               SmtUtils]: Spent 10.76s on a formula simplification. DAG size of input: 267 DAG size of output: 267 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)
[2024-03-09 02:55:31,009 WARN  L233               SmtUtils]: Spent 8.80s on a formula simplification. DAG size of input: 251 DAG size of output: 251 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)
[2024-03-09 02:55:39,049 WARN  L233               SmtUtils]: Spent 7.58s on a formula simplification. DAG size of input: 251 DAG size of output: 251 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)
[2024-03-09 02:55:47,463 WARN  L233               SmtUtils]: Spent 7.93s on a formula simplification. DAG size of input: 251 DAG size of output: 251 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)
[2024-03-09 02:55:56,288 WARN  L233               SmtUtils]: Spent 8.04s on a formula simplification. DAG size of input: 251 DAG size of output: 251 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)
[2024-03-09 02:56:05,256 WARN  L233               SmtUtils]: Spent 8.16s on a formula simplification. DAG size of input: 251 DAG size of output: 251 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)
[2024-03-09 02:56:14,329 WARN  L233               SmtUtils]: Spent 8.27s on a formula simplification. DAG size of input: 251 DAG size of output: 251 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)
[2024-03-09 02:56:23,033 WARN  L233               SmtUtils]: Spent 8.22s on a formula simplification. DAG size of input: 251 DAG size of output: 251 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)
[2024-03-09 02:56:31,292 WARN  L233               SmtUtils]: Spent 7.77s on a formula simplification. DAG size of input: 251 DAG size of output: 251 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)
[2024-03-09 02:56:39,792 WARN  L233               SmtUtils]: Spent 8.02s on a formula simplification. DAG size of input: 251 DAG size of output: 251 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)
[2024-03-09 02:56:48,250 WARN  L233               SmtUtils]: Spent 7.97s on a formula simplification. DAG size of input: 251 DAG size of output: 251 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)
[2024-03-09 02:56:56,662 WARN  L233               SmtUtils]: Spent 7.94s on a formula simplification. DAG size of input: 251 DAG size of output: 251 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)
[2024-03-09 02:57:04,795 WARN  L233               SmtUtils]: Spent 7.68s on a formula simplification. DAG size of input: 251 DAG size of output: 251 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)
[2024-03-09 02:57:13,224 WARN  L233               SmtUtils]: Spent 7.97s on a formula simplification. DAG size of input: 251 DAG size of output: 251 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)
[2024-03-09 02:57:21,548 WARN  L233               SmtUtils]: Spent 7.87s on a formula simplification. DAG size of input: 251 DAG size of output: 251 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)
[2024-03-09 02:57:29,584 WARN  L233               SmtUtils]: Spent 7.59s on a formula simplification. DAG size of input: 251 DAG size of output: 251 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)
[2024-03-09 02:57:37,954 WARN  L233               SmtUtils]: Spent 7.89s on a formula simplification. DAG size of input: 251 DAG size of output: 251 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)
[2024-03-09 02:57:45,881 WARN  L233               SmtUtils]: Spent 7.48s on a formula simplification. DAG size of input: 251 DAG size of output: 251 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)
[2024-03-09 02:57:53,995 WARN  L233               SmtUtils]: Spent 7.63s on a formula simplification. DAG size of input: 251 DAG size of output: 251 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)
Killed by 15
