./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-data-race.prp --file ../../sv-benchmarks/c/pthread-race-challenges/per-thread-array-init.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 0e0057cc Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a004bb2d-d8b4-4969-87b1-fc9d64ff2ac9/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a004bb2d-d8b4-4969-87b1-fc9d64ff2ac9/bin/uautomizer-verify-BQ2R08f2Ya/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a004bb2d-d8b4-4969-87b1-fc9d64ff2ac9/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a004bb2d-d8b4-4969-87b1-fc9d64ff2ac9/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-race-challenges/per-thread-array-init.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a004bb2d-d8b4-4969-87b1-fc9d64ff2ac9/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a004bb2d-d8b4-4969-87b1-fc9d64ff2ac9/bin/uautomizer-verify-BQ2R08f2Ya --witnessprinter.witness.filename witness --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 16badef15fc63e9ddc5177a1b2c95333295e395a70b18e0490e8c8921933ac0e --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-29 05:09:33,223 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-29 05:09:33,292 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a004bb2d-d8b4-4969-87b1-fc9d64ff2ac9/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-DataRace-32bit-Automizer_Default.epf [2023-11-29 05:09:33,296 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-29 05:09:33,296 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-29 05:09:33,320 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-29 05:09:33,320 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-29 05:09:33,321 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-29 05:09:33,322 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-29 05:09:33,322 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-29 05:09:33,323 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-29 05:09:33,323 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-29 05:09:33,324 INFO L153 SettingsManager]: * Use SBE=true [2023-11-29 05:09:33,325 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-29 05:09:33,325 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-29 05:09:33,326 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-29 05:09:33,326 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-29 05:09:33,327 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-29 05:09:33,327 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-29 05:09:33,327 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-29 05:09:33,328 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-29 05:09:33,331 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-29 05:09:33,332 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2023-11-29 05:09:33,332 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-29 05:09:33,333 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-29 05:09:33,333 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-29 05:09:33,333 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-29 05:09:33,334 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-29 05:09:33,334 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-29 05:09:33,334 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-29 05:09:33,335 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 05:09:33,335 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-29 05:09:33,336 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-29 05:09:33,336 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-29 05:09:33,336 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-29 05:09:33,336 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-29 05:09:33,337 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-29 05:09:33,337 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-29 05:09:33,337 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-29 05:09:33,337 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-29 05:09:33,337 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-29 05:09:33,338 INFO L153 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:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a004bb2d-d8b4-4969-87b1-fc9d64ff2ac9/bin/uautomizer-verify-BQ2R08f2Ya/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 -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a004bb2d-d8b4-4969-87b1-fc9d64ff2ac9/bin/uautomizer-verify-BQ2R08f2Ya Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness 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 -> 16badef15fc63e9ddc5177a1b2c95333295e395a70b18e0490e8c8921933ac0e [2023-11-29 05:09:33,580 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-29 05:09:33,600 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-29 05:09:33,602 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-29 05:09:33,603 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-29 05:09:33,604 INFO L274 PluginConnector]: CDTParser initialized [2023-11-29 05:09:33,605 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a004bb2d-d8b4-4969-87b1-fc9d64ff2ac9/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/pthread-race-challenges/per-thread-array-init.i [2023-11-29 05:09:36,336 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-29 05:09:36,576 INFO L384 CDTParser]: Found 1 translation units. [2023-11-29 05:09:36,577 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a004bb2d-d8b4-4969-87b1-fc9d64ff2ac9/sv-benchmarks/c/pthread-race-challenges/per-thread-array-init.i [2023-11-29 05:09:36,595 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a004bb2d-d8b4-4969-87b1-fc9d64ff2ac9/bin/uautomizer-verify-BQ2R08f2Ya/data/20637ed52/2dda06d831074b16a017d811bfb9ef65/FLAG1f0f38c2d [2023-11-29 05:09:36,609 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a004bb2d-d8b4-4969-87b1-fc9d64ff2ac9/bin/uautomizer-verify-BQ2R08f2Ya/data/20637ed52/2dda06d831074b16a017d811bfb9ef65 [2023-11-29 05:09:36,611 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-29 05:09:36,613 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-29 05:09:36,614 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-29 05:09:36,614 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-29 05:09:36,619 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-29 05:09:36,620 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 05:09:36" (1/1) ... [2023-11-29 05:09:36,621 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@d8de600 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:09:36, skipping insertion in model container [2023-11-29 05:09:36,621 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 05:09:36" (1/1) ... [2023-11-29 05:09:36,678 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 05:09:37,107 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 05:09:37,115 INFO L202 MainTranslator]: Completed pre-run [2023-11-29 05:09:37,158 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 05:09:37,213 INFO L206 MainTranslator]: Completed translation [2023-11-29 05:09:37,214 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:09:37 WrapperNode [2023-11-29 05:09:37,214 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-29 05:09:37,215 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-29 05:09:37,215 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-29 05:09:37,215 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-29 05:09:37,222 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:09:37" (1/1) ... [2023-11-29 05:09:37,239 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:09:37" (1/1) ... [2023-11-29 05:09:37,267 INFO L138 Inliner]: procedures = 265, calls = 26, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 114 [2023-11-29 05:09:37,268 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-29 05:09:37,268 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-29 05:09:37,269 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-29 05:09:37,269 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-29 05:09:37,278 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:09:37" (1/1) ... [2023-11-29 05:09:37,278 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:09:37" (1/1) ... [2023-11-29 05:09:37,283 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:09:37" (1/1) ... [2023-11-29 05:09:37,284 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:09:37" (1/1) ... [2023-11-29 05:09:37,297 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:09:37" (1/1) ... [2023-11-29 05:09:37,300 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:09:37" (1/1) ... [2023-11-29 05:09:37,303 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:09:37" (1/1) ... [2023-11-29 05:09:37,305 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:09:37" (1/1) ... [2023-11-29 05:09:37,309 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-29 05:09:37,310 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-29 05:09:37,310 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-29 05:09:37,310 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-29 05:09:37,311 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:09:37" (1/1) ... [2023-11-29 05:09:37,317 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 05:09:37,327 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a004bb2d-d8b4-4969-87b1-fc9d64ff2ac9/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:09:37,341 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a004bb2d-d8b4-4969-87b1-fc9d64ff2ac9/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-29 05:09:37,344 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a004bb2d-d8b4-4969-87b1-fc9d64ff2ac9/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-29 05:09:37,374 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-29 05:09:37,374 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-11-29 05:09:37,374 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-29 05:09:37,374 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2023-11-29 05:09:37,374 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-29 05:09:37,374 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-29 05:09:37,375 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-29 05:09:37,375 INFO L130 BoogieDeclarations]: Found specification of procedure thread [2023-11-29 05:09:37,375 INFO L138 BoogieDeclarations]: Found implementation of procedure thread [2023-11-29 05:09:37,375 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-29 05:09:37,375 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-29 05:09:37,376 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-29 05:09:37,504 INFO L241 CfgBuilder]: Building ICFG [2023-11-29 05:09:37,506 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-29 05:09:37,770 INFO L282 CfgBuilder]: Performing block encoding [2023-11-29 05:09:37,782 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-29 05:09:37,782 INFO L309 CfgBuilder]: Removed 2 assume(true) statements. [2023-11-29 05:09:37,784 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 05:09:37 BoogieIcfgContainer [2023-11-29 05:09:37,784 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-29 05:09:37,787 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-29 05:09:37,787 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-29 05:09:37,789 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-29 05:09:37,789 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.11 05:09:36" (1/3) ... [2023-11-29 05:09:37,790 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ffa8c18 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 05:09:37, skipping insertion in model container [2023-11-29 05:09:37,790 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:09:37" (2/3) ... [2023-11-29 05:09:37,790 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ffa8c18 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 05:09:37, skipping insertion in model container [2023-11-29 05:09:37,791 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 05:09:37" (3/3) ... [2023-11-29 05:09:37,792 INFO L112 eAbstractionObserver]: Analyzing ICFG per-thread-array-init.i [2023-11-29 05:09:37,798 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-11-29 05:09:37,806 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-29 05:09:37,807 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 9 error locations. [2023-11-29 05:09:37,807 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-29 05:09:37,867 INFO L144 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2023-11-29 05:09:37,898 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 135 places, 136 transitions, 279 flow [2023-11-29 05:09:37,977 INFO L124 PetriNetUnfolderBase]: 6/219 cut-off events. [2023-11-29 05:09:37,977 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2023-11-29 05:09:37,982 INFO L83 FinitePrefix]: Finished finitePrefix Result has 224 conditions, 219 events. 6/219 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 376 event pairs, 0 based on Foata normal form. 0/193 useless extension candidates. Maximal degree in co-relation 108. Up to 4 conditions per place. [2023-11-29 05:09:37,982 INFO L82 GeneralOperation]: Start removeDead. Operand has 135 places, 136 transitions, 279 flow [2023-11-29 05:09:37,987 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 135 places, 136 transitions, 279 flow [2023-11-29 05:09:37,996 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-29 05:09:38,002 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=LoopHeads, 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;@b6167ff, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-29 05:09:38,003 INFO L358 AbstractCegarLoop]: Starting to check reachability of 11 error locations. [2023-11-29 05:09:38,013 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-29 05:09:38,013 INFO L124 PetriNetUnfolderBase]: 3/42 cut-off events. [2023-11-29 05:09:38,013 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-29 05:09:38,013 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:09:38,014 INFO L208 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] [2023-11-29 05:09:38,014 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)] === [2023-11-29 05:09:38,019 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:09:38,019 INFO L85 PathProgramCache]: Analyzing trace with hash 82393490, now seen corresponding path program 1 times [2023-11-29 05:09:38,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:09:38,027 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2103259932] [2023-11-29 05:09:38,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:09:38,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:09:38,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:09:38,761 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 05:09:38,761 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:09:38,762 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2103259932] [2023-11-29 05:09:38,762 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2103259932] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:09:38,762 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:09:38,763 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 05:09:38,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1305034077] [2023-11-29 05:09:38,765 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:09:38,773 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 05:09:38,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:09:38,802 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 05:09:38,803 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-29 05:09:39,343 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 136 [2023-11-29 05:09:39,347 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 135 places, 136 transitions, 279 flow. Second operand has 6 states, 6 states have (on average 106.16666666666667) internal successors, (637), 6 states have internal predecessors, (637), 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) [2023-11-29 05:09:39,348 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:09:39,348 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 136 [2023-11-29 05:09:39,349 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:09:39,446 INFO L124 PetriNetUnfolderBase]: 1/239 cut-off events. [2023-11-29 05:09:39,446 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2023-11-29 05:09:39,447 INFO L83 FinitePrefix]: Finished finitePrefix Result has 295 conditions, 239 events. 1/239 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 381 event pairs, 0 based on Foata normal form. 6/225 useless extension candidates. Maximal degree in co-relation 40. Up to 24 conditions per place. [2023-11-29 05:09:39,448 INFO L140 encePairwiseOnDemand]: 116/136 looper letters, 19 selfloop transitions, 10 changer transitions 5/138 dead transitions. [2023-11-29 05:09:39,449 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 137 places, 138 transitions, 349 flow [2023-11-29 05:09:39,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 05:09:39,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-29 05:09:39,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 671 transitions. [2023-11-29 05:09:39,466 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8223039215686274 [2023-11-29 05:09:39,467 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 671 transitions. [2023-11-29 05:09:39,467 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 671 transitions. [2023-11-29 05:09:39,470 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:09:39,472 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 671 transitions. [2023-11-29 05:09:39,478 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 111.83333333333333) internal successors, (671), 6 states have internal predecessors, (671), 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) [2023-11-29 05:09:39,485 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 136.0) internal successors, (952), 7 states have internal predecessors, (952), 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) [2023-11-29 05:09:39,486 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 136.0) internal successors, (952), 7 states have internal predecessors, (952), 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) [2023-11-29 05:09:39,488 INFO L175 Difference]: Start difference. First operand has 135 places, 136 transitions, 279 flow. Second operand 6 states and 671 transitions. [2023-11-29 05:09:39,489 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 137 places, 138 transitions, 349 flow [2023-11-29 05:09:39,493 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 137 places, 138 transitions, 349 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-29 05:09:39,497 INFO L231 Difference]: Finished difference. Result has 141 places, 133 transitions, 325 flow [2023-11-29 05:09:39,499 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=136, PETRI_DIFFERENCE_MINUEND_FLOW=267, PETRI_DIFFERENCE_MINUEND_PLACES=132, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=130, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=120, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=325, PETRI_PLACES=141, PETRI_TRANSITIONS=133} [2023-11-29 05:09:39,502 INFO L281 CegarLoopForPetriNet]: 135 programPoint places, 6 predicate places. [2023-11-29 05:09:39,503 INFO L495 AbstractCegarLoop]: Abstraction has has 141 places, 133 transitions, 325 flow [2023-11-29 05:09:39,503 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 106.16666666666667) internal successors, (637), 6 states have internal predecessors, (637), 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) [2023-11-29 05:09:39,504 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:09:39,504 INFO L208 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] [2023-11-29 05:09:39,504 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-29 05:09:39,504 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)] === [2023-11-29 05:09:39,505 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:09:39,505 INFO L85 PathProgramCache]: Analyzing trace with hash 213058564, now seen corresponding path program 1 times [2023-11-29 05:09:39,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:09:39,506 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [778048952] [2023-11-29 05:09:39,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:09:39,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:09:39,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:09:39,611 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 05:09:39,612 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:09:39,612 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [778048952] [2023-11-29 05:09:39,612 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [778048952] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:09:39,612 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:09:39,613 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 05:09:39,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1546037227] [2023-11-29 05:09:39,613 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:09:39,614 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 05:09:39,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:09:39,615 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 05:09:39,615 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-29 05:09:39,708 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 120 out of 136 [2023-11-29 05:09:39,709 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 141 places, 133 transitions, 325 flow. Second operand has 5 states, 5 states have (on average 121.4) internal successors, (607), 5 states have internal predecessors, (607), 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) [2023-11-29 05:09:39,709 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:09:39,709 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 136 [2023-11-29 05:09:39,709 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:09:39,764 INFO L124 PetriNetUnfolderBase]: 0/219 cut-off events. [2023-11-29 05:09:39,764 INFO L125 PetriNetUnfolderBase]: For 11/11 co-relation queries the response was YES. [2023-11-29 05:09:39,764 INFO L83 FinitePrefix]: Finished finitePrefix Result has 289 conditions, 219 events. 0/219 cut-off events. For 11/11 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 280 event pairs, 0 based on Foata normal form. 1/208 useless extension candidates. Maximal degree in co-relation 0. Up to 15 conditions per place. [2023-11-29 05:09:39,765 INFO L140 encePairwiseOnDemand]: 129/136 looper letters, 11 selfloop transitions, 6 changer transitions 0/137 dead transitions. [2023-11-29 05:09:39,765 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 145 places, 137 transitions, 367 flow [2023-11-29 05:09:39,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 05:09:39,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-29 05:09:39,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 738 transitions. [2023-11-29 05:09:39,769 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9044117647058824 [2023-11-29 05:09:39,769 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 738 transitions. [2023-11-29 05:09:39,769 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 738 transitions. [2023-11-29 05:09:39,770 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:09:39,770 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 738 transitions. [2023-11-29 05:09:39,773 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 123.0) internal successors, (738), 6 states have internal predecessors, (738), 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) [2023-11-29 05:09:39,775 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 136.0) internal successors, (952), 7 states have internal predecessors, (952), 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) [2023-11-29 05:09:39,776 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 136.0) internal successors, (952), 7 states have internal predecessors, (952), 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) [2023-11-29 05:09:39,777 INFO L175 Difference]: Start difference. First operand has 141 places, 133 transitions, 325 flow. Second operand 6 states and 738 transitions. [2023-11-29 05:09:39,777 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 145 places, 137 transitions, 367 flow [2023-11-29 05:09:39,780 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 144 places, 137 transitions, 357 flow, removed 3 selfloop flow, removed 1 redundant places. [2023-11-29 05:09:39,783 INFO L231 Difference]: Finished difference. Result has 148 places, 137 transitions, 355 flow [2023-11-29 05:09:39,784 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=136, PETRI_DIFFERENCE_MINUEND_FLOW=315, PETRI_DIFFERENCE_MINUEND_PLACES=139, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=133, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=127, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=355, PETRI_PLACES=148, PETRI_TRANSITIONS=137} [2023-11-29 05:09:39,785 INFO L281 CegarLoopForPetriNet]: 135 programPoint places, 13 predicate places. [2023-11-29 05:09:39,785 INFO L495 AbstractCegarLoop]: Abstraction has has 148 places, 137 transitions, 355 flow [2023-11-29 05:09:39,786 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 121.4) internal successors, (607), 5 states have internal predecessors, (607), 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) [2023-11-29 05:09:39,786 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:09:39,786 INFO L208 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] [2023-11-29 05:09:39,786 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-29 05:09:39,786 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)] === [2023-11-29 05:09:39,787 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:09:39,787 INFO L85 PathProgramCache]: Analyzing trace with hash -1682416842, now seen corresponding path program 1 times [2023-11-29 05:09:39,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:09:39,787 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [39447542] [2023-11-29 05:09:39,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:09:39,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:09:39,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:09:40,071 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 05:09:40,072 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:09:40,072 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [39447542] [2023-11-29 05:09:40,072 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [39447542] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:09:40,072 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:09:40,072 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 05:09:40,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1090532029] [2023-11-29 05:09:40,073 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:09:40,073 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 05:09:40,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:09:40,074 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 05:09:40,074 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-29 05:09:40,484 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 136 [2023-11-29 05:09:40,485 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 148 places, 137 transitions, 355 flow. Second operand has 6 states, 6 states have (on average 106.16666666666667) internal successors, (637), 6 states have internal predecessors, (637), 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) [2023-11-29 05:09:40,485 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:09:40,485 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 136 [2023-11-29 05:09:40,485 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:09:40,553 INFO L124 PetriNetUnfolderBase]: 0/212 cut-off events. [2023-11-29 05:09:40,553 INFO L125 PetriNetUnfolderBase]: For 11/11 co-relation queries the response was YES. [2023-11-29 05:09:40,553 INFO L83 FinitePrefix]: Finished finitePrefix Result has 327 conditions, 212 events. 0/212 cut-off events. For 11/11 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 253 event pairs, 0 based on Foata normal form. 0/207 useless extension candidates. Maximal degree in co-relation 0. Up to 28 conditions per place. [2023-11-29 05:09:40,554 INFO L140 encePairwiseOnDemand]: 123/136 looper letters, 20 selfloop transitions, 6 changer transitions 8/139 dead transitions. [2023-11-29 05:09:40,554 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 150 places, 139 transitions, 421 flow [2023-11-29 05:09:40,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 05:09:40,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-29 05:09:40,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 663 transitions. [2023-11-29 05:09:40,557 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8125 [2023-11-29 05:09:40,558 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 663 transitions. [2023-11-29 05:09:40,558 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 663 transitions. [2023-11-29 05:09:40,558 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:09:40,558 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 663 transitions. [2023-11-29 05:09:40,561 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 110.5) internal successors, (663), 6 states have internal predecessors, (663), 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) [2023-11-29 05:09:40,563 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 136.0) internal successors, (952), 7 states have internal predecessors, (952), 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) [2023-11-29 05:09:40,564 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 136.0) internal successors, (952), 7 states have internal predecessors, (952), 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) [2023-11-29 05:09:40,564 INFO L175 Difference]: Start difference. First operand has 148 places, 137 transitions, 355 flow. Second operand 6 states and 663 transitions. [2023-11-29 05:09:40,564 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 150 places, 139 transitions, 421 flow [2023-11-29 05:09:40,567 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 149 places, 139 transitions, 419 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-29 05:09:40,570 INFO L231 Difference]: Finished difference. Result has 154 places, 131 transitions, 361 flow [2023-11-29 05:09:40,570 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=136, PETRI_DIFFERENCE_MINUEND_FLOW=347, PETRI_DIFFERENCE_MINUEND_PLACES=144, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=134, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=128, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=361, PETRI_PLACES=154, PETRI_TRANSITIONS=131} [2023-11-29 05:09:40,571 INFO L281 CegarLoopForPetriNet]: 135 programPoint places, 19 predicate places. [2023-11-29 05:09:40,571 INFO L495 AbstractCegarLoop]: Abstraction has has 154 places, 131 transitions, 361 flow [2023-11-29 05:09:40,572 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 106.16666666666667) internal successors, (637), 6 states have internal predecessors, (637), 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) [2023-11-29 05:09:40,572 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:09:40,572 INFO L208 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, 1] [2023-11-29 05:09:40,572 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-29 05:09:40,573 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)] === [2023-11-29 05:09:40,573 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:09:40,573 INFO L85 PathProgramCache]: Analyzing trace with hash -899302659, now seen corresponding path program 1 times [2023-11-29 05:09:40,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:09:40,574 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1975669940] [2023-11-29 05:09:40,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:09:40,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:09:40,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:09:40,849 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 05:09:40,849 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:09:40,850 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1975669940] [2023-11-29 05:09:40,850 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1975669940] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:09:40,850 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:09:40,850 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 05:09:40,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [798753367] [2023-11-29 05:09:40,851 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:09:40,851 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 05:09:40,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:09:40,852 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 05:09:40,852 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-29 05:09:41,079 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 84 out of 136 [2023-11-29 05:09:41,080 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 154 places, 131 transitions, 361 flow. Second operand has 6 states, 6 states have (on average 86.16666666666667) internal successors, (517), 6 states have internal predecessors, (517), 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) [2023-11-29 05:09:41,080 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:09:41,081 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 136 [2023-11-29 05:09:41,082 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:09:41,301 INFO L124 PetriNetUnfolderBase]: 178/730 cut-off events. [2023-11-29 05:09:41,301 INFO L125 PetriNetUnfolderBase]: For 94/94 co-relation queries the response was YES. [2023-11-29 05:09:41,305 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1396 conditions, 730 events. 178/730 cut-off events. For 94/94 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 3779 event pairs, 140 based on Foata normal form. 0/706 useless extension candidates. Maximal degree in co-relation 1194. Up to 415 conditions per place. [2023-11-29 05:09:41,308 INFO L140 encePairwiseOnDemand]: 125/136 looper letters, 52 selfloop transitions, 23 changer transitions 0/152 dead transitions. [2023-11-29 05:09:41,308 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 156 places, 152 transitions, 553 flow [2023-11-29 05:09:41,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 05:09:41,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-29 05:09:41,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 575 transitions. [2023-11-29 05:09:41,311 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7046568627450981 [2023-11-29 05:09:41,311 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 575 transitions. [2023-11-29 05:09:41,311 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 575 transitions. [2023-11-29 05:09:41,312 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:09:41,312 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 575 transitions. [2023-11-29 05:09:41,313 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 95.83333333333333) internal successors, (575), 6 states have internal predecessors, (575), 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) [2023-11-29 05:09:41,315 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 136.0) internal successors, (952), 7 states have internal predecessors, (952), 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) [2023-11-29 05:09:41,316 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 136.0) internal successors, (952), 7 states have internal predecessors, (952), 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) [2023-11-29 05:09:41,316 INFO L175 Difference]: Start difference. First operand has 154 places, 131 transitions, 361 flow. Second operand 6 states and 575 transitions. [2023-11-29 05:09:41,316 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 156 places, 152 transitions, 553 flow [2023-11-29 05:09:41,321 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 145 places, 152 transitions, 518 flow, removed 9 selfloop flow, removed 11 redundant places. [2023-11-29 05:09:41,323 INFO L231 Difference]: Finished difference. Result has 150 places, 152 transitions, 480 flow [2023-11-29 05:09:41,324 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=136, PETRI_DIFFERENCE_MINUEND_FLOW=326, PETRI_DIFFERENCE_MINUEND_PLACES=140, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=131, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=120, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=480, PETRI_PLACES=150, PETRI_TRANSITIONS=152} [2023-11-29 05:09:41,324 INFO L281 CegarLoopForPetriNet]: 135 programPoint places, 15 predicate places. [2023-11-29 05:09:41,325 INFO L495 AbstractCegarLoop]: Abstraction has has 150 places, 152 transitions, 480 flow [2023-11-29 05:09:41,325 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 86.16666666666667) internal successors, (517), 6 states have internal predecessors, (517), 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) [2023-11-29 05:09:41,325 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:09:41,325 INFO L208 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, 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] [2023-11-29 05:09:41,325 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-29 05:09:41,326 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2023-11-29 05:09:41,326 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:09:41,326 INFO L85 PathProgramCache]: Analyzing trace with hash -1880402312, now seen corresponding path program 1 times [2023-11-29 05:09:41,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:09:41,326 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1412408317] [2023-11-29 05:09:41,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:09:41,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:09:41,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:09:41,658 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 05:09:41,658 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:09:41,658 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1412408317] [2023-11-29 05:09:41,659 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1412408317] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:09:41,659 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:09:41,659 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 05:09:41,659 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [521616726] [2023-11-29 05:09:41,659 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:09:41,659 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 05:09:41,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:09:41,660 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 05:09:41,660 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-29 05:09:42,062 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 120 out of 136 [2023-11-29 05:09:42,063 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 150 places, 152 transitions, 480 flow. Second operand has 6 states, 6 states have (on average 121.83333333333333) internal successors, (731), 6 states have internal predecessors, (731), 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) [2023-11-29 05:09:42,064 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:09:42,064 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 136 [2023-11-29 05:09:42,064 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:09:42,196 INFO L124 PetriNetUnfolderBase]: 72/504 cut-off events. [2023-11-29 05:09:42,197 INFO L125 PetriNetUnfolderBase]: For 219/255 co-relation queries the response was YES. [2023-11-29 05:09:42,198 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1029 conditions, 504 events. 72/504 cut-off events. For 219/255 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 2212 event pairs, 7 based on Foata normal form. 4/492 useless extension candidates. Maximal degree in co-relation 868. Up to 116 conditions per place. [2023-11-29 05:09:42,201 INFO L140 encePairwiseOnDemand]: 126/136 looper letters, 28 selfloop transitions, 31 changer transitions 26/178 dead transitions. [2023-11-29 05:09:42,201 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 155 places, 178 transitions, 740 flow [2023-11-29 05:09:42,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 05:09:42,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-29 05:09:42,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 754 transitions. [2023-11-29 05:09:42,205 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9240196078431373 [2023-11-29 05:09:42,205 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 754 transitions. [2023-11-29 05:09:42,205 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 754 transitions. [2023-11-29 05:09:42,206 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:09:42,206 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 754 transitions. [2023-11-29 05:09:42,208 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 125.66666666666667) internal successors, (754), 6 states have internal predecessors, (754), 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) [2023-11-29 05:09:42,211 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 136.0) internal successors, (952), 7 states have internal predecessors, (952), 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) [2023-11-29 05:09:42,211 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 136.0) internal successors, (952), 7 states have internal predecessors, (952), 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) [2023-11-29 05:09:42,211 INFO L175 Difference]: Start difference. First operand has 150 places, 152 transitions, 480 flow. Second operand 6 states and 754 transitions. [2023-11-29 05:09:42,212 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 155 places, 178 transitions, 740 flow [2023-11-29 05:09:42,215 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 154 places, 178 transitions, 733 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-29 05:09:42,219 INFO L231 Difference]: Finished difference. Result has 159 places, 152 transitions, 713 flow [2023-11-29 05:09:42,219 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=136, PETRI_DIFFERENCE_MINUEND_FLOW=477, PETRI_DIFFERENCE_MINUEND_PLACES=149, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=152, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=133, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=713, PETRI_PLACES=159, PETRI_TRANSITIONS=152} [2023-11-29 05:09:42,220 INFO L281 CegarLoopForPetriNet]: 135 programPoint places, 24 predicate places. [2023-11-29 05:09:42,220 INFO L495 AbstractCegarLoop]: Abstraction has has 159 places, 152 transitions, 713 flow [2023-11-29 05:09:42,221 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 121.83333333333333) internal successors, (731), 6 states have internal predecessors, (731), 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) [2023-11-29 05:09:42,221 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:09:42,221 INFO L208 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, 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, 1, 1, 1, 1, 1, 1] [2023-11-29 05:09:42,221 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-29 05:09:42,221 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)] === [2023-11-29 05:09:42,222 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:09:42,222 INFO L85 PathProgramCache]: Analyzing trace with hash -1345881083, now seen corresponding path program 1 times [2023-11-29 05:09:42,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:09:42,222 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [535394915] [2023-11-29 05:09:42,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:09:42,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:09:42,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:09:42,774 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-29 05:09:42,774 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:09:42,774 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [535394915] [2023-11-29 05:09:42,774 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [535394915] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:09:42,774 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:09:42,775 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 05:09:42,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1107025503] [2023-11-29 05:09:42,775 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:09:42,775 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 05:09:42,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:09:42,776 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 05:09:42,776 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-29 05:09:43,186 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 136 [2023-11-29 05:09:43,187 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 159 places, 152 transitions, 713 flow. Second operand has 6 states, 6 states have (on average 116.16666666666667) internal successors, (697), 6 states have internal predecessors, (697), 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) [2023-11-29 05:09:43,187 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:09:43,187 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 136 [2023-11-29 05:09:43,187 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:09:43,284 INFO L124 PetriNetUnfolderBase]: 65/435 cut-off events. [2023-11-29 05:09:43,284 INFO L125 PetriNetUnfolderBase]: For 445/470 co-relation queries the response was YES. [2023-11-29 05:09:43,286 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1060 conditions, 435 events. 65/435 cut-off events. For 445/470 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1904 event pairs, 3 based on Foata normal form. 0/434 useless extension candidates. Maximal degree in co-relation 912. Up to 74 conditions per place. [2023-11-29 05:09:43,288 INFO L140 encePairwiseOnDemand]: 130/136 looper letters, 29 selfloop transitions, 0 changer transitions 22/151 dead transitions. [2023-11-29 05:09:43,288 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 137 places, 151 transitions, 789 flow [2023-11-29 05:09:43,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 05:09:43,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-29 05:09:43,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 701 transitions. [2023-11-29 05:09:43,291 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8590686274509803 [2023-11-29 05:09:43,291 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 701 transitions. [2023-11-29 05:09:43,291 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 701 transitions. [2023-11-29 05:09:43,292 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:09:43,292 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 701 transitions. [2023-11-29 05:09:43,294 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 116.83333333333333) internal successors, (701), 6 states have internal predecessors, (701), 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) [2023-11-29 05:09:43,296 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 136.0) internal successors, (952), 7 states have internal predecessors, (952), 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) [2023-11-29 05:09:43,297 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 136.0) internal successors, (952), 7 states have internal predecessors, (952), 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) [2023-11-29 05:09:43,297 INFO L175 Difference]: Start difference. First operand has 159 places, 152 transitions, 713 flow. Second operand 6 states and 701 transitions. [2023-11-29 05:09:43,297 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 137 places, 151 transitions, 789 flow [2023-11-29 05:09:43,303 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 137 places, 151 transitions, 771 flow, removed 9 selfloop flow, removed 0 redundant places. [2023-11-29 05:09:43,305 INFO L231 Difference]: Finished difference. Result has 137 places, 129 transitions, 644 flow [2023-11-29 05:09:43,305 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=136, PETRI_DIFFERENCE_MINUEND_FLOW=693, PETRI_DIFFERENCE_MINUEND_PLACES=132, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=151, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=151, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=644, PETRI_PLACES=137, PETRI_TRANSITIONS=129} [2023-11-29 05:09:43,306 INFO L281 CegarLoopForPetriNet]: 135 programPoint places, 2 predicate places. [2023-11-29 05:09:43,306 INFO L495 AbstractCegarLoop]: Abstraction has has 137 places, 129 transitions, 644 flow [2023-11-29 05:09:43,307 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 116.16666666666667) internal successors, (697), 6 states have internal predecessors, (697), 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) [2023-11-29 05:09:43,307 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:09:43,307 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 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, 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] [2023-11-29 05:09:43,307 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-29 05:09:43,308 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)] === [2023-11-29 05:09:43,308 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:09:43,308 INFO L85 PathProgramCache]: Analyzing trace with hash 754420472, now seen corresponding path program 1 times [2023-11-29 05:09:43,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:09:43,308 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1409610871] [2023-11-29 05:09:43,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:09:43,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:09:43,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:09:45,414 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 05:09:45,414 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:09:45,414 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1409610871] [2023-11-29 05:09:45,414 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1409610871] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 05:09:45,415 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [600278089] [2023-11-29 05:09:45,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:09:45,415 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 05:09:45,415 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a004bb2d-d8b4-4969-87b1-fc9d64ff2ac9/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:09:45,419 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a004bb2d-d8b4-4969-87b1-fc9d64ff2ac9/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 05:09:45,423 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a004bb2d-d8b4-4969-87b1-fc9d64ff2ac9/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-29 05:09:45,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:09:45,584 INFO L262 TraceCheckSpWp]: Trace formula consists of 309 conjuncts, 48 conjunts are in the unsatisfiable core [2023-11-29 05:09:45,604 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:09:45,657 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2023-11-29 05:09:45,696 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2023-11-29 05:09:45,696 INFO L378 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 15 treesize of output 15 [2023-11-29 05:09:45,963 INFO L349 Elim1Store]: treesize reduction 36, result has 29.4 percent of original size [2023-11-29 05:09:45,964 INFO L378 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 33 treesize of output 33 [2023-11-29 05:09:45,984 INFO L378 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 13 treesize of output 9 [2023-11-29 05:09:46,733 INFO L349 Elim1Store]: treesize reduction 56, result has 36.4 percent of original size [2023-11-29 05:09:46,733 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 63 treesize of output 74 [2023-11-29 05:09:46,757 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 05:09:46,758 INFO L378 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 16 treesize of output 11 [2023-11-29 05:09:46,883 INFO L378 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 5 treesize of output 3 [2023-11-29 05:09:47,159 INFO L378 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 [2023-11-29 05:09:47,165 INFO L378 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 15 treesize of output 7 [2023-11-29 05:09:47,244 INFO L378 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 [2023-11-29 05:09:47,306 INFO L378 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 [2023-11-29 05:09:47,385 INFO L378 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 [2023-11-29 05:09:47,487 INFO L378 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 [2023-11-29 05:09:47,791 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 05:09:47,792 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 05:09:47,793 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 05:09:47,794 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 05:09:47,797 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 05:09:47,798 INFO L378 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 63 treesize of output 60 [2023-11-29 05:09:47,810 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 05:09:47,810 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 05:09:51,945 INFO L378 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 [2023-11-29 05:09:56,127 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_360 (Array Int Int)) (v_ArrVal_361 (Array Int Int))) (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_360))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (or (not (= |c_ULTIMATE.start_main_~#is~0#1.base| .cse0)) (not (= (select (select (store .cse1 .cse0 v_ArrVal_361) |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|))))))) is different from false [2023-11-29 05:09:56,173 WARN L854 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_#t~mem8#1.base_14| Int)) (or (< (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|) |v_ULTIMATE.start_main_#t~mem8#1.base_14|) (forall ((v_ArrVal_360 (Array Int Int)) (v_ArrVal_361 (Array Int Int))) (let ((.cse0 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_#t~mem8#1.base_14| v_ArrVal_360))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (or (not (= (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_361) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|))) (not (= .cse1 |c_ULTIMATE.start_main_~#is~0#1.base|)))))))) is different from false [2023-11-29 05:09:56,572 INFO L378 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 20 treesize of output 18 [2023-11-29 05:09:56,709 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 05:09:56,710 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 99 treesize of output 101 [2023-11-29 05:09:56,721 INFO L378 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 48 treesize of output 42 [2023-11-29 05:09:56,938 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 8 not checked. [2023-11-29 05:09:56,938 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [600278089] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 05:09:56,938 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 05:09:56,938 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 23, 23] total 63 [2023-11-29 05:09:56,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [939151334] [2023-11-29 05:09:56,938 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 05:09:56,939 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 64 states [2023-11-29 05:09:56,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:09:56,941 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2023-11-29 05:09:56,943 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=258, Invalid=3524, Unknown=8, NotChecked=242, Total=4032 [2023-11-29 05:09:58,674 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 136 [2023-11-29 05:09:58,677 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 137 places, 129 transitions, 644 flow. Second operand has 64 states, 64 states have (on average 38.859375) internal successors, (2487), 64 states have internal predecessors, (2487), 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) [2023-11-29 05:09:58,678 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:09:58,678 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 136 [2023-11-29 05:09:58,678 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:10:03,593 INFO L124 PetriNetUnfolderBase]: 420/1094 cut-off events. [2023-11-29 05:10:03,593 INFO L125 PetriNetUnfolderBase]: For 1272/1272 co-relation queries the response was YES. [2023-11-29 05:10:03,595 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3372 conditions, 1094 events. 420/1094 cut-off events. For 1272/1272 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 4840 event pairs, 9 based on Foata normal form. 5/1099 useless extension candidates. Maximal degree in co-relation 3352. Up to 336 conditions per place. [2023-11-29 05:10:03,601 INFO L140 encePairwiseOnDemand]: 104/136 looper letters, 182 selfloop transitions, 62 changer transitions 0/264 dead transitions. [2023-11-29 05:10:03,601 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 141 places, 264 transitions, 1782 flow [2023-11-29 05:10:03,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2023-11-29 05:10:03,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2023-11-29 05:10:03,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 1285 transitions. [2023-11-29 05:10:03,606 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.31495098039215685 [2023-11-29 05:10:03,607 INFO L72 ComplementDD]: Start complementDD. Operand 30 states and 1285 transitions. [2023-11-29 05:10:03,607 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 1285 transitions. [2023-11-29 05:10:03,608 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:10:03,608 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 30 states and 1285 transitions. [2023-11-29 05:10:03,611 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 31 states, 30 states have (on average 42.833333333333336) internal successors, (1285), 30 states have internal predecessors, (1285), 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) [2023-11-29 05:10:03,616 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 31 states, 31 states have (on average 136.0) internal successors, (4216), 31 states have internal predecessors, (4216), 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) [2023-11-29 05:10:03,617 INFO L81 ComplementDD]: Finished complementDD. Result has 31 states, 31 states have (on average 136.0) internal successors, (4216), 31 states have internal predecessors, (4216), 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) [2023-11-29 05:10:03,617 INFO L175 Difference]: Start difference. First operand has 137 places, 129 transitions, 644 flow. Second operand 30 states and 1285 transitions. [2023-11-29 05:10:03,617 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 141 places, 264 transitions, 1782 flow [2023-11-29 05:10:03,624 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 140 places, 264 transitions, 1780 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-29 05:10:03,627 INFO L231 Difference]: Finished difference. Result has 150 places, 149 transitions, 982 flow [2023-11-29 05:10:03,628 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=136, PETRI_DIFFERENCE_MINUEND_FLOW=642, PETRI_DIFFERENCE_MINUEND_PLACES=111, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=129, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=42, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=30, PETRI_FLOW=982, PETRI_PLACES=150, PETRI_TRANSITIONS=149} [2023-11-29 05:10:03,628 INFO L281 CegarLoopForPetriNet]: 135 programPoint places, 15 predicate places. [2023-11-29 05:10:03,628 INFO L495 AbstractCegarLoop]: Abstraction has has 150 places, 149 transitions, 982 flow [2023-11-29 05:10:03,629 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 64 states, 64 states have (on average 38.859375) internal successors, (2487), 64 states have internal predecessors, (2487), 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) [2023-11-29 05:10:03,629 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:10:03,630 INFO L208 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, 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, 1, 1, 1, 1, 1, 1] [2023-11-29 05:10:03,637 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a004bb2d-d8b4-4969-87b1-fc9d64ff2ac9/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-29 05:10:03,830 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a004bb2d-d8b4-4969-87b1-fc9d64ff2ac9/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2023-11-29 05:10:03,831 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2023-11-29 05:10:03,831 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:10:03,831 INFO L85 PathProgramCache]: Analyzing trace with hash -1958933017, now seen corresponding path program 1 times [2023-11-29 05:10:03,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:10:03,832 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [365697143] [2023-11-29 05:10:03,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:10:03,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:10:03,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:10:06,431 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 05:10:06,431 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:10:06,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [365697143] [2023-11-29 05:10:06,431 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [365697143] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 05:10:06,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1936701063] [2023-11-29 05:10:06,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:10:06,431 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 05:10:06,432 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a004bb2d-d8b4-4969-87b1-fc9d64ff2ac9/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:10:06,432 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a004bb2d-d8b4-4969-87b1-fc9d64ff2ac9/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 05:10:06,446 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a004bb2d-d8b4-4969-87b1-fc9d64ff2ac9/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-29 05:10:06,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:10:06,587 INFO L262 TraceCheckSpWp]: Trace formula consists of 309 conjuncts, 54 conjunts are in the unsatisfiable core [2023-11-29 05:10:06,593 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:10:06,607 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2023-11-29 05:10:06,626 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2023-11-29 05:10:06,627 INFO L378 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 15 treesize of output 15 [2023-11-29 05:10:06,909 INFO L349 Elim1Store]: treesize reduction 44, result has 20.0 percent of original size [2023-11-29 05:10:06,909 INFO L378 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 43 treesize of output 45 [2023-11-29 05:10:07,286 INFO L349 Elim1Store]: treesize reduction 40, result has 27.3 percent of original size [2023-11-29 05:10:07,287 INFO L378 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 66 treesize of output 66 [2023-11-29 05:10:07,295 INFO L378 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 20 treesize of output 11 [2023-11-29 05:10:07,300 INFO L378 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 12 treesize of output 8 [2023-11-29 05:10:07,503 INFO L378 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 [2023-11-29 05:10:07,573 INFO L378 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 [2023-11-29 05:10:07,663 INFO L378 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 [2023-11-29 05:10:07,750 INFO L378 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 [2023-11-29 05:10:08,172 INFO L378 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 [2023-11-29 05:10:08,177 INFO L378 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 [2023-11-29 05:10:08,261 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 05:10:08,262 INFO L378 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 43 treesize of output 32 [2023-11-29 05:10:08,281 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 05:10:08,282 INFO L378 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 43 treesize of output 32 [2023-11-29 05:10:08,304 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 05:10:08,304 INFO L378 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 43 treesize of output 32 [2023-11-29 05:10:08,326 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 05:10:08,327 INFO L378 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 43 treesize of output 32 [2023-11-29 05:10:08,426 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 05:10:08,428 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 05:10:08,429 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 05:10:08,430 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 05:10:08,433 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 05:10:08,433 INFO L378 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 58 treesize of output 47 [2023-11-29 05:10:08,443 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 05:10:08,443 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 05:10:08,657 WARN L854 $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_536 (Array Int Int)) (v_ArrVal_537 Int)) (= (select (select (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_536))) (store .cse0 |c_ULTIMATE.start_main_#t~mem8#1.base| (store (select .cse0 |c_ULTIMATE.start_main_#t~mem8#1.base|) .cse1 v_ArrVal_537))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 2)) 0)) (forall ((v_ArrVal_536 (Array Int Int)) (v_ArrVal_537 Int)) (= (select (select (let ((.cse2 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_536))) (store .cse2 |c_ULTIMATE.start_main_#t~mem8#1.base| (store (select .cse2 |c_ULTIMATE.start_main_#t~mem8#1.base|) .cse1 v_ArrVal_537))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 1)) 0)) (forall ((v_ArrVal_536 (Array Int Int)) (v_ArrVal_537 Int)) (= (select (select (let ((.cse3 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_536))) (store .cse3 |c_ULTIMATE.start_main_#t~mem8#1.base| (store (select .cse3 |c_ULTIMATE.start_main_#t~mem8#1.base|) .cse1 v_ArrVal_537))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 3)) 0)) (forall ((v_ArrVal_536 (Array Int Int)) (v_ArrVal_537 Int)) (= (select (select (let ((.cse4 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_536))) (store .cse4 |c_ULTIMATE.start_main_#t~mem8#1.base| (store (select .cse4 |c_ULTIMATE.start_main_#t~mem8#1.base|) .cse1 v_ArrVal_537))) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) 0)))) is different from false [2023-11-29 05:10:08,756 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)) (.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)) (.cse2 (* |c_ULTIMATE.start_main_~i~1#1| 4))) (and (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_15| Int)) (or (forall ((v_ArrVal_536 (Array Int Int)) (v_ArrVal_537 Int)) (= (select (select (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_536))) (store .cse0 .cse1 (store (select .cse0 .cse1) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_15| .cse2) v_ArrVal_537))) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) 0)) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_15| .cse3))) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_15| Int)) (or (< |v_ULTIMATE.start_main_#t~mem8#1.offset_15| .cse3) (forall ((v_ArrVal_536 (Array Int Int)) (v_ArrVal_537 Int)) (= (select (select (let ((.cse4 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_536))) (store .cse4 .cse1 (store (select .cse4 .cse1) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_15| .cse2) v_ArrVal_537))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 2)) 0)))) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_15| Int)) (or (forall ((v_ArrVal_536 (Array Int Int)) (v_ArrVal_537 Int)) (= (select (select (let ((.cse5 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_536))) (store .cse5 .cse1 (store (select .cse5 .cse1) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_15| .cse2) v_ArrVal_537))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 1)) 0)) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_15| .cse3))) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_15| Int)) (or (< |v_ULTIMATE.start_main_#t~mem8#1.offset_15| .cse3) (forall ((v_ArrVal_536 (Array Int Int)) (v_ArrVal_537 Int)) (= (select (select (let ((.cse6 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_536))) (store .cse6 .cse1 (store (select .cse6 .cse1) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_15| .cse2) v_ArrVal_537))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 3)) 0)))))) is different from false [2023-11-29 05:10:12,884 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_ULTIMATE.start_main_#t~post7#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|)) (.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_~i~1#1_21| Int)) (or (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_15| Int)) (or (< |v_ULTIMATE.start_main_#t~mem8#1.offset_15| .cse0) (forall ((v_ArrVal_536 (Array Int Int)) (v_ArrVal_537 Int)) (= (select (select (let ((.cse1 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_536))) (store .cse1 .cse2 (store (select .cse1 .cse2) (+ (* |v_ULTIMATE.start_main_~i~1#1_21| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_15|) v_ArrVal_537))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 1)) 0)))) (< |v_ULTIMATE.start_main_~i~1#1_21| .cse3))) (forall ((|v_ULTIMATE.start_main_~i~1#1_21| Int)) (or (< |v_ULTIMATE.start_main_~i~1#1_21| .cse3) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_15| Int)) (or (forall ((v_ArrVal_536 (Array Int Int)) (v_ArrVal_537 Int)) (= (select (select (let ((.cse4 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_536))) (store .cse4 .cse2 (store (select .cse4 .cse2) (+ (* |v_ULTIMATE.start_main_~i~1#1_21| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_15|) v_ArrVal_537))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 2)) 0)) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_15| .cse0))))) (forall ((|v_ULTIMATE.start_main_~i~1#1_21| Int)) (or (< |v_ULTIMATE.start_main_~i~1#1_21| .cse3) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_15| Int)) (or (forall ((v_ArrVal_536 (Array Int Int)) (v_ArrVal_537 Int)) (= (select (select (let ((.cse5 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_536))) (store .cse5 .cse2 (store (select .cse5 .cse2) (+ (* |v_ULTIMATE.start_main_~i~1#1_21| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_15|) v_ArrVal_537))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 3)) 0)) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_15| .cse0))))) (forall ((|v_ULTIMATE.start_main_~i~1#1_21| Int)) (or (< |v_ULTIMATE.start_main_~i~1#1_21| .cse3) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_15| Int)) (or (forall ((v_ArrVal_536 (Array Int Int)) (v_ArrVal_537 Int)) (= (select (select (let ((.cse6 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_536))) (store .cse6 .cse2 (store (select .cse6 .cse2) (+ (* |v_ULTIMATE.start_main_~i~1#1_21| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_15|) v_ArrVal_537))) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) 0)) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_15| .cse0))))))) is different from false [2023-11-29 05:10:12,959 WARN L854 $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|)) (.cse0 (+ |c_ULTIMATE.start_main_~i~1#1| 1)) (.cse1 (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_ArrVal_536 (Array Int Int)) (v_ArrVal_537 Int) (|v_ULTIMATE.start_main_~i~1#1_21| Int) (|v_ULTIMATE.start_main_#t~mem8#1.offset_15| Int)) (or (< |v_ULTIMATE.start_main_~i~1#1_21| .cse0) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_15| .cse1) (= (select (select (let ((.cse2 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_536))) (store .cse2 .cse3 (store (select .cse2 .cse3) (+ (* |v_ULTIMATE.start_main_~i~1#1_21| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_15|) v_ArrVal_537))) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) 0))) (forall ((v_ArrVal_536 (Array Int Int)) (v_ArrVal_537 Int) (|v_ULTIMATE.start_main_~i~1#1_21| Int) (|v_ULTIMATE.start_main_#t~mem8#1.offset_15| Int)) (or (= (select (select (let ((.cse4 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_536))) (store .cse4 .cse3 (store (select .cse4 .cse3) (+ (* |v_ULTIMATE.start_main_~i~1#1_21| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_15|) v_ArrVal_537))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 3)) 0) (< |v_ULTIMATE.start_main_~i~1#1_21| .cse0) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_15| .cse1))) (forall ((v_ArrVal_536 (Array Int Int)) (v_ArrVal_537 Int) (|v_ULTIMATE.start_main_~i~1#1_21| Int) (|v_ULTIMATE.start_main_#t~mem8#1.offset_15| Int)) (or (= (select (select (let ((.cse5 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_536))) (store .cse5 .cse3 (store (select .cse5 .cse3) (+ (* |v_ULTIMATE.start_main_~i~1#1_21| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_15|) v_ArrVal_537))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 1)) 0) (< |v_ULTIMATE.start_main_~i~1#1_21| .cse0) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_15| .cse1))) (forall ((v_ArrVal_536 (Array Int Int)) (v_ArrVal_537 Int) (|v_ULTIMATE.start_main_~i~1#1_21| Int) (|v_ULTIMATE.start_main_#t~mem8#1.offset_15| Int)) (or (= (select (select (let ((.cse6 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_536))) (store .cse6 .cse3 (store (select .cse6 .cse3) (+ (* |v_ULTIMATE.start_main_~i~1#1_21| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_15|) v_ArrVal_537))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 2)) 0) (< |v_ULTIMATE.start_main_~i~1#1_21| .cse0) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_15| .cse1))))) is different from false [2023-11-29 05:10:13,257 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse7 (+ c_threadThread1of1ForFork0_~p~0.offset 3))) (let ((.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 (select |c_#race| c_threadThread1of1ForFork0_~p~0.base) .cse7 0))) (.cse0 (+ |c_ULTIMATE.start_main_~i~1#1| 1)) (.cse1 (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_ArrVal_536 (Array Int Int)) (v_ArrVal_537 Int) (|v_ULTIMATE.start_main_~i~1#1_21| Int) (|v_ULTIMATE.start_main_#t~mem8#1.offset_15| Int)) (or (< |v_ULTIMATE.start_main_~i~1#1_21| .cse0) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_15| .cse1) (= (select (select (let ((.cse2 (store .cse4 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_536))) (store .cse2 .cse3 (store (select .cse2 .cse3) (+ (* |v_ULTIMATE.start_main_~i~1#1_21| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_15|) v_ArrVal_537))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 1)) 0))) (forall ((v_ArrVal_536 (Array Int Int)) (v_ArrVal_537 Int) (|v_ULTIMATE.start_main_~i~1#1_21| Int) (|v_ULTIMATE.start_main_#t~mem8#1.offset_15| Int)) (or (= (select (select (let ((.cse5 (store .cse4 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_536))) (store .cse5 .cse3 (store (select .cse5 .cse3) (+ (* |v_ULTIMATE.start_main_~i~1#1_21| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_15|) v_ArrVal_537))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 2)) 0) (< |v_ULTIMATE.start_main_~i~1#1_21| .cse0) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_15| .cse1))) (forall ((v_ArrVal_536 (Array Int Int)) (v_ArrVal_537 Int) (|v_ULTIMATE.start_main_~i~1#1_21| Int) (|v_ULTIMATE.start_main_#t~mem8#1.offset_15| Int)) (or (= (select (select (let ((.cse6 (store .cse4 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_536))) (store .cse6 .cse3 (store (select .cse6 .cse3) (+ (* |v_ULTIMATE.start_main_~i~1#1_21| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_15|) v_ArrVal_537))) c_threadThread1of1ForFork0_~p~0.base) .cse7) 0) (< |v_ULTIMATE.start_main_~i~1#1_21| .cse0) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_15| .cse1))) (forall ((v_ArrVal_536 (Array Int Int)) (v_ArrVal_537 Int) (|v_ULTIMATE.start_main_~i~1#1_21| Int) (|v_ULTIMATE.start_main_#t~mem8#1.offset_15| Int)) (or (= (select (select (let ((.cse8 (store .cse4 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_536))) (store .cse8 .cse3 (store (select .cse8 .cse3) (+ (* |v_ULTIMATE.start_main_~i~1#1_21| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_15|) v_ArrVal_537))) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) 0) (< |v_ULTIMATE.start_main_~i~1#1_21| .cse0) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_15| .cse1)))))) is different from false [2023-11-29 05:10:13,356 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse8 (+ c_threadThread1of1ForFork0_~p~0.offset 2)) (.cse6 (+ c_threadThread1of1ForFork0_~p~0.offset 3))) (let ((.cse0 (+ |c_ULTIMATE.start_main_~i~1#1| 1)) (.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) .cse8 0) .cse6 0)))) (and (forall ((v_ArrVal_536 (Array Int Int)) (v_ArrVal_537 Int) (|v_ULTIMATE.start_main_~i~1#1_21| Int) (|v_ULTIMATE.start_main_#t~mem8#1.offset_15| Int)) (or (< |v_ULTIMATE.start_main_~i~1#1_21| .cse0) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_15| .cse1) (= (select (select (let ((.cse2 (store .cse4 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_536))) (store .cse2 .cse3 (store (select .cse2 .cse3) (+ (* |v_ULTIMATE.start_main_~i~1#1_21| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_15|) v_ArrVal_537))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 1)) 0))) (forall ((v_ArrVal_536 (Array Int Int)) (v_ArrVal_537 Int) (|v_ULTIMATE.start_main_~i~1#1_21| Int) (|v_ULTIMATE.start_main_#t~mem8#1.offset_15| Int)) (or (= (select (select (let ((.cse5 (store .cse4 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_536))) (store .cse5 .cse3 (store (select .cse5 .cse3) (+ (* |v_ULTIMATE.start_main_~i~1#1_21| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_15|) v_ArrVal_537))) c_threadThread1of1ForFork0_~p~0.base) .cse6) 0) (< |v_ULTIMATE.start_main_~i~1#1_21| .cse0) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_15| .cse1))) (forall ((v_ArrVal_536 (Array Int Int)) (v_ArrVal_537 Int) (|v_ULTIMATE.start_main_~i~1#1_21| Int) (|v_ULTIMATE.start_main_#t~mem8#1.offset_15| Int)) (or (= (select (select (let ((.cse7 (store .cse4 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_536))) (store .cse7 .cse3 (store (select .cse7 .cse3) (+ (* |v_ULTIMATE.start_main_~i~1#1_21| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_15|) v_ArrVal_537))) c_threadThread1of1ForFork0_~p~0.base) .cse8) 0) (< |v_ULTIMATE.start_main_~i~1#1_21| .cse0) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_15| .cse1))) (forall ((v_ArrVal_536 (Array Int Int)) (v_ArrVal_537 Int) (|v_ULTIMATE.start_main_~i~1#1_21| Int) (|v_ULTIMATE.start_main_#t~mem8#1.offset_15| Int)) (or (< |v_ULTIMATE.start_main_~i~1#1_21| .cse0) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_15| .cse1) (= (select (select (let ((.cse9 (store .cse4 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_536))) (store .cse9 .cse3 (store (select .cse9 .cse3) (+ (* |v_ULTIMATE.start_main_~i~1#1_21| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_15|) v_ArrVal_537))) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) 0)))))) is different from false [2023-11-29 05:10:13,502 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (+ c_threadThread1of1ForFork0_~p~0.offset 1)) (.cse7 (+ c_threadThread1of1ForFork0_~p~0.offset 2)) (.cse9 (+ c_threadThread1of1ForFork0_~p~0.offset 3))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)) (.cse2 (store |c_#race| c_threadThread1of1ForFork0_~p~0.base (store (store (store (select |c_#race| c_threadThread1of1ForFork0_~p~0.base) .cse3 0) .cse7 0) .cse9 0))) (.cse4 (+ |c_ULTIMATE.start_main_~i~1#1| 1)) (.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_ArrVal_536 (Array Int Int)) (v_ArrVal_537 Int) (|v_ULTIMATE.start_main_~i~1#1_21| Int) (|v_ULTIMATE.start_main_#t~mem8#1.offset_15| Int)) (or (= (select (select (let ((.cse0 (store .cse2 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_536))) (store .cse0 .cse1 (store (select .cse0 .cse1) (+ (* |v_ULTIMATE.start_main_~i~1#1_21| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_15|) v_ArrVal_537))) c_threadThread1of1ForFork0_~p~0.base) .cse3) 0) (< |v_ULTIMATE.start_main_~i~1#1_21| .cse4) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_15| .cse5))) (forall ((v_ArrVal_536 (Array Int Int)) (v_ArrVal_537 Int) (|v_ULTIMATE.start_main_~i~1#1_21| Int) (|v_ULTIMATE.start_main_#t~mem8#1.offset_15| Int)) (or (< |v_ULTIMATE.start_main_~i~1#1_21| .cse4) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_15| .cse5) (= (select (select (let ((.cse6 (store .cse2 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_536))) (store .cse6 .cse1 (store (select .cse6 .cse1) (+ (* |v_ULTIMATE.start_main_~i~1#1_21| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_15|) v_ArrVal_537))) c_threadThread1of1ForFork0_~p~0.base) .cse7) 0))) (forall ((v_ArrVal_536 (Array Int Int)) (v_ArrVal_537 Int) (|v_ULTIMATE.start_main_~i~1#1_21| Int) (|v_ULTIMATE.start_main_#t~mem8#1.offset_15| Int)) (or (= (select (select (let ((.cse8 (store .cse2 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_536))) (store .cse8 .cse1 (store (select .cse8 .cse1) (+ (* |v_ULTIMATE.start_main_~i~1#1_21| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_15|) v_ArrVal_537))) c_threadThread1of1ForFork0_~p~0.base) .cse9) 0) (< |v_ULTIMATE.start_main_~i~1#1_21| .cse4) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_15| .cse5))) (forall ((v_ArrVal_536 (Array Int Int)) (v_ArrVal_537 Int) (|v_ULTIMATE.start_main_~i~1#1_21| Int) (|v_ULTIMATE.start_main_#t~mem8#1.offset_15| Int)) (or (= (select (select (let ((.cse10 (store .cse2 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_536))) (store .cse10 .cse1 (store (select .cse10 .cse1) (+ (* |v_ULTIMATE.start_main_~i~1#1_21| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_15|) v_ArrVal_537))) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) 0) (< |v_ULTIMATE.start_main_~i~1#1_21| .cse4) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_15| .cse5)))))) is different from false [2023-11-29 05:10:13,535 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 05:10:13,535 INFO L378 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 79 treesize of output 72 [2023-11-29 05:10:13,547 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 05:10:13,547 INFO L378 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 232 treesize of output 220 [2023-11-29 05:10:13,562 INFO L378 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 177 treesize of output 169 [2023-11-29 05:10:13,592 INFO L378 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 31 treesize of output 17 [2023-11-29 05:10:13,606 INFO L378 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 140 treesize of output 122 [2023-11-29 05:10:13,758 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 05:10:13,758 INFO L378 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 [2023-11-29 05:10:13,764 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 05:10:13,775 INFO L349 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2023-11-29 05:10:13,775 INFO L378 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 [2023-11-29 05:10:13,788 INFO L378 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 48 treesize of output 44 [2023-11-29 05:10:13,798 INFO L378 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 80 treesize of output 62 [2023-11-29 05:10:13,825 INFO L349 Elim1Store]: treesize reduction 38, result has 2.6 percent of original size [2023-11-29 05:10:13,826 INFO L378 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 [2023-11-29 05:10:13,836 INFO L349 Elim1Store]: treesize reduction 38, result has 2.6 percent of original size [2023-11-29 05:10:13,836 INFO L378 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 [2023-11-29 05:10:14,363 INFO L378 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 70 treesize of output 62 [2023-11-29 05:10:14,504 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_524 (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_524) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)))) (forall ((v_ArrVal_524 (Array Int Int))) (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_524))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (or (not (= .cse0 |c_ULTIMATE.start_main_~#is~0#1.base|)) (forall ((v_ArrVal_525 (Array Int Int))) (not (= (select (select (store .cse1 .cse0 v_ArrVal_525) |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|))))))))) is different from false [2023-11-29 05:10:14,560 WARN L854 $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_ArrVal_524 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_524) |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_524 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_524))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (or (not (= |c_ULTIMATE.start_main_~#is~0#1.base| .cse1)) (forall ((v_ArrVal_525 (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_525) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)))))))))) is different from false [2023-11-29 05:10:15,036 INFO L349 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2023-11-29 05:10:15,037 INFO L378 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 322 treesize of output 205 [2023-11-29 05:10:15,052 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 05:10:15,052 INFO L378 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 85 treesize of output 85 [2023-11-29 05:10:15,058 INFO L378 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 58 treesize of output 54 [2023-11-29 05:10:15,188 INFO L378 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 10 treesize of output 8 [2023-11-29 05:10:15,245 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 8 not checked. [2023-11-29 05:10:15,245 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1936701063] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 05:10:15,245 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 05:10:15,245 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 23, 24] total 66 [2023-11-29 05:10:15,245 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1960644728] [2023-11-29 05:10:15,246 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 05:10:15,246 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 67 states [2023-11-29 05:10:15,248 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:10:15,248 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2023-11-29 05:10:15,250 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=234, Invalid=3097, Unknown=11, NotChecked=1080, Total=4422 [2023-11-29 05:10:15,254 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 38 out of 136 [2023-11-29 05:10:15,257 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 150 places, 149 transitions, 982 flow. Second operand has 67 states, 67 states have (on average 40.56716417910448) internal successors, (2718), 67 states have internal predecessors, (2718), 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) [2023-11-29 05:10:15,257 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:10:15,257 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 38 of 136 [2023-11-29 05:10:15,258 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:10:22,438 INFO L124 PetriNetUnfolderBase]: 437/1312 cut-off events. [2023-11-29 05:10:22,438 INFO L125 PetriNetUnfolderBase]: For 2011/2011 co-relation queries the response was YES. [2023-11-29 05:10:22,441 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4306 conditions, 1312 events. 437/1312 cut-off events. For 2011/2011 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 6986 event pairs, 87 based on Foata normal form. 19/1331 useless extension candidates. Maximal degree in co-relation 4276. Up to 728 conditions per place. [2023-11-29 05:10:22,447 INFO L140 encePairwiseOnDemand]: 105/136 looper letters, 197 selfloop transitions, 57 changer transitions 0/276 dead transitions. [2023-11-29 05:10:22,447 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 184 places, 276 transitions, 2135 flow [2023-11-29 05:10:22,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2023-11-29 05:10:22,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2023-11-29 05:10:22,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 1520 transitions. [2023-11-29 05:10:22,452 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.31932773109243695 [2023-11-29 05:10:22,452 INFO L72 ComplementDD]: Start complementDD. Operand 35 states and 1520 transitions. [2023-11-29 05:10:22,452 INFO L73 IsDeterministic]: Start isDeterministic. Operand 35 states and 1520 transitions. [2023-11-29 05:10:22,454 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:10:22,454 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 35 states and 1520 transitions. [2023-11-29 05:10:22,457 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 36 states, 35 states have (on average 43.42857142857143) internal successors, (1520), 35 states have internal predecessors, (1520), 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) [2023-11-29 05:10:22,462 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 36 states, 36 states have (on average 136.0) internal successors, (4896), 36 states have internal predecessors, (4896), 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) [2023-11-29 05:10:22,463 INFO L81 ComplementDD]: Finished complementDD. Result has 36 states, 36 states have (on average 136.0) internal successors, (4896), 36 states have internal predecessors, (4896), 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) [2023-11-29 05:10:22,463 INFO L175 Difference]: Start difference. First operand has 150 places, 149 transitions, 982 flow. Second operand 35 states and 1520 transitions. [2023-11-29 05:10:22,463 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 184 places, 276 transitions, 2135 flow [2023-11-29 05:10:22,473 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 171 places, 276 transitions, 2071 flow, removed 0 selfloop flow, removed 13 redundant places. [2023-11-29 05:10:22,477 INFO L231 Difference]: Finished difference. Result has 178 places, 189 transitions, 1391 flow [2023-11-29 05:10:22,477 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=136, PETRI_DIFFERENCE_MINUEND_FLOW=958, PETRI_DIFFERENCE_MINUEND_PLACES=137, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=149, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=111, PETRI_DIFFERENCE_SUBTRAHEND_STATES=35, PETRI_FLOW=1391, PETRI_PLACES=178, PETRI_TRANSITIONS=189} [2023-11-29 05:10:22,478 INFO L281 CegarLoopForPetriNet]: 135 programPoint places, 43 predicate places. [2023-11-29 05:10:22,478 INFO L495 AbstractCegarLoop]: Abstraction has has 178 places, 189 transitions, 1391 flow [2023-11-29 05:10:22,480 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 67 states, 67 states have (on average 40.56716417910448) internal successors, (2718), 67 states have internal predecessors, (2718), 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) [2023-11-29 05:10:22,480 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:10:22,480 INFO L208 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, 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, 1, 1, 1, 1, 1, 1] [2023-11-29 05:10:22,485 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a004bb2d-d8b4-4969-87b1-fc9d64ff2ac9/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-11-29 05:10:22,680 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a004bb2d-d8b4-4969-87b1-fc9d64ff2ac9/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2023-11-29 05:10:22,681 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2023-11-29 05:10:22,681 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:10:22,681 INFO L85 PathProgramCache]: Analyzing trace with hash 96045315, now seen corresponding path program 2 times [2023-11-29 05:10:22,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:10:22,681 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [318340514] [2023-11-29 05:10:22,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:10:22,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:10:22,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:10:24,765 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 05:10:24,765 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:10:24,765 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [318340514] [2023-11-29 05:10:24,765 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [318340514] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 05:10:24,765 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [103677859] [2023-11-29 05:10:24,766 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-29 05:10:24,766 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 05:10:24,766 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a004bb2d-d8b4-4969-87b1-fc9d64ff2ac9/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:10:24,767 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a004bb2d-d8b4-4969-87b1-fc9d64ff2ac9/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 05:10:24,769 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a004bb2d-d8b4-4969-87b1-fc9d64ff2ac9/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-29 05:10:24,894 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-29 05:10:24,894 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 05:10:24,896 INFO L262 TraceCheckSpWp]: Trace formula consists of 309 conjuncts, 50 conjunts are in the unsatisfiable core [2023-11-29 05:10:24,901 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:10:25,249 INFO L349 Elim1Store]: treesize reduction 40, result has 21.6 percent of original size [2023-11-29 05:10:25,249 INFO L378 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 52 treesize of output 44 [2023-11-29 05:10:25,718 INFO L349 Elim1Store]: treesize reduction 44, result has 20.0 percent of original size [2023-11-29 05:10:25,719 INFO L378 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 76 treesize of output 70 [2023-11-29 05:10:25,728 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 05:10:25,729 INFO L378 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 24 treesize of output 11 [2023-11-29 05:10:26,292 INFO L378 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 [2023-11-29 05:10:26,388 INFO L378 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 [2023-11-29 05:10:26,496 INFO L378 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 [2023-11-29 05:10:26,796 INFO L378 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 [2023-11-29 05:10:26,807 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 05:10:26,807 INFO L378 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 [2023-11-29 05:10:26,912 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 05:10:26,913 INFO L378 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 34 treesize of output 25 [2023-11-29 05:10:26,932 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 05:10:26,933 INFO L378 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 34 treesize of output 25 [2023-11-29 05:10:26,953 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 05:10:26,953 INFO L378 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 34 treesize of output 25 [2023-11-29 05:10:26,974 INFO L378 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 [2023-11-29 05:10:27,082 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 05:10:27,082 INFO L378 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 43 treesize of output 32 [2023-11-29 05:10:27,206 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 05:10:27,207 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 05:10:27,208 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 05:10:27,209 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 05:10:27,212 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 05:10:27,212 INFO L378 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 58 treesize of output 47 [2023-11-29 05:10:27,220 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 05:10:27,220 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 05:10:27,434 WARN L854 $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_703 (Array Int Int)) (v_ArrVal_705 Int)) (= (select (select (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_703))) (store .cse0 |c_ULTIMATE.start_main_#t~mem8#1.base| (store (select .cse0 |c_ULTIMATE.start_main_#t~mem8#1.base|) .cse1 v_ArrVal_705))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 1)) 0)) (forall ((v_ArrVal_703 (Array Int Int)) (v_ArrVal_705 Int)) (= (select (select (let ((.cse2 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_703))) (store .cse2 |c_ULTIMATE.start_main_#t~mem8#1.base| (store (select .cse2 |c_ULTIMATE.start_main_#t~mem8#1.base|) .cse1 v_ArrVal_705))) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) 0)) (forall ((v_ArrVal_703 (Array Int Int)) (v_ArrVal_705 Int)) (= (select (select (let ((.cse3 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_703))) (store .cse3 |c_ULTIMATE.start_main_#t~mem8#1.base| (store (select .cse3 |c_ULTIMATE.start_main_#t~mem8#1.base|) .cse1 v_ArrVal_705))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 2)) 0)) (forall ((v_ArrVal_703 (Array Int Int)) (v_ArrVal_705 Int)) (= (select (select (let ((.cse4 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_703))) (store .cse4 |c_ULTIMATE.start_main_#t~mem8#1.base| (store (select .cse4 |c_ULTIMATE.start_main_#t~mem8#1.base|) .cse1 v_ArrVal_705))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 3)) 0)))) is different from false [2023-11-29 05:10:27,460 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse5 (+ c_threadThread1of1ForFork0_~p~0.offset 3))) (let ((.cse1 (+ |c_ULTIMATE.start_main_#t~mem8#1.offset| (* |c_ULTIMATE.start_main_~i~1#1| 4))) (.cse2 (store |c_#race| c_threadThread1of1ForFork0_~p~0.base (store (select |c_#race| c_threadThread1of1ForFork0_~p~0.base) .cse5 0)))) (and (forall ((v_ArrVal_703 (Array Int Int)) (v_ArrVal_705 Int)) (= (select (select (let ((.cse0 (store .cse2 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_703))) (store .cse0 |c_ULTIMATE.start_main_#t~mem8#1.base| (store (select .cse0 |c_ULTIMATE.start_main_#t~mem8#1.base|) .cse1 v_ArrVal_705))) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) 0)) (forall ((v_ArrVal_703 (Array Int Int)) (v_ArrVal_705 Int)) (= (select (select (let ((.cse3 (store .cse2 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_703))) (store .cse3 |c_ULTIMATE.start_main_#t~mem8#1.base| (store (select .cse3 |c_ULTIMATE.start_main_#t~mem8#1.base|) .cse1 v_ArrVal_705))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 2)) 0)) (forall ((v_ArrVal_703 (Array Int Int)) (v_ArrVal_705 Int)) (= (select (select (let ((.cse4 (store .cse2 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_703))) (store .cse4 |c_ULTIMATE.start_main_#t~mem8#1.base| (store (select .cse4 |c_ULTIMATE.start_main_#t~mem8#1.base|) .cse1 v_ArrVal_705))) c_threadThread1of1ForFork0_~p~0.base) .cse5) 0)) (forall ((v_ArrVal_703 (Array Int Int)) (v_ArrVal_705 Int)) (= (select (select (let ((.cse6 (store .cse2 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_703))) (store .cse6 |c_ULTIMATE.start_main_#t~mem8#1.base| (store (select .cse6 |c_ULTIMATE.start_main_#t~mem8#1.base|) .cse1 v_ArrVal_705))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 1)) 0))))) is different from false [2023-11-29 05:10:27,487 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_#t~mem8#1.offset| (* |c_ULTIMATE.start_main_~i~1#1| 4))) (.cse2 (+ c_threadThread1of1ForFork0_~p~0.offset 3))) (and (forall ((v_ArrVal_701 (Array Int Int)) (v_ArrVal_703 (Array Int Int)) (v_ArrVal_705 Int)) (= (select (select (let ((.cse0 (store (store |c_#race| c_threadThread1of1ForFork0_~p~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_701) c_threadThread1of1ForFork0_~p~0.base) .cse2 0)) |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_703))) (store .cse0 |c_ULTIMATE.start_main_#t~mem8#1.base| (store (select .cse0 |c_ULTIMATE.start_main_#t~mem8#1.base|) .cse1 v_ArrVal_705))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 1)) 0)) (forall ((v_ArrVal_701 (Array Int Int)) (v_ArrVal_703 (Array Int Int)) (v_ArrVal_705 Int)) (= (select (select (let ((.cse3 (store (store |c_#race| c_threadThread1of1ForFork0_~p~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_701) c_threadThread1of1ForFork0_~p~0.base) .cse2 0)) |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_703))) (store .cse3 |c_ULTIMATE.start_main_#t~mem8#1.base| (store (select .cse3 |c_ULTIMATE.start_main_#t~mem8#1.base|) .cse1 v_ArrVal_705))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 2)) 0)) (forall ((v_ArrVal_701 (Array Int Int)) (v_ArrVal_703 (Array Int Int)) (v_ArrVal_705 Int)) (= (select (select (let ((.cse4 (store (store |c_#race| c_threadThread1of1ForFork0_~p~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_701) c_threadThread1of1ForFork0_~p~0.base) .cse2 0)) |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_703))) (store .cse4 |c_ULTIMATE.start_main_#t~mem8#1.base| (store (select .cse4 |c_ULTIMATE.start_main_#t~mem8#1.base|) .cse1 v_ArrVal_705))) c_threadThread1of1ForFork0_~p~0.base) .cse2) 0)) (forall ((v_ArrVal_701 (Array Int Int)) (v_ArrVal_703 (Array Int Int)) (v_ArrVal_705 Int)) (= (select (select (let ((.cse5 (store (store |c_#race| c_threadThread1of1ForFork0_~p~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_701) c_threadThread1of1ForFork0_~p~0.base) .cse2 0)) |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_703))) (store .cse5 |c_ULTIMATE.start_main_#t~mem8#1.base| (store (select .cse5 |c_ULTIMATE.start_main_#t~mem8#1.base|) .cse1 v_ArrVal_705))) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) 0)))) is different from false [2023-11-29 05:10:27,631 WARN L854 $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)) (.cse4 (+ c_threadThread1of1ForFork0_~p~0.offset 3)) (.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_18| Int)) (or (< |v_ULTIMATE.start_main_#t~mem8#1.offset_18| .cse0) (forall ((v_ArrVal_701 (Array Int Int)) (v_ArrVal_703 (Array Int Int)) (v_ArrVal_705 Int)) (= (select (select (let ((.cse1 (store (store |c_#race| c_threadThread1of1ForFork0_~p~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_701) c_threadThread1of1ForFork0_~p~0.base) .cse4 0)) |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_703))) (store .cse1 .cse2 (store (select .cse1 .cse2) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_18| .cse3) v_ArrVal_705))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 1)) 0)))) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_18| Int)) (or (< |v_ULTIMATE.start_main_#t~mem8#1.offset_18| .cse0) (forall ((v_ArrVal_701 (Array Int Int)) (v_ArrVal_703 (Array Int Int)) (v_ArrVal_705 Int)) (= (select (select (let ((.cse5 (store (store |c_#race| c_threadThread1of1ForFork0_~p~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_701) c_threadThread1of1ForFork0_~p~0.base) .cse4 0)) |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_703))) (store .cse5 .cse2 (store (select .cse5 .cse2) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_18| .cse3) v_ArrVal_705))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 2)) 0)))) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_18| Int)) (or (< |v_ULTIMATE.start_main_#t~mem8#1.offset_18| .cse0) (forall ((v_ArrVal_701 (Array Int Int)) (v_ArrVal_703 (Array Int Int)) (v_ArrVal_705 Int)) (= (select (select (let ((.cse6 (store (store |c_#race| c_threadThread1of1ForFork0_~p~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_701) c_threadThread1of1ForFork0_~p~0.base) .cse4 0)) |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_703))) (store .cse6 .cse2 (store (select .cse6 .cse2) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_18| .cse3) v_ArrVal_705))) c_threadThread1of1ForFork0_~p~0.base) .cse4) 0)))) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_18| Int)) (or (forall ((v_ArrVal_701 (Array Int Int)) (v_ArrVal_703 (Array Int Int)) (v_ArrVal_705 Int)) (= (select (select (let ((.cse7 (store (store |c_#race| c_threadThread1of1ForFork0_~p~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_701) c_threadThread1of1ForFork0_~p~0.base) .cse4 0)) |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_703))) (store .cse7 .cse2 (store (select .cse7 .cse2) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_18| .cse3) v_ArrVal_705))) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) 0)) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_18| .cse0))))) is different from false [2023-11-29 05:10:31,792 WARN L854 $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_threadThread1of1ForFork0_~p~0.offset 3)) (.cse4 (+ |c_ULTIMATE.start_main_#t~post7#1| 1))) (and (forall ((|v_ULTIMATE.start_main_~i~1#1_23| Int)) (or (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_18| Int)) (or (< |v_ULTIMATE.start_main_#t~mem8#1.offset_18| .cse0) (forall ((v_ArrVal_701 (Array Int Int)) (v_ArrVal_703 (Array Int Int)) (v_ArrVal_705 Int)) (= (select (select (let ((.cse1 (store (store |c_#race| c_threadThread1of1ForFork0_~p~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_701) c_threadThread1of1ForFork0_~p~0.base) .cse3 0)) |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_703))) (store .cse1 .cse2 (store (select .cse1 .cse2) (+ (* |v_ULTIMATE.start_main_~i~1#1_23| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_18|) v_ArrVal_705))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 2)) 0)))) (< |v_ULTIMATE.start_main_~i~1#1_23| .cse4))) (forall ((|v_ULTIMATE.start_main_~i~1#1_23| Int)) (or (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_18| Int)) (or (< |v_ULTIMATE.start_main_#t~mem8#1.offset_18| .cse0) (forall ((v_ArrVal_701 (Array Int Int)) (v_ArrVal_703 (Array Int Int)) (v_ArrVal_705 Int)) (= (select (select (let ((.cse5 (store (store |c_#race| c_threadThread1of1ForFork0_~p~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_701) c_threadThread1of1ForFork0_~p~0.base) .cse3 0)) |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_703))) (store .cse5 .cse2 (store (select .cse5 .cse2) (+ (* |v_ULTIMATE.start_main_~i~1#1_23| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_18|) v_ArrVal_705))) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) 0)))) (< |v_ULTIMATE.start_main_~i~1#1_23| .cse4))) (forall ((|v_ULTIMATE.start_main_~i~1#1_23| Int)) (or (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_18| Int)) (or (< |v_ULTIMATE.start_main_#t~mem8#1.offset_18| .cse0) (forall ((v_ArrVal_701 (Array Int Int)) (v_ArrVal_703 (Array Int Int)) (v_ArrVal_705 Int)) (= 0 (select (select (let ((.cse6 (store (store |c_#race| c_threadThread1of1ForFork0_~p~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_701) c_threadThread1of1ForFork0_~p~0.base) .cse3 0)) |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_703))) (store .cse6 .cse2 (store (select .cse6 .cse2) (+ (* |v_ULTIMATE.start_main_~i~1#1_23| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_18|) v_ArrVal_705))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 1)))))) (< |v_ULTIMATE.start_main_~i~1#1_23| .cse4))) (forall ((|v_ULTIMATE.start_main_~i~1#1_23| Int)) (or (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_18| Int)) (or (< |v_ULTIMATE.start_main_#t~mem8#1.offset_18| .cse0) (forall ((v_ArrVal_701 (Array Int Int)) (v_ArrVal_703 (Array Int Int)) (v_ArrVal_705 Int)) (= (select (select (let ((.cse7 (store (store |c_#race| c_threadThread1of1ForFork0_~p~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_701) c_threadThread1of1ForFork0_~p~0.base) .cse3 0)) |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_703))) (store .cse7 .cse2 (store (select .cse7 .cse2) (+ (* |v_ULTIMATE.start_main_~i~1#1_23| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_18|) v_ArrVal_705))) c_threadThread1of1ForFork0_~p~0.base) .cse3) 0)))) (< |v_ULTIMATE.start_main_~i~1#1_23| .cse4))))) is different from false [2023-11-29 05:10:35,875 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse7 (+ 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|)) (.cse3 (store |c_#race| c_threadThread1of1ForFork0_~p~0.base (store (select |c_#race| c_threadThread1of1ForFork0_~p~0.base) .cse7 0))) (.cse4 (+ c_threadThread1of1ForFork0_~p~0.offset 3)) (.cse5 (+ |c_ULTIMATE.start_main_#t~post7#1| 1))) (and (forall ((|v_ULTIMATE.start_main_~i~1#1_23| Int)) (or (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_18| Int)) (or (< |v_ULTIMATE.start_main_#t~mem8#1.offset_18| .cse0) (forall ((v_ArrVal_701 (Array Int Int)) (v_ArrVal_703 (Array Int Int)) (v_ArrVal_705 Int)) (= (select (select (let ((.cse1 (store (store |c_#race| c_threadThread1of1ForFork0_~p~0.base (store (select (store .cse3 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_701) c_threadThread1of1ForFork0_~p~0.base) .cse4 0)) |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_703))) (store .cse1 .cse2 (store (select .cse1 .cse2) (+ (* |v_ULTIMATE.start_main_~i~1#1_23| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_18|) v_ArrVal_705))) c_threadThread1of1ForFork0_~p~0.base) .cse4) 0)))) (< |v_ULTIMATE.start_main_~i~1#1_23| .cse5))) (forall ((|v_ULTIMATE.start_main_~i~1#1_23| Int)) (or (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_18| Int)) (or (< |v_ULTIMATE.start_main_#t~mem8#1.offset_18| .cse0) (forall ((v_ArrVal_701 (Array Int Int)) (v_ArrVal_703 (Array Int Int)) (v_ArrVal_705 Int)) (= (select (select (let ((.cse6 (store (store |c_#race| c_threadThread1of1ForFork0_~p~0.base (store (select (store .cse3 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_701) c_threadThread1of1ForFork0_~p~0.base) .cse4 0)) |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_703))) (store .cse6 .cse2 (store (select .cse6 .cse2) (+ (* |v_ULTIMATE.start_main_~i~1#1_23| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_18|) v_ArrVal_705))) c_threadThread1of1ForFork0_~p~0.base) .cse7) 0)))) (< |v_ULTIMATE.start_main_~i~1#1_23| .cse5))) (forall ((|v_ULTIMATE.start_main_~i~1#1_23| Int)) (or (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_18| Int)) (or (< |v_ULTIMATE.start_main_#t~mem8#1.offset_18| .cse0) (forall ((v_ArrVal_701 (Array Int Int)) (v_ArrVal_703 (Array Int Int)) (v_ArrVal_705 Int)) (= (select (select (let ((.cse8 (store (store |c_#race| c_threadThread1of1ForFork0_~p~0.base (store (select (store .cse3 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_701) c_threadThread1of1ForFork0_~p~0.base) .cse4 0)) |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_703))) (store .cse8 .cse2 (store (select .cse8 .cse2) (+ (* |v_ULTIMATE.start_main_~i~1#1_23| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_18|) v_ArrVal_705))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 1)) 0)))) (< |v_ULTIMATE.start_main_~i~1#1_23| .cse5))) (forall ((|v_ULTIMATE.start_main_~i~1#1_23| Int)) (or (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_18| Int)) (or (< |v_ULTIMATE.start_main_#t~mem8#1.offset_18| .cse0) (forall ((v_ArrVal_701 (Array Int Int)) (v_ArrVal_703 (Array Int Int)) (v_ArrVal_705 Int)) (= (select (select (let ((.cse9 (store (store |c_#race| c_threadThread1of1ForFork0_~p~0.base (store (select (store .cse3 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_701) c_threadThread1of1ForFork0_~p~0.base) .cse4 0)) |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_703))) (store .cse9 .cse2 (store (select .cse9 .cse2) (+ (* |v_ULTIMATE.start_main_~i~1#1_23| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_18|) v_ArrVal_705))) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) 0)))) (< |v_ULTIMATE.start_main_~i~1#1_23| .cse5)))))) is different from false [2023-11-29 05:10:39,968 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse9 (+ c_threadThread1of1ForFork0_~p~0.offset 1)) (.cse5 (+ 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|)) (.cse3 (store |c_#race| c_threadThread1of1ForFork0_~p~0.base (store (store (select |c_#race| c_threadThread1of1ForFork0_~p~0.base) .cse9 0) .cse5 0))) (.cse4 (+ c_threadThread1of1ForFork0_~p~0.offset 3)) (.cse6 (+ |c_ULTIMATE.start_main_#t~post7#1| 1))) (and (forall ((|v_ULTIMATE.start_main_~i~1#1_23| Int)) (or (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_18| Int)) (or (< |v_ULTIMATE.start_main_#t~mem8#1.offset_18| .cse0) (forall ((v_ArrVal_701 (Array Int Int)) (v_ArrVal_703 (Array Int Int)) (v_ArrVal_705 Int)) (= (select (select (let ((.cse1 (store (store |c_#race| c_threadThread1of1ForFork0_~p~0.base (store (select (store .cse3 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_701) c_threadThread1of1ForFork0_~p~0.base) .cse4 0)) |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_703))) (store .cse1 .cse2 (store (select .cse1 .cse2) (+ (* |v_ULTIMATE.start_main_~i~1#1_23| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_18|) v_ArrVal_705))) c_threadThread1of1ForFork0_~p~0.base) .cse5) 0)))) (< |v_ULTIMATE.start_main_~i~1#1_23| .cse6))) (forall ((|v_ULTIMATE.start_main_~i~1#1_23| Int)) (or (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_18| Int)) (or (forall ((v_ArrVal_701 (Array Int Int)) (v_ArrVal_703 (Array Int Int)) (v_ArrVal_705 Int)) (= (select (select (let ((.cse7 (store (store |c_#race| c_threadThread1of1ForFork0_~p~0.base (store (select (store .cse3 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_701) c_threadThread1of1ForFork0_~p~0.base) .cse4 0)) |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_703))) (store .cse7 .cse2 (store (select .cse7 .cse2) (+ (* |v_ULTIMATE.start_main_~i~1#1_23| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_18|) v_ArrVal_705))) c_threadThread1of1ForFork0_~p~0.base) .cse4) 0)) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_18| .cse0))) (< |v_ULTIMATE.start_main_~i~1#1_23| .cse6))) (forall ((|v_ULTIMATE.start_main_~i~1#1_23| Int)) (or (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_18| Int)) (or (< |v_ULTIMATE.start_main_#t~mem8#1.offset_18| .cse0) (forall ((v_ArrVal_701 (Array Int Int)) (v_ArrVal_703 (Array Int Int)) (v_ArrVal_705 Int)) (= (select (select (let ((.cse8 (store (store |c_#race| c_threadThread1of1ForFork0_~p~0.base (store (select (store .cse3 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_701) c_threadThread1of1ForFork0_~p~0.base) .cse4 0)) |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_703))) (store .cse8 .cse2 (store (select .cse8 .cse2) (+ (* |v_ULTIMATE.start_main_~i~1#1_23| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_18|) v_ArrVal_705))) c_threadThread1of1ForFork0_~p~0.base) .cse9) 0)))) (< |v_ULTIMATE.start_main_~i~1#1_23| .cse6))) (forall ((|v_ULTIMATE.start_main_~i~1#1_23| Int)) (or (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_18| Int)) (or (< |v_ULTIMATE.start_main_#t~mem8#1.offset_18| .cse0) (forall ((v_ArrVal_701 (Array Int Int)) (v_ArrVal_703 (Array Int Int)) (v_ArrVal_705 Int)) (= (select (select (let ((.cse10 (store (store |c_#race| c_threadThread1of1ForFork0_~p~0.base (store (select (store .cse3 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_701) c_threadThread1of1ForFork0_~p~0.base) .cse4 0)) |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_703))) (store .cse10 .cse2 (store (select .cse10 .cse2) (+ (* |v_ULTIMATE.start_main_~i~1#1_23| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_18|) v_ArrVal_705))) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) 0)))) (< |v_ULTIMATE.start_main_~i~1#1_23| .cse6)))))) is different from false [2023-11-29 05:10:40,037 INFO L349 Elim1Store]: treesize reduction 31, result has 62.2 percent of original size [2023-11-29 05:10:40,037 INFO L378 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 4 case distinctions, treesize of input 1150 treesize of output 960 [2023-11-29 05:10:40,056 INFO L378 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 244 treesize of output 228 [2023-11-29 05:10:40,081 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 05:10:40,082 INFO L378 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 346 treesize of output 342 [2023-11-29 05:10:40,106 INFO L378 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 109 treesize of output 105 [2023-11-29 05:10:40,276 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 05:10:40,287 INFO L349 Elim1Store]: treesize reduction 81, result has 1.2 percent of original size [2023-11-29 05:10:40,288 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 690 treesize of output 1 [2023-11-29 05:10:40,293 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 05:10:40,304 INFO L349 Elim1Store]: treesize reduction 81, result has 1.2 percent of original size [2023-11-29 05:10:40,304 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 658 treesize of output 1 [2023-11-29 05:10:40,310 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 05:10:40,334 INFO L349 Elim1Store]: treesize reduction 54, result has 34.1 percent of original size [2023-11-29 05:10:40,334 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 442 treesize of output 421 [2023-11-29 05:10:40,341 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 05:10:40,348 INFO L349 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2023-11-29 05:10:40,349 INFO L378 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 63 treesize of output 59 [2023-11-29 05:10:40,355 INFO L378 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 48 treesize of output 44 [2023-11-29 05:10:40,951 INFO L378 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 70 treesize of output 62 [2023-11-29 05:10:41,094 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_691 (Array Int Int))) (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_691))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (or (forall ((v_ArrVal_692 (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 .cse1 v_ArrVal_692) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)))) (not (= .cse1 |c_ULTIMATE.start_main_~#is~0#1.base|)))))) (forall ((v_ArrVal_691 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_691) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|) |c_ULTIMATE.start_main_~#is~0#1.base|)))) is different from false [2023-11-29 05:10:41,164 WARN L854 $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_ULTIMATE.start_main_#t~mem8#1.base_20| Int)) (or (forall ((v_ArrVal_691 (Array Int Int))) (let ((.cse0 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_#t~mem8#1.base_20| v_ArrVal_691))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (or (forall ((v_ArrVal_692 (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 .cse1 v_ArrVal_692) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)))) (not (= |c_ULTIMATE.start_main_~#is~0#1.base| .cse1)))))) (< .cse2 |v_ULTIMATE.start_main_#t~mem8#1.base_20|))) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.base_20| Int)) (or (forall ((v_ArrVal_691 (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_20| v_ArrVal_691) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)))) (< .cse2 |v_ULTIMATE.start_main_#t~mem8#1.base_20|))))) is different from false [2023-11-29 05:10:41,605 INFO L378 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 20 treesize of output 18 [2023-11-29 05:10:41,729 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 05:10:41,730 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 96 treesize of output 98 [2023-11-29 05:10:41,737 INFO L378 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 33 treesize of output 27 [2023-11-29 05:10:41,860 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 8 not checked. [2023-11-29 05:10:41,860 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [103677859] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 05:10:41,860 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 05:10:41,860 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 23, 25] total 69 [2023-11-29 05:10:41,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [148586190] [2023-11-29 05:10:41,860 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 05:10:41,861 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 70 states [2023-11-29 05:10:41,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:10:41,863 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2023-11-29 05:10:41,864 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=238, Invalid=3445, Unknown=13, NotChecked=1134, Total=4830 [2023-11-29 05:10:42,193 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 38 out of 136 [2023-11-29 05:10:42,196 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 178 places, 189 transitions, 1391 flow. Second operand has 70 states, 70 states have (on average 40.52857142857143) internal successors, (2837), 70 states have internal predecessors, (2837), 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) [2023-11-29 05:10:42,196 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:10:42,196 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 38 of 136 [2023-11-29 05:10:42,196 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:10:52,521 INFO L124 PetriNetUnfolderBase]: 608/1883 cut-off events. [2023-11-29 05:10:52,521 INFO L125 PetriNetUnfolderBase]: For 5170/5170 co-relation queries the response was YES. [2023-11-29 05:10:52,526 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6830 conditions, 1883 events. 608/1883 cut-off events. For 5170/5170 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 11583 event pairs, 91 based on Foata normal form. 25/1908 useless extension candidates. Maximal degree in co-relation 6794. Up to 790 conditions per place. [2023-11-29 05:10:52,534 INFO L140 encePairwiseOnDemand]: 104/136 looper letters, 274 selfloop transitions, 113 changer transitions 0/409 dead transitions. [2023-11-29 05:10:52,534 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 223 places, 409 transitions, 3592 flow [2023-11-29 05:10:52,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2023-11-29 05:10:52,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2023-11-29 05:10:52,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 2017 transitions. [2023-11-29 05:10:52,540 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.32241048593350385 [2023-11-29 05:10:52,540 INFO L72 ComplementDD]: Start complementDD. Operand 46 states and 2017 transitions. [2023-11-29 05:10:52,540 INFO L73 IsDeterministic]: Start isDeterministic. Operand 46 states and 2017 transitions. [2023-11-29 05:10:52,541 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:10:52,541 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 46 states and 2017 transitions. [2023-11-29 05:10:52,546 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 47 states, 46 states have (on average 43.84782608695652) internal successors, (2017), 46 states have internal predecessors, (2017), 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) [2023-11-29 05:10:52,556 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 47 states, 47 states have (on average 136.0) internal successors, (6392), 47 states have internal predecessors, (6392), 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) [2023-11-29 05:10:52,558 INFO L81 ComplementDD]: Finished complementDD. Result has 47 states, 47 states have (on average 136.0) internal successors, (6392), 47 states have internal predecessors, (6392), 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) [2023-11-29 05:10:52,559 INFO L175 Difference]: Start difference. First operand has 178 places, 189 transitions, 1391 flow. Second operand 46 states and 2017 transitions. [2023-11-29 05:10:52,559 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 223 places, 409 transitions, 3592 flow [2023-11-29 05:10:52,588 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 209 places, 409 transitions, 3514 flow, removed 21 selfloop flow, removed 14 redundant places. [2023-11-29 05:10:52,595 INFO L231 Difference]: Finished difference. Result has 229 places, 270 transitions, 2446 flow [2023-11-29 05:10:52,596 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=136, PETRI_DIFFERENCE_MINUEND_FLOW=1332, PETRI_DIFFERENCE_MINUEND_PLACES=164, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=189, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=42, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=117, PETRI_DIFFERENCE_SUBTRAHEND_STATES=46, PETRI_FLOW=2446, PETRI_PLACES=229, PETRI_TRANSITIONS=270} [2023-11-29 05:10:52,596 INFO L281 CegarLoopForPetriNet]: 135 programPoint places, 94 predicate places. [2023-11-29 05:10:52,596 INFO L495 AbstractCegarLoop]: Abstraction has has 229 places, 270 transitions, 2446 flow [2023-11-29 05:10:52,597 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 70 states, 70 states have (on average 40.52857142857143) internal successors, (2837), 70 states have internal predecessors, (2837), 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) [2023-11-29 05:10:52,598 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:10:52,598 INFO L208 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, 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, 1, 1, 1, 1, 1, 1] [2023-11-29 05:10:52,603 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a004bb2d-d8b4-4969-87b1-fc9d64ff2ac9/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2023-11-29 05:10:52,798 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a004bb2d-d8b4-4969-87b1-fc9d64ff2ac9/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 05:10:52,798 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2023-11-29 05:10:52,799 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:10:52,799 INFO L85 PathProgramCache]: Analyzing trace with hash -1555132851, now seen corresponding path program 3 times [2023-11-29 05:10:52,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:10:52,799 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [780683518] [2023-11-29 05:10:52,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:10:52,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:10:52,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:10:54,663 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 05:10:54,663 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:10:54,663 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [780683518] [2023-11-29 05:10:54,663 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [780683518] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 05:10:54,664 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [257431602] [2023-11-29 05:10:54,664 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-29 05:10:54,664 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 05:10:54,664 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a004bb2d-d8b4-4969-87b1-fc9d64ff2ac9/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:10:54,665 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a004bb2d-d8b4-4969-87b1-fc9d64ff2ac9/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 05:10:54,665 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a004bb2d-d8b4-4969-87b1-fc9d64ff2ac9/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-11-29 05:10:54,780 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-11-29 05:10:54,780 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 05:10:54,783 INFO L262 TraceCheckSpWp]: Trace formula consists of 309 conjuncts, 65 conjunts are in the unsatisfiable core [2023-11-29 05:10:54,788 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:10:55,410 INFO L349 Elim1Store]: treesize reduction 40, result has 21.6 percent of original size [2023-11-29 05:10:55,410 INFO L378 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 52 treesize of output 44 [2023-11-29 05:10:55,419 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 05:10:55,420 INFO L378 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 16 treesize of output 11 [2023-11-29 05:10:56,171 INFO L349 Elim1Store]: treesize reduction 44, result has 20.0 percent of original size [2023-11-29 05:10:56,171 INFO L378 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 76 treesize of output 70 [2023-11-29 05:10:56,180 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 05:10:56,181 INFO L378 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 24 treesize of output 11 [2023-11-29 05:10:56,689 INFO L378 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 [2023-11-29 05:10:56,805 INFO L378 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 19 treesize of output 18 [2023-11-29 05:10:56,956 INFO L378 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 26 treesize of output 28 [2023-11-29 05:10:57,282 INFO L378 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 33 treesize of output 38 [2023-11-29 05:10:57,651 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 05:10:57,652 INFO L378 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 [2023-11-29 05:10:57,666 INFO L378 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 7 treesize of output 3 [2023-11-29 05:10:57,745 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 05:10:57,746 INFO L378 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 37 treesize of output 26 [2023-11-29 05:10:57,774 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 05:10:57,774 INFO L378 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 37 treesize of output 26 [2023-11-29 05:10:57,792 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 05:10:57,792 INFO L378 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 37 treesize of output 26 [2023-11-29 05:10:57,816 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 05:10:57,817 INFO L378 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 37 treesize of output 26 [2023-11-29 05:10:57,943 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 05:10:57,944 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 05:10:57,945 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 05:10:57,946 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 05:10:57,948 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 05:10:57,948 INFO L378 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 52 treesize of output 41 [2023-11-29 05:10:58,011 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 05:10:58,011 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 05:10:58,229 WARN L854 $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_873 Int) (v_ArrVal_871 (Array Int Int))) (= (select (select (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_871))) (store .cse0 |c_ULTIMATE.start_main_#t~mem8#1.base| (store (select .cse0 |c_ULTIMATE.start_main_#t~mem8#1.base|) .cse1 v_ArrVal_873))) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) 0)) (forall ((v_ArrVal_873 Int) (v_ArrVal_871 (Array Int Int))) (= (select (select (let ((.cse2 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_871))) (store .cse2 |c_ULTIMATE.start_main_#t~mem8#1.base| (store (select .cse2 |c_ULTIMATE.start_main_#t~mem8#1.base|) .cse1 v_ArrVal_873))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 1)) 0)) (forall ((v_ArrVal_873 Int) (v_ArrVal_871 (Array Int Int))) (= (select (select (let ((.cse3 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_871))) (store .cse3 |c_ULTIMATE.start_main_#t~mem8#1.base| (store (select .cse3 |c_ULTIMATE.start_main_#t~mem8#1.base|) .cse1 v_ArrVal_873))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 3)) 0)) (forall ((v_ArrVal_873 Int) (v_ArrVal_871 (Array Int Int))) (= (select (select (let ((.cse4 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_871))) (store .cse4 |c_ULTIMATE.start_main_#t~mem8#1.base| (store (select .cse4 |c_ULTIMATE.start_main_#t~mem8#1.base|) .cse1 v_ArrVal_873))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 2)) 0)))) is different from false [2023-11-29 05:11:07,659 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)) (.cse1 (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_#t~post7#1| 1))) (and (forall ((|v_ULTIMATE.start_main_~i~1#1_25| Int)) (or (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_21| Int)) (or (forall ((v_ArrVal_873 Int) (v_ArrVal_871 (Array Int Int))) (= (select (select (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_871))) (store .cse0 .cse1 (store (select .cse0 .cse1) (+ (* |v_ULTIMATE.start_main_~i~1#1_25| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_21|) v_ArrVal_873))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 3)) 0)) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_21| .cse2))) (< |v_ULTIMATE.start_main_~i~1#1_25| .cse3))) (forall ((|v_ULTIMATE.start_main_~i~1#1_25| Int)) (or (< |v_ULTIMATE.start_main_~i~1#1_25| .cse3) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_21| Int)) (or (forall ((v_ArrVal_873 Int) (v_ArrVal_871 (Array Int Int))) (= (select (select (let ((.cse4 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_871))) (store .cse4 .cse1 (store (select .cse4 .cse1) (+ (* |v_ULTIMATE.start_main_~i~1#1_25| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_21|) v_ArrVal_873))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 1)) 0)) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_21| .cse2))))) (forall ((|v_ULTIMATE.start_main_~i~1#1_25| Int)) (or (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_21| Int)) (or (forall ((v_ArrVal_873 Int) (v_ArrVal_871 (Array Int Int))) (= (select (select (let ((.cse5 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_871))) (store .cse5 .cse1 (store (select .cse5 .cse1) (+ (* |v_ULTIMATE.start_main_~i~1#1_25| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_21|) v_ArrVal_873))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 2)) 0)) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_21| .cse2))) (< |v_ULTIMATE.start_main_~i~1#1_25| .cse3))) (forall ((|v_ULTIMATE.start_main_~i~1#1_25| Int)) (or (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_21| Int)) (or (< |v_ULTIMATE.start_main_#t~mem8#1.offset_21| .cse2) (forall ((v_ArrVal_873 Int) (v_ArrVal_871 (Array Int Int))) (= 0 (select (select (let ((.cse6 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_871))) (store .cse6 .cse1 (store (select .cse6 .cse1) (+ (* |v_ULTIMATE.start_main_~i~1#1_25| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_21|) v_ArrVal_873))) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset))))) (< |v_ULTIMATE.start_main_~i~1#1_25| .cse3))))) is different from false [2023-11-29 05:11:11,708 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse7 (+ c_threadThread1of1ForFork0_~p~0.offset 3))) (let ((.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) .cse7 0))) (.cse0 (+ |c_ULTIMATE.start_main_#t~post7#1| 1))) (and (forall ((|v_ULTIMATE.start_main_~i~1#1_25| Int)) (or (< |v_ULTIMATE.start_main_~i~1#1_25| .cse0) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_21| Int)) (or (forall ((v_ArrVal_873 Int) (v_ArrVal_871 (Array Int Int))) (= (select (select (let ((.cse1 (store .cse3 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_871))) (store .cse1 .cse2 (store (select .cse1 .cse2) (+ (* |v_ULTIMATE.start_main_~i~1#1_25| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_21|) v_ArrVal_873))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 2)) 0)) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_21| .cse4))))) (forall ((|v_ULTIMATE.start_main_~i~1#1_25| Int)) (or (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_21| Int)) (or (< |v_ULTIMATE.start_main_#t~mem8#1.offset_21| .cse4) (forall ((v_ArrVal_873 Int) (v_ArrVal_871 (Array Int Int))) (= (select (select (let ((.cse5 (store .cse3 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_871))) (store .cse5 .cse2 (store (select .cse5 .cse2) (+ (* |v_ULTIMATE.start_main_~i~1#1_25| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_21|) v_ArrVal_873))) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) 0)))) (< |v_ULTIMATE.start_main_~i~1#1_25| .cse0))) (forall ((|v_ULTIMATE.start_main_~i~1#1_25| Int)) (or (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_21| Int)) (or (forall ((v_ArrVal_873 Int) (v_ArrVal_871 (Array Int Int))) (= (select (select (let ((.cse6 (store .cse3 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_871))) (store .cse6 .cse2 (store (select .cse6 .cse2) (+ (* |v_ULTIMATE.start_main_~i~1#1_25| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_21|) v_ArrVal_873))) c_threadThread1of1ForFork0_~p~0.base) .cse7) 0)) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_21| .cse4))) (< |v_ULTIMATE.start_main_~i~1#1_25| .cse0))) (forall ((|v_ULTIMATE.start_main_~i~1#1_25| Int)) (or (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_21| Int)) (or (< |v_ULTIMATE.start_main_#t~mem8#1.offset_21| .cse4) (forall ((v_ArrVal_873 Int) (v_ArrVal_871 (Array Int Int))) (= (select (select (let ((.cse8 (store .cse3 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_871))) (store .cse8 .cse2 (store (select .cse8 .cse2) (+ (* |v_ULTIMATE.start_main_~i~1#1_25| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_21|) v_ArrVal_873))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 1)) 0)))) (< |v_ULTIMATE.start_main_~i~1#1_25| .cse0)))))) is different from false [2023-11-29 05:11:11,864 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse6 (+ c_threadThread1of1ForFork0_~p~0.offset 3))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)) (.cse2 (store |c_#race| c_threadThread1of1ForFork0_~p~0.base (store (select |c_#race| c_threadThread1of1ForFork0_~p~0.base) .cse6 0))) (.cse3 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)) (.cse4 (+ |c_ULTIMATE.start_main_~i~1#1| 1))) (and (forall ((v_ArrVal_873 Int) (|v_ULTIMATE.start_main_~i~1#1_25| Int) (|v_ULTIMATE.start_main_#t~mem8#1.offset_21| Int) (v_ArrVal_871 (Array Int Int))) (or (= (select (select (let ((.cse0 (store .cse2 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_871))) (store .cse0 .cse1 (store (select .cse0 .cse1) (+ (* |v_ULTIMATE.start_main_~i~1#1_25| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_21|) v_ArrVal_873))) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) 0) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_21| .cse3) (< |v_ULTIMATE.start_main_~i~1#1_25| .cse4))) (forall ((v_ArrVal_873 Int) (|v_ULTIMATE.start_main_~i~1#1_25| Int) (|v_ULTIMATE.start_main_#t~mem8#1.offset_21| Int) (v_ArrVal_871 (Array Int Int))) (or (= (select (select (let ((.cse5 (store .cse2 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_871))) (store .cse5 .cse1 (store (select .cse5 .cse1) (+ (* |v_ULTIMATE.start_main_~i~1#1_25| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_21|) v_ArrVal_873))) c_threadThread1of1ForFork0_~p~0.base) .cse6) 0) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_21| .cse3) (< |v_ULTIMATE.start_main_~i~1#1_25| .cse4))) (forall ((v_ArrVal_873 Int) (|v_ULTIMATE.start_main_~i~1#1_25| Int) (|v_ULTIMATE.start_main_#t~mem8#1.offset_21| Int) (v_ArrVal_871 (Array Int Int))) (or (= (select (select (let ((.cse7 (store .cse2 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_871))) (store .cse7 .cse1 (store (select .cse7 .cse1) (+ (* |v_ULTIMATE.start_main_~i~1#1_25| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_21|) v_ArrVal_873))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 1)) 0) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_21| .cse3) (< |v_ULTIMATE.start_main_~i~1#1_25| .cse4))) (forall ((v_ArrVal_873 Int) (|v_ULTIMATE.start_main_~i~1#1_25| Int) (|v_ULTIMATE.start_main_#t~mem8#1.offset_21| Int) (v_ArrVal_871 (Array Int Int))) (or (= (select (select (let ((.cse8 (store .cse2 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_871))) (store .cse8 .cse1 (store (select .cse8 .cse1) (+ (* |v_ULTIMATE.start_main_~i~1#1_25| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_21|) v_ArrVal_873))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 2)) 0) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_21| .cse3) (< |v_ULTIMATE.start_main_~i~1#1_25| .cse4)))))) is different from false [2023-11-29 05:11:11,991 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse6 (+ c_threadThread1of1ForFork0_~p~0.offset 2)) (.cse9 (+ c_threadThread1of1ForFork0_~p~0.offset 3))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)) (.cse2 (store |c_#race| c_threadThread1of1ForFork0_~p~0.base (store (store (select |c_#race| c_threadThread1of1ForFork0_~p~0.base) .cse6 0) .cse9 0))) (.cse3 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)) (.cse4 (+ |c_ULTIMATE.start_main_~i~1#1| 1))) (and (forall ((v_ArrVal_873 Int) (|v_ULTIMATE.start_main_~i~1#1_25| Int) (|v_ULTIMATE.start_main_#t~mem8#1.offset_21| Int) (v_ArrVal_871 (Array Int Int))) (or (= (select (select (let ((.cse0 (store .cse2 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_871))) (store .cse0 .cse1 (store (select .cse0 .cse1) (+ (* |v_ULTIMATE.start_main_~i~1#1_25| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_21|) v_ArrVal_873))) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) 0) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_21| .cse3) (< |v_ULTIMATE.start_main_~i~1#1_25| .cse4))) (forall ((v_ArrVal_873 Int) (|v_ULTIMATE.start_main_~i~1#1_25| Int) (|v_ULTIMATE.start_main_#t~mem8#1.offset_21| Int) (v_ArrVal_871 (Array Int Int))) (or (< |v_ULTIMATE.start_main_#t~mem8#1.offset_21| .cse3) (= (select (select (let ((.cse5 (store .cse2 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_871))) (store .cse5 .cse1 (store (select .cse5 .cse1) (+ (* |v_ULTIMATE.start_main_~i~1#1_25| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_21|) v_ArrVal_873))) c_threadThread1of1ForFork0_~p~0.base) .cse6) 0) (< |v_ULTIMATE.start_main_~i~1#1_25| .cse4))) (forall ((v_ArrVal_873 Int) (|v_ULTIMATE.start_main_~i~1#1_25| Int) (|v_ULTIMATE.start_main_#t~mem8#1.offset_21| Int) (v_ArrVal_871 (Array Int Int))) (or (< |v_ULTIMATE.start_main_#t~mem8#1.offset_21| .cse3) (= (select (select (let ((.cse7 (store .cse2 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_871))) (store .cse7 .cse1 (store (select .cse7 .cse1) (+ (* |v_ULTIMATE.start_main_~i~1#1_25| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_21|) v_ArrVal_873))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 1)) 0) (< |v_ULTIMATE.start_main_~i~1#1_25| .cse4))) (forall ((v_ArrVal_873 Int) (|v_ULTIMATE.start_main_~i~1#1_25| Int) (|v_ULTIMATE.start_main_#t~mem8#1.offset_21| Int) (v_ArrVal_871 (Array Int Int))) (or (= (select (select (let ((.cse8 (store .cse2 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_871))) (store .cse8 .cse1 (store (select .cse8 .cse1) (+ (* |v_ULTIMATE.start_main_~i~1#1_25| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_21|) v_ArrVal_873))) c_threadThread1of1ForFork0_~p~0.base) .cse9) 0) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_21| .cse3) (< |v_ULTIMATE.start_main_~i~1#1_25| .cse4)))))) is different from false [2023-11-29 05:11:12,118 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse10 (+ c_threadThread1of1ForFork0_~p~0.offset 1)) (.cse8 (+ c_threadThread1of1ForFork0_~p~0.offset 2)) (.cse3 (+ c_threadThread1of1ForFork0_~p~0.offset 3))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)) (.cse2 (store |c_#race| c_threadThread1of1ForFork0_~p~0.base (store (store (store (select |c_#race| c_threadThread1of1ForFork0_~p~0.base) .cse10 0) .cse8 0) .cse3 0))) (.cse4 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)) (.cse5 (+ |c_ULTIMATE.start_main_~i~1#1| 1))) (and (forall ((v_ArrVal_873 Int) (|v_ULTIMATE.start_main_~i~1#1_25| Int) (|v_ULTIMATE.start_main_#t~mem8#1.offset_21| Int) (v_ArrVal_871 (Array Int Int))) (or (= (select (select (let ((.cse0 (store .cse2 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_871))) (store .cse0 .cse1 (store (select .cse0 .cse1) (+ (* |v_ULTIMATE.start_main_~i~1#1_25| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_21|) v_ArrVal_873))) c_threadThread1of1ForFork0_~p~0.base) .cse3) 0) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_21| .cse4) (< |v_ULTIMATE.start_main_~i~1#1_25| .cse5))) (forall ((v_ArrVal_873 Int) (|v_ULTIMATE.start_main_~i~1#1_25| Int) (|v_ULTIMATE.start_main_#t~mem8#1.offset_21| Int) (v_ArrVal_871 (Array Int Int))) (or (= (select (select (let ((.cse6 (store .cse2 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_871))) (store .cse6 .cse1 (store (select .cse6 .cse1) (+ (* |v_ULTIMATE.start_main_~i~1#1_25| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_21|) v_ArrVal_873))) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) 0) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_21| .cse4) (< |v_ULTIMATE.start_main_~i~1#1_25| .cse5))) (forall ((v_ArrVal_873 Int) (|v_ULTIMATE.start_main_~i~1#1_25| Int) (|v_ULTIMATE.start_main_#t~mem8#1.offset_21| Int) (v_ArrVal_871 (Array Int Int))) (or (= (select (select (let ((.cse7 (store .cse2 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_871))) (store .cse7 .cse1 (store (select .cse7 .cse1) (+ (* |v_ULTIMATE.start_main_~i~1#1_25| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_21|) v_ArrVal_873))) c_threadThread1of1ForFork0_~p~0.base) .cse8) 0) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_21| .cse4) (< |v_ULTIMATE.start_main_~i~1#1_25| .cse5))) (forall ((v_ArrVal_873 Int) (|v_ULTIMATE.start_main_~i~1#1_25| Int) (|v_ULTIMATE.start_main_#t~mem8#1.offset_21| Int) (v_ArrVal_871 (Array Int Int))) (or (= (select (select (let ((.cse9 (store .cse2 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_871))) (store .cse9 .cse1 (store (select .cse9 .cse1) (+ (* |v_ULTIMATE.start_main_~i~1#1_25| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_21|) v_ArrVal_873))) c_threadThread1of1ForFork0_~p~0.base) .cse10) 0) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_21| .cse4) (< |v_ULTIMATE.start_main_~i~1#1_25| .cse5)))))) is different from false [2023-11-29 05:11:12,174 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 05:11:12,174 INFO L378 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 [2023-11-29 05:11:12,186 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 05:11:12,187 INFO L378 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 444 treesize of output 416 [2023-11-29 05:11:12,202 INFO L378 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 190 treesize of output 174 [2023-11-29 05:11:12,232 INFO L378 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 31 treesize of output 17 [2023-11-29 05:11:12,241 INFO L378 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 149 treesize of output 127 [2023-11-29 05:11:12,376 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 05:11:12,376 INFO L378 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 [2023-11-29 05:11:12,381 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 05:11:12,392 INFO L349 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2023-11-29 05:11:12,393 INFO L378 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 [2023-11-29 05:11:12,405 INFO L378 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 48 treesize of output 44 [2023-11-29 05:11:12,414 INFO L378 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 80 treesize of output 62 [2023-11-29 05:11:12,445 INFO L349 Elim1Store]: treesize reduction 38, result has 2.6 percent of original size [2023-11-29 05:11:12,445 INFO L378 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 [2023-11-29 05:11:12,454 INFO L349 Elim1Store]: treesize reduction 38, result has 2.6 percent of original size [2023-11-29 05:11:12,454 INFO L378 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 [2023-11-29 05:11:17,207 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_858 (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_858) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)))) (forall ((v_ArrVal_858 (Array Int Int)) (v_ArrVal_859 (Array Int Int))) (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_858))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (or (forall ((v_ArrVal_861 (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 .cse1 v_ArrVal_861) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)))) (forall ((v_ArrVal_860 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_859))) (< (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_860) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|) 1))))))))) is different from false [2023-11-29 05:11:17,280 WARN L854 $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_23| Int)) (or (< .cse0 |v_ULTIMATE.start_main_#t~mem8#1.base_23|) (forall ((v_ArrVal_858 (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_23| v_ArrVal_858) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)))))) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.base_23| Int)) (or (< .cse0 |v_ULTIMATE.start_main_#t~mem8#1.base_23|) (forall ((v_ArrVal_858 (Array Int Int)) (v_ArrVal_859 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_#t~mem8#1.base_23| v_ArrVal_858))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (or (forall ((v_ArrVal_860 (Array Int Int))) (let ((.cse1 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_main_#t~mem8#1.base_23| v_ArrVal_859))) (< (select (select .cse1 |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|) (+ (select (select (store .cse1 .cse2 v_ArrVal_860) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|) 1)))) (forall ((v_ArrVal_861 (Array Int Int))) (not (= (select (select (store .cse3 .cse2 v_ArrVal_861) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|) (select (select .cse3 |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)))))))))))) is different from false [2023-11-29 05:11:17,356 INFO L378 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 222 treesize of output 202 [2023-11-29 05:11:17,366 INFO L378 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 25 treesize of output 23 [2023-11-29 05:11:17,371 INFO L378 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 48 treesize of output 44 [2023-11-29 05:11:17,634 INFO L378 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 20 treesize of output 18 [2023-11-29 05:11:17,757 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 05:11:17,758 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 96 treesize of output 98 [2023-11-29 05:11:17,770 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 05:11:17,770 INFO L378 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 33 treesize of output 35 [2023-11-29 05:11:17,926 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 8 not checked. [2023-11-29 05:11:17,926 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [257431602] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 05:11:17,926 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 05:11:17,926 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 24, 24] total 70 [2023-11-29 05:11:17,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [455663301] [2023-11-29 05:11:17,927 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 05:11:17,929 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 71 states [2023-11-29 05:11:17,930 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:11:17,930 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2023-11-29 05:11:17,932 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=285, Invalid=3627, Unknown=26, NotChecked=1032, Total=4970 [2023-11-29 05:11:18,454 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 38 out of 136 [2023-11-29 05:11:18,456 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 229 places, 270 transitions, 2446 flow. Second operand has 71 states, 71 states have (on average 40.50704225352113) internal successors, (2876), 71 states have internal predecessors, (2876), 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) [2023-11-29 05:11:18,456 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:11:18,456 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 38 of 136 [2023-11-29 05:11:18,456 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:11:27,388 INFO L124 PetriNetUnfolderBase]: 663/2219 cut-off events. [2023-11-29 05:11:27,388 INFO L125 PetriNetUnfolderBase]: For 10925/10925 co-relation queries the response was YES. [2023-11-29 05:11:27,395 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9144 conditions, 2219 events. 663/2219 cut-off events. For 10925/10925 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 15190 event pairs, 102 based on Foata normal form. 19/2238 useless extension candidates. Maximal degree in co-relation 9088. Up to 1001 conditions per place. [2023-11-29 05:11:27,409 INFO L140 encePairwiseOnDemand]: 104/136 looper letters, 301 selfloop transitions, 114 changer transitions 0/437 dead transitions. [2023-11-29 05:11:27,409 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 271 places, 437 transitions, 4565 flow [2023-11-29 05:11:27,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2023-11-29 05:11:27,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2023-11-29 05:11:27,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 1869 transitions. [2023-11-29 05:11:27,413 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.31959644322845415 [2023-11-29 05:11:27,413 INFO L72 ComplementDD]: Start complementDD. Operand 43 states and 1869 transitions. [2023-11-29 05:11:27,413 INFO L73 IsDeterministic]: Start isDeterministic. Operand 43 states and 1869 transitions. [2023-11-29 05:11:27,414 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:11:27,414 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 43 states and 1869 transitions. [2023-11-29 05:11:27,418 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 44 states, 43 states have (on average 43.46511627906977) internal successors, (1869), 43 states have internal predecessors, (1869), 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) [2023-11-29 05:11:27,426 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 44 states, 44 states have (on average 136.0) internal successors, (5984), 44 states have internal predecessors, (5984), 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) [2023-11-29 05:11:27,429 INFO L81 ComplementDD]: Finished complementDD. Result has 44 states, 44 states have (on average 136.0) internal successors, (5984), 44 states have internal predecessors, (5984), 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) [2023-11-29 05:11:27,429 INFO L175 Difference]: Start difference. First operand has 229 places, 270 transitions, 2446 flow. Second operand 43 states and 1869 transitions. [2023-11-29 05:11:27,429 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 271 places, 437 transitions, 4565 flow [2023-11-29 05:11:27,492 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 256 places, 437 transitions, 4430 flow, removed 51 selfloop flow, removed 15 redundant places. [2023-11-29 05:11:27,501 INFO L231 Difference]: Finished difference. Result has 270 places, 304 transitions, 3200 flow [2023-11-29 05:11:27,502 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=136, PETRI_DIFFERENCE_MINUEND_FLOW=2335, PETRI_DIFFERENCE_MINUEND_PLACES=214, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=270, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=85, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=168, PETRI_DIFFERENCE_SUBTRAHEND_STATES=43, PETRI_FLOW=3200, PETRI_PLACES=270, PETRI_TRANSITIONS=304} [2023-11-29 05:11:27,502 INFO L281 CegarLoopForPetriNet]: 135 programPoint places, 135 predicate places. [2023-11-29 05:11:27,503 INFO L495 AbstractCegarLoop]: Abstraction has has 270 places, 304 transitions, 3200 flow [2023-11-29 05:11:27,504 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 71 states, 71 states have (on average 40.50704225352113) internal successors, (2876), 71 states have internal predecessors, (2876), 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) [2023-11-29 05:11:27,504 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:11:27,505 INFO L208 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, 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, 1, 1, 1, 1, 1, 1] [2023-11-29 05:11:27,511 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a004bb2d-d8b4-4969-87b1-fc9d64ff2ac9/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2023-11-29 05:11:27,711 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a004bb2d-d8b4-4969-87b1-fc9d64ff2ac9/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2023-11-29 05:11:27,711 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2023-11-29 05:11:27,711 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:11:27,711 INFO L85 PathProgramCache]: Analyzing trace with hash -826724573, now seen corresponding path program 4 times [2023-11-29 05:11:27,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:11:27,711 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1055191612] [2023-11-29 05:11:27,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:11:27,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:11:27,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:11:29,109 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 05:11:29,109 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:11:29,109 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1055191612] [2023-11-29 05:11:29,109 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1055191612] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 05:11:29,110 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1580134293] [2023-11-29 05:11:29,110 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-11-29 05:11:29,110 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 05:11:29,110 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a004bb2d-d8b4-4969-87b1-fc9d64ff2ac9/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:11:29,111 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a004bb2d-d8b4-4969-87b1-fc9d64ff2ac9/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 05:11:29,111 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a004bb2d-d8b4-4969-87b1-fc9d64ff2ac9/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-11-29 05:11:29,721 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-11-29 05:11:29,721 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 05:11:29,724 INFO L262 TraceCheckSpWp]: Trace formula consists of 309 conjuncts, 65 conjunts are in the unsatisfiable core [2023-11-29 05:11:29,728 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:11:30,374 INFO L349 Elim1Store]: treesize reduction 40, result has 21.6 percent of original size [2023-11-29 05:11:30,374 INFO L378 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 52 treesize of output 44 [2023-11-29 05:11:30,382 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 05:11:30,382 INFO L378 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 16 treesize of output 11 [2023-11-29 05:11:31,115 INFO L349 Elim1Store]: treesize reduction 40, result has 21.6 percent of original size [2023-11-29 05:11:31,115 INFO L378 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 59 treesize of output 49 [2023-11-29 05:11:31,125 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 05:11:31,126 INFO L378 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 16 treesize of output 11 [2023-11-29 05:11:31,727 INFO L378 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 [2023-11-29 05:11:31,839 INFO L378 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 19 treesize of output 18 [2023-11-29 05:11:31,956 INFO L378 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 26 treesize of output 28 [2023-11-29 05:11:32,106 INFO L378 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 33 treesize of output 38 [2023-11-29 05:11:32,491 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 05:11:32,491 INFO L378 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 35 [2023-11-29 05:11:32,506 INFO L378 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 7 treesize of output 3 [2023-11-29 05:11:32,587 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 05:11:32,587 INFO L378 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 37 treesize of output 26 [2023-11-29 05:11:32,613 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 05:11:32,614 INFO L378 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 37 treesize of output 26 [2023-11-29 05:11:32,646 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 05:11:32,646 INFO L378 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 37 treesize of output 26 [2023-11-29 05:11:32,673 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 05:11:32,674 INFO L378 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 37 treesize of output 26 [2023-11-29 05:11:32,796 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 05:11:32,798 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 05:11:32,798 INFO L378 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 48 treesize of output 41 [2023-11-29 05:11:32,854 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 05:11:32,855 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 05:11:33,069 WARN L854 $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_1040 Int) (v_ArrVal_1039 (Array Int Int))) (= (select (select (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1039))) (store .cse0 |c_ULTIMATE.start_main_#t~mem8#1.base| (store (select .cse0 |c_ULTIMATE.start_main_#t~mem8#1.base|) .cse1 v_ArrVal_1040))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 1)) 0)) (forall ((v_ArrVal_1040 Int) (v_ArrVal_1039 (Array Int Int))) (= (select (select (let ((.cse2 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1039))) (store .cse2 |c_ULTIMATE.start_main_#t~mem8#1.base| (store (select .cse2 |c_ULTIMATE.start_main_#t~mem8#1.base|) .cse1 v_ArrVal_1040))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 3)) 0)) (forall ((v_ArrVal_1040 Int) (v_ArrVal_1039 (Array Int Int))) (= (select (select (let ((.cse3 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1039))) (store .cse3 |c_ULTIMATE.start_main_#t~mem8#1.base| (store (select .cse3 |c_ULTIMATE.start_main_#t~mem8#1.base|) .cse1 v_ArrVal_1040))) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) 0)) (forall ((v_ArrVal_1040 Int) (v_ArrVal_1039 (Array Int Int))) (= (select (select (let ((.cse4 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1039))) (store .cse4 |c_ULTIMATE.start_main_#t~mem8#1.base| (store (select .cse4 |c_ULTIMATE.start_main_#t~mem8#1.base|) .cse1 v_ArrVal_1040))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 2)) 0)))) is different from false [2023-11-29 05:11:33,171 WARN L854 $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|)) (.cse2 (+ (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|) (* |c_ULTIMATE.start_main_~i~1#1| 4)))) (and (forall ((v_ArrVal_1040 Int) (v_ArrVal_1039 (Array Int Int))) (= (select (select (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1039))) (store .cse0 .cse1 (store (select .cse0 .cse1) .cse2 v_ArrVal_1040))) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) 0)) (forall ((v_ArrVal_1040 Int) (v_ArrVal_1039 (Array Int Int))) (= (select (select (let ((.cse3 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1039))) (store .cse3 .cse1 (store (select .cse3 .cse1) .cse2 v_ArrVal_1040))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 3)) 0)) (forall ((v_ArrVal_1040 Int) (v_ArrVal_1039 (Array Int Int))) (= (select (select (let ((.cse4 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1039))) (store .cse4 .cse1 (store (select .cse4 .cse1) .cse2 v_ArrVal_1040))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 2)) 0)) (forall ((v_ArrVal_1040 Int) (v_ArrVal_1039 (Array Int Int))) (= (select (select (let ((.cse5 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1039))) (store .cse5 .cse1 (store (select .cse5 .cse1) .cse2 v_ArrVal_1040))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 1)) 0)))) is different from false [2023-11-29 05:11:33,240 WARN L854 $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|)) (.cse2 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)) (.cse3 (+ |c_ULTIMATE.start_main_#t~post7#1| 1))) (and (forall ((|v_ULTIMATE.start_main_~i~1#1_27| Int)) (or (forall ((v_ArrVal_1040 Int) (v_ArrVal_1039 (Array Int Int))) (= (select (select (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1039))) (store .cse0 .cse1 (store (select .cse0 .cse1) (+ .cse2 (* |v_ULTIMATE.start_main_~i~1#1_27| 4)) v_ArrVal_1040))) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) 0)) (< |v_ULTIMATE.start_main_~i~1#1_27| .cse3))) (forall ((|v_ULTIMATE.start_main_~i~1#1_27| Int)) (or (forall ((v_ArrVal_1040 Int) (v_ArrVal_1039 (Array Int Int))) (= (select (select (let ((.cse4 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1039))) (store .cse4 .cse1 (store (select .cse4 .cse1) (+ .cse2 (* |v_ULTIMATE.start_main_~i~1#1_27| 4)) v_ArrVal_1040))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 1)) 0)) (< |v_ULTIMATE.start_main_~i~1#1_27| .cse3))) (forall ((|v_ULTIMATE.start_main_~i~1#1_27| Int)) (or (forall ((v_ArrVal_1040 Int) (v_ArrVal_1039 (Array Int Int))) (= (select (select (let ((.cse5 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1039))) (store .cse5 .cse1 (store (select .cse5 .cse1) (+ .cse2 (* |v_ULTIMATE.start_main_~i~1#1_27| 4)) v_ArrVal_1040))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 2)) 0)) (< |v_ULTIMATE.start_main_~i~1#1_27| .cse3))) (forall ((|v_ULTIMATE.start_main_~i~1#1_27| Int)) (or (forall ((v_ArrVal_1040 Int) (v_ArrVal_1039 (Array Int Int))) (= (select (select (let ((.cse6 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1039))) (store .cse6 .cse1 (store (select .cse6 .cse1) (+ .cse2 (* |v_ULTIMATE.start_main_~i~1#1_27| 4)) v_ArrVal_1040))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 3)) 0)) (< |v_ULTIMATE.start_main_~i~1#1_27| .cse3))))) is different from false [2023-11-29 05:11:51,986 WARN L854 $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 ((.cse5 (+ |c_ULTIMATE.start_main_#t~post7#1| 1)) (.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)) (.cse2 (select (select |c_#memory_$Pointer$.offset| |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)))) (and (forall ((|v_ULTIMATE.start_main_~i~1#1_27| Int)) (or (forall ((v_ArrVal_1040 Int) (v_ArrVal_1039 (Array Int Int))) (= (select (select (let ((.cse0 (store .cse3 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1039))) (store .cse0 .cse1 (store (select .cse0 .cse1) (+ .cse2 (* |v_ULTIMATE.start_main_~i~1#1_27| 4)) v_ArrVal_1040))) c_threadThread1of1ForFork0_~p~0.base) .cse4) 0)) (< |v_ULTIMATE.start_main_~i~1#1_27| .cse5))) (forall ((|v_ULTIMATE.start_main_~i~1#1_27| Int)) (or (< |v_ULTIMATE.start_main_~i~1#1_27| .cse5) (forall ((v_ArrVal_1040 Int) (v_ArrVal_1039 (Array Int Int))) (= (select (select (let ((.cse6 (store .cse3 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1039))) (store .cse6 .cse1 (store (select .cse6 .cse1) (+ .cse2 (* |v_ULTIMATE.start_main_~i~1#1_27| 4)) v_ArrVal_1040))) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) 0)))) (forall ((|v_ULTIMATE.start_main_~i~1#1_27| Int)) (or (forall ((v_ArrVal_1040 Int) (v_ArrVal_1039 (Array Int Int))) (= (select (select (let ((.cse7 (store .cse3 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1039))) (store .cse7 .cse1 (store (select .cse7 .cse1) (+ .cse2 (* |v_ULTIMATE.start_main_~i~1#1_27| 4)) v_ArrVal_1040))) c_threadThread1of1ForFork0_~p~0.base) .cse8) 0)) (< |v_ULTIMATE.start_main_~i~1#1_27| .cse5))) (forall ((|v_ULTIMATE.start_main_~i~1#1_27| Int)) (or (< |v_ULTIMATE.start_main_~i~1#1_27| .cse5) (forall ((v_ArrVal_1040 Int) (v_ArrVal_1039 (Array Int Int))) (= (select (select (let ((.cse9 (store .cse3 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1039))) (store .cse9 .cse1 (store (select .cse9 .cse1) (+ .cse2 (* |v_ULTIMATE.start_main_~i~1#1_27| 4)) v_ArrVal_1040))) c_threadThread1of1ForFork0_~p~0.base) .cse10) 0))))))) is different from false [2023-11-29 05:11:52,033 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 05:11:52,034 INFO L378 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 83 treesize of output 76 [2023-11-29 05:11:52,045 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 05:11:52,045 INFO L378 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 [2023-11-29 05:11:52,058 INFO L378 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 201 treesize of output 193 [2023-11-29 05:11:52,089 INFO L378 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 31 treesize of output 17 [2023-11-29 05:11:52,103 INFO L378 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 156 treesize of output 138 [2023-11-29 05:11:52,230 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 05:11:52,230 INFO L378 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 85 treesize of output 78 [2023-11-29 05:11:52,237 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 05:11:52,253 INFO L349 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2023-11-29 05:11:52,254 INFO L378 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 152 treesize of output 138 [2023-11-29 05:11:52,271 INFO L378 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 56 treesize of output 52 [2023-11-29 05:11:52,281 INFO L378 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 88 treesize of output 70 [2023-11-29 05:11:52,331 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 05:11:52,331 INFO L378 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 85 treesize of output 78 [2023-11-29 05:11:52,337 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 05:11:52,352 INFO L349 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2023-11-29 05:11:52,352 INFO L378 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 152 treesize of output 138 [2023-11-29 05:11:52,368 INFO L378 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 88 treesize of output 70 [2023-11-29 05:11:52,381 INFO L378 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 56 treesize of output 52 [2023-11-29 05:11:52,440 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 05:11:52,440 INFO L378 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 85 treesize of output 78 [2023-11-29 05:11:52,446 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 05:11:52,465 INFO L349 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2023-11-29 05:11:52,465 INFO L378 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 152 treesize of output 138 [2023-11-29 05:11:52,481 INFO L378 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 56 treesize of output 52 [2023-11-29 05:11:52,495 INFO L378 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 88 treesize of output 70 [2023-11-29 05:11:57,132 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_main_#t~mem12#1.base_15| Int) (v_ArrVal_1027 (Array Int Int)) (v_ArrVal_1026 (Array Int Int))) (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_1026))) (or (forall ((v_ArrVal_1028 (Array Int Int))) (not (= (select (select (store .cse0 |v_ULTIMATE.start_main_#t~mem12#1.base_15| v_ArrVal_1028) |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_1029 (Array Int Int))) (< 0 (+ (div (let ((.cse1 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_1027))) (+ (select (select (store .cse1 |v_ULTIMATE.start_main_#t~mem12#1.base_15| v_ArrVal_1029) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|) (* (- 1) (select (select .cse1 |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)))) 4) 1))) (< (select (select .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) |v_ULTIMATE.start_main_#t~mem12#1.base_15|)))) (forall ((v_ArrVal_1026 (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_1026) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|))))) is different from false [2023-11-29 05:11:57,231 WARN L854 $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_ULTIMATE.start_main_#t~mem8#1.base_26| Int)) (or (forall ((|v_ULTIMATE.start_main_#t~mem12#1.base_15| Int) (v_ArrVal_1027 (Array Int Int)) (v_ArrVal_1026 (Array Int Int))) (let ((.cse0 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_#t~mem8#1.base_26| v_ArrVal_1026))) (or (forall ((v_ArrVal_1028 (Array Int Int))) (not (= (select (select (store .cse0 |v_ULTIMATE.start_main_#t~mem12#1.base_15| v_ArrVal_1028) |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_1029 (Array Int Int))) (< 0 (+ (div (let ((.cse1 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_main_#t~mem8#1.base_26| v_ArrVal_1027))) (+ (* (- 1) (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_15| v_ArrVal_1029) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|))) 4) 1))) (< (select (select .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) |v_ULTIMATE.start_main_#t~mem12#1.base_15|)))) (< .cse2 |v_ULTIMATE.start_main_#t~mem8#1.base_26|))) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.base_26| Int)) (or (forall ((v_ArrVal_1026 (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_26| v_ArrVal_1026) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)))) (< .cse2 |v_ULTIMATE.start_main_#t~mem8#1.base_26|))))) is different from false [2023-11-29 05:11:57,326 INFO L378 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 409 treesize of output 373 [2023-11-29 05:11:57,340 INFO L378 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 13 treesize of output 11 [2023-11-29 05:11:57,345 INFO L378 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 17 treesize of output 15 [2023-11-29 05:11:57,350 INFO L378 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 32 treesize of output 28 [2023-11-29 05:11:57,883 INFO L349 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2023-11-29 05:11:57,883 INFO L378 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 45 treesize of output 36 [2023-11-29 05:11:57,890 INFO L378 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 11 treesize of output 9 [2023-11-29 05:11:58,130 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 8 not checked. [2023-11-29 05:11:58,131 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1580134293] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 05:11:58,131 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 05:11:58,131 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 24, 24] total 70 [2023-11-29 05:11:58,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [976524154] [2023-11-29 05:11:58,131 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 05:11:58,132 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 71 states [2023-11-29 05:11:58,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:11:58,133 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2023-11-29 05:11:58,135 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=292, Invalid=3860, Unknown=32, NotChecked=786, Total=4970 [2023-11-29 05:11:58,189 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 38 out of 136 [2023-11-29 05:11:58,191 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 270 places, 304 transitions, 3200 flow. Second operand has 71 states, 71 states have (on average 40.521126760563384) internal successors, (2877), 71 states have internal predecessors, (2877), 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) [2023-11-29 05:11:58,191 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:11:58,191 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 38 of 136 [2023-11-29 05:11:58,192 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:12:10,568 INFO L124 PetriNetUnfolderBase]: 752/2976 cut-off events. [2023-11-29 05:12:10,568 INFO L125 PetriNetUnfolderBase]: For 18504/18506 co-relation queries the response was YES. [2023-11-29 05:12:10,577 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12105 conditions, 2976 events. 752/2976 cut-off events. For 18504/18506 co-relation queries the response was YES. Maximal size of possible extension queue 94. Compared 24317 event pairs, 130 based on Foata normal form. 21/2997 useless extension candidates. Maximal degree in co-relation 12035. Up to 1103 conditions per place. [2023-11-29 05:12:10,591 INFO L140 encePairwiseOnDemand]: 104/136 looper letters, 318 selfloop transitions, 163 changer transitions 0/503 dead transitions. [2023-11-29 05:12:10,591 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 311 places, 503 transitions, 6122 flow [2023-11-29 05:12:10,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2023-11-29 05:12:10,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2023-11-29 05:12:10,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 1843 transitions. [2023-11-29 05:12:10,594 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3226540616246499 [2023-11-29 05:12:10,594 INFO L72 ComplementDD]: Start complementDD. Operand 42 states and 1843 transitions. [2023-11-29 05:12:10,594 INFO L73 IsDeterministic]: Start isDeterministic. Operand 42 states and 1843 transitions. [2023-11-29 05:12:10,595 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:12:10,595 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 42 states and 1843 transitions. [2023-11-29 05:12:10,597 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 43 states, 42 states have (on average 43.88095238095238) internal successors, (1843), 42 states have internal predecessors, (1843), 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) [2023-11-29 05:12:10,602 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 43 states, 43 states have (on average 136.0) internal successors, (5848), 43 states have internal predecessors, (5848), 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) [2023-11-29 05:12:10,602 INFO L81 ComplementDD]: Finished complementDD. Result has 43 states, 43 states have (on average 136.0) internal successors, (5848), 43 states have internal predecessors, (5848), 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) [2023-11-29 05:12:10,602 INFO L175 Difference]: Start difference. First operand has 270 places, 304 transitions, 3200 flow. Second operand 42 states and 1843 transitions. [2023-11-29 05:12:10,602 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 311 places, 503 transitions, 6122 flow [2023-11-29 05:12:10,673 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 285 places, 503 transitions, 5892 flow, removed 62 selfloop flow, removed 26 redundant places. [2023-11-29 05:12:10,680 INFO L231 Difference]: Finished difference. Result has 303 places, 366 transitions, 4664 flow [2023-11-29 05:12:10,681 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=136, PETRI_DIFFERENCE_MINUEND_FLOW=3055, PETRI_DIFFERENCE_MINUEND_PLACES=244, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=304, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=105, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=163, PETRI_DIFFERENCE_SUBTRAHEND_STATES=42, PETRI_FLOW=4664, PETRI_PLACES=303, PETRI_TRANSITIONS=366} [2023-11-29 05:12:10,681 INFO L281 CegarLoopForPetriNet]: 135 programPoint places, 168 predicate places. [2023-11-29 05:12:10,681 INFO L495 AbstractCegarLoop]: Abstraction has has 303 places, 366 transitions, 4664 flow [2023-11-29 05:12:10,681 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 71 states, 71 states have (on average 40.521126760563384) internal successors, (2877), 71 states have internal predecessors, (2877), 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) [2023-11-29 05:12:10,682 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:12:10,682 INFO L208 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, 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, 1, 1, 1, 1, 1, 1] [2023-11-29 05:12:10,687 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a004bb2d-d8b4-4969-87b1-fc9d64ff2ac9/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2023-11-29 05:12:10,882 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a004bb2d-d8b4-4969-87b1-fc9d64ff2ac9/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 05:12:10,882 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2023-11-29 05:12:10,883 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:12:10,883 INFO L85 PathProgramCache]: Analyzing trace with hash 2061280461, now seen corresponding path program 5 times [2023-11-29 05:12:10,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:12:10,883 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1066023928] [2023-11-29 05:12:10,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:12:10,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:12:10,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:12,392 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 05:12:12,392 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:12:12,393 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1066023928] [2023-11-29 05:12:12,393 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1066023928] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 05:12:12,393 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [425791156] [2023-11-29 05:12:12,393 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-11-29 05:12:12,393 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 05:12:12,393 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a004bb2d-d8b4-4969-87b1-fc9d64ff2ac9/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:12:12,394 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a004bb2d-d8b4-4969-87b1-fc9d64ff2ac9/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 05:12:12,395 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a004bb2d-d8b4-4969-87b1-fc9d64ff2ac9/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-11-29 05:12:12,673 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-29 05:12:12,674 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 05:12:12,677 INFO L262 TraceCheckSpWp]: Trace formula consists of 309 conjuncts, 80 conjunts are in the unsatisfiable core [2023-11-29 05:12:12,681 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:12:12,687 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2023-11-29 05:12:12,753 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 05:12:12,754 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 12 treesize of output 14 [2023-11-29 05:12:12,885 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 05:12:12,910 INFO L349 Elim1Store]: treesize reduction 48, result has 36.0 percent of original size [2023-11-29 05:12:12,910 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 26 treesize of output 41 [2023-11-29 05:12:12,990 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 05:12:13,003 INFO L349 Elim1Store]: treesize reduction 12, result has 58.6 percent of original size [2023-11-29 05:12:13,003 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 25 treesize of output 29 [2023-11-29 05:12:13,511 INFO L349 Elim1Store]: treesize reduction 44, result has 20.0 percent of original size [2023-11-29 05:12:13,511 INFO L378 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 78 treesize of output 70 [2023-11-29 05:12:13,526 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2023-11-29 05:12:14,331 INFO L349 Elim1Store]: treesize reduction 44, result has 20.0 percent of original size [2023-11-29 05:12:14,331 INFO L378 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 85 treesize of output 75 [2023-11-29 05:12:14,340 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2023-11-29 05:12:15,089 INFO L378 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 [2023-11-29 05:12:15,243 INFO L378 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 19 treesize of output 18 [2023-11-29 05:12:15,389 INFO L378 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 26 treesize of output 28 [2023-11-29 05:12:15,529 INFO L378 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 33 treesize of output 38 [2023-11-29 05:12:15,926 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-29 05:12:15,926 INFO L378 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 60 treesize of output 32 [2023-11-29 05:12:15,936 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 7 treesize of output 3 [2023-11-29 05:12:16,019 INFO L378 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 37 treesize of output 26 [2023-11-29 05:12:16,039 INFO L378 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 37 treesize of output 26 [2023-11-29 05:12:16,070 INFO L378 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 37 treesize of output 26 [2023-11-29 05:12:16,093 INFO L378 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 37 treesize of output 26 [2023-11-29 05:12:16,246 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 05:12:16,248 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 05:12:16,249 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 05:12:16,251 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 05:12:16,253 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 05:12:16,253 INFO L378 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 52 treesize of output 41 [2023-11-29 05:12:16,347 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 05:12:16,347 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 05:12:25,239 WARN L854 $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|)) (.cse2 (* |c_ULTIMATE.start_main_~i~1#1| 4)) (.cse3 (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_27| Int)) (or (forall ((v_ArrVal_1211 Int) (v_ArrVal_1210 (Array Int Int))) (= (select (select (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1210))) (store .cse0 .cse1 (store (select .cse0 .cse1) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_27| .cse2) v_ArrVal_1211))) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) 0)) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_27| .cse3))) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_27| Int)) (or (forall ((v_ArrVal_1211 Int) (v_ArrVal_1210 (Array Int Int))) (= (select (select (let ((.cse4 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1210))) (store .cse4 .cse1 (store (select .cse4 .cse1) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_27| .cse2) v_ArrVal_1211))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 3)) 0)) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_27| .cse3))) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_27| Int)) (or (forall ((v_ArrVal_1211 Int) (v_ArrVal_1210 (Array Int Int))) (= (select (select (let ((.cse5 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1210))) (store .cse5 .cse1 (store (select .cse5 .cse1) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_27| .cse2) v_ArrVal_1211))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 2)) 0)) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_27| .cse3))) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_27| Int)) (or (forall ((v_ArrVal_1211 Int) (v_ArrVal_1210 (Array Int Int))) (= (select (select (let ((.cse6 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1210))) (store .cse6 .cse1 (store (select .cse6 .cse1) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_27| .cse2) v_ArrVal_1211))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 1)) 0)) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_27| .cse3))))) is different from false [2023-11-29 05:12:29,401 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_#t~post7#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 (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_29| Int)) (or (< |v_ULTIMATE.start_main_~i~1#1_29| .cse0) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_27| Int)) (or (forall ((v_ArrVal_1211 Int) (v_ArrVal_1210 (Array Int Int))) (= (select (select (let ((.cse1 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1210))) (store .cse1 .cse2 (store (select .cse1 .cse2) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_27| (* |v_ULTIMATE.start_main_~i~1#1_29| 4)) v_ArrVal_1211))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 1)) 0)) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_27| .cse3))))) (forall ((|v_ULTIMATE.start_main_~i~1#1_29| Int)) (or (< |v_ULTIMATE.start_main_~i~1#1_29| .cse0) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_27| Int)) (or (forall ((v_ArrVal_1211 Int) (v_ArrVal_1210 (Array Int Int))) (= (select (select (let ((.cse4 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1210))) (store .cse4 .cse2 (store (select .cse4 .cse2) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_27| (* |v_ULTIMATE.start_main_~i~1#1_29| 4)) v_ArrVal_1211))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 3)) 0)) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_27| .cse3))))) (forall ((|v_ULTIMATE.start_main_~i~1#1_29| Int)) (or (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_27| Int)) (or (forall ((v_ArrVal_1211 Int) (v_ArrVal_1210 (Array Int Int))) (= (select (select (let ((.cse5 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1210))) (store .cse5 .cse2 (store (select .cse5 .cse2) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_27| (* |v_ULTIMATE.start_main_~i~1#1_29| 4)) v_ArrVal_1211))) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) 0)) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_27| .cse3))) (< |v_ULTIMATE.start_main_~i~1#1_29| .cse0))) (forall ((|v_ULTIMATE.start_main_~i~1#1_29| Int)) (or (< |v_ULTIMATE.start_main_~i~1#1_29| .cse0) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_27| Int)) (or (forall ((v_ArrVal_1211 Int) (v_ArrVal_1210 (Array Int Int))) (= (select (select (let ((.cse6 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1210))) (store .cse6 .cse2 (store (select .cse6 .cse2) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_27| (* |v_ULTIMATE.start_main_~i~1#1_29| 4)) v_ArrVal_1211))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 2)) 0)) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_27| .cse3))))))) is different from false [2023-11-29 05:12:33,461 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse4 (+ c_threadThread1of1ForFork0_~p~0.offset 3))) (let ((.cse0 (+ |c_ULTIMATE.start_main_#t~post7#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 (select |c_#race| c_threadThread1of1ForFork0_~p~0.base) .cse4 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_29| Int)) (or (< |v_ULTIMATE.start_main_~i~1#1_29| .cse0) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_27| Int)) (or (forall ((v_ArrVal_1211 Int) (v_ArrVal_1210 (Array Int Int))) (= (select (select (let ((.cse1 (store .cse3 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1210))) (store .cse1 .cse2 (store (select .cse1 .cse2) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_27| (* |v_ULTIMATE.start_main_~i~1#1_29| 4)) v_ArrVal_1211))) c_threadThread1of1ForFork0_~p~0.base) .cse4) 0)) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_27| .cse5))))) (forall ((|v_ULTIMATE.start_main_~i~1#1_29| Int)) (or (< |v_ULTIMATE.start_main_~i~1#1_29| .cse0) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_27| Int)) (or (forall ((v_ArrVal_1211 Int) (v_ArrVal_1210 (Array Int Int))) (= (select (select (let ((.cse6 (store .cse3 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1210))) (store .cse6 .cse2 (store (select .cse6 .cse2) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_27| (* |v_ULTIMATE.start_main_~i~1#1_29| 4)) v_ArrVal_1211))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 1)) 0)) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_27| .cse5))))) (forall ((|v_ULTIMATE.start_main_~i~1#1_29| Int)) (or (< |v_ULTIMATE.start_main_~i~1#1_29| .cse0) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_27| Int)) (or (forall ((v_ArrVal_1211 Int) (v_ArrVal_1210 (Array Int Int))) (= (select (select (let ((.cse7 (store .cse3 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1210))) (store .cse7 .cse2 (store (select .cse7 .cse2) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_27| (* |v_ULTIMATE.start_main_~i~1#1_29| 4)) v_ArrVal_1211))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 2)) 0)) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_27| .cse5))))) (forall ((|v_ULTIMATE.start_main_~i~1#1_29| Int)) (or (< |v_ULTIMATE.start_main_~i~1#1_29| .cse0) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_27| Int)) (or (forall ((v_ArrVal_1211 Int) (v_ArrVal_1210 (Array Int Int))) (= (select (select (let ((.cse8 (store .cse3 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1210))) (store .cse8 .cse2 (store (select .cse8 .cse2) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_27| (* |v_ULTIMATE.start_main_~i~1#1_29| 4)) v_ArrVal_1211))) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) 0)) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_27| .cse5)))))))) is different from false [2023-11-29 05:12:37,534 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse9 (+ c_threadThread1of1ForFork0_~p~0.offset 2)) (.cse7 (+ c_threadThread1of1ForFork0_~p~0.offset 3))) (let ((.cse0 (+ |c_ULTIMATE.start_main_#t~post7#1| 1)) (.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) .cse9 0) .cse7 0))) (.cse1 (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_29| Int)) (or (< |v_ULTIMATE.start_main_~i~1#1_29| .cse0) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_27| Int)) (or (< |v_ULTIMATE.start_main_#t~mem8#1.offset_27| .cse1) (forall ((v_ArrVal_1211 Int) (v_ArrVal_1210 (Array Int Int))) (= (select (select (let ((.cse2 (store .cse4 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1210))) (store .cse2 .cse3 (store (select .cse2 .cse3) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_27| (* |v_ULTIMATE.start_main_~i~1#1_29| 4)) v_ArrVal_1211))) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) 0)))))) (forall ((|v_ULTIMATE.start_main_~i~1#1_29| Int)) (or (< |v_ULTIMATE.start_main_~i~1#1_29| .cse0) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_27| Int)) (or (forall ((v_ArrVal_1211 Int) (v_ArrVal_1210 (Array Int Int))) (= (select (select (let ((.cse5 (store .cse4 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1210))) (store .cse5 .cse3 (store (select .cse5 .cse3) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_27| (* |v_ULTIMATE.start_main_~i~1#1_29| 4)) v_ArrVal_1211))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 1)) 0)) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_27| .cse1))))) (forall ((|v_ULTIMATE.start_main_~i~1#1_29| Int)) (or (< |v_ULTIMATE.start_main_~i~1#1_29| .cse0) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_27| Int)) (or (forall ((v_ArrVal_1211 Int) (v_ArrVal_1210 (Array Int Int))) (= (select (select (let ((.cse6 (store .cse4 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1210))) (store .cse6 .cse3 (store (select .cse6 .cse3) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_27| (* |v_ULTIMATE.start_main_~i~1#1_29| 4)) v_ArrVal_1211))) c_threadThread1of1ForFork0_~p~0.base) .cse7) 0)) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_27| .cse1))))) (forall ((|v_ULTIMATE.start_main_~i~1#1_29| Int)) (or (< |v_ULTIMATE.start_main_~i~1#1_29| .cse0) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_27| Int)) (or (forall ((v_ArrVal_1211 Int) (v_ArrVal_1210 (Array Int Int))) (= (select (select (let ((.cse8 (store .cse4 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1210))) (store .cse8 .cse3 (store (select .cse8 .cse3) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_27| (* |v_ULTIMATE.start_main_~i~1#1_29| 4)) v_ArrVal_1211))) c_threadThread1of1ForFork0_~p~0.base) .cse9) 0)) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_27| .cse1)))))))) is different from false [2023-11-29 05:12:40,660 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse10 (+ c_threadThread1of1ForFork0_~p~0.offset 1)) (.cse7 (+ c_threadThread1of1ForFork0_~p~0.offset 2)) (.cse4 (+ c_threadThread1of1ForFork0_~p~0.offset 3))) (let ((.cse0 (+ |c_ULTIMATE.start_main_#t~post7#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) .cse10 0) .cse7 0) .cse4 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_29| Int)) (or (< |v_ULTIMATE.start_main_~i~1#1_29| .cse0) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_27| Int)) (or (forall ((v_ArrVal_1211 Int) (v_ArrVal_1210 (Array Int Int))) (= (select (select (let ((.cse1 (store .cse3 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1210))) (store .cse1 .cse2 (store (select .cse1 .cse2) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_27| (* |v_ULTIMATE.start_main_~i~1#1_29| 4)) v_ArrVal_1211))) c_threadThread1of1ForFork0_~p~0.base) .cse4) 0)) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_27| .cse5))))) (forall ((|v_ULTIMATE.start_main_~i~1#1_29| Int)) (or (< |v_ULTIMATE.start_main_~i~1#1_29| .cse0) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_27| Int)) (or (forall ((v_ArrVal_1211 Int) (v_ArrVal_1210 (Array Int Int))) (= (select (select (let ((.cse6 (store .cse3 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1210))) (store .cse6 .cse2 (store (select .cse6 .cse2) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_27| (* |v_ULTIMATE.start_main_~i~1#1_29| 4)) v_ArrVal_1211))) c_threadThread1of1ForFork0_~p~0.base) .cse7) 0)) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_27| .cse5))))) (forall ((|v_ULTIMATE.start_main_~i~1#1_29| Int)) (or (< |v_ULTIMATE.start_main_~i~1#1_29| .cse0) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_27| Int)) (or (< |v_ULTIMATE.start_main_#t~mem8#1.offset_27| .cse5) (forall ((v_ArrVal_1211 Int) (v_ArrVal_1210 (Array Int Int))) (= (select (select (let ((.cse8 (store .cse3 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1210))) (store .cse8 .cse2 (store (select .cse8 .cse2) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_27| (* |v_ULTIMATE.start_main_~i~1#1_29| 4)) v_ArrVal_1211))) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) 0)))))) (forall ((|v_ULTIMATE.start_main_~i~1#1_29| Int)) (or (< |v_ULTIMATE.start_main_~i~1#1_29| .cse0) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_27| Int)) (or (forall ((v_ArrVal_1211 Int) (v_ArrVal_1210 (Array Int Int))) (= (select (select (let ((.cse9 (store .cse3 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1210))) (store .cse9 .cse2 (store (select .cse9 .cse2) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_27| (* |v_ULTIMATE.start_main_~i~1#1_29| 4)) v_ArrVal_1211))) c_threadThread1of1ForFork0_~p~0.base) .cse10) 0)) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_27| .cse5)))))))) is different from false [2023-11-29 05:12:40,700 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 05:12:40,700 INFO L378 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 [2023-11-29 05:12:40,713 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 05:12:40,714 INFO L378 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 [2023-11-29 05:12:40,727 INFO L378 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 197 treesize of output 181 [2023-11-29 05:12:40,752 INFO L378 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 31 treesize of output 17 [2023-11-29 05:12:40,779 INFO L378 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 152 treesize of output 130 [2023-11-29 05:12:40,890 INFO L349 Elim1Store]: treesize reduction 38, result has 2.6 percent of original size [2023-11-29 05:12:40,890 INFO L378 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 [2023-11-29 05:12:40,917 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 05:12:40,917 INFO L378 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 [2023-11-29 05:12:40,924 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 05:12:40,942 INFO L349 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2023-11-29 05:12:40,942 INFO L378 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 [2023-11-29 05:12:40,957 INFO L378 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 80 treesize of output 62 [2023-11-29 05:12:40,969 INFO L378 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 48 treesize of output 44 [2023-11-29 05:12:41,015 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 05:12:41,015 INFO L378 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 [2023-11-29 05:12:41,022 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 05:12:41,039 INFO L349 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2023-11-29 05:12:41,040 INFO L378 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 [2023-11-29 05:12:41,055 INFO L378 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 80 treesize of output 62 [2023-11-29 05:12:41,066 INFO L378 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 48 treesize of output 44 [2023-11-29 05:12:42,547 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1198 (Array Int Int)) (v_ArrVal_1197 (Array Int Int))) (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_1198))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (or (forall ((v_ArrVal_1200 (Array Int Int))) (not (= (select (select (store .cse0 .cse1 v_ArrVal_1200) |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_1199 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_1197))) (< (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_1199) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|) 1)))))))) (forall ((v_ArrVal_1198 (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_1198) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|))))) is different from false [2023-11-29 05:12:42,647 WARN L854 $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|))) (and (forall ((v_ArrVal_1198 (Array Int Int)) (v_ArrVal_1197 (Array Int Int))) (let ((.cse0 (store |c_#memory_$Pointer$.base| .cse3 v_ArrVal_1198))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (or (forall ((v_ArrVal_1200 (Array Int Int))) (not (= (select (select (store .cse0 .cse1 v_ArrVal_1200) |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_1199 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$.offset| .cse3 v_ArrVal_1197))) (< (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_1199) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|) 1)))))))) (forall ((v_ArrVal_1198 (Array Int Int))) (not (= |c_ULTIMATE.start_main_~#is~0#1.base| (select (select (store |c_#memory_$Pointer$.base| .cse3 v_ArrVal_1198) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)))))) is different from false [2023-11-29 05:12:42,708 INFO L378 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 279 treesize of output 259 [2023-11-29 05:12:42,723 INFO L378 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 33 treesize of output 31 [2023-11-29 05:12:42,729 INFO L378 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 64 treesize of output 60 [2023-11-29 05:12:43,305 INFO L349 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2023-11-29 05:12:43,305 INFO L378 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 420 treesize of output 271 [2023-11-29 05:12:43,327 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 05:12:43,327 INFO L378 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 85 treesize of output 85 [2023-11-29 05:12:43,334 INFO L378 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 58 treesize of output 54 [2023-11-29 05:12:47,762 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 8 not checked. [2023-11-29 05:12:47,762 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [425791156] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 05:12:47,762 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 05:12:47,763 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 24, 24] total 70 [2023-11-29 05:12:47,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [98624126] [2023-11-29 05:12:47,763 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 05:12:47,763 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 71 states [2023-11-29 05:12:47,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:12:47,764 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2023-11-29 05:12:47,765 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=279, Invalid=3736, Unknown=45, NotChecked=910, Total=4970 [2023-11-29 05:12:48,156 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 38 out of 136 [2023-11-29 05:12:48,159 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 303 places, 366 transitions, 4664 flow. Second operand has 71 states, 71 states have (on average 40.521126760563384) internal successors, (2877), 71 states have internal predecessors, (2877), 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) [2023-11-29 05:12:48,159 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:12:48,159 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 38 of 136 [2023-11-29 05:12:48,159 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:13:05,468 INFO L124 PetriNetUnfolderBase]: 778/3134 cut-off events. [2023-11-29 05:13:05,468 INFO L125 PetriNetUnfolderBase]: For 26613/26615 co-relation queries the response was YES. [2023-11-29 05:13:05,481 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13852 conditions, 3134 events. 778/3134 cut-off events. For 26613/26615 co-relation queries the response was YES. Maximal size of possible extension queue 98. Compared 26048 event pairs, 178 based on Foata normal form. 19/3153 useless extension candidates. Maximal degree in co-relation 13764. Up to 885 conditions per place. [2023-11-29 05:13:05,494 INFO L140 encePairwiseOnDemand]: 104/136 looper letters, 302 selfloop transitions, 201 changer transitions 0/525 dead transitions. [2023-11-29 05:13:05,494 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 346 places, 525 transitions, 7250 flow [2023-11-29 05:13:05,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2023-11-29 05:13:05,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2023-11-29 05:13:05,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 1900 transitions. [2023-11-29 05:13:05,497 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3175133689839572 [2023-11-29 05:13:05,497 INFO L72 ComplementDD]: Start complementDD. Operand 44 states and 1900 transitions. [2023-11-29 05:13:05,497 INFO L73 IsDeterministic]: Start isDeterministic. Operand 44 states and 1900 transitions. [2023-11-29 05:13:05,498 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:13:05,498 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 44 states and 1900 transitions. [2023-11-29 05:13:05,500 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 45 states, 44 states have (on average 43.18181818181818) internal successors, (1900), 44 states have internal predecessors, (1900), 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) [2023-11-29 05:13:05,504 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 45 states, 45 states have (on average 136.0) internal successors, (6120), 45 states have internal predecessors, (6120), 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) [2023-11-29 05:13:05,504 INFO L81 ComplementDD]: Finished complementDD. Result has 45 states, 45 states have (on average 136.0) internal successors, (6120), 45 states have internal predecessors, (6120), 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) [2023-11-29 05:13:05,505 INFO L175 Difference]: Start difference. First operand has 303 places, 366 transitions, 4664 flow. Second operand 44 states and 1900 transitions. [2023-11-29 05:13:05,505 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 346 places, 525 transitions, 7250 flow [2023-11-29 05:13:05,628 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 327 places, 525 transitions, 7117 flow, removed 39 selfloop flow, removed 19 redundant places. [2023-11-29 05:13:05,635 INFO L231 Difference]: Finished difference. Result has 347 places, 412 transitions, 5986 flow [2023-11-29 05:13:05,636 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=136, PETRI_DIFFERENCE_MINUEND_FLOW=4550, PETRI_DIFFERENCE_MINUEND_PLACES=284, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=366, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=156, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=183, PETRI_DIFFERENCE_SUBTRAHEND_STATES=44, PETRI_FLOW=5986, PETRI_PLACES=347, PETRI_TRANSITIONS=412} [2023-11-29 05:13:05,636 INFO L281 CegarLoopForPetriNet]: 135 programPoint places, 212 predicate places. [2023-11-29 05:13:05,636 INFO L495 AbstractCegarLoop]: Abstraction has has 347 places, 412 transitions, 5986 flow [2023-11-29 05:13:05,637 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 71 states, 71 states have (on average 40.521126760563384) internal successors, (2877), 71 states have internal predecessors, (2877), 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) [2023-11-29 05:13:05,637 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:13:05,637 INFO L208 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, 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, 1, 1, 1, 1, 1, 1] [2023-11-29 05:13:05,642 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a004bb2d-d8b4-4969-87b1-fc9d64ff2ac9/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-11-29 05:13:05,837 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a004bb2d-d8b4-4969-87b1-fc9d64ff2ac9/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 05:13:05,837 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2023-11-29 05:13:05,838 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:13:05,838 INFO L85 PathProgramCache]: Analyzing trace with hash 272866967, now seen corresponding path program 6 times [2023-11-29 05:13:05,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:13:05,838 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [711315408] [2023-11-29 05:13:05,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:13:05,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:13:05,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:13:07,805 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 05:13:07,805 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:13:07,805 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [711315408] [2023-11-29 05:13:07,805 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [711315408] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 05:13:07,805 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2053476494] [2023-11-29 05:13:07,806 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-11-29 05:13:07,806 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 05:13:07,806 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a004bb2d-d8b4-4969-87b1-fc9d64ff2ac9/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:13:07,806 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a004bb2d-d8b4-4969-87b1-fc9d64ff2ac9/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 05:13:07,807 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a004bb2d-d8b4-4969-87b1-fc9d64ff2ac9/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-11-29 05:13:07,942 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2023-11-29 05:13:07,942 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 05:13:07,944 INFO L262 TraceCheckSpWp]: Trace formula consists of 309 conjuncts, 50 conjunts are in the unsatisfiable core [2023-11-29 05:13:07,948 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:13:08,502 INFO L349 Elim1Store]: treesize reduction 40, result has 21.6 percent of original size [2023-11-29 05:13:08,503 INFO L378 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 52 treesize of output 44 [2023-11-29 05:13:09,213 INFO L349 Elim1Store]: treesize reduction 44, result has 20.0 percent of original size [2023-11-29 05:13:09,213 INFO L378 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 76 treesize of output 70 [2023-11-29 05:13:09,220 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 05:13:09,221 INFO L378 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 24 treesize of output 11 [2023-11-29 05:13:09,866 INFO L378 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 [2023-11-29 05:13:10,030 INFO L378 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 [2023-11-29 05:13:10,434 INFO L378 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 [2023-11-29 05:13:10,885 INFO L378 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 [2023-11-29 05:13:11,198 INFO L378 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 [2023-11-29 05:13:11,213 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 05:13:11,213 INFO L378 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 [2023-11-29 05:13:11,380 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 05:13:11,381 INFO L378 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 43 treesize of output 32 [2023-11-29 05:13:11,419 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 05:13:11,420 INFO L378 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 43 treesize of output 32 [2023-11-29 05:13:11,459 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 05:13:11,460 INFO L378 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 43 treesize of output 32 [2023-11-29 05:13:11,498 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 05:13:11,499 INFO L378 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 43 treesize of output 32 [2023-11-29 05:13:11,664 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 05:13:11,666 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 05:13:11,668 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 05:13:11,669 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 05:13:11,672 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 05:13:11,672 INFO L378 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 58 treesize of output 47 [2023-11-29 05:13:11,684 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 05:13:11,684 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 05:13:11,994 WARN L854 $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_1377 (Array Int Int)) (v_ArrVal_1378 Int)) (= (select (select (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1377))) (store .cse0 |c_ULTIMATE.start_main_#t~mem8#1.base| (store (select .cse0 |c_ULTIMATE.start_main_#t~mem8#1.base|) .cse1 v_ArrVal_1378))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 2)) 0)) (forall ((v_ArrVal_1377 (Array Int Int)) (v_ArrVal_1378 Int)) (= (select (select (let ((.cse2 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1377))) (store .cse2 |c_ULTIMATE.start_main_#t~mem8#1.base| (store (select .cse2 |c_ULTIMATE.start_main_#t~mem8#1.base|) .cse1 v_ArrVal_1378))) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) 0)) (forall ((v_ArrVal_1377 (Array Int Int)) (v_ArrVal_1378 Int)) (= (select (select (let ((.cse3 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1377))) (store .cse3 |c_ULTIMATE.start_main_#t~mem8#1.base| (store (select .cse3 |c_ULTIMATE.start_main_#t~mem8#1.base|) .cse1 v_ArrVal_1378))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 3)) 0)) (forall ((v_ArrVal_1377 (Array Int Int)) (v_ArrVal_1378 Int)) (= (select (select (let ((.cse4 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1377))) (store .cse4 |c_ULTIMATE.start_main_#t~mem8#1.base| (store (select .cse4 |c_ULTIMATE.start_main_#t~mem8#1.base|) .cse1 v_ArrVal_1378))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 1)) 0)))) is different from false [2023-11-29 05:13:12,130 WARN L854 $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|)) (.cse2 (* |c_ULTIMATE.start_main_~i~1#1| 4)) (.cse3 (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_30| Int)) (or (forall ((v_ArrVal_1377 (Array Int Int)) (v_ArrVal_1378 Int)) (= (select (select (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1377))) (store .cse0 .cse1 (store (select .cse0 .cse1) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_30| .cse2) v_ArrVal_1378))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 3)) 0)) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_30| .cse3))) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_30| Int)) (or (< |v_ULTIMATE.start_main_#t~mem8#1.offset_30| .cse3) (forall ((v_ArrVal_1377 (Array Int Int)) (v_ArrVal_1378 Int)) (= (select (select (let ((.cse4 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1377))) (store .cse4 .cse1 (store (select .cse4 .cse1) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_30| .cse2) v_ArrVal_1378))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 1)) 0)))) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_30| Int)) (or (< |v_ULTIMATE.start_main_#t~mem8#1.offset_30| .cse3) (forall ((v_ArrVal_1377 (Array Int Int)) (v_ArrVal_1378 Int)) (= (select (select (let ((.cse5 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1377))) (store .cse5 .cse1 (store (select .cse5 .cse1) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_30| .cse2) v_ArrVal_1378))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 2)) 0)))) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_30| Int)) (or (forall ((v_ArrVal_1377 (Array Int Int)) (v_ArrVal_1378 Int)) (= (select (select (let ((.cse6 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1377))) (store .cse6 .cse1 (store (select .cse6 .cse1) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_30| .cse2) v_ArrVal_1378))) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) 0)) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_30| .cse3))))) is different from false [2023-11-29 05:13:26,215 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse6 (+ c_threadThread1of1ForFork0_~p~0.offset 3))) (let ((.cse0 (+ |c_ULTIMATE.start_main_#t~post7#1| 1)) (.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 (select |c_#race| c_threadThread1of1ForFork0_~p~0.base) .cse6 0)))) (and (forall ((|v_ULTIMATE.start_main_~i~1#1_31| Int)) (or (< |v_ULTIMATE.start_main_~i~1#1_31| .cse0) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_30| Int)) (or (< |v_ULTIMATE.start_main_#t~mem8#1.offset_30| .cse1) (forall ((v_ArrVal_1377 (Array Int Int)) (v_ArrVal_1378 Int)) (= (select (select (let ((.cse2 (store .cse4 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1377))) (store .cse2 .cse3 (store (select .cse2 .cse3) (+ (* |v_ULTIMATE.start_main_~i~1#1_31| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_30|) v_ArrVal_1378))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 1)) 0)))))) (forall ((|v_ULTIMATE.start_main_~i~1#1_31| Int)) (or (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_30| Int)) (or (< |v_ULTIMATE.start_main_#t~mem8#1.offset_30| .cse1) (forall ((v_ArrVal_1377 (Array Int Int)) (v_ArrVal_1378 Int)) (= (select (select (let ((.cse5 (store .cse4 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1377))) (store .cse5 .cse3 (store (select .cse5 .cse3) (+ (* |v_ULTIMATE.start_main_~i~1#1_31| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_30|) v_ArrVal_1378))) c_threadThread1of1ForFork0_~p~0.base) .cse6) 0)))) (< |v_ULTIMATE.start_main_~i~1#1_31| .cse0))) (forall ((|v_ULTIMATE.start_main_~i~1#1_31| Int)) (or (< |v_ULTIMATE.start_main_~i~1#1_31| .cse0) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_30| Int)) (or (< |v_ULTIMATE.start_main_#t~mem8#1.offset_30| .cse1) (forall ((v_ArrVal_1377 (Array Int Int)) (v_ArrVal_1378 Int)) (= (select (select (let ((.cse7 (store .cse4 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1377))) (store .cse7 .cse3 (store (select .cse7 .cse3) (+ (* |v_ULTIMATE.start_main_~i~1#1_31| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_30|) v_ArrVal_1378))) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) 0)))))) (forall ((|v_ULTIMATE.start_main_~i~1#1_31| Int)) (or (< |v_ULTIMATE.start_main_~i~1#1_31| .cse0) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_30| Int)) (or (< |v_ULTIMATE.start_main_#t~mem8#1.offset_30| .cse1) (forall ((v_ArrVal_1377 (Array Int Int)) (v_ArrVal_1378 Int)) (= (select (select (let ((.cse8 (store .cse4 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1377))) (store .cse8 .cse3 (store (select .cse8 .cse3) (+ (* |v_ULTIMATE.start_main_~i~1#1_31| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_30|) v_ArrVal_1378))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 2)) 0))))))))) is different from false [2023-11-29 05:13:30,281 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse4 (+ c_threadThread1of1ForFork0_~p~0.offset 2)) (.cse9 (+ c_threadThread1of1ForFork0_~p~0.offset 3))) (let ((.cse5 (+ |c_ULTIMATE.start_main_#t~post7#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 (select |c_#race| c_threadThread1of1ForFork0_~p~0.base) .cse4 0) .cse9 0))) (.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_~i~1#1_31| Int)) (or (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_30| Int)) (or (< |v_ULTIMATE.start_main_#t~mem8#1.offset_30| .cse0) (forall ((v_ArrVal_1377 (Array Int Int)) (v_ArrVal_1378 Int)) (= (select (select (let ((.cse1 (store .cse3 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1377))) (store .cse1 .cse2 (store (select .cse1 .cse2) (+ (* |v_ULTIMATE.start_main_~i~1#1_31| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_30|) v_ArrVal_1378))) c_threadThread1of1ForFork0_~p~0.base) .cse4) 0)))) (< |v_ULTIMATE.start_main_~i~1#1_31| .cse5))) (forall ((|v_ULTIMATE.start_main_~i~1#1_31| Int)) (or (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_30| Int)) (or (< |v_ULTIMATE.start_main_#t~mem8#1.offset_30| .cse0) (forall ((v_ArrVal_1377 (Array Int Int)) (v_ArrVal_1378 Int)) (= 0 (select (select (let ((.cse6 (store .cse3 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1377))) (store .cse6 .cse2 (store (select .cse6 .cse2) (+ (* |v_ULTIMATE.start_main_~i~1#1_31| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_30|) v_ArrVal_1378))) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset))))) (< |v_ULTIMATE.start_main_~i~1#1_31| .cse5))) (forall ((|v_ULTIMATE.start_main_~i~1#1_31| Int)) (or (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_30| Int)) (or (< |v_ULTIMATE.start_main_#t~mem8#1.offset_30| .cse0) (forall ((v_ArrVal_1377 (Array Int Int)) (v_ArrVal_1378 Int)) (= (select (select (let ((.cse7 (store .cse3 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1377))) (store .cse7 .cse2 (store (select .cse7 .cse2) (+ (* |v_ULTIMATE.start_main_~i~1#1_31| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_30|) v_ArrVal_1378))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 1)) 0)))) (< |v_ULTIMATE.start_main_~i~1#1_31| .cse5))) (forall ((|v_ULTIMATE.start_main_~i~1#1_31| Int)) (or (< |v_ULTIMATE.start_main_~i~1#1_31| .cse5) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_30| Int)) (or (forall ((v_ArrVal_1377 (Array Int Int)) (v_ArrVal_1378 Int)) (= (select (select (let ((.cse8 (store .cse3 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1377))) (store .cse8 .cse2 (store (select .cse8 .cse2) (+ (* |v_ULTIMATE.start_main_~i~1#1_31| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_30|) v_ArrVal_1378))) c_threadThread1of1ForFork0_~p~0.base) .cse9) 0)) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_30| .cse0)))))))) is different from false [2023-11-29 05:13:57,844 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse10 (+ c_threadThread1of1ForFork0_~p~0.offset 1)) (.cse6 (+ c_threadThread1of1ForFork0_~p~0.offset 2)) (.cse8 (+ c_threadThread1of1ForFork0_~p~0.offset 3))) (let ((.cse0 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)) (.cse1 (+ |c_ULTIMATE.start_main_~i~1#1| 1)) (.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) .cse10 0) .cse6 0) .cse8 0)))) (and (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_30| Int) (v_ArrVal_1377 (Array Int Int)) (v_ArrVal_1378 Int) (|v_ULTIMATE.start_main_~i~1#1_31| Int)) (or (< |v_ULTIMATE.start_main_#t~mem8#1.offset_30| .cse0) (< |v_ULTIMATE.start_main_~i~1#1_31| .cse1) (= (select (select (let ((.cse2 (store .cse4 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1377))) (store .cse2 .cse3 (store (select .cse2 .cse3) (+ (* |v_ULTIMATE.start_main_~i~1#1_31| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_30|) v_ArrVal_1378))) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) 0))) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_30| Int) (v_ArrVal_1377 (Array Int Int)) (v_ArrVal_1378 Int) (|v_ULTIMATE.start_main_~i~1#1_31| Int)) (or (= (select (select (let ((.cse5 (store .cse4 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1377))) (store .cse5 .cse3 (store (select .cse5 .cse3) (+ (* |v_ULTIMATE.start_main_~i~1#1_31| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_30|) v_ArrVal_1378))) c_threadThread1of1ForFork0_~p~0.base) .cse6) 0) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_30| .cse0) (< |v_ULTIMATE.start_main_~i~1#1_31| .cse1))) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_30| Int) (v_ArrVal_1377 (Array Int Int)) (v_ArrVal_1378 Int) (|v_ULTIMATE.start_main_~i~1#1_31| Int)) (or (= 0 (select (select (let ((.cse7 (store .cse4 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1377))) (store .cse7 .cse3 (store (select .cse7 .cse3) (+ (* |v_ULTIMATE.start_main_~i~1#1_31| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_30|) v_ArrVal_1378))) c_threadThread1of1ForFork0_~p~0.base) .cse8)) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_30| .cse0) (< |v_ULTIMATE.start_main_~i~1#1_31| .cse1))) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_30| Int) (v_ArrVal_1377 (Array Int Int)) (v_ArrVal_1378 Int) (|v_ULTIMATE.start_main_~i~1#1_31| Int)) (or (< |v_ULTIMATE.start_main_#t~mem8#1.offset_30| .cse0) (< |v_ULTIMATE.start_main_~i~1#1_31| .cse1) (= (select (select (let ((.cse9 (store .cse4 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1377))) (store .cse9 .cse3 (store (select .cse9 .cse3) (+ (* |v_ULTIMATE.start_main_~i~1#1_31| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_30|) v_ArrVal_1378))) c_threadThread1of1ForFork0_~p~0.base) .cse10) 0)))))) is different from false [2023-11-29 05:13:57,904 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 05:13:57,904 INFO L378 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 [2023-11-29 05:13:57,918 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 05:13:57,919 INFO L378 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 [2023-11-29 05:13:57,934 INFO L378 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 197 treesize of output 181 [2023-11-29 05:13:57,950 INFO L378 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 31 treesize of output 17 [2023-11-29 05:13:57,979 INFO L378 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 152 treesize of output 130 [2023-11-29 05:13:58,121 INFO L349 Elim1Store]: treesize reduction 38, result has 2.6 percent of original size [2023-11-29 05:13:58,121 INFO L378 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 [2023-11-29 05:13:58,146 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 05:13:58,146 INFO L378 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 [2023-11-29 05:13:58,153 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 05:13:58,171 INFO L349 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2023-11-29 05:13:58,171 INFO L378 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 [2023-11-29 05:13:58,186 INFO L378 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 80 treesize of output 62 [2023-11-29 05:13:58,199 INFO L378 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 48 treesize of output 44 [2023-11-29 05:13:58,231 INFO L349 Elim1Store]: treesize reduction 38, result has 2.6 percent of original size [2023-11-29 05:13:58,231 INFO L378 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 [2023-11-29 05:14:03,484 INFO L378 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 70 treesize of output 62 [2023-11-29 05:14:03,723 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1365 (Array Int Int))) (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_1365))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (or (forall ((v_ArrVal_1367 (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 .cse1 v_ArrVal_1367) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)))) (not (= |c_ULTIMATE.start_main_~#is~0#1.base| .cse1)))))) (forall ((v_ArrVal_1365 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_1365) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|) |c_ULTIMATE.start_main_~#is~0#1.base|)))) is different from false [2023-11-29 05:14:03,812 WARN L854 $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_ULTIMATE.start_main_#t~mem8#1.base_32| Int)) (or (forall ((v_ArrVal_1365 (Array Int Int))) (let ((.cse1 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_#t~mem8#1.base_32| v_ArrVal_1365))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (or (not (= |c_ULTIMATE.start_main_~#is~0#1.base| .cse0)) (forall ((v_ArrVal_1367 (Array Int Int))) (not (= (select (select .cse1 |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|) (select (select (store .cse1 .cse0 v_ArrVal_1367) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)))))))) (< .cse2 |v_ULTIMATE.start_main_#t~mem8#1.base_32|))) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.base_32| Int)) (or (forall ((v_ArrVal_1365 (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_32| v_ArrVal_1365) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)))) (< .cse2 |v_ULTIMATE.start_main_#t~mem8#1.base_32|))))) is different from false [2023-11-29 05:14:04,488 INFO L378 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 20 treesize of output 18 [2023-11-29 05:14:04,742 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 05:14:04,743 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 96 treesize of output 98 [2023-11-29 05:14:04,753 INFO L378 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 33 treesize of output 27 [2023-11-29 05:14:05,061 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 8 not checked. [2023-11-29 05:14:05,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2053476494] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 05:14:05,061 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 05:14:05,061 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 23, 24] total 66 [2023-11-29 05:14:05,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [714628308] [2023-11-29 05:14:05,062 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 05:14:05,062 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 67 states [2023-11-29 05:14:05,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:14:05,063 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2023-11-29 05:14:05,065 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=240, Invalid=3277, Unknown=51, NotChecked=854, Total=4422 [2023-11-29 05:14:06,468 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 38 out of 136 [2023-11-29 05:14:06,470 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 347 places, 412 transitions, 5986 flow. Second operand has 67 states, 67 states have (on average 40.59701492537314) internal successors, (2720), 67 states have internal predecessors, (2720), 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) [2023-11-29 05:14:06,470 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:14:06,470 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 38 of 136 [2023-11-29 05:14:06,470 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:14:22,624 INFO L124 PetriNetUnfolderBase]: 868/3680 cut-off events. [2023-11-29 05:14:22,624 INFO L125 PetriNetUnfolderBase]: For 42863/42868 co-relation queries the response was YES. [2023-11-29 05:14:22,642 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17668 conditions, 3680 events. 868/3680 cut-off events. For 42863/42868 co-relation queries the response was YES. Maximal size of possible extension queue 123. Compared 32685 event pairs, 150 based on Foata normal form. 21/3701 useless extension candidates. Maximal degree in co-relation 17560. Up to 1336 conditions per place. [2023-11-29 05:14:22,654 INFO L140 encePairwiseOnDemand]: 104/136 looper letters, 366 selfloop transitions, 214 changer transitions 0/602 dead transitions. [2023-11-29 05:14:22,654 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 388 places, 602 transitions, 9425 flow [2023-11-29 05:14:22,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2023-11-29 05:14:22,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2023-11-29 05:14:22,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 1833 transitions. [2023-11-29 05:14:22,658 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.32090336134453784 [2023-11-29 05:14:22,658 INFO L72 ComplementDD]: Start complementDD. Operand 42 states and 1833 transitions. [2023-11-29 05:14:22,658 INFO L73 IsDeterministic]: Start isDeterministic. Operand 42 states and 1833 transitions. [2023-11-29 05:14:22,658 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:14:22,659 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 42 states and 1833 transitions. [2023-11-29 05:14:22,661 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 43 states, 42 states have (on average 43.642857142857146) internal successors, (1833), 42 states have internal predecessors, (1833), 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) [2023-11-29 05:14:22,665 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 43 states, 43 states have (on average 136.0) internal successors, (5848), 43 states have internal predecessors, (5848), 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) [2023-11-29 05:14:22,666 INFO L81 ComplementDD]: Finished complementDD. Result has 43 states, 43 states have (on average 136.0) internal successors, (5848), 43 states have internal predecessors, (5848), 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) [2023-11-29 05:14:22,666 INFO L175 Difference]: Start difference. First operand has 347 places, 412 transitions, 5986 flow. Second operand 42 states and 1833 transitions. [2023-11-29 05:14:22,666 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 388 places, 602 transitions, 9425 flow [2023-11-29 05:14:22,925 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 371 places, 602 transitions, 9098 flow, removed 83 selfloop flow, removed 17 redundant places. [2023-11-29 05:14:22,935 INFO L231 Difference]: Finished difference. Result has 384 places, 469 transitions, 7700 flow [2023-11-29 05:14:22,935 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=136, PETRI_DIFFERENCE_MINUEND_FLOW=5720, PETRI_DIFFERENCE_MINUEND_PLACES=330, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=412, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=164, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=216, PETRI_DIFFERENCE_SUBTRAHEND_STATES=42, PETRI_FLOW=7700, PETRI_PLACES=384, PETRI_TRANSITIONS=469} [2023-11-29 05:14:22,936 INFO L281 CegarLoopForPetriNet]: 135 programPoint places, 249 predicate places. [2023-11-29 05:14:22,936 INFO L495 AbstractCegarLoop]: Abstraction has has 384 places, 469 transitions, 7700 flow [2023-11-29 05:14:22,936 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 67 states, 67 states have (on average 40.59701492537314) internal successors, (2720), 67 states have internal predecessors, (2720), 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) [2023-11-29 05:14:22,936 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:14:22,936 INFO L208 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, 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, 1, 1, 1, 1, 1, 1] [2023-11-29 05:14:22,941 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a004bb2d-d8b4-4969-87b1-fc9d64ff2ac9/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2023-11-29 05:14:23,137 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a004bb2d-d8b4-4969-87b1-fc9d64ff2ac9/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 05:14:23,137 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2023-11-29 05:14:23,137 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:14:23,137 INFO L85 PathProgramCache]: Analyzing trace with hash 1925738813, now seen corresponding path program 7 times [2023-11-29 05:14:23,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:14:23,138 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1615191365] [2023-11-29 05:14:23,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:14:23,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:14:23,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:14:25,130 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 05:14:25,130 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:14:25,131 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1615191365] [2023-11-29 05:14:25,131 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1615191365] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 05:14:25,131 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [479272657] [2023-11-29 05:14:25,131 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-11-29 05:14:25,131 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 05:14:25,131 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a004bb2d-d8b4-4969-87b1-fc9d64ff2ac9/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:14:25,132 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a004bb2d-d8b4-4969-87b1-fc9d64ff2ac9/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 05:14:25,133 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a004bb2d-d8b4-4969-87b1-fc9d64ff2ac9/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-11-29 05:14:25,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:14:25,271 INFO L262 TraceCheckSpWp]: Trace formula consists of 309 conjuncts, 74 conjunts are in the unsatisfiable core [2023-11-29 05:14:25,275 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:14:25,332 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2023-11-29 05:14:25,486 INFO L349 Elim1Store]: treesize reduction 30, result has 37.5 percent of original size [2023-11-29 05:14:25,486 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 2 case distinctions, treesize of input 21 treesize of output 29 [2023-11-29 05:14:25,598 INFO L349 Elim1Store]: treesize reduction 8, result has 61.9 percent of original size [2023-11-29 05:14:25,598 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 22 [2023-11-29 05:14:26,256 INFO L349 Elim1Store]: treesize reduction 44, result has 20.0 percent of original size [2023-11-29 05:14:26,257 INFO L378 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 70 treesize of output 64 [2023-11-29 05:14:26,262 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2023-11-29 05:14:27,207 INFO L349 Elim1Store]: treesize reduction 40, result has 27.3 percent of original size [2023-11-29 05:14:27,208 INFO L378 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 77 treesize of output 73 [2023-11-29 05:14:27,220 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 11 [2023-11-29 05:14:27,230 INFO L378 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 22 treesize of output 16 [2023-11-29 05:14:27,694 INFO L378 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 [2023-11-29 05:14:27,915 INFO L378 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 19 treesize of output 18 [2023-11-29 05:14:28,047 INFO L378 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 26 treesize of output 28 [2023-11-29 05:14:28,162 INFO L378 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 33 treesize of output 38 [2023-11-29 05:14:28,516 INFO L378 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 23 treesize of output 11 [2023-11-29 05:14:28,527 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 7 treesize of output 3 [2023-11-29 05:14:28,651 INFO L378 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 37 treesize of output 26 [2023-11-29 05:14:28,679 INFO L378 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 37 treesize of output 26 [2023-11-29 05:14:28,719 INFO L378 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 37 treesize of output 26 [2023-11-29 05:14:28,768 INFO L378 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 37 treesize of output 26 [2023-11-29 05:14:28,997 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 05:14:28,999 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 05:14:29,001 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 05:14:29,002 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 05:14:29,005 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 05:14:29,005 INFO L378 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 52 treesize of output 41 [2023-11-29 05:14:29,102 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 05:14:29,102 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 05:14:29,425 WARN L854 $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_1547 (Array Int Int)) (v_ArrVal_1548 Int)) (= 0 (select (select (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1547))) (store .cse0 |c_ULTIMATE.start_main_#t~mem8#1.base| (store (select .cse0 |c_ULTIMATE.start_main_#t~mem8#1.base|) .cse1 v_ArrVal_1548))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 2)))) (forall ((v_ArrVal_1547 (Array Int Int)) (v_ArrVal_1548 Int)) (= (select (select (let ((.cse2 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1547))) (store .cse2 |c_ULTIMATE.start_main_#t~mem8#1.base| (store (select .cse2 |c_ULTIMATE.start_main_#t~mem8#1.base|) .cse1 v_ArrVal_1548))) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) 0)) (forall ((v_ArrVal_1547 (Array Int Int)) (v_ArrVal_1548 Int)) (= (select (select (let ((.cse3 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1547))) (store .cse3 |c_ULTIMATE.start_main_#t~mem8#1.base| (store (select .cse3 |c_ULTIMATE.start_main_#t~mem8#1.base|) .cse1 v_ArrVal_1548))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 3)) 0)) (forall ((v_ArrVal_1547 (Array Int Int)) (v_ArrVal_1548 Int)) (= (select (select (let ((.cse4 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1547))) (store .cse4 |c_ULTIMATE.start_main_#t~mem8#1.base| (store (select .cse4 |c_ULTIMATE.start_main_#t~mem8#1.base|) .cse1 v_ArrVal_1548))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 1)) 0)))) is different from false [2023-11-29 05:14:29,527 WARN L854 $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_33| Int)) (or (< |v_ULTIMATE.start_main_#t~mem8#1.offset_33| .cse0) (forall ((v_ArrVal_1547 (Array Int Int)) (v_ArrVal_1548 Int)) (= (select (select (let ((.cse1 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1547))) (store .cse1 .cse2 (store (select .cse1 .cse2) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_33| .cse3) v_ArrVal_1548))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 1)) 0)))) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_33| Int)) (or (< |v_ULTIMATE.start_main_#t~mem8#1.offset_33| .cse0) (forall ((v_ArrVal_1547 (Array Int Int)) (v_ArrVal_1548 Int)) (= (select (select (let ((.cse4 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1547))) (store .cse4 .cse2 (store (select .cse4 .cse2) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_33| .cse3) v_ArrVal_1548))) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) 0)))) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_33| Int)) (or (forall ((v_ArrVal_1547 (Array Int Int)) (v_ArrVal_1548 Int)) (= (select (select (let ((.cse5 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1547))) (store .cse5 .cse2 (store (select .cse5 .cse2) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_33| .cse3) v_ArrVal_1548))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 2)) 0)) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_33| .cse0))) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_33| Int)) (or (forall ((v_ArrVal_1547 (Array Int Int)) (v_ArrVal_1548 Int)) (= (select (select (let ((.cse6 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1547))) (store .cse6 .cse2 (store (select .cse6 .cse2) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_33| .cse3) v_ArrVal_1548))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 3)) 0)) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_33| .cse0))))) is different from false [2023-11-29 05:14:33,653 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_#t~post7#1| 1)) (.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|))) (and (forall ((|v_ULTIMATE.start_main_~i~1#1_33| Int)) (or (< |v_ULTIMATE.start_main_~i~1#1_33| .cse0) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_33| Int)) (or (< |v_ULTIMATE.start_main_#t~mem8#1.offset_33| .cse1) (forall ((v_ArrVal_1547 (Array Int Int)) (v_ArrVal_1548 Int)) (= (select (select (let ((.cse2 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1547))) (store .cse2 .cse3 (store (select .cse2 .cse3) (+ (* |v_ULTIMATE.start_main_~i~1#1_33| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_33|) v_ArrVal_1548))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 3)) 0)))))) (forall ((|v_ULTIMATE.start_main_~i~1#1_33| Int)) (or (< |v_ULTIMATE.start_main_~i~1#1_33| .cse0) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_33| Int)) (or (< |v_ULTIMATE.start_main_#t~mem8#1.offset_33| .cse1) (forall ((v_ArrVal_1547 (Array Int Int)) (v_ArrVal_1548 Int)) (= (select (select (let ((.cse4 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1547))) (store .cse4 .cse3 (store (select .cse4 .cse3) (+ (* |v_ULTIMATE.start_main_~i~1#1_33| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_33|) v_ArrVal_1548))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 1)) 0)))))) (forall ((|v_ULTIMATE.start_main_~i~1#1_33| Int)) (or (< |v_ULTIMATE.start_main_~i~1#1_33| .cse0) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_33| Int)) (or (forall ((v_ArrVal_1547 (Array Int Int)) (v_ArrVal_1548 Int)) (= (select (select (let ((.cse5 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1547))) (store .cse5 .cse3 (store (select .cse5 .cse3) (+ (* |v_ULTIMATE.start_main_~i~1#1_33| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_33|) v_ArrVal_1548))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 2)) 0)) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_33| .cse1))))) (forall ((|v_ULTIMATE.start_main_~i~1#1_33| Int)) (or (< |v_ULTIMATE.start_main_~i~1#1_33| .cse0) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_33| Int)) (or (< |v_ULTIMATE.start_main_#t~mem8#1.offset_33| .cse1) (forall ((v_ArrVal_1547 (Array Int Int)) (v_ArrVal_1548 Int)) (= (select (select (let ((.cse6 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1547))) (store .cse6 .cse3 (store (select .cse6 .cse3) (+ (* |v_ULTIMATE.start_main_~i~1#1_33| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_33|) v_ArrVal_1548))) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) 0)))))))) is different from false [2023-11-29 05:14:37,715 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse6 (+ c_threadThread1of1ForFork0_~p~0.offset 3))) (let ((.cse4 (+ |c_ULTIMATE.start_main_#t~post7#1| 1)) (.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 (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_33| Int)) (or (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_33| Int)) (or (< |v_ULTIMATE.start_main_#t~mem8#1.offset_33| .cse0) (forall ((v_ArrVal_1547 (Array Int Int)) (v_ArrVal_1548 Int)) (= (select (select (let ((.cse1 (store .cse3 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1547))) (store .cse1 .cse2 (store (select .cse1 .cse2) (+ (* |v_ULTIMATE.start_main_~i~1#1_33| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_33|) v_ArrVal_1548))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 2)) 0)))) (< |v_ULTIMATE.start_main_~i~1#1_33| .cse4))) (forall ((|v_ULTIMATE.start_main_~i~1#1_33| Int)) (or (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_33| Int)) (or (< |v_ULTIMATE.start_main_#t~mem8#1.offset_33| .cse0) (forall ((v_ArrVal_1547 (Array Int Int)) (v_ArrVal_1548 Int)) (= (select (select (let ((.cse5 (store .cse3 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1547))) (store .cse5 .cse2 (store (select .cse5 .cse2) (+ (* |v_ULTIMATE.start_main_~i~1#1_33| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_33|) v_ArrVal_1548))) c_threadThread1of1ForFork0_~p~0.base) .cse6) 0)))) (< |v_ULTIMATE.start_main_~i~1#1_33| .cse4))) (forall ((|v_ULTIMATE.start_main_~i~1#1_33| Int)) (or (< |v_ULTIMATE.start_main_~i~1#1_33| .cse4) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_33| Int)) (or (< |v_ULTIMATE.start_main_#t~mem8#1.offset_33| .cse0) (forall ((v_ArrVal_1547 (Array Int Int)) (v_ArrVal_1548 Int)) (= (select (select (let ((.cse7 (store .cse3 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1547))) (store .cse7 .cse2 (store (select .cse7 .cse2) (+ (* |v_ULTIMATE.start_main_~i~1#1_33| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_33|) v_ArrVal_1548))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 1)) 0)))))) (forall ((|v_ULTIMATE.start_main_~i~1#1_33| Int)) (or (< |v_ULTIMATE.start_main_~i~1#1_33| .cse4) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_33| Int)) (or (< |v_ULTIMATE.start_main_#t~mem8#1.offset_33| .cse0) (forall ((v_ArrVal_1547 (Array Int Int)) (v_ArrVal_1548 Int)) (= 0 (select (select (let ((.cse8 (store .cse3 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1547))) (store .cse8 .cse2 (store (select .cse8 .cse2) (+ (* |v_ULTIMATE.start_main_~i~1#1_33| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_33|) v_ArrVal_1548))) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset)))))))))) is different from false [2023-11-29 05:14:41,788 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse9 (+ c_threadThread1of1ForFork0_~p~0.offset 2)) (.cse6 (+ 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) .cse9 0) .cse6 0))) (.cse0 (+ |c_ULTIMATE.start_main_#t~post7#1| 1))) (and (forall ((|v_ULTIMATE.start_main_~i~1#1_33| Int)) (or (< |v_ULTIMATE.start_main_~i~1#1_33| .cse0) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_33| Int)) (or (< |v_ULTIMATE.start_main_#t~mem8#1.offset_33| .cse1) (forall ((v_ArrVal_1547 (Array Int Int)) (v_ArrVal_1548 Int)) (= (select (select (let ((.cse2 (store .cse4 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1547))) (store .cse2 .cse3 (store (select .cse2 .cse3) (+ (* |v_ULTIMATE.start_main_~i~1#1_33| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_33|) v_ArrVal_1548))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 1)) 0)))))) (forall ((|v_ULTIMATE.start_main_~i~1#1_33| Int)) (or (< |v_ULTIMATE.start_main_~i~1#1_33| .cse0) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_33| Int)) (or (< |v_ULTIMATE.start_main_#t~mem8#1.offset_33| .cse1) (forall ((v_ArrVal_1547 (Array Int Int)) (v_ArrVal_1548 Int)) (= (select (select (let ((.cse5 (store .cse4 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1547))) (store .cse5 .cse3 (store (select .cse5 .cse3) (+ (* |v_ULTIMATE.start_main_~i~1#1_33| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_33|) v_ArrVal_1548))) c_threadThread1of1ForFork0_~p~0.base) .cse6) 0)))))) (forall ((|v_ULTIMATE.start_main_~i~1#1_33| Int)) (or (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_33| Int)) (or (forall ((v_ArrVal_1547 (Array Int Int)) (v_ArrVal_1548 Int)) (= (select (select (let ((.cse7 (store .cse4 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1547))) (store .cse7 .cse3 (store (select .cse7 .cse3) (+ (* |v_ULTIMATE.start_main_~i~1#1_33| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_33|) v_ArrVal_1548))) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) 0)) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_33| .cse1))) (< |v_ULTIMATE.start_main_~i~1#1_33| .cse0))) (forall ((|v_ULTIMATE.start_main_~i~1#1_33| Int)) (or (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_33| Int)) (or (< |v_ULTIMATE.start_main_#t~mem8#1.offset_33| .cse1) (forall ((v_ArrVal_1547 (Array Int Int)) (v_ArrVal_1548 Int)) (= (select (select (let ((.cse8 (store .cse4 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1547))) (store .cse8 .cse3 (store (select .cse8 .cse3) (+ (* |v_ULTIMATE.start_main_~i~1#1_33| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_33|) v_ArrVal_1548))) c_threadThread1of1ForFork0_~p~0.base) .cse9) 0)))) (< |v_ULTIMATE.start_main_~i~1#1_33| .cse0)))))) is different from false [2023-11-29 05:14:45,306 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse7 (+ c_threadThread1of1ForFork0_~p~0.offset 1)) (.cse9 (+ c_threadThread1of1ForFork0_~p~0.offset 2)) (.cse5 (+ 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) .cse7 0) .cse9 0) .cse5 0))) (.cse0 (+ |c_ULTIMATE.start_main_#t~post7#1| 1))) (and (forall ((|v_ULTIMATE.start_main_~i~1#1_33| Int)) (or (< |v_ULTIMATE.start_main_~i~1#1_33| .cse0) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_33| Int)) (or (< |v_ULTIMATE.start_main_#t~mem8#1.offset_33| .cse1) (forall ((v_ArrVal_1547 (Array Int Int)) (v_ArrVal_1548 Int)) (= (select (select (let ((.cse2 (store .cse4 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1547))) (store .cse2 .cse3 (store (select .cse2 .cse3) (+ (* |v_ULTIMATE.start_main_~i~1#1_33| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_33|) v_ArrVal_1548))) c_threadThread1of1ForFork0_~p~0.base) .cse5) 0)))))) (forall ((|v_ULTIMATE.start_main_~i~1#1_33| Int)) (or (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_33| Int)) (or (< |v_ULTIMATE.start_main_#t~mem8#1.offset_33| .cse1) (forall ((v_ArrVal_1547 (Array Int Int)) (v_ArrVal_1548 Int)) (= (select (select (let ((.cse6 (store .cse4 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1547))) (store .cse6 .cse3 (store (select .cse6 .cse3) (+ (* |v_ULTIMATE.start_main_~i~1#1_33| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_33|) v_ArrVal_1548))) c_threadThread1of1ForFork0_~p~0.base) .cse7) 0)))) (< |v_ULTIMATE.start_main_~i~1#1_33| .cse0))) (forall ((|v_ULTIMATE.start_main_~i~1#1_33| Int)) (or (< |v_ULTIMATE.start_main_~i~1#1_33| .cse0) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_33| Int)) (or (forall ((v_ArrVal_1547 (Array Int Int)) (v_ArrVal_1548 Int)) (= (select (select (let ((.cse8 (store .cse4 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1547))) (store .cse8 .cse3 (store (select .cse8 .cse3) (+ (* |v_ULTIMATE.start_main_~i~1#1_33| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_33|) v_ArrVal_1548))) c_threadThread1of1ForFork0_~p~0.base) .cse9) 0)) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_33| .cse1))))) (forall ((|v_ULTIMATE.start_main_~i~1#1_33| Int)) (or (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_33| Int)) (or (< |v_ULTIMATE.start_main_#t~mem8#1.offset_33| .cse1) (forall ((v_ArrVal_1547 (Array Int Int)) (v_ArrVal_1548 Int)) (= 0 (select (select (let ((.cse10 (store .cse4 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1547))) (store .cse10 .cse3 (store (select .cse10 .cse3) (+ (* |v_ULTIMATE.start_main_~i~1#1_33| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_33|) v_ArrVal_1548))) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset))))) (< |v_ULTIMATE.start_main_~i~1#1_33| .cse0)))))) is different from false [2023-11-29 05:14:45,449 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse7 (+ c_threadThread1of1ForFork0_~p~0.offset 1)) (.cse5 (+ c_threadThread1of1ForFork0_~p~0.offset 2)) (.cse10 (+ c_threadThread1of1ForFork0_~p~0.offset 3))) (let ((.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) .cse7 0) .cse5 0) .cse10 0))) (.cse0 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)) (.cse1 (+ |c_ULTIMATE.start_main_~i~1#1| 1))) (and (forall ((v_ArrVal_1547 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem8#1.offset_33| Int) (|v_ULTIMATE.start_main_~i~1#1_33| Int) (v_ArrVal_1548 Int)) (or (< |v_ULTIMATE.start_main_#t~mem8#1.offset_33| .cse0) (< |v_ULTIMATE.start_main_~i~1#1_33| .cse1) (= (select (select (let ((.cse2 (store .cse4 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1547))) (store .cse2 .cse3 (store (select .cse2 .cse3) (+ (* |v_ULTIMATE.start_main_~i~1#1_33| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_33|) v_ArrVal_1548))) c_threadThread1of1ForFork0_~p~0.base) .cse5) 0))) (forall ((v_ArrVal_1547 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem8#1.offset_33| Int) (|v_ULTIMATE.start_main_~i~1#1_33| Int) (v_ArrVal_1548 Int)) (or (< |v_ULTIMATE.start_main_#t~mem8#1.offset_33| .cse0) (= (select (select (let ((.cse6 (store .cse4 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1547))) (store .cse6 .cse3 (store (select .cse6 .cse3) (+ (* |v_ULTIMATE.start_main_~i~1#1_33| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_33|) v_ArrVal_1548))) c_threadThread1of1ForFork0_~p~0.base) .cse7) 0) (< |v_ULTIMATE.start_main_~i~1#1_33| .cse1))) (forall ((v_ArrVal_1547 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem8#1.offset_33| Int) (|v_ULTIMATE.start_main_~i~1#1_33| Int) (v_ArrVal_1548 Int)) (or (< |v_ULTIMATE.start_main_#t~mem8#1.offset_33| .cse0) (= 0 (select (select (let ((.cse8 (store .cse4 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1547))) (store .cse8 .cse3 (store (select .cse8 .cse3) (+ (* |v_ULTIMATE.start_main_~i~1#1_33| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_33|) v_ArrVal_1548))) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset)) (< |v_ULTIMATE.start_main_~i~1#1_33| .cse1))) (forall ((v_ArrVal_1547 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem8#1.offset_33| Int) (|v_ULTIMATE.start_main_~i~1#1_33| Int) (v_ArrVal_1548 Int)) (or (= (select (select (let ((.cse9 (store .cse4 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1547))) (store .cse9 .cse3 (store (select .cse9 .cse3) (+ (* |v_ULTIMATE.start_main_~i~1#1_33| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_33|) v_ArrVal_1548))) c_threadThread1of1ForFork0_~p~0.base) .cse10) 0) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_33| .cse0) (< |v_ULTIMATE.start_main_~i~1#1_33| .cse1)))))) is different from false [2023-11-29 05:14:45,502 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 05:14:45,502 INFO L378 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 [2023-11-29 05:14:45,517 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 05:14:45,518 INFO L378 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 [2023-11-29 05:14:45,532 INFO L378 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 193 treesize of output 177 [2023-11-29 05:14:45,570 INFO L378 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 31 treesize of output 17 [2023-11-29 05:14:45,581 INFO L378 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 149 treesize of output 127 [2023-11-29 05:14:45,715 INFO L349 Elim1Store]: treesize reduction 38, result has 2.6 percent of original size [2023-11-29 05:14:45,715 INFO L378 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 [2023-11-29 05:14:45,738 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 05:14:45,739 INFO L378 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 [2023-11-29 05:14:45,745 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 05:14:45,759 INFO L349 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2023-11-29 05:14:45,759 INFO L378 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 [2023-11-29 05:14:45,771 INFO L378 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 48 treesize of output 44 [2023-11-29 05:14:45,781 INFO L378 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 80 treesize of output 62 [2023-11-29 05:14:45,811 INFO L349 Elim1Store]: treesize reduction 38, result has 2.6 percent of original size [2023-11-29 05:14:45,811 INFO L378 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 [2023-11-29 05:14:47,085 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1535 (Array Int Int)) (v_ArrVal_1534 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_1535))) (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_1536 (Array Int Int))) (let ((.cse0 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_1534))) (< (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_1536) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|) 1)))) (forall ((v_ArrVal_1537 (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_1537) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)))))))) (forall ((v_ArrVal_1535 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_1535) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|) |c_ULTIMATE.start_main_~#is~0#1.base|)))) is different from false [2023-11-29 05:14:47,176 WARN L854 $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|))) (and (forall ((v_ArrVal_1535 (Array Int Int)) (v_ArrVal_1534 (Array Int Int))) (let ((.cse0 (store |c_#memory_$Pointer$.base| .cse3 v_ArrVal_1535))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (or (forall ((v_ArrVal_1537 (Array Int Int))) (not (= (select (select (store .cse0 .cse1 v_ArrVal_1537) |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_1536 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$.offset| .cse3 v_ArrVal_1534))) (< (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_1536) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|) 1)))))))) (forall ((v_ArrVal_1535 (Array Int Int))) (not (= |c_ULTIMATE.start_main_~#is~0#1.base| (select (select (store |c_#memory_$Pointer$.base| .cse3 v_ArrVal_1535) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)))))) is different from false [2023-11-29 05:14:47,222 INFO L378 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 279 treesize of output 259 [2023-11-29 05:14:47,230 INFO L378 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 122 treesize of output 118 [2023-11-29 05:14:47,234 INFO L378 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 118 treesize of output 116 [2023-11-29 05:14:47,884 INFO L349 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2023-11-29 05:14:47,884 INFO L378 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 813 treesize of output 532 [2023-11-29 05:14:47,906 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 05:14:47,906 INFO L378 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 99 treesize of output 97 [2023-11-29 05:14:47,913 INFO L378 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 70 treesize of output 62 [2023-11-29 05:14:48,147 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-29 05:14:48,147 INFO L378 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 22 treesize of output 18 [2023-11-29 05:14:48,240 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 8 not checked. [2023-11-29 05:14:48,240 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [479272657] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 05:14:48,240 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 05:14:48,240 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 24, 24] total 71 [2023-11-29 05:14:48,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1058046487] [2023-11-29 05:14:48,240 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 05:14:48,241 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 72 states [2023-11-29 05:14:48,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:14:48,242 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2023-11-29 05:14:48,243 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=277, Invalid=3619, Unknown=46, NotChecked=1170, Total=5112 [2023-11-29 05:14:48,246 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 38 out of 136 [2023-11-29 05:14:48,248 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 384 places, 469 transitions, 7700 flow. Second operand has 72 states, 72 states have (on average 40.486111111111114) internal successors, (2915), 72 states have internal predecessors, (2915), 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) [2023-11-29 05:14:48,248 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:14:48,248 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 38 of 136 [2023-11-29 05:14:48,248 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:15:00,499 INFO L124 PetriNetUnfolderBase]: 924/4131 cut-off events. [2023-11-29 05:15:00,499 INFO L125 PetriNetUnfolderBase]: For 61695/61700 co-relation queries the response was YES. [2023-11-29 05:15:00,522 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20821 conditions, 4131 events. 924/4131 cut-off events. For 61695/61700 co-relation queries the response was YES. Maximal size of possible extension queue 147. Compared 38637 event pairs, 227 based on Foata normal form. 21/4152 useless extension candidates. Maximal degree in co-relation 20700. Up to 1372 conditions per place. [2023-11-29 05:15:00,536 INFO L140 encePairwiseOnDemand]: 104/136 looper letters, 390 selfloop transitions, 244 changer transitions 0/656 dead transitions. [2023-11-29 05:15:00,536 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 425 places, 656 transitions, 11231 flow [2023-11-29 05:15:00,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2023-11-29 05:15:00,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2023-11-29 05:15:00,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 1837 transitions. [2023-11-29 05:15:00,539 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.32160364145658266 [2023-11-29 05:15:00,539 INFO L72 ComplementDD]: Start complementDD. Operand 42 states and 1837 transitions. [2023-11-29 05:15:00,539 INFO L73 IsDeterministic]: Start isDeterministic. Operand 42 states and 1837 transitions. [2023-11-29 05:15:00,540 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:15:00,540 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 42 states and 1837 transitions. [2023-11-29 05:15:00,542 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 43 states, 42 states have (on average 43.73809523809524) internal successors, (1837), 42 states have internal predecessors, (1837), 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) [2023-11-29 05:15:00,547 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 43 states, 43 states have (on average 136.0) internal successors, (5848), 43 states have internal predecessors, (5848), 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) [2023-11-29 05:15:00,547 INFO L81 ComplementDD]: Finished complementDD. Result has 43 states, 43 states have (on average 136.0) internal successors, (5848), 43 states have internal predecessors, (5848), 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) [2023-11-29 05:15:00,547 INFO L175 Difference]: Start difference. First operand has 384 places, 469 transitions, 7700 flow. Second operand 42 states and 1837 transitions. [2023-11-29 05:15:00,547 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 425 places, 656 transitions, 11231 flow [2023-11-29 05:15:00,996 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 401 places, 656 transitions, 10979 flow, removed 82 selfloop flow, removed 24 redundant places. [2023-11-29 05:15:01,009 INFO L231 Difference]: Finished difference. Result has 417 places, 511 transitions, 9443 flow [2023-11-29 05:15:01,010 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=136, PETRI_DIFFERENCE_MINUEND_FLOW=7489, PETRI_DIFFERENCE_MINUEND_PLACES=360, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=469, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=206, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=236, PETRI_DIFFERENCE_SUBTRAHEND_STATES=42, PETRI_FLOW=9443, PETRI_PLACES=417, PETRI_TRANSITIONS=511} [2023-11-29 05:15:01,010 INFO L281 CegarLoopForPetriNet]: 135 programPoint places, 282 predicate places. [2023-11-29 05:15:01,010 INFO L495 AbstractCegarLoop]: Abstraction has has 417 places, 511 transitions, 9443 flow [2023-11-29 05:15:01,011 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 72 states, 72 states have (on average 40.486111111111114) internal successors, (2915), 72 states have internal predecessors, (2915), 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) [2023-11-29 05:15:01,011 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:15:01,011 INFO L208 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, 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, 1, 1, 1, 1, 1, 1] [2023-11-29 05:15:01,017 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a004bb2d-d8b4-4969-87b1-fc9d64ff2ac9/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2023-11-29 05:15:01,212 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a004bb2d-d8b4-4969-87b1-fc9d64ff2ac9/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2023-11-29 05:15:01,212 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2023-11-29 05:15:01,212 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:15:01,213 INFO L85 PathProgramCache]: Analyzing trace with hash 1774293041, now seen corresponding path program 8 times [2023-11-29 05:15:01,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:15:01,213 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [892816751] [2023-11-29 05:15:01,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:15:01,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:15:01,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:15:03,029 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 05:15:03,030 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:15:03,030 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [892816751] [2023-11-29 05:15:03,030 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [892816751] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 05:15:03,030 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1659713749] [2023-11-29 05:15:03,030 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-29 05:15:03,030 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 05:15:03,030 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a004bb2d-d8b4-4969-87b1-fc9d64ff2ac9/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:15:03,031 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a004bb2d-d8b4-4969-87b1-fc9d64ff2ac9/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 05:15:03,032 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a004bb2d-d8b4-4969-87b1-fc9d64ff2ac9/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-11-29 05:15:03,192 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-29 05:15:03,192 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 05:15:03,194 INFO L262 TraceCheckSpWp]: Trace formula consists of 309 conjuncts, 61 conjunts are in the unsatisfiable core [2023-11-29 05:15:03,199 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:15:03,993 INFO L349 Elim1Store]: treesize reduction 40, result has 21.6 percent of original size [2023-11-29 05:15:03,994 INFO L378 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 52 treesize of output 44 [2023-11-29 05:15:04,006 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 05:15:04,006 INFO L378 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 16 treesize of output 11 [2023-11-29 05:15:04,968 INFO L349 Elim1Store]: treesize reduction 44, result has 20.0 percent of original size [2023-11-29 05:15:04,968 INFO L378 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 76 treesize of output 70 [2023-11-29 05:15:04,987 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 05:15:04,987 INFO L378 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 24 treesize of output 11 [2023-11-29 05:15:05,780 INFO L378 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 [2023-11-29 05:15:06,024 INFO L378 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 19 treesize of output 18 [2023-11-29 05:15:06,247 INFO L378 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 26 treesize of output 28 [2023-11-29 05:15:06,817 INFO L378 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 33 treesize of output 38 [2023-11-29 05:15:07,114 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 05:15:07,115 INFO L378 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 [2023-11-29 05:15:07,132 INFO L378 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 7 treesize of output 3 [2023-11-29 05:15:07,255 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 05:15:07,255 INFO L378 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 37 treesize of output 26 [2023-11-29 05:15:07,284 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 05:15:07,285 INFO L378 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 37 treesize of output 26 [2023-11-29 05:15:07,319 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 05:15:07,320 INFO L378 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 37 treesize of output 26 [2023-11-29 05:15:07,356 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 05:15:07,356 INFO L378 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 37 treesize of output 26 [2023-11-29 05:15:07,588 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 05:15:07,591 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 05:15:07,593 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 05:15:07,595 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 05:15:07,598 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 05:15:07,598 INFO L378 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 52 treesize of output 41 [2023-11-29 05:15:07,699 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 05:15:07,699 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 05:15:08,553 WARN L854 $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_36| Int)) (or (< |v_ULTIMATE.start_main_#t~mem8#1.offset_36| .cse0) (forall ((v_ArrVal_1717 Int) (v_ArrVal_1715 (Array Int Int))) (= (select (select (let ((.cse1 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1715))) (store .cse1 .cse2 (store (select .cse1 .cse2) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_36| .cse3) v_ArrVal_1717))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 3)) 0)))) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_36| Int)) (or (forall ((v_ArrVal_1717 Int) (v_ArrVal_1715 (Array Int Int))) (= (select (select (let ((.cse4 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1715))) (store .cse4 .cse2 (store (select .cse4 .cse2) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_36| .cse3) v_ArrVal_1717))) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) 0)) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_36| .cse0))) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_36| Int)) (or (forall ((v_ArrVal_1717 Int) (v_ArrVal_1715 (Array Int Int))) (= (select (select (let ((.cse5 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1715))) (store .cse5 .cse2 (store (select .cse5 .cse2) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_36| .cse3) v_ArrVal_1717))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 2)) 0)) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_36| .cse0))) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_36| Int)) (or (forall ((v_ArrVal_1717 Int) (v_ArrVal_1715 (Array Int Int))) (= (select (select (let ((.cse6 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1715))) (store .cse6 .cse2 (store (select .cse6 .cse2) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_36| .cse3) v_ArrVal_1717))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 1)) 0)) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_36| .cse0))))) is different from false [2023-11-29 05:15:29,629 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse6 (+ c_threadThread1of1ForFork0_~p~0.offset 3))) (let ((.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 (select |c_#race| c_threadThread1of1ForFork0_~p~0.base) .cse6 0))) (.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_#t~post7#1| 1))) (and (forall ((|v_ULTIMATE.start_main_~i~1#1_35| Int)) (or (< |v_ULTIMATE.start_main_~i~1#1_35| .cse0) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_36| Int)) (or (< |v_ULTIMATE.start_main_#t~mem8#1.offset_36| .cse1) (forall ((v_ArrVal_1717 Int) (v_ArrVal_1715 (Array Int Int))) (= (select (select (let ((.cse2 (store .cse4 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1715))) (store .cse2 .cse3 (store (select .cse2 .cse3) (+ (* |v_ULTIMATE.start_main_~i~1#1_35| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_36|) v_ArrVal_1717))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 2)) 0)))))) (forall ((|v_ULTIMATE.start_main_~i~1#1_35| Int)) (or (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_36| Int)) (or (forall ((v_ArrVal_1717 Int) (v_ArrVal_1715 (Array Int Int))) (= (select (select (let ((.cse5 (store .cse4 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1715))) (store .cse5 .cse3 (store (select .cse5 .cse3) (+ (* |v_ULTIMATE.start_main_~i~1#1_35| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_36|) v_ArrVal_1717))) c_threadThread1of1ForFork0_~p~0.base) .cse6) 0)) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_36| .cse1))) (< |v_ULTIMATE.start_main_~i~1#1_35| .cse0))) (forall ((|v_ULTIMATE.start_main_~i~1#1_35| Int)) (or (< |v_ULTIMATE.start_main_~i~1#1_35| .cse0) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_36| Int)) (or (< |v_ULTIMATE.start_main_#t~mem8#1.offset_36| .cse1) (forall ((v_ArrVal_1717 Int) (v_ArrVal_1715 (Array Int Int))) (= 0 (select (select (let ((.cse7 (store .cse4 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1715))) (store .cse7 .cse3 (store (select .cse7 .cse3) (+ (* |v_ULTIMATE.start_main_~i~1#1_35| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_36|) v_ArrVal_1717))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 1)))))))) (forall ((|v_ULTIMATE.start_main_~i~1#1_35| Int)) (or (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_36| Int)) (or (forall ((v_ArrVal_1717 Int) (v_ArrVal_1715 (Array Int Int))) (= (select (select (let ((.cse8 (store .cse4 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1715))) (store .cse8 .cse3 (store (select .cse8 .cse3) (+ (* |v_ULTIMATE.start_main_~i~1#1_35| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_36|) v_ArrVal_1717))) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) 0)) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_36| .cse1))) (< |v_ULTIMATE.start_main_~i~1#1_35| .cse0)))))) is different from false [2023-11-29 05:15:29,725 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse6 (+ c_threadThread1of1ForFork0_~p~0.offset 3))) (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 (store |c_#race| c_threadThread1of1ForFork0_~p~0.base (store (select |c_#race| c_threadThread1of1ForFork0_~p~0.base) .cse6 0))) (.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|))) (and (forall ((|v_ULTIMATE.start_main_~i~1#1_35| Int) (v_ArrVal_1717 Int) (v_ArrVal_1715 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem8#1.offset_36| Int)) (or (< |v_ULTIMATE.start_main_~i~1#1_35| .cse0) (= (select (select (let ((.cse1 (store .cse3 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1715))) (store .cse1 .cse2 (store (select .cse1 .cse2) (+ (* |v_ULTIMATE.start_main_~i~1#1_35| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_36|) v_ArrVal_1717))) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) 0) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_36| .cse4))) (forall ((|v_ULTIMATE.start_main_~i~1#1_35| Int) (v_ArrVal_1717 Int) (v_ArrVal_1715 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem8#1.offset_36| Int)) (or (= (select (select (let ((.cse5 (store .cse3 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1715))) (store .cse5 .cse2 (store (select .cse5 .cse2) (+ (* |v_ULTIMATE.start_main_~i~1#1_35| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_36|) v_ArrVal_1717))) c_threadThread1of1ForFork0_~p~0.base) .cse6) 0) (< |v_ULTIMATE.start_main_~i~1#1_35| .cse0) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_36| .cse4))) (forall ((|v_ULTIMATE.start_main_~i~1#1_35| Int) (v_ArrVal_1717 Int) (v_ArrVal_1715 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem8#1.offset_36| Int)) (or (< |v_ULTIMATE.start_main_~i~1#1_35| .cse0) (= (select (select (let ((.cse7 (store .cse3 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1715))) (store .cse7 .cse2 (store (select .cse7 .cse2) (+ (* |v_ULTIMATE.start_main_~i~1#1_35| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_36|) v_ArrVal_1717))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 2)) 0) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_36| .cse4))) (forall ((|v_ULTIMATE.start_main_~i~1#1_35| Int) (v_ArrVal_1717 Int) (v_ArrVal_1715 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem8#1.offset_36| Int)) (or (= 0 (select (select (let ((.cse8 (store .cse3 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1715))) (store .cse8 .cse2 (store (select .cse8 .cse2) (+ (* |v_ULTIMATE.start_main_~i~1#1_35| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_36|) v_ArrVal_1717))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 1))) (< |v_ULTIMATE.start_main_~i~1#1_35| .cse0) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_36| .cse4)))))) is different from false [2023-11-29 05:15:30,019 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse7 (+ c_threadThread1of1ForFork0_~p~0.offset 2)) (.cse9 (+ c_threadThread1of1ForFork0_~p~0.offset 3))) (let ((.cse3 (+ |c_ULTIMATE.start_main_~i~1#1| 1)) (.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)) (.cse2 (store |c_#race| c_threadThread1of1ForFork0_~p~0.base (store (store (select |c_#race| c_threadThread1of1ForFork0_~p~0.base) .cse7 0) .cse9 0))) (.cse4 (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_35| Int) (v_ArrVal_1717 Int) (v_ArrVal_1715 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem8#1.offset_36| Int)) (or (= (select (select (let ((.cse0 (store .cse2 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1715))) (store .cse0 .cse1 (store (select .cse0 .cse1) (+ (* |v_ULTIMATE.start_main_~i~1#1_35| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_36|) v_ArrVal_1717))) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) 0) (< |v_ULTIMATE.start_main_~i~1#1_35| .cse3) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_36| .cse4))) (forall ((|v_ULTIMATE.start_main_~i~1#1_35| Int) (v_ArrVal_1717 Int) (v_ArrVal_1715 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem8#1.offset_36| Int)) (or (< |v_ULTIMATE.start_main_~i~1#1_35| .cse3) (= (select (select (let ((.cse5 (store .cse2 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1715))) (store .cse5 .cse1 (store (select .cse5 .cse1) (+ (* |v_ULTIMATE.start_main_~i~1#1_35| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_36|) v_ArrVal_1717))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 1)) 0) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_36| .cse4))) (forall ((|v_ULTIMATE.start_main_~i~1#1_35| Int) (v_ArrVal_1717 Int) (v_ArrVal_1715 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem8#1.offset_36| Int)) (or (< |v_ULTIMATE.start_main_~i~1#1_35| .cse3) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_36| .cse4) (= (select (select (let ((.cse6 (store .cse2 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1715))) (store .cse6 .cse1 (store (select .cse6 .cse1) (+ (* |v_ULTIMATE.start_main_~i~1#1_35| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_36|) v_ArrVal_1717))) c_threadThread1of1ForFork0_~p~0.base) .cse7) 0))) (forall ((|v_ULTIMATE.start_main_~i~1#1_35| Int) (v_ArrVal_1717 Int) (v_ArrVal_1715 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem8#1.offset_36| Int)) (or (< |v_ULTIMATE.start_main_~i~1#1_35| .cse3) (= (select (select (let ((.cse8 (store .cse2 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1715))) (store .cse8 .cse1 (store (select .cse8 .cse1) (+ (* |v_ULTIMATE.start_main_~i~1#1_35| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_36|) v_ArrVal_1717))) c_threadThread1of1ForFork0_~p~0.base) .cse9) 0) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_36| .cse4)))))) is different from false [2023-11-29 05:15:30,135 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse8 (+ c_threadThread1of1ForFork0_~p~0.offset 1)) (.cse10 (+ c_threadThread1of1ForFork0_~p~0.offset 2)) (.cse5 (+ c_threadThread1of1ForFork0_~p~0.offset 3))) (let ((.cse0 (+ |c_ULTIMATE.start_main_~i~1#1| 1)) (.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) .cse10 0) .cse5 0))) (.cse1 (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_35| Int) (v_ArrVal_1717 Int) (v_ArrVal_1715 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem8#1.offset_36| Int)) (or (< |v_ULTIMATE.start_main_~i~1#1_35| .cse0) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_36| .cse1) (= (select (select (let ((.cse2 (store .cse4 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1715))) (store .cse2 .cse3 (store (select .cse2 .cse3) (+ (* |v_ULTIMATE.start_main_~i~1#1_35| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_36|) v_ArrVal_1717))) c_threadThread1of1ForFork0_~p~0.base) .cse5) 0))) (forall ((|v_ULTIMATE.start_main_~i~1#1_35| Int) (v_ArrVal_1717 Int) (v_ArrVal_1715 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem8#1.offset_36| Int)) (or (< |v_ULTIMATE.start_main_~i~1#1_35| .cse0) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_36| .cse1) (= (select (select (let ((.cse6 (store .cse4 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1715))) (store .cse6 .cse3 (store (select .cse6 .cse3) (+ (* |v_ULTIMATE.start_main_~i~1#1_35| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_36|) v_ArrVal_1717))) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) 0))) (forall ((|v_ULTIMATE.start_main_~i~1#1_35| Int) (v_ArrVal_1717 Int) (v_ArrVal_1715 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem8#1.offset_36| Int)) (or (< |v_ULTIMATE.start_main_~i~1#1_35| .cse0) (= (select (select (let ((.cse7 (store .cse4 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1715))) (store .cse7 .cse3 (store (select .cse7 .cse3) (+ (* |v_ULTIMATE.start_main_~i~1#1_35| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_36|) v_ArrVal_1717))) c_threadThread1of1ForFork0_~p~0.base) .cse8) 0) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_36| .cse1))) (forall ((|v_ULTIMATE.start_main_~i~1#1_35| Int) (v_ArrVal_1717 Int) (v_ArrVal_1715 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem8#1.offset_36| Int)) (or (< |v_ULTIMATE.start_main_~i~1#1_35| .cse0) (= (select (select (let ((.cse9 (store .cse4 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1715))) (store .cse9 .cse3 (store (select .cse9 .cse3) (+ (* |v_ULTIMATE.start_main_~i~1#1_35| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_36|) v_ArrVal_1717))) c_threadThread1of1ForFork0_~p~0.base) .cse10) 0) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_36| .cse1)))))) is different from false [2023-11-29 05:15:30,191 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 05:15:30,191 INFO L378 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 79 treesize of output 72 [2023-11-29 05:15:30,203 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 05:15:30,203 INFO L378 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 232 treesize of output 220 [2023-11-29 05:15:30,217 INFO L378 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 177 treesize of output 169 [2023-11-29 05:15:30,256 INFO L378 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 31 treesize of output 17 [2023-11-29 05:15:30,267 INFO L378 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 140 treesize of output 122 [2023-11-29 05:15:30,421 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 05:15:30,422 INFO L378 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 [2023-11-29 05:15:30,428 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 05:15:30,443 INFO L349 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2023-11-29 05:15:30,444 INFO L378 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 [2023-11-29 05:15:30,457 INFO L378 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 48 treesize of output 44 [2023-11-29 05:15:30,468 INFO L378 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 80 treesize of output 62 [2023-11-29 05:15:30,499 INFO L349 Elim1Store]: treesize reduction 38, result has 2.6 percent of original size [2023-11-29 05:15:30,499 INFO L378 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 [2023-11-29 05:15:30,508 INFO L349 Elim1Store]: treesize reduction 38, result has 2.6 percent of original size [2023-11-29 05:15:30,508 INFO L378 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 [2023-11-29 05:15:31,852 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1703 (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_1703) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)))) (forall ((v_ArrVal_1703 (Array Int Int)) (v_ArrVal_1702 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_1703))) (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_1704 (Array Int Int))) (let ((.cse0 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_1702))) (< (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_1704) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|) 1)))) (forall ((v_ArrVal_1705 (Array Int Int))) (not (= (select (select (store .cse2 .cse1 v_ArrVal_1705) |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|))))))))) is different from false [2023-11-29 05:15:31,953 WARN L854 $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_38| Int)) (or (forall ((v_ArrVal_1703 (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_38| v_ArrVal_1703) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)))) (< .cse0 |v_ULTIMATE.start_main_#t~mem8#1.base_38|))) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.base_38| Int)) (or (< .cse0 |v_ULTIMATE.start_main_#t~mem8#1.base_38|) (forall ((v_ArrVal_1703 (Array Int Int)) (v_ArrVal_1702 (Array Int Int))) (let ((.cse1 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_#t~mem8#1.base_38| v_ArrVal_1703))) (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_1705 (Array Int Int))) (not (= (select (select (store .cse1 .cse2 v_ArrVal_1705) |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_1704 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_main_#t~mem8#1.base_38| v_ArrVal_1702))) (< (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_1704) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|) 1)))))))))))) is different from false [2023-11-29 05:15:32,055 INFO L378 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 222 treesize of output 202 [2023-11-29 05:15:32,063 INFO L378 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 105 treesize of output 101 [2023-11-29 05:15:32,067 INFO L378 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 101 treesize of output 99 [2023-11-29 05:15:32,590 INFO L378 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 20 treesize of output 18 [2023-11-29 05:15:32,833 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 05:15:32,833 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 96 treesize of output 98 [2023-11-29 05:15:32,845 INFO L378 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 33 treesize of output 27 [2023-11-29 05:15:33,134 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 8 not checked. [2023-11-29 05:15:33,134 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1659713749] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 05:15:33,134 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 05:15:33,135 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 24, 24] total 69 [2023-11-29 05:15:33,135 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1248594998] [2023-11-29 05:15:33,135 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 05:15:33,136 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 70 states [2023-11-29 05:15:33,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:15:33,137 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2023-11-29 05:15:33,138 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=279, Invalid=3587, Unknown=68, NotChecked=896, Total=4830 [2023-11-29 05:15:34,944 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 38 out of 136 [2023-11-29 05:15:34,946 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 417 places, 511 transitions, 9443 flow. Second operand has 70 states, 70 states have (on average 40.542857142857144) internal successors, (2838), 70 states have internal predecessors, (2838), 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) [2023-11-29 05:15:34,946 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:15:34,946 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 38 of 136 [2023-11-29 05:15:34,946 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:15:49,481 INFO L124 PetriNetUnfolderBase]: 953/4069 cut-off events. [2023-11-29 05:15:49,481 INFO L125 PetriNetUnfolderBase]: For 82931/82936 co-relation queries the response was YES. [2023-11-29 05:15:49,504 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23018 conditions, 4069 events. 953/4069 cut-off events. For 82931/82936 co-relation queries the response was YES. Maximal size of possible extension queue 143. Compared 37104 event pairs, 245 based on Foata normal form. 21/4090 useless extension candidates. Maximal degree in co-relation 22882. Up to 1483 conditions per place. [2023-11-29 05:15:49,517 INFO L140 encePairwiseOnDemand]: 99/136 looper letters, 443 selfloop transitions, 210 changer transitions 0/675 dead transitions. [2023-11-29 05:15:49,518 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 457 places, 675 transitions, 12836 flow [2023-11-29 05:15:49,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2023-11-29 05:15:49,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2023-11-29 05:15:49,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 1788 transitions. [2023-11-29 05:15:49,521 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3206599713055954 [2023-11-29 05:15:49,521 INFO L72 ComplementDD]: Start complementDD. Operand 41 states and 1788 transitions. [2023-11-29 05:15:49,521 INFO L73 IsDeterministic]: Start isDeterministic. Operand 41 states and 1788 transitions. [2023-11-29 05:15:49,522 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:15:49,522 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 41 states and 1788 transitions. [2023-11-29 05:15:49,525 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 42 states, 41 states have (on average 43.609756097560975) internal successors, (1788), 41 states have internal predecessors, (1788), 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) [2023-11-29 05:15:49,531 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 42 states, 42 states have (on average 136.0) internal successors, (5712), 42 states have internal predecessors, (5712), 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) [2023-11-29 05:15:49,532 INFO L81 ComplementDD]: Finished complementDD. Result has 42 states, 42 states have (on average 136.0) internal successors, (5712), 42 states have internal predecessors, (5712), 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) [2023-11-29 05:15:49,532 INFO L175 Difference]: Start difference. First operand has 417 places, 511 transitions, 9443 flow. Second operand 41 states and 1788 transitions. [2023-11-29 05:15:49,532 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 457 places, 675 transitions, 12836 flow [2023-11-29 05:15:50,051 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 435 places, 675 transitions, 12637 flow, removed 64 selfloop flow, removed 22 redundant places. [2023-11-29 05:15:50,064 INFO L231 Difference]: Finished difference. Result has 443 places, 536 transitions, 10609 flow [2023-11-29 05:15:50,064 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=136, PETRI_DIFFERENCE_MINUEND_FLOW=9266, PETRI_DIFFERENCE_MINUEND_PLACES=395, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=511, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=187, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=305, PETRI_DIFFERENCE_SUBTRAHEND_STATES=41, PETRI_FLOW=10609, PETRI_PLACES=443, PETRI_TRANSITIONS=536} [2023-11-29 05:15:50,065 INFO L281 CegarLoopForPetriNet]: 135 programPoint places, 308 predicate places. [2023-11-29 05:15:50,065 INFO L495 AbstractCegarLoop]: Abstraction has has 443 places, 536 transitions, 10609 flow [2023-11-29 05:15:50,065 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 70 states, 70 states have (on average 40.542857142857144) internal successors, (2838), 70 states have internal predecessors, (2838), 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) [2023-11-29 05:15:50,066 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:15:50,066 INFO L208 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, 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, 1, 1, 1, 1, 1, 1] [2023-11-29 05:15:50,071 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a004bb2d-d8b4-4969-87b1-fc9d64ff2ac9/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2023-11-29 05:15:50,266 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a004bb2d-d8b4-4969-87b1-fc9d64ff2ac9/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2023-11-29 05:15:50,266 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2023-11-29 05:15:50,267 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:15:50,267 INFO L85 PathProgramCache]: Analyzing trace with hash 960365543, now seen corresponding path program 9 times [2023-11-29 05:15:50,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:15:50,267 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1986375943] [2023-11-29 05:15:50,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:15:50,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:15:50,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:15:52,547 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 05:15:52,547 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:15:52,547 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1986375943] [2023-11-29 05:15:52,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1986375943] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 05:15:52,547 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2143366503] [2023-11-29 05:15:52,547 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-29 05:15:52,548 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 05:15:52,548 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a004bb2d-d8b4-4969-87b1-fc9d64ff2ac9/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:15:52,549 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a004bb2d-d8b4-4969-87b1-fc9d64ff2ac9/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 05:15:52,549 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a004bb2d-d8b4-4969-87b1-fc9d64ff2ac9/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-11-29 05:15:52,737 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-11-29 05:15:52,737 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 05:15:52,739 INFO L262 TraceCheckSpWp]: Trace formula consists of 309 conjuncts, 69 conjunts are in the unsatisfiable core [2023-11-29 05:15:52,743 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:15:52,780 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2023-11-29 05:15:52,889 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 05:15:52,889 INFO L378 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 11 treesize of output 7 [2023-11-29 05:15:53,578 INFO L349 Elim1Store]: treesize reduction 44, result has 20.0 percent of original size [2023-11-29 05:15:53,578 INFO L378 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 69 treesize of output 65 [2023-11-29 05:15:53,593 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 05:15:53,594 INFO L378 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 24 treesize of output 11 [2023-11-29 05:15:54,618 INFO L349 Elim1Store]: treesize reduction 44, result has 20.0 percent of original size [2023-11-29 05:15:54,618 INFO L378 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 76 treesize of output 70 [2023-11-29 05:15:54,631 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 05:15:54,631 INFO L378 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 24 treesize of output 11 [2023-11-29 05:15:55,391 INFO L378 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 [2023-11-29 05:15:55,538 INFO L378 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 19 treesize of output 18 [2023-11-29 05:15:55,730 INFO L378 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 26 treesize of output 28 [2023-11-29 05:15:56,486 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 05:15:56,487 INFO L378 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 [2023-11-29 05:15:56,511 INFO L378 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 7 treesize of output 3 [2023-11-29 05:15:56,643 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 05:15:56,643 INFO L378 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 30 treesize of output 21 [2023-11-29 05:15:56,685 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 05:15:56,686 INFO L378 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 30 treesize of output 21 [2023-11-29 05:15:56,723 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 05:15:56,723 INFO L378 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 30 treesize of output 21 [2023-11-29 05:15:56,755 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 05:15:56,756 INFO L378 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 30 treesize of output 21 [2023-11-29 05:15:56,925 INFO L378 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 33 treesize of output 38 [2023-11-29 05:15:57,155 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 05:15:57,158 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 05:15:57,160 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 05:15:57,162 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 05:15:57,164 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 05:15:57,165 INFO L378 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 52 treesize of output 41 [2023-11-29 05:15:57,293 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 05:15:57,293 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 05:15:58,757 WARN L854 $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|)) (.cse2 (* |c_ULTIMATE.start_main_~i~1#1| 4)) (.cse4 (+ c_threadThread1of1ForFork0_~p~0.offset 3)) (.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_#t~mem8#1.offset_39| Int)) (or (forall ((v_ArrVal_1883 (Array Int Int)) (v_ArrVal_1885 Int)) (= (select (select (let ((.cse0 (let ((.cse3 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1883))) (store .cse3 c_threadThread1of1ForFork0_~p~0.base (store (select .cse3 c_threadThread1of1ForFork0_~p~0.base) .cse4 0))))) (store .cse0 .cse1 (store (select .cse0 .cse1) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_39| .cse2) v_ArrVal_1885))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 1)) 0)) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_39| .cse5))) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_39| Int)) (or (forall ((v_ArrVal_1883 (Array Int Int)) (v_ArrVal_1885 Int)) (= (select (select (let ((.cse6 (let ((.cse7 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1883))) (store .cse7 c_threadThread1of1ForFork0_~p~0.base (store (select .cse7 c_threadThread1of1ForFork0_~p~0.base) .cse4 0))))) (store .cse6 .cse1 (store (select .cse6 .cse1) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_39| .cse2) v_ArrVal_1885))) c_threadThread1of1ForFork0_~p~0.base) .cse4) 0)) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_39| .cse5))) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_39| Int)) (or (forall ((v_ArrVal_1883 (Array Int Int)) (v_ArrVal_1885 Int)) (= (select (select (let ((.cse8 (let ((.cse9 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1883))) (store .cse9 c_threadThread1of1ForFork0_~p~0.base (store (select .cse9 c_threadThread1of1ForFork0_~p~0.base) .cse4 0))))) (store .cse8 .cse1 (store (select .cse8 .cse1) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_39| .cse2) v_ArrVal_1885))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 2)) 0)) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_39| .cse5))) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_39| Int)) (or (forall ((v_ArrVal_1883 (Array Int Int)) (v_ArrVal_1885 Int)) (= (select (select (let ((.cse10 (let ((.cse11 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1883))) (store .cse11 c_threadThread1of1ForFork0_~p~0.base (store (select .cse11 c_threadThread1of1ForFork0_~p~0.base) .cse4 0))))) (store .cse10 .cse1 (store (select .cse10 .cse1) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_39| .cse2) v_ArrVal_1885))) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) 0)) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_39| .cse5))))) is different from false [2023-11-29 05:16:02,934 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_#t~post7#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|)) (.cse4 (+ c_threadThread1of1ForFork0_~p~0.offset 3)) (.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_37| Int)) (or (< |v_ULTIMATE.start_main_~i~1#1_37| .cse0) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_39| Int)) (or (forall ((v_ArrVal_1883 (Array Int Int)) (v_ArrVal_1885 Int)) (= (select (select (let ((.cse1 (let ((.cse3 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1883))) (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_#t~mem8#1.offset_39| (* |v_ULTIMATE.start_main_~i~1#1_37| 4)) v_ArrVal_1885))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 2)) 0)) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_39| .cse5))))) (forall ((|v_ULTIMATE.start_main_~i~1#1_37| Int)) (or (< |v_ULTIMATE.start_main_~i~1#1_37| .cse0) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_39| Int)) (or (forall ((v_ArrVal_1883 (Array Int Int)) (v_ArrVal_1885 Int)) (= (select (select (let ((.cse6 (let ((.cse7 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1883))) (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_#t~mem8#1.offset_39| (* |v_ULTIMATE.start_main_~i~1#1_37| 4)) v_ArrVal_1885))) c_threadThread1of1ForFork0_~p~0.base) .cse4) 0)) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_39| .cse5))))) (forall ((|v_ULTIMATE.start_main_~i~1#1_37| Int)) (or (< |v_ULTIMATE.start_main_~i~1#1_37| .cse0) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_39| Int)) (or (forall ((v_ArrVal_1883 (Array Int Int)) (v_ArrVal_1885 Int)) (= (select (select (let ((.cse8 (let ((.cse9 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1883))) (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_#t~mem8#1.offset_39| (* |v_ULTIMATE.start_main_~i~1#1_37| 4)) v_ArrVal_1885))) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) 0)) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_39| .cse5))))) (forall ((|v_ULTIMATE.start_main_~i~1#1_37| Int)) (or (< |v_ULTIMATE.start_main_~i~1#1_37| .cse0) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_39| Int)) (or (forall ((v_ArrVal_1883 (Array Int Int)) (v_ArrVal_1885 Int)) (= (select (select (let ((.cse10 (let ((.cse11 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1883))) (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_#t~mem8#1.offset_39| (* |v_ULTIMATE.start_main_~i~1#1_37| 4)) v_ArrVal_1885))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 1)) 0)) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_39| .cse5))))))) is different from false [2023-11-29 05:16:03,083 WARN L854 $PredicateComparison]: unable to prove that (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|)) (.cse4 (+ c_threadThread1of1ForFork0_~p~0.offset 3)) (.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_37| Int) (v_ArrVal_1883 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem8#1.offset_39| Int) (v_ArrVal_1885 Int)) (or (< |v_ULTIMATE.start_main_~i~1#1_37| .cse0) (= (select (select (let ((.cse1 (let ((.cse3 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1883))) (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_#t~mem8#1.offset_39| (* |v_ULTIMATE.start_main_~i~1#1_37| 4)) v_ArrVal_1885))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 2)) 0) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_39| .cse5))) (forall ((|v_ULTIMATE.start_main_~i~1#1_37| Int) (v_ArrVal_1883 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem8#1.offset_39| Int) (v_ArrVal_1885 Int)) (or (< |v_ULTIMATE.start_main_~i~1#1_37| .cse0) (= (select (select (let ((.cse6 (let ((.cse7 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1883))) (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_#t~mem8#1.offset_39| (* |v_ULTIMATE.start_main_~i~1#1_37| 4)) v_ArrVal_1885))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 1)) 0) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_39| .cse5))) (forall ((|v_ULTIMATE.start_main_~i~1#1_37| Int) (v_ArrVal_1883 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem8#1.offset_39| Int) (v_ArrVal_1885 Int)) (or (< |v_ULTIMATE.start_main_~i~1#1_37| .cse0) (= (select (select (let ((.cse8 (let ((.cse9 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1883))) (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_#t~mem8#1.offset_39| (* |v_ULTIMATE.start_main_~i~1#1_37| 4)) v_ArrVal_1885))) c_threadThread1of1ForFork0_~p~0.base) .cse4) 0) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_39| .cse5))) (forall ((|v_ULTIMATE.start_main_~i~1#1_37| Int) (v_ArrVal_1883 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem8#1.offset_39| Int) (v_ArrVal_1885 Int)) (or (< |v_ULTIMATE.start_main_~i~1#1_37| .cse0) (= (select (select (let ((.cse10 (let ((.cse11 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1883))) (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_#t~mem8#1.offset_39| (* |v_ULTIMATE.start_main_~i~1#1_37| 4)) v_ArrVal_1885))) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) 0) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_39| .cse5))))) is different from false [2023-11-29 05:16:03,276 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse5 (+ c_threadThread1of1ForFork0_~p~0.offset 2))) (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 (select |c_#race| c_threadThread1of1ForFork0_~p~0.base) .cse5 0))) (.cse4 (+ c_threadThread1of1ForFork0_~p~0.offset 3)) (.cse6 (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_37| Int) (v_ArrVal_1883 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem8#1.offset_39| Int) (v_ArrVal_1885 Int)) (or (< |v_ULTIMATE.start_main_~i~1#1_37| .cse0) (= (select (select (let ((.cse1 (store (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1883) c_threadThread1of1ForFork0_~p~0.base (store (select (store .cse3 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1883) c_threadThread1of1ForFork0_~p~0.base) .cse4 0)))) (store .cse1 .cse2 (store (select .cse1 .cse2) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_39| (* |v_ULTIMATE.start_main_~i~1#1_37| 4)) v_ArrVal_1885))) c_threadThread1of1ForFork0_~p~0.base) .cse5) 0) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_39| .cse6))) (forall ((|v_ULTIMATE.start_main_~i~1#1_37| Int) (v_ArrVal_1883 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem8#1.offset_39| Int) (v_ArrVal_1885 Int)) (or (< |v_ULTIMATE.start_main_~i~1#1_37| .cse0) (= 0 (select (select (let ((.cse7 (store (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1883) c_threadThread1of1ForFork0_~p~0.base (store (select (store .cse3 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1883) c_threadThread1of1ForFork0_~p~0.base) .cse4 0)))) (store .cse7 .cse2 (store (select .cse7 .cse2) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_39| (* |v_ULTIMATE.start_main_~i~1#1_37| 4)) v_ArrVal_1885))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 1))) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_39| .cse6))) (forall ((|v_ULTIMATE.start_main_~i~1#1_37| Int) (v_ArrVal_1883 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem8#1.offset_39| Int) (v_ArrVal_1885 Int)) (or (< |v_ULTIMATE.start_main_~i~1#1_37| .cse0) (= (select (select (let ((.cse8 (store (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1883) c_threadThread1of1ForFork0_~p~0.base (store (select (store .cse3 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1883) c_threadThread1of1ForFork0_~p~0.base) .cse4 0)))) (store .cse8 .cse2 (store (select .cse8 .cse2) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_39| (* |v_ULTIMATE.start_main_~i~1#1_37| 4)) v_ArrVal_1885))) c_threadThread1of1ForFork0_~p~0.base) .cse4) 0) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_39| .cse6))) (forall ((|v_ULTIMATE.start_main_~i~1#1_37| Int) (v_ArrVal_1883 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem8#1.offset_39| Int) (v_ArrVal_1885 Int)) (or (< |v_ULTIMATE.start_main_~i~1#1_37| .cse0) (= (select (select (let ((.cse9 (store (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1883) c_threadThread1of1ForFork0_~p~0.base (store (select (store .cse3 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1883) c_threadThread1of1ForFork0_~p~0.base) .cse4 0)))) (store .cse9 .cse2 (store (select .cse9 .cse2) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_39| (* |v_ULTIMATE.start_main_~i~1#1_37| 4)) v_ArrVal_1885))) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) 0) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_39| .cse6)))))) is different from false [2023-11-29 05:16:03,377 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse9 (+ c_threadThread1of1ForFork0_~p~0.offset 1)) (.cse7 (+ c_threadThread1of1ForFork0_~p~0.offset 2))) (let ((.cse0 (+ |c_ULTIMATE.start_main_~i~1#1| 1)) (.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) .cse9 0) .cse7 0))) (.cse5 (+ c_threadThread1of1ForFork0_~p~0.offset 3)) (.cse1 (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_37| Int) (v_ArrVal_1883 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem8#1.offset_39| Int) (v_ArrVal_1885 Int)) (or (< |v_ULTIMATE.start_main_~i~1#1_37| .cse0) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_39| .cse1) (= (select (select (let ((.cse2 (store (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1883) c_threadThread1of1ForFork0_~p~0.base (store (select (store .cse4 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1883) c_threadThread1of1ForFork0_~p~0.base) .cse5 0)))) (store .cse2 .cse3 (store (select .cse2 .cse3) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_39| (* |v_ULTIMATE.start_main_~i~1#1_37| 4)) v_ArrVal_1885))) c_threadThread1of1ForFork0_~p~0.base) .cse5) 0))) (forall ((|v_ULTIMATE.start_main_~i~1#1_37| Int) (v_ArrVal_1883 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem8#1.offset_39| Int) (v_ArrVal_1885 Int)) (or (< |v_ULTIMATE.start_main_~i~1#1_37| .cse0) (= (select (select (let ((.cse6 (store (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1883) c_threadThread1of1ForFork0_~p~0.base (store (select (store .cse4 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1883) c_threadThread1of1ForFork0_~p~0.base) .cse5 0)))) (store .cse6 .cse3 (store (select .cse6 .cse3) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_39| (* |v_ULTIMATE.start_main_~i~1#1_37| 4)) v_ArrVal_1885))) c_threadThread1of1ForFork0_~p~0.base) .cse7) 0) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_39| .cse1))) (forall ((|v_ULTIMATE.start_main_~i~1#1_37| Int) (v_ArrVal_1883 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem8#1.offset_39| Int) (v_ArrVal_1885 Int)) (or (< |v_ULTIMATE.start_main_~i~1#1_37| .cse0) (= (select (select (let ((.cse8 (store (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1883) c_threadThread1of1ForFork0_~p~0.base (store (select (store .cse4 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1883) c_threadThread1of1ForFork0_~p~0.base) .cse5 0)))) (store .cse8 .cse3 (store (select .cse8 .cse3) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_39| (* |v_ULTIMATE.start_main_~i~1#1_37| 4)) v_ArrVal_1885))) c_threadThread1of1ForFork0_~p~0.base) .cse9) 0) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_39| .cse1))) (forall ((|v_ULTIMATE.start_main_~i~1#1_37| Int) (v_ArrVal_1883 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem8#1.offset_39| Int) (v_ArrVal_1885 Int)) (or (< |v_ULTIMATE.start_main_~i~1#1_37| .cse0) (= (select (select (let ((.cse10 (store (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1883) c_threadThread1of1ForFork0_~p~0.base (store (select (store .cse4 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1883) c_threadThread1of1ForFork0_~p~0.base) .cse5 0)))) (store .cse10 .cse3 (store (select .cse10 .cse3) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_39| (* |v_ULTIMATE.start_main_~i~1#1_37| 4)) v_ArrVal_1885))) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) 0) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_39| .cse1)))))) is different from false [2023-11-29 05:16:03,444 INFO L349 Elim1Store]: treesize reduction 31, result has 62.2 percent of original size [2023-11-29 05:16:03,444 INFO L378 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 4 case distinctions, treesize of input 746 treesize of output 568 [2023-11-29 05:16:03,465 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 05:16:03,466 INFO L378 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 244 treesize of output 240 [2023-11-29 05:16:03,479 INFO L378 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 226 treesize of output 210 [2023-11-29 05:16:03,631 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 05:16:03,642 INFO L349 Elim1Store]: treesize reduction 81, result has 1.2 percent of original size [2023-11-29 05:16:03,642 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 746 treesize of output 1 [2023-11-29 05:16:03,648 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 05:16:03,681 INFO L349 Elim1Store]: treesize reduction 54, result has 34.1 percent of original size [2023-11-29 05:16:03,682 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 498 treesize of output 441 [2023-11-29 05:16:03,690 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 05:16:03,694 INFO L378 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 83 treesize of output 73 [2023-11-29 05:16:03,724 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 05:16:03,737 INFO L349 Elim1Store]: treesize reduction 81, result has 1.2 percent of original size [2023-11-29 05:16:03,737 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 714 treesize of output 1 [2023-11-29 05:16:05,196 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1872 (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_1872) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)))) (forall ((v_ArrVal_1872 (Array Int Int)) (v_ArrVal_1871 (Array Int Int))) (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_1872))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (or (forall ((v_ArrVal_1874 (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 .cse1 v_ArrVal_1874) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)))) (forall ((v_ArrVal_1873 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_1871))) (< (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_1873) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|) 1))))))))) is different from false [2023-11-29 05:16:05,299 WARN L854 $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_ArrVal_1872 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1872) |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_1872 (Array Int Int)) (v_ArrVal_1871 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1872))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (or (forall ((v_ArrVal_1873 (Array Int Int))) (let ((.cse1 (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1871))) (< (select (select .cse1 |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|) (+ (select (select (store .cse1 .cse2 v_ArrVal_1873) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|) 1)))) (forall ((v_ArrVal_1874 (Array Int Int))) (not (= (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_1874) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)))))))))) is different from false [2023-11-29 05:16:05,357 INFO L378 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 497 treesize of output 461 [2023-11-29 05:16:05,368 INFO L378 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 15 treesize of output 13 [2023-11-29 05:16:05,372 INFO L378 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 28 treesize of output 24 [2023-11-29 05:16:05,679 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 05:16:05,681 INFO L378 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 10 treesize of output 4 [2023-11-29 05:16:05,914 INFO L349 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2023-11-29 05:16:05,914 INFO L378 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 704 treesize of output 443 [2023-11-29 05:16:05,939 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 05:16:05,939 INFO L378 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 133 treesize of output 127 [2023-11-29 05:16:05,947 INFO L378 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 100 treesize of output 94 [2023-11-29 05:16:06,160 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 8 not checked. [2023-11-29 05:16:06,161 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2143366503] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 05:16:06,161 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 05:16:06,161 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 24, 24] total 68 [2023-11-29 05:16:06,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [880139656] [2023-11-29 05:16:06,161 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 05:16:06,161 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 69 states [2023-11-29 05:16:06,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:16:06,162 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2023-11-29 05:16:06,163 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=287, Invalid=3457, Unknown=66, NotChecked=882, Total=4692 [2023-11-29 05:16:06,680 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 38 out of 136 [2023-11-29 05:16:06,683 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 443 places, 536 transitions, 10609 flow. Second operand has 69 states, 69 states have (on average 40.53623188405797) internal successors, (2797), 69 states have internal predecessors, (2797), 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) [2023-11-29 05:16:06,683 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:16:06,683 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 38 of 136 [2023-11-29 05:16:06,683 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:16:21,324 INFO L124 PetriNetUnfolderBase]: 995/4267 cut-off events. [2023-11-29 05:16:21,325 INFO L125 PetriNetUnfolderBase]: For 107062/107066 co-relation queries the response was YES. [2023-11-29 05:16:21,350 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25799 conditions, 4267 events. 995/4267 cut-off events. For 107062/107066 co-relation queries the response was YES. Maximal size of possible extension queue 146. Compared 39460 event pairs, 256 based on Foata normal form. 27/4294 useless extension candidates. Maximal degree in co-relation 25656. Up to 1481 conditions per place. [2023-11-29 05:16:21,363 INFO L140 encePairwiseOnDemand]: 105/136 looper letters, 482 selfloop transitions, 212 changer transitions 0/716 dead transitions. [2023-11-29 05:16:21,363 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 483 places, 716 transitions, 14325 flow [2023-11-29 05:16:21,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2023-11-29 05:16:21,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2023-11-29 05:16:21,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 1793 transitions. [2023-11-29 05:16:21,365 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3215566714490674 [2023-11-29 05:16:21,365 INFO L72 ComplementDD]: Start complementDD. Operand 41 states and 1793 transitions. [2023-11-29 05:16:21,365 INFO L73 IsDeterministic]: Start isDeterministic. Operand 41 states and 1793 transitions. [2023-11-29 05:16:21,366 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:16:21,366 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 41 states and 1793 transitions. [2023-11-29 05:16:21,368 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 42 states, 41 states have (on average 43.73170731707317) internal successors, (1793), 41 states have internal predecessors, (1793), 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) [2023-11-29 05:16:21,372 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 42 states, 42 states have (on average 136.0) internal successors, (5712), 42 states have internal predecessors, (5712), 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) [2023-11-29 05:16:21,372 INFO L81 ComplementDD]: Finished complementDD. Result has 42 states, 42 states have (on average 136.0) internal successors, (5712), 42 states have internal predecessors, (5712), 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) [2023-11-29 05:16:21,372 INFO L175 Difference]: Start difference. First operand has 443 places, 536 transitions, 10609 flow. Second operand 41 states and 1793 transitions. [2023-11-29 05:16:21,372 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 483 places, 716 transitions, 14325 flow [2023-11-29 05:16:21,987 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 456 places, 716 transitions, 14142 flow, removed 34 selfloop flow, removed 27 redundant places. [2023-11-29 05:16:22,000 INFO L231 Difference]: Finished difference. Result has 465 places, 561 transitions, 11803 flow [2023-11-29 05:16:22,001 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=136, PETRI_DIFFERENCE_MINUEND_FLOW=10434, PETRI_DIFFERENCE_MINUEND_PLACES=416, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=536, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=188, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=329, PETRI_DIFFERENCE_SUBTRAHEND_STATES=41, PETRI_FLOW=11803, PETRI_PLACES=465, PETRI_TRANSITIONS=561} [2023-11-29 05:16:22,001 INFO L281 CegarLoopForPetriNet]: 135 programPoint places, 330 predicate places. [2023-11-29 05:16:22,001 INFO L495 AbstractCegarLoop]: Abstraction has has 465 places, 561 transitions, 11803 flow [2023-11-29 05:16:22,001 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 69 states, 69 states have (on average 40.53623188405797) internal successors, (2797), 69 states have internal predecessors, (2797), 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) [2023-11-29 05:16:22,001 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:16:22,002 INFO L208 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, 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, 1, 1, 1, 1, 1, 1] [2023-11-29 05:16:22,006 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a004bb2d-d8b4-4969-87b1-fc9d64ff2ac9/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2023-11-29 05:16:22,202 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a004bb2d-d8b4-4969-87b1-fc9d64ff2ac9/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2023-11-29 05:16:22,202 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2023-11-29 05:16:22,202 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:16:22,203 INFO L85 PathProgramCache]: Analyzing trace with hash 1782867195, now seen corresponding path program 10 times [2023-11-29 05:16:22,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:16:22,203 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1731379039] [2023-11-29 05:16:22,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:16:22,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:16:22,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:16:27,440 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 05:16:27,440 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:16:27,440 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1731379039] [2023-11-29 05:16:27,441 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1731379039] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 05:16:27,441 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1894656818] [2023-11-29 05:16:27,441 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-11-29 05:16:27,441 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 05:16:27,441 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a004bb2d-d8b4-4969-87b1-fc9d64ff2ac9/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:16:27,442 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a004bb2d-d8b4-4969-87b1-fc9d64ff2ac9/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 05:16:27,442 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a004bb2d-d8b4-4969-87b1-fc9d64ff2ac9/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2023-11-29 05:16:27,951 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-11-29 05:16:27,951 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 05:16:27,954 INFO L262 TraceCheckSpWp]: Trace formula consists of 309 conjuncts, 47 conjunts are in the unsatisfiable core [2023-11-29 05:16:27,958 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:16:28,615 INFO L349 Elim1Store]: treesize reduction 40, result has 21.6 percent of original size [2023-11-29 05:16:28,615 INFO L378 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 52 treesize of output 44 [2023-11-29 05:16:29,298 INFO L349 Elim1Store]: treesize reduction 40, result has 21.6 percent of original size [2023-11-29 05:16:29,298 INFO L378 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 59 treesize of output 49 [2023-11-29 05:16:29,310 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 05:16:29,310 INFO L378 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 16 treesize of output 11 [2023-11-29 05:16:29,987 INFO L378 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 [2023-11-29 05:16:30,149 INFO L378 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 [2023-11-29 05:16:30,841 INFO L378 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 [2023-11-29 05:16:30,859 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 05:16:30,859 INFO L378 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 [2023-11-29 05:16:31,009 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 05:16:31,010 INFO L378 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 18 [2023-11-29 05:16:31,038 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 05:16:31,038 INFO L378 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 18 [2023-11-29 05:16:31,058 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 05:16:31,059 INFO L378 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 18 [2023-11-29 05:16:31,090 INFO L378 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 [2023-11-29 05:16:31,250 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 05:16:31,251 INFO L378 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 34 treesize of output 25 [2023-11-29 05:16:31,408 INFO L378 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 [2023-11-29 05:16:31,633 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 05:16:31,635 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 05:16:31,637 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 05:16:31,639 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 05:16:31,641 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 05:16:31,641 INFO L378 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 58 treesize of output 47 [2023-11-29 05:16:31,655 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 05:16:31,655 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 05:16:33,020 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse6 (+ c_threadThread1of1ForFork0_~p~0.offset 2))) (let ((.cse1 (+ |c_ULTIMATE.start_main_#t~mem8#1.offset| (* |c_ULTIMATE.start_main_~i~1#1| 4))) (.cse2 (store |c_#race| c_threadThread1of1ForFork0_~p~0.base (store (select |c_#race| c_threadThread1of1ForFork0_~p~0.base) .cse6 0))) (.cse3 (+ c_threadThread1of1ForFork0_~p~0.offset 3))) (and (forall ((v_ArrVal_2050 (Array Int Int)) (v_ArrVal_2053 Int)) (= (select (select (let ((.cse0 (store (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2050) c_threadThread1of1ForFork0_~p~0.base (store (select (store .cse2 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2050) 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_2053))) c_threadThread1of1ForFork0_~p~0.base) .cse3) 0)) (forall ((v_ArrVal_2050 (Array Int Int)) (v_ArrVal_2053 Int)) (= (select (select (let ((.cse4 (store (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2050) c_threadThread1of1ForFork0_~p~0.base (store (select (store .cse2 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2050) 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_2053))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 1)) 0)) (forall ((v_ArrVal_2050 (Array Int Int)) (v_ArrVal_2053 Int)) (= (select (select (let ((.cse5 (store (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2050) c_threadThread1of1ForFork0_~p~0.base (store (select (store .cse2 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2050) c_threadThread1of1ForFork0_~p~0.base) .cse3 0)))) (store .cse5 |c_ULTIMATE.start_main_#t~mem8#1.base| (store (select .cse5 |c_ULTIMATE.start_main_#t~mem8#1.base|) .cse1 v_ArrVal_2053))) c_threadThread1of1ForFork0_~p~0.base) .cse6) 0)) (forall ((v_ArrVal_2050 (Array Int Int)) (v_ArrVal_2053 Int)) (= (select (select (let ((.cse7 (store (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2050) c_threadThread1of1ForFork0_~p~0.base (store (select (store .cse2 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2050) c_threadThread1of1ForFork0_~p~0.base) .cse3 0)))) (store .cse7 |c_ULTIMATE.start_main_#t~mem8#1.base| (store (select .cse7 |c_ULTIMATE.start_main_#t~mem8#1.base|) .cse1 v_ArrVal_2053))) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) 0))))) is different from false [2023-11-29 05:16:33,057 WARN L854 $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)) (.cse2 (+ c_threadThread1of1ForFork0_~p~0.offset 2))) (and (forall ((v_ArrVal_2050 (Array Int Int)) (v_ArrVal_2053 Int) (v_ArrVal_2047 (Array Int Int))) (= (select (select (let ((.cse0 (store (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2050) c_threadThread1of1ForFork0_~p~0.base (store (select (store (store |c_#race| c_threadThread1of1ForFork0_~p~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2047) c_threadThread1of1ForFork0_~p~0.base) .cse2 0)) |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2050) 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_2053))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 1)) 0)) (forall ((v_ArrVal_2050 (Array Int Int)) (v_ArrVal_2053 Int) (v_ArrVal_2047 (Array Int Int))) (= (select (select (let ((.cse4 (store (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2050) c_threadThread1of1ForFork0_~p~0.base (store (select (store (store |c_#race| c_threadThread1of1ForFork0_~p~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2047) c_threadThread1of1ForFork0_~p~0.base) .cse2 0)) |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2050) 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_2053))) c_threadThread1of1ForFork0_~p~0.base) .cse3) 0)) (forall ((v_ArrVal_2050 (Array Int Int)) (v_ArrVal_2053 Int) (v_ArrVal_2047 (Array Int Int))) (= (select (select (let ((.cse5 (store (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2050) c_threadThread1of1ForFork0_~p~0.base (store (select (store (store |c_#race| c_threadThread1of1ForFork0_~p~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2047) c_threadThread1of1ForFork0_~p~0.base) .cse2 0)) |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2050) c_threadThread1of1ForFork0_~p~0.base) .cse3 0)))) (store .cse5 |c_ULTIMATE.start_main_#t~mem8#1.base| (store (select .cse5 |c_ULTIMATE.start_main_#t~mem8#1.base|) .cse1 v_ArrVal_2053))) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) 0)) (forall ((v_ArrVal_2050 (Array Int Int)) (v_ArrVal_2053 Int) (v_ArrVal_2047 (Array Int Int))) (= (select (select (let ((.cse6 (store (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2050) c_threadThread1of1ForFork0_~p~0.base (store (select (store (store |c_#race| c_threadThread1of1ForFork0_~p~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2047) c_threadThread1of1ForFork0_~p~0.base) .cse2 0)) |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2050) 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_2053))) c_threadThread1of1ForFork0_~p~0.base) .cse2) 0)))) is different from false [2023-11-29 05:16:33,168 WARN L854 $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)) (.cse4 (+ c_threadThread1of1ForFork0_~p~0.offset 2)) (.cse5 (+ c_threadThread1of1ForFork0_~p~0.offset 3))) (and (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_42| Int)) (or (< |v_ULTIMATE.start_main_#t~mem8#1.offset_42| .cse0) (forall ((v_ArrVal_2050 (Array Int Int)) (v_ArrVal_2053 Int) (v_ArrVal_2047 (Array Int Int))) (= (select (select (let ((.cse1 (store (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2050) c_threadThread1of1ForFork0_~p~0.base (store (select (store (store |c_#race| c_threadThread1of1ForFork0_~p~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2047) c_threadThread1of1ForFork0_~p~0.base) .cse4 0)) |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2050) c_threadThread1of1ForFork0_~p~0.base) .cse5 0)))) (store .cse1 .cse2 (store (select .cse1 .cse2) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_42| .cse3) v_ArrVal_2053))) c_threadThread1of1ForFork0_~p~0.base) .cse5) 0)))) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_42| Int)) (or (forall ((v_ArrVal_2050 (Array Int Int)) (v_ArrVal_2053 Int) (v_ArrVal_2047 (Array Int Int))) (= (select (select (let ((.cse6 (store (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2050) c_threadThread1of1ForFork0_~p~0.base (store (select (store (store |c_#race| c_threadThread1of1ForFork0_~p~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2047) c_threadThread1of1ForFork0_~p~0.base) .cse4 0)) |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2050) c_threadThread1of1ForFork0_~p~0.base) .cse5 0)))) (store .cse6 .cse2 (store (select .cse6 .cse2) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_42| .cse3) v_ArrVal_2053))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 1)) 0)) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_42| .cse0))) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_42| Int)) (or (< |v_ULTIMATE.start_main_#t~mem8#1.offset_42| .cse0) (forall ((v_ArrVal_2050 (Array Int Int)) (v_ArrVal_2053 Int) (v_ArrVal_2047 (Array Int Int))) (= 0 (select (select (let ((.cse7 (store (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2050) c_threadThread1of1ForFork0_~p~0.base (store (select (store (store |c_#race| c_threadThread1of1ForFork0_~p~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2047) c_threadThread1of1ForFork0_~p~0.base) .cse4 0)) |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2050) c_threadThread1of1ForFork0_~p~0.base) .cse5 0)))) (store .cse7 .cse2 (store (select .cse7 .cse2) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_42| .cse3) v_ArrVal_2053))) c_threadThread1of1ForFork0_~p~0.base) .cse4))))) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_42| Int)) (or (< |v_ULTIMATE.start_main_#t~mem8#1.offset_42| .cse0) (forall ((v_ArrVal_2050 (Array Int Int)) (v_ArrVal_2053 Int) (v_ArrVal_2047 (Array Int Int))) (= (select (select (let ((.cse8 (store (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2050) c_threadThread1of1ForFork0_~p~0.base (store (select (store (store |c_#race| c_threadThread1of1ForFork0_~p~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2047) c_threadThread1of1ForFork0_~p~0.base) .cse4 0)) |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2050) c_threadThread1of1ForFork0_~p~0.base) .cse5 0)))) (store .cse8 .cse2 (store (select .cse8 .cse2) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_42| .cse3) v_ArrVal_2053))) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) 0)))))) is different from false [2023-11-29 05:16:37,333 WARN L854 $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|)) (.cse4 (+ c_threadThread1of1ForFork0_~p~0.offset 3)) (.cse3 (+ c_threadThread1of1ForFork0_~p~0.offset 2)) (.cse0 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)) (.cse5 (+ |c_ULTIMATE.start_main_#t~post7#1| 1))) (and (forall ((|v_ULTIMATE.start_main_~i~1#1_39| Int)) (or (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_42| Int)) (or (< |v_ULTIMATE.start_main_#t~mem8#1.offset_42| .cse0) (forall ((v_ArrVal_2050 (Array Int Int)) (v_ArrVal_2053 Int) (v_ArrVal_2047 (Array Int Int))) (= (select (select (let ((.cse1 (store (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2050) c_threadThread1of1ForFork0_~p~0.base (store (select (store (store |c_#race| c_threadThread1of1ForFork0_~p~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2047) c_threadThread1of1ForFork0_~p~0.base) .cse3 0)) |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2050) c_threadThread1of1ForFork0_~p~0.base) .cse4 0)))) (store .cse1 .cse2 (store (select .cse1 .cse2) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_42| (* |v_ULTIMATE.start_main_~i~1#1_39| 4)) v_ArrVal_2053))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 1)) 0)))) (< |v_ULTIMATE.start_main_~i~1#1_39| .cse5))) (forall ((|v_ULTIMATE.start_main_~i~1#1_39| Int)) (or (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_42| Int)) (or (forall ((v_ArrVal_2050 (Array Int Int)) (v_ArrVal_2053 Int) (v_ArrVal_2047 (Array Int Int))) (= (select (select (let ((.cse6 (store (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2050) c_threadThread1of1ForFork0_~p~0.base (store (select (store (store |c_#race| c_threadThread1of1ForFork0_~p~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2047) c_threadThread1of1ForFork0_~p~0.base) .cse3 0)) |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2050) c_threadThread1of1ForFork0_~p~0.base) .cse4 0)))) (store .cse6 .cse2 (store (select .cse6 .cse2) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_42| (* |v_ULTIMATE.start_main_~i~1#1_39| 4)) v_ArrVal_2053))) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) 0)) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_42| .cse0))) (< |v_ULTIMATE.start_main_~i~1#1_39| .cse5))) (forall ((|v_ULTIMATE.start_main_~i~1#1_39| Int)) (or (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_42| Int)) (or (forall ((v_ArrVal_2050 (Array Int Int)) (v_ArrVal_2053 Int) (v_ArrVal_2047 (Array Int Int))) (= (select (select (let ((.cse7 (store (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2050) c_threadThread1of1ForFork0_~p~0.base (store (select (store (store |c_#race| c_threadThread1of1ForFork0_~p~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2047) c_threadThread1of1ForFork0_~p~0.base) .cse3 0)) |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2050) c_threadThread1of1ForFork0_~p~0.base) .cse4 0)))) (store .cse7 .cse2 (store (select .cse7 .cse2) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_42| (* |v_ULTIMATE.start_main_~i~1#1_39| 4)) v_ArrVal_2053))) c_threadThread1of1ForFork0_~p~0.base) .cse4) 0)) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_42| .cse0))) (< |v_ULTIMATE.start_main_~i~1#1_39| .cse5))) (forall ((|v_ULTIMATE.start_main_~i~1#1_39| Int)) (or (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_42| Int)) (or (forall ((v_ArrVal_2050 (Array Int Int)) (v_ArrVal_2053 Int) (v_ArrVal_2047 (Array Int Int))) (= (select (select (let ((.cse8 (store (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2050) c_threadThread1of1ForFork0_~p~0.base (store (select (store (store |c_#race| c_threadThread1of1ForFork0_~p~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2047) c_threadThread1of1ForFork0_~p~0.base) .cse3 0)) |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2050) c_threadThread1of1ForFork0_~p~0.base) .cse4 0)))) (store .cse8 .cse2 (store (select .cse8 .cse2) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_42| (* |v_ULTIMATE.start_main_~i~1#1_39| 4)) v_ArrVal_2053))) c_threadThread1of1ForFork0_~p~0.base) .cse3) 0)) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_42| .cse0))) (< |v_ULTIMATE.start_main_~i~1#1_39| .cse5))))) is different from false [2023-11-29 05:16:37,457 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~i~1#1| 1)) (.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 (+ c_threadThread1of1ForFork0_~p~0.offset 2)) (.cse5 (+ c_threadThread1of1ForFork0_~p~0.offset 3))) (and (forall ((v_ArrVal_2050 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem8#1.offset_42| Int) (v_ArrVal_2053 Int) (|v_ULTIMATE.start_main_~i~1#1_39| Int) (v_ArrVal_2047 (Array Int Int))) (or (< |v_ULTIMATE.start_main_~i~1#1_39| .cse0) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_42| .cse1) (= (select (select (let ((.cse2 (store (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2050) c_threadThread1of1ForFork0_~p~0.base (store (select (store (store |c_#race| c_threadThread1of1ForFork0_~p~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2047) c_threadThread1of1ForFork0_~p~0.base) .cse4 0)) |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2050) c_threadThread1of1ForFork0_~p~0.base) .cse5 0)))) (store .cse2 .cse3 (store (select .cse2 .cse3) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_42| (* |v_ULTIMATE.start_main_~i~1#1_39| 4)) v_ArrVal_2053))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 1)) 0))) (forall ((v_ArrVal_2050 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem8#1.offset_42| Int) (v_ArrVal_2053 Int) (|v_ULTIMATE.start_main_~i~1#1_39| Int) (v_ArrVal_2047 (Array Int Int))) (or (< |v_ULTIMATE.start_main_~i~1#1_39| .cse0) (= (select (select (let ((.cse6 (store (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2050) c_threadThread1of1ForFork0_~p~0.base (store (select (store (store |c_#race| c_threadThread1of1ForFork0_~p~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2047) c_threadThread1of1ForFork0_~p~0.base) .cse4 0)) |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2050) c_threadThread1of1ForFork0_~p~0.base) .cse5 0)))) (store .cse6 .cse3 (store (select .cse6 .cse3) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_42| (* |v_ULTIMATE.start_main_~i~1#1_39| 4)) v_ArrVal_2053))) c_threadThread1of1ForFork0_~p~0.base) .cse5) 0) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_42| .cse1))) (forall ((v_ArrVal_2050 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem8#1.offset_42| Int) (v_ArrVal_2053 Int) (|v_ULTIMATE.start_main_~i~1#1_39| Int) (v_ArrVal_2047 (Array Int Int))) (or (= (select (select (let ((.cse7 (store (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2050) c_threadThread1of1ForFork0_~p~0.base (store (select (store (store |c_#race| c_threadThread1of1ForFork0_~p~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2047) c_threadThread1of1ForFork0_~p~0.base) .cse4 0)) |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2050) c_threadThread1of1ForFork0_~p~0.base) .cse5 0)))) (store .cse7 .cse3 (store (select .cse7 .cse3) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_42| (* |v_ULTIMATE.start_main_~i~1#1_39| 4)) v_ArrVal_2053))) c_threadThread1of1ForFork0_~p~0.base) .cse4) 0) (< |v_ULTIMATE.start_main_~i~1#1_39| .cse0) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_42| .cse1))) (forall ((v_ArrVal_2050 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem8#1.offset_42| Int) (v_ArrVal_2053 Int) (|v_ULTIMATE.start_main_~i~1#1_39| Int) (v_ArrVal_2047 (Array Int Int))) (or (< |v_ULTIMATE.start_main_~i~1#1_39| .cse0) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_42| .cse1) (= (select (select (let ((.cse8 (store (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2050) c_threadThread1of1ForFork0_~p~0.base (store (select (store (store |c_#race| c_threadThread1of1ForFork0_~p~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2047) c_threadThread1of1ForFork0_~p~0.base) .cse4 0)) |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2050) c_threadThread1of1ForFork0_~p~0.base) .cse5 0)))) (store .cse8 .cse3 (store (select .cse8 .cse3) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_42| (* |v_ULTIMATE.start_main_~i~1#1_39| 4)) v_ArrVal_2053))) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) 0))))) is different from false [2023-11-29 05:16:37,631 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse10 (+ c_threadThread1of1ForFork0_~p~0.offset 1))) (let ((.cse0 (+ |c_ULTIMATE.start_main_~i~1#1| 1)) (.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 (select |c_#race| c_threadThread1of1ForFork0_~p~0.base) .cse10 0))) (.cse5 (+ c_threadThread1of1ForFork0_~p~0.offset 2)) (.cse6 (+ c_threadThread1of1ForFork0_~p~0.offset 3)) (.cse1 (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_ArrVal_2050 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem8#1.offset_42| Int) (v_ArrVal_2053 Int) (|v_ULTIMATE.start_main_~i~1#1_39| Int) (v_ArrVal_2047 (Array Int Int))) (or (< |v_ULTIMATE.start_main_~i~1#1_39| .cse0) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_42| .cse1) (= (select (select (let ((.cse2 (store (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2050) c_threadThread1of1ForFork0_~p~0.base (store (select (store (store |c_#race| c_threadThread1of1ForFork0_~p~0.base (store (select (store .cse4 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2047) c_threadThread1of1ForFork0_~p~0.base) .cse5 0)) |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2050) c_threadThread1of1ForFork0_~p~0.base) .cse6 0)))) (store .cse2 .cse3 (store (select .cse2 .cse3) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_42| (* |v_ULTIMATE.start_main_~i~1#1_39| 4)) v_ArrVal_2053))) c_threadThread1of1ForFork0_~p~0.base) .cse6) 0))) (forall ((v_ArrVal_2050 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem8#1.offset_42| Int) (v_ArrVal_2053 Int) (|v_ULTIMATE.start_main_~i~1#1_39| Int) (v_ArrVal_2047 (Array Int Int))) (or (< |v_ULTIMATE.start_main_~i~1#1_39| .cse0) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_42| .cse1) (= (select (select (let ((.cse7 (store (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2050) c_threadThread1of1ForFork0_~p~0.base (store (select (store (store |c_#race| c_threadThread1of1ForFork0_~p~0.base (store (select (store .cse4 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2047) c_threadThread1of1ForFork0_~p~0.base) .cse5 0)) |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2050) c_threadThread1of1ForFork0_~p~0.base) .cse6 0)))) (store .cse7 .cse3 (store (select .cse7 .cse3) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_42| (* |v_ULTIMATE.start_main_~i~1#1_39| 4)) v_ArrVal_2053))) c_threadThread1of1ForFork0_~p~0.base) .cse5) 0))) (forall ((v_ArrVal_2050 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem8#1.offset_42| Int) (v_ArrVal_2053 Int) (|v_ULTIMATE.start_main_~i~1#1_39| Int) (v_ArrVal_2047 (Array Int Int))) (or (< |v_ULTIMATE.start_main_~i~1#1_39| .cse0) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_42| .cse1) (= (select (select (let ((.cse8 (store (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2050) c_threadThread1of1ForFork0_~p~0.base (store (select (store (store |c_#race| c_threadThread1of1ForFork0_~p~0.base (store (select (store .cse4 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2047) c_threadThread1of1ForFork0_~p~0.base) .cse5 0)) |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2050) c_threadThread1of1ForFork0_~p~0.base) .cse6 0)))) (store .cse8 .cse3 (store (select .cse8 .cse3) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_42| (* |v_ULTIMATE.start_main_~i~1#1_39| 4)) v_ArrVal_2053))) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) 0))) (forall ((v_ArrVal_2050 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem8#1.offset_42| Int) (v_ArrVal_2053 Int) (|v_ULTIMATE.start_main_~i~1#1_39| Int) (v_ArrVal_2047 (Array Int Int))) (or (< |v_ULTIMATE.start_main_~i~1#1_39| .cse0) (= 0 (select (select (let ((.cse9 (store (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2050) c_threadThread1of1ForFork0_~p~0.base (store (select (store (store |c_#race| c_threadThread1of1ForFork0_~p~0.base (store (select (store .cse4 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2047) c_threadThread1of1ForFork0_~p~0.base) .cse5 0)) |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2050) c_threadThread1of1ForFork0_~p~0.base) .cse6 0)))) (store .cse9 .cse3 (store (select .cse9 .cse3) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_42| (* |v_ULTIMATE.start_main_~i~1#1_39| 4)) v_ArrVal_2053))) c_threadThread1of1ForFork0_~p~0.base) .cse10)) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_42| .cse1)))))) is different from false [2023-11-29 05:16:37,692 INFO L349 Elim1Store]: treesize reduction 53, result has 26.4 percent of original size [2023-11-29 05:16:37,693 INFO L378 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 4 case distinctions, treesize of input 339 treesize of output 325 [2023-11-29 05:16:37,701 INFO L378 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 226 treesize of output 220 [2023-11-29 05:16:37,830 INFO L349 Elim1Store]: treesize reduction 26, result has 63.9 percent of original size [2023-11-29 05:16:37,831 INFO L378 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 4 case distinctions, treesize of input 472 treesize of output 433 [2023-11-29 05:16:37,871 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 05:16:37,872 INFO L378 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 327 treesize of output 323 [2023-11-29 05:16:37,890 INFO L378 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 206 treesize of output 198 [2023-11-29 05:16:37,978 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 05:16:37,991 INFO L349 Elim1Store]: treesize reduction 71, result has 1.4 percent of original size [2023-11-29 05:16:37,991 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 344 treesize of output 1 [2023-11-29 05:16:37,999 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 05:16:38,010 INFO L349 Elim1Store]: treesize reduction 71, result has 1.4 percent of original size [2023-11-29 05:16:38,011 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 240 treesize of output 1 [2023-11-29 05:16:39,227 INFO L378 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 65 treesize of output 57 [2023-11-29 05:16:39,232 INFO L378 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 10 treesize of output 8 [2023-11-29 05:16:43,429 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2039 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_2039) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) 1) |c_ULTIMATE.start_main_~#is~0#1.base|)) (forall ((v_ArrVal_2039 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_2039) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|) |c_ULTIMATE.start_main_~#is~0#1.base|)))) is different from false [2023-11-29 05:16:43,489 WARN L854 $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_44| Int)) (or (forall ((v_ArrVal_2039 (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_44| v_ArrVal_2039) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)))) (< .cse0 |v_ULTIMATE.start_main_#t~mem8#1.base_44|))) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.base_44| Int)) (or (< .cse0 |v_ULTIMATE.start_main_#t~mem8#1.base_44|) (forall ((v_ArrVal_2039 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_#t~mem8#1.base_44| v_ArrVal_2039) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) 1) |c_ULTIMATE.start_main_~#is~0#1.base|)))))) is different from false [2023-11-29 05:16:44,445 INFO L349 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2023-11-29 05:16:44,445 INFO L378 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 45 treesize of output 36 [2023-11-29 05:16:44,451 INFO L378 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 11 treesize of output 9 [2023-11-29 05:16:44,756 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 8 not checked. [2023-11-29 05:16:44,756 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1894656818] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 05:16:44,756 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 05:16:44,756 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 23, 25] total 68 [2023-11-29 05:16:44,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1236921005] [2023-11-29 05:16:44,756 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 05:16:44,756 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 69 states [2023-11-29 05:16:44,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:16:44,757 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2023-11-29 05:16:44,758 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=223, Invalid=3442, Unknown=27, NotChecked=1000, Total=4692 [2023-11-29 05:16:45,256 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 38 out of 136 [2023-11-29 05:16:45,259 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 465 places, 561 transitions, 11803 flow. Second operand has 69 states, 69 states have (on average 40.56521739130435) internal successors, (2799), 69 states have internal predecessors, (2799), 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) [2023-11-29 05:16:45,259 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:16:45,259 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 38 of 136 [2023-11-29 05:16:45,259 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:17:05,294 INFO L124 PetriNetUnfolderBase]: 1132/4746 cut-off events. [2023-11-29 05:17:05,294 INFO L125 PetriNetUnfolderBase]: For 154292/154296 co-relation queries the response was YES. [2023-11-29 05:17:05,329 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30791 conditions, 4746 events. 1132/4746 cut-off events. For 154292/154296 co-relation queries the response was YES. Maximal size of possible extension queue 154. Compared 44931 event pairs, 211 based on Foata normal form. 27/4773 useless extension candidates. Maximal degree in co-relation 30639. Up to 1377 conditions per place. [2023-11-29 05:17:05,344 INFO L140 encePairwiseOnDemand]: 103/136 looper letters, 476 selfloop transitions, 314 changer transitions 0/812 dead transitions. [2023-11-29 05:17:05,344 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 504 places, 812 transitions, 17508 flow [2023-11-29 05:17:05,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2023-11-29 05:17:05,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2023-11-29 05:17:05,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 1771 transitions. [2023-11-29 05:17:05,347 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3255514705882353 [2023-11-29 05:17:05,347 INFO L72 ComplementDD]: Start complementDD. Operand 40 states and 1771 transitions. [2023-11-29 05:17:05,347 INFO L73 IsDeterministic]: Start isDeterministic. Operand 40 states and 1771 transitions. [2023-11-29 05:17:05,348 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:17:05,348 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 40 states and 1771 transitions. [2023-11-29 05:17:05,350 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 41 states, 40 states have (on average 44.275) internal successors, (1771), 40 states have internal predecessors, (1771), 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) [2023-11-29 05:17:05,353 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 41 states, 41 states have (on average 136.0) internal successors, (5576), 41 states have internal predecessors, (5576), 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) [2023-11-29 05:17:05,353 INFO L81 ComplementDD]: Finished complementDD. Result has 41 states, 41 states have (on average 136.0) internal successors, (5576), 41 states have internal predecessors, (5576), 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) [2023-11-29 05:17:05,353 INFO L175 Difference]: Start difference. First operand has 465 places, 561 transitions, 11803 flow. Second operand 40 states and 1771 transitions. [2023-11-29 05:17:05,353 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 504 places, 812 transitions, 17508 flow [2023-11-29 05:17:06,175 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 474 places, 812 transitions, 17229 flow, removed 63 selfloop flow, removed 30 redundant places. [2023-11-29 05:17:06,191 INFO L231 Difference]: Finished difference. Result has 484 places, 653 transitions, 15161 flow [2023-11-29 05:17:06,191 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=136, PETRI_DIFFERENCE_MINUEND_FLOW=11544, PETRI_DIFFERENCE_MINUEND_PLACES=435, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=561, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=228, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=305, PETRI_DIFFERENCE_SUBTRAHEND_STATES=40, PETRI_FLOW=15161, PETRI_PLACES=484, PETRI_TRANSITIONS=653} [2023-11-29 05:17:06,192 INFO L281 CegarLoopForPetriNet]: 135 programPoint places, 349 predicate places. [2023-11-29 05:17:06,192 INFO L495 AbstractCegarLoop]: Abstraction has has 484 places, 653 transitions, 15161 flow [2023-11-29 05:17:06,192 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 69 states, 69 states have (on average 40.56521739130435) internal successors, (2799), 69 states have internal predecessors, (2799), 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) [2023-11-29 05:17:06,192 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:17:06,192 INFO L208 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, 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, 1, 1, 1, 1, 1, 1] [2023-11-29 05:17:06,199 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a004bb2d-d8b4-4969-87b1-fc9d64ff2ac9/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2023-11-29 05:17:06,393 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a004bb2d-d8b4-4969-87b1-fc9d64ff2ac9/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2023-11-29 05:17:06,393 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2023-11-29 05:17:06,393 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:17:06,393 INFO L85 PathProgramCache]: Analyzing trace with hash -1739273851, now seen corresponding path program 11 times [2023-11-29 05:17:06,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:17:06,394 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [206682668] [2023-11-29 05:17:06,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:17:06,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:17:06,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:17:08,583 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 05:17:08,583 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:17:08,583 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [206682668] [2023-11-29 05:17:08,583 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [206682668] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 05:17:08,583 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1447481181] [2023-11-29 05:17:08,583 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-11-29 05:17:08,583 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 05:17:08,583 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a004bb2d-d8b4-4969-87b1-fc9d64ff2ac9/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:17:08,584 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a004bb2d-d8b4-4969-87b1-fc9d64ff2ac9/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 05:17:08,585 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a004bb2d-d8b4-4969-87b1-fc9d64ff2ac9/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2023-11-29 05:17:09,181 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-29 05:17:09,181 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 05:17:09,184 INFO L262 TraceCheckSpWp]: Trace formula consists of 309 conjuncts, 76 conjunts are in the unsatisfiable core [2023-11-29 05:17:09,189 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:17:09,193 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2023-11-29 05:17:09,279 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2023-11-29 05:17:09,279 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 2 case distinctions, treesize of input 19 treesize of output 16 [2023-11-29 05:17:09,533 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-11-29 05:17:09,534 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2023-11-29 05:17:09,670 INFO L349 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2023-11-29 05:17:09,670 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 16 treesize of output 18 [2023-11-29 05:17:10,522 INFO L349 Elim1Store]: treesize reduction 44, result has 20.0 percent of original size [2023-11-29 05:17:10,523 INFO L378 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 84 treesize of output 78 [2023-11-29 05:17:10,532 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2023-11-29 05:17:12,058 INFO L349 Elim1Store]: treesize reduction 56, result has 36.4 percent of original size [2023-11-29 05:17:12,058 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 89 treesize of output 94 [2023-11-29 05:17:12,077 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 05:17:12,078 INFO L378 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 16 treesize of output 11 [2023-11-29 05:17:12,207 INFO L378 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 7 treesize of output 5 [2023-11-29 05:17:12,728 INFO L378 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 [2023-11-29 05:17:12,842 INFO L378 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 19 treesize of output 18 [2023-11-29 05:17:13,336 INFO L378 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 26 treesize of output 28 [2023-11-29 05:17:13,478 INFO L378 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 33 treesize of output 38 [2023-11-29 05:17:13,649 INFO L378 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 23 treesize of output 11 [2023-11-29 05:17:13,666 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 7 treesize of output 3 [2023-11-29 05:17:13,798 INFO L378 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 37 treesize of output 26 [2023-11-29 05:17:13,841 INFO L378 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 37 treesize of output 26 [2023-11-29 05:17:13,883 INFO L378 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 37 treesize of output 26 [2023-11-29 05:17:13,916 INFO L378 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 37 treesize of output 26 [2023-11-29 05:17:14,137 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 05:17:14,139 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 05:17:14,140 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 05:17:14,142 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 05:17:14,144 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 05:17:14,144 INFO L378 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 52 treesize of output 41 [2023-11-29 05:17:14,242 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 05:17:14,242 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 05:17:14,571 WARN L854 $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_2222 (Array Int Int)) (v_ArrVal_2224 Int)) (= (select (select (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2222))) (store .cse0 |c_ULTIMATE.start_main_#t~mem8#1.base| (store (select .cse0 |c_ULTIMATE.start_main_#t~mem8#1.base|) .cse1 v_ArrVal_2224))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 3)) 0)) (forall ((v_ArrVal_2222 (Array Int Int)) (v_ArrVal_2224 Int)) (= (select (select (let ((.cse2 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2222))) (store .cse2 |c_ULTIMATE.start_main_#t~mem8#1.base| (store (select .cse2 |c_ULTIMATE.start_main_#t~mem8#1.base|) .cse1 v_ArrVal_2224))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 2)) 0)) (forall ((v_ArrVal_2222 (Array Int Int)) (v_ArrVal_2224 Int)) (= (select (select (let ((.cse3 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2222))) (store .cse3 |c_ULTIMATE.start_main_#t~mem8#1.base| (store (select .cse3 |c_ULTIMATE.start_main_#t~mem8#1.base|) .cse1 v_ArrVal_2224))) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) 0)) (forall ((v_ArrVal_2222 (Array Int Int)) (v_ArrVal_2224 Int)) (= (select (select (let ((.cse4 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2222))) (store .cse4 |c_ULTIMATE.start_main_#t~mem8#1.base| (store (select .cse4 |c_ULTIMATE.start_main_#t~mem8#1.base|) .cse1 v_ArrVal_2224))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 1)) 0)))) is different from false [2023-11-29 05:17:14,677 WARN L854 $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_45| Int)) (or (< |v_ULTIMATE.start_main_#t~mem8#1.offset_45| .cse0) (forall ((v_ArrVal_2222 (Array Int Int)) (v_ArrVal_2224 Int)) (= (select (select (let ((.cse1 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2222))) (store .cse1 .cse2 (store (select .cse1 .cse2) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_45| .cse3) v_ArrVal_2224))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 2)) 0)))) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_45| Int)) (or (< |v_ULTIMATE.start_main_#t~mem8#1.offset_45| .cse0) (forall ((v_ArrVal_2222 (Array Int Int)) (v_ArrVal_2224 Int)) (= (select (select (let ((.cse4 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2222))) (store .cse4 .cse2 (store (select .cse4 .cse2) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_45| .cse3) v_ArrVal_2224))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 3)) 0)))) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_45| Int)) (or (forall ((v_ArrVal_2222 (Array Int Int)) (v_ArrVal_2224 Int)) (= (select (select (let ((.cse5 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2222))) (store .cse5 .cse2 (store (select .cse5 .cse2) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_45| .cse3) v_ArrVal_2224))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 1)) 0)) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_45| .cse0))) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_45| Int)) (or (< |v_ULTIMATE.start_main_#t~mem8#1.offset_45| .cse0) (forall ((v_ArrVal_2222 (Array Int Int)) (v_ArrVal_2224 Int)) (= (select (select (let ((.cse6 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2222))) (store .cse6 .cse2 (store (select .cse6 .cse2) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_45| .cse3) v_ArrVal_2224))) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) 0)))))) is different from false [2023-11-29 05:17:38,133 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse8 (+ c_threadThread1of1ForFork0_~p~0.offset 2)) (.cse4 (+ c_threadThread1of1ForFork0_~p~0.offset 3))) (let ((.cse0 (+ |c_ULTIMATE.start_main_#t~post7#1| 1)) (.cse5 (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 (store (select |c_#race| c_threadThread1of1ForFork0_~p~0.base) .cse8 0) .cse4 0)))) (and (forall ((|v_ULTIMATE.start_main_~i~1#1_41| Int)) (or (< |v_ULTIMATE.start_main_~i~1#1_41| .cse0) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_45| Int)) (or (forall ((v_ArrVal_2222 (Array Int Int)) (v_ArrVal_2224 Int)) (= (select (select (let ((.cse1 (store .cse3 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2222))) (store .cse1 .cse2 (store (select .cse1 .cse2) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_45| (* |v_ULTIMATE.start_main_~i~1#1_41| 4)) v_ArrVal_2224))) c_threadThread1of1ForFork0_~p~0.base) .cse4) 0)) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_45| .cse5))))) (forall ((|v_ULTIMATE.start_main_~i~1#1_41| Int)) (or (< |v_ULTIMATE.start_main_~i~1#1_41| .cse0) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_45| Int)) (or (forall ((v_ArrVal_2222 (Array Int Int)) (v_ArrVal_2224 Int)) (= (select (select (let ((.cse6 (store .cse3 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2222))) (store .cse6 .cse2 (store (select .cse6 .cse2) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_45| (* |v_ULTIMATE.start_main_~i~1#1_41| 4)) v_ArrVal_2224))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 1)) 0)) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_45| .cse5))))) (forall ((|v_ULTIMATE.start_main_~i~1#1_41| Int)) (or (< |v_ULTIMATE.start_main_~i~1#1_41| .cse0) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_45| Int)) (or (forall ((v_ArrVal_2222 (Array Int Int)) (v_ArrVal_2224 Int)) (= (select (select (let ((.cse7 (store .cse3 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2222))) (store .cse7 .cse2 (store (select .cse7 .cse2) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_45| (* |v_ULTIMATE.start_main_~i~1#1_41| 4)) v_ArrVal_2224))) c_threadThread1of1ForFork0_~p~0.base) .cse8) 0)) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_45| .cse5))))) (forall ((|v_ULTIMATE.start_main_~i~1#1_41| Int)) (or (< |v_ULTIMATE.start_main_~i~1#1_41| .cse0) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_45| Int)) (or (< |v_ULTIMATE.start_main_#t~mem8#1.offset_45| .cse5) (forall ((v_ArrVal_2222 (Array Int Int)) (v_ArrVal_2224 Int)) (= (select (select (let ((.cse9 (store .cse3 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2222))) (store .cse9 .cse2 (store (select .cse9 .cse2) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_45| (* |v_ULTIMATE.start_main_~i~1#1_41| 4)) v_ArrVal_2224))) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) 0))))))))) is different from false [2023-11-29 05:17:38,262 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (+ c_threadThread1of1ForFork0_~p~0.offset 2)) (.cse8 (+ c_threadThread1of1ForFork0_~p~0.offset 3))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)) (.cse2 (store |c_#race| c_threadThread1of1ForFork0_~p~0.base (store (store (select |c_#race| c_threadThread1of1ForFork0_~p~0.base) .cse3 0) .cse8 0))) (.cse4 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)) (.cse5 (+ |c_ULTIMATE.start_main_~i~1#1| 1))) (and (forall ((|v_ULTIMATE.start_main_~i~1#1_41| Int) (v_ArrVal_2222 (Array Int Int)) (v_ArrVal_2224 Int) (|v_ULTIMATE.start_main_#t~mem8#1.offset_45| Int)) (or (= (select (select (let ((.cse0 (store .cse2 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2222))) (store .cse0 .cse1 (store (select .cse0 .cse1) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_45| (* |v_ULTIMATE.start_main_~i~1#1_41| 4)) v_ArrVal_2224))) c_threadThread1of1ForFork0_~p~0.base) .cse3) 0) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_45| .cse4) (< |v_ULTIMATE.start_main_~i~1#1_41| .cse5))) (forall ((|v_ULTIMATE.start_main_~i~1#1_41| Int) (v_ArrVal_2222 (Array Int Int)) (v_ArrVal_2224 Int) (|v_ULTIMATE.start_main_#t~mem8#1.offset_45| Int)) (or (= (select (select (let ((.cse6 (store .cse2 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2222))) (store .cse6 .cse1 (store (select .cse6 .cse1) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_45| (* |v_ULTIMATE.start_main_~i~1#1_41| 4)) v_ArrVal_2224))) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) 0) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_45| .cse4) (< |v_ULTIMATE.start_main_~i~1#1_41| .cse5))) (forall ((|v_ULTIMATE.start_main_~i~1#1_41| Int) (v_ArrVal_2222 (Array Int Int)) (v_ArrVal_2224 Int) (|v_ULTIMATE.start_main_#t~mem8#1.offset_45| Int)) (or (= (select (select (let ((.cse7 (store .cse2 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2222))) (store .cse7 .cse1 (store (select .cse7 .cse1) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_45| (* |v_ULTIMATE.start_main_~i~1#1_41| 4)) v_ArrVal_2224))) c_threadThread1of1ForFork0_~p~0.base) .cse8) 0) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_45| .cse4) (< |v_ULTIMATE.start_main_~i~1#1_41| .cse5))) (forall ((|v_ULTIMATE.start_main_~i~1#1_41| Int) (v_ArrVal_2222 (Array Int Int)) (v_ArrVal_2224 Int) (|v_ULTIMATE.start_main_#t~mem8#1.offset_45| Int)) (or (= (select (select (let ((.cse9 (store .cse2 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2222))) (store .cse9 .cse1 (store (select .cse9 .cse1) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_45| (* |v_ULTIMATE.start_main_~i~1#1_41| 4)) v_ArrVal_2224))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 1)) 0) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_45| .cse4) (< |v_ULTIMATE.start_main_~i~1#1_41| .cse5)))))) is different from false [2023-11-29 05:17:39,324 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (+ c_threadThread1of1ForFork0_~p~0.offset 1)) (.cse10 (+ c_threadThread1of1ForFork0_~p~0.offset 2)) (.cse7 (+ c_threadThread1of1ForFork0_~p~0.offset 3))) (let ((.cse4 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)) (.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)) (.cse2 (store |c_#race| c_threadThread1of1ForFork0_~p~0.base (store (store (store (select |c_#race| c_threadThread1of1ForFork0_~p~0.base) .cse3 0) .cse10 0) .cse7 0))) (.cse5 (+ |c_ULTIMATE.start_main_~i~1#1| 1))) (and (forall ((|v_ULTIMATE.start_main_~i~1#1_41| Int) (v_ArrVal_2222 (Array Int Int)) (v_ArrVal_2224 Int) (|v_ULTIMATE.start_main_#t~mem8#1.offset_45| Int)) (or (= (select (select (let ((.cse0 (store .cse2 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2222))) (store .cse0 .cse1 (store (select .cse0 .cse1) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_45| (* |v_ULTIMATE.start_main_~i~1#1_41| 4)) v_ArrVal_2224))) c_threadThread1of1ForFork0_~p~0.base) .cse3) 0) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_45| .cse4) (< |v_ULTIMATE.start_main_~i~1#1_41| .cse5))) (forall ((|v_ULTIMATE.start_main_~i~1#1_41| Int) (v_ArrVal_2222 (Array Int Int)) (v_ArrVal_2224 Int) (|v_ULTIMATE.start_main_#t~mem8#1.offset_45| Int)) (or (= (select (select (let ((.cse6 (store .cse2 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2222))) (store .cse6 .cse1 (store (select .cse6 .cse1) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_45| (* |v_ULTIMATE.start_main_~i~1#1_41| 4)) v_ArrVal_2224))) c_threadThread1of1ForFork0_~p~0.base) .cse7) 0) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_45| .cse4) (< |v_ULTIMATE.start_main_~i~1#1_41| .cse5))) (forall ((|v_ULTIMATE.start_main_~i~1#1_41| Int) (v_ArrVal_2222 (Array Int Int)) (v_ArrVal_2224 Int) (|v_ULTIMATE.start_main_#t~mem8#1.offset_45| Int)) (or (< |v_ULTIMATE.start_main_#t~mem8#1.offset_45| .cse4) (= (select (select (let ((.cse8 (store .cse2 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2222))) (store .cse8 .cse1 (store (select .cse8 .cse1) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_45| (* |v_ULTIMATE.start_main_~i~1#1_41| 4)) v_ArrVal_2224))) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) 0) (< |v_ULTIMATE.start_main_~i~1#1_41| .cse5))) (forall ((|v_ULTIMATE.start_main_~i~1#1_41| Int) (v_ArrVal_2222 (Array Int Int)) (v_ArrVal_2224 Int) (|v_ULTIMATE.start_main_#t~mem8#1.offset_45| Int)) (or (< |v_ULTIMATE.start_main_#t~mem8#1.offset_45| .cse4) (= (select (select (let ((.cse9 (store .cse2 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2222))) (store .cse9 .cse1 (store (select .cse9 .cse1) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_45| (* |v_ULTIMATE.start_main_~i~1#1_41| 4)) v_ArrVal_2224))) c_threadThread1of1ForFork0_~p~0.base) .cse10) 0) (< |v_ULTIMATE.start_main_~i~1#1_41| .cse5)))))) is different from false [2023-11-29 05:17:39,381 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 05:17:39,381 INFO L378 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 [2023-11-29 05:17:39,400 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 05:17:39,401 INFO L378 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 444 treesize of output 416 [2023-11-29 05:17:39,422 INFO L378 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 190 treesize of output 174 [2023-11-29 05:17:39,462 INFO L378 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 31 treesize of output 17 [2023-11-29 05:17:39,480 INFO L378 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 149 treesize of output 127 [2023-11-29 05:17:39,645 INFO L349 Elim1Store]: treesize reduction 38, result has 2.6 percent of original size [2023-11-29 05:17:39,645 INFO L378 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 [2023-11-29 05:17:39,655 INFO L349 Elim1Store]: treesize reduction 38, result has 2.6 percent of original size [2023-11-29 05:17:39,655 INFO L378 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 [2023-11-29 05:17:39,665 INFO L349 Elim1Store]: treesize reduction 38, result has 2.6 percent of original size [2023-11-29 05:17:39,665 INFO L378 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 [2023-11-29 05:17:50,123 WARN L854 $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_ArrVal_2210 (Array Int Int))) (not (= |c_ULTIMATE.start_main_~#is~0#1.base| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_2210) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)))) (forall ((v_ArrVal_2209 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem12#1.base_29| Int) (v_ArrVal_2210 (Array Int Int))) (let ((.cse1 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_2210))) (or (forall ((v_ArrVal_2212 (Array Int Int))) (not (= (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_29| v_ArrVal_2212) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)))) (forall ((v_ArrVal_2211 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_2209))) (< (select (select .cse2 |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|) (+ (select (select (store .cse2 |v_ULTIMATE.start_main_#t~mem12#1.base_29| v_ArrVal_2211) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|) 1)))) (< (select (select .cse1 |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) |v_ULTIMATE.start_main_#t~mem12#1.base_29|)))))) is different from false [2023-11-29 05:17:50,203 INFO L378 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 238 treesize of output 218 [2023-11-29 05:17:50,218 INFO L378 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 44 treesize of output 40 [2023-11-29 05:17:50,226 INFO L378 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 20 treesize of output 18 [2023-11-29 05:17:50,251 INFO L378 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 17 treesize of output 15 [2023-11-29 05:17:51,051 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 05:17:51,051 INFO L378 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 50 treesize of output 41 [2023-11-29 05:17:51,059 INFO L378 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 11 treesize of output 9 [2023-11-29 05:17:55,874 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2023-11-29 05:17:55,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1447481181] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 05:17:55,874 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 05:17:55,875 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 24, 24] total 71 [2023-11-29 05:17:55,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [186357187] [2023-11-29 05:17:55,875 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 05:17:55,875 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 72 states [2023-11-29 05:17:55,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:17:55,876 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2023-11-29 05:17:55,877 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=281, Invalid=3965, Unknown=68, NotChecked=798, Total=5112 [2023-11-29 05:17:56,724 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 38 out of 136 [2023-11-29 05:17:56,726 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 484 places, 653 transitions, 15161 flow. Second operand has 72 states, 72 states have (on average 40.486111111111114) internal successors, (2915), 72 states have internal predecessors, (2915), 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) [2023-11-29 05:17:56,726 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:17:56,726 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 38 of 136 [2023-11-29 05:17:56,726 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:18:16,831 INFO L124 PetriNetUnfolderBase]: 1154/5400 cut-off events. [2023-11-29 05:18:16,831 INFO L125 PetriNetUnfolderBase]: For 196021/196021 co-relation queries the response was YES. [2023-11-29 05:18:16,878 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35611 conditions, 5400 events. 1154/5400 cut-off events. For 196021/196021 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 54755 event pairs, 206 based on Foata normal form. 19/5419 useless extension candidates. Maximal degree in co-relation 35449. Up to 1881 conditions per place. [2023-11-29 05:18:16,898 INFO L140 encePairwiseOnDemand]: 104/136 looper letters, 511 selfloop transitions, 329 changer transitions 0/862 dead transitions. [2023-11-29 05:18:16,898 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 522 places, 862 transitions, 20648 flow [2023-11-29 05:18:16,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2023-11-29 05:18:16,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2023-11-29 05:18:16,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 1713 transitions. [2023-11-29 05:18:16,902 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3229638009049774 [2023-11-29 05:18:16,902 INFO L72 ComplementDD]: Start complementDD. Operand 39 states and 1713 transitions. [2023-11-29 05:18:16,902 INFO L73 IsDeterministic]: Start isDeterministic. Operand 39 states and 1713 transitions. [2023-11-29 05:18:16,903 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:18:16,903 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 39 states and 1713 transitions. [2023-11-29 05:18:16,905 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 40 states, 39 states have (on average 43.92307692307692) internal successors, (1713), 39 states have internal predecessors, (1713), 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) [2023-11-29 05:18:16,908 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 40 states, 40 states have (on average 136.0) internal successors, (5440), 40 states have internal predecessors, (5440), 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) [2023-11-29 05:18:16,909 INFO L81 ComplementDD]: Finished complementDD. Result has 40 states, 40 states have (on average 136.0) internal successors, (5440), 40 states have internal predecessors, (5440), 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) [2023-11-29 05:18:16,909 INFO L175 Difference]: Start difference. First operand has 484 places, 653 transitions, 15161 flow. Second operand 39 states and 1713 transitions. [2023-11-29 05:18:16,909 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 522 places, 862 transitions, 20648 flow [2023-11-29 05:18:18,317 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 496 places, 862 transitions, 20244 flow, removed 134 selfloop flow, removed 26 redundant places. [2023-11-29 05:18:18,337 INFO L231 Difference]: Finished difference. Result has 505 places, 712 transitions, 18226 flow [2023-11-29 05:18:18,338 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=136, PETRI_DIFFERENCE_MINUEND_FLOW=14861, PETRI_DIFFERENCE_MINUEND_PLACES=458, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=653, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=278, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=334, PETRI_DIFFERENCE_SUBTRAHEND_STATES=39, PETRI_FLOW=18226, PETRI_PLACES=505, PETRI_TRANSITIONS=712} [2023-11-29 05:18:18,338 INFO L281 CegarLoopForPetriNet]: 135 programPoint places, 370 predicate places. [2023-11-29 05:18:18,338 INFO L495 AbstractCegarLoop]: Abstraction has has 505 places, 712 transitions, 18226 flow [2023-11-29 05:18:18,339 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 72 states, 72 states have (on average 40.486111111111114) internal successors, (2915), 72 states have internal predecessors, (2915), 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) [2023-11-29 05:18:18,339 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:18:18,339 INFO L208 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, 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, 1, 1, 1, 1, 1, 1] [2023-11-29 05:18:18,346 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a004bb2d-d8b4-4969-87b1-fc9d64ff2ac9/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2023-11-29 05:18:18,539 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a004bb2d-d8b4-4969-87b1-fc9d64ff2ac9/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2023-11-29 05:18:18,540 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2023-11-29 05:18:18,540 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:18:18,540 INFO L85 PathProgramCache]: Analyzing trace with hash -1766035171, now seen corresponding path program 12 times [2023-11-29 05:18:18,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:18:18,540 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1776104752] [2023-11-29 05:18:18,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:18:18,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:18:18,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:18:24,655 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 05:18:24,656 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:18:24,656 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1776104752] [2023-11-29 05:18:24,656 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1776104752] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 05:18:24,656 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [127345403] [2023-11-29 05:18:24,656 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-11-29 05:18:24,656 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 05:18:24,656 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a004bb2d-d8b4-4969-87b1-fc9d64ff2ac9/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:18:24,657 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a004bb2d-d8b4-4969-87b1-fc9d64ff2ac9/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 05:18:24,658 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a004bb2d-d8b4-4969-87b1-fc9d64ff2ac9/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2023-11-29 05:18:24,857 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2023-11-29 05:18:24,857 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 05:18:24,860 INFO L262 TraceCheckSpWp]: Trace formula consists of 309 conjuncts, 66 conjunts are in the unsatisfiable core [2023-11-29 05:18:24,864 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:18:25,976 INFO L349 Elim1Store]: treesize reduction 40, result has 21.6 percent of original size [2023-11-29 05:18:25,977 INFO L378 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 52 treesize of output 44 [2023-11-29 05:18:25,989 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 05:18:25,989 INFO L378 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 16 treesize of output 11 [2023-11-29 05:18:27,116 INFO L349 Elim1Store]: treesize reduction 44, result has 20.0 percent of original size [2023-11-29 05:18:27,117 INFO L378 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 76 treesize of output 70 [2023-11-29 05:18:27,132 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 05:18:27,133 INFO L378 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 24 treesize of output 11 [2023-11-29 05:18:28,144 INFO L378 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 [2023-11-29 05:18:28,383 INFO L378 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 19 treesize of output 18 [2023-11-29 05:18:29,070 INFO L378 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 26 treesize of output 28 [2023-11-29 05:18:29,484 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 05:18:29,485 INFO L378 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 [2023-11-29 05:18:29,510 INFO L378 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 7 treesize of output 3 [2023-11-29 05:18:29,698 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 05:18:29,699 INFO L378 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 30 treesize of output 21 [2023-11-29 05:18:29,740 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 05:18:29,740 INFO L378 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 30 treesize of output 21 [2023-11-29 05:18:29,784 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 05:18:29,785 INFO L378 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 30 treesize of output 21 [2023-11-29 05:18:29,816 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 05:18:29,817 INFO L378 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 30 treesize of output 21 [2023-11-29 05:18:30,022 INFO L378 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 33 treesize of output 38 [2023-11-29 05:18:30,280 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 05:18:30,282 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 05:18:30,283 INFO L378 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 48 treesize of output 41 [2023-11-29 05:18:30,429 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 05:18:30,430 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 05:18:33,397 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse8 (+ c_threadThread1of1ForFork0_~p~0.offset 2))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)) (.cse2 (+ (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|) (* |c_ULTIMATE.start_main_~i~1#1| 4))) (.cse3 (store |c_#race| c_threadThread1of1ForFork0_~p~0.base (store (select |c_#race| c_threadThread1of1ForFork0_~p~0.base) .cse8 0))) (.cse4 (+ c_threadThread1of1ForFork0_~p~0.offset 3))) (and (forall ((v_ArrVal_2389 (Array Int Int)) (v_ArrVal_2391 Int)) (= (select (select (let ((.cse0 (store (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2389) c_threadThread1of1ForFork0_~p~0.base (store (select (store .cse3 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2389) c_threadThread1of1ForFork0_~p~0.base) .cse4 0)))) (store .cse0 .cse1 (store (select .cse0 .cse1) .cse2 v_ArrVal_2391))) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) 0)) (forall ((v_ArrVal_2389 (Array Int Int)) (v_ArrVal_2391 Int)) (= (select (select (let ((.cse5 (store (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2389) c_threadThread1of1ForFork0_~p~0.base (store (select (store .cse3 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2389) c_threadThread1of1ForFork0_~p~0.base) .cse4 0)))) (store .cse5 .cse1 (store (select .cse5 .cse1) .cse2 v_ArrVal_2391))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 1)) 0)) (forall ((v_ArrVal_2389 (Array Int Int)) (v_ArrVal_2391 Int)) (= (select (select (let ((.cse6 (store (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2389) c_threadThread1of1ForFork0_~p~0.base (store (select (store .cse3 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2389) c_threadThread1of1ForFork0_~p~0.base) .cse4 0)))) (store .cse6 .cse1 (store (select .cse6 .cse1) .cse2 v_ArrVal_2391))) c_threadThread1of1ForFork0_~p~0.base) .cse4) 0)) (forall ((v_ArrVal_2389 (Array Int Int)) (v_ArrVal_2391 Int)) (= (select (select (let ((.cse7 (store (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2389) c_threadThread1of1ForFork0_~p~0.base (store (select (store .cse3 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2389) c_threadThread1of1ForFork0_~p~0.base) .cse4 0)))) (store .cse7 .cse1 (store (select .cse7 .cse1) .cse2 v_ArrVal_2391))) c_threadThread1of1ForFork0_~p~0.base) .cse8) 0))))) is different from false [2023-11-29 05:18:33,481 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse8 (+ c_threadThread1of1ForFork0_~p~0.offset 2))) (let ((.cse5 (+ |c_ULTIMATE.start_main_#t~post7#1| 1)) (.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)) (.cse2 (select (select |c_#memory_$Pointer$.offset| |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) .cse8 0))) (.cse4 (+ c_threadThread1of1ForFork0_~p~0.offset 3))) (and (forall ((|v_ULTIMATE.start_main_~i~1#1_43| Int)) (or (forall ((v_ArrVal_2389 (Array Int Int)) (v_ArrVal_2391 Int)) (= (select (select (let ((.cse0 (store (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2389) c_threadThread1of1ForFork0_~p~0.base (store (select (store .cse3 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2389) c_threadThread1of1ForFork0_~p~0.base) .cse4 0)))) (store .cse0 .cse1 (store (select .cse0 .cse1) (+ (* |v_ULTIMATE.start_main_~i~1#1_43| 4) .cse2) v_ArrVal_2391))) c_threadThread1of1ForFork0_~p~0.base) .cse4) 0)) (< |v_ULTIMATE.start_main_~i~1#1_43| .cse5))) (forall ((|v_ULTIMATE.start_main_~i~1#1_43| Int)) (or (forall ((v_ArrVal_2389 (Array Int Int)) (v_ArrVal_2391 Int)) (= (select (select (let ((.cse6 (store (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2389) c_threadThread1of1ForFork0_~p~0.base (store (select (store .cse3 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2389) c_threadThread1of1ForFork0_~p~0.base) .cse4 0)))) (store .cse6 .cse1 (store (select .cse6 .cse1) (+ (* |v_ULTIMATE.start_main_~i~1#1_43| 4) .cse2) v_ArrVal_2391))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 1)) 0)) (< |v_ULTIMATE.start_main_~i~1#1_43| .cse5))) (forall ((|v_ULTIMATE.start_main_~i~1#1_43| Int)) (or (forall ((v_ArrVal_2389 (Array Int Int)) (v_ArrVal_2391 Int)) (= (select (select (let ((.cse7 (store (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2389) c_threadThread1of1ForFork0_~p~0.base (store (select (store .cse3 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2389) c_threadThread1of1ForFork0_~p~0.base) .cse4 0)))) (store .cse7 .cse1 (store (select .cse7 .cse1) (+ (* |v_ULTIMATE.start_main_~i~1#1_43| 4) .cse2) v_ArrVal_2391))) c_threadThread1of1ForFork0_~p~0.base) .cse8) 0)) (< |v_ULTIMATE.start_main_~i~1#1_43| .cse5))) (forall ((|v_ULTIMATE.start_main_~i~1#1_43| Int)) (or (< |v_ULTIMATE.start_main_~i~1#1_43| .cse5) (forall ((v_ArrVal_2389 (Array Int Int)) (v_ArrVal_2391 Int)) (= (select (select (let ((.cse9 (store (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2389) c_threadThread1of1ForFork0_~p~0.base (store (select (store .cse3 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2389) c_threadThread1of1ForFork0_~p~0.base) .cse4 0)))) (store .cse9 .cse1 (store (select .cse9 .cse1) (+ (* |v_ULTIMATE.start_main_~i~1#1_43| 4) .cse2) v_ArrVal_2391))) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) 0))))))) is different from false [2023-11-29 05:19:24,648 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse7 (+ c_threadThread1of1ForFork0_~p~0.offset 1)) (.cse9 (+ c_threadThread1of1ForFork0_~p~0.offset 2))) (let ((.cse5 (+ |c_ULTIMATE.start_main_~i~1#1| 1)) (.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)) (.cse2 (select (select |c_#memory_$Pointer$.offset| |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 (select |c_#race| c_threadThread1of1ForFork0_~p~0.base) .cse7 0) .cse9 0))) (.cse4 (+ c_threadThread1of1ForFork0_~p~0.offset 3))) (and (forall ((v_ArrVal_2389 (Array Int Int)) (|v_ULTIMATE.start_main_~i~1#1_43| Int) (v_ArrVal_2391 Int)) (or (= (select (select (let ((.cse0 (store (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2389) c_threadThread1of1ForFork0_~p~0.base (store (select (store .cse3 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2389) c_threadThread1of1ForFork0_~p~0.base) .cse4 0)))) (store .cse0 .cse1 (store (select .cse0 .cse1) (+ (* |v_ULTIMATE.start_main_~i~1#1_43| 4) .cse2) v_ArrVal_2391))) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) 0) (< |v_ULTIMATE.start_main_~i~1#1_43| .cse5))) (forall ((v_ArrVal_2389 (Array Int Int)) (|v_ULTIMATE.start_main_~i~1#1_43| Int) (v_ArrVal_2391 Int)) (or (< |v_ULTIMATE.start_main_~i~1#1_43| .cse5) (= 0 (select (select (let ((.cse6 (store (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2389) c_threadThread1of1ForFork0_~p~0.base (store (select (store .cse3 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2389) c_threadThread1of1ForFork0_~p~0.base) .cse4 0)))) (store .cse6 .cse1 (store (select .cse6 .cse1) (+ (* |v_ULTIMATE.start_main_~i~1#1_43| 4) .cse2) v_ArrVal_2391))) c_threadThread1of1ForFork0_~p~0.base) .cse7)))) (forall ((v_ArrVal_2389 (Array Int Int)) (|v_ULTIMATE.start_main_~i~1#1_43| Int) (v_ArrVal_2391 Int)) (or (= (select (select (let ((.cse8 (store (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2389) c_threadThread1of1ForFork0_~p~0.base (store (select (store .cse3 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2389) c_threadThread1of1ForFork0_~p~0.base) .cse4 0)))) (store .cse8 .cse1 (store (select .cse8 .cse1) (+ (* |v_ULTIMATE.start_main_~i~1#1_43| 4) .cse2) v_ArrVal_2391))) c_threadThread1of1ForFork0_~p~0.base) .cse9) 0) (< |v_ULTIMATE.start_main_~i~1#1_43| .cse5))) (forall ((v_ArrVal_2389 (Array Int Int)) (|v_ULTIMATE.start_main_~i~1#1_43| Int) (v_ArrVal_2391 Int)) (or (< |v_ULTIMATE.start_main_~i~1#1_43| .cse5) (= 0 (select (select (let ((.cse10 (store (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2389) c_threadThread1of1ForFork0_~p~0.base (store (select (store .cse3 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2389) c_threadThread1of1ForFork0_~p~0.base) .cse4 0)))) (store .cse10 .cse1 (store (select .cse10 .cse1) (+ (* |v_ULTIMATE.start_main_~i~1#1_43| 4) .cse2) v_ArrVal_2391))) c_threadThread1of1ForFork0_~p~0.base) .cse4))))))) is different from false [2023-11-29 05:19:24,750 INFO L349 Elim1Store]: treesize reduction 31, result has 62.2 percent of original size [2023-11-29 05:19:24,750 INFO L378 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 4 case distinctions, treesize of input 746 treesize of output 568 [2023-11-29 05:19:24,791 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 05:19:24,791 INFO L378 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 244 treesize of output 240 [2023-11-29 05:19:24,803 INFO L378 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 222 [2023-11-29 05:19:24,902 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 05:19:24,965 INFO L349 Elim1Store]: treesize reduction 58, result has 29.3 percent of original size [2023-11-29 05:19:24,965 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 778 treesize of output 573 [2023-11-29 05:19:24,973 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 05:19:24,976 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 141 treesize of output 131 [2023-11-29 05:19:25,018 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 05:19:25,063 INFO L349 Elim1Store]: treesize reduction 58, result has 29.3 percent of original size [2023-11-29 05:19:25,063 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 778 treesize of output 573 [2023-11-29 05:19:25,074 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 05:19:25,078 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 141 treesize of output 131 [2023-11-29 05:19:25,125 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 05:19:25,179 INFO L349 Elim1Store]: treesize reduction 54, result has 34.1 percent of original size [2023-11-29 05:19:25,180 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 530 treesize of output 473 [2023-11-29 05:19:25,193 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 05:19:25,199 INFO L378 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 91 treesize of output 81 [2023-11-29 05:19:27,213 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2378 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_2378) |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_2378 (Array Int Int)) (v_ArrVal_2377 (Array Int Int))) (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_2378))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (or (forall ((v_ArrVal_2379 (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 .cse1 v_ArrVal_2379) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)))) (forall ((v_ArrVal_2380 (Array Int Int))) (< (div (let ((.cse2 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_2377))) (+ 3 (select (select .cse2 |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|) (* (- 1) (select (select (store .cse2 .cse1 v_ArrVal_2380) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)))) 4) 1))))))) is different from false [2023-11-29 05:19:27,329 WARN L854 $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|))) (and (forall ((|v_ULTIMATE.start_main_#t~mem8#1.base_50| Int)) (or (forall ((v_ArrVal_2378 (Array Int Int)) (v_ArrVal_2377 (Array Int Int))) (let ((.cse0 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_#t~mem8#1.base_50| v_ArrVal_2378))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (or (forall ((v_ArrVal_2379 (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 .cse1 v_ArrVal_2379) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)))) (forall ((v_ArrVal_2380 (Array Int Int))) (< (div (let ((.cse2 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_main_#t~mem8#1.base_50| v_ArrVal_2377))) (+ (* (- 1) (select (select (store .cse2 .cse1 v_ArrVal_2380) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)) 3 (select (select .cse2 |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|))) 4) 1)))))) (< .cse3 |v_ULTIMATE.start_main_#t~mem8#1.base_50|))) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.base_50| Int)) (or (forall ((v_ArrVal_2378 (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_50| v_ArrVal_2378) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)))) (< .cse3 |v_ULTIMATE.start_main_#t~mem8#1.base_50|))))) is different from false [2023-11-29 05:19:27,448 INFO L378 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 436 treesize of output 400 [2023-11-29 05:19:27,461 INFO L378 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 36 treesize of output 32 [2023-11-29 05:19:27,468 INFO L378 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 16 treesize of output 14 [2023-11-29 05:19:28,023 INFO L378 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 20 treesize of output 18 [2023-11-29 05:19:28,279 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 05:19:28,280 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 96 treesize of output 98 [2023-11-29 05:19:28,302 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 05:19:28,303 INFO L378 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 33 treesize of output 35 [2023-11-29 05:19:28,672 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 8 not checked. [2023-11-29 05:19:28,672 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [127345403] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 05:19:28,672 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 05:19:28,672 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 24, 24] total 70 [2023-11-29 05:19:28,672 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [535905259] [2023-11-29 05:19:28,673 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 05:19:28,673 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 71 states [2023-11-29 05:19:28,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:19:28,674 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2023-11-29 05:19:28,676 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=269, Invalid=3935, Unknown=106, NotChecked=660, Total=4970 [2023-11-29 05:19:30,690 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 38 out of 136 [2023-11-29 05:19:30,692 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 505 places, 712 transitions, 18226 flow. Second operand has 71 states, 71 states have (on average 40.50704225352113) internal successors, (2876), 71 states have internal predecessors, (2876), 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) [2023-11-29 05:19:30,692 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:19:30,693 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 38 of 136 [2023-11-29 05:19:30,693 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:20:02,019 INFO L124 PetriNetUnfolderBase]: 1196/5619 cut-off events. [2023-11-29 05:20:02,019 INFO L125 PetriNetUnfolderBase]: For 238045/238049 co-relation queries the response was YES. [2023-11-29 05:20:02,091 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38646 conditions, 5619 events. 1196/5619 cut-off events. For 238045/238049 co-relation queries the response was YES. Maximal size of possible extension queue 183. Compared 57692 event pairs, 230 based on Foata normal form. 27/5646 useless extension candidates. Maximal degree in co-relation 38475. Up to 1880 conditions per place. [2023-11-29 05:20:02,114 INFO L140 encePairwiseOnDemand]: 104/136 looper letters, 546 selfloop transitions, 349 changer transitions 0/917 dead transitions. [2023-11-29 05:20:02,114 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 546 places, 917 transitions, 22887 flow [2023-11-29 05:20:02,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2023-11-29 05:20:02,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2023-11-29 05:20:02,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 1856 transitions. [2023-11-29 05:20:02,117 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.32492997198879553 [2023-11-29 05:20:02,117 INFO L72 ComplementDD]: Start complementDD. Operand 42 states and 1856 transitions. [2023-11-29 05:20:02,117 INFO L73 IsDeterministic]: Start isDeterministic. Operand 42 states and 1856 transitions. [2023-11-29 05:20:02,118 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:20:02,118 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 42 states and 1856 transitions. [2023-11-29 05:20:02,120 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 43 states, 42 states have (on average 44.19047619047619) internal successors, (1856), 42 states have internal predecessors, (1856), 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) [2023-11-29 05:20:02,124 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 43 states, 43 states have (on average 136.0) internal successors, (5848), 43 states have internal predecessors, (5848), 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) [2023-11-29 05:20:02,125 INFO L81 ComplementDD]: Finished complementDD. Result has 43 states, 43 states have (on average 136.0) internal successors, (5848), 43 states have internal predecessors, (5848), 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) [2023-11-29 05:20:02,125 INFO L175 Difference]: Start difference. First operand has 505 places, 712 transitions, 18226 flow. Second operand 42 states and 1856 transitions. [2023-11-29 05:20:02,125 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 546 places, 917 transitions, 22887 flow [2023-11-29 05:20:03,888 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 519 places, 917 transitions, 22658 flow, removed 54 selfloop flow, removed 27 redundant places. [2023-11-29 05:20:03,924 INFO L231 Difference]: Finished difference. Result has 527 places, 749 transitions, 20507 flow [2023-11-29 05:20:03,925 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=136, PETRI_DIFFERENCE_MINUEND_FLOW=18021, PETRI_DIFFERENCE_MINUEND_PLACES=478, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=712, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=316, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=368, PETRI_DIFFERENCE_SUBTRAHEND_STATES=42, PETRI_FLOW=20507, PETRI_PLACES=527, PETRI_TRANSITIONS=749} [2023-11-29 05:20:03,925 INFO L281 CegarLoopForPetriNet]: 135 programPoint places, 392 predicate places. [2023-11-29 05:20:03,926 INFO L495 AbstractCegarLoop]: Abstraction has has 527 places, 749 transitions, 20507 flow [2023-11-29 05:20:03,926 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 71 states, 71 states have (on average 40.50704225352113) internal successors, (2876), 71 states have internal predecessors, (2876), 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) [2023-11-29 05:20:03,926 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:20:03,926 INFO L208 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, 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, 1, 1, 1, 1, 1, 1] [2023-11-29 05:20:03,933 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a004bb2d-d8b4-4969-87b1-fc9d64ff2ac9/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2023-11-29 05:20:04,127 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a004bb2d-d8b4-4969-87b1-fc9d64ff2ac9/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 05:20:04,127 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2023-11-29 05:20:04,127 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:20:04,128 INFO L85 PathProgramCache]: Analyzing trace with hash 804228007, now seen corresponding path program 13 times [2023-11-29 05:20:04,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:20:04,128 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [720223521] [2023-11-29 05:20:04,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:20:04,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:20:04,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:20:06,395 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 05:20:06,395 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:20:06,395 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [720223521] [2023-11-29 05:20:06,395 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [720223521] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 05:20:06,395 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [345667240] [2023-11-29 05:20:06,396 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-11-29 05:20:06,396 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 05:20:06,396 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a004bb2d-d8b4-4969-87b1-fc9d64ff2ac9/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:20:06,397 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a004bb2d-d8b4-4969-87b1-fc9d64ff2ac9/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 05:20:06,398 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a004bb2d-d8b4-4969-87b1-fc9d64ff2ac9/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2023-11-29 05:20:06,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:20:06,590 INFO L262 TraceCheckSpWp]: Trace formula consists of 309 conjuncts, 59 conjunts are in the unsatisfiable core [2023-11-29 05:20:06,594 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:20:06,602 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2023-11-29 05:20:06,650 INFO L349 Elim1Store]: treesize reduction 30, result has 37.5 percent of original size [2023-11-29 05:20:06,651 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 2 case distinctions, treesize of input 21 treesize of output 29 [2023-11-29 05:20:06,775 INFO L349 Elim1Store]: treesize reduction 8, result has 61.9 percent of original size [2023-11-29 05:20:06,776 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 22 [2023-11-29 05:20:07,206 INFO L349 Elim1Store]: treesize reduction 44, result has 20.0 percent of original size [2023-11-29 05:20:07,207 INFO L378 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 54 treesize of output 52 [2023-11-29 05:20:08,051 INFO L349 Elim1Store]: treesize reduction 40, result has 27.3 percent of original size [2023-11-29 05:20:08,051 INFO L378 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 77 treesize of output 73 [2023-11-29 05:20:08,063 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 11 [2023-11-29 05:20:08,078 INFO L378 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 22 treesize of output 16 [2023-11-29 05:20:08,523 INFO L378 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 [2023-11-29 05:20:08,640 INFO L378 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 [2023-11-29 05:20:08,903 INFO L378 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 [2023-11-29 05:20:09,182 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 13 [2023-11-29 05:20:09,191 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 15 treesize of output 7 [2023-11-29 05:20:09,218 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 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 [2023-11-29 05:20:09,246 INFO L378 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 43 treesize of output 32 [2023-11-29 05:20:09,287 INFO L378 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 43 treesize of output 32 [2023-11-29 05:20:09,315 INFO L378 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 43 treesize of output 32 [2023-11-29 05:20:09,354 INFO L378 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 43 treesize of output 32 [2023-11-29 05:20:09,512 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 05:20:09,514 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 05:20:09,516 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 05:20:09,518 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 05:20:09,521 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 05:20:09,521 INFO L378 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 58 treesize of output 47 [2023-11-29 05:20:09,536 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 05:20:09,536 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 05:20:09,866 WARN L854 $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_2559 (Array Int Int)) (v_ArrVal_2561 Int)) (= (select (select (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2559))) (store .cse0 |c_ULTIMATE.start_main_#t~mem8#1.base| (store (select .cse0 |c_ULTIMATE.start_main_#t~mem8#1.base|) .cse1 v_ArrVal_2561))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 1)) 0)) (forall ((v_ArrVal_2559 (Array Int Int)) (v_ArrVal_2561 Int)) (= (select (select (let ((.cse2 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2559))) (store .cse2 |c_ULTIMATE.start_main_#t~mem8#1.base| (store (select .cse2 |c_ULTIMATE.start_main_#t~mem8#1.base|) .cse1 v_ArrVal_2561))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 3)) 0)) (forall ((v_ArrVal_2559 (Array Int Int)) (v_ArrVal_2561 Int)) (= (select (select (let ((.cse3 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2559))) (store .cse3 |c_ULTIMATE.start_main_#t~mem8#1.base| (store (select .cse3 |c_ULTIMATE.start_main_#t~mem8#1.base|) .cse1 v_ArrVal_2561))) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) 0)) (forall ((v_ArrVal_2559 (Array Int Int)) (v_ArrVal_2561 Int)) (= (select (select (let ((.cse4 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2559))) (store .cse4 |c_ULTIMATE.start_main_#t~mem8#1.base| (store (select .cse4 |c_ULTIMATE.start_main_#t~mem8#1.base|) .cse1 v_ArrVal_2561))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 2)) 0)))) is different from false [2023-11-29 05:20:19,870 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse8 (+ c_threadThread1of1ForFork0_~p~0.offset 3))) (let ((.cse3 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)) (.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)) (.cse2 (store |c_#race| c_threadThread1of1ForFork0_~p~0.base (store (select |c_#race| c_threadThread1of1ForFork0_~p~0.base) .cse8 0))) (.cse4 (+ |c_ULTIMATE.start_main_#t~post7#1| 1))) (and (forall ((|v_ULTIMATE.start_main_~i~1#1_45| Int)) (or (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_51| Int)) (or (forall ((v_ArrVal_2559 (Array Int Int)) (v_ArrVal_2561 Int)) (= (select (select (let ((.cse0 (store .cse2 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2559))) (store .cse0 .cse1 (store (select .cse0 .cse1) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_51| (* |v_ULTIMATE.start_main_~i~1#1_45| 4)) v_ArrVal_2561))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 2)) 0)) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_51| .cse3))) (< |v_ULTIMATE.start_main_~i~1#1_45| .cse4))) (forall ((|v_ULTIMATE.start_main_~i~1#1_45| Int)) (or (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_51| Int)) (or (< |v_ULTIMATE.start_main_#t~mem8#1.offset_51| .cse3) (forall ((v_ArrVal_2559 (Array Int Int)) (v_ArrVal_2561 Int)) (= (select (select (let ((.cse5 (store .cse2 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2559))) (store .cse5 .cse1 (store (select .cse5 .cse1) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_51| (* |v_ULTIMATE.start_main_~i~1#1_45| 4)) v_ArrVal_2561))) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) 0)))) (< |v_ULTIMATE.start_main_~i~1#1_45| .cse4))) (forall ((|v_ULTIMATE.start_main_~i~1#1_45| Int)) (or (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_51| Int)) (or (forall ((v_ArrVal_2559 (Array Int Int)) (v_ArrVal_2561 Int)) (= (select (select (let ((.cse6 (store .cse2 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2559))) (store .cse6 .cse1 (store (select .cse6 .cse1) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_51| (* |v_ULTIMATE.start_main_~i~1#1_45| 4)) v_ArrVal_2561))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 1)) 0)) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_51| .cse3))) (< |v_ULTIMATE.start_main_~i~1#1_45| .cse4))) (forall ((|v_ULTIMATE.start_main_~i~1#1_45| Int)) (or (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_51| Int)) (or (< |v_ULTIMATE.start_main_#t~mem8#1.offset_51| .cse3) (forall ((v_ArrVal_2559 (Array Int Int)) (v_ArrVal_2561 Int)) (= (select (select (let ((.cse7 (store .cse2 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2559))) (store .cse7 .cse1 (store (select .cse7 .cse1) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_51| (* |v_ULTIMATE.start_main_~i~1#1_45| 4)) v_ArrVal_2561))) c_threadThread1of1ForFork0_~p~0.base) .cse8) 0)))) (< |v_ULTIMATE.start_main_~i~1#1_45| .cse4)))))) is different from false [2023-11-29 05:20:23,978 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse7 (+ c_threadThread1of1ForFork0_~p~0.offset 2)) (.cse9 (+ c_threadThread1of1ForFork0_~p~0.offset 3))) (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 (store |c_#race| c_threadThread1of1ForFork0_~p~0.base (store (store (select |c_#race| c_threadThread1of1ForFork0_~p~0.base) .cse7 0) .cse9 0))) (.cse4 (+ |c_ULTIMATE.start_main_#t~post7#1| 1))) (and (forall ((|v_ULTIMATE.start_main_~i~1#1_45| Int)) (or (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_51| Int)) (or (< |v_ULTIMATE.start_main_#t~mem8#1.offset_51| .cse0) (forall ((v_ArrVal_2559 (Array Int Int)) (v_ArrVal_2561 Int)) (= (select (select (let ((.cse1 (store .cse3 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2559))) (store .cse1 .cse2 (store (select .cse1 .cse2) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_51| (* |v_ULTIMATE.start_main_~i~1#1_45| 4)) v_ArrVal_2561))) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) 0)))) (< |v_ULTIMATE.start_main_~i~1#1_45| .cse4))) (forall ((|v_ULTIMATE.start_main_~i~1#1_45| Int)) (or (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_51| Int)) (or (forall ((v_ArrVal_2559 (Array Int Int)) (v_ArrVal_2561 Int)) (= (select (select (let ((.cse5 (store .cse3 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2559))) (store .cse5 .cse2 (store (select .cse5 .cse2) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_51| (* |v_ULTIMATE.start_main_~i~1#1_45| 4)) v_ArrVal_2561))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 1)) 0)) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_51| .cse0))) (< |v_ULTIMATE.start_main_~i~1#1_45| .cse4))) (forall ((|v_ULTIMATE.start_main_~i~1#1_45| Int)) (or (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_51| Int)) (or (< |v_ULTIMATE.start_main_#t~mem8#1.offset_51| .cse0) (forall ((v_ArrVal_2559 (Array Int Int)) (v_ArrVal_2561 Int)) (= (select (select (let ((.cse6 (store .cse3 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2559))) (store .cse6 .cse2 (store (select .cse6 .cse2) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_51| (* |v_ULTIMATE.start_main_~i~1#1_45| 4)) v_ArrVal_2561))) c_threadThread1of1ForFork0_~p~0.base) .cse7) 0)))) (< |v_ULTIMATE.start_main_~i~1#1_45| .cse4))) (forall ((|v_ULTIMATE.start_main_~i~1#1_45| Int)) (or (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_51| Int)) (or (< |v_ULTIMATE.start_main_#t~mem8#1.offset_51| .cse0) (forall ((v_ArrVal_2559 (Array Int Int)) (v_ArrVal_2561 Int)) (= (select (select (let ((.cse8 (store .cse3 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2559))) (store .cse8 .cse2 (store (select .cse8 .cse2) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_51| (* |v_ULTIMATE.start_main_~i~1#1_45| 4)) v_ArrVal_2561))) c_threadThread1of1ForFork0_~p~0.base) .cse9) 0)))) (< |v_ULTIMATE.start_main_~i~1#1_45| .cse4)))))) is different from false [2023-11-29 05:20:24,251 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse8 (+ c_threadThread1of1ForFork0_~p~0.offset 2)) (.cse6 (+ c_threadThread1of1ForFork0_~p~0.offset 3))) (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 (store |c_#race| c_threadThread1of1ForFork0_~p~0.base (store (store (select |c_#race| c_threadThread1of1ForFork0_~p~0.base) .cse8 0) .cse6 0))) (.cse4 (+ |c_ULTIMATE.start_main_~i~1#1| 1))) (and (forall ((v_ArrVal_2559 (Array Int Int)) (v_ArrVal_2561 Int) (|v_ULTIMATE.start_main_#t~mem8#1.offset_51| Int) (|v_ULTIMATE.start_main_~i~1#1_45| Int)) (or (< |v_ULTIMATE.start_main_#t~mem8#1.offset_51| .cse0) (= (select (select (let ((.cse1 (store .cse3 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2559))) (store .cse1 .cse2 (store (select .cse1 .cse2) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_51| (* |v_ULTIMATE.start_main_~i~1#1_45| 4)) v_ArrVal_2561))) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) 0) (< |v_ULTIMATE.start_main_~i~1#1_45| .cse4))) (forall ((v_ArrVal_2559 (Array Int Int)) (v_ArrVal_2561 Int) (|v_ULTIMATE.start_main_#t~mem8#1.offset_51| Int) (|v_ULTIMATE.start_main_~i~1#1_45| Int)) (or (< |v_ULTIMATE.start_main_#t~mem8#1.offset_51| .cse0) (= (select (select (let ((.cse5 (store .cse3 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2559))) (store .cse5 .cse2 (store (select .cse5 .cse2) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_51| (* |v_ULTIMATE.start_main_~i~1#1_45| 4)) v_ArrVal_2561))) c_threadThread1of1ForFork0_~p~0.base) .cse6) 0) (< |v_ULTIMATE.start_main_~i~1#1_45| .cse4))) (forall ((v_ArrVal_2559 (Array Int Int)) (v_ArrVal_2561 Int) (|v_ULTIMATE.start_main_#t~mem8#1.offset_51| Int) (|v_ULTIMATE.start_main_~i~1#1_45| Int)) (or (< |v_ULTIMATE.start_main_#t~mem8#1.offset_51| .cse0) (< |v_ULTIMATE.start_main_~i~1#1_45| .cse4) (= (select (select (let ((.cse7 (store .cse3 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2559))) (store .cse7 .cse2 (store (select .cse7 .cse2) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_51| (* |v_ULTIMATE.start_main_~i~1#1_45| 4)) v_ArrVal_2561))) c_threadThread1of1ForFork0_~p~0.base) .cse8) 0))) (forall ((v_ArrVal_2559 (Array Int Int)) (v_ArrVal_2561 Int) (|v_ULTIMATE.start_main_#t~mem8#1.offset_51| Int) (|v_ULTIMATE.start_main_~i~1#1_45| Int)) (or (< |v_ULTIMATE.start_main_#t~mem8#1.offset_51| .cse0) (= (select (select (let ((.cse9 (store .cse3 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2559))) (store .cse9 .cse2 (store (select .cse9 .cse2) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_51| (* |v_ULTIMATE.start_main_~i~1#1_45| 4)) v_ArrVal_2561))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 1)) 0) (< |v_ULTIMATE.start_main_~i~1#1_45| .cse4)))))) is different from false [2023-11-29 05:20:26,142 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse8 (+ c_threadThread1of1ForFork0_~p~0.offset 1)) (.cse6 (+ c_threadThread1of1ForFork0_~p~0.offset 2)) (.cse10 (+ c_threadThread1of1ForFork0_~p~0.offset 3))) (let ((.cse3 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)) (.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)) (.cse2 (store |c_#race| c_threadThread1of1ForFork0_~p~0.base (store (store (store (select |c_#race| c_threadThread1of1ForFork0_~p~0.base) .cse8 0) .cse6 0) .cse10 0))) (.cse4 (+ |c_ULTIMATE.start_main_~i~1#1| 1))) (and (forall ((v_ArrVal_2559 (Array Int Int)) (v_ArrVal_2561 Int) (|v_ULTIMATE.start_main_#t~mem8#1.offset_51| Int) (|v_ULTIMATE.start_main_~i~1#1_45| Int)) (or (= (select (select (let ((.cse0 (store .cse2 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2559))) (store .cse0 .cse1 (store (select .cse0 .cse1) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_51| (* |v_ULTIMATE.start_main_~i~1#1_45| 4)) v_ArrVal_2561))) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) 0) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_51| .cse3) (< |v_ULTIMATE.start_main_~i~1#1_45| .cse4))) (forall ((v_ArrVal_2559 (Array Int Int)) (v_ArrVal_2561 Int) (|v_ULTIMATE.start_main_#t~mem8#1.offset_51| Int) (|v_ULTIMATE.start_main_~i~1#1_45| Int)) (or (< |v_ULTIMATE.start_main_#t~mem8#1.offset_51| .cse3) (< |v_ULTIMATE.start_main_~i~1#1_45| .cse4) (= (select (select (let ((.cse5 (store .cse2 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2559))) (store .cse5 .cse1 (store (select .cse5 .cse1) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_51| (* |v_ULTIMATE.start_main_~i~1#1_45| 4)) v_ArrVal_2561))) c_threadThread1of1ForFork0_~p~0.base) .cse6) 0))) (forall ((v_ArrVal_2559 (Array Int Int)) (v_ArrVal_2561 Int) (|v_ULTIMATE.start_main_#t~mem8#1.offset_51| Int) (|v_ULTIMATE.start_main_~i~1#1_45| Int)) (or (< |v_ULTIMATE.start_main_#t~mem8#1.offset_51| .cse3) (= (select (select (let ((.cse7 (store .cse2 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2559))) (store .cse7 .cse1 (store (select .cse7 .cse1) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_51| (* |v_ULTIMATE.start_main_~i~1#1_45| 4)) v_ArrVal_2561))) c_threadThread1of1ForFork0_~p~0.base) .cse8) 0) (< |v_ULTIMATE.start_main_~i~1#1_45| .cse4))) (forall ((v_ArrVal_2559 (Array Int Int)) (v_ArrVal_2561 Int) (|v_ULTIMATE.start_main_#t~mem8#1.offset_51| Int) (|v_ULTIMATE.start_main_~i~1#1_45| Int)) (or (< |v_ULTIMATE.start_main_#t~mem8#1.offset_51| .cse3) (= (select (select (let ((.cse9 (store .cse2 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2559))) (store .cse9 .cse1 (store (select .cse9 .cse1) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_51| (* |v_ULTIMATE.start_main_~i~1#1_45| 4)) v_ArrVal_2561))) c_threadThread1of1ForFork0_~p~0.base) .cse10) 0) (< |v_ULTIMATE.start_main_~i~1#1_45| .cse4)))))) is different from false [2023-11-29 05:20:26,201 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 05:20:26,201 INFO L378 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 [2023-11-29 05:20:26,218 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 05:20:26,218 INFO L378 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 [2023-11-29 05:20:26,234 INFO L378 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 197 treesize of output 181 [2023-11-29 05:20:26,276 INFO L378 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 31 treesize of output 17 [2023-11-29 05:20:26,295 INFO L378 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 152 treesize of output 130 [2023-11-29 05:20:26,450 INFO L349 Elim1Store]: treesize reduction 38, result has 2.6 percent of original size [2023-11-29 05:20:26,450 INFO L378 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 [2023-11-29 05:20:26,459 INFO L349 Elim1Store]: treesize reduction 38, result has 2.6 percent of original size [2023-11-29 05:20:26,459 INFO L378 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 [2023-11-29 05:20:26,467 INFO L349 Elim1Store]: treesize reduction 38, result has 2.6 percent of original size [2023-11-29 05:20:26,467 INFO L378 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 [2023-11-29 05:20:31,328 INFO L378 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 70 treesize of output 62 [2023-11-29 05:20:31,587 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2547 (Array Int Int))) (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_2547))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (or (not (= |c_ULTIMATE.start_main_~#is~0#1.base| .cse0)) (forall ((v_ArrVal_2548 (Array Int Int))) (not (= (select (select .cse1 |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|) (select (select (store .cse1 .cse0 v_ArrVal_2548) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)))))))) (forall ((v_ArrVal_2547 (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_2547) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|))))) is different from false [2023-11-29 05:20:31,683 WARN L854 $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_ArrVal_2547 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_2547) |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_2547 (Array Int Int))) (let ((.cse1 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_2547))) (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_2548 (Array Int Int))) (not (= (select (select .cse1 |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|) (select (select (store .cse1 .cse2 v_ArrVal_2548) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)))) (not (= .cse2 |c_ULTIMATE.start_main_~#is~0#1.base|)))))))) is different from false [2023-11-29 05:20:32,605 INFO L349 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2023-11-29 05:20:32,605 INFO L378 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 813 treesize of output 532 [2023-11-29 05:20:32,631 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 05:20:32,632 INFO L378 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 99 treesize of output 97 [2023-11-29 05:20:32,642 INFO L378 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 70 treesize of output 62 [2023-11-29 05:20:32,916 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-29 05:20:32,916 INFO L378 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 22 treesize of output 18 [2023-11-29 05:20:33,038 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 8 not checked. [2023-11-29 05:20:33,038 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [345667240] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 05:20:33,038 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 05:20:33,038 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 23, 24] total 61 [2023-11-29 05:20:33,038 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [615081566] [2023-11-29 05:20:33,038 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 05:20:33,039 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 62 states [2023-11-29 05:20:33,039 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:20:33,040 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2023-11-29 05:20:33,041 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=216, Invalid=2748, Unknown=34, NotChecked=784, Total=3782 [2023-11-29 05:20:33,919 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 38 out of 136 [2023-11-29 05:20:33,921 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 527 places, 749 transitions, 20507 flow. Second operand has 62 states, 62 states have (on average 40.62903225806452) internal successors, (2519), 62 states have internal predecessors, (2519), 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) [2023-11-29 05:20:33,921 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:20:33,921 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 38 of 136 [2023-11-29 05:20:33,921 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:20:52,428 INFO L124 PetriNetUnfolderBase]: 1210/5765 cut-off events. [2023-11-29 05:20:52,428 INFO L125 PetriNetUnfolderBase]: For 271296/271301 co-relation queries the response was YES. [2023-11-29 05:20:52,479 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40708 conditions, 5765 events. 1210/5765 cut-off events. For 271296/271301 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 59731 event pairs, 254 based on Foata normal form. 27/5792 useless extension candidates. Maximal degree in co-relation 40529. Up to 1986 conditions per place. [2023-11-29 05:20:52,498 INFO L140 encePairwiseOnDemand]: 104/136 looper letters, 563 selfloop transitions, 351 changer transitions 0/936 dead transitions. [2023-11-29 05:20:52,498 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 570 places, 936 transitions, 25053 flow [2023-11-29 05:20:52,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2023-11-29 05:20:52,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2023-11-29 05:20:52,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 1925 transitions. [2023-11-29 05:20:52,502 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.32169117647058826 [2023-11-29 05:20:52,502 INFO L72 ComplementDD]: Start complementDD. Operand 44 states and 1925 transitions. [2023-11-29 05:20:52,502 INFO L73 IsDeterministic]: Start isDeterministic. Operand 44 states and 1925 transitions. [2023-11-29 05:20:52,534 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:20:52,535 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 44 states and 1925 transitions. [2023-11-29 05:20:52,538 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 45 states, 44 states have (on average 43.75) internal successors, (1925), 44 states have internal predecessors, (1925), 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) [2023-11-29 05:20:52,542 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 45 states, 45 states have (on average 136.0) internal successors, (6120), 45 states have internal predecessors, (6120), 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) [2023-11-29 05:20:52,543 INFO L81 ComplementDD]: Finished complementDD. Result has 45 states, 45 states have (on average 136.0) internal successors, (6120), 45 states have internal predecessors, (6120), 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) [2023-11-29 05:20:52,543 INFO L175 Difference]: Start difference. First operand has 527 places, 749 transitions, 20507 flow. Second operand 44 states and 1925 transitions. [2023-11-29 05:20:52,543 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 570 places, 936 transitions, 25053 flow [2023-11-29 05:20:54,414 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 541 places, 936 transitions, 24696 flow, removed 97 selfloop flow, removed 29 redundant places. [2023-11-29 05:20:54,441 INFO L231 Difference]: Finished difference. Result has 548 places, 780 transitions, 22473 flow [2023-11-29 05:20:54,442 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=136, PETRI_DIFFERENCE_MINUEND_FLOW=20166, PETRI_DIFFERENCE_MINUEND_PLACES=498, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=749, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=324, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=403, PETRI_DIFFERENCE_SUBTRAHEND_STATES=44, PETRI_FLOW=22473, PETRI_PLACES=548, PETRI_TRANSITIONS=780} [2023-11-29 05:20:54,442 INFO L281 CegarLoopForPetriNet]: 135 programPoint places, 413 predicate places. [2023-11-29 05:20:54,442 INFO L495 AbstractCegarLoop]: Abstraction has has 548 places, 780 transitions, 22473 flow [2023-11-29 05:20:54,442 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 62 states, 62 states have (on average 40.62903225806452) internal successors, (2519), 62 states have internal predecessors, (2519), 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) [2023-11-29 05:20:54,443 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:20:54,443 INFO L208 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, 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, 1, 1, 1, 1, 1, 1] [2023-11-29 05:20:54,448 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a004bb2d-d8b4-4969-87b1-fc9d64ff2ac9/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2023-11-29 05:20:54,643 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a004bb2d-d8b4-4969-87b1-fc9d64ff2ac9/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 05:20:54,643 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2023-11-29 05:20:54,644 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:20:54,644 INFO L85 PathProgramCache]: Analyzing trace with hash 1259299389, now seen corresponding path program 14 times [2023-11-29 05:20:54,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:20:54,644 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1278719498] [2023-11-29 05:20:54,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:20:54,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:20:54,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:21:00,090 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 05:21:00,090 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:21:00,090 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1278719498] [2023-11-29 05:21:00,090 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1278719498] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 05:21:00,090 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1330496141] [2023-11-29 05:21:00,090 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-29 05:21:00,090 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 05:21:00,091 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a004bb2d-d8b4-4969-87b1-fc9d64ff2ac9/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:21:00,091 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a004bb2d-d8b4-4969-87b1-fc9d64ff2ac9/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 05:21:00,092 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a004bb2d-d8b4-4969-87b1-fc9d64ff2ac9/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2023-11-29 05:21:00,308 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-29 05:21:00,308 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 05:21:00,311 INFO L262 TraceCheckSpWp]: Trace formula consists of 309 conjuncts, 69 conjunts are in the unsatisfiable core [2023-11-29 05:21:00,316 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:21:00,394 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2023-11-29 05:21:00,577 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2023-11-29 05:21:00,578 INFO L378 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 15 treesize of output 15 [2023-11-29 05:21:01,326 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 05:21:01,327 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-11-29 05:21:01,368 INFO L349 Elim1Store]: treesize reduction 40, result has 21.6 percent of original size [2023-11-29 05:21:01,369 INFO L378 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 42 treesize of output 36 [2023-11-29 05:21:02,609 INFO L349 Elim1Store]: treesize reduction 40, result has 27.3 percent of original size [2023-11-29 05:21:02,609 INFO L378 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 66 treesize of output 66 [2023-11-29 05:21:02,618 INFO L378 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 20 treesize of output 11 [2023-11-29 05:21:02,629 INFO L378 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 12 treesize of output 8 [2023-11-29 05:21:03,300 INFO L378 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 [2023-11-29 05:21:03,867 INFO L378 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 [2023-11-29 05:21:03,880 INFO L378 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 7 treesize of output 3 [2023-11-29 05:21:04,030 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 05:21:04,031 INFO L378 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 16 treesize of output 11 [2023-11-29 05:21:04,076 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 05:21:04,077 INFO L378 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 16 treesize of output 11 [2023-11-29 05:21:04,111 INFO L378 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 19 treesize of output 18 [2023-11-29 05:21:04,291 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 05:21:04,291 INFO L378 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 16 [2023-11-29 05:21:04,317 INFO L378 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 26 treesize of output 28 [2023-11-29 05:21:04,493 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 05:21:04,494 INFO L378 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 30 treesize of output 21 [2023-11-29 05:21:04,640 INFO L378 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 33 treesize of output 38 [2023-11-29 05:21:04,853 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 05:21:04,855 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 05:21:04,857 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 05:21:04,859 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 05:21:04,861 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 05:21:04,862 INFO L378 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 52 treesize of output 41 [2023-11-29 05:21:04,975 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 05:21:04,975 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 05:21:07,469 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_#t~mem8#1.offset| (* |c_ULTIMATE.start_main_~i~1#1| 4))) (.cse2 (+ c_threadThread1of1ForFork0_~p~0.offset 2)) (.cse3 (+ c_threadThread1of1ForFork0_~p~0.offset 3))) (and (forall ((v_ArrVal_2724 (Array Int Int)) (v_ArrVal_2730 Int) (v_ArrVal_2727 (Array Int Int))) (= (select (select (let ((.cse0 (store (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2727) c_threadThread1of1ForFork0_~p~0.base (store (select (store (store |c_#race| c_threadThread1of1ForFork0_~p~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2724) c_threadThread1of1ForFork0_~p~0.base) .cse2 0)) |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2727) 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_2730))) c_threadThread1of1ForFork0_~p~0.base) .cse3) 0)) (forall ((v_ArrVal_2724 (Array Int Int)) (v_ArrVal_2730 Int) (v_ArrVal_2727 (Array Int Int))) (= (select (select (let ((.cse4 (store (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2727) c_threadThread1of1ForFork0_~p~0.base (store (select (store (store |c_#race| c_threadThread1of1ForFork0_~p~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2724) c_threadThread1of1ForFork0_~p~0.base) .cse2 0)) |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2727) 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_2730))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 1)) 0)) (forall ((v_ArrVal_2724 (Array Int Int)) (v_ArrVal_2730 Int) (v_ArrVal_2727 (Array Int Int))) (= 0 (select (select (let ((.cse5 (store (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2727) c_threadThread1of1ForFork0_~p~0.base (store (select (store (store |c_#race| c_threadThread1of1ForFork0_~p~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2724) c_threadThread1of1ForFork0_~p~0.base) .cse2 0)) |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2727) c_threadThread1of1ForFork0_~p~0.base) .cse3 0)))) (store .cse5 |c_ULTIMATE.start_main_#t~mem8#1.base| (store (select .cse5 |c_ULTIMATE.start_main_#t~mem8#1.base|) .cse1 v_ArrVal_2730))) c_threadThread1of1ForFork0_~p~0.base) .cse2))) (forall ((v_ArrVal_2724 (Array Int Int)) (v_ArrVal_2730 Int) (v_ArrVal_2727 (Array Int Int))) (= (select (select (let ((.cse6 (store (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2727) c_threadThread1of1ForFork0_~p~0.base (store (select (store (store |c_#race| c_threadThread1of1ForFork0_~p~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2724) c_threadThread1of1ForFork0_~p~0.base) .cse2 0)) |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2727) 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_2730))) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) 0)))) is different from false [2023-11-29 05:21:07,524 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse5 (+ c_threadThread1of1ForFork0_~p~0.offset 1))) (let ((.cse1 (+ |c_ULTIMATE.start_main_#t~mem8#1.offset| (* |c_ULTIMATE.start_main_~i~1#1| 4))) (.cse2 (store |c_#race| c_threadThread1of1ForFork0_~p~0.base (store (select |c_#race| c_threadThread1of1ForFork0_~p~0.base) .cse5 0))) (.cse4 (+ c_threadThread1of1ForFork0_~p~0.offset 3)) (.cse3 (+ c_threadThread1of1ForFork0_~p~0.offset 2))) (and (forall ((v_ArrVal_2724 (Array Int Int)) (v_ArrVal_2730 Int) (v_ArrVal_2727 (Array Int Int))) (= (select (select (let ((.cse0 (store (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2727) c_threadThread1of1ForFork0_~p~0.base (store (select (store (store |c_#race| c_threadThread1of1ForFork0_~p~0.base (store (select (store .cse2 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2724) c_threadThread1of1ForFork0_~p~0.base) .cse3 0)) |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2727) c_threadThread1of1ForFork0_~p~0.base) .cse4 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_2730))) c_threadThread1of1ForFork0_~p~0.base) .cse5) 0)) (forall ((v_ArrVal_2724 (Array Int Int)) (v_ArrVal_2730 Int) (v_ArrVal_2727 (Array Int Int))) (= (select (select (let ((.cse6 (store (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2727) c_threadThread1of1ForFork0_~p~0.base (store (select (store (store |c_#race| c_threadThread1of1ForFork0_~p~0.base (store (select (store .cse2 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2724) c_threadThread1of1ForFork0_~p~0.base) .cse3 0)) |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2727) c_threadThread1of1ForFork0_~p~0.base) .cse4 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_2730))) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) 0)) (forall ((v_ArrVal_2724 (Array Int Int)) (v_ArrVal_2730 Int) (v_ArrVal_2727 (Array Int Int))) (= (select (select (let ((.cse7 (store (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2727) c_threadThread1of1ForFork0_~p~0.base (store (select (store (store |c_#race| c_threadThread1of1ForFork0_~p~0.base (store (select (store .cse2 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2724) c_threadThread1of1ForFork0_~p~0.base) .cse3 0)) |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2727) c_threadThread1of1ForFork0_~p~0.base) .cse4 0)))) (store .cse7 |c_ULTIMATE.start_main_#t~mem8#1.base| (store (select .cse7 |c_ULTIMATE.start_main_#t~mem8#1.base|) .cse1 v_ArrVal_2730))) c_threadThread1of1ForFork0_~p~0.base) .cse4) 0)) (forall ((v_ArrVal_2724 (Array Int Int)) (v_ArrVal_2730 Int) (v_ArrVal_2727 (Array Int Int))) (= (select (select (let ((.cse8 (store (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2727) c_threadThread1of1ForFork0_~p~0.base (store (select (store (store |c_#race| c_threadThread1of1ForFork0_~p~0.base (store (select (store .cse2 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2724) c_threadThread1of1ForFork0_~p~0.base) .cse3 0)) |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2727) c_threadThread1of1ForFork0_~p~0.base) .cse4 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_2730))) c_threadThread1of1ForFork0_~p~0.base) .cse3) 0))))) is different from false [2023-11-29 05:21:07,584 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_#t~mem8#1.offset| (* |c_ULTIMATE.start_main_~i~1#1| 4))) (.cse2 (+ c_threadThread1of1ForFork0_~p~0.offset 1)) (.cse4 (+ c_threadThread1of1ForFork0_~p~0.offset 3)) (.cse3 (+ c_threadThread1of1ForFork0_~p~0.offset 2))) (and (forall ((v_ArrVal_2724 (Array Int Int)) (v_ArrVal_2722 (Array Int Int)) (v_ArrVal_2730 Int) (v_ArrVal_2727 (Array Int Int))) (= (select (select (let ((.cse0 (store (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2727) c_threadThread1of1ForFork0_~p~0.base (store (select (store (store |c_#race| c_threadThread1of1ForFork0_~p~0.base (store (select (store (store |c_#race| c_threadThread1of1ForFork0_~p~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2722) c_threadThread1of1ForFork0_~p~0.base) .cse2 0)) |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2724) c_threadThread1of1ForFork0_~p~0.base) .cse3 0)) |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2727) c_threadThread1of1ForFork0_~p~0.base) .cse4 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_2730))) c_threadThread1of1ForFork0_~p~0.base) .cse2) 0)) (forall ((v_ArrVal_2724 (Array Int Int)) (v_ArrVal_2722 (Array Int Int)) (v_ArrVal_2730 Int) (v_ArrVal_2727 (Array Int Int))) (= (select (select (let ((.cse5 (store (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2727) c_threadThread1of1ForFork0_~p~0.base (store (select (store (store |c_#race| c_threadThread1of1ForFork0_~p~0.base (store (select (store (store |c_#race| c_threadThread1of1ForFork0_~p~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2722) c_threadThread1of1ForFork0_~p~0.base) .cse2 0)) |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2724) c_threadThread1of1ForFork0_~p~0.base) .cse3 0)) |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2727) c_threadThread1of1ForFork0_~p~0.base) .cse4 0)))) (store .cse5 |c_ULTIMATE.start_main_#t~mem8#1.base| (store (select .cse5 |c_ULTIMATE.start_main_#t~mem8#1.base|) .cse1 v_ArrVal_2730))) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) 0)) (forall ((v_ArrVal_2724 (Array Int Int)) (v_ArrVal_2722 (Array Int Int)) (v_ArrVal_2730 Int) (v_ArrVal_2727 (Array Int Int))) (= (select (select (let ((.cse6 (store (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2727) c_threadThread1of1ForFork0_~p~0.base (store (select (store (store |c_#race| c_threadThread1of1ForFork0_~p~0.base (store (select (store (store |c_#race| c_threadThread1of1ForFork0_~p~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2722) c_threadThread1of1ForFork0_~p~0.base) .cse2 0)) |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2724) c_threadThread1of1ForFork0_~p~0.base) .cse3 0)) |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2727) c_threadThread1of1ForFork0_~p~0.base) .cse4 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_2730))) c_threadThread1of1ForFork0_~p~0.base) .cse4) 0)) (forall ((v_ArrVal_2724 (Array Int Int)) (v_ArrVal_2722 (Array Int Int)) (v_ArrVal_2730 Int) (v_ArrVal_2727 (Array Int Int))) (= (select (select (let ((.cse7 (store (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2727) c_threadThread1of1ForFork0_~p~0.base (store (select (store (store |c_#race| c_threadThread1of1ForFork0_~p~0.base (store (select (store (store |c_#race| c_threadThread1of1ForFork0_~p~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2722) c_threadThread1of1ForFork0_~p~0.base) .cse2 0)) |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2724) c_threadThread1of1ForFork0_~p~0.base) .cse3 0)) |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2727) c_threadThread1of1ForFork0_~p~0.base) .cse4 0)))) (store .cse7 |c_ULTIMATE.start_main_#t~mem8#1.base| (store (select .cse7 |c_ULTIMATE.start_main_#t~mem8#1.base|) .cse1 v_ArrVal_2730))) c_threadThread1of1ForFork0_~p~0.base) .cse3) 0)))) is different from false [2023-11-29 05:21:07,720 WARN L854 $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 2)) (.cse6 (+ c_threadThread1of1ForFork0_~p~0.offset 3)) (.cse4 (+ c_threadThread1of1ForFork0_~p~0.offset 1))) (and (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_54| Int)) (or (< |v_ULTIMATE.start_main_#t~mem8#1.offset_54| .cse0) (forall ((v_ArrVal_2724 (Array Int Int)) (v_ArrVal_2722 (Array Int Int)) (v_ArrVal_2730 Int) (v_ArrVal_2727 (Array Int Int))) (= (select (select (let ((.cse1 (store (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2727) c_threadThread1of1ForFork0_~p~0.base (store (select (store (store |c_#race| c_threadThread1of1ForFork0_~p~0.base (store (select (store (store |c_#race| c_threadThread1of1ForFork0_~p~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2722) c_threadThread1of1ForFork0_~p~0.base) .cse4 0)) |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2724) c_threadThread1of1ForFork0_~p~0.base) .cse5 0)) |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2727) c_threadThread1of1ForFork0_~p~0.base) .cse6 0)))) (store .cse1 .cse2 (store (select .cse1 .cse2) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_54| .cse3) v_ArrVal_2730))) c_threadThread1of1ForFork0_~p~0.base) .cse6) 0)))) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_54| Int)) (or (< |v_ULTIMATE.start_main_#t~mem8#1.offset_54| .cse0) (forall ((v_ArrVal_2724 (Array Int Int)) (v_ArrVal_2722 (Array Int Int)) (v_ArrVal_2730 Int) (v_ArrVal_2727 (Array Int Int))) (= (select (select (let ((.cse7 (store (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2727) c_threadThread1of1ForFork0_~p~0.base (store (select (store (store |c_#race| c_threadThread1of1ForFork0_~p~0.base (store (select (store (store |c_#race| c_threadThread1of1ForFork0_~p~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2722) c_threadThread1of1ForFork0_~p~0.base) .cse4 0)) |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2724) c_threadThread1of1ForFork0_~p~0.base) .cse5 0)) |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2727) c_threadThread1of1ForFork0_~p~0.base) .cse6 0)))) (store .cse7 .cse2 (store (select .cse7 .cse2) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_54| .cse3) v_ArrVal_2730))) c_threadThread1of1ForFork0_~p~0.base) .cse5) 0)))) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_54| Int)) (or (< |v_ULTIMATE.start_main_#t~mem8#1.offset_54| .cse0) (forall ((v_ArrVal_2724 (Array Int Int)) (v_ArrVal_2722 (Array Int Int)) (v_ArrVal_2730 Int) (v_ArrVal_2727 (Array Int Int))) (= (select (select (let ((.cse8 (store (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2727) c_threadThread1of1ForFork0_~p~0.base (store (select (store (store |c_#race| c_threadThread1of1ForFork0_~p~0.base (store (select (store (store |c_#race| c_threadThread1of1ForFork0_~p~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2722) c_threadThread1of1ForFork0_~p~0.base) .cse4 0)) |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2724) c_threadThread1of1ForFork0_~p~0.base) .cse5 0)) |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2727) c_threadThread1of1ForFork0_~p~0.base) .cse6 0)))) (store .cse8 .cse2 (store (select .cse8 .cse2) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_54| .cse3) v_ArrVal_2730))) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) 0)))) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_54| Int)) (or (< |v_ULTIMATE.start_main_#t~mem8#1.offset_54| .cse0) (forall ((v_ArrVal_2724 (Array Int Int)) (v_ArrVal_2722 (Array Int Int)) (v_ArrVal_2730 Int) (v_ArrVal_2727 (Array Int Int))) (= (select (select (let ((.cse9 (store (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2727) c_threadThread1of1ForFork0_~p~0.base (store (select (store (store |c_#race| c_threadThread1of1ForFork0_~p~0.base (store (select (store (store |c_#race| c_threadThread1of1ForFork0_~p~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2722) c_threadThread1of1ForFork0_~p~0.base) .cse4 0)) |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2724) c_threadThread1of1ForFork0_~p~0.base) .cse5 0)) |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2727) c_threadThread1of1ForFork0_~p~0.base) .cse6 0)))) (store .cse9 .cse2 (store (select .cse9 .cse2) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_54| .cse3) v_ArrVal_2730))) c_threadThread1of1ForFork0_~p~0.base) .cse4) 0)))))) is different from false [2023-11-29 05:21:11,961 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_#t~post7#1| 1)) (.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 (+ c_threadThread1of1ForFork0_~p~0.offset 1)) (.cse6 (+ c_threadThread1of1ForFork0_~p~0.offset 3)) (.cse5 (+ c_threadThread1of1ForFork0_~p~0.offset 2))) (and (forall ((|v_ULTIMATE.start_main_~i~1#1_47| Int)) (or (< |v_ULTIMATE.start_main_~i~1#1_47| .cse0) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_54| Int)) (or (< |v_ULTIMATE.start_main_#t~mem8#1.offset_54| .cse1) (forall ((v_ArrVal_2724 (Array Int Int)) (v_ArrVal_2722 (Array Int Int)) (v_ArrVal_2730 Int) (v_ArrVal_2727 (Array Int Int))) (= (select (select (let ((.cse2 (store (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2727) c_threadThread1of1ForFork0_~p~0.base (store (select (store (store |c_#race| c_threadThread1of1ForFork0_~p~0.base (store (select (store (store |c_#race| c_threadThread1of1ForFork0_~p~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2722) c_threadThread1of1ForFork0_~p~0.base) .cse4 0)) |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2724) c_threadThread1of1ForFork0_~p~0.base) .cse5 0)) |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2727) c_threadThread1of1ForFork0_~p~0.base) .cse6 0)))) (store .cse2 .cse3 (store (select .cse2 .cse3) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_54| (* |v_ULTIMATE.start_main_~i~1#1_47| 4)) v_ArrVal_2730))) c_threadThread1of1ForFork0_~p~0.base) .cse4) 0)))))) (forall ((|v_ULTIMATE.start_main_~i~1#1_47| Int)) (or (< |v_ULTIMATE.start_main_~i~1#1_47| .cse0) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_54| Int)) (or (< |v_ULTIMATE.start_main_#t~mem8#1.offset_54| .cse1) (forall ((v_ArrVal_2724 (Array Int Int)) (v_ArrVal_2722 (Array Int Int)) (v_ArrVal_2730 Int) (v_ArrVal_2727 (Array Int Int))) (= (select (select (let ((.cse7 (store (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2727) c_threadThread1of1ForFork0_~p~0.base (store (select (store (store |c_#race| c_threadThread1of1ForFork0_~p~0.base (store (select (store (store |c_#race| c_threadThread1of1ForFork0_~p~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2722) c_threadThread1of1ForFork0_~p~0.base) .cse4 0)) |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2724) c_threadThread1of1ForFork0_~p~0.base) .cse5 0)) |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2727) c_threadThread1of1ForFork0_~p~0.base) .cse6 0)))) (store .cse7 .cse3 (store (select .cse7 .cse3) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_54| (* |v_ULTIMATE.start_main_~i~1#1_47| 4)) v_ArrVal_2730))) c_threadThread1of1ForFork0_~p~0.base) .cse6) 0)))))) (forall ((|v_ULTIMATE.start_main_~i~1#1_47| Int)) (or (< |v_ULTIMATE.start_main_~i~1#1_47| .cse0) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_54| Int)) (or (< |v_ULTIMATE.start_main_#t~mem8#1.offset_54| .cse1) (forall ((v_ArrVal_2724 (Array Int Int)) (v_ArrVal_2722 (Array Int Int)) (v_ArrVal_2730 Int) (v_ArrVal_2727 (Array Int Int))) (= (select (select (let ((.cse8 (store (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2727) c_threadThread1of1ForFork0_~p~0.base (store (select (store (store |c_#race| c_threadThread1of1ForFork0_~p~0.base (store (select (store (store |c_#race| c_threadThread1of1ForFork0_~p~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2722) c_threadThread1of1ForFork0_~p~0.base) .cse4 0)) |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2724) c_threadThread1of1ForFork0_~p~0.base) .cse5 0)) |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2727) c_threadThread1of1ForFork0_~p~0.base) .cse6 0)))) (store .cse8 .cse3 (store (select .cse8 .cse3) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_54| (* |v_ULTIMATE.start_main_~i~1#1_47| 4)) v_ArrVal_2730))) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) 0)))))) (forall ((|v_ULTIMATE.start_main_~i~1#1_47| Int)) (or (< |v_ULTIMATE.start_main_~i~1#1_47| .cse0) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_54| Int)) (or (< |v_ULTIMATE.start_main_#t~mem8#1.offset_54| .cse1) (forall ((v_ArrVal_2724 (Array Int Int)) (v_ArrVal_2722 (Array Int Int)) (v_ArrVal_2730 Int) (v_ArrVal_2727 (Array Int Int))) (= (select (select (let ((.cse9 (store (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2727) c_threadThread1of1ForFork0_~p~0.base (store (select (store (store |c_#race| c_threadThread1of1ForFork0_~p~0.base (store (select (store (store |c_#race| c_threadThread1of1ForFork0_~p~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2722) c_threadThread1of1ForFork0_~p~0.base) .cse4 0)) |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2724) c_threadThread1of1ForFork0_~p~0.base) .cse5 0)) |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2727) c_threadThread1of1ForFork0_~p~0.base) .cse6 0)))) (store .cse9 .cse3 (store (select .cse9 .cse3) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_54| (* |v_ULTIMATE.start_main_~i~1#1_47| 4)) v_ArrVal_2730))) c_threadThread1of1ForFork0_~p~0.base) .cse5) 0)))))))) is different from false [2023-11-29 05:21:12,135 WARN L854 $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|)) (.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 2)) (.cse6 (+ c_threadThread1of1ForFork0_~p~0.offset 3)) (.cse4 (+ c_threadThread1of1ForFork0_~p~0.offset 1)) (.cse1 (+ |c_ULTIMATE.start_main_~i~1#1| 1))) (and (forall ((v_ArrVal_2724 (Array Int Int)) (|v_ULTIMATE.start_main_~i~1#1_47| Int) (|v_ULTIMATE.start_main_#t~mem8#1.offset_54| Int) (v_ArrVal_2722 (Array Int Int)) (v_ArrVal_2730 Int) (v_ArrVal_2727 (Array Int Int))) (or (< |v_ULTIMATE.start_main_#t~mem8#1.offset_54| .cse0) (< |v_ULTIMATE.start_main_~i~1#1_47| .cse1) (= (select (select (let ((.cse2 (store (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2727) c_threadThread1of1ForFork0_~p~0.base (store (select (store (store |c_#race| c_threadThread1of1ForFork0_~p~0.base (store (select (store (store |c_#race| c_threadThread1of1ForFork0_~p~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2722) c_threadThread1of1ForFork0_~p~0.base) .cse4 0)) |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2724) c_threadThread1of1ForFork0_~p~0.base) .cse5 0)) |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2727) c_threadThread1of1ForFork0_~p~0.base) .cse6 0)))) (store .cse2 .cse3 (store (select .cse2 .cse3) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_54| (* |v_ULTIMATE.start_main_~i~1#1_47| 4)) v_ArrVal_2730))) c_threadThread1of1ForFork0_~p~0.base) .cse5) 0))) (forall ((v_ArrVal_2724 (Array Int Int)) (|v_ULTIMATE.start_main_~i~1#1_47| Int) (|v_ULTIMATE.start_main_#t~mem8#1.offset_54| Int) (v_ArrVal_2722 (Array Int Int)) (v_ArrVal_2730 Int) (v_ArrVal_2727 (Array Int Int))) (or (< |v_ULTIMATE.start_main_#t~mem8#1.offset_54| .cse0) (= (select (select (let ((.cse7 (store (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2727) c_threadThread1of1ForFork0_~p~0.base (store (select (store (store |c_#race| c_threadThread1of1ForFork0_~p~0.base (store (select (store (store |c_#race| c_threadThread1of1ForFork0_~p~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2722) c_threadThread1of1ForFork0_~p~0.base) .cse4 0)) |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2724) c_threadThread1of1ForFork0_~p~0.base) .cse5 0)) |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2727) c_threadThread1of1ForFork0_~p~0.base) .cse6 0)))) (store .cse7 .cse3 (store (select .cse7 .cse3) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_54| (* |v_ULTIMATE.start_main_~i~1#1_47| 4)) v_ArrVal_2730))) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) 0) (< |v_ULTIMATE.start_main_~i~1#1_47| .cse1))) (forall ((v_ArrVal_2724 (Array Int Int)) (|v_ULTIMATE.start_main_~i~1#1_47| Int) (|v_ULTIMATE.start_main_#t~mem8#1.offset_54| Int) (v_ArrVal_2722 (Array Int Int)) (v_ArrVal_2730 Int) (v_ArrVal_2727 (Array Int Int))) (or (= (select (select (let ((.cse8 (store (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2727) c_threadThread1of1ForFork0_~p~0.base (store (select (store (store |c_#race| c_threadThread1of1ForFork0_~p~0.base (store (select (store (store |c_#race| c_threadThread1of1ForFork0_~p~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2722) c_threadThread1of1ForFork0_~p~0.base) .cse4 0)) |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2724) c_threadThread1of1ForFork0_~p~0.base) .cse5 0)) |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2727) c_threadThread1of1ForFork0_~p~0.base) .cse6 0)))) (store .cse8 .cse3 (store (select .cse8 .cse3) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_54| (* |v_ULTIMATE.start_main_~i~1#1_47| 4)) v_ArrVal_2730))) c_threadThread1of1ForFork0_~p~0.base) .cse6) 0) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_54| .cse0) (< |v_ULTIMATE.start_main_~i~1#1_47| .cse1))) (forall ((v_ArrVal_2724 (Array Int Int)) (|v_ULTIMATE.start_main_~i~1#1_47| Int) (|v_ULTIMATE.start_main_#t~mem8#1.offset_54| Int) (v_ArrVal_2722 (Array Int Int)) (v_ArrVal_2730 Int) (v_ArrVal_2727 (Array Int Int))) (or (< |v_ULTIMATE.start_main_#t~mem8#1.offset_54| .cse0) (= (select (select (let ((.cse9 (store (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2727) c_threadThread1of1ForFork0_~p~0.base (store (select (store (store |c_#race| c_threadThread1of1ForFork0_~p~0.base (store (select (store (store |c_#race| c_threadThread1of1ForFork0_~p~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2722) c_threadThread1of1ForFork0_~p~0.base) .cse4 0)) |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2724) c_threadThread1of1ForFork0_~p~0.base) .cse5 0)) |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2727) c_threadThread1of1ForFork0_~p~0.base) .cse6 0)))) (store .cse9 .cse3 (store (select .cse9 .cse3) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_54| (* |v_ULTIMATE.start_main_~i~1#1_47| 4)) v_ArrVal_2730))) c_threadThread1of1ForFork0_~p~0.base) .cse4) 0) (< |v_ULTIMATE.start_main_~i~1#1_47| .cse1))))) is different from false [2023-11-29 05:21:12,237 INFO L349 Elim1Store]: treesize reduction 21, result has 66.1 percent of original size [2023-11-29 05:21:12,238 INFO L378 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 4 case distinctions, treesize of input 634 treesize of output 608 [2023-11-29 05:21:12,291 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 05:21:12,291 INFO L378 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 342 treesize of output 338 [2023-11-29 05:21:12,318 INFO L378 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 206 treesize of output 198 [2023-11-29 05:21:12,509 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 05:21:12,546 INFO L349 Elim1Store]: treesize reduction 48, result has 22.6 percent of original size [2023-11-29 05:21:12,546 INFO L378 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 4 case distinctions, treesize of input 240 treesize of output 231 [2023-11-29 05:21:12,554 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 05:21:12,558 INFO L378 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 107 treesize of output 101 [2023-11-29 05:21:12,610 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 05:21:12,651 INFO L349 Elim1Store]: treesize reduction 44, result has 29.0 percent of original size [2023-11-29 05:21:12,651 INFO L378 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 4 case distinctions, treesize of input 240 treesize of output 235 [2023-11-29 05:21:12,657 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 05:21:12,677 INFO L349 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2023-11-29 05:21:12,677 INFO L378 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 111 treesize of output 105 [2023-11-29 05:21:12,725 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 05:21:12,737 INFO L349 Elim1Store]: treesize reduction 61, result has 1.6 percent of original size [2023-11-29 05:21:12,737 INFO L378 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 4 case distinctions, treesize of input 240 treesize of output 1 [2023-11-29 05:21:14,173 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2716 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_2716) |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_2715 (Array Int Int)) (v_ArrVal_2716 (Array Int Int))) (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_2716))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (or (forall ((v_ArrVal_2718 (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 .cse1 v_ArrVal_2718) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)))) (forall ((v_ArrVal_2717 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_2715))) (< (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_2717) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|) 1))))))))) is different from false [2023-11-29 05:21:14,304 WARN L854 $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_56| Int)) (or (< .cse0 |v_ULTIMATE.start_main_#t~mem8#1.base_56|) (forall ((v_ArrVal_2715 (Array Int Int)) (v_ArrVal_2716 (Array Int Int))) (let ((.cse1 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_#t~mem8#1.base_56| v_ArrVal_2716))) (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_2718 (Array Int Int))) (not (= (select (select .cse1 |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|) (select (select (store .cse1 .cse2 v_ArrVal_2718) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)))) (forall ((v_ArrVal_2717 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_main_#t~mem8#1.base_56| v_ArrVal_2715))) (< (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_2717) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|) 1)))))))))) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.base_56| Int)) (or (< .cse0 |v_ULTIMATE.start_main_#t~mem8#1.base_56|) (forall ((v_ArrVal_2716 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_#t~mem8#1.base_56| v_ArrVal_2716) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|) |c_ULTIMATE.start_main_~#is~0#1.base|))))))) is different from false [2023-11-29 05:21:14,418 INFO L378 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 222 treesize of output 202 [2023-11-29 05:21:14,428 INFO L378 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 50 treesize of output 46 [2023-11-29 05:21:14,435 INFO L378 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 23 treesize of output 21 [2023-11-29 05:21:14,970 INFO L378 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 20 treesize of output 18 [2023-11-29 05:21:15,275 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 05:21:15,275 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 124 treesize of output 122 [2023-11-29 05:21:15,298 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 05:21:15,299 INFO L378 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 57 treesize of output 57 [2023-11-29 05:21:15,890 INFO L378 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 10 treesize of output 8 [2023-11-29 05:21:16,023 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 8 not checked. [2023-11-29 05:21:16,023 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1330496141] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 05:21:16,023 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 05:21:16,024 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 24, 26] total 72 [2023-11-29 05:21:16,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2120422447] [2023-11-29 05:21:16,024 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 05:21:16,024 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 73 states [2023-11-29 05:21:16,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:21:16,025 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2023-11-29 05:21:16,026 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=274, Invalid=3839, Unknown=79, NotChecked=1064, Total=5256 [2023-11-29 05:21:16,671 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 38 out of 136 [2023-11-29 05:21:16,673 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 548 places, 780 transitions, 22473 flow. Second operand has 73 states, 73 states have (on average 40.45205479452055) internal successors, (2953), 73 states have internal predecessors, (2953), 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) [2023-11-29 05:21:16,674 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:21:16,674 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 38 of 136 [2023-11-29 05:21:16,674 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:21:37,805 INFO L124 PetriNetUnfolderBase]: 1381/5979 cut-off events. [2023-11-29 05:21:37,805 INFO L125 PetriNetUnfolderBase]: For 361510/361510 co-relation queries the response was YES. [2023-11-29 05:21:37,861 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47129 conditions, 5979 events. 1381/5979 cut-off events. For 361510/361510 co-relation queries the response was YES. Maximal size of possible extension queue 198. Compared 60939 event pairs, 201 based on Foata normal form. 25/6004 useless extension candidates. Maximal degree in co-relation 46943. Up to 1241 conditions per place. [2023-11-29 05:21:37,889 INFO L140 encePairwiseOnDemand]: 105/136 looper letters, 602 selfloop transitions, 417 changer transitions 0/1041 dead transitions. [2023-11-29 05:21:37,889 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 586 places, 1041 transitions, 28902 flow [2023-11-29 05:21:37,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2023-11-29 05:21:37,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2023-11-29 05:21:37,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 1754 transitions. [2023-11-29 05:21:37,892 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3306938159879336 [2023-11-29 05:21:37,892 INFO L72 ComplementDD]: Start complementDD. Operand 39 states and 1754 transitions. [2023-11-29 05:21:37,892 INFO L73 IsDeterministic]: Start isDeterministic. Operand 39 states and 1754 transitions. [2023-11-29 05:21:37,893 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:21:37,893 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 39 states and 1754 transitions. [2023-11-29 05:21:37,895 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 40 states, 39 states have (on average 44.97435897435897) internal successors, (1754), 39 states have internal predecessors, (1754), 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) [2023-11-29 05:21:37,898 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 40 states, 40 states have (on average 136.0) internal successors, (5440), 40 states have internal predecessors, (5440), 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) [2023-11-29 05:21:37,898 INFO L81 ComplementDD]: Finished complementDD. Result has 40 states, 40 states have (on average 136.0) internal successors, (5440), 40 states have internal predecessors, (5440), 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) [2023-11-29 05:21:37,898 INFO L175 Difference]: Start difference. First operand has 548 places, 780 transitions, 22473 flow. Second operand 39 states and 1754 transitions. [2023-11-29 05:21:37,899 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 586 places, 1041 transitions, 28902 flow [2023-11-29 05:21:40,381 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 552 places, 1041 transitions, 28512 flow, removed 76 selfloop flow, removed 34 redundant places. [2023-11-29 05:21:40,408 INFO L231 Difference]: Finished difference. Result has 563 places, 845 transitions, 25794 flow [2023-11-29 05:21:40,408 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=136, PETRI_DIFFERENCE_MINUEND_FLOW=22083, PETRI_DIFFERENCE_MINUEND_PLACES=514, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=780, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=356, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=393, PETRI_DIFFERENCE_SUBTRAHEND_STATES=39, PETRI_FLOW=25794, PETRI_PLACES=563, PETRI_TRANSITIONS=845} [2023-11-29 05:21:40,409 INFO L281 CegarLoopForPetriNet]: 135 programPoint places, 428 predicate places. [2023-11-29 05:21:40,409 INFO L495 AbstractCegarLoop]: Abstraction has has 563 places, 845 transitions, 25794 flow [2023-11-29 05:21:40,409 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 73 states, 73 states have (on average 40.45205479452055) internal successors, (2953), 73 states have internal predecessors, (2953), 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) [2023-11-29 05:21:40,409 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:21:40,410 INFO L208 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, 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, 1, 1, 1, 1, 1, 1] [2023-11-29 05:21:40,415 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a004bb2d-d8b4-4969-87b1-fc9d64ff2ac9/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2023-11-29 05:21:40,610 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a004bb2d-d8b4-4969-87b1-fc9d64ff2ac9/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2023-11-29 05:21:40,610 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2023-11-29 05:21:40,610 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:21:40,610 INFO L85 PathProgramCache]: Analyzing trace with hash -693449499, now seen corresponding path program 15 times [2023-11-29 05:21:40,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:21:40,611 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [21097206] [2023-11-29 05:21:40,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:21:40,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:21:40,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:21:42,974 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 05:21:42,974 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:21:42,974 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [21097206] [2023-11-29 05:21:42,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [21097206] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 05:21:42,975 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [766069246] [2023-11-29 05:21:42,975 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-29 05:21:42,975 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 05:21:42,975 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a004bb2d-d8b4-4969-87b1-fc9d64ff2ac9/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:21:42,976 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a004bb2d-d8b4-4969-87b1-fc9d64ff2ac9/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 05:21:42,977 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a004bb2d-d8b4-4969-87b1-fc9d64ff2ac9/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2023-11-29 05:21:43,203 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-11-29 05:21:43,203 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 05:21:43,206 INFO L262 TraceCheckSpWp]: Trace formula consists of 309 conjuncts, 63 conjunts are in the unsatisfiable core [2023-11-29 05:21:43,210 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:21:44,388 INFO L349 Elim1Store]: treesize reduction 40, result has 21.6 percent of original size [2023-11-29 05:21:44,388 INFO L378 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 52 treesize of output 44 [2023-11-29 05:21:44,397 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 05:21:44,398 INFO L378 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 16 treesize of output 11 [2023-11-29 05:21:45,496 INFO L349 Elim1Store]: treesize reduction 44, result has 20.0 percent of original size [2023-11-29 05:21:45,496 INFO L378 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 76 treesize of output 70 [2023-11-29 05:21:45,512 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 05:21:45,512 INFO L378 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 24 treesize of output 11 [2023-11-29 05:21:46,523 INFO L378 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 [2023-11-29 05:21:46,964 INFO L378 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 19 treesize of output 18 [2023-11-29 05:21:47,270 INFO L378 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 26 treesize of output 28 [2023-11-29 05:21:47,930 INFO L378 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 33 treesize of output 38 [2023-11-29 05:21:48,235 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 05:21:48,235 INFO L378 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 [2023-11-29 05:21:48,262 INFO L378 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 7 treesize of output 3 [2023-11-29 05:21:48,436 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 05:21:48,437 INFO L378 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 37 treesize of output 26 [2023-11-29 05:21:48,500 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 05:21:48,501 INFO L378 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 37 treesize of output 26 [2023-11-29 05:21:48,549 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 05:21:48,550 INFO L378 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 37 treesize of output 26 [2023-11-29 05:21:48,599 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 05:21:48,600 INFO L378 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 37 treesize of output 26 [2023-11-29 05:21:48,870 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 05:21:48,872 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 05:21:48,875 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 05:21:48,877 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 05:21:48,880 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 05:21:48,880 INFO L378 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 52 treesize of output 41 [2023-11-29 05:21:49,016 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 05:21:49,017 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 05:21:49,403 WARN L854 $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_2896 (Array Int Int)) (v_ArrVal_2897 Int)) (= (select (select (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2896))) (store .cse0 |c_ULTIMATE.start_main_#t~mem8#1.base| (store (select .cse0 |c_ULTIMATE.start_main_#t~mem8#1.base|) .cse1 v_ArrVal_2897))) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) 0)) (forall ((v_ArrVal_2896 (Array Int Int)) (v_ArrVal_2897 Int)) (= (select (select (let ((.cse2 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2896))) (store .cse2 |c_ULTIMATE.start_main_#t~mem8#1.base| (store (select .cse2 |c_ULTIMATE.start_main_#t~mem8#1.base|) .cse1 v_ArrVal_2897))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 2)) 0)) (forall ((v_ArrVal_2896 (Array Int Int)) (v_ArrVal_2897 Int)) (= (select (select (let ((.cse3 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2896))) (store .cse3 |c_ULTIMATE.start_main_#t~mem8#1.base| (store (select .cse3 |c_ULTIMATE.start_main_#t~mem8#1.base|) .cse1 v_ArrVal_2897))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 3)) 0)) (forall ((v_ArrVal_2896 (Array Int Int)) (v_ArrVal_2897 Int)) (= (select (select (let ((.cse4 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2896))) (store .cse4 |c_ULTIMATE.start_main_#t~mem8#1.base| (store (select .cse4 |c_ULTIMATE.start_main_#t~mem8#1.base|) .cse1 v_ArrVal_2897))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 1)) 0)))) is different from false [2023-11-29 05:21:53,523 WARN L854 $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_57| Int)) (or (< |v_ULTIMATE.start_main_#t~mem8#1.offset_57| .cse0) (forall ((v_ArrVal_2896 (Array Int Int)) (v_ArrVal_2897 Int)) (= (select (select (let ((.cse1 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2896))) (store .cse1 .cse2 (store (select .cse1 .cse2) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_57| .cse3) v_ArrVal_2897))) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) 0)))) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_57| Int)) (or (forall ((v_ArrVal_2896 (Array Int Int)) (v_ArrVal_2897 Int)) (= (select (select (let ((.cse4 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2896))) (store .cse4 .cse2 (store (select .cse4 .cse2) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_57| .cse3) v_ArrVal_2897))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 3)) 0)) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_57| .cse0))) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_57| Int)) (or (forall ((v_ArrVal_2896 (Array Int Int)) (v_ArrVal_2897 Int)) (= (select (select (let ((.cse5 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2896))) (store .cse5 .cse2 (store (select .cse5 .cse2) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_57| .cse3) v_ArrVal_2897))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 1)) 0)) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_57| .cse0))) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_57| Int)) (or (< |v_ULTIMATE.start_main_#t~mem8#1.offset_57| .cse0) (forall ((v_ArrVal_2896 (Array Int Int)) (v_ArrVal_2897 Int)) (= (select (select (let ((.cse6 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2896))) (store .cse6 .cse2 (store (select .cse6 .cse2) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_57| .cse3) v_ArrVal_2897))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 2)) 0)))))) is different from false [2023-11-29 05:22:15,049 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse6 (+ c_threadThread1of1ForFork0_~p~0.offset 3))) (let ((.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 (select |c_#race| c_threadThread1of1ForFork0_~p~0.base) .cse6 0))) (.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_#t~post7#1| 1))) (and (forall ((|v_ULTIMATE.start_main_~i~1#1_49| Int)) (or (< |v_ULTIMATE.start_main_~i~1#1_49| .cse0) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_57| Int)) (or (< |v_ULTIMATE.start_main_#t~mem8#1.offset_57| .cse1) (forall ((v_ArrVal_2896 (Array Int Int)) (v_ArrVal_2897 Int)) (= (select (select (let ((.cse2 (store .cse4 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2896))) (store .cse2 .cse3 (store (select .cse2 .cse3) (+ (* |v_ULTIMATE.start_main_~i~1#1_49| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_57|) v_ArrVal_2897))) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) 0)))))) (forall ((|v_ULTIMATE.start_main_~i~1#1_49| Int)) (or (< |v_ULTIMATE.start_main_~i~1#1_49| .cse0) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_57| Int)) (or (< |v_ULTIMATE.start_main_#t~mem8#1.offset_57| .cse1) (forall ((v_ArrVal_2896 (Array Int Int)) (v_ArrVal_2897 Int)) (= (select (select (let ((.cse5 (store .cse4 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2896))) (store .cse5 .cse3 (store (select .cse5 .cse3) (+ (* |v_ULTIMATE.start_main_~i~1#1_49| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_57|) v_ArrVal_2897))) c_threadThread1of1ForFork0_~p~0.base) .cse6) 0)))))) (forall ((|v_ULTIMATE.start_main_~i~1#1_49| Int)) (or (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_57| Int)) (or (< |v_ULTIMATE.start_main_#t~mem8#1.offset_57| .cse1) (forall ((v_ArrVal_2896 (Array Int Int)) (v_ArrVal_2897 Int)) (= (select (select (let ((.cse7 (store .cse4 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2896))) (store .cse7 .cse3 (store (select .cse7 .cse3) (+ (* |v_ULTIMATE.start_main_~i~1#1_49| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_57|) v_ArrVal_2897))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 2)) 0)))) (< |v_ULTIMATE.start_main_~i~1#1_49| .cse0))) (forall ((|v_ULTIMATE.start_main_~i~1#1_49| Int)) (or (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_57| Int)) (or (forall ((v_ArrVal_2896 (Array Int Int)) (v_ArrVal_2897 Int)) (= (select (select (let ((.cse8 (store .cse4 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2896))) (store .cse8 .cse3 (store (select .cse8 .cse3) (+ (* |v_ULTIMATE.start_main_~i~1#1_49| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_57|) v_ArrVal_2897))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 1)) 0)) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_57| .cse1))) (< |v_ULTIMATE.start_main_~i~1#1_49| .cse0)))))) is different from false [2023-11-29 05:22:19,140 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse4 (+ c_threadThread1of1ForFork0_~p~0.offset 2)) (.cse9 (+ c_threadThread1of1ForFork0_~p~0.offset 3))) (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 (store |c_#race| c_threadThread1of1ForFork0_~p~0.base (store (store (select |c_#race| c_threadThread1of1ForFork0_~p~0.base) .cse4 0) .cse9 0))) (.cse5 (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_#t~post7#1| 1))) (and (forall ((|v_ULTIMATE.start_main_~i~1#1_49| Int)) (or (< |v_ULTIMATE.start_main_~i~1#1_49| .cse0) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_57| Int)) (or (forall ((v_ArrVal_2896 (Array Int Int)) (v_ArrVal_2897 Int)) (= (select (select (let ((.cse1 (store .cse3 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2896))) (store .cse1 .cse2 (store (select .cse1 .cse2) (+ (* |v_ULTIMATE.start_main_~i~1#1_49| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_57|) v_ArrVal_2897))) c_threadThread1of1ForFork0_~p~0.base) .cse4) 0)) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_57| .cse5))))) (forall ((|v_ULTIMATE.start_main_~i~1#1_49| Int)) (or (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_57| Int)) (or (< |v_ULTIMATE.start_main_#t~mem8#1.offset_57| .cse5) (forall ((v_ArrVal_2896 (Array Int Int)) (v_ArrVal_2897 Int)) (= 0 (select (select (let ((.cse6 (store .cse3 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2896))) (store .cse6 .cse2 (store (select .cse6 .cse2) (+ (* |v_ULTIMATE.start_main_~i~1#1_49| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_57|) v_ArrVal_2897))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 1)))))) (< |v_ULTIMATE.start_main_~i~1#1_49| .cse0))) (forall ((|v_ULTIMATE.start_main_~i~1#1_49| Int)) (or (< |v_ULTIMATE.start_main_~i~1#1_49| .cse0) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_57| Int)) (or (forall ((v_ArrVal_2896 (Array Int Int)) (v_ArrVal_2897 Int)) (= 0 (select (select (let ((.cse7 (store .cse3 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2896))) (store .cse7 .cse2 (store (select .cse7 .cse2) (+ (* |v_ULTIMATE.start_main_~i~1#1_49| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_57|) v_ArrVal_2897))) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset))) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_57| .cse5))))) (forall ((|v_ULTIMATE.start_main_~i~1#1_49| Int)) (or (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_57| Int)) (or (forall ((v_ArrVal_2896 (Array Int Int)) (v_ArrVal_2897 Int)) (= (select (select (let ((.cse8 (store .cse3 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2896))) (store .cse8 .cse2 (store (select .cse8 .cse2) (+ (* |v_ULTIMATE.start_main_~i~1#1_49| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_57|) v_ArrVal_2897))) c_threadThread1of1ForFork0_~p~0.base) .cse9) 0)) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_57| .cse5))) (< |v_ULTIMATE.start_main_~i~1#1_49| .cse0)))))) is different from false [2023-11-29 05:22:23,217 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse8 (+ c_threadThread1of1ForFork0_~p~0.offset 1)) (.cse3 (+ c_threadThread1of1ForFork0_~p~0.offset 2)) (.cse10 (+ c_threadThread1of1ForFork0_~p~0.offset 3))) (let ((.cse5 (+ |c_ULTIMATE.start_main_#t~post7#1| 1)) (.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)) (.cse2 (store |c_#race| c_threadThread1of1ForFork0_~p~0.base (store (store (store (select |c_#race| c_threadThread1of1ForFork0_~p~0.base) .cse8 0) .cse3 0) .cse10 0))) (.cse4 (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_49| Int)) (or (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_57| Int)) (or (forall ((v_ArrVal_2896 (Array Int Int)) (v_ArrVal_2897 Int)) (= (select (select (let ((.cse0 (store .cse2 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2896))) (store .cse0 .cse1 (store (select .cse0 .cse1) (+ (* |v_ULTIMATE.start_main_~i~1#1_49| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_57|) v_ArrVal_2897))) c_threadThread1of1ForFork0_~p~0.base) .cse3) 0)) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_57| .cse4))) (< |v_ULTIMATE.start_main_~i~1#1_49| .cse5))) (forall ((|v_ULTIMATE.start_main_~i~1#1_49| Int)) (or (< |v_ULTIMATE.start_main_~i~1#1_49| .cse5) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_57| Int)) (or (< |v_ULTIMATE.start_main_#t~mem8#1.offset_57| .cse4) (forall ((v_ArrVal_2896 (Array Int Int)) (v_ArrVal_2897 Int)) (= (select (select (let ((.cse6 (store .cse2 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2896))) (store .cse6 .cse1 (store (select .cse6 .cse1) (+ (* |v_ULTIMATE.start_main_~i~1#1_49| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_57|) v_ArrVal_2897))) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) 0)))))) (forall ((|v_ULTIMATE.start_main_~i~1#1_49| Int)) (or (< |v_ULTIMATE.start_main_~i~1#1_49| .cse5) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_57| Int)) (or (< |v_ULTIMATE.start_main_#t~mem8#1.offset_57| .cse4) (forall ((v_ArrVal_2896 (Array Int Int)) (v_ArrVal_2897 Int)) (= (select (select (let ((.cse7 (store .cse2 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2896))) (store .cse7 .cse1 (store (select .cse7 .cse1) (+ (* |v_ULTIMATE.start_main_~i~1#1_49| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_57|) v_ArrVal_2897))) c_threadThread1of1ForFork0_~p~0.base) .cse8) 0)))))) (forall ((|v_ULTIMATE.start_main_~i~1#1_49| Int)) (or (< |v_ULTIMATE.start_main_~i~1#1_49| .cse5) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_57| Int)) (or (forall ((v_ArrVal_2896 (Array Int Int)) (v_ArrVal_2897 Int)) (= (select (select (let ((.cse9 (store .cse2 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2896))) (store .cse9 .cse1 (store (select .cse9 .cse1) (+ (* |v_ULTIMATE.start_main_~i~1#1_49| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_57|) v_ArrVal_2897))) c_threadThread1of1ForFork0_~p~0.base) .cse10) 0)) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_57| .cse4)))))))) is different from false [2023-11-29 05:22:23,377 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse10 (+ c_threadThread1of1ForFork0_~p~0.offset 1)) (.cse4 (+ c_threadThread1of1ForFork0_~p~0.offset 2)) (.cse8 (+ c_threadThread1of1ForFork0_~p~0.offset 3))) (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 (store |c_#race| c_threadThread1of1ForFork0_~p~0.base (store (store (store (select |c_#race| c_threadThread1of1ForFork0_~p~0.base) .cse10 0) .cse4 0) .cse8 0))) (.cse0 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)) (.cse5 (+ |c_ULTIMATE.start_main_~i~1#1| 1))) (and (forall ((|v_ULTIMATE.start_main_~i~1#1_49| Int) (v_ArrVal_2896 (Array Int Int)) (v_ArrVal_2897 Int) (|v_ULTIMATE.start_main_#t~mem8#1.offset_57| Int)) (or (< |v_ULTIMATE.start_main_#t~mem8#1.offset_57| .cse0) (= (select (select (let ((.cse1 (store .cse3 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2896))) (store .cse1 .cse2 (store (select .cse1 .cse2) (+ (* |v_ULTIMATE.start_main_~i~1#1_49| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_57|) v_ArrVal_2897))) c_threadThread1of1ForFork0_~p~0.base) .cse4) 0) (< |v_ULTIMATE.start_main_~i~1#1_49| .cse5))) (forall ((|v_ULTIMATE.start_main_~i~1#1_49| Int) (v_ArrVal_2896 (Array Int Int)) (v_ArrVal_2897 Int) (|v_ULTIMATE.start_main_#t~mem8#1.offset_57| Int)) (or (= (select (select (let ((.cse6 (store .cse3 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2896))) (store .cse6 .cse2 (store (select .cse6 .cse2) (+ (* |v_ULTIMATE.start_main_~i~1#1_49| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_57|) v_ArrVal_2897))) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) 0) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_57| .cse0) (< |v_ULTIMATE.start_main_~i~1#1_49| .cse5))) (forall ((|v_ULTIMATE.start_main_~i~1#1_49| Int) (v_ArrVal_2896 (Array Int Int)) (v_ArrVal_2897 Int) (|v_ULTIMATE.start_main_#t~mem8#1.offset_57| Int)) (or (= (select (select (let ((.cse7 (store .cse3 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2896))) (store .cse7 .cse2 (store (select .cse7 .cse2) (+ (* |v_ULTIMATE.start_main_~i~1#1_49| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_57|) v_ArrVal_2897))) c_threadThread1of1ForFork0_~p~0.base) .cse8) 0) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_57| .cse0) (< |v_ULTIMATE.start_main_~i~1#1_49| .cse5))) (forall ((|v_ULTIMATE.start_main_~i~1#1_49| Int) (v_ArrVal_2896 (Array Int Int)) (v_ArrVal_2897 Int) (|v_ULTIMATE.start_main_#t~mem8#1.offset_57| Int)) (or (= (select (select (let ((.cse9 (store .cse3 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_2896))) (store .cse9 .cse2 (store (select .cse9 .cse2) (+ (* |v_ULTIMATE.start_main_~i~1#1_49| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_57|) v_ArrVal_2897))) c_threadThread1of1ForFork0_~p~0.base) .cse10) 0) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_57| .cse0) (< |v_ULTIMATE.start_main_~i~1#1_49| .cse5)))))) is different from false [2023-11-29 05:22:23,411 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 05:22:23,411 INFO L378 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 79 treesize of output 72 [2023-11-29 05:22:23,425 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 05:22:23,425 INFO L378 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 232 treesize of output 220 [2023-11-29 05:22:23,437 INFO L378 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 177 treesize of output 169 [2023-11-29 05:22:23,453 INFO L378 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 31 treesize of output 17 [2023-11-29 05:22:23,480 INFO L378 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 140 treesize of output 122 [2023-11-29 05:22:23,599 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 05:22:23,599 INFO L378 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 [2023-11-29 05:22:23,604 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 05:22:23,620 INFO L349 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2023-11-29 05:22:23,620 INFO L378 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 [2023-11-29 05:22:23,632 INFO L378 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 48 treesize of output 44 [2023-11-29 05:22:23,641 INFO L378 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 80 treesize of output 62 [2023-11-29 05:22:23,683 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 05:22:23,684 INFO L378 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 [2023-11-29 05:22:23,689 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 05:22:23,704 INFO L349 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2023-11-29 05:22:23,704 INFO L378 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 [2023-11-29 05:22:23,716 INFO L378 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 48 treesize of output 44 [2023-11-29 05:22:23,726 INFO L378 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 80 treesize of output 62 [2023-11-29 05:22:23,758 INFO L349 Elim1Store]: treesize reduction 38, result has 2.6 percent of original size [2023-11-29 05:22:23,758 INFO L378 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 [2023-11-29 05:22:29,147 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2884 (Array Int Int)) (v_ArrVal_2883 (Array Int Int))) (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_2884))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (or (forall ((v_ArrVal_2886 (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 .cse1 v_ArrVal_2886) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)))) (forall ((v_ArrVal_2885 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_2883))) (< (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_2885) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|) 1)))))))) (forall ((v_ArrVal_2884 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_2884) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|) |c_ULTIMATE.start_main_~#is~0#1.base|)))) is different from false [2023-11-29 05:22:29,279 WARN L854 $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_59| Int)) (or (< .cse0 |v_ULTIMATE.start_main_#t~mem8#1.base_59|) (forall ((v_ArrVal_2884 (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_59| v_ArrVal_2884) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)))))) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.base_59| Int)) (or (< .cse0 |v_ULTIMATE.start_main_#t~mem8#1.base_59|) (forall ((v_ArrVal_2884 (Array Int Int)) (v_ArrVal_2883 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_#t~mem8#1.base_59| v_ArrVal_2884))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (or (forall ((v_ArrVal_2885 (Array Int Int))) (let ((.cse1 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_main_#t~mem8#1.base_59| v_ArrVal_2883))) (< (select (select .cse1 |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|) (+ (select (select (store .cse1 .cse2 v_ArrVal_2885) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|) 1)))) (forall ((v_ArrVal_2886 (Array Int Int))) (not (= (select (select (store .cse3 .cse2 v_ArrVal_2886) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|) (select (select .cse3 |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)))))))))))) is different from false [2023-11-29 05:22:29,402 INFO L378 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 222 treesize of output 202 [2023-11-29 05:22:29,436 INFO L378 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 25 treesize of output 23 [2023-11-29 05:22:29,443 INFO L378 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 48 treesize of output 44 [2023-11-29 05:22:29,916 INFO L378 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 20 treesize of output 18 [2023-11-29 05:22:30,181 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 05:22:30,181 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 96 treesize of output 98 [2023-11-29 05:22:30,205 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 05:22:30,206 INFO L378 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 33 treesize of output 35 [2023-11-29 05:22:30,528 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 8 not checked. [2023-11-29 05:22:30,528 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [766069246] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 05:22:30,528 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 05:22:30,528 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 24, 24] total 70 [2023-11-29 05:22:30,528 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1190182492] [2023-11-29 05:22:30,528 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 05:22:30,529 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 71 states [2023-11-29 05:22:30,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:22:30,530 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2023-11-29 05:22:30,530 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=3611, Unknown=51, NotChecked=1032, Total=4970 [2023-11-29 05:22:30,597 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 38 out of 136 [2023-11-29 05:22:30,599 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 563 places, 845 transitions, 25794 flow. Second operand has 71 states, 71 states have (on average 40.50704225352113) internal successors, (2876), 71 states have internal predecessors, (2876), 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) [2023-11-29 05:22:30,599 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:22:30,599 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 38 of 136 [2023-11-29 05:22:30,599 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:22:56,916 INFO L124 PetriNetUnfolderBase]: 1431/6604 cut-off events. [2023-11-29 05:22:56,916 INFO L125 PetriNetUnfolderBase]: For 433200/433204 co-relation queries the response was YES. [2023-11-29 05:22:56,979 INFO L83 FinitePrefix]: Finished finitePrefix Result has 52491 conditions, 6604 events. 1431/6604 cut-off events. For 433200/433204 co-relation queries the response was YES. Maximal size of possible extension queue 201. Compared 69843 event pairs, 273 based on Foata normal form. 21/6625 useless extension candidates. Maximal degree in co-relation 52294. Up to 2317 conditions per place. [2023-11-29 05:22:57,006 INFO L140 encePairwiseOnDemand]: 104/136 looper letters, 628 selfloop transitions, 411 changer transitions 0/1061 dead transitions. [2023-11-29 05:22:57,006 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 606 places, 1061 transitions, 32075 flow [2023-11-29 05:22:57,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2023-11-29 05:22:57,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2023-11-29 05:22:57,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 1930 transitions. [2023-11-29 05:22:57,009 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3225267379679144 [2023-11-29 05:22:57,009 INFO L72 ComplementDD]: Start complementDD. Operand 44 states and 1930 transitions. [2023-11-29 05:22:57,009 INFO L73 IsDeterministic]: Start isDeterministic. Operand 44 states and 1930 transitions. [2023-11-29 05:22:57,009 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:22:57,009 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 44 states and 1930 transitions. [2023-11-29 05:22:57,012 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 45 states, 44 states have (on average 43.86363636363637) internal successors, (1930), 44 states have internal predecessors, (1930), 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) [2023-11-29 05:22:57,015 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 45 states, 45 states have (on average 136.0) internal successors, (6120), 45 states have internal predecessors, (6120), 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) [2023-11-29 05:22:57,016 INFO L81 ComplementDD]: Finished complementDD. Result has 45 states, 45 states have (on average 136.0) internal successors, (6120), 45 states have internal predecessors, (6120), 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) [2023-11-29 05:22:57,016 INFO L175 Difference]: Start difference. First operand has 563 places, 845 transitions, 25794 flow. Second operand 44 states and 1930 transitions. [2023-11-29 05:22:57,016 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 606 places, 1061 transitions, 32075 flow [2023-11-29 05:23:00,204 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 584 places, 1061 transitions, 31693 flow, removed 153 selfloop flow, removed 22 redundant places. [2023-11-29 05:23:00,237 INFO L231 Difference]: Finished difference. Result has 593 places, 883 transitions, 28506 flow [2023-11-29 05:23:00,238 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=136, PETRI_DIFFERENCE_MINUEND_FLOW=25510, PETRI_DIFFERENCE_MINUEND_PLACES=541, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=845, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=376, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=442, PETRI_DIFFERENCE_SUBTRAHEND_STATES=44, PETRI_FLOW=28506, PETRI_PLACES=593, PETRI_TRANSITIONS=883} [2023-11-29 05:23:00,239 INFO L281 CegarLoopForPetriNet]: 135 programPoint places, 458 predicate places. [2023-11-29 05:23:00,239 INFO L495 AbstractCegarLoop]: Abstraction has has 593 places, 883 transitions, 28506 flow [2023-11-29 05:23:00,239 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 71 states, 71 states have (on average 40.50704225352113) internal successors, (2876), 71 states have internal predecessors, (2876), 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) [2023-11-29 05:23:00,239 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:23:00,239 INFO L208 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, 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, 1, 1, 1, 1, 1, 1] [2023-11-29 05:23:00,245 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a004bb2d-d8b4-4969-87b1-fc9d64ff2ac9/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2023-11-29 05:23:00,440 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a004bb2d-d8b4-4969-87b1-fc9d64ff2ac9/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2023-11-29 05:23:00,440 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2023-11-29 05:23:00,440 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:23:00,440 INFO L85 PathProgramCache]: Analyzing trace with hash 217412009, now seen corresponding path program 16 times [2023-11-29 05:23:00,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:23:00,441 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [413595075] [2023-11-29 05:23:00,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:23:00,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:23:00,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:23:04,041 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 05:23:04,041 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:23:04,041 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [413595075] [2023-11-29 05:23:04,042 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [413595075] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 05:23:04,042 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [667118482] [2023-11-29 05:23:04,042 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-11-29 05:23:04,042 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 05:23:04,042 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a004bb2d-d8b4-4969-87b1-fc9d64ff2ac9/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:23:04,043 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a004bb2d-d8b4-4969-87b1-fc9d64ff2ac9/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 05:23:04,044 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a004bb2d-d8b4-4969-87b1-fc9d64ff2ac9/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2023-11-29 05:23:04,734 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-11-29 05:23:04,734 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 05:23:04,737 INFO L262 TraceCheckSpWp]: Trace formula consists of 309 conjuncts, 70 conjunts are in the unsatisfiable core [2023-11-29 05:23:04,741 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:23:06,269 INFO L349 Elim1Store]: treesize reduction 40, result has 21.6 percent of original size [2023-11-29 05:23:06,270 INFO L378 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 52 treesize of output 44 [2023-11-29 05:23:06,284 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 05:23:06,286 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 05:23:06,289 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-29 05:23:06,289 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 21 [2023-11-29 05:23:07,691 INFO L349 Elim1Store]: treesize reduction 40, result has 21.6 percent of original size [2023-11-29 05:23:07,692 INFO L378 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 59 treesize of output 49 [2023-11-29 05:23:07,704 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 05:23:07,706 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 05:23:07,709 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-29 05:23:07,709 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 21 [2023-11-29 05:23:08,806 INFO L378 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 [2023-11-29 05:23:09,298 INFO L378 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 19 treesize of output 18 [2023-11-29 05:23:09,949 INFO L378 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 26 treesize of output 28 [2023-11-29 05:23:10,265 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 05:23:10,265 INFO L378 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 35 [2023-11-29 05:23:10,289 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-29 05:23:10,289 INFO L378 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 15 treesize of output 7 [2023-11-29 05:23:10,479 INFO L378 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 33 treesize of output 38 [2023-11-29 05:23:10,689 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 05:23:10,689 INFO L378 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 37 treesize of output 26 [2023-11-29 05:23:10,751 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 05:23:10,752 INFO L378 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 37 treesize of output 26 [2023-11-29 05:23:10,792 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 05:23:10,793 INFO L378 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 37 treesize of output 26 [2023-11-29 05:23:10,850 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 05:23:10,851 INFO L378 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 37 treesize of output 26 [2023-11-29 05:23:11,134 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 05:23:11,136 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 05:23:11,139 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 05:23:11,141 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 05:23:11,144 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 05:23:11,144 INFO L378 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 52 treesize of output 41 [2023-11-29 05:23:11,297 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 05:23:11,297 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 05:23:11,745 WARN L854 $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_3064 (Array Int Int)) (v_ArrVal_3065 Int)) (= (select (select (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_3064))) (store .cse0 |c_ULTIMATE.start_main_#t~mem8#1.base| (store (select .cse0 |c_ULTIMATE.start_main_#t~mem8#1.base|) .cse1 v_ArrVal_3065))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 3)) 0)) (forall ((v_ArrVal_3064 (Array Int Int)) (v_ArrVal_3065 Int)) (= (select (select (let ((.cse2 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_3064))) (store .cse2 |c_ULTIMATE.start_main_#t~mem8#1.base| (store (select .cse2 |c_ULTIMATE.start_main_#t~mem8#1.base|) .cse1 v_ArrVal_3065))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 2)) 0)) (forall ((v_ArrVal_3064 (Array Int Int)) (v_ArrVal_3065 Int)) (= (select (select (let ((.cse3 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_3064))) (store .cse3 |c_ULTIMATE.start_main_#t~mem8#1.base| (store (select .cse3 |c_ULTIMATE.start_main_#t~mem8#1.base|) .cse1 v_ArrVal_3065))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 1)) 0)) (forall ((v_ArrVal_3064 (Array Int Int)) (v_ArrVal_3065 Int)) (= (select (select (let ((.cse4 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_3064))) (store .cse4 |c_ULTIMATE.start_main_#t~mem8#1.base| (store (select .cse4 |c_ULTIMATE.start_main_#t~mem8#1.base|) .cse1 v_ArrVal_3065))) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) 0)))) is different from false [2023-11-29 05:23:52,587 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse9 (+ c_threadThread1of1ForFork0_~p~0.offset 2)) (.cse6 (+ c_threadThread1of1ForFork0_~p~0.offset 3))) (let ((.cse0 (+ |c_ULTIMATE.start_main_#t~post7#1| 1)) (.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) .cse9 0) .cse6 0)))) (and (forall ((|v_ULTIMATE.start_main_~i~1#1_51| Int)) (or (< |v_ULTIMATE.start_main_~i~1#1_51| .cse0) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_60| Int)) (or (< |v_ULTIMATE.start_main_#t~mem8#1.offset_60| .cse1) (forall ((v_ArrVal_3064 (Array Int Int)) (v_ArrVal_3065 Int)) (= (select (select (let ((.cse2 (store .cse4 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_3064))) (store .cse2 .cse3 (store (select .cse2 .cse3) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_60| (* |v_ULTIMATE.start_main_~i~1#1_51| 4)) v_ArrVal_3065))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 1)) 0)))))) (forall ((|v_ULTIMATE.start_main_~i~1#1_51| Int)) (or (< |v_ULTIMATE.start_main_~i~1#1_51| .cse0) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_60| Int)) (or (< |v_ULTIMATE.start_main_#t~mem8#1.offset_60| .cse1) (forall ((v_ArrVal_3064 (Array Int Int)) (v_ArrVal_3065 Int)) (= (select (select (let ((.cse5 (store .cse4 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_3064))) (store .cse5 .cse3 (store (select .cse5 .cse3) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_60| (* |v_ULTIMATE.start_main_~i~1#1_51| 4)) v_ArrVal_3065))) c_threadThread1of1ForFork0_~p~0.base) .cse6) 0)))))) (forall ((|v_ULTIMATE.start_main_~i~1#1_51| Int)) (or (< |v_ULTIMATE.start_main_~i~1#1_51| .cse0) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_60| Int)) (or (< |v_ULTIMATE.start_main_#t~mem8#1.offset_60| .cse1) (forall ((v_ArrVal_3064 (Array Int Int)) (v_ArrVal_3065 Int)) (= (select (select (let ((.cse7 (store .cse4 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_3064))) (store .cse7 .cse3 (store (select .cse7 .cse3) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_60| (* |v_ULTIMATE.start_main_~i~1#1_51| 4)) v_ArrVal_3065))) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) 0)))))) (forall ((|v_ULTIMATE.start_main_~i~1#1_51| Int)) (or (< |v_ULTIMATE.start_main_~i~1#1_51| .cse0) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_60| Int)) (or (< |v_ULTIMATE.start_main_#t~mem8#1.offset_60| .cse1) (forall ((v_ArrVal_3064 (Array Int Int)) (v_ArrVal_3065 Int)) (= (select (select (let ((.cse8 (store .cse4 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_3064))) (store .cse8 .cse3 (store (select .cse8 .cse3) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_60| (* |v_ULTIMATE.start_main_~i~1#1_51| 4)) v_ArrVal_3065))) c_threadThread1of1ForFork0_~p~0.base) .cse9) 0))))))))) is different from false