./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-data-race.prp --file ../../sv-benchmarks/c/pthread-race-challenges/per-thread-array-ptr.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 826ab2ba Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_084b0b24-d5a0-462b-a255-016ec85dabac/bin/ugemcutter-verify-yV71Fz5F0F/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_084b0b24-d5a0-462b-a255-016ec85dabac/bin/ugemcutter-verify-yV71Fz5F0F/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_084b0b24-d5a0-462b-a255-016ec85dabac/bin/ugemcutter-verify-yV71Fz5F0F/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_084b0b24-d5a0-462b-a255-016ec85dabac/bin/ugemcutter-verify-yV71Fz5F0F/config/GemCutterReach.xml -i ../../sv-benchmarks/c/pthread-race-challenges/per-thread-array-ptr.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_084b0b24-d5a0-462b-a255-016ec85dabac/bin/ugemcutter-verify-yV71Fz5F0F/config/svcomp-DataRace-32bit-GemCutter_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_084b0b24-d5a0-462b-a255-016ec85dabac/bin/ugemcutter-verify-yV71Fz5F0F --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 GemCutter --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 2804a3d9c88e5ebdd5cd91ad2518af39bf332bf1cb9f17b40166d15deda7338f --- Real Ultimate output --- This is Ultimate 0.3.0-dev-826ab2b [2024-11-13 12:27:00,691 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-13 12:27:00,787 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_084b0b24-d5a0-462b-a255-016ec85dabac/bin/ugemcutter-verify-yV71Fz5F0F/config/svcomp-DataRace-32bit-GemCutter_Default.epf [2024-11-13 12:27:00,794 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-13 12:27:00,794 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-13 12:27:00,822 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-13 12:27:00,826 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-13 12:27:00,826 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-13 12:27:00,826 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-13 12:27:00,826 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-13 12:27:00,827 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-13 12:27:00,827 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-13 12:27:00,827 INFO L153 SettingsManager]: * Use SBE=true [2024-11-13 12:27:00,827 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-13 12:27:00,827 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-13 12:27:00,827 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-13 12:27:00,827 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-13 12:27:00,827 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-13 12:27:00,827 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-13 12:27:00,828 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-13 12:27:00,828 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-13 12:27:00,828 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-13 12:27:00,828 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2024-11-13 12:27:00,828 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-13 12:27:00,828 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-13 12:27:00,828 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-13 12:27:00,828 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-13 12:27:00,828 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-13 12:27:00,829 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-13 12:27:00,829 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-13 12:27:00,829 INFO L153 SettingsManager]: * To the following directory=./dump/ [2024-11-13 12:27:00,829 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-13 12:27:00,831 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-13 12:27:00,831 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-13 12:27:00,831 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-13 12:27:00,831 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-13 12:27:00,831 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-13 12:27:00,832 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-13 12:27:00,832 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-13 12:27:00,832 INFO L153 SettingsManager]: * Abstraction used for commutativity in POR=VARIABLES_GLOBAL [2024-11-13 12:27:00,832 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2024-11-13 12:27:00,832 INFO L153 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2024-11-13 12:27:00,832 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2024-11-13 12:27:00,832 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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_084b0b24-d5a0-462b-a255-016ec85dabac/bin/ugemcutter-verify-yV71Fz5F0F 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 -> GemCutter 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 -> 2804a3d9c88e5ebdd5cd91ad2518af39bf332bf1cb9f17b40166d15deda7338f [2024-11-13 12:27:01,140 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-13 12:27:01,148 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-13 12:27:01,151 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-13 12:27:01,152 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-13 12:27:01,152 INFO L274 PluginConnector]: CDTParser initialized [2024-11-13 12:27:01,153 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_084b0b24-d5a0-462b-a255-016ec85dabac/bin/ugemcutter-verify-yV71Fz5F0F/../../sv-benchmarks/c/pthread-race-challenges/per-thread-array-ptr.i Unable to find full path for "g++" [2024-11-13 12:27:02,969 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-13 12:27:03,401 INFO L384 CDTParser]: Found 1 translation units. [2024-11-13 12:27:03,402 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_084b0b24-d5a0-462b-a255-016ec85dabac/sv-benchmarks/c/pthread-race-challenges/per-thread-array-ptr.i [2024-11-13 12:27:03,430 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_084b0b24-d5a0-462b-a255-016ec85dabac/bin/ugemcutter-verify-yV71Fz5F0F/data/b13d517fa/64c7e39c9d294c8297e01d18a8306cfa/FLAG483a95bec [2024-11-13 12:27:03,455 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_084b0b24-d5a0-462b-a255-016ec85dabac/bin/ugemcutter-verify-yV71Fz5F0F/data/b13d517fa/64c7e39c9d294c8297e01d18a8306cfa [2024-11-13 12:27:03,458 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-13 12:27:03,461 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-13 12:27:03,462 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-13 12:27:03,462 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-13 12:27:03,467 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-13 12:27:03,468 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 12:27:03" (1/1) ... [2024-11-13 12:27:03,469 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@51480ff5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:27:03, skipping insertion in model container [2024-11-13 12:27:03,470 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 12:27:03" (1/1) ... [2024-11-13 12:27:03,525 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-13 12:27:04,016 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 12:27:04,025 INFO L200 MainTranslator]: Completed pre-run [2024-11-13 12:27:04,080 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 12:27:04,145 INFO L204 MainTranslator]: Completed translation [2024-11-13 12:27:04,146 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:27:04 WrapperNode [2024-11-13 12:27:04,147 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-13 12:27:04,148 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-13 12:27:04,149 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-13 12:27:04,149 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-13 12:27:04,156 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:27:04" (1/1) ... [2024-11-13 12:27:04,180 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:27:04" (1/1) ... [2024-11-13 12:27:04,209 INFO L138 Inliner]: procedures = 261, calls = 11, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 59 [2024-11-13 12:27:04,209 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-13 12:27:04,210 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-13 12:27:04,210 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-13 12:27:04,210 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-13 12:27:04,217 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:27:04" (1/1) ... [2024-11-13 12:27:04,218 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:27:04" (1/1) ... [2024-11-13 12:27:04,220 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:27:04" (1/1) ... [2024-11-13 12:27:04,221 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:27:04" (1/1) ... [2024-11-13 12:27:04,235 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:27:04" (1/1) ... [2024-11-13 12:27:04,247 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:27:04" (1/1) ... [2024-11-13 12:27:04,248 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:27:04" (1/1) ... [2024-11-13 12:27:04,249 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:27:04" (1/1) ... [2024-11-13 12:27:04,251 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-13 12:27:04,252 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-13 12:27:04,252 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-13 12:27:04,256 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-13 12:27:04,257 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:27:04" (1/1) ... [2024-11-13 12:27:04,267 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-13 12:27:04,281 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_084b0b24-d5a0-462b-a255-016ec85dabac/bin/ugemcutter-verify-yV71Fz5F0F/z3 [2024-11-13 12:27:04,295 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_084b0b24-d5a0-462b-a255-016ec85dabac/bin/ugemcutter-verify-yV71Fz5F0F/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-11-13 12:27:04,300 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_084b0b24-d5a0-462b-a255-016ec85dabac/bin/ugemcutter-verify-yV71Fz5F0F/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-11-13 12:27:04,328 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-13 12:27:04,328 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-13 12:27:04,328 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-13 12:27:04,329 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-13 12:27:04,329 INFO L130 BoogieDeclarations]: Found specification of procedure thread [2024-11-13 12:27:04,329 INFO L138 BoogieDeclarations]: Found implementation of procedure thread [2024-11-13 12:27:04,329 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-13 12:27:04,329 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-13 12:27:04,330 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-13 12:27:04,505 INFO L238 CfgBuilder]: Building ICFG [2024-11-13 12:27:04,507 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-13 12:27:04,714 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-13 12:27:04,714 INFO L287 CfgBuilder]: Performing block encoding [2024-11-13 12:27:04,724 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-13 12:27:04,724 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-13 12:27:04,725 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 12:27:04 BoogieIcfgContainer [2024-11-13 12:27:04,725 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-13 12:27:04,727 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-13 12:27:04,728 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-13 12:27:04,733 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-13 12:27:04,733 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.11 12:27:03" (1/3) ... [2024-11-13 12:27:04,734 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19b95161 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 12:27:04, skipping insertion in model container [2024-11-13 12:27:04,734 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:27:04" (2/3) ... [2024-11-13 12:27:04,734 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19b95161 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 12:27:04, skipping insertion in model container [2024-11-13 12:27:04,734 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 12:27:04" (3/3) ... [2024-11-13 12:27:04,735 INFO L112 eAbstractionObserver]: Analyzing ICFG per-thread-array-ptr.i [2024-11-13 12:27:04,751 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-13 12:27:04,753 INFO L154 ceAbstractionStarter]: Applying trace abstraction to ICFG per-thread-array-ptr.i that has 2 procedures, 80 locations, 1 initial locations, 2 loop locations, and 3 error locations. [2024-11-13 12:27:04,753 INFO L492 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-13 12:27:04,833 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2024-11-13 12:27:04,907 INFO L107 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-13 12:27:04,908 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-11-13 12:27:04,908 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_084b0b24-d5a0-462b-a255-016ec85dabac/bin/ugemcutter-verify-yV71Fz5F0F/z3 [2024-11-13 12:27:04,910 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_084b0b24-d5a0-462b-a255-016ec85dabac/bin/ugemcutter-verify-yV71Fz5F0F/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-11-13 12:27:04,911 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_084b0b24-d5a0-462b-a255-016ec85dabac/bin/ugemcutter-verify-yV71Fz5F0F/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2024-11-13 12:27:04,946 INFO L157 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-13 12:27:04,959 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == threadThread1of1ForFork0 ======== [2024-11-13 12:27:04,970 INFO L333 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, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, 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;@3a2209b3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-13 12:27:04,970 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-13 12:27:05,492 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [threadErr0ASSERT_VIOLATIONDATA_RACE] === [2024-11-13 12:27:05,497 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:27:05,497 INFO L85 PathProgramCache]: Analyzing trace with hash -2079097775, now seen corresponding path program 1 times [2024-11-13 12:27:05,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:27:05,506 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [156521888] [2024-11-13 12:27:05,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:27:05,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:27:05,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:27:05,732 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 12:27:05,733 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 12:27:05,737 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [156521888] [2024-11-13 12:27:05,738 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [156521888] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 12:27:05,738 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 12:27:05,738 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-13 12:27:05,740 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1569792384] [2024-11-13 12:27:05,740 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 12:27:05,748 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-13 12:27:05,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 12:27:05,771 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-13 12:27:05,772 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-13 12:27:05,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 12:27:05,776 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-13 12:27:05,782 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 12:27:05,782 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-13 12:27:05,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 12:27:05,813 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-13 12:27:05,813 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [threadErr0ASSERT_VIOLATIONDATA_RACE] === [2024-11-13 12:27:05,814 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:27:05,814 INFO L85 PathProgramCache]: Analyzing trace with hash 2077839156, now seen corresponding path program 1 times [2024-11-13 12:27:05,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:27:05,814 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1990306578] [2024-11-13 12:27:05,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:27:05,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:27:05,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:27:06,727 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 12:27:06,729 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 12:27:06,729 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1990306578] [2024-11-13 12:27:06,729 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1990306578] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 12:27:06,730 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 12:27:06,731 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-13 12:27:06,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [34588731] [2024-11-13 12:27:06,732 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 12:27:06,733 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-13 12:27:06,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 12:27:06,734 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-13 12:27:06,734 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-13 12:27:06,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 12:27:06,735 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-13 12:27:06,735 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 8.6) internal successors, (43), 6 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 12:27:06,735 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-13 12:27:06,735 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-13 12:27:07,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 12:27:07,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 12:27:07,339 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-13 12:27:07,339 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [threadErr0ASSERT_VIOLATIONDATA_RACE] === [2024-11-13 12:27:07,339 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:27:07,340 INFO L85 PathProgramCache]: Analyzing trace with hash 864184527, now seen corresponding path program 1 times [2024-11-13 12:27:07,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:27:07,340 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [414996590] [2024-11-13 12:27:07,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:27:07,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:27:07,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:27:08,243 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 12:27:08,243 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 12:27:08,243 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [414996590] [2024-11-13 12:27:08,243 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [414996590] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 12:27:08,243 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2000067265] [2024-11-13 12:27:08,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:27:08,243 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 12:27:08,244 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_084b0b24-d5a0-462b-a255-016ec85dabac/bin/ugemcutter-verify-yV71Fz5F0F/z3 [2024-11-13 12:27:08,247 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_084b0b24-d5a0-462b-a255-016ec85dabac/bin/ugemcutter-verify-yV71Fz5F0F/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 12:27:08,249 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_084b0b24-d5a0-462b-a255-016ec85dabac/bin/ugemcutter-verify-yV71Fz5F0F/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-13 12:27:08,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:27:08,375 INFO L255 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-11-13 12:27:08,388 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 12:27:08,423 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 [2024-11-13 12:27:08,487 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-13 12:27:08,488 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 11 treesize of output 11 [2024-11-13 12:27:08,553 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-13 12:27:08,572 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 [2024-11-13 12:27:08,600 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 12:27:08,600 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 32 [2024-11-13 12:27:08,636 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 12:27:08,636 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 3 case distinctions, treesize of input 39 treesize of output 44 [2024-11-13 12:27:08,912 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 [2024-11-13 12:27:08,927 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 12:27:08,928 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 12:27:11,354 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_threadThread1of1ForFork0_~p~0.offset 3))) (let ((.cse0 (store |c_#race| c_threadThread1of1ForFork0_~p~0.base (store (select |c_#race| c_threadThread1of1ForFork0_~p~0.base) .cse1 |c_threadThread1of1ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_111 (Array Int Int))) (= |c_threadThread1of1ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_111) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 1)))) (forall ((v_ArrVal_111 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_111) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_111 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_111) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 2)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_111 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_111) c_threadThread1of1ForFork0_~p~0.base) .cse1) |c_threadThread1of1ForFork0_#t~nondet4|))))) is different from false [2024-11-13 12:27:17,610 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 12:27:17,611 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2000067265] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 12:27:17,611 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 12:27:17,611 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 18 [2024-11-13 12:27:17,611 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [674783465] [2024-11-13 12:27:17,612 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 12:27:17,612 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-13 12:27:17,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 12:27:17,613 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-13 12:27:17,615 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=240, Unknown=18, NotChecked=32, Total=342 [2024-11-13 12:27:17,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 12:27:17,616 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-13 12:27:17,617 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 4.111111111111111) internal successors, (74), 19 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 12:27:17,617 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-13 12:27:17,617 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 12:27:17,617 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-13 12:27:21,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 12:27:21,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 12:27:21,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-13 12:27:21,494 INFO L782 garLoopResultBuilder]: Registering result SAFE for location threadErr0ASSERT_VIOLATIONDATA_RACE (0 of 1 remaining) [2024-11-13 12:27:21,515 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_084b0b24-d5a0-462b-a255-016ec85dabac/bin/ugemcutter-verify-yV71Fz5F0F/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-13 12:27:21,695 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_084b0b24-d5a0-462b-a255-016ec85dabac/bin/ugemcutter-verify-yV71Fz5F0F/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 12:27:21,700 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-11-13 12:27:21,702 INFO L320 ceAbstractionStarter]: Result for error location threadThread1of1ForFork0 was SAFE (1/2) [2024-11-13 12:27:21,706 INFO L107 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-13 12:27:21,707 INFO L157 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-13 12:27:21,708 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-11-13 12:27:21,708 INFO L333 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, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, 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;@3a2209b3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-13 12:27:21,708 INFO L334 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2024-11-13 12:27:21,713 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-13 12:27:21,714 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:27:21,714 INFO L85 PathProgramCache]: Analyzing trace with hash 1806606044, now seen corresponding path program 1 times [2024-11-13 12:27:21,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:27:21,714 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [354030146] [2024-11-13 12:27:21,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:27:21,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:27:21,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:27:21,737 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 12:27:21,737 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 12:27:21,738 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [354030146] [2024-11-13 12:27:21,738 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [354030146] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 12:27:21,738 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 12:27:21,738 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-13 12:27:21,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1169426942] [2024-11-13 12:27:21,738 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 12:27:21,740 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-13 12:27:21,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 12:27:21,740 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-13 12:27:21,740 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-13 12:27:21,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 12:27:21,741 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-13 12:27:21,742 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 12:27:21,742 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-13 12:27:21,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 12:27:21,744 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-13 12:27:21,744 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-13 12:27:21,744 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:27:21,744 INFO L85 PathProgramCache]: Analyzing trace with hash -1199083969, now seen corresponding path program 1 times [2024-11-13 12:27:21,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:27:21,745 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [16358152] [2024-11-13 12:27:21,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:27:21,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:27:21,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:27:22,021 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 12:27:22,021 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 12:27:22,022 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [16358152] [2024-11-13 12:27:22,022 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [16358152] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 12:27:22,022 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 12:27:22,022 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-13 12:27:22,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1822064060] [2024-11-13 12:27:22,022 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 12:27:22,023 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-13 12:27:22,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 12:27:22,023 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-13 12:27:22,025 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-13 12:27:22,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 12:27:22,025 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-13 12:27:22,025 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 6.2) internal successors, (31), 6 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 12:27:22,026 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-13 12:27:22,026 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-13 12:27:22,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 12:27:22,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 12:27:22,177 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-13 12:27:22,178 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-13 12:27:22,178 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:27:22,178 INFO L85 PathProgramCache]: Analyzing trace with hash -1665020129, now seen corresponding path program 1 times [2024-11-13 12:27:22,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:27:22,178 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2023228418] [2024-11-13 12:27:22,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:27:22,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:27:22,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 12:27:22,204 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-13 12:27:22,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 12:27:22,244 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-13 12:27:22,246 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-13 12:27:22,246 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 3 remaining) [2024-11-13 12:27:22,247 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (1 of 3 remaining) [2024-11-13 12:27:22,248 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (0 of 3 remaining) [2024-11-13 12:27:22,248 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-13 12:27:22,250 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-11-13 12:27:22,253 INFO L320 ceAbstractionStarter]: Result for error location ULTIMATE.start was UNSAFE,UNKNOWN,UNKNOWN (2/2) [2024-11-13 12:27:22,254 WARN L247 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-13 12:27:22,254 INFO L492 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2024-11-13 12:27:22,273 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-11-13 12:27:22,276 INFO L107 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-13 12:27:22,280 INFO L157 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-13 12:27:22,281 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == threadThread1of2ForFork0 ======== [2024-11-13 12:27:22,281 INFO L333 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, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, 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;@3a2209b3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-13 12:27:22,282 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-13 12:27:22,561 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [threadErr0ASSERT_VIOLATIONDATA_RACE] === [2024-11-13 12:27:22,562 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:27:22,562 INFO L85 PathProgramCache]: Analyzing trace with hash -1060572287, now seen corresponding path program 1 times [2024-11-13 12:27:22,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:27:22,562 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2080033528] [2024-11-13 12:27:22,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:27:22,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:27:22,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:27:22,584 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 12:27:22,585 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 12:27:22,585 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2080033528] [2024-11-13 12:27:22,585 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2080033528] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 12:27:22,585 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 12:27:22,585 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-13 12:27:22,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [261622095] [2024-11-13 12:27:22,585 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 12:27:22,586 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-13 12:27:22,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 12:27:22,586 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-13 12:27:22,586 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-13 12:27:22,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 12:27:22,587 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-13 12:27:22,587 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 12:27:22,587 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-13 12:27:22,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 12:27:22,598 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-13 12:27:22,598 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [threadErr0ASSERT_VIOLATIONDATA_RACE] === [2024-11-13 12:27:22,598 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:27:22,599 INFO L85 PathProgramCache]: Analyzing trace with hash 1615542995, now seen corresponding path program 1 times [2024-11-13 12:27:22,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:27:22,599 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [791285575] [2024-11-13 12:27:22,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:27:22,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:27:22,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:27:22,939 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 12:27:22,939 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 12:27:22,939 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [791285575] [2024-11-13 12:27:22,939 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [791285575] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 12:27:22,939 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 12:27:22,940 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-13 12:27:22,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1451334937] [2024-11-13 12:27:22,940 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 12:27:22,940 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-13 12:27:22,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 12:27:22,941 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-13 12:27:22,941 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-13 12:27:22,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 12:27:22,941 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-13 12:27:22,942 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 8.6) internal successors, (43), 6 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 12:27:22,942 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-13 12:27:22,942 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-13 12:27:24,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 12:27:24,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 12:27:24,705 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-13 12:27:24,705 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [threadErr0ASSERT_VIOLATIONDATA_RACE] === [2024-11-13 12:27:24,706 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:27:24,706 INFO L85 PathProgramCache]: Analyzing trace with hash -2028527314, now seen corresponding path program 1 times [2024-11-13 12:27:24,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:27:24,706 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [265931391] [2024-11-13 12:27:24,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:27:24,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:27:24,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:27:25,327 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 12:27:25,328 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 12:27:25,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [265931391] [2024-11-13 12:27:25,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [265931391] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 12:27:25,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [214709738] [2024-11-13 12:27:25,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:27:25,328 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 12:27:25,328 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_084b0b24-d5a0-462b-a255-016ec85dabac/bin/ugemcutter-verify-yV71Fz5F0F/z3 [2024-11-13 12:27:25,330 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_084b0b24-d5a0-462b-a255-016ec85dabac/bin/ugemcutter-verify-yV71Fz5F0F/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 12:27:25,334 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_084b0b24-d5a0-462b-a255-016ec85dabac/bin/ugemcutter-verify-yV71Fz5F0F/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-13 12:27:25,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:27:25,426 INFO L255 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-11-13 12:27:25,429 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 12:27:25,434 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 [2024-11-13 12:27:25,481 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-13 12:27:25,481 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 11 treesize of output 11 [2024-11-13 12:27:25,522 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-13 12:27:25,531 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 [2024-11-13 12:27:25,546 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 12:27:25,546 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 32 [2024-11-13 12:27:25,565 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 12:27:25,565 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 3 case distinctions, treesize of input 39 treesize of output 44 [2024-11-13 12:27:25,732 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 [2024-11-13 12:27:25,743 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 12:27:25,743 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 12:27:25,771 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_275 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_275) c_threadThread1of2ForFork0_~p~0.base) (+ c_threadThread1of2ForFork0_~p~0.offset 1)) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_275 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_275) c_threadThread1of2ForFork0_~p~0.base) (+ 2 c_threadThread1of2ForFork0_~p~0.offset)) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_275 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_275) c_threadThread1of2ForFork0_~p~0.base) (+ 3 c_threadThread1of2ForFork0_~p~0.offset)) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_275 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_275) c_threadThread1of2ForFork0_~p~0.base) c_threadThread1of2ForFork0_~p~0.offset)))) is different from false [2024-11-13 12:27:25,923 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 3 c_threadThread1of2ForFork0_~p~0.offset))) (let ((.cse0 (store |c_#race| c_threadThread1of2ForFork0_~p~0.base (store (select |c_#race| c_threadThread1of2ForFork0_~p~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_275 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_275) c_threadThread1of2ForFork0_~p~0.base) (+ c_threadThread1of2ForFork0_~p~0.offset 1)))) (forall ((v_ArrVal_275 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_275) c_threadThread1of2ForFork0_~p~0.base) (+ 2 c_threadThread1of2ForFork0_~p~0.offset)))) (forall ((v_ArrVal_275 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_275) c_threadThread1of2ForFork0_~p~0.base) c_threadThread1of2ForFork0_~p~0.offset))) (forall ((v_ArrVal_275 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_275) c_threadThread1of2ForFork0_~p~0.base) .cse1)))))) is different from false [2024-11-13 12:27:25,945 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ 2 c_threadThread1of2ForFork0_~p~0.offset)) (.cse1 (+ 3 c_threadThread1of2ForFork0_~p~0.offset))) (let ((.cse0 (store |c_#race| c_threadThread1of2ForFork0_~p~0.base (store (store (select |c_#race| c_threadThread1of2ForFork0_~p~0.base) .cse2 |c_threadThread1of2ForFork0_#t~nondet4|) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_275 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_275) c_threadThread1of2ForFork0_~p~0.base) .cse1))) (forall ((v_ArrVal_275 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_275) c_threadThread1of2ForFork0_~p~0.base) c_threadThread1of2ForFork0_~p~0.offset))) (forall ((v_ArrVal_275 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_275) c_threadThread1of2ForFork0_~p~0.base) (+ c_threadThread1of2ForFork0_~p~0.offset 1)) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_275 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_275) c_threadThread1of2ForFork0_~p~0.base) .cse2)))))) is different from false [2024-11-13 12:27:28,071 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2024-11-13 12:27:28,071 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [214709738] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 12:27:28,071 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 12:27:28,072 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 18 [2024-11-13 12:27:28,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1086718956] [2024-11-13 12:27:28,072 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 12:27:28,072 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-13 12:27:28,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 12:27:28,073 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-13 12:27:28,073 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=201, Unknown=3, NotChecked=90, Total=342 [2024-11-13 12:27:28,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 12:27:28,074 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-13 12:27:28,074 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 4.111111111111111) internal successors, (74), 19 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 12:27:28,074 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-13 12:27:28,075 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 12:27:28,075 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-13 12:27:30,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 12:27:30,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 12:27:30,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-13 12:27:30,671 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_084b0b24-d5a0-462b-a255-016ec85dabac/bin/ugemcutter-verify-yV71Fz5F0F/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-13 12:27:30,855 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_084b0b24-d5a0-462b-a255-016ec85dabac/bin/ugemcutter-verify-yV71Fz5F0F/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 12:27:30,855 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [threadErr0ASSERT_VIOLATIONDATA_RACE] === [2024-11-13 12:27:30,856 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:27:30,856 INFO L85 PathProgramCache]: Analyzing trace with hash -1123324831, now seen corresponding path program 1 times [2024-11-13 12:27:30,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:27:30,856 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [436622938] [2024-11-13 12:27:30,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:27:30,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:27:30,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:27:31,319 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-11-13 12:27:31,319 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 12:27:31,319 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [436622938] [2024-11-13 12:27:31,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [436622938] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 12:27:31,320 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 12:27:31,320 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-13 12:27:31,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [4198005] [2024-11-13 12:27:31,320 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 12:27:31,320 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-13 12:27:31,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 12:27:31,321 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-13 12:27:31,321 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-13 12:27:31,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 12:27:31,323 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-13 12:27:31,323 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 12:27:31,323 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-13 12:27:31,324 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 12:27:31,324 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2024-11-13 12:27:31,324 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-13 12:27:33,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 12:27:33,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 12:27:33,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-13 12:27:33,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 12:27:33,193 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-13 12:27:33,193 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [threadErr0ASSERT_VIOLATIONDATA_RACE] === [2024-11-13 12:27:33,194 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:27:33,194 INFO L85 PathProgramCache]: Analyzing trace with hash 2120725463, now seen corresponding path program 1 times [2024-11-13 12:27:33,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:27:33,194 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [79005928] [2024-11-13 12:27:33,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:27:33,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:27:33,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:27:35,063 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 39 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 12:27:35,063 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 12:27:35,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [79005928] [2024-11-13 12:27:35,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [79005928] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 12:27:35,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1139897859] [2024-11-13 12:27:35,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:27:35,064 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 12:27:35,064 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_084b0b24-d5a0-462b-a255-016ec85dabac/bin/ugemcutter-verify-yV71Fz5F0F/z3 [2024-11-13 12:27:35,066 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_084b0b24-d5a0-462b-a255-016ec85dabac/bin/ugemcutter-verify-yV71Fz5F0F/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 12:27:35,068 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_084b0b24-d5a0-462b-a255-016ec85dabac/bin/ugemcutter-verify-yV71Fz5F0F/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-13 12:27:35,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:27:35,192 INFO L255 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 52 conjuncts are in the unsatisfiable core [2024-11-13 12:27:35,218 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 12:27:35,227 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 [2024-11-13 12:27:35,240 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-13 12:27:35,240 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 11 treesize of output 11 [2024-11-13 12:27:35,433 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 [2024-11-13 12:27:35,486 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 [2024-11-13 12:27:35,543 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 [2024-11-13 12:27:35,619 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 [2024-11-13 12:27:36,000 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 [2024-11-13 12:27:36,033 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 [2024-11-13 12:27:36,083 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 [2024-11-13 12:27:36,123 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 [2024-11-13 12:27:36,413 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 [2024-11-13 12:27:36,442 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 [2024-11-13 12:27:36,472 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 [2024-11-13 12:27:36,506 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 [2024-11-13 12:27:36,719 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 12:27:36,721 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 12:27:36,723 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 12:27:36,724 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 12:27:36,726 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 12:27:36,727 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 50 treesize of output 47 [2024-11-13 12:27:36,736 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 11 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 12:27:36,736 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 12:27:37,776 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_threadThread2of2ForFork0_~p~0.offset_19 Int) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_434 (Array Int Int))) (or (< v_threadThread2of2ForFork0_~p~0.offset_19 |c_threadThread2of2ForFork0_#in~arg.offset|) (= (select (select (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_434))) (store .cse0 |c_threadThread2of2ForFork0_#in~arg.base| (store (select .cse0 |c_threadThread2of2ForFork0_#in~arg.base|) v_threadThread2of2ForFork0_~p~0.offset_19 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~p~0.base) (+ 2 c_threadThread1of2ForFork0_~p~0.offset)) |c_threadThread1of2ForFork0_#t~nondet4|))) (forall ((v_threadThread2of2ForFork0_~p~0.offset_19 Int) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_434 (Array Int Int))) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse1 (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_434))) (store .cse1 |c_threadThread2of2ForFork0_#in~arg.base| (store (select .cse1 |c_threadThread2of2ForFork0_#in~arg.base|) v_threadThread2of2ForFork0_~p~0.offset_19 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~p~0.base) (+ c_threadThread1of2ForFork0_~p~0.offset 1))) (< v_threadThread2of2ForFork0_~p~0.offset_19 |c_threadThread2of2ForFork0_#in~arg.offset|))) (forall ((v_threadThread2of2ForFork0_~p~0.offset_19 Int) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_434 (Array Int Int))) (or (< v_threadThread2of2ForFork0_~p~0.offset_19 |c_threadThread2of2ForFork0_#in~arg.offset|) (= (select (select (let ((.cse2 (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_434))) (store .cse2 |c_threadThread2of2ForFork0_#in~arg.base| (store (select .cse2 |c_threadThread2of2ForFork0_#in~arg.base|) v_threadThread2of2ForFork0_~p~0.offset_19 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~p~0.base) (+ 3 c_threadThread1of2ForFork0_~p~0.offset)) |c_threadThread1of2ForFork0_#t~nondet4|))) (forall ((v_threadThread2of2ForFork0_~p~0.offset_19 Int) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_434 (Array Int Int))) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse3 (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_434))) (store .cse3 |c_threadThread2of2ForFork0_#in~arg.base| (store (select .cse3 |c_threadThread2of2ForFork0_#in~arg.base|) v_threadThread2of2ForFork0_~p~0.offset_19 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~p~0.base) c_threadThread1of2ForFork0_~p~0.offset)) (< v_threadThread2of2ForFork0_~p~0.offset_19 |c_threadThread2of2ForFork0_#in~arg.offset|)))) is different from false [2024-11-13 12:27:38,524 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~datas~0#1.offset| (* |c_ULTIMATE.start_main_~i~0#1| 4)))) (and (forall ((v_threadThread2of2ForFork0_~p~0.offset_19 Int) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_434 (Array Int Int))) (or (< v_threadThread2of2ForFork0_~p~0.offset_19 .cse0) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse1 (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_434))) (store .cse1 |c_ULTIMATE.start_main_~datas~0#1.base| (store (select .cse1 |c_ULTIMATE.start_main_~datas~0#1.base|) v_threadThread2of2ForFork0_~p~0.offset_19 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~p~0.base) (+ 3 c_threadThread1of2ForFork0_~p~0.offset))))) (forall ((v_threadThread2of2ForFork0_~p~0.offset_19 Int) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_434 (Array Int Int))) (or (< v_threadThread2of2ForFork0_~p~0.offset_19 .cse0) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse2 (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_434))) (store .cse2 |c_ULTIMATE.start_main_~datas~0#1.base| (store (select .cse2 |c_ULTIMATE.start_main_~datas~0#1.base|) v_threadThread2of2ForFork0_~p~0.offset_19 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~p~0.base) (+ 2 c_threadThread1of2ForFork0_~p~0.offset))))) (forall ((v_threadThread2of2ForFork0_~p~0.offset_19 Int) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_434 (Array Int Int))) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse3 (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_434))) (store .cse3 |c_ULTIMATE.start_main_~datas~0#1.base| (store (select .cse3 |c_ULTIMATE.start_main_~datas~0#1.base|) v_threadThread2of2ForFork0_~p~0.offset_19 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~p~0.base) c_threadThread1of2ForFork0_~p~0.offset)) (< v_threadThread2of2ForFork0_~p~0.offset_19 .cse0))) (forall ((v_threadThread2of2ForFork0_~p~0.offset_19 Int) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_434 (Array Int Int))) (or (= (select (select (let ((.cse4 (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_434))) (store .cse4 |c_ULTIMATE.start_main_~datas~0#1.base| (store (select .cse4 |c_ULTIMATE.start_main_~datas~0#1.base|) v_threadThread2of2ForFork0_~p~0.offset_19 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~p~0.base) (+ c_threadThread1of2ForFork0_~p~0.offset 1)) |c_threadThread1of2ForFork0_#t~nondet4|) (< v_threadThread2of2ForFork0_~p~0.offset_19 .cse0))))) is different from false [2024-11-13 12:27:39,088 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ (* |c_ULTIMATE.start_main_#t~post11#1| 4) |c_ULTIMATE.start_main_~datas~0#1.offset| 4))) (and (forall ((v_threadThread2of2ForFork0_~p~0.offset_19 Int) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_434 (Array Int Int))) (or (= (select (select (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_434))) (store .cse0 |c_ULTIMATE.start_main_~datas~0#1.base| (store (select .cse0 |c_ULTIMATE.start_main_~datas~0#1.base|) v_threadThread2of2ForFork0_~p~0.offset_19 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~p~0.base) (+ c_threadThread1of2ForFork0_~p~0.offset 1)) |c_threadThread1of2ForFork0_#t~nondet4|) (< v_threadThread2of2ForFork0_~p~0.offset_19 .cse1))) (forall ((v_threadThread2of2ForFork0_~p~0.offset_19 Int) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_434 (Array Int Int))) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse2 (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_434))) (store .cse2 |c_ULTIMATE.start_main_~datas~0#1.base| (store (select .cse2 |c_ULTIMATE.start_main_~datas~0#1.base|) v_threadThread2of2ForFork0_~p~0.offset_19 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~p~0.base) c_threadThread1of2ForFork0_~p~0.offset)) (< v_threadThread2of2ForFork0_~p~0.offset_19 .cse1))) (forall ((v_threadThread2of2ForFork0_~p~0.offset_19 Int) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_434 (Array Int Int))) (or (< v_threadThread2of2ForFork0_~p~0.offset_19 .cse1) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse3 (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_434))) (store .cse3 |c_ULTIMATE.start_main_~datas~0#1.base| (store (select .cse3 |c_ULTIMATE.start_main_~datas~0#1.base|) v_threadThread2of2ForFork0_~p~0.offset_19 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~p~0.base) (+ 3 c_threadThread1of2ForFork0_~p~0.offset))))) (forall ((v_threadThread2of2ForFork0_~p~0.offset_19 Int) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_434 (Array Int Int))) (or (< v_threadThread2of2ForFork0_~p~0.offset_19 .cse1) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse4 (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_434))) (store .cse4 |c_ULTIMATE.start_main_~datas~0#1.base| (store (select .cse4 |c_ULTIMATE.start_main_~datas~0#1.base|) v_threadThread2of2ForFork0_~p~0.offset_19 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~p~0.base) (+ 2 c_threadThread1of2ForFork0_~p~0.offset))))))) is different from false [2024-11-13 12:27:39,151 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~datas~0#1.offset| (* |c_ULTIMATE.start_main_~i~0#1| 4) 4))) (and (forall ((v_threadThread2of2ForFork0_~p~0.offset_19 Int) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_434 (Array Int Int))) (or (< v_threadThread2of2ForFork0_~p~0.offset_19 .cse0) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse1 (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_434))) (store .cse1 |c_ULTIMATE.start_main_~datas~0#1.base| (store (select .cse1 |c_ULTIMATE.start_main_~datas~0#1.base|) v_threadThread2of2ForFork0_~p~0.offset_19 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~p~0.base) (+ 2 c_threadThread1of2ForFork0_~p~0.offset))))) (forall ((v_threadThread2of2ForFork0_~p~0.offset_19 Int) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_434 (Array Int Int))) (or (= (select (select (let ((.cse2 (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_434))) (store .cse2 |c_ULTIMATE.start_main_~datas~0#1.base| (store (select .cse2 |c_ULTIMATE.start_main_~datas~0#1.base|) v_threadThread2of2ForFork0_~p~0.offset_19 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~p~0.base) (+ c_threadThread1of2ForFork0_~p~0.offset 1)) |c_threadThread1of2ForFork0_#t~nondet4|) (< v_threadThread2of2ForFork0_~p~0.offset_19 .cse0))) (forall ((v_threadThread2of2ForFork0_~p~0.offset_19 Int) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_434 (Array Int Int))) (or (< v_threadThread2of2ForFork0_~p~0.offset_19 .cse0) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse3 (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_434))) (store .cse3 |c_ULTIMATE.start_main_~datas~0#1.base| (store (select .cse3 |c_ULTIMATE.start_main_~datas~0#1.base|) v_threadThread2of2ForFork0_~p~0.offset_19 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~p~0.base) (+ 3 c_threadThread1of2ForFork0_~p~0.offset))))) (forall ((v_threadThread2of2ForFork0_~p~0.offset_19 Int) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_434 (Array Int Int))) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse4 (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_434))) (store .cse4 |c_ULTIMATE.start_main_~datas~0#1.base| (store (select .cse4 |c_ULTIMATE.start_main_~datas~0#1.base|) v_threadThread2of2ForFork0_~p~0.offset_19 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~p~0.base) c_threadThread1of2ForFork0_~p~0.offset)) (< v_threadThread2of2ForFork0_~p~0.offset_19 .cse0))))) is different from false [2024-11-13 12:27:39,334 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse5 (+ 3 c_threadThread1of2ForFork0_~p~0.offset))) (let ((.cse1 (store |c_#race| c_threadThread1of2ForFork0_~p~0.base (store (select |c_#race| c_threadThread1of2ForFork0_~p~0.base) .cse5 |c_threadThread1of2ForFork0_#t~nondet4|))) (.cse2 (+ |c_ULTIMATE.start_main_~datas~0#1.offset| (* |c_ULTIMATE.start_main_~i~0#1| 4) 4))) (and (forall ((v_threadThread2of2ForFork0_~p~0.offset_19 Int) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_434 (Array Int Int))) (or (= (select (select (let ((.cse0 (store .cse1 |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_434))) (store .cse0 |c_ULTIMATE.start_main_~datas~0#1.base| (store (select .cse0 |c_ULTIMATE.start_main_~datas~0#1.base|) v_threadThread2of2ForFork0_~p~0.offset_19 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~p~0.base) c_threadThread1of2ForFork0_~p~0.offset) |c_threadThread1of2ForFork0_#t~nondet4|) (< v_threadThread2of2ForFork0_~p~0.offset_19 .cse2))) (forall ((v_threadThread2of2ForFork0_~p~0.offset_19 Int) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_434 (Array Int Int))) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse3 (store .cse1 |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_434))) (store .cse3 |c_ULTIMATE.start_main_~datas~0#1.base| (store (select .cse3 |c_ULTIMATE.start_main_~datas~0#1.base|) v_threadThread2of2ForFork0_~p~0.offset_19 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~p~0.base) (+ c_threadThread1of2ForFork0_~p~0.offset 1))) (< v_threadThread2of2ForFork0_~p~0.offset_19 .cse2))) (forall ((v_threadThread2of2ForFork0_~p~0.offset_19 Int) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_434 (Array Int Int))) (or (< v_threadThread2of2ForFork0_~p~0.offset_19 .cse2) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse4 (store .cse1 |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_434))) (store .cse4 |c_ULTIMATE.start_main_~datas~0#1.base| (store (select .cse4 |c_ULTIMATE.start_main_~datas~0#1.base|) v_threadThread2of2ForFork0_~p~0.offset_19 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~p~0.base) .cse5)))) (forall ((v_threadThread2of2ForFork0_~p~0.offset_19 Int) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_434 (Array Int Int))) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse6 (store .cse1 |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_434))) (store .cse6 |c_ULTIMATE.start_main_~datas~0#1.base| (store (select .cse6 |c_ULTIMATE.start_main_~datas~0#1.base|) v_threadThread2of2ForFork0_~p~0.offset_19 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~p~0.base) (+ 2 c_threadThread1of2ForFork0_~p~0.offset))) (< v_threadThread2of2ForFork0_~p~0.offset_19 .cse2)))))) is different from false [2024-11-13 12:27:39,394 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse6 (+ 2 c_threadThread1of2ForFork0_~p~0.offset)) (.cse2 (+ 3 c_threadThread1of2ForFork0_~p~0.offset))) (let ((.cse1 (store |c_#race| c_threadThread1of2ForFork0_~p~0.base (store (store (select |c_#race| c_threadThread1of2ForFork0_~p~0.base) .cse6 |c_threadThread1of2ForFork0_#t~nondet4|) .cse2 |c_threadThread1of2ForFork0_#t~nondet4|))) (.cse3 (+ |c_ULTIMATE.start_main_~datas~0#1.offset| (* |c_ULTIMATE.start_main_~i~0#1| 4) 4))) (and (forall ((v_threadThread2of2ForFork0_~p~0.offset_19 Int) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_434 (Array Int Int))) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse0 (store .cse1 |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_434))) (store .cse0 |c_ULTIMATE.start_main_~datas~0#1.base| (store (select .cse0 |c_ULTIMATE.start_main_~datas~0#1.base|) v_threadThread2of2ForFork0_~p~0.offset_19 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~p~0.base) .cse2)) (< v_threadThread2of2ForFork0_~p~0.offset_19 .cse3))) (forall ((v_threadThread2of2ForFork0_~p~0.offset_19 Int) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_434 (Array Int Int))) (or (< v_threadThread2of2ForFork0_~p~0.offset_19 .cse3) (= (select (select (let ((.cse4 (store .cse1 |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_434))) (store .cse4 |c_ULTIMATE.start_main_~datas~0#1.base| (store (select .cse4 |c_ULTIMATE.start_main_~datas~0#1.base|) v_threadThread2of2ForFork0_~p~0.offset_19 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~p~0.base) (+ c_threadThread1of2ForFork0_~p~0.offset 1)) |c_threadThread1of2ForFork0_#t~nondet4|))) (forall ((v_threadThread2of2ForFork0_~p~0.offset_19 Int) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_434 (Array Int Int))) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse5 (store .cse1 |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_434))) (store .cse5 |c_ULTIMATE.start_main_~datas~0#1.base| (store (select .cse5 |c_ULTIMATE.start_main_~datas~0#1.base|) v_threadThread2of2ForFork0_~p~0.offset_19 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~p~0.base) .cse6)) (< v_threadThread2of2ForFork0_~p~0.offset_19 .cse3))) (forall ((v_threadThread2of2ForFork0_~p~0.offset_19 Int) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_434 (Array Int Int))) (or (= (select (select (let ((.cse7 (store .cse1 |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_434))) (store .cse7 |c_ULTIMATE.start_main_~datas~0#1.base| (store (select .cse7 |c_ULTIMATE.start_main_~datas~0#1.base|) v_threadThread2of2ForFork0_~p~0.offset_19 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~p~0.base) c_threadThread1of2ForFork0_~p~0.offset) |c_threadThread1of2ForFork0_#t~nondet4|) (< v_threadThread2of2ForFork0_~p~0.offset_19 .cse3)))))) is different from false [2024-11-13 12:27:39,539 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ c_threadThread1of2ForFork0_~p~0.offset 1)) (.cse5 (+ 2 c_threadThread1of2ForFork0_~p~0.offset)) (.cse7 (+ 3 c_threadThread1of2ForFork0_~p~0.offset))) (let ((.cse1 (store |c_#race| c_threadThread1of2ForFork0_~p~0.base (store (store (store (select |c_#race| c_threadThread1of2ForFork0_~p~0.base) .cse2 |c_threadThread1of2ForFork0_#t~nondet4|) .cse5 |c_threadThread1of2ForFork0_#t~nondet4|) .cse7 |c_threadThread1of2ForFork0_#t~nondet4|))) (.cse3 (+ |c_ULTIMATE.start_main_~datas~0#1.offset| (* |c_ULTIMATE.start_main_~i~0#1| 4) 4))) (and (forall ((v_threadThread2of2ForFork0_~p~0.offset_19 Int) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_434 (Array Int Int))) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse0 (store .cse1 |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_434))) (store .cse0 |c_ULTIMATE.start_main_~datas~0#1.base| (store (select .cse0 |c_ULTIMATE.start_main_~datas~0#1.base|) v_threadThread2of2ForFork0_~p~0.offset_19 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~p~0.base) .cse2)) (< v_threadThread2of2ForFork0_~p~0.offset_19 .cse3))) (forall ((v_threadThread2of2ForFork0_~p~0.offset_19 Int) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_434 (Array Int Int))) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse4 (store .cse1 |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_434))) (store .cse4 |c_ULTIMATE.start_main_~datas~0#1.base| (store (select .cse4 |c_ULTIMATE.start_main_~datas~0#1.base|) v_threadThread2of2ForFork0_~p~0.offset_19 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~p~0.base) .cse5)) (< v_threadThread2of2ForFork0_~p~0.offset_19 .cse3))) (forall ((v_threadThread2of2ForFork0_~p~0.offset_19 Int) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_434 (Array Int Int))) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse6 (store .cse1 |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_434))) (store .cse6 |c_ULTIMATE.start_main_~datas~0#1.base| (store (select .cse6 |c_ULTIMATE.start_main_~datas~0#1.base|) v_threadThread2of2ForFork0_~p~0.offset_19 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~p~0.base) .cse7)) (< v_threadThread2of2ForFork0_~p~0.offset_19 .cse3))) (forall ((v_threadThread2of2ForFork0_~p~0.offset_19 Int) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_434 (Array Int Int))) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse8 (store .cse1 |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_434))) (store .cse8 |c_ULTIMATE.start_main_~datas~0#1.base| (store (select .cse8 |c_ULTIMATE.start_main_~datas~0#1.base|) v_threadThread2of2ForFork0_~p~0.offset_19 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~p~0.base) c_threadThread1of2ForFork0_~p~0.offset)) (< v_threadThread2of2ForFork0_~p~0.offset_19 .cse3)))))) is different from false [2024-11-13 12:27:39,575 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 12:27:39,576 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 69 treesize of output 62 [2024-11-13 12:27:39,591 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 12:27:39,591 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 312 treesize of output 274 [2024-11-13 12:27:39,611 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 158 treesize of output 142 [2024-11-13 12:27:39,770 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 12:27:39,770 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 81 treesize of output 55 [2024-11-13 12:27:39,801 INFO L349 Elim1Store]: treesize reduction 38, result has 2.6 percent of original size [2024-11-13 12:27:39,802 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 67 treesize of output 1 [2024-11-13 12:27:39,824 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 12:27:39,824 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 69 treesize of output 62 [2024-11-13 12:27:39,831 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 12:27:39,845 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-13 12:27:39,846 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 128 treesize of output 106 [2024-11-13 12:27:39,858 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 [2024-11-13 12:27:39,867 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 100 treesize of output 70 [2024-11-13 12:27:39,914 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 12:27:39,914 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 69 treesize of output 62 [2024-11-13 12:27:39,924 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 12:27:39,937 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-13 12:27:39,937 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 140 treesize of output 118 [2024-11-13 12:27:39,949 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 40 treesize of output 36 [2024-11-13 12:27:39,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 112 treesize of output 70 [2024-11-13 12:27:40,230 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 37 not checked. [2024-11-13 12:27:40,230 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1139897859] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 12:27:40,230 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 12:27:40,230 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 19, 19] total 44 [2024-11-13 12:27:40,230 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [970881540] [2024-11-13 12:27:40,230 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 12:27:40,231 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2024-11-13 12:27:40,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 12:27:40,232 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2024-11-13 12:27:40,233 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=192, Invalid=1235, Unknown=7, NotChecked=546, Total=1980 [2024-11-13 12:27:40,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 12:27:40,234 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-13 12:27:40,234 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 44 states have (on average 3.977272727272727) internal successors, (175), 45 states have internal predecessors, (175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 12:27:40,234 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-13 12:27:40,234 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 12:27:40,234 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2024-11-13 12:27:40,234 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 12:27:40,234 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-13 12:27:48,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 12:27:48,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 12:27:48,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-13 12:27:48,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 12:27:48,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2024-11-13 12:27:48,519 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_084b0b24-d5a0-462b-a255-016ec85dabac/bin/ugemcutter-verify-yV71Fz5F0F/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-13 12:27:48,700 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_084b0b24-d5a0-462b-a255-016ec85dabac/bin/ugemcutter-verify-yV71Fz5F0F/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 12:27:48,700 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [threadErr0ASSERT_VIOLATIONDATA_RACE] === [2024-11-13 12:27:48,700 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:27:48,700 INFO L85 PathProgramCache]: Analyzing trace with hash -38779539, now seen corresponding path program 2 times [2024-11-13 12:27:48,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:27:48,700 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [254974989] [2024-11-13 12:27:48,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:27:48,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:27:48,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:27:50,511 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 39 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 12:27:50,511 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 12:27:50,511 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [254974989] [2024-11-13 12:27:50,511 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [254974989] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 12:27:50,511 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [881463803] [2024-11-13 12:27:50,511 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-13 12:27:50,512 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 12:27:50,512 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_084b0b24-d5a0-462b-a255-016ec85dabac/bin/ugemcutter-verify-yV71Fz5F0F/z3 [2024-11-13 12:27:50,514 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_084b0b24-d5a0-462b-a255-016ec85dabac/bin/ugemcutter-verify-yV71Fz5F0F/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 12:27:50,516 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_084b0b24-d5a0-462b-a255-016ec85dabac/bin/ugemcutter-verify-yV71Fz5F0F/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-13 12:27:50,645 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-13 12:27:50,646 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-13 12:27:50,648 INFO L255 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 65 conjuncts are in the unsatisfiable core [2024-11-13 12:27:50,653 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 12:27:50,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 [2024-11-13 12:27:50,726 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-13 12:27:50,727 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 11 treesize of output 11 [2024-11-13 12:27:51,155 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 [2024-11-13 12:27:51,233 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 [2024-11-13 12:27:51,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 [2024-11-13 12:27:51,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 30 treesize of output 21 [2024-11-13 12:27:51,784 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 [2024-11-13 12:27:51,878 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 [2024-11-13 12:27:51,898 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 [2024-11-13 12:27:51,928 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 [2024-11-13 12:27:52,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 37 treesize of output 26 [2024-11-13 12:27:52,273 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 [2024-11-13 12:27:52,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 37 treesize of output 26 [2024-11-13 12:27:52,330 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 [2024-11-13 12:27:52,651 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 12:27:52,652 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 12:27:52,654 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 12:27:52,657 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 12:27:52,659 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 12:27:52,659 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 44 treesize of output 41 [2024-11-13 12:27:52,710 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 39 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 12:27:52,710 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 12:27:53,701 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_546 (Array Int Int)) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_threadThread2of2ForFork0_~p~0.offset_21 Int)) (or (< v_threadThread2of2ForFork0_~p~0.offset_21 |c_threadThread2of2ForFork0_#in~arg.offset|) (= (select (select (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_546))) (store .cse0 |c_threadThread2of2ForFork0_#in~arg.base| (store (select .cse0 |c_threadThread2of2ForFork0_#in~arg.base|) v_threadThread2of2ForFork0_~p~0.offset_21 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~p~0.base) (+ 3 c_threadThread1of2ForFork0_~p~0.offset)) |c_threadThread1of2ForFork0_#t~nondet4|))) (forall ((v_ArrVal_546 (Array Int Int)) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_threadThread2of2ForFork0_~p~0.offset_21 Int)) (or (= (select (select (let ((.cse1 (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_546))) (store .cse1 |c_threadThread2of2ForFork0_#in~arg.base| (store (select .cse1 |c_threadThread2of2ForFork0_#in~arg.base|) v_threadThread2of2ForFork0_~p~0.offset_21 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~p~0.base) (+ c_threadThread1of2ForFork0_~p~0.offset 1)) |c_threadThread1of2ForFork0_#t~nondet4|) (< v_threadThread2of2ForFork0_~p~0.offset_21 |c_threadThread2of2ForFork0_#in~arg.offset|))) (forall ((v_ArrVal_546 (Array Int Int)) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_threadThread2of2ForFork0_~p~0.offset_21 Int)) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse2 (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_546))) (store .cse2 |c_threadThread2of2ForFork0_#in~arg.base| (store (select .cse2 |c_threadThread2of2ForFork0_#in~arg.base|) v_threadThread2of2ForFork0_~p~0.offset_21 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~p~0.base) c_threadThread1of2ForFork0_~p~0.offset)) (< v_threadThread2of2ForFork0_~p~0.offset_21 |c_threadThread2of2ForFork0_#in~arg.offset|))) (forall ((v_ArrVal_546 (Array Int Int)) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_threadThread2of2ForFork0_~p~0.offset_21 Int)) (or (< v_threadThread2of2ForFork0_~p~0.offset_21 |c_threadThread2of2ForFork0_#in~arg.offset|) (= (select (select (let ((.cse3 (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_546))) (store .cse3 |c_threadThread2of2ForFork0_#in~arg.base| (store (select .cse3 |c_threadThread2of2ForFork0_#in~arg.base|) v_threadThread2of2ForFork0_~p~0.offset_21 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~p~0.base) (+ 2 c_threadThread1of2ForFork0_~p~0.offset)) |c_threadThread1of2ForFork0_#t~nondet4|)))) is different from false [2024-11-13 12:27:54,262 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~datas~0#1.offset| (* |c_ULTIMATE.start_main_~i~0#1| 4)))) (and (forall ((v_ArrVal_546 (Array Int Int)) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_threadThread2of2ForFork0_~p~0.offset_21 Int)) (or (< v_threadThread2of2ForFork0_~p~0.offset_21 .cse0) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse1 (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_546))) (store .cse1 |c_ULTIMATE.start_main_~datas~0#1.base| (store (select .cse1 |c_ULTIMATE.start_main_~datas~0#1.base|) v_threadThread2of2ForFork0_~p~0.offset_21 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~p~0.base) (+ 3 c_threadThread1of2ForFork0_~p~0.offset))))) (forall ((v_ArrVal_546 (Array Int Int)) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_threadThread2of2ForFork0_~p~0.offset_21 Int)) (or (< v_threadThread2of2ForFork0_~p~0.offset_21 .cse0) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse2 (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_546))) (store .cse2 |c_ULTIMATE.start_main_~datas~0#1.base| (store (select .cse2 |c_ULTIMATE.start_main_~datas~0#1.base|) v_threadThread2of2ForFork0_~p~0.offset_21 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~p~0.base) c_threadThread1of2ForFork0_~p~0.offset)))) (forall ((v_ArrVal_546 (Array Int Int)) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_threadThread2of2ForFork0_~p~0.offset_21 Int)) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse3 (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_546))) (store .cse3 |c_ULTIMATE.start_main_~datas~0#1.base| (store (select .cse3 |c_ULTIMATE.start_main_~datas~0#1.base|) v_threadThread2of2ForFork0_~p~0.offset_21 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~p~0.base) (+ 2 c_threadThread1of2ForFork0_~p~0.offset))) (< v_threadThread2of2ForFork0_~p~0.offset_21 .cse0))) (forall ((v_ArrVal_546 (Array Int Int)) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_threadThread2of2ForFork0_~p~0.offset_21 Int)) (or (= (select (select (let ((.cse4 (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_546))) (store .cse4 |c_ULTIMATE.start_main_~datas~0#1.base| (store (select .cse4 |c_ULTIMATE.start_main_~datas~0#1.base|) v_threadThread2of2ForFork0_~p~0.offset_21 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~p~0.base) (+ c_threadThread1of2ForFork0_~p~0.offset 1)) |c_threadThread1of2ForFork0_#t~nondet4|) (< v_threadThread2of2ForFork0_~p~0.offset_21 .cse0))))) is different from false [2024-11-13 12:27:54,546 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ 3 c_threadThread1of2ForFork0_~p~0.offset))) (let ((.cse1 (store |c_#race| c_threadThread1of2ForFork0_~p~0.base (store (select |c_#race| c_threadThread1of2ForFork0_~p~0.base) .cse2 |c_threadThread1of2ForFork0_#t~nondet4|))) (.cse3 (+ |c_ULTIMATE.start_main_~datas~0#1.offset| (* |c_ULTIMATE.start_main_~i~0#1| 4)))) (and (forall ((v_ArrVal_546 (Array Int Int)) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_threadThread2of2ForFork0_~p~0.offset_21 Int)) (or (= (select (select (let ((.cse0 (store .cse1 |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_546))) (store .cse0 |c_ULTIMATE.start_main_~datas~0#1.base| (store (select .cse0 |c_ULTIMATE.start_main_~datas~0#1.base|) v_threadThread2of2ForFork0_~p~0.offset_21 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~p~0.base) .cse2) |c_threadThread1of2ForFork0_#t~nondet4|) (< v_threadThread2of2ForFork0_~p~0.offset_21 .cse3))) (forall ((v_ArrVal_546 (Array Int Int)) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_threadThread2of2ForFork0_~p~0.offset_21 Int)) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse4 (store .cse1 |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_546))) (store .cse4 |c_ULTIMATE.start_main_~datas~0#1.base| (store (select .cse4 |c_ULTIMATE.start_main_~datas~0#1.base|) v_threadThread2of2ForFork0_~p~0.offset_21 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~p~0.base) c_threadThread1of2ForFork0_~p~0.offset)) (< v_threadThread2of2ForFork0_~p~0.offset_21 .cse3))) (forall ((v_ArrVal_546 (Array Int Int)) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_threadThread2of2ForFork0_~p~0.offset_21 Int)) (or (< v_threadThread2of2ForFork0_~p~0.offset_21 .cse3) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse5 (store .cse1 |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_546))) (store .cse5 |c_ULTIMATE.start_main_~datas~0#1.base| (store (select .cse5 |c_ULTIMATE.start_main_~datas~0#1.base|) v_threadThread2of2ForFork0_~p~0.offset_21 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~p~0.base) (+ c_threadThread1of2ForFork0_~p~0.offset 1))))) (forall ((v_ArrVal_546 (Array Int Int)) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_threadThread2of2ForFork0_~p~0.offset_21 Int)) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse6 (store .cse1 |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_546))) (store .cse6 |c_ULTIMATE.start_main_~datas~0#1.base| (store (select .cse6 |c_ULTIMATE.start_main_~datas~0#1.base|) v_threadThread2of2ForFork0_~p~0.offset_21 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~p~0.base) (+ 2 c_threadThread1of2ForFork0_~p~0.offset))) (< v_threadThread2of2ForFork0_~p~0.offset_21 .cse3)))))) is different from false [2024-11-13 12:27:54,613 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~datas~0#1.offset| (* |c_ULTIMATE.start_main_~i~0#1| 4))) (.cse2 (+ 3 c_threadThread1of2ForFork0_~p~0.offset))) (and (forall ((v_ArrVal_546 (Array Int Int)) (v_ArrVal_537 (Array Int Int)) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_threadThread2of2ForFork0_~p~0.offset_21 Int)) (or (< v_threadThread2of2ForFork0_~p~0.offset_21 .cse0) (= (select (select (let ((.cse1 (store (store |c_#race| c_threadThread1of2ForFork0_~p~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_537) c_threadThread1of2ForFork0_~p~0.base) .cse2 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_546))) (store .cse1 |c_ULTIMATE.start_main_~datas~0#1.base| (store (select .cse1 |c_ULTIMATE.start_main_~datas~0#1.base|) v_threadThread2of2ForFork0_~p~0.offset_21 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~p~0.base) .cse2) |c_threadThread1of2ForFork0_#t~nondet4|))) (forall ((v_ArrVal_546 (Array Int Int)) (v_ArrVal_537 (Array Int Int)) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_threadThread2of2ForFork0_~p~0.offset_21 Int)) (or (< v_threadThread2of2ForFork0_~p~0.offset_21 .cse0) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse3 (store (store |c_#race| c_threadThread1of2ForFork0_~p~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_537) c_threadThread1of2ForFork0_~p~0.base) .cse2 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_546))) (store .cse3 |c_ULTIMATE.start_main_~datas~0#1.base| (store (select .cse3 |c_ULTIMATE.start_main_~datas~0#1.base|) v_threadThread2of2ForFork0_~p~0.offset_21 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~p~0.base) c_threadThread1of2ForFork0_~p~0.offset)))) (forall ((v_ArrVal_546 (Array Int Int)) (v_ArrVal_537 (Array Int Int)) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_threadThread2of2ForFork0_~p~0.offset_21 Int)) (or (< v_threadThread2of2ForFork0_~p~0.offset_21 .cse0) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse4 (store (store |c_#race| c_threadThread1of2ForFork0_~p~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_537) c_threadThread1of2ForFork0_~p~0.base) .cse2 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_546))) (store .cse4 |c_ULTIMATE.start_main_~datas~0#1.base| (store (select .cse4 |c_ULTIMATE.start_main_~datas~0#1.base|) v_threadThread2of2ForFork0_~p~0.offset_21 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~p~0.base) (+ c_threadThread1of2ForFork0_~p~0.offset 1))))) (forall ((v_ArrVal_546 (Array Int Int)) (v_ArrVal_537 (Array Int Int)) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_threadThread2of2ForFork0_~p~0.offset_21 Int)) (or (< v_threadThread2of2ForFork0_~p~0.offset_21 .cse0) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse5 (store (store |c_#race| c_threadThread1of2ForFork0_~p~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_537) c_threadThread1of2ForFork0_~p~0.base) .cse2 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_546))) (store .cse5 |c_ULTIMATE.start_main_~datas~0#1.base| (store (select .cse5 |c_ULTIMATE.start_main_~datas~0#1.base|) v_threadThread2of2ForFork0_~p~0.offset_21 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~p~0.base) (+ 2 c_threadThread1of2ForFork0_~p~0.offset))))))) is different from false [2024-11-13 12:27:54,985 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ (* |c_ULTIMATE.start_main_#t~post11#1| 4) |c_ULTIMATE.start_main_~datas~0#1.offset| 4)) (.cse1 (+ 3 c_threadThread1of2ForFork0_~p~0.offset))) (and (forall ((v_ArrVal_546 (Array Int Int)) (v_ArrVal_537 (Array Int Int)) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_threadThread2of2ForFork0_~p~0.offset_21 Int)) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse0 (store (store |c_#race| c_threadThread1of2ForFork0_~p~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_537) c_threadThread1of2ForFork0_~p~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_546))) (store .cse0 |c_ULTIMATE.start_main_~datas~0#1.base| (store (select .cse0 |c_ULTIMATE.start_main_~datas~0#1.base|) v_threadThread2of2ForFork0_~p~0.offset_21 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~p~0.base) c_threadThread1of2ForFork0_~p~0.offset)) (< v_threadThread2of2ForFork0_~p~0.offset_21 .cse2))) (forall ((v_ArrVal_546 (Array Int Int)) (v_ArrVal_537 (Array Int Int)) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_threadThread2of2ForFork0_~p~0.offset_21 Int)) (or (< v_threadThread2of2ForFork0_~p~0.offset_21 .cse2) (= (select (select (let ((.cse3 (store (store |c_#race| c_threadThread1of2ForFork0_~p~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_537) c_threadThread1of2ForFork0_~p~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_546))) (store .cse3 |c_ULTIMATE.start_main_~datas~0#1.base| (store (select .cse3 |c_ULTIMATE.start_main_~datas~0#1.base|) v_threadThread2of2ForFork0_~p~0.offset_21 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~p~0.base) .cse1) |c_threadThread1of2ForFork0_#t~nondet4|))) (forall ((v_ArrVal_546 (Array Int Int)) (v_ArrVal_537 (Array Int Int)) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_threadThread2of2ForFork0_~p~0.offset_21 Int)) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse4 (store (store |c_#race| c_threadThread1of2ForFork0_~p~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_537) c_threadThread1of2ForFork0_~p~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_546))) (store .cse4 |c_ULTIMATE.start_main_~datas~0#1.base| (store (select .cse4 |c_ULTIMATE.start_main_~datas~0#1.base|) v_threadThread2of2ForFork0_~p~0.offset_21 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~p~0.base) (+ 2 c_threadThread1of2ForFork0_~p~0.offset))) (< v_threadThread2of2ForFork0_~p~0.offset_21 .cse2))) (forall ((v_ArrVal_546 (Array Int Int)) (v_ArrVal_537 (Array Int Int)) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_threadThread2of2ForFork0_~p~0.offset_21 Int)) (or (< v_threadThread2of2ForFork0_~p~0.offset_21 .cse2) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse5 (store (store |c_#race| c_threadThread1of2ForFork0_~p~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_537) c_threadThread1of2ForFork0_~p~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_546))) (store .cse5 |c_ULTIMATE.start_main_~datas~0#1.base| (store (select .cse5 |c_ULTIMATE.start_main_~datas~0#1.base|) v_threadThread2of2ForFork0_~p~0.offset_21 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~p~0.base) (+ c_threadThread1of2ForFork0_~p~0.offset 1))))))) is different from false [2024-11-13 12:27:55,036 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~datas~0#1.offset| (* |c_ULTIMATE.start_main_~i~0#1| 4) 4)) (.cse2 (+ 3 c_threadThread1of2ForFork0_~p~0.offset))) (and (forall ((v_ArrVal_546 (Array Int Int)) (v_ArrVal_537 (Array Int Int)) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_threadThread2of2ForFork0_~p~0.offset_21 Int)) (or (< v_threadThread2of2ForFork0_~p~0.offset_21 .cse0) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse1 (store (store |c_#race| c_threadThread1of2ForFork0_~p~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_537) c_threadThread1of2ForFork0_~p~0.base) .cse2 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_546))) (store .cse1 |c_ULTIMATE.start_main_~datas~0#1.base| (store (select .cse1 |c_ULTIMATE.start_main_~datas~0#1.base|) v_threadThread2of2ForFork0_~p~0.offset_21 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~p~0.base) (+ 2 c_threadThread1of2ForFork0_~p~0.offset))))) (forall ((v_ArrVal_546 (Array Int Int)) (v_ArrVal_537 (Array Int Int)) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_threadThread2of2ForFork0_~p~0.offset_21 Int)) (or (< v_threadThread2of2ForFork0_~p~0.offset_21 .cse0) (= (select (select (let ((.cse3 (store (store |c_#race| c_threadThread1of2ForFork0_~p~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_537) c_threadThread1of2ForFork0_~p~0.base) .cse2 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_546))) (store .cse3 |c_ULTIMATE.start_main_~datas~0#1.base| (store (select .cse3 |c_ULTIMATE.start_main_~datas~0#1.base|) v_threadThread2of2ForFork0_~p~0.offset_21 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~p~0.base) .cse2) |c_threadThread1of2ForFork0_#t~nondet4|))) (forall ((v_ArrVal_546 (Array Int Int)) (v_ArrVal_537 (Array Int Int)) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_threadThread2of2ForFork0_~p~0.offset_21 Int)) (or (< v_threadThread2of2ForFork0_~p~0.offset_21 .cse0) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse4 (store (store |c_#race| c_threadThread1of2ForFork0_~p~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_537) c_threadThread1of2ForFork0_~p~0.base) .cse2 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_546))) (store .cse4 |c_ULTIMATE.start_main_~datas~0#1.base| (store (select .cse4 |c_ULTIMATE.start_main_~datas~0#1.base|) v_threadThread2of2ForFork0_~p~0.offset_21 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~p~0.base) c_threadThread1of2ForFork0_~p~0.offset)))) (forall ((v_ArrVal_546 (Array Int Int)) (v_ArrVal_537 (Array Int Int)) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_threadThread2of2ForFork0_~p~0.offset_21 Int)) (or (< v_threadThread2of2ForFork0_~p~0.offset_21 .cse0) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse5 (store (store |c_#race| c_threadThread1of2ForFork0_~p~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_537) c_threadThread1of2ForFork0_~p~0.base) .cse2 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_546))) (store .cse5 |c_ULTIMATE.start_main_~datas~0#1.base| (store (select .cse5 |c_ULTIMATE.start_main_~datas~0#1.base|) v_threadThread2of2ForFork0_~p~0.offset_21 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~p~0.base) (+ c_threadThread1of2ForFork0_~p~0.offset 1))))))) is different from false [2024-11-13 12:27:55,209 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (+ 2 c_threadThread1of2ForFork0_~p~0.offset))) (let ((.cse0 (+ |c_ULTIMATE.start_main_~datas~0#1.offset| (* |c_ULTIMATE.start_main_~i~0#1| 4) 4)) (.cse2 (store |c_#race| c_threadThread1of2ForFork0_~p~0.base (store (select |c_#race| c_threadThread1of2ForFork0_~p~0.base) .cse4 |c_threadThread1of2ForFork0_#t~nondet4|))) (.cse3 (+ 3 c_threadThread1of2ForFork0_~p~0.offset))) (and (forall ((v_ArrVal_546 (Array Int Int)) (v_ArrVal_537 (Array Int Int)) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_threadThread2of2ForFork0_~p~0.offset_21 Int)) (or (< v_threadThread2of2ForFork0_~p~0.offset_21 .cse0) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse1 (store (store |c_#race| c_threadThread1of2ForFork0_~p~0.base (store (select (store .cse2 |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_537) c_threadThread1of2ForFork0_~p~0.base) .cse3 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_546))) (store .cse1 |c_ULTIMATE.start_main_~datas~0#1.base| (store (select .cse1 |c_ULTIMATE.start_main_~datas~0#1.base|) v_threadThread2of2ForFork0_~p~0.offset_21 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~p~0.base) .cse4)))) (forall ((v_ArrVal_546 (Array Int Int)) (v_ArrVal_537 (Array Int Int)) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_threadThread2of2ForFork0_~p~0.offset_21 Int)) (or (< v_threadThread2of2ForFork0_~p~0.offset_21 .cse0) (= (select (select (let ((.cse5 (store (store |c_#race| c_threadThread1of2ForFork0_~p~0.base (store (select (store .cse2 |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_537) c_threadThread1of2ForFork0_~p~0.base) .cse3 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_546))) (store .cse5 |c_ULTIMATE.start_main_~datas~0#1.base| (store (select .cse5 |c_ULTIMATE.start_main_~datas~0#1.base|) v_threadThread2of2ForFork0_~p~0.offset_21 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~p~0.base) (+ c_threadThread1of2ForFork0_~p~0.offset 1)) |c_threadThread1of2ForFork0_#t~nondet4|))) (forall ((v_ArrVal_546 (Array Int Int)) (v_ArrVal_537 (Array Int Int)) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_threadThread2of2ForFork0_~p~0.offset_21 Int)) (or (< v_threadThread2of2ForFork0_~p~0.offset_21 .cse0) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse6 (store (store |c_#race| c_threadThread1of2ForFork0_~p~0.base (store (select (store .cse2 |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_537) c_threadThread1of2ForFork0_~p~0.base) .cse3 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_546))) (store .cse6 |c_ULTIMATE.start_main_~datas~0#1.base| (store (select .cse6 |c_ULTIMATE.start_main_~datas~0#1.base|) v_threadThread2of2ForFork0_~p~0.offset_21 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~p~0.base) .cse3)))) (forall ((v_ArrVal_546 (Array Int Int)) (v_ArrVal_537 (Array Int Int)) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_threadThread2of2ForFork0_~p~0.offset_21 Int)) (or (< v_threadThread2of2ForFork0_~p~0.offset_21 .cse0) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse7 (store (store |c_#race| c_threadThread1of2ForFork0_~p~0.base (store (select (store .cse2 |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_537) c_threadThread1of2ForFork0_~p~0.base) .cse3 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_546))) (store .cse7 |c_ULTIMATE.start_main_~datas~0#1.base| (store (select .cse7 |c_ULTIMATE.start_main_~datas~0#1.base|) v_threadThread2of2ForFork0_~p~0.offset_21 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~p~0.base) c_threadThread1of2ForFork0_~p~0.offset))))))) is different from false [2024-11-13 12:27:55,263 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse5 (+ c_threadThread1of2ForFork0_~p~0.offset 1)) (.cse7 (+ 2 c_threadThread1of2ForFork0_~p~0.offset))) (let ((.cse0 (+ |c_ULTIMATE.start_main_~datas~0#1.offset| (* |c_ULTIMATE.start_main_~i~0#1| 4) 4)) (.cse2 (store |c_#race| c_threadThread1of2ForFork0_~p~0.base (store (store (select |c_#race| c_threadThread1of2ForFork0_~p~0.base) .cse5 |c_threadThread1of2ForFork0_#t~nondet4|) .cse7 |c_threadThread1of2ForFork0_#t~nondet4|))) (.cse3 (+ 3 c_threadThread1of2ForFork0_~p~0.offset))) (and (forall ((v_ArrVal_546 (Array Int Int)) (v_ArrVal_537 (Array Int Int)) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_threadThread2of2ForFork0_~p~0.offset_21 Int)) (or (< v_threadThread2of2ForFork0_~p~0.offset_21 .cse0) (= (select (select (let ((.cse1 (store (store |c_#race| c_threadThread1of2ForFork0_~p~0.base (store (select (store .cse2 |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_537) c_threadThread1of2ForFork0_~p~0.base) .cse3 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_546))) (store .cse1 |c_ULTIMATE.start_main_~datas~0#1.base| (store (select .cse1 |c_ULTIMATE.start_main_~datas~0#1.base|) v_threadThread2of2ForFork0_~p~0.offset_21 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~p~0.base) .cse3) |c_threadThread1of2ForFork0_#t~nondet4|))) (forall ((v_ArrVal_546 (Array Int Int)) (v_ArrVal_537 (Array Int Int)) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_threadThread2of2ForFork0_~p~0.offset_21 Int)) (or (< v_threadThread2of2ForFork0_~p~0.offset_21 .cse0) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse4 (store (store |c_#race| c_threadThread1of2ForFork0_~p~0.base (store (select (store .cse2 |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_537) c_threadThread1of2ForFork0_~p~0.base) .cse3 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_546))) (store .cse4 |c_ULTIMATE.start_main_~datas~0#1.base| (store (select .cse4 |c_ULTIMATE.start_main_~datas~0#1.base|) v_threadThread2of2ForFork0_~p~0.offset_21 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~p~0.base) .cse5)))) (forall ((v_ArrVal_546 (Array Int Int)) (v_ArrVal_537 (Array Int Int)) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_threadThread2of2ForFork0_~p~0.offset_21 Int)) (or (< v_threadThread2of2ForFork0_~p~0.offset_21 .cse0) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse6 (store (store |c_#race| c_threadThread1of2ForFork0_~p~0.base (store (select (store .cse2 |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_537) c_threadThread1of2ForFork0_~p~0.base) .cse3 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_546))) (store .cse6 |c_ULTIMATE.start_main_~datas~0#1.base| (store (select .cse6 |c_ULTIMATE.start_main_~datas~0#1.base|) v_threadThread2of2ForFork0_~p~0.offset_21 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~p~0.base) .cse7)))) (forall ((v_ArrVal_546 (Array Int Int)) (v_ArrVal_537 (Array Int Int)) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_threadThread2of2ForFork0_~p~0.offset_21 Int)) (or (< v_threadThread2of2ForFork0_~p~0.offset_21 .cse0) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse8 (store (store |c_#race| c_threadThread1of2ForFork0_~p~0.base (store (select (store .cse2 |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_537) c_threadThread1of2ForFork0_~p~0.base) .cse3 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_546))) (store .cse8 |c_ULTIMATE.start_main_~datas~0#1.base| (store (select .cse8 |c_ULTIMATE.start_main_~datas~0#1.base|) v_threadThread2of2ForFork0_~p~0.offset_21 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~p~0.base) c_threadThread1of2ForFork0_~p~0.offset))))))) is different from false [2024-11-13 12:27:55,318 INFO L349 Elim1Store]: treesize reduction 23, result has 62.9 percent of original size [2024-11-13 12:27:55,318 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 822 treesize of output 636 [2024-11-13 12:27:55,345 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 12:27:55,345 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 360 treesize of output 318 [2024-11-13 12:27:55,365 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 98 [2024-11-13 12:27:55,378 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 203 treesize of output 195 [2024-11-13 12:27:55,625 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 12:27:55,639 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 12:27:55,667 INFO L349 Elim1Store]: treesize reduction 38, result has 38.7 percent of original size [2024-11-13 12:27:55,667 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 282 treesize of output 265 [2024-11-13 12:27:55,675 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 12:27:55,677 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 102 treesize of output 86 [2024-11-13 12:27:55,686 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 40 treesize of output 36 [2024-11-13 12:27:55,724 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 12:27:55,736 INFO L349 Elim1Store]: treesize reduction 61, result has 1.6 percent of original size [2024-11-13 12:27:55,736 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 1 [2024-11-13 12:27:55,742 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 12:27:55,752 INFO L349 Elim1Store]: treesize reduction 61, result has 1.6 percent of original size [2024-11-13 12:27:55,753 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 1 [2024-11-13 12:27:56,002 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 37 not checked. [2024-11-13 12:27:56,003 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [881463803] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 12:27:56,003 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 12:27:56,003 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20, 20] total 53 [2024-11-13 12:27:56,003 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1769396978] [2024-11-13 12:27:56,003 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 12:27:56,004 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 54 states [2024-11-13 12:27:56,004 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 12:27:56,005 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2024-11-13 12:27:56,006 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=237, Invalid=1857, Unknown=8, NotChecked=760, Total=2862 [2024-11-13 12:27:56,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 12:27:56,007 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-13 12:27:56,007 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 54 states, 53 states have (on average 4.09433962264151) internal successors, (217), 54 states have internal predecessors, (217), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 12:27:56,008 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-13 12:27:56,008 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 12:27:56,008 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2024-11-13 12:27:56,008 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 12:27:56,008 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 43 states. [2024-11-13 12:27:56,008 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-13 12:28:01,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 12:28:01,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 12:28:01,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-13 12:28:01,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 12:28:01,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2024-11-13 12:28:01,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2024-11-13 12:28:01,549 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_084b0b24-d5a0-462b-a255-016ec85dabac/bin/ugemcutter-verify-yV71Fz5F0F/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-13 12:28:01,731 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_084b0b24-d5a0-462b-a255-016ec85dabac/bin/ugemcutter-verify-yV71Fz5F0F/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2024-11-13 12:28:01,731 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [threadErr0ASSERT_VIOLATIONDATA_RACE] === [2024-11-13 12:28:01,731 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:28:01,731 INFO L85 PathProgramCache]: Analyzing trace with hash -217222171, now seen corresponding path program 2 times [2024-11-13 12:28:01,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:28:01,731 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1602625916] [2024-11-13 12:28:01,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:28:01,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:28:01,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:28:02,341 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 4 proven. 21 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-13 12:28:02,341 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 12:28:02,341 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1602625916] [2024-11-13 12:28:02,341 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1602625916] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 12:28:02,341 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [660412751] [2024-11-13 12:28:02,341 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-13 12:28:02,341 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 12:28:02,342 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_084b0b24-d5a0-462b-a255-016ec85dabac/bin/ugemcutter-verify-yV71Fz5F0F/z3 [2024-11-13 12:28:02,344 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_084b0b24-d5a0-462b-a255-016ec85dabac/bin/ugemcutter-verify-yV71Fz5F0F/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 12:28:02,346 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_084b0b24-d5a0-462b-a255-016ec85dabac/bin/ugemcutter-verify-yV71Fz5F0F/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-13 12:28:02,488 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-13 12:28:02,488 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-13 12:28:02,490 INFO L255 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 35 conjuncts are in the unsatisfiable core [2024-11-13 12:28:02,494 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 12:28:02,502 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 [2024-11-13 12:28:02,546 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-13 12:28:02,546 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 11 treesize of output 11 [2024-11-13 12:28:02,793 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2024-11-13 12:28:02,834 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 15 [2024-11-13 12:28:02,865 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 [2024-11-13 12:28:02,910 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 12:28:02,910 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 42 [2024-11-13 12:28:02,966 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 12:28:02,966 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 3 case distinctions, treesize of input 52 treesize of output 57 [2024-11-13 12:28:03,020 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 11 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 12:28:03,021 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 12:28:03,171 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_647 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~p~0.base v_ArrVal_647) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| (* |c_ULTIMATE.start_main_~i~0#1| 4))) |c_ULTIMATE.start_main_#t~nondet9#1|)) is different from false [2024-11-13 12:28:03,176 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 12:28:03,177 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 1 case distinctions, treesize of input 26 treesize of output 27 [2024-11-13 12:28:03,179 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 26 treesize of output 18 [2024-11-13 12:28:03,251 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-13 12:28:03,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [660412751] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 12:28:03,251 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 12:28:03,251 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 15, 14] total 29 [2024-11-13 12:28:03,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [987842365] [2024-11-13 12:28:03,251 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 12:28:03,252 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2024-11-13 12:28:03,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 12:28:03,252 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2024-11-13 12:28:03,253 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=648, Unknown=1, NotChecked=52, Total=812 [2024-11-13 12:28:03,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 12:28:03,253 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-13 12:28:03,254 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 4.344827586206897) internal successors, (126), 29 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 12:28:03,254 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-13 12:28:03,254 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 12:28:03,254 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2024-11-13 12:28:03,254 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 12:28:03,254 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 44 states. [2024-11-13 12:28:03,254 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 50 states. [2024-11-13 12:28:03,254 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-13 12:28:04,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 12:28:04,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 12:28:04,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-13 12:28:04,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 12:28:04,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2024-11-13 12:28:04,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2024-11-13 12:28:04,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-11-13 12:28:04,656 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_084b0b24-d5a0-462b-a255-016ec85dabac/bin/ugemcutter-verify-yV71Fz5F0F/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-11-13 12:28:04,836 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_084b0b24-d5a0-462b-a255-016ec85dabac/bin/ugemcutter-verify-yV71Fz5F0F/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2024-11-13 12:28:04,836 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [threadErr0ASSERT_VIOLATIONDATA_RACE] === [2024-11-13 12:28:04,837 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:28:04,837 INFO L85 PathProgramCache]: Analyzing trace with hash 145136851, now seen corresponding path program 3 times [2024-11-13 12:28:04,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:28:04,837 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1159869116] [2024-11-13 12:28:04,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:28:04,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:28:04,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:28:06,402 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 39 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 12:28:06,403 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 12:28:06,403 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1159869116] [2024-11-13 12:28:06,403 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1159869116] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 12:28:06,403 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [66510277] [2024-11-13 12:28:06,403 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-13 12:28:06,403 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 12:28:06,403 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_084b0b24-d5a0-462b-a255-016ec85dabac/bin/ugemcutter-verify-yV71Fz5F0F/z3 [2024-11-13 12:28:06,405 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_084b0b24-d5a0-462b-a255-016ec85dabac/bin/ugemcutter-verify-yV71Fz5F0F/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 12:28:06,405 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_084b0b24-d5a0-462b-a255-016ec85dabac/bin/ugemcutter-verify-yV71Fz5F0F/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-13 12:28:06,574 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-11-13 12:28:06,574 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-13 12:28:06,576 INFO L255 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 52 conjuncts are in the unsatisfiable core [2024-11-13 12:28:06,580 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 12:28:06,587 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 [2024-11-13 12:28:06,601 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-13 12:28:06,602 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 11 treesize of output 11 [2024-11-13 12:28:06,783 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 [2024-11-13 12:28:06,837 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 [2024-11-13 12:28:06,900 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 [2024-11-13 12:28:07,209 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 [2024-11-13 12:28:07,228 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 [2024-11-13 12:28:07,269 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 [2024-11-13 12:28:07,290 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 [2024-11-13 12:28:07,493 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 [2024-11-13 12:28:07,508 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 [2024-11-13 12:28:07,532 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 [2024-11-13 12:28:07,552 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 [2024-11-13 12:28:07,579 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 [2024-11-13 12:28:07,746 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 12:28:07,747 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 12:28:07,749 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 12:28:07,750 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 12:28:07,752 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 12:28:07,752 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 50 treesize of output 47 [2024-11-13 12:28:07,761 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 11 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 12:28:07,761 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 12:28:08,476 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_threadThread2of2ForFork0_~p~0.offset_25 Int) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_762 (Array Int Int))) (or (= (select (select (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_762))) (store .cse0 |c_threadThread2of2ForFork0_#in~arg.base| (store (select .cse0 |c_threadThread2of2ForFork0_#in~arg.base|) v_threadThread2of2ForFork0_~p~0.offset_25 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~p~0.base) (+ 3 c_threadThread1of2ForFork0_~p~0.offset)) |c_threadThread1of2ForFork0_#t~nondet4|) (< v_threadThread2of2ForFork0_~p~0.offset_25 |c_threadThread2of2ForFork0_#in~arg.offset|))) (forall ((v_threadThread2of2ForFork0_~p~0.offset_25 Int) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_762 (Array Int Int))) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse1 (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_762))) (store .cse1 |c_threadThread2of2ForFork0_#in~arg.base| (store (select .cse1 |c_threadThread2of2ForFork0_#in~arg.base|) v_threadThread2of2ForFork0_~p~0.offset_25 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~p~0.base) (+ 2 c_threadThread1of2ForFork0_~p~0.offset))) (< v_threadThread2of2ForFork0_~p~0.offset_25 |c_threadThread2of2ForFork0_#in~arg.offset|))) (forall ((v_threadThread2of2ForFork0_~p~0.offset_25 Int) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_762 (Array Int Int))) (or (= (select (select (let ((.cse2 (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_762))) (store .cse2 |c_threadThread2of2ForFork0_#in~arg.base| (store (select .cse2 |c_threadThread2of2ForFork0_#in~arg.base|) v_threadThread2of2ForFork0_~p~0.offset_25 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~p~0.base) c_threadThread1of2ForFork0_~p~0.offset) |c_threadThread1of2ForFork0_#t~nondet4|) (< v_threadThread2of2ForFork0_~p~0.offset_25 |c_threadThread2of2ForFork0_#in~arg.offset|))) (forall ((v_threadThread2of2ForFork0_~p~0.offset_25 Int) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_762 (Array Int Int))) (or (< v_threadThread2of2ForFork0_~p~0.offset_25 |c_threadThread2of2ForFork0_#in~arg.offset|) (= (select (select (let ((.cse3 (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_762))) (store .cse3 |c_threadThread2of2ForFork0_#in~arg.base| (store (select .cse3 |c_threadThread2of2ForFork0_#in~arg.base|) v_threadThread2of2ForFork0_~p~0.offset_25 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~p~0.base) (+ c_threadThread1of2ForFork0_~p~0.offset 1)) |c_threadThread1of2ForFork0_#t~nondet4|)))) is different from false [2024-11-13 12:28:08,597 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ 3 c_threadThread1of2ForFork0_~p~0.offset))) (let ((.cse1 (store |c_#race| c_threadThread1of2ForFork0_~p~0.base (store (select |c_#race| c_threadThread1of2ForFork0_~p~0.base) .cse2 |c_threadThread1of2ForFork0_#t~nondet4|)))) (and (forall ((v_threadThread2of2ForFork0_~p~0.offset_25 Int) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_762 (Array Int Int))) (or (= (select (select (let ((.cse0 (store .cse1 |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_762))) (store .cse0 |c_threadThread2of2ForFork0_#in~arg.base| (store (select .cse0 |c_threadThread2of2ForFork0_#in~arg.base|) v_threadThread2of2ForFork0_~p~0.offset_25 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~p~0.base) .cse2) |c_threadThread1of2ForFork0_#t~nondet4|) (< v_threadThread2of2ForFork0_~p~0.offset_25 |c_threadThread2of2ForFork0_#in~arg.offset|))) (forall ((v_threadThread2of2ForFork0_~p~0.offset_25 Int) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_762 (Array Int Int))) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse3 (store .cse1 |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_762))) (store .cse3 |c_threadThread2of2ForFork0_#in~arg.base| (store (select .cse3 |c_threadThread2of2ForFork0_#in~arg.base|) v_threadThread2of2ForFork0_~p~0.offset_25 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~p~0.base) (+ c_threadThread1of2ForFork0_~p~0.offset 1))) (< v_threadThread2of2ForFork0_~p~0.offset_25 |c_threadThread2of2ForFork0_#in~arg.offset|))) (forall ((v_threadThread2of2ForFork0_~p~0.offset_25 Int) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_762 (Array Int Int))) (or (< v_threadThread2of2ForFork0_~p~0.offset_25 |c_threadThread2of2ForFork0_#in~arg.offset|) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse4 (store .cse1 |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_762))) (store .cse4 |c_threadThread2of2ForFork0_#in~arg.base| (store (select .cse4 |c_threadThread2of2ForFork0_#in~arg.base|) v_threadThread2of2ForFork0_~p~0.offset_25 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~p~0.base) (+ 2 c_threadThread1of2ForFork0_~p~0.offset))))) (forall ((v_threadThread2of2ForFork0_~p~0.offset_25 Int) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_762 (Array Int Int))) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse5 (store .cse1 |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_762))) (store .cse5 |c_threadThread2of2ForFork0_#in~arg.base| (store (select .cse5 |c_threadThread2of2ForFork0_#in~arg.base|) v_threadThread2of2ForFork0_~p~0.offset_25 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~p~0.base) c_threadThread1of2ForFork0_~p~0.offset)) (< v_threadThread2of2ForFork0_~p~0.offset_25 |c_threadThread2of2ForFork0_#in~arg.offset|)))))) is different from false [2024-11-13 12:28:08,647 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 3 c_threadThread1of2ForFork0_~p~0.offset))) (and (forall ((v_ArrVal_757 (Array Int Int)) (v_threadThread2of2ForFork0_~p~0.offset_25 Int) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_762 (Array Int Int))) (or (= (select (select (let ((.cse0 (store (store |c_#race| c_threadThread1of2ForFork0_~p~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_757) c_threadThread1of2ForFork0_~p~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_762))) (store .cse0 |c_threadThread2of2ForFork0_#in~arg.base| (store (select .cse0 |c_threadThread2of2ForFork0_#in~arg.base|) v_threadThread2of2ForFork0_~p~0.offset_25 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~p~0.base) (+ 2 c_threadThread1of2ForFork0_~p~0.offset)) |c_threadThread1of2ForFork0_#t~nondet4|) (< v_threadThread2of2ForFork0_~p~0.offset_25 |c_threadThread2of2ForFork0_#in~arg.offset|))) (forall ((v_ArrVal_757 (Array Int Int)) (v_threadThread2of2ForFork0_~p~0.offset_25 Int) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_762 (Array Int Int))) (or (= (select (select (let ((.cse2 (store (store |c_#race| c_threadThread1of2ForFork0_~p~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_757) c_threadThread1of2ForFork0_~p~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_762))) (store .cse2 |c_threadThread2of2ForFork0_#in~arg.base| (store (select .cse2 |c_threadThread2of2ForFork0_#in~arg.base|) v_threadThread2of2ForFork0_~p~0.offset_25 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~p~0.base) (+ c_threadThread1of2ForFork0_~p~0.offset 1)) |c_threadThread1of2ForFork0_#t~nondet4|) (< v_threadThread2of2ForFork0_~p~0.offset_25 |c_threadThread2of2ForFork0_#in~arg.offset|))) (forall ((v_ArrVal_757 (Array Int Int)) (v_threadThread2of2ForFork0_~p~0.offset_25 Int) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_762 (Array Int Int))) (or (< v_threadThread2of2ForFork0_~p~0.offset_25 |c_threadThread2of2ForFork0_#in~arg.offset|) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse3 (store (store |c_#race| c_threadThread1of2ForFork0_~p~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_757) c_threadThread1of2ForFork0_~p~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_762))) (store .cse3 |c_threadThread2of2ForFork0_#in~arg.base| (store (select .cse3 |c_threadThread2of2ForFork0_#in~arg.base|) v_threadThread2of2ForFork0_~p~0.offset_25 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~p~0.base) .cse1)))) (forall ((v_ArrVal_757 (Array Int Int)) (v_threadThread2of2ForFork0_~p~0.offset_25 Int) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_762 (Array Int Int))) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse4 (store (store |c_#race| c_threadThread1of2ForFork0_~p~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_757) c_threadThread1of2ForFork0_~p~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_762))) (store .cse4 |c_threadThread2of2ForFork0_#in~arg.base| (store (select .cse4 |c_threadThread2of2ForFork0_#in~arg.base|) v_threadThread2of2ForFork0_~p~0.offset_25 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~p~0.base) c_threadThread1of2ForFork0_~p~0.offset)) (< v_threadThread2of2ForFork0_~p~0.offset_25 |c_threadThread2of2ForFork0_#in~arg.offset|))))) is different from false [2024-11-13 12:28:09,459 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~datas~0#1.offset| (* |c_ULTIMATE.start_main_~i~0#1| 4))) (.cse2 (+ 3 c_threadThread1of2ForFork0_~p~0.offset))) (and (forall ((v_ArrVal_757 (Array Int Int)) (v_threadThread2of2ForFork0_~p~0.offset_25 Int) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_762 (Array Int Int))) (or (< v_threadThread2of2ForFork0_~p~0.offset_25 .cse0) (= (select (select (let ((.cse1 (store (store |c_#race| c_threadThread1of2ForFork0_~p~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_757) c_threadThread1of2ForFork0_~p~0.base) .cse2 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_762))) (store .cse1 |c_ULTIMATE.start_main_~datas~0#1.base| (store (select .cse1 |c_ULTIMATE.start_main_~datas~0#1.base|) v_threadThread2of2ForFork0_~p~0.offset_25 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~p~0.base) .cse2) |c_threadThread1of2ForFork0_#t~nondet4|))) (forall ((v_ArrVal_757 (Array Int Int)) (v_threadThread2of2ForFork0_~p~0.offset_25 Int) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_762 (Array Int Int))) (or (< v_threadThread2of2ForFork0_~p~0.offset_25 .cse0) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse3 (store (store |c_#race| c_threadThread1of2ForFork0_~p~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_757) c_threadThread1of2ForFork0_~p~0.base) .cse2 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_762))) (store .cse3 |c_ULTIMATE.start_main_~datas~0#1.base| (store (select .cse3 |c_ULTIMATE.start_main_~datas~0#1.base|) v_threadThread2of2ForFork0_~p~0.offset_25 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~p~0.base) c_threadThread1of2ForFork0_~p~0.offset)))) (forall ((v_ArrVal_757 (Array Int Int)) (v_threadThread2of2ForFork0_~p~0.offset_25 Int) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_762 (Array Int Int))) (or (< v_threadThread2of2ForFork0_~p~0.offset_25 .cse0) (= (select (select (let ((.cse4 (store (store |c_#race| c_threadThread1of2ForFork0_~p~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_757) c_threadThread1of2ForFork0_~p~0.base) .cse2 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_762))) (store .cse4 |c_ULTIMATE.start_main_~datas~0#1.base| (store (select .cse4 |c_ULTIMATE.start_main_~datas~0#1.base|) v_threadThread2of2ForFork0_~p~0.offset_25 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~p~0.base) (+ c_threadThread1of2ForFork0_~p~0.offset 1)) |c_threadThread1of2ForFork0_#t~nondet4|))) (forall ((v_ArrVal_757 (Array Int Int)) (v_threadThread2of2ForFork0_~p~0.offset_25 Int) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_762 (Array Int Int))) (or (< v_threadThread2of2ForFork0_~p~0.offset_25 .cse0) (= (select (select (let ((.cse5 (store (store |c_#race| c_threadThread1of2ForFork0_~p~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_757) c_threadThread1of2ForFork0_~p~0.base) .cse2 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_762))) (store .cse5 |c_ULTIMATE.start_main_~datas~0#1.base| (store (select .cse5 |c_ULTIMATE.start_main_~datas~0#1.base|) v_threadThread2of2ForFork0_~p~0.offset_25 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~p~0.base) (+ 2 c_threadThread1of2ForFork0_~p~0.offset)) |c_threadThread1of2ForFork0_#t~nondet4|))))) is different from false [2024-11-13 12:28:10,047 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 3 c_threadThread1of2ForFork0_~p~0.offset)) (.cse2 (+ (* |c_ULTIMATE.start_main_#t~post11#1| 4) |c_ULTIMATE.start_main_~datas~0#1.offset| 4))) (and (forall ((v_ArrVal_757 (Array Int Int)) (v_threadThread2of2ForFork0_~p~0.offset_25 Int) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_762 (Array Int Int))) (or (= (select (select (let ((.cse0 (store (store |c_#race| c_threadThread1of2ForFork0_~p~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_757) c_threadThread1of2ForFork0_~p~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_762))) (store .cse0 |c_ULTIMATE.start_main_~datas~0#1.base| (store (select .cse0 |c_ULTIMATE.start_main_~datas~0#1.base|) v_threadThread2of2ForFork0_~p~0.offset_25 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~p~0.base) (+ 2 c_threadThread1of2ForFork0_~p~0.offset)) |c_threadThread1of2ForFork0_#t~nondet4|) (< v_threadThread2of2ForFork0_~p~0.offset_25 .cse2))) (forall ((v_ArrVal_757 (Array Int Int)) (v_threadThread2of2ForFork0_~p~0.offset_25 Int) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_762 (Array Int Int))) (or (< v_threadThread2of2ForFork0_~p~0.offset_25 .cse2) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse3 (store (store |c_#race| c_threadThread1of2ForFork0_~p~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_757) c_threadThread1of2ForFork0_~p~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_762))) (store .cse3 |c_ULTIMATE.start_main_~datas~0#1.base| (store (select .cse3 |c_ULTIMATE.start_main_~datas~0#1.base|) v_threadThread2of2ForFork0_~p~0.offset_25 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~p~0.base) c_threadThread1of2ForFork0_~p~0.offset)))) (forall ((v_ArrVal_757 (Array Int Int)) (v_threadThread2of2ForFork0_~p~0.offset_25 Int) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_762 (Array Int Int))) (or (= (select (select (let ((.cse4 (store (store |c_#race| c_threadThread1of2ForFork0_~p~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_757) c_threadThread1of2ForFork0_~p~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_762))) (store .cse4 |c_ULTIMATE.start_main_~datas~0#1.base| (store (select .cse4 |c_ULTIMATE.start_main_~datas~0#1.base|) v_threadThread2of2ForFork0_~p~0.offset_25 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~p~0.base) .cse1) |c_threadThread1of2ForFork0_#t~nondet4|) (< v_threadThread2of2ForFork0_~p~0.offset_25 .cse2))) (forall ((v_ArrVal_757 (Array Int Int)) (v_threadThread2of2ForFork0_~p~0.offset_25 Int) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_762 (Array Int Int))) (or (= (select (select (let ((.cse5 (store (store |c_#race| c_threadThread1of2ForFork0_~p~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_757) c_threadThread1of2ForFork0_~p~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_762))) (store .cse5 |c_ULTIMATE.start_main_~datas~0#1.base| (store (select .cse5 |c_ULTIMATE.start_main_~datas~0#1.base|) v_threadThread2of2ForFork0_~p~0.offset_25 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~p~0.base) (+ c_threadThread1of2ForFork0_~p~0.offset 1)) |c_threadThread1of2ForFork0_#t~nondet4|) (< v_threadThread2of2ForFork0_~p~0.offset_25 .cse2))))) is different from false [2024-11-13 12:28:10,105 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 3 c_threadThread1of2ForFork0_~p~0.offset)) (.cse2 (+ |c_ULTIMATE.start_main_~datas~0#1.offset| (* |c_ULTIMATE.start_main_~i~0#1| 4) 4))) (and (forall ((v_ArrVal_757 (Array Int Int)) (v_threadThread2of2ForFork0_~p~0.offset_25 Int) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_762 (Array Int Int))) (or (= (select (select (let ((.cse0 (store (store |c_#race| c_threadThread1of2ForFork0_~p~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_757) c_threadThread1of2ForFork0_~p~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_762))) (store .cse0 |c_ULTIMATE.start_main_~datas~0#1.base| (store (select .cse0 |c_ULTIMATE.start_main_~datas~0#1.base|) v_threadThread2of2ForFork0_~p~0.offset_25 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~p~0.base) .cse1) |c_threadThread1of2ForFork0_#t~nondet4|) (< v_threadThread2of2ForFork0_~p~0.offset_25 .cse2))) (forall ((v_ArrVal_757 (Array Int Int)) (v_threadThread2of2ForFork0_~p~0.offset_25 Int) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_762 (Array Int Int))) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse3 (store (store |c_#race| c_threadThread1of2ForFork0_~p~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_757) c_threadThread1of2ForFork0_~p~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_762))) (store .cse3 |c_ULTIMATE.start_main_~datas~0#1.base| (store (select .cse3 |c_ULTIMATE.start_main_~datas~0#1.base|) v_threadThread2of2ForFork0_~p~0.offset_25 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~p~0.base) c_threadThread1of2ForFork0_~p~0.offset)) (< v_threadThread2of2ForFork0_~p~0.offset_25 .cse2))) (forall ((v_ArrVal_757 (Array Int Int)) (v_threadThread2of2ForFork0_~p~0.offset_25 Int) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_762 (Array Int Int))) (or (= (select (select (let ((.cse4 (store (store |c_#race| c_threadThread1of2ForFork0_~p~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_757) c_threadThread1of2ForFork0_~p~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_762))) (store .cse4 |c_ULTIMATE.start_main_~datas~0#1.base| (store (select .cse4 |c_ULTIMATE.start_main_~datas~0#1.base|) v_threadThread2of2ForFork0_~p~0.offset_25 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~p~0.base) (+ 2 c_threadThread1of2ForFork0_~p~0.offset)) |c_threadThread1of2ForFork0_#t~nondet4|) (< v_threadThread2of2ForFork0_~p~0.offset_25 .cse2))) (forall ((v_ArrVal_757 (Array Int Int)) (v_threadThread2of2ForFork0_~p~0.offset_25 Int) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_762 (Array Int Int))) (or (= (select (select (let ((.cse5 (store (store |c_#race| c_threadThread1of2ForFork0_~p~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_757) c_threadThread1of2ForFork0_~p~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_762))) (store .cse5 |c_ULTIMATE.start_main_~datas~0#1.base| (store (select .cse5 |c_ULTIMATE.start_main_~datas~0#1.base|) v_threadThread2of2ForFork0_~p~0.offset_25 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~p~0.base) (+ c_threadThread1of2ForFork0_~p~0.offset 1)) |c_threadThread1of2ForFork0_#t~nondet4|) (< v_threadThread2of2ForFork0_~p~0.offset_25 .cse2))))) is different from false [2024-11-13 12:28:10,280 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse6 (+ 2 c_threadThread1of2ForFork0_~p~0.offset))) (let ((.cse1 (store |c_#race| c_threadThread1of2ForFork0_~p~0.base (store (select |c_#race| c_threadThread1of2ForFork0_~p~0.base) .cse6 |c_threadThread1of2ForFork0_#t~nondet4|))) (.cse2 (+ 3 c_threadThread1of2ForFork0_~p~0.offset)) (.cse3 (+ |c_ULTIMATE.start_main_~datas~0#1.offset| (* |c_ULTIMATE.start_main_~i~0#1| 4) 4))) (and (forall ((v_ArrVal_757 (Array Int Int)) (v_threadThread2of2ForFork0_~p~0.offset_25 Int) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_762 (Array Int Int))) (or (= (select (select (let ((.cse0 (store (store |c_#race| c_threadThread1of2ForFork0_~p~0.base (store (select (store .cse1 |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_757) c_threadThread1of2ForFork0_~p~0.base) .cse2 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_762))) (store .cse0 |c_ULTIMATE.start_main_~datas~0#1.base| (store (select .cse0 |c_ULTIMATE.start_main_~datas~0#1.base|) v_threadThread2of2ForFork0_~p~0.offset_25 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~p~0.base) c_threadThread1of2ForFork0_~p~0.offset) |c_threadThread1of2ForFork0_#t~nondet4|) (< v_threadThread2of2ForFork0_~p~0.offset_25 .cse3))) (forall ((v_ArrVal_757 (Array Int Int)) (v_threadThread2of2ForFork0_~p~0.offset_25 Int) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_762 (Array Int Int))) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse4 (store (store |c_#race| c_threadThread1of2ForFork0_~p~0.base (store (select (store .cse1 |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_757) c_threadThread1of2ForFork0_~p~0.base) .cse2 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_762))) (store .cse4 |c_ULTIMATE.start_main_~datas~0#1.base| (store (select .cse4 |c_ULTIMATE.start_main_~datas~0#1.base|) v_threadThread2of2ForFork0_~p~0.offset_25 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~p~0.base) .cse2)) (< v_threadThread2of2ForFork0_~p~0.offset_25 .cse3))) (forall ((v_ArrVal_757 (Array Int Int)) (v_threadThread2of2ForFork0_~p~0.offset_25 Int) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_762 (Array Int Int))) (or (= (select (select (let ((.cse5 (store (store |c_#race| c_threadThread1of2ForFork0_~p~0.base (store (select (store .cse1 |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_757) c_threadThread1of2ForFork0_~p~0.base) .cse2 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_762))) (store .cse5 |c_ULTIMATE.start_main_~datas~0#1.base| (store (select .cse5 |c_ULTIMATE.start_main_~datas~0#1.base|) v_threadThread2of2ForFork0_~p~0.offset_25 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~p~0.base) .cse6) |c_threadThread1of2ForFork0_#t~nondet4|) (< v_threadThread2of2ForFork0_~p~0.offset_25 .cse3))) (forall ((v_ArrVal_757 (Array Int Int)) (v_threadThread2of2ForFork0_~p~0.offset_25 Int) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_762 (Array Int Int))) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse7 (store (store |c_#race| c_threadThread1of2ForFork0_~p~0.base (store (select (store .cse1 |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_757) c_threadThread1of2ForFork0_~p~0.base) .cse2 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_762))) (store .cse7 |c_ULTIMATE.start_main_~datas~0#1.base| (store (select .cse7 |c_ULTIMATE.start_main_~datas~0#1.base|) v_threadThread2of2ForFork0_~p~0.offset_25 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~p~0.base) (+ c_threadThread1of2ForFork0_~p~0.offset 1))) (< v_threadThread2of2ForFork0_~p~0.offset_25 .cse3)))))) is different from false [2024-11-13 12:28:10,336 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse7 (+ c_threadThread1of2ForFork0_~p~0.offset 1)) (.cse5 (+ 2 c_threadThread1of2ForFork0_~p~0.offset))) (let ((.cse1 (store |c_#race| c_threadThread1of2ForFork0_~p~0.base (store (store (select |c_#race| c_threadThread1of2ForFork0_~p~0.base) .cse7 |c_threadThread1of2ForFork0_#t~nondet4|) .cse5 |c_threadThread1of2ForFork0_#t~nondet4|))) (.cse2 (+ 3 c_threadThread1of2ForFork0_~p~0.offset)) (.cse3 (+ |c_ULTIMATE.start_main_~datas~0#1.offset| (* |c_ULTIMATE.start_main_~i~0#1| 4) 4))) (and (forall ((v_ArrVal_757 (Array Int Int)) (v_threadThread2of2ForFork0_~p~0.offset_25 Int) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_762 (Array Int Int))) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse0 (store (store |c_#race| c_threadThread1of2ForFork0_~p~0.base (store (select (store .cse1 |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_757) c_threadThread1of2ForFork0_~p~0.base) .cse2 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_762))) (store .cse0 |c_ULTIMATE.start_main_~datas~0#1.base| (store (select .cse0 |c_ULTIMATE.start_main_~datas~0#1.base|) v_threadThread2of2ForFork0_~p~0.offset_25 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~p~0.base) .cse2)) (< v_threadThread2of2ForFork0_~p~0.offset_25 .cse3))) (forall ((v_ArrVal_757 (Array Int Int)) (v_threadThread2of2ForFork0_~p~0.offset_25 Int) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_762 (Array Int Int))) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse4 (store (store |c_#race| c_threadThread1of2ForFork0_~p~0.base (store (select (store .cse1 |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_757) c_threadThread1of2ForFork0_~p~0.base) .cse2 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_762))) (store .cse4 |c_ULTIMATE.start_main_~datas~0#1.base| (store (select .cse4 |c_ULTIMATE.start_main_~datas~0#1.base|) v_threadThread2of2ForFork0_~p~0.offset_25 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~p~0.base) .cse5)) (< v_threadThread2of2ForFork0_~p~0.offset_25 .cse3))) (forall ((v_ArrVal_757 (Array Int Int)) (v_threadThread2of2ForFork0_~p~0.offset_25 Int) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_762 (Array Int Int))) (or (< v_threadThread2of2ForFork0_~p~0.offset_25 .cse3) (= (select (select (let ((.cse6 (store (store |c_#race| c_threadThread1of2ForFork0_~p~0.base (store (select (store .cse1 |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_757) c_threadThread1of2ForFork0_~p~0.base) .cse2 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_762))) (store .cse6 |c_ULTIMATE.start_main_~datas~0#1.base| (store (select .cse6 |c_ULTIMATE.start_main_~datas~0#1.base|) v_threadThread2of2ForFork0_~p~0.offset_25 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~p~0.base) .cse7) |c_threadThread1of2ForFork0_#t~nondet4|))) (forall ((v_ArrVal_757 (Array Int Int)) (v_threadThread2of2ForFork0_~p~0.offset_25 Int) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_762 (Array Int Int))) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse8 (store (store |c_#race| c_threadThread1of2ForFork0_~p~0.base (store (select (store .cse1 |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_757) c_threadThread1of2ForFork0_~p~0.base) .cse2 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_762))) (store .cse8 |c_ULTIMATE.start_main_~datas~0#1.base| (store (select .cse8 |c_ULTIMATE.start_main_~datas~0#1.base|) v_threadThread2of2ForFork0_~p~0.offset_25 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~p~0.base) c_threadThread1of2ForFork0_~p~0.offset)) (< v_threadThread2of2ForFork0_~p~0.offset_25 .cse3)))))) is different from false [2024-11-13 12:28:10,393 INFO L349 Elim1Store]: treesize reduction 23, result has 62.9 percent of original size [2024-11-13 12:28:10,393 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 406 treesize of output 332 [2024-11-13 12:28:10,422 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 12:28:10,422 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 360 treesize of output 318 [2024-11-13 12:28:10,439 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 200 treesize of output 192 [2024-11-13 12:28:10,453 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 129 treesize of output 127 [2024-11-13 12:28:10,797 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 12:28:10,801 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 12:28:10,819 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 12:28:10,856 INFO L349 Elim1Store]: treesize reduction 38, result has 38.7 percent of original size [2024-11-13 12:28:10,857 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 260 treesize of output 191 [2024-11-13 12:28:10,870 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 12:28:10,873 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 142 treesize of output 118 [2024-11-13 12:28:10,886 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 69 treesize of output 65 [2024-11-13 12:28:10,922 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 12:28:10,945 INFO L349 Elim1Store]: treesize reduction 38, result has 38.7 percent of original size [2024-11-13 12:28:10,946 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 136 treesize of output 139 [2024-11-13 12:28:10,952 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 12:28:10,955 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 92 treesize of output 76 [2024-11-13 12:28:10,960 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 12:28:10,988 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 12:28:10,998 INFO L349 Elim1Store]: treesize reduction 61, result has 1.6 percent of original size [2024-11-13 12:28:10,999 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 260 treesize of output 1 [2024-11-13 12:28:11,288 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 37 not checked. [2024-11-13 12:28:11,289 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [66510277] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 12:28:11,289 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 12:28:11,289 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 19, 20] total 44 [2024-11-13 12:28:11,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1033932156] [2024-11-13 12:28:11,289 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 12:28:11,290 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2024-11-13 12:28:11,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 12:28:11,290 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2024-11-13 12:28:11,291 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=169, Invalid=1187, Unknown=8, NotChecked=616, Total=1980 [2024-11-13 12:28:11,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 12:28:11,292 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-13 12:28:11,294 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 44 states have (on average 3.9545454545454546) internal successors, (174), 45 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 12:28:11,294 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-13 12:28:11,295 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 12:28:11,295 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2024-11-13 12:28:11,295 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 12:28:11,295 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 44 states. [2024-11-13 12:28:11,295 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 50 states. [2024-11-13 12:28:11,295 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 25 states. [2024-11-13 12:28:11,295 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-13 12:28:17,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 12:28:17,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 12:28:17,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-13 12:28:17,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 12:28:17,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2024-11-13 12:28:17,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2024-11-13 12:28:17,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-11-13 12:28:17,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2024-11-13 12:28:17,397 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_084b0b24-d5a0-462b-a255-016ec85dabac/bin/ugemcutter-verify-yV71Fz5F0F/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-11-13 12:28:17,581 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_084b0b24-d5a0-462b-a255-016ec85dabac/bin/ugemcutter-verify-yV71Fz5F0F/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 12:28:17,581 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [threadErr0ASSERT_VIOLATIONDATA_RACE] === [2024-11-13 12:28:17,581 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:28:17,582 INFO L85 PathProgramCache]: Analyzing trace with hash 1130213679, now seen corresponding path program 4 times [2024-11-13 12:28:17,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:28:17,582 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [992059725] [2024-11-13 12:28:17,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:28:17,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:28:17,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:28:19,008 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 39 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 12:28:19,008 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 12:28:19,009 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [992059725] [2024-11-13 12:28:19,009 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [992059725] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 12:28:19,009 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1452570114] [2024-11-13 12:28:19,009 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-13 12:28:19,009 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 12:28:19,009 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_084b0b24-d5a0-462b-a255-016ec85dabac/bin/ugemcutter-verify-yV71Fz5F0F/z3 [2024-11-13 12:28:19,010 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_084b0b24-d5a0-462b-a255-016ec85dabac/bin/ugemcutter-verify-yV71Fz5F0F/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 12:28:19,011 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_084b0b24-d5a0-462b-a255-016ec85dabac/bin/ugemcutter-verify-yV71Fz5F0F/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-13 12:28:19,293 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-13 12:28:19,293 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-13 12:28:19,296 INFO L255 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 75 conjuncts are in the unsatisfiable core [2024-11-13 12:28:19,299 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 12:28:19,302 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 [2024-11-13 12:28:19,360 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-13 12:28:19,361 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 11 treesize of output 11 [2024-11-13 12:28:19,855 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 [2024-11-13 12:28:19,923 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 [2024-11-13 12:28:20,001 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 [2024-11-13 12:28:20,519 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 31 [2024-11-13 12:28:20,553 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 42 [2024-11-13 12:28:20,669 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 45 [2024-11-13 12:28:20,711 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 53 [2024-11-13 12:28:21,464 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 56 [2024-11-13 12:28:21,503 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 12:28:21,504 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 67 [2024-11-13 12:28:21,645 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 12:28:21,646 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 10 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 70 [2024-11-13 12:28:21,685 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 12:28:21,687 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 12:28:21,688 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 10 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 78 [2024-11-13 12:28:30,414 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 12:28:30,416 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 12:28:30,417 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 12:28:30,417 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 12:28:30,418 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 12:28:30,419 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 13 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 81 [2024-11-13 12:28:48,568 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 12:28:48,569 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 12:28:48,570 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 13 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 88 [2024-11-13 12:28:48,684 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 39 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 12:28:48,684 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 12:30:16,593 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse9 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (let ((.cse3 (+ |c_ULTIMATE.start_main_~i~0#1| 1)) (.cse1 (store (select |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse9 3) |c_ULTIMATE.start_main_#t~nondet9#1|)) (.cse4 (+ |c_ULTIMATE.start_main_~datas~0#1.offset| .cse9))) (and (forall ((v_ArrVal_874 Int) (v_threadThread2of2ForFork0_~p~0.offset_27 Int) (|v_ULTIMATE.start_main_~i~0#1_39| Int) (v_ArrVal_872 Int) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_subst_3 Int)) (or (= (select (select (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| (let ((.cse2 (* |v_ULTIMATE.start_main_~i~0#1_39| 4))) (store (store (store (store .cse1 (+ .cse2 |c_ULTIMATE.start_main_~tids~0#1.offset|) v_ArrVal_872) (+ .cse2 |c_ULTIMATE.start_main_~tids~0#1.offset| 1) v_subst_3) (+ .cse2 |c_ULTIMATE.start_main_~tids~0#1.offset| 2) v_ArrVal_874) (+ .cse2 |c_ULTIMATE.start_main_~tids~0#1.offset| 3) v_subst_3))))) (store .cse0 |c_ULTIMATE.start_main_~datas~0#1.base| (store (select .cse0 |c_ULTIMATE.start_main_~datas~0#1.base|) v_threadThread2of2ForFork0_~p~0.offset_27 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~p~0.base) (+ c_threadThread1of2ForFork0_~p~0.offset 1)) |c_threadThread1of2ForFork0_#t~nondet4|) (< |v_ULTIMATE.start_main_~i~0#1_39| .cse3) (< v_threadThread2of2ForFork0_~p~0.offset_27 .cse4))) (forall ((v_ArrVal_874 Int) (v_threadThread2of2ForFork0_~p~0.offset_27 Int) (|v_ULTIMATE.start_main_~i~0#1_39| Int) (v_ArrVal_872 Int) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_subst_2 Int)) (or (< |v_ULTIMATE.start_main_~i~0#1_39| .cse3) (= (select (select (let ((.cse5 (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| (let ((.cse6 (* |v_ULTIMATE.start_main_~i~0#1_39| 4))) (store (store (store (store .cse1 (+ .cse6 |c_ULTIMATE.start_main_~tids~0#1.offset|) v_ArrVal_872) (+ .cse6 |c_ULTIMATE.start_main_~tids~0#1.offset| 1) v_subst_2) (+ .cse6 |c_ULTIMATE.start_main_~tids~0#1.offset| 2) v_ArrVal_874) (+ .cse6 |c_ULTIMATE.start_main_~tids~0#1.offset| 3) v_subst_2))))) (store .cse5 |c_ULTIMATE.start_main_~datas~0#1.base| (store (select .cse5 |c_ULTIMATE.start_main_~datas~0#1.base|) v_threadThread2of2ForFork0_~p~0.offset_27 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~p~0.base) (+ 2 c_threadThread1of2ForFork0_~p~0.offset)) |c_threadThread1of2ForFork0_#t~nondet4|) (< v_threadThread2of2ForFork0_~p~0.offset_27 .cse4))) (forall ((v_ArrVal_874 Int) (v_threadThread2of2ForFork0_~p~0.offset_27 Int) (|v_ULTIMATE.start_main_~i~0#1_39| Int) (v_ArrVal_872 Int) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_subst_1 Int)) (or (< |v_ULTIMATE.start_main_~i~0#1_39| .cse3) (= (select (select (let ((.cse7 (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| (let ((.cse8 (* |v_ULTIMATE.start_main_~i~0#1_39| 4))) (store (store (store (store .cse1 (+ .cse8 |c_ULTIMATE.start_main_~tids~0#1.offset|) v_ArrVal_872) (+ .cse8 |c_ULTIMATE.start_main_~tids~0#1.offset| 1) v_subst_1) (+ .cse8 |c_ULTIMATE.start_main_~tids~0#1.offset| 2) v_ArrVal_874) (+ .cse8 |c_ULTIMATE.start_main_~tids~0#1.offset| 3) v_subst_1))))) (store .cse7 |c_ULTIMATE.start_main_~datas~0#1.base| (store (select .cse7 |c_ULTIMATE.start_main_~datas~0#1.base|) v_threadThread2of2ForFork0_~p~0.offset_27 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~p~0.base) c_threadThread1of2ForFork0_~p~0.offset) |c_threadThread1of2ForFork0_#t~nondet4|) (< v_threadThread2of2ForFork0_~p~0.offset_27 .cse4)))))) is different from false [2024-11-13 12:34:59,407 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse6 (+ 2 c_threadThread1of2ForFork0_~p~0.offset))) (let ((.cse3 (store |c_#race| c_threadThread1of2ForFork0_~p~0.base (store (select |c_#race| c_threadThread1of2ForFork0_~p~0.base) .cse6 |c_threadThread1of2ForFork0_#t~nondet4|)))) (let ((.cse4 (select .cse3 |c_ULTIMATE.start_main_~tids~0#1.base|)) (.cse1 (+ |c_ULTIMATE.start_main_~i~0#1| 1))) (and (forall ((v_ArrVal_874 Int) (v_threadThread2of2ForFork0_~p~0.offset_27 Int) (|v_ULTIMATE.start_main_~i~0#1_39| Int) (v_ArrVal_872 Int) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_868 Int) (|v_ULTIMATE.start_main_~i~0#1_40| Int) (v_subst_2 Int) (v_ArrVal_866 Int) (|ULTIMATE.start_main_#t~nondet9#1| Int)) (let ((.cse0 (* |v_ULTIMATE.start_main_~i~0#1_40| 4))) (or (< v_threadThread2of2ForFork0_~p~0.offset_27 (+ |c_ULTIMATE.start_main_~datas~0#1.offset| .cse0)) (< |v_ULTIMATE.start_main_~i~0#1_39| (+ |v_ULTIMATE.start_main_~i~0#1_40| 1)) (< |v_ULTIMATE.start_main_~i~0#1_40| .cse1) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse2 (store .cse3 |c_ULTIMATE.start_main_~tids~0#1.base| (let ((.cse5 (* |v_ULTIMATE.start_main_~i~0#1_39| 4))) (store (store (store (store (store (store (store (store .cse4 (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse0) v_ArrVal_866) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse0 1) |ULTIMATE.start_main_#t~nondet9#1|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| 2 .cse0) v_ArrVal_868) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| 3 .cse0) |ULTIMATE.start_main_#t~nondet9#1|) (+ .cse5 |c_ULTIMATE.start_main_~tids~0#1.offset|) v_ArrVal_872) (+ .cse5 |c_ULTIMATE.start_main_~tids~0#1.offset| 1) v_subst_2) (+ .cse5 |c_ULTIMATE.start_main_~tids~0#1.offset| 2) v_ArrVal_874) (+ .cse5 |c_ULTIMATE.start_main_~tids~0#1.offset| 3) v_subst_2))))) (store .cse2 |c_ULTIMATE.start_main_~datas~0#1.base| (store (select .cse2 |c_ULTIMATE.start_main_~datas~0#1.base|) v_threadThread2of2ForFork0_~p~0.offset_27 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~p~0.base) .cse6))))) (forall ((v_ArrVal_874 Int) (v_threadThread2of2ForFork0_~p~0.offset_27 Int) (|v_ULTIMATE.start_main_~i~0#1_39| Int) (v_ArrVal_872 Int) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_868 Int) (v_subst_3 Int) (|v_ULTIMATE.start_main_~i~0#1_40| Int) (v_ArrVal_866 Int) (|ULTIMATE.start_main_#t~nondet9#1| Int)) (let ((.cse7 (* |v_ULTIMATE.start_main_~i~0#1_40| 4))) (or (< v_threadThread2of2ForFork0_~p~0.offset_27 (+ |c_ULTIMATE.start_main_~datas~0#1.offset| .cse7)) (< |v_ULTIMATE.start_main_~i~0#1_39| (+ |v_ULTIMATE.start_main_~i~0#1_40| 1)) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse8 (store .cse3 |c_ULTIMATE.start_main_~tids~0#1.base| (let ((.cse9 (* |v_ULTIMATE.start_main_~i~0#1_39| 4))) (store (store (store (store (store (store (store (store .cse4 (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse7) v_ArrVal_866) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse7 1) |ULTIMATE.start_main_#t~nondet9#1|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| 2 .cse7) v_ArrVal_868) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| 3 .cse7) |ULTIMATE.start_main_#t~nondet9#1|) (+ .cse9 |c_ULTIMATE.start_main_~tids~0#1.offset|) v_ArrVal_872) (+ .cse9 |c_ULTIMATE.start_main_~tids~0#1.offset| 1) v_subst_3) (+ .cse9 |c_ULTIMATE.start_main_~tids~0#1.offset| 2) v_ArrVal_874) (+ .cse9 |c_ULTIMATE.start_main_~tids~0#1.offset| 3) v_subst_3))))) (store .cse8 |c_ULTIMATE.start_main_~datas~0#1.base| (store (select .cse8 |c_ULTIMATE.start_main_~datas~0#1.base|) v_threadThread2of2ForFork0_~p~0.offset_27 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~p~0.base) (+ c_threadThread1of2ForFork0_~p~0.offset 1))) (< |v_ULTIMATE.start_main_~i~0#1_40| .cse1)))) (forall ((v_ArrVal_874 Int) (v_threadThread2of2ForFork0_~p~0.offset_27 Int) (|v_ULTIMATE.start_main_~i~0#1_39| Int) (v_ArrVal_872 Int) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_868 Int) (|v_ULTIMATE.start_main_~i~0#1_40| Int) (v_ArrVal_866 Int) (|ULTIMATE.start_main_#t~nondet9#1| Int) (v_subst_1 Int)) (let ((.cse10 (* |v_ULTIMATE.start_main_~i~0#1_40| 4))) (or (< v_threadThread2of2ForFork0_~p~0.offset_27 (+ |c_ULTIMATE.start_main_~datas~0#1.offset| .cse10)) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse11 (store .cse3 |c_ULTIMATE.start_main_~tids~0#1.base| (let ((.cse12 (* |v_ULTIMATE.start_main_~i~0#1_39| 4))) (store (store (store (store (store (store (store (store .cse4 (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse10) v_ArrVal_866) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse10 1) |ULTIMATE.start_main_#t~nondet9#1|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| 2 .cse10) v_ArrVal_868) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| 3 .cse10) |ULTIMATE.start_main_#t~nondet9#1|) (+ .cse12 |c_ULTIMATE.start_main_~tids~0#1.offset|) v_ArrVal_872) (+ .cse12 |c_ULTIMATE.start_main_~tids~0#1.offset| 1) v_subst_1) (+ .cse12 |c_ULTIMATE.start_main_~tids~0#1.offset| 2) v_ArrVal_874) (+ .cse12 |c_ULTIMATE.start_main_~tids~0#1.offset| 3) v_subst_1))))) (store .cse11 |c_ULTIMATE.start_main_~datas~0#1.base| (store (select .cse11 |c_ULTIMATE.start_main_~datas~0#1.base|) v_threadThread2of2ForFork0_~p~0.offset_27 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~p~0.base) c_threadThread1of2ForFork0_~p~0.offset)) (< |v_ULTIMATE.start_main_~i~0#1_39| (+ |v_ULTIMATE.start_main_~i~0#1_40| 1)) (< |v_ULTIMATE.start_main_~i~0#1_40| .cse1)))))))) is different from false [2024-11-13 12:35:02,322 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse6 (+ c_threadThread1of2ForFork0_~p~0.offset 1)) (.cse10 (+ 2 c_threadThread1of2ForFork0_~p~0.offset))) (let ((.cse3 (store |c_#race| c_threadThread1of2ForFork0_~p~0.base (store (store (select |c_#race| c_threadThread1of2ForFork0_~p~0.base) .cse6 |c_threadThread1of2ForFork0_#t~nondet4|) .cse10 |c_threadThread1of2ForFork0_#t~nondet4|)))) (let ((.cse4 (select .cse3 |c_ULTIMATE.start_main_~tids~0#1.base|)) (.cse1 (+ |c_ULTIMATE.start_main_~i~0#1| 1))) (and (forall ((v_ArrVal_874 Int) (v_threadThread2of2ForFork0_~p~0.offset_27 Int) (|v_ULTIMATE.start_main_~i~0#1_39| Int) (v_ArrVal_872 Int) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_868 Int) (v_subst_3 Int) (|v_ULTIMATE.start_main_~i~0#1_40| Int) (v_ArrVal_866 Int) (|ULTIMATE.start_main_#t~nondet9#1| Int)) (let ((.cse0 (* |v_ULTIMATE.start_main_~i~0#1_40| 4))) (or (< v_threadThread2of2ForFork0_~p~0.offset_27 (+ |c_ULTIMATE.start_main_~datas~0#1.offset| .cse0)) (< |v_ULTIMATE.start_main_~i~0#1_39| (+ |v_ULTIMATE.start_main_~i~0#1_40| 1)) (< |v_ULTIMATE.start_main_~i~0#1_40| .cse1) (= (select (select (let ((.cse2 (store .cse3 |c_ULTIMATE.start_main_~tids~0#1.base| (let ((.cse5 (* |v_ULTIMATE.start_main_~i~0#1_39| 4))) (store (store (store (store (store (store (store (store .cse4 (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse0) v_ArrVal_866) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse0 1) |ULTIMATE.start_main_#t~nondet9#1|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| 2 .cse0) v_ArrVal_868) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| 3 .cse0) |ULTIMATE.start_main_#t~nondet9#1|) (+ .cse5 |c_ULTIMATE.start_main_~tids~0#1.offset|) v_ArrVal_872) (+ .cse5 |c_ULTIMATE.start_main_~tids~0#1.offset| 1) v_subst_3) (+ .cse5 |c_ULTIMATE.start_main_~tids~0#1.offset| 2) v_ArrVal_874) (+ .cse5 |c_ULTIMATE.start_main_~tids~0#1.offset| 3) v_subst_3))))) (store .cse2 |c_ULTIMATE.start_main_~datas~0#1.base| (store (select .cse2 |c_ULTIMATE.start_main_~datas~0#1.base|) v_threadThread2of2ForFork0_~p~0.offset_27 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~p~0.base) .cse6) |c_threadThread1of2ForFork0_#t~nondet4|)))) (forall ((v_ArrVal_874 Int) (v_threadThread2of2ForFork0_~p~0.offset_27 Int) (|v_ULTIMATE.start_main_~i~0#1_39| Int) (v_ArrVal_872 Int) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_868 Int) (|v_ULTIMATE.start_main_~i~0#1_40| Int) (v_subst_2 Int) (v_ArrVal_866 Int) (|ULTIMATE.start_main_#t~nondet9#1| Int)) (let ((.cse8 (* |v_ULTIMATE.start_main_~i~0#1_40| 4))) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse7 (store .cse3 |c_ULTIMATE.start_main_~tids~0#1.base| (let ((.cse9 (* |v_ULTIMATE.start_main_~i~0#1_39| 4))) (store (store (store (store (store (store (store (store .cse4 (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse8) v_ArrVal_866) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse8 1) |ULTIMATE.start_main_#t~nondet9#1|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| 2 .cse8) v_ArrVal_868) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| 3 .cse8) |ULTIMATE.start_main_#t~nondet9#1|) (+ .cse9 |c_ULTIMATE.start_main_~tids~0#1.offset|) v_ArrVal_872) (+ .cse9 |c_ULTIMATE.start_main_~tids~0#1.offset| 1) v_subst_2) (+ .cse9 |c_ULTIMATE.start_main_~tids~0#1.offset| 2) v_ArrVal_874) (+ .cse9 |c_ULTIMATE.start_main_~tids~0#1.offset| 3) v_subst_2))))) (store .cse7 |c_ULTIMATE.start_main_~datas~0#1.base| (store (select .cse7 |c_ULTIMATE.start_main_~datas~0#1.base|) v_threadThread2of2ForFork0_~p~0.offset_27 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~p~0.base) .cse10)) (< v_threadThread2of2ForFork0_~p~0.offset_27 (+ |c_ULTIMATE.start_main_~datas~0#1.offset| .cse8)) (< |v_ULTIMATE.start_main_~i~0#1_39| (+ |v_ULTIMATE.start_main_~i~0#1_40| 1)) (< |v_ULTIMATE.start_main_~i~0#1_40| .cse1)))) (forall ((v_ArrVal_874 Int) (v_threadThread2of2ForFork0_~p~0.offset_27 Int) (|v_ULTIMATE.start_main_~i~0#1_39| Int) (v_ArrVal_872 Int) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_868 Int) (|v_ULTIMATE.start_main_~i~0#1_40| Int) (v_ArrVal_866 Int) (|ULTIMATE.start_main_#t~nondet9#1| Int) (v_subst_1 Int)) (let ((.cse12 (* |v_ULTIMATE.start_main_~i~0#1_40| 4))) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse11 (store .cse3 |c_ULTIMATE.start_main_~tids~0#1.base| (let ((.cse13 (* |v_ULTIMATE.start_main_~i~0#1_39| 4))) (store (store (store (store (store (store (store (store .cse4 (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse12) v_ArrVal_866) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse12 1) |ULTIMATE.start_main_#t~nondet9#1|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| 2 .cse12) v_ArrVal_868) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| 3 .cse12) |ULTIMATE.start_main_#t~nondet9#1|) (+ .cse13 |c_ULTIMATE.start_main_~tids~0#1.offset|) v_ArrVal_872) (+ .cse13 |c_ULTIMATE.start_main_~tids~0#1.offset| 1) v_subst_1) (+ .cse13 |c_ULTIMATE.start_main_~tids~0#1.offset| 2) v_ArrVal_874) (+ .cse13 |c_ULTIMATE.start_main_~tids~0#1.offset| 3) v_subst_1))))) (store .cse11 |c_ULTIMATE.start_main_~datas~0#1.base| (store (select .cse11 |c_ULTIMATE.start_main_~datas~0#1.base|) v_threadThread2of2ForFork0_~p~0.offset_27 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~p~0.base) c_threadThread1of2ForFork0_~p~0.offset)) (< v_threadThread2of2ForFork0_~p~0.offset_27 (+ |c_ULTIMATE.start_main_~datas~0#1.offset| .cse12)) (< |v_ULTIMATE.start_main_~i~0#1_39| (+ |v_ULTIMATE.start_main_~i~0#1_40| 1)) (< |v_ULTIMATE.start_main_~i~0#1_40| .cse1)))))))) is different from false