./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-data-race.prp --file ../../sv-benchmarks/c/pthread-ext/05_tas.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 5e519f3a Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7bb18a9-a50c-419d-bd5d-676b2b419eee/bin/ugemcutter-C1kR7RIaUi/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7bb18a9-a50c-419d-bd5d-676b2b419eee/bin/ugemcutter-C1kR7RIaUi/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7bb18a9-a50c-419d-bd5d-676b2b419eee/bin/ugemcutter-C1kR7RIaUi/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7bb18a9-a50c-419d-bd5d-676b2b419eee/bin/ugemcutter-C1kR7RIaUi/config/GemCutterReach.xml -i ../../sv-benchmarks/c/pthread-ext/05_tas.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7bb18a9-a50c-419d-bd5d-676b2b419eee/bin/ugemcutter-C1kR7RIaUi/config/svcomp-DataRace-32bit-GemCutter_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7bb18a9-a50c-419d-bd5d-676b2b419eee/bin/ugemcutter-C1kR7RIaUi --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! data-race) ) --witnessprinter.graph.data.producer GemCutter --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 1ee4025da2c93fbd4be930880192a9e0c94d8979f3d9117e228b55f99542c3b0 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-5e519f3 [2022-11-04 12:05:27,502 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-04 12:05:27,505 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-04 12:05:27,558 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-04 12:05:27,558 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-04 12:05:27,562 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-04 12:05:27,564 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-04 12:05:27,569 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-04 12:05:27,571 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-04 12:05:27,577 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-04 12:05:27,578 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-04 12:05:27,580 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-04 12:05:27,581 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-04 12:05:27,583 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-04 12:05:27,586 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-04 12:05:27,587 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-04 12:05:27,589 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-04 12:05:27,590 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-04 12:05:27,592 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-04 12:05:27,599 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-04 12:05:27,600 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-04 12:05:27,601 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-04 12:05:27,605 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-04 12:05:27,606 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-04 12:05:27,611 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-04 12:05:27,612 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-04 12:05:27,612 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-04 12:05:27,614 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-04 12:05:27,614 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-04 12:05:27,617 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-04 12:05:27,617 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-04 12:05:27,618 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-04 12:05:27,620 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-04 12:05:27,622 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-04 12:05:27,623 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-04 12:05:27,623 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-04 12:05:27,624 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-04 12:05:27,624 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-04 12:05:27,625 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-04 12:05:27,626 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-04 12:05:27,626 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-04 12:05:27,628 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7bb18a9-a50c-419d-bd5d-676b2b419eee/bin/ugemcutter-C1kR7RIaUi/config/svcomp-DataRace-32bit-GemCutter_Default.epf [2022-11-04 12:05:27,664 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-04 12:05:27,666 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-04 12:05:27,667 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-04 12:05:27,667 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-04 12:05:27,668 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-04 12:05:27,668 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-04 12:05:27,669 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-04 12:05:27,669 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-04 12:05:27,670 INFO L138 SettingsManager]: * Use SBE=true [2022-11-04 12:05:27,670 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-04 12:05:27,671 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-04 12:05:27,671 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-04 12:05:27,672 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-04 12:05:27,672 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-04 12:05:27,672 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-04 12:05:27,672 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-04 12:05:27,672 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-04 12:05:27,673 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-04 12:05:27,673 INFO L138 SettingsManager]: * Check absence of data races in concurrent programs=true [2022-11-04 12:05:27,673 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-04 12:05:27,673 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-04 12:05:27,674 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-04 12:05:27,674 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-04 12:05:27,674 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-04 12:05:27,674 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-04 12:05:27,675 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-11-04 12:05:27,676 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-04 12:05:27,676 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-04 12:05:27,677 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-04 12:05:27,677 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-04 12:05:27,677 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-04 12:05:27,677 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-04 12:05:27,678 INFO L138 SettingsManager]: * DFS Order used in POR=PSEUDO_LOCKSTEP [2022-11-04 12:05:27,678 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-04 12:05:27,678 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-04 12:05:27,679 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2022-11-04 12:05:27,679 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-04 12:05:27,679 INFO L138 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2022-11-04 12:05:27,679 INFO L138 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2022-11-04 12:05:27,679 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7bb18a9-a50c-419d-bd5d-676b2b419eee/bin/ugemcutter-C1kR7RIaUi/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7bb18a9-a50c-419d-bd5d-676b2b419eee/bin/ugemcutter-C1kR7RIaUi Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! data-race) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> 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 -> 1ee4025da2c93fbd4be930880192a9e0c94d8979f3d9117e228b55f99542c3b0 [2022-11-04 12:05:27,961 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-04 12:05:27,994 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-04 12:05:27,997 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-04 12:05:27,998 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-04 12:05:27,999 INFO L275 PluginConnector]: CDTParser initialized [2022-11-04 12:05:28,000 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7bb18a9-a50c-419d-bd5d-676b2b419eee/bin/ugemcutter-C1kR7RIaUi/../../sv-benchmarks/c/pthread-ext/05_tas.i [2022-11-04 12:05:28,068 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7bb18a9-a50c-419d-bd5d-676b2b419eee/bin/ugemcutter-C1kR7RIaUi/data/3a99f46b5/fd199a83d0a64ccfa32080fdbb780b8c/FLAGe4d7f9d56 [2022-11-04 12:05:28,674 INFO L306 CDTParser]: Found 1 translation units. [2022-11-04 12:05:28,675 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7bb18a9-a50c-419d-bd5d-676b2b419eee/sv-benchmarks/c/pthread-ext/05_tas.i [2022-11-04 12:05:28,705 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7bb18a9-a50c-419d-bd5d-676b2b419eee/bin/ugemcutter-C1kR7RIaUi/data/3a99f46b5/fd199a83d0a64ccfa32080fdbb780b8c/FLAGe4d7f9d56 [2022-11-04 12:05:28,958 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7bb18a9-a50c-419d-bd5d-676b2b419eee/bin/ugemcutter-C1kR7RIaUi/data/3a99f46b5/fd199a83d0a64ccfa32080fdbb780b8c [2022-11-04 12:05:28,962 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-04 12:05:28,964 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-04 12:05:28,967 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-04 12:05:28,967 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-04 12:05:28,971 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-04 12:05:28,972 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.11 12:05:28" (1/1) ... [2022-11-04 12:05:28,975 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5ea77b1e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.11 12:05:28, skipping insertion in model container [2022-11-04 12:05:28,975 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.11 12:05:28" (1/1) ... [2022-11-04 12:05:28,983 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-04 12:05:29,030 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-04 12:05:29,486 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7bb18a9-a50c-419d-bd5d-676b2b419eee/sv-benchmarks/c/pthread-ext/05_tas.i[30203,30216] [2022-11-04 12:05:29,488 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7bb18a9-a50c-419d-bd5d-676b2b419eee/sv-benchmarks/c/pthread-ext/05_tas.i[30300,30313] [2022-11-04 12:05:29,493 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7bb18a9-a50c-419d-bd5d-676b2b419eee/sv-benchmarks/c/pthread-ext/05_tas.i[30446,30459] [2022-11-04 12:05:29,499 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-04 12:05:29,508 INFO L203 MainTranslator]: Completed pre-run [2022-11-04 12:05:29,579 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7bb18a9-a50c-419d-bd5d-676b2b419eee/sv-benchmarks/c/pthread-ext/05_tas.i[30203,30216] [2022-11-04 12:05:29,583 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7bb18a9-a50c-419d-bd5d-676b2b419eee/sv-benchmarks/c/pthread-ext/05_tas.i[30300,30313] [2022-11-04 12:05:29,587 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7bb18a9-a50c-419d-bd5d-676b2b419eee/sv-benchmarks/c/pthread-ext/05_tas.i[30446,30459] [2022-11-04 12:05:29,592 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-04 12:05:29,635 INFO L208 MainTranslator]: Completed translation [2022-11-04 12:05:29,635 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.11 12:05:29 WrapperNode [2022-11-04 12:05:29,636 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-04 12:05:29,637 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-04 12:05:29,638 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-04 12:05:29,638 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-04 12:05:29,646 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.11 12:05:29" (1/1) ... [2022-11-04 12:05:29,675 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.11 12:05:29" (1/1) ... [2022-11-04 12:05:29,712 INFO L138 Inliner]: procedures = 169, calls = 26, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 172 [2022-11-04 12:05:29,712 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-04 12:05:29,713 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-04 12:05:29,713 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-04 12:05:29,713 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-04 12:05:29,723 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.11 12:05:29" (1/1) ... [2022-11-04 12:05:29,724 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.11 12:05:29" (1/1) ... [2022-11-04 12:05:29,728 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.11 12:05:29" (1/1) ... [2022-11-04 12:05:29,728 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.11 12:05:29" (1/1) ... [2022-11-04 12:05:29,740 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.11 12:05:29" (1/1) ... [2022-11-04 12:05:29,745 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.11 12:05:29" (1/1) ... [2022-11-04 12:05:29,747 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.11 12:05:29" (1/1) ... [2022-11-04 12:05:29,748 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.11 12:05:29" (1/1) ... [2022-11-04 12:05:29,752 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-04 12:05:29,753 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-04 12:05:29,753 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-04 12:05:29,753 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-04 12:05:29,754 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.11 12:05:29" (1/1) ... [2022-11-04 12:05:29,761 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-04 12:05:29,786 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7bb18a9-a50c-419d-bd5d-676b2b419eee/bin/ugemcutter-C1kR7RIaUi/z3 [2022-11-04 12:05:29,803 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7bb18a9-a50c-419d-bd5d-676b2b419eee/bin/ugemcutter-C1kR7RIaUi/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-04 12:05:29,833 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7bb18a9-a50c-419d-bd5d-676b2b419eee/bin/ugemcutter-C1kR7RIaUi/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-04 12:05:29,850 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-04 12:05:29,851 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2022-11-04 12:05:29,851 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2022-11-04 12:05:29,851 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-04 12:05:29,851 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-04 12:05:29,851 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-04 12:05:29,852 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-04 12:05:29,852 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-04 12:05:29,852 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-04 12:05:29,852 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-04 12:05:29,854 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-04 12:05:30,069 INFO L235 CfgBuilder]: Building ICFG [2022-11-04 12:05:30,071 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-04 12:05:30,506 INFO L276 CfgBuilder]: Performing block encoding [2022-11-04 12:05:30,739 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-04 12:05:30,739 INFO L300 CfgBuilder]: Removed 3 assume(true) statements. [2022-11-04 12:05:30,742 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.11 12:05:30 BoogieIcfgContainer [2022-11-04 12:05:30,742 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-04 12:05:30,745 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-04 12:05:30,745 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-04 12:05:30,749 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-04 12:05:30,749 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.11 12:05:28" (1/3) ... [2022-11-04 12:05:30,750 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e819bb3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.11 12:05:30, skipping insertion in model container [2022-11-04 12:05:30,750 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.11 12:05:29" (2/3) ... [2022-11-04 12:05:30,751 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e819bb3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.11 12:05:30, skipping insertion in model container [2022-11-04 12:05:30,751 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.11 12:05:30" (3/3) ... [2022-11-04 12:05:30,753 INFO L112 eAbstractionObserver]: Analyzing ICFG 05_tas.i [2022-11-04 12:05:30,763 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-04 12:05:30,775 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-04 12:05:30,776 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 16 error locations. [2022-11-04 12:05:30,776 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-04 12:05:30,891 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-04 12:05:30,959 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-04 12:05:30,960 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2022-11-04 12:05:30,960 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7bb18a9-a50c-419d-bd5d-676b2b419eee/bin/ugemcutter-C1kR7RIaUi/z3 [2022-11-04 12:05:30,971 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7bb18a9-a50c-419d-bd5d-676b2b419eee/bin/ugemcutter-C1kR7RIaUi/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2022-11-04 12:05:30,982 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7bb18a9-a50c-419d-bd5d-676b2b419eee/bin/ugemcutter-C1kR7RIaUi/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2022-11-04 12:05:31,016 INFO L156 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2022-11-04 12:05:31,030 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == thr1Thread1of1ForFork0 ======== [2022-11-04 12:05:31,037 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@4ddf66bd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-04 12:05:31,037 INFO L358 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2022-11-04 12:05:31,158 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2022-11-04 12:05:31,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-04 12:05:31,164 INFO L85 PathProgramCache]: Analyzing trace with hash -575151330, now seen corresponding path program 1 times [2022-11-04 12:05:31,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-04 12:05:31,173 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1875862877] [2022-11-04 12:05:31,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-04 12:05:31,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-04 12:05:31,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-04 12:05:31,425 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-04 12:05:31,425 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-04 12:05:31,426 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1875862877] [2022-11-04 12:05:31,427 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1875862877] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-04 12:05:31,427 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-04 12:05:31,427 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-04 12:05:31,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1342331350] [2022-11-04 12:05:31,430 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-04 12:05:31,434 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-04 12:05:31,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-04 12:05:31,456 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-04 12:05:31,457 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-04 12:05:31,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-04 12:05:31,460 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-04 12:05:31,461 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 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) [2022-11-04 12:05:31,461 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-04 12:05:33,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-04 12:05:33,616 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-04 12:05:33,616 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err3ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2022-11-04 12:05:33,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-04 12:05:33,617 INFO L85 PathProgramCache]: Analyzing trace with hash -215646782, now seen corresponding path program 1 times [2022-11-04 12:05:33,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-04 12:05:33,618 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1862269854] [2022-11-04 12:05:33,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-04 12:05:33,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-04 12:05:33,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-04 12:05:34,411 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-04 12:05:34,411 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-04 12:05:34,411 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1862269854] [2022-11-04 12:05:34,412 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1862269854] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-04 12:05:34,412 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-04 12:05:34,412 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-04 12:05:34,412 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1699358298] [2022-11-04 12:05:34,412 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-04 12:05:34,414 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-04 12:05:34,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-04 12:05:34,414 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-04 12:05:34,415 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-04 12:05:34,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-04 12:05:34,415 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-04 12:05:34,416 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 7.8) internal successors, (39), 6 states have internal predecessors, (39), 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) [2022-11-04 12:05:34,416 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-04 12:05:34,416 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-04 12:05:34,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-04 12:05:34,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-04 12:05:34,639 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-04 12:05:34,639 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err8ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2022-11-04 12:05:34,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-04 12:05:34,640 INFO L85 PathProgramCache]: Analyzing trace with hash -1032748296, now seen corresponding path program 1 times [2022-11-04 12:05:34,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-04 12:05:34,641 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [272396122] [2022-11-04 12:05:34,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-04 12:05:34,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-04 12:05:34,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-04 12:05:35,134 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-04 12:05:35,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-04 12:05:35,136 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [272396122] [2022-11-04 12:05:35,139 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [272396122] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-04 12:05:35,140 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-04 12:05:35,140 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-04 12:05:35,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [272619268] [2022-11-04 12:05:35,140 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-04 12:05:35,143 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-04 12:05:35,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-04 12:05:35,143 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-04 12:05:35,144 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-04 12:05:35,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-04 12:05:35,149 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-04 12:05:35,150 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 10.6) internal successors, (53), 6 states have internal predecessors, (53), 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) [2022-11-04 12:05:35,150 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-04 12:05:35,150 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-04 12:05:35,150 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-04 12:05:35,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-04 12:05:35,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-04 12:05:35,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-04 12:05:35,367 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-04 12:05:35,367 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting thr1Err9ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2022-11-04 12:05:35,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-04 12:05:35,368 INFO L85 PathProgramCache]: Analyzing trace with hash 31655167, now seen corresponding path program 1 times [2022-11-04 12:05:35,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-04 12:05:35,369 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1506602293] [2022-11-04 12:05:35,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-04 12:05:35,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-04 12:05:35,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-04 12:05:35,454 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-04 12:05:35,454 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-04 12:05:35,456 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1506602293] [2022-11-04 12:05:35,456 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1506602293] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-04 12:05:35,456 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-04 12:05:35,456 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-04 12:05:35,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [813838607] [2022-11-04 12:05:35,457 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-04 12:05:35,458 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-04 12:05:35,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-04 12:05:35,458 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-04 12:05:35,459 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-04 12:05:35,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-04 12:05:35,459 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-04 12:05:35,459 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 30.5) internal successors, (61), 3 states have internal predecessors, (61), 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) [2022-11-04 12:05:35,459 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-04 12:05:35,460 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-04 12:05:35,460 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-04 12:05:35,460 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-04 12:05:35,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-04 12:05:35,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-04 12:05:35,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-04 12:05:35,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-04 12:05:35,545 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-04 12:05:35,546 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting thr1Err10ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2022-11-04 12:05:35,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-04 12:05:35,548 INFO L85 PathProgramCache]: Analyzing trace with hash 1509443213, now seen corresponding path program 1 times [2022-11-04 12:05:35,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-04 12:05:35,548 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [168897631] [2022-11-04 12:05:35,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-04 12:05:35,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-04 12:05:35,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-04 12:05:35,645 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-04 12:05:35,646 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-04 12:05:35,646 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [168897631] [2022-11-04 12:05:35,646 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [168897631] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-04 12:05:35,647 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-04 12:05:35,647 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-04 12:05:35,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [57204658] [2022-11-04 12:05:35,647 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-04 12:05:35,650 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-04 12:05:35,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-04 12:05:35,651 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-04 12:05:35,652 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-04 12:05:35,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-04 12:05:35,652 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-04 12:05:35,654 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 33.0) internal successors, (66), 3 states have internal predecessors, (66), 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) [2022-11-04 12:05:35,654 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-04 12:05:35,654 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-04 12:05:35,654 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-04 12:05:35,655 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-04 12:05:35,655 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-04 12:05:35,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-04 12:05:35,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-04 12:05:35,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-04 12:05:35,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-04 12:05:35,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-04 12:05:35,758 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-04 12:05:35,759 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting thr1Err13ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2022-11-04 12:05:35,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-04 12:05:35,759 INFO L85 PathProgramCache]: Analyzing trace with hash -1684752714, now seen corresponding path program 1 times [2022-11-04 12:05:35,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-04 12:05:35,760 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1148750183] [2022-11-04 12:05:35,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-04 12:05:35,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-04 12:05:35,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-04 12:05:35,822 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-04 12:05:35,822 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-04 12:05:35,822 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1148750183] [2022-11-04 12:05:35,823 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1148750183] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-04 12:05:35,823 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-04 12:05:35,823 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-04 12:05:35,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1335792973] [2022-11-04 12:05:35,823 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-04 12:05:35,824 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-04 12:05:35,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-04 12:05:35,825 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-04 12:05:35,825 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-04 12:05:35,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-04 12:05:35,825 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-04 12:05:35,825 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 39.0) internal successors, (78), 3 states have internal predecessors, (78), 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) [2022-11-04 12:05:35,826 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-04 12:05:35,826 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-04 12:05:35,826 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-04 12:05:35,826 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-04 12:05:35,826 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-04 12:05:35,826 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-04 12:05:35,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-04 12:05:35,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-04 12:05:35,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-04 12:05:35,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-04 12:05:35,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-04 12:05:35,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-04 12:05:35,963 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-04 12:05:35,964 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting thr1Err15ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2022-11-04 12:05:35,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-04 12:05:35,964 INFO L85 PathProgramCache]: Analyzing trace with hash 723577975, now seen corresponding path program 1 times [2022-11-04 12:05:35,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-04 12:05:35,965 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1878311383] [2022-11-04 12:05:35,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-04 12:05:35,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-04 12:05:35,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-04 12:05:36,461 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-04 12:05:36,462 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-04 12:05:36,462 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1878311383] [2022-11-04 12:05:36,462 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1878311383] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-04 12:05:36,463 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-04 12:05:36,463 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-04 12:05:36,463 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1355184225] [2022-11-04 12:05:36,463 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-04 12:05:36,464 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-04 12:05:36,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-04 12:05:36,464 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-04 12:05:36,465 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-04 12:05:36,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-04 12:05:36,465 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-04 12:05:36,465 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 19.4) internal successors, (97), 6 states have internal predecessors, (97), 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) [2022-11-04 12:05:36,465 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-04 12:05:36,466 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-04 12:05:36,466 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-04 12:05:36,466 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-04 12:05:36,466 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-04 12:05:36,466 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-04 12:05:36,466 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-04 12:05:42,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-04 12:05:42,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-04 12:05:42,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-04 12:05:42,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-04 12:05:42,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-04 12:05:42,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-04 12:05:42,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-04 12:05:42,658 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err0ASSERT_VIOLATIONDATA_RACE (15 of 16 remaining) [2022-11-04 12:05:42,659 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err1ASSERT_VIOLATIONDATA_RACE (14 of 16 remaining) [2022-11-04 12:05:42,659 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err2ASSERT_VIOLATIONDATA_RACE (13 of 16 remaining) [2022-11-04 12:05:42,659 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err3ASSERT_VIOLATIONDATA_RACE (12 of 16 remaining) [2022-11-04 12:05:42,660 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err7ASSERT_VIOLATIONDATA_RACE (11 of 16 remaining) [2022-11-04 12:05:42,660 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err4ASSERT_VIOLATIONDATA_RACE (10 of 16 remaining) [2022-11-04 12:05:42,660 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err5ASSERT_VIOLATIONDATA_RACE (9 of 16 remaining) [2022-11-04 12:05:42,660 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err6ASSERT_VIOLATIONDATA_RACE (8 of 16 remaining) [2022-11-04 12:05:42,661 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err8ASSERT_VIOLATIONDATA_RACE (7 of 16 remaining) [2022-11-04 12:05:42,661 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err9ASSERT_VIOLATIONDATA_RACE (6 of 16 remaining) [2022-11-04 12:05:42,661 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err10ASSERT_VIOLATIONDATA_RACE (5 of 16 remaining) [2022-11-04 12:05:42,661 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err11ASSERT_VIOLATIONDATA_RACE (4 of 16 remaining) [2022-11-04 12:05:42,662 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err12ASSERT_VIOLATIONDATA_RACE (3 of 16 remaining) [2022-11-04 12:05:42,662 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err13ASSERT_VIOLATIONDATA_RACE (2 of 16 remaining) [2022-11-04 12:05:42,662 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err14ASSERT_VIOLATIONDATA_RACE (1 of 16 remaining) [2022-11-04 12:05:42,662 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err15ASSERT_VIOLATIONDATA_RACE (0 of 16 remaining) [2022-11-04 12:05:42,663 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-04 12:05:42,669 INFO L444 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2022-11-04 12:05:42,671 INFO L307 ceAbstractionStarter]: Result for error location thr1Thread1of1ForFork0 was SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE (1/2) [2022-11-04 12:05:42,675 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-04 12:05:42,676 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2022-11-04 12:05:42,676 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7bb18a9-a50c-419d-bd5d-676b2b419eee/bin/ugemcutter-C1kR7RIaUi/z3 [2022-11-04 12:05:42,678 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7bb18a9-a50c-419d-bd5d-676b2b419eee/bin/ugemcutter-C1kR7RIaUi/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2022-11-04 12:05:42,731 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7bb18a9-a50c-419d-bd5d-676b2b419eee/bin/ugemcutter-C1kR7RIaUi/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (3)] Waiting until timeout for monitored process [2022-11-04 12:05:42,734 INFO L156 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2022-11-04 12:05:42,734 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2022-11-04 12:05:42,735 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@4ddf66bd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-04 12:05:42,735 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-04 12:05:42,794 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-11-04 12:05:42,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-04 12:05:42,794 INFO L85 PathProgramCache]: Analyzing trace with hash 624506881, now seen corresponding path program 1 times [2022-11-04 12:05:42,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-04 12:05:42,795 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1919531703] [2022-11-04 12:05:42,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-04 12:05:42,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-04 12:05:42,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-04 12:05:42,811 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-04 12:05:42,812 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-04 12:05:42,812 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1919531703] [2022-11-04 12:05:42,812 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1919531703] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-04 12:05:42,812 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-04 12:05:42,812 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-04 12:05:42,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1592537733] [2022-11-04 12:05:42,813 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-04 12:05:42,813 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-04 12:05:42,813 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-04 12:05:42,814 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-04 12:05:42,814 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-04 12:05:42,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-04 12:05:42,814 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-04 12:05:42,815 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 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) [2022-11-04 12:05:42,815 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-04 12:05:45,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-04 12:05:45,298 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-04 12:05:45,298 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-11-04 12:05:45,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-04 12:05:45,299 INFO L85 PathProgramCache]: Analyzing trace with hash 70352351, now seen corresponding path program 1 times [2022-11-04 12:05:45,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-04 12:05:45,299 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [225267134] [2022-11-04 12:05:45,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-04 12:05:45,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-04 12:05:45,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-04 12:05:45,310 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-04 12:05:45,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-04 12:05:45,338 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-04 12:05:45,338 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-04 12:05:45,338 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 1 remaining) [2022-11-04 12:05:45,339 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-04 12:05:45,340 INFO L444 BasicCegarLoop]: Path program histogram: [1, 1] [2022-11-04 12:05:45,340 INFO L307 ceAbstractionStarter]: Result for error location ULTIMATE.start was UNSAFE (2/2) [2022-11-04 12:05:45,341 WARN L233 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2022-11-04 12:05:45,341 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2022-11-04 12:05:45,404 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-04 12:05:45,431 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-04 12:05:45,432 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2022-11-04 12:05:45,432 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7bb18a9-a50c-419d-bd5d-676b2b419eee/bin/ugemcutter-C1kR7RIaUi/z3 [2022-11-04 12:05:45,474 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7bb18a9-a50c-419d-bd5d-676b2b419eee/bin/ugemcutter-C1kR7RIaUi/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2022-11-04 12:05:45,501 INFO L156 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2022-11-04 12:05:45,502 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2022-11-04 12:05:45,502 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@4ddf66bd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-04 12:05:45,502 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-04 12:05:45,518 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7bb18a9-a50c-419d-bd5d-676b2b419eee/bin/ugemcutter-C1kR7RIaUi/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (4)] Waiting until timeout for monitored process [2022-11-04 12:05:45,568 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-11-04 12:05:45,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-04 12:05:45,569 INFO L85 PathProgramCache]: Analyzing trace with hash -1286143132, now seen corresponding path program 1 times [2022-11-04 12:05:45,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-04 12:05:45,569 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1825191827] [2022-11-04 12:05:45,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-04 12:05:45,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-04 12:05:45,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-04 12:05:45,585 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-04 12:05:45,585 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-04 12:05:45,586 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1825191827] [2022-11-04 12:05:45,586 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1825191827] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-04 12:05:45,586 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-04 12:05:45,587 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-04 12:05:45,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [417600477] [2022-11-04 12:05:45,588 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-04 12:05:45,588 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-04 12:05:45,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-04 12:05:45,588 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-04 12:05:45,589 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-04 12:05:45,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-04 12:05:45,589 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-04 12:05:45,589 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 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) [2022-11-04 12:05:45,589 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-04 12:06:01,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-04 12:06:01,812 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-04 12:06:01,813 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-11-04 12:06:01,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-04 12:06:01,815 INFO L85 PathProgramCache]: Analyzing trace with hash -539337164, now seen corresponding path program 1 times [2022-11-04 12:06:01,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-04 12:06:01,816 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [603214246] [2022-11-04 12:06:01,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-04 12:06:01,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-04 12:06:01,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-04 12:06:02,188 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-11-04 12:06:02,188 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-04 12:06:02,188 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [603214246] [2022-11-04 12:06:02,188 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [603214246] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-04 12:06:02,189 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-04 12:06:02,189 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-04 12:06:02,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1627208117] [2022-11-04 12:06:02,189 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-04 12:06:02,189 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-04 12:06:02,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-04 12:06:02,190 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-04 12:06:02,190 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-04 12:06:02,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-04 12:06:02,191 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-04 12:06:02,191 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 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) [2022-11-04 12:06:02,191 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-04 12:06:02,191 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-04 12:06:03,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-04 12:06:03,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-04 12:06:03,436 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-04 12:06:03,436 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-11-04 12:06:03,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-04 12:06:03,436 INFO L85 PathProgramCache]: Analyzing trace with hash -539336203, now seen corresponding path program 1 times [2022-11-04 12:06:03,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-04 12:06:03,437 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1731643623] [2022-11-04 12:06:03,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-04 12:06:03,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-04 12:06:03,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-04 12:06:03,471 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-04 12:06:03,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-04 12:06:03,491 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-04 12:06:03,491 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-04 12:06:03,492 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 1 remaining) [2022-11-04 12:06:03,492 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-04 12:06:03,493 INFO L444 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2022-11-04 12:06:03,494 INFO L307 ceAbstractionStarter]: Result for error location ULTIMATE.start was UNSAFE (1/3) [2022-11-04 12:06:03,494 WARN L233 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2022-11-04 12:06:03,494 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2022-11-04 12:06:03,592 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-04 12:06:03,596 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-04 12:06:03,597 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2022-11-04 12:06:03,597 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7bb18a9-a50c-419d-bd5d-676b2b419eee/bin/ugemcutter-C1kR7RIaUi/z3 [2022-11-04 12:06:03,602 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7bb18a9-a50c-419d-bd5d-676b2b419eee/bin/ugemcutter-C1kR7RIaUi/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2022-11-04 12:06:03,611 INFO L156 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2022-11-04 12:06:03,611 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == thr1Thread3of3ForFork0 ======== [2022-11-04 12:06:03,612 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@4ddf66bd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-04 12:06:03,612 INFO L358 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2022-11-04 12:06:03,630 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7bb18a9-a50c-419d-bd5d-676b2b419eee/bin/ugemcutter-C1kR7RIaUi/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (5)] Waiting until timeout for monitored process [2022-11-04 12:06:03,724 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2022-11-04 12:06:03,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-04 12:06:03,725 INFO L85 PathProgramCache]: Analyzing trace with hash 356704271, now seen corresponding path program 1 times [2022-11-04 12:06:03,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-04 12:06:03,725 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1638678266] [2022-11-04 12:06:03,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-04 12:06:03,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-04 12:06:03,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-04 12:06:03,750 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-11-04 12:06:03,750 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-04 12:06:03,750 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1638678266] [2022-11-04 12:06:03,751 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1638678266] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-04 12:06:03,751 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-04 12:06:03,751 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-04 12:06:03,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1214142722] [2022-11-04 12:06:03,751 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-04 12:06:03,752 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-04 12:06:03,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-04 12:06:03,753 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-04 12:06:03,753 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-04 12:06:03,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-04 12:06:03,754 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-04 12:06:03,754 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 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) [2022-11-04 12:06:03,754 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-04 12:06:40,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-04 12:06:40,536 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-04 12:06:40,537 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err3ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2022-11-04 12:06:40,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-04 12:06:40,537 INFO L85 PathProgramCache]: Analyzing trace with hash -824196933, now seen corresponding path program 1 times [2022-11-04 12:06:40,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-04 12:06:40,538 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1409980786] [2022-11-04 12:06:40,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-04 12:06:40,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-04 12:06:40,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-04 12:06:41,008 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-11-04 12:06:41,008 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-04 12:06:41,009 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1409980786] [2022-11-04 12:06:41,009 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1409980786] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-04 12:06:41,009 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-04 12:06:41,009 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-04 12:06:41,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1464132775] [2022-11-04 12:06:41,009 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-04 12:06:41,010 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-04 12:06:41,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-04 12:06:41,010 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-04 12:06:41,011 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-04 12:06:41,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-04 12:06:41,011 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-04 12:06:41,011 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 6 states have internal predecessors, (79), 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) [2022-11-04 12:06:41,011 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-04 12:06:41,011 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-04 12:06:56,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-04 12:06:56,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-04 12:06:56,941 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-04 12:06:56,941 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err3ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2022-11-04 12:06:56,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-04 12:06:56,941 INFO L85 PathProgramCache]: Analyzing trace with hash 675174405, now seen corresponding path program 1 times [2022-11-04 12:06:56,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-04 12:06:56,941 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2090834674] [2022-11-04 12:06:56,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-04 12:06:56,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-04 12:06:57,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-04 12:06:57,692 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 25 proven. 8 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-04 12:06:57,692 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-04 12:06:57,693 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2090834674] [2022-11-04 12:06:57,693 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2090834674] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-04 12:06:57,693 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1020973532] [2022-11-04 12:06:57,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-04 12:06:57,693 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-04 12:06:57,693 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7bb18a9-a50c-419d-bd5d-676b2b419eee/bin/ugemcutter-C1kR7RIaUi/z3 [2022-11-04 12:06:57,695 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7bb18a9-a50c-419d-bd5d-676b2b419eee/bin/ugemcutter-C1kR7RIaUi/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-04 12:06:57,710 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7bb18a9-a50c-419d-bd5d-676b2b419eee/bin/ugemcutter-C1kR7RIaUi/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-04 12:06:57,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-04 12:06:57,952 INFO L263 TraceCheckSpWp]: Trace formula consists of 522 conjuncts, 36 conjunts are in the unsatisfiable core [2022-11-04 12:06:57,958 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-04 12:06:58,042 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-11-04 12:06:58,162 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-04 12:06:58,163 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-11-04 12:06:58,281 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-11-04 12:06:58,336 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-04 12:06:58,350 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-04 12:06:58,351 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-04 12:06:58,409 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 23 [2022-11-04 12:06:58,431 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-04 12:06:58,433 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-04 12:06:58,435 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 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 [2022-11-04 12:06:58,518 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 30 [2022-11-04 12:06:58,542 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-04 12:06:58,543 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-04 12:06:58,544 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-04 12:06:58,547 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-11-04 12:06:58,656 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-04 12:06:58,690 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 6 proven. 27 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-04 12:06:58,691 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-04 12:06:58,745 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_895 (Array Int Int))) (= (select (select (store |c_#race| |c_thr1Thread1of3ForFork0_acquire_lock_~#cond~0#1.base| v_ArrVal_895) |c_thr1Thread2of3ForFork0_acquire_lock_~#cond~0#1.base|) |c_thr1Thread2of3ForFork0_acquire_lock_~#cond~0#1.offset|) 0)) (forall ((v_ArrVal_895 (Array Int Int))) (= (select (select (store |c_#race| |c_thr1Thread1of3ForFork0_acquire_lock_~#cond~0#1.base| v_ArrVal_895) |c_thr1Thread2of3ForFork0_acquire_lock_~#cond~0#1.base|) (+ |c_thr1Thread2of3ForFork0_acquire_lock_~#cond~0#1.offset| 2)) 0)) (forall ((v_ArrVal_895 (Array Int Int))) (= (select (select (store |c_#race| |c_thr1Thread1of3ForFork0_acquire_lock_~#cond~0#1.base| v_ArrVal_895) |c_thr1Thread2of3ForFork0_acquire_lock_~#cond~0#1.base|) (+ |c_thr1Thread2of3ForFork0_acquire_lock_~#cond~0#1.offset| 1)) 0)) (forall ((v_ArrVal_895 (Array Int Int))) (= (select (select (store |c_#race| |c_thr1Thread1of3ForFork0_acquire_lock_~#cond~0#1.base| v_ArrVal_895) |c_thr1Thread2of3ForFork0_acquire_lock_~#cond~0#1.base|) (+ |c_thr1Thread2of3ForFork0_acquire_lock_~#cond~0#1.offset| 3)) 0))) is different from false [2022-11-04 12:06:58,805 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_thr1Thread2of3ForFork0_acquire_lock_~#cond~0#1.offset| 3))) (let ((.cse0 (store |c_#race| |c_thr1Thread2of3ForFork0_acquire_lock_~#cond~0#1.base| (store (select |c_#race| |c_thr1Thread2of3ForFork0_acquire_lock_~#cond~0#1.base|) .cse1 0)))) (and (forall ((v_ArrVal_895 (Array Int Int))) (= (select (select (store .cse0 |c_thr1Thread1of3ForFork0_acquire_lock_~#cond~0#1.base| v_ArrVal_895) |c_thr1Thread2of3ForFork0_acquire_lock_~#cond~0#1.base|) (+ |c_thr1Thread2of3ForFork0_acquire_lock_~#cond~0#1.offset| 2)) 0)) (forall ((v_ArrVal_895 (Array Int Int))) (= (select (select (store .cse0 |c_thr1Thread1of3ForFork0_acquire_lock_~#cond~0#1.base| v_ArrVal_895) |c_thr1Thread2of3ForFork0_acquire_lock_~#cond~0#1.base|) .cse1) 0)) (forall ((v_ArrVal_895 (Array Int Int))) (= (select (select (store .cse0 |c_thr1Thread1of3ForFork0_acquire_lock_~#cond~0#1.base| v_ArrVal_895) |c_thr1Thread2of3ForFork0_acquire_lock_~#cond~0#1.base|) |c_thr1Thread2of3ForFork0_acquire_lock_~#cond~0#1.offset|) 0)) (forall ((v_ArrVal_895 (Array Int Int))) (= (select (select (store .cse0 |c_thr1Thread1of3ForFork0_acquire_lock_~#cond~0#1.base| v_ArrVal_895) |c_thr1Thread2of3ForFork0_acquire_lock_~#cond~0#1.base|) (+ |c_thr1Thread2of3ForFork0_acquire_lock_~#cond~0#1.offset| 1)) 0))))) is different from false [2022-11-04 12:06:58,838 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_thr1Thread2of3ForFork0_acquire_lock_~#cond~0#1.offset| 3))) (and (forall ((v_ArrVal_892 (Array Int Int)) (v_ArrVal_895 (Array Int Int))) (= (select (select (store (let ((.cse0 (store |c_#race| |c_thr1Thread1of3ForFork0_acquire_lock_~#cond~0#1.base| v_ArrVal_892))) (store .cse0 |c_thr1Thread2of3ForFork0_acquire_lock_~#cond~0#1.base| (store (select .cse0 |c_thr1Thread2of3ForFork0_acquire_lock_~#cond~0#1.base|) .cse1 0))) |c_thr1Thread1of3ForFork0_acquire_lock_~#cond~0#1.base| v_ArrVal_895) |c_thr1Thread2of3ForFork0_acquire_lock_~#cond~0#1.base|) (+ |c_thr1Thread2of3ForFork0_acquire_lock_~#cond~0#1.offset| 1)) 0)) (forall ((v_ArrVal_892 (Array Int Int)) (v_ArrVal_895 (Array Int Int))) (= (select (select (store (let ((.cse2 (store |c_#race| |c_thr1Thread1of3ForFork0_acquire_lock_~#cond~0#1.base| v_ArrVal_892))) (store .cse2 |c_thr1Thread2of3ForFork0_acquire_lock_~#cond~0#1.base| (store (select .cse2 |c_thr1Thread2of3ForFork0_acquire_lock_~#cond~0#1.base|) .cse1 0))) |c_thr1Thread1of3ForFork0_acquire_lock_~#cond~0#1.base| v_ArrVal_895) |c_thr1Thread2of3ForFork0_acquire_lock_~#cond~0#1.base|) .cse1) 0)) (forall ((v_ArrVal_892 (Array Int Int)) (v_ArrVal_895 (Array Int Int))) (= (select (select (store (let ((.cse3 (store |c_#race| |c_thr1Thread1of3ForFork0_acquire_lock_~#cond~0#1.base| v_ArrVal_892))) (store .cse3 |c_thr1Thread2of3ForFork0_acquire_lock_~#cond~0#1.base| (store (select .cse3 |c_thr1Thread2of3ForFork0_acquire_lock_~#cond~0#1.base|) .cse1 0))) |c_thr1Thread1of3ForFork0_acquire_lock_~#cond~0#1.base| v_ArrVal_895) |c_thr1Thread2of3ForFork0_acquire_lock_~#cond~0#1.base|) (+ |c_thr1Thread2of3ForFork0_acquire_lock_~#cond~0#1.offset| 2)) 0)) (forall ((v_ArrVal_892 (Array Int Int)) (v_ArrVal_895 (Array Int Int))) (= (select (select (store (let ((.cse4 (store |c_#race| |c_thr1Thread1of3ForFork0_acquire_lock_~#cond~0#1.base| v_ArrVal_892))) (store .cse4 |c_thr1Thread2of3ForFork0_acquire_lock_~#cond~0#1.base| (store (select .cse4 |c_thr1Thread2of3ForFork0_acquire_lock_~#cond~0#1.base|) .cse1 0))) |c_thr1Thread1of3ForFork0_acquire_lock_~#cond~0#1.base| v_ArrVal_895) |c_thr1Thread2of3ForFork0_acquire_lock_~#cond~0#1.base|) |c_thr1Thread2of3ForFork0_acquire_lock_~#cond~0#1.offset|) 0)))) is different from false [2022-11-04 12:06:58,926 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse5 (+ |c_thr1Thread2of3ForFork0_acquire_lock_~#cond~0#1.offset| 2))) (let ((.cse1 (+ |c_thr1Thread2of3ForFork0_acquire_lock_~#cond~0#1.offset| 3)) (.cse2 (store |c_#race| |c_thr1Thread2of3ForFork0_acquire_lock_~#cond~0#1.base| (store (select |c_#race| |c_thr1Thread2of3ForFork0_acquire_lock_~#cond~0#1.base|) .cse5 0)))) (and (forall ((v_ArrVal_892 (Array Int Int)) (v_ArrVal_895 (Array Int Int))) (= (select (select (store (let ((.cse0 (store .cse2 |c_thr1Thread1of3ForFork0_acquire_lock_~#cond~0#1.base| v_ArrVal_892))) (store .cse0 |c_thr1Thread2of3ForFork0_acquire_lock_~#cond~0#1.base| (store (select .cse0 |c_thr1Thread2of3ForFork0_acquire_lock_~#cond~0#1.base|) .cse1 0))) |c_thr1Thread1of3ForFork0_acquire_lock_~#cond~0#1.base| v_ArrVal_895) |c_thr1Thread2of3ForFork0_acquire_lock_~#cond~0#1.base|) .cse1) 0)) (forall ((v_ArrVal_892 (Array Int Int)) (v_ArrVal_895 (Array Int Int))) (= (select (select (store (let ((.cse3 (store .cse2 |c_thr1Thread1of3ForFork0_acquire_lock_~#cond~0#1.base| v_ArrVal_892))) (store .cse3 |c_thr1Thread2of3ForFork0_acquire_lock_~#cond~0#1.base| (store (select .cse3 |c_thr1Thread2of3ForFork0_acquire_lock_~#cond~0#1.base|) .cse1 0))) |c_thr1Thread1of3ForFork0_acquire_lock_~#cond~0#1.base| v_ArrVal_895) |c_thr1Thread2of3ForFork0_acquire_lock_~#cond~0#1.base|) (+ |c_thr1Thread2of3ForFork0_acquire_lock_~#cond~0#1.offset| 1)) 0)) (forall ((v_ArrVal_892 (Array Int Int)) (v_ArrVal_895 (Array Int Int))) (= (select (select (store (let ((.cse4 (store .cse2 |c_thr1Thread1of3ForFork0_acquire_lock_~#cond~0#1.base| v_ArrVal_892))) (store .cse4 |c_thr1Thread2of3ForFork0_acquire_lock_~#cond~0#1.base| (store (select .cse4 |c_thr1Thread2of3ForFork0_acquire_lock_~#cond~0#1.base|) .cse1 0))) |c_thr1Thread1of3ForFork0_acquire_lock_~#cond~0#1.base| v_ArrVal_895) |c_thr1Thread2of3ForFork0_acquire_lock_~#cond~0#1.base|) .cse5) 0)) (forall ((v_ArrVal_892 (Array Int Int)) (v_ArrVal_895 (Array Int Int))) (= (select (select (store (let ((.cse6 (store .cse2 |c_thr1Thread1of3ForFork0_acquire_lock_~#cond~0#1.base| v_ArrVal_892))) (store .cse6 |c_thr1Thread2of3ForFork0_acquire_lock_~#cond~0#1.base| (store (select .cse6 |c_thr1Thread2of3ForFork0_acquire_lock_~#cond~0#1.base|) .cse1 0))) |c_thr1Thread1of3ForFork0_acquire_lock_~#cond~0#1.base| v_ArrVal_895) |c_thr1Thread2of3ForFork0_acquire_lock_~#cond~0#1.base|) |c_thr1Thread2of3ForFork0_acquire_lock_~#cond~0#1.offset|) 0))))) is different from false [2022-11-04 12:06:58,959 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_thr1Thread2of3ForFork0_acquire_lock_~#cond~0#1.offset| 3)) (.cse3 (+ |c_thr1Thread2of3ForFork0_acquire_lock_~#cond~0#1.offset| 2))) (and (forall ((v_ArrVal_889 (Array Int Int)) (v_ArrVal_892 (Array Int Int)) (v_ArrVal_895 (Array Int Int))) (= 0 (select (select (store (let ((.cse0 (store (let ((.cse2 (store |c_#race| |c_thr1Thread1of3ForFork0_acquire_lock_~#cond~0#1.base| v_ArrVal_889))) (store .cse2 |c_thr1Thread2of3ForFork0_acquire_lock_~#cond~0#1.base| (store (select .cse2 |c_thr1Thread2of3ForFork0_acquire_lock_~#cond~0#1.base|) .cse3 0))) |c_thr1Thread1of3ForFork0_acquire_lock_~#cond~0#1.base| v_ArrVal_892))) (store .cse0 |c_thr1Thread2of3ForFork0_acquire_lock_~#cond~0#1.base| (store (select .cse0 |c_thr1Thread2of3ForFork0_acquire_lock_~#cond~0#1.base|) .cse1 0))) |c_thr1Thread1of3ForFork0_acquire_lock_~#cond~0#1.base| v_ArrVal_895) |c_thr1Thread2of3ForFork0_acquire_lock_~#cond~0#1.base|) .cse1))) (forall ((v_ArrVal_889 (Array Int Int)) (v_ArrVal_892 (Array Int Int)) (v_ArrVal_895 (Array Int Int))) (= (select (select (store (let ((.cse4 (store (let ((.cse5 (store |c_#race| |c_thr1Thread1of3ForFork0_acquire_lock_~#cond~0#1.base| v_ArrVal_889))) (store .cse5 |c_thr1Thread2of3ForFork0_acquire_lock_~#cond~0#1.base| (store (select .cse5 |c_thr1Thread2of3ForFork0_acquire_lock_~#cond~0#1.base|) .cse3 0))) |c_thr1Thread1of3ForFork0_acquire_lock_~#cond~0#1.base| v_ArrVal_892))) (store .cse4 |c_thr1Thread2of3ForFork0_acquire_lock_~#cond~0#1.base| (store (select .cse4 |c_thr1Thread2of3ForFork0_acquire_lock_~#cond~0#1.base|) .cse1 0))) |c_thr1Thread1of3ForFork0_acquire_lock_~#cond~0#1.base| v_ArrVal_895) |c_thr1Thread2of3ForFork0_acquire_lock_~#cond~0#1.base|) .cse3) 0)) (forall ((v_ArrVal_889 (Array Int Int)) (v_ArrVal_892 (Array Int Int)) (v_ArrVal_895 (Array Int Int))) (= (select (select (store (let ((.cse6 (store (let ((.cse7 (store |c_#race| |c_thr1Thread1of3ForFork0_acquire_lock_~#cond~0#1.base| v_ArrVal_889))) (store .cse7 |c_thr1Thread2of3ForFork0_acquire_lock_~#cond~0#1.base| (store (select .cse7 |c_thr1Thread2of3ForFork0_acquire_lock_~#cond~0#1.base|) .cse3 0))) |c_thr1Thread1of3ForFork0_acquire_lock_~#cond~0#1.base| v_ArrVal_892))) (store .cse6 |c_thr1Thread2of3ForFork0_acquire_lock_~#cond~0#1.base| (store (select .cse6 |c_thr1Thread2of3ForFork0_acquire_lock_~#cond~0#1.base|) .cse1 0))) |c_thr1Thread1of3ForFork0_acquire_lock_~#cond~0#1.base| v_ArrVal_895) |c_thr1Thread2of3ForFork0_acquire_lock_~#cond~0#1.base|) |c_thr1Thread2of3ForFork0_acquire_lock_~#cond~0#1.offset|) 0)) (forall ((v_ArrVal_889 (Array Int Int)) (v_ArrVal_892 (Array Int Int)) (v_ArrVal_895 (Array Int Int))) (= (select (select (store (let ((.cse8 (store (let ((.cse9 (store |c_#race| |c_thr1Thread1of3ForFork0_acquire_lock_~#cond~0#1.base| v_ArrVal_889))) (store .cse9 |c_thr1Thread2of3ForFork0_acquire_lock_~#cond~0#1.base| (store (select .cse9 |c_thr1Thread2of3ForFork0_acquire_lock_~#cond~0#1.base|) .cse3 0))) |c_thr1Thread1of3ForFork0_acquire_lock_~#cond~0#1.base| v_ArrVal_892))) (store .cse8 |c_thr1Thread2of3ForFork0_acquire_lock_~#cond~0#1.base| (store (select .cse8 |c_thr1Thread2of3ForFork0_acquire_lock_~#cond~0#1.base|) .cse1 0))) |c_thr1Thread1of3ForFork0_acquire_lock_~#cond~0#1.base| v_ArrVal_895) |c_thr1Thread2of3ForFork0_acquire_lock_~#cond~0#1.base|) (+ |c_thr1Thread2of3ForFork0_acquire_lock_~#cond~0#1.offset| 1)) 0)))) is different from false [2022-11-04 12:06:59,026 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse5 (+ |c_thr1Thread2of3ForFork0_acquire_lock_~#cond~0#1.offset| 1))) (let ((.cse3 (+ |c_thr1Thread2of3ForFork0_acquire_lock_~#cond~0#1.offset| 2)) (.cse4 (store |c_#race| |c_thr1Thread2of3ForFork0_acquire_lock_~#cond~0#1.base| (store (select |c_#race| |c_thr1Thread2of3ForFork0_acquire_lock_~#cond~0#1.base|) .cse5 0))) (.cse1 (+ |c_thr1Thread2of3ForFork0_acquire_lock_~#cond~0#1.offset| 3))) (and (forall ((v_ArrVal_889 (Array Int Int)) (v_ArrVal_892 (Array Int Int)) (v_ArrVal_895 (Array Int Int))) (= (select (select (store (let ((.cse0 (store (let ((.cse2 (store .cse4 |c_thr1Thread1of3ForFork0_acquire_lock_~#cond~0#1.base| v_ArrVal_889))) (store .cse2 |c_thr1Thread2of3ForFork0_acquire_lock_~#cond~0#1.base| (store (select .cse2 |c_thr1Thread2of3ForFork0_acquire_lock_~#cond~0#1.base|) .cse3 0))) |c_thr1Thread1of3ForFork0_acquire_lock_~#cond~0#1.base| v_ArrVal_892))) (store .cse0 |c_thr1Thread2of3ForFork0_acquire_lock_~#cond~0#1.base| (store (select .cse0 |c_thr1Thread2of3ForFork0_acquire_lock_~#cond~0#1.base|) .cse1 0))) |c_thr1Thread1of3ForFork0_acquire_lock_~#cond~0#1.base| v_ArrVal_895) |c_thr1Thread2of3ForFork0_acquire_lock_~#cond~0#1.base|) .cse5) 0)) (forall ((v_ArrVal_889 (Array Int Int)) (v_ArrVal_892 (Array Int Int)) (v_ArrVal_895 (Array Int Int))) (= (select (select (store (let ((.cse6 (store (let ((.cse7 (store .cse4 |c_thr1Thread1of3ForFork0_acquire_lock_~#cond~0#1.base| v_ArrVal_889))) (store .cse7 |c_thr1Thread2of3ForFork0_acquire_lock_~#cond~0#1.base| (store (select .cse7 |c_thr1Thread2of3ForFork0_acquire_lock_~#cond~0#1.base|) .cse3 0))) |c_thr1Thread1of3ForFork0_acquire_lock_~#cond~0#1.base| v_ArrVal_892))) (store .cse6 |c_thr1Thread2of3ForFork0_acquire_lock_~#cond~0#1.base| (store (select .cse6 |c_thr1Thread2of3ForFork0_acquire_lock_~#cond~0#1.base|) .cse1 0))) |c_thr1Thread1of3ForFork0_acquire_lock_~#cond~0#1.base| v_ArrVal_895) |c_thr1Thread2of3ForFork0_acquire_lock_~#cond~0#1.base|) |c_thr1Thread2of3ForFork0_acquire_lock_~#cond~0#1.offset|) 0)) (forall ((v_ArrVal_889 (Array Int Int)) (v_ArrVal_892 (Array Int Int)) (v_ArrVal_895 (Array Int Int))) (= (select (select (store (let ((.cse8 (store (let ((.cse9 (store .cse4 |c_thr1Thread1of3ForFork0_acquire_lock_~#cond~0#1.base| v_ArrVal_889))) (store .cse9 |c_thr1Thread2of3ForFork0_acquire_lock_~#cond~0#1.base| (store (select .cse9 |c_thr1Thread2of3ForFork0_acquire_lock_~#cond~0#1.base|) .cse3 0))) |c_thr1Thread1of3ForFork0_acquire_lock_~#cond~0#1.base| v_ArrVal_892))) (store .cse8 |c_thr1Thread2of3ForFork0_acquire_lock_~#cond~0#1.base| (store (select .cse8 |c_thr1Thread2of3ForFork0_acquire_lock_~#cond~0#1.base|) .cse1 0))) |c_thr1Thread1of3ForFork0_acquire_lock_~#cond~0#1.base| v_ArrVal_895) |c_thr1Thread2of3ForFork0_acquire_lock_~#cond~0#1.base|) .cse3) 0)) (forall ((v_ArrVal_889 (Array Int Int)) (v_ArrVal_892 (Array Int Int)) (v_ArrVal_895 (Array Int Int))) (= (select (select (store (let ((.cse10 (store (let ((.cse11 (store .cse4 |c_thr1Thread1of3ForFork0_acquire_lock_~#cond~0#1.base| v_ArrVal_889))) (store .cse11 |c_thr1Thread2of3ForFork0_acquire_lock_~#cond~0#1.base| (store (select .cse11 |c_thr1Thread2of3ForFork0_acquire_lock_~#cond~0#1.base|) .cse3 0))) |c_thr1Thread1of3ForFork0_acquire_lock_~#cond~0#1.base| v_ArrVal_892))) (store .cse10 |c_thr1Thread2of3ForFork0_acquire_lock_~#cond~0#1.base| (store (select .cse10 |c_thr1Thread2of3ForFork0_acquire_lock_~#cond~0#1.base|) .cse1 0))) |c_thr1Thread1of3ForFork0_acquire_lock_~#cond~0#1.base| v_ArrVal_895) |c_thr1Thread2of3ForFork0_acquire_lock_~#cond~0#1.base|) .cse1) 0))))) is different from false [2022-11-04 12:06:59,055 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_thr1Thread2of3ForFork0_acquire_lock_~#cond~0#1.offset| 3)) (.cse3 (+ |c_thr1Thread2of3ForFork0_acquire_lock_~#cond~0#1.offset| 2)) (.cse5 (+ |c_thr1Thread2of3ForFork0_acquire_lock_~#cond~0#1.offset| 1))) (and (forall ((v_ArrVal_886 (Array Int Int)) (v_ArrVal_889 (Array Int Int)) (v_ArrVal_892 (Array Int Int)) (v_ArrVal_895 (Array Int Int))) (= (select (select (store (let ((.cse0 (store (let ((.cse2 (store (let ((.cse4 (store |c_#race| |c_thr1Thread1of3ForFork0_acquire_lock_~#cond~0#1.base| v_ArrVal_886))) (store .cse4 |c_thr1Thread2of3ForFork0_acquire_lock_~#cond~0#1.base| (store (select .cse4 |c_thr1Thread2of3ForFork0_acquire_lock_~#cond~0#1.base|) .cse5 0))) |c_thr1Thread1of3ForFork0_acquire_lock_~#cond~0#1.base| v_ArrVal_889))) (store .cse2 |c_thr1Thread2of3ForFork0_acquire_lock_~#cond~0#1.base| (store (select .cse2 |c_thr1Thread2of3ForFork0_acquire_lock_~#cond~0#1.base|) .cse3 0))) |c_thr1Thread1of3ForFork0_acquire_lock_~#cond~0#1.base| v_ArrVal_892))) (store .cse0 |c_thr1Thread2of3ForFork0_acquire_lock_~#cond~0#1.base| (store (select .cse0 |c_thr1Thread2of3ForFork0_acquire_lock_~#cond~0#1.base|) .cse1 0))) |c_thr1Thread1of3ForFork0_acquire_lock_~#cond~0#1.base| v_ArrVal_895) |c_thr1Thread2of3ForFork0_acquire_lock_~#cond~0#1.base|) .cse3) 0)) (forall ((v_ArrVal_886 (Array Int Int)) (v_ArrVal_889 (Array Int Int)) (v_ArrVal_892 (Array Int Int)) (v_ArrVal_895 (Array Int Int))) (= (select (select (store (let ((.cse6 (store (let ((.cse7 (store (let ((.cse8 (store |c_#race| |c_thr1Thread1of3ForFork0_acquire_lock_~#cond~0#1.base| v_ArrVal_886))) (store .cse8 |c_thr1Thread2of3ForFork0_acquire_lock_~#cond~0#1.base| (store (select .cse8 |c_thr1Thread2of3ForFork0_acquire_lock_~#cond~0#1.base|) .cse5 0))) |c_thr1Thread1of3ForFork0_acquire_lock_~#cond~0#1.base| v_ArrVal_889))) (store .cse7 |c_thr1Thread2of3ForFork0_acquire_lock_~#cond~0#1.base| (store (select .cse7 |c_thr1Thread2of3ForFork0_acquire_lock_~#cond~0#1.base|) .cse3 0))) |c_thr1Thread1of3ForFork0_acquire_lock_~#cond~0#1.base| v_ArrVal_892))) (store .cse6 |c_thr1Thread2of3ForFork0_acquire_lock_~#cond~0#1.base| (store (select .cse6 |c_thr1Thread2of3ForFork0_acquire_lock_~#cond~0#1.base|) .cse1 0))) |c_thr1Thread1of3ForFork0_acquire_lock_~#cond~0#1.base| v_ArrVal_895) |c_thr1Thread2of3ForFork0_acquire_lock_~#cond~0#1.base|) .cse1) 0)) (forall ((v_ArrVal_886 (Array Int Int)) (v_ArrVal_889 (Array Int Int)) (v_ArrVal_892 (Array Int Int)) (v_ArrVal_895 (Array Int Int))) (= (select (select (store (let ((.cse9 (store (let ((.cse10 (store (let ((.cse11 (store |c_#race| |c_thr1Thread1of3ForFork0_acquire_lock_~#cond~0#1.base| v_ArrVal_886))) (store .cse11 |c_thr1Thread2of3ForFork0_acquire_lock_~#cond~0#1.base| (store (select .cse11 |c_thr1Thread2of3ForFork0_acquire_lock_~#cond~0#1.base|) .cse5 0))) |c_thr1Thread1of3ForFork0_acquire_lock_~#cond~0#1.base| v_ArrVal_889))) (store .cse10 |c_thr1Thread2of3ForFork0_acquire_lock_~#cond~0#1.base| (store (select .cse10 |c_thr1Thread2of3ForFork0_acquire_lock_~#cond~0#1.base|) .cse3 0))) |c_thr1Thread1of3ForFork0_acquire_lock_~#cond~0#1.base| v_ArrVal_892))) (store .cse9 |c_thr1Thread2of3ForFork0_acquire_lock_~#cond~0#1.base| (store (select .cse9 |c_thr1Thread2of3ForFork0_acquire_lock_~#cond~0#1.base|) .cse1 0))) |c_thr1Thread1of3ForFork0_acquire_lock_~#cond~0#1.base| v_ArrVal_895) |c_thr1Thread2of3ForFork0_acquire_lock_~#cond~0#1.base|) .cse5) 0)) (forall ((v_ArrVal_886 (Array Int Int)) (v_ArrVal_889 (Array Int Int)) (v_ArrVal_892 (Array Int Int)) (v_ArrVal_895 (Array Int Int))) (= (select (select (store (let ((.cse12 (store (let ((.cse13 (store (let ((.cse14 (store |c_#race| |c_thr1Thread1of3ForFork0_acquire_lock_~#cond~0#1.base| v_ArrVal_886))) (store .cse14 |c_thr1Thread2of3ForFork0_acquire_lock_~#cond~0#1.base| (store (select .cse14 |c_thr1Thread2of3ForFork0_acquire_lock_~#cond~0#1.base|) .cse5 0))) |c_thr1Thread1of3ForFork0_acquire_lock_~#cond~0#1.base| v_ArrVal_889))) (store .cse13 |c_thr1Thread2of3ForFork0_acquire_lock_~#cond~0#1.base| (store (select .cse13 |c_thr1Thread2of3ForFork0_acquire_lock_~#cond~0#1.base|) .cse3 0))) |c_thr1Thread1of3ForFork0_acquire_lock_~#cond~0#1.base| v_ArrVal_892))) (store .cse12 |c_thr1Thread2of3ForFork0_acquire_lock_~#cond~0#1.base| (store (select .cse12 |c_thr1Thread2of3ForFork0_acquire_lock_~#cond~0#1.base|) .cse1 0))) |c_thr1Thread1of3ForFork0_acquire_lock_~#cond~0#1.base| v_ArrVal_895) |c_thr1Thread2of3ForFork0_acquire_lock_~#cond~0#1.base|) |c_thr1Thread2of3ForFork0_acquire_lock_~#cond~0#1.offset|) 0)))) is different from false [2022-11-04 12:06:59,109 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-04 12:06:59,110 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 188 treesize of output 133 [2022-11-04 12:06:59,127 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 254 treesize of output 250 [2022-11-04 12:06:59,136 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 29 treesize of output 25 [2022-11-04 12:06:59,139 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 54 treesize of output 46 [2022-11-04 12:06:59,143 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 24 treesize of output 20 [2022-11-04 12:06:59,159 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-04 12:06:59,160 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 188 treesize of output 1 [2022-11-04 12:06:59,166 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-04 12:06:59,166 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 186 treesize of output 1 [2022-11-04 12:06:59,172 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-04 12:06:59,172 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 188 treesize of output 1 [2022-11-04 12:06:59,239 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 24 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 5 not checked. [2022-11-04 12:06:59,239 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1020973532] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-04 12:06:59,240 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-04 12:06:59,240 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 11, 12] total 25 [2022-11-04 12:06:59,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1523524593] [2022-11-04 12:06:59,242 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-04 12:06:59,243 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-11-04 12:06:59,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-04 12:06:59,243 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-11-04 12:06:59,245 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=237, Unknown=7, NotChecked=266, Total=600 [2022-11-04 12:06:59,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-04 12:06:59,245 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-04 12:06:59,246 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 7.64) internal successors, (191), 25 states have internal predecessors, (191), 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) [2022-11-04 12:06:59,246 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-04 12:06:59,246 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-04 12:06:59,246 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-04 12:07:06,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-04 12:07:06,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-04 12:07:06,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-04 12:07:07,035 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7bb18a9-a50c-419d-bd5d-676b2b419eee/bin/ugemcutter-C1kR7RIaUi/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-04 12:07:07,193 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7bb18a9-a50c-419d-bd5d-676b2b419eee/bin/ugemcutter-C1kR7RIaUi/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-04 12:07:07,193 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting thr1Err3ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2022-11-04 12:07:07,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-04 12:07:07,194 INFO L85 PathProgramCache]: Analyzing trace with hash -2037917281, now seen corresponding path program 1 times [2022-11-04 12:07:07,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-04 12:07:07,194 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [355463136] [2022-11-04 12:07:07,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-04 12:07:07,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-04 12:07:07,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-04 12:07:09,709 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 21 proven. 2 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-11-04 12:07:09,710 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-04 12:07:09,710 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [355463136] [2022-11-04 12:07:09,710 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [355463136] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-04 12:07:09,710 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1420719790] [2022-11-04 12:07:09,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-04 12:07:09,711 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-04 12:07:09,711 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7bb18a9-a50c-419d-bd5d-676b2b419eee/bin/ugemcutter-C1kR7RIaUi/z3 [2022-11-04 12:07:09,712 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7bb18a9-a50c-419d-bd5d-676b2b419eee/bin/ugemcutter-C1kR7RIaUi/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-04 12:07:09,719 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7bb18a9-a50c-419d-bd5d-676b2b419eee/bin/ugemcutter-C1kR7RIaUi/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-04 12:07:09,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-04 12:07:09,972 INFO L263 TraceCheckSpWp]: Trace formula consists of 549 conjuncts, 75 conjunts are in the unsatisfiable core [2022-11-04 12:07:09,980 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-04 12:07:10,207 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-11-04 12:07:10,305 INFO L356 Elim1Store]: treesize reduction 26, result has 42.2 percent of original size [2022-11-04 12:07:10,305 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 74 [2022-11-04 12:07:10,319 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 8 treesize of output 7 [2022-11-04 12:07:10,330 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 8 treesize of output 7 [2022-11-04 12:07:10,424 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 5 [2022-11-04 12:07:10,435 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-04 12:07:10,523 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-04 12:07:10,524 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2022-11-04 12:07:10,793 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-04 12:07:10,794 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-04 12:07:11,034 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-11-04 12:07:11,112 INFO L356 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-11-04 12:07:11,113 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 18 [2022-11-04 12:07:11,187 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-04 12:07:11,194 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-04 12:07:11,194 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 30 [2022-11-04 12:07:11,282 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-04 12:07:11,282 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1 case distinctions, treesize of input 30 treesize of output 33 [2022-11-04 12:07:11,318 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-04 12:07:11,319 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-04 12:07:11,320 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-04 12:07:11,329 INFO L356 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-11-04 12:07:11,330 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 3 case distinctions, treesize of input 37 treesize of output 42 [2022-11-04 12:07:11,428 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-04 12:07:11,429 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-04 12:07:11,430 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-04 12:07:11,433 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-04 12:07:11,434 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-04 12:07:11,441 INFO L356 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2022-11-04 12:07:11,441 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 46 treesize of output 54 [2022-11-04 12:07:11,551 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-04 12:07:11,552 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1 case distinctions, treesize of input 48 treesize of output 47 [2022-11-04 12:07:11,600 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-04 12:07:11,601 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-04 12:07:11,602 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-04 12:07:11,603 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-04 12:07:11,604 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-04 12:07:11,605 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-04 12:07:11,608 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-04 12:07:11,618 INFO L356 Elim1Store]: treesize reduction 35, result has 20.5 percent of original size [2022-11-04 12:07:11,619 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 7 case distinctions, treesize of input 55 treesize of output 66 [2022-11-04 12:07:11,750 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-04 12:07:11,752 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-04 12:07:11,753 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-04 12:07:11,754 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-04 12:07:11,755 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-04 12:07:11,758 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-04 12:07:11,759 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-04 12:07:11,761 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-04 12:07:11,762 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-04 12:07:11,762 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-04 12:07:11,771 INFO L356 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2022-11-04 12:07:11,771 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 9 case distinctions, treesize of input 64 treesize of output 78 [2022-11-04 12:07:11,902 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-04 12:07:11,903 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1 case distinctions, treesize of input 66 treesize of output 61 [2022-11-04 12:07:12,018 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-04 12:07:12,019 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-04 12:07:12,021 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-04 12:07:12,022 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-04 12:07:12,023 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-04 12:07:12,025 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-04 12:07:12,026 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-04 12:07:12,027 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-04 12:07:12,038 INFO L356 Elim1Store]: treesize reduction 43, result has 17.3 percent of original size [2022-11-04 12:07:12,038 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 9 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 13 case distinctions, treesize of input 67 treesize of output 84 [2022-11-04 12:07:12,129 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 19 proven. 6 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-11-04 12:07:12,130 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-04 12:07:12,242 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_thr1Thread3of3ForFork0_acquire_lock_~#cond~0#1.offset| 3))) (and (forall ((v_ArrVal_1201 (Array Int Int))) (= (select (select (let ((.cse0 (store |c_#race| |c_thr1Thread2of3ForFork0_acquire_lock_~#cond~0#1.base| v_ArrVal_1201))) (store .cse0 |c_thr1Thread3of3ForFork0_acquire_lock_~#cond~0#1.base| (store (select .cse0 |c_thr1Thread3of3ForFork0_acquire_lock_~#cond~0#1.base|) .cse1 0))) |c_~#lock~0.base|) (+ |c_~#lock~0.offset| 1)) 0)) (forall ((v_ArrVal_1201 (Array Int Int))) (= (select (select (let ((.cse2 (store |c_#race| |c_thr1Thread2of3ForFork0_acquire_lock_~#cond~0#1.base| v_ArrVal_1201))) (store .cse2 |c_thr1Thread3of3ForFork0_acquire_lock_~#cond~0#1.base| (store (select .cse2 |c_thr1Thread3of3ForFork0_acquire_lock_~#cond~0#1.base|) .cse1 0))) |c_~#lock~0.base|) (+ |c_~#lock~0.offset| 2)) 0)) (forall ((v_ArrVal_1201 (Array Int Int))) (= (select (select (let ((.cse3 (store |c_#race| |c_thr1Thread2of3ForFork0_acquire_lock_~#cond~0#1.base| v_ArrVal_1201))) (store .cse3 |c_thr1Thread3of3ForFork0_acquire_lock_~#cond~0#1.base| (store (select .cse3 |c_thr1Thread3of3ForFork0_acquire_lock_~#cond~0#1.base|) .cse1 0))) |c_~#lock~0.base|) (+ |c_~#lock~0.offset| 3)) 0)) (forall ((v_ArrVal_1201 (Array Int Int))) (= (select (select (let ((.cse4 (store |c_#race| |c_thr1Thread2of3ForFork0_acquire_lock_~#cond~0#1.base| v_ArrVal_1201))) (store .cse4 |c_thr1Thread3of3ForFork0_acquire_lock_~#cond~0#1.base| (store (select .cse4 |c_thr1Thread3of3ForFork0_acquire_lock_~#cond~0#1.base|) .cse1 0))) |c_~#lock~0.base|) |c_~#lock~0.offset|) 0)))) is different from false [2022-11-04 12:07:12,431 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse4 (+ |c_~#lock~0.offset| 3))) (let ((.cse1 (+ |c_thr1Thread3of3ForFork0_acquire_lock_~#cond~0#1.offset| 3)) (.cse2 (let ((.cse7 (store |c_#race| |c_thr1Thread3of3ForFork0_acquire_lock_~#cond~0#1.base| (store (select |c_#race| |c_thr1Thread3of3ForFork0_acquire_lock_~#cond~0#1.base|) (+ |c_thr1Thread3of3ForFork0_acquire_lock_~#cond~0#1.offset| 2) 0)))) (store .cse7 |c_~#lock~0.base| (store (select .cse7 |c_~#lock~0.base|) .cse4 0))))) (and (forall ((v_ArrVal_1201 (Array Int Int))) (= (select (select (let ((.cse0 (store .cse2 |c_thr1Thread2of3ForFork0_acquire_lock_~#cond~0#1.base| v_ArrVal_1201))) (store .cse0 |c_thr1Thread3of3ForFork0_acquire_lock_~#cond~0#1.base| (store (select .cse0 |c_thr1Thread3of3ForFork0_acquire_lock_~#cond~0#1.base|) .cse1 0))) |c_~#lock~0.base|) (+ |c_~#lock~0.offset| 2)) 0)) (forall ((v_ArrVal_1201 (Array Int Int))) (= 0 (select (select (let ((.cse3 (store .cse2 |c_thr1Thread2of3ForFork0_acquire_lock_~#cond~0#1.base| v_ArrVal_1201))) (store .cse3 |c_thr1Thread3of3ForFork0_acquire_lock_~#cond~0#1.base| (store (select .cse3 |c_thr1Thread3of3ForFork0_acquire_lock_~#cond~0#1.base|) .cse1 0))) |c_~#lock~0.base|) .cse4))) (forall ((v_ArrVal_1201 (Array Int Int))) (= (select (select (let ((.cse5 (store .cse2 |c_thr1Thread2of3ForFork0_acquire_lock_~#cond~0#1.base| v_ArrVal_1201))) (store .cse5 |c_thr1Thread3of3ForFork0_acquire_lock_~#cond~0#1.base| (store (select .cse5 |c_thr1Thread3of3ForFork0_acquire_lock_~#cond~0#1.base|) .cse1 0))) |c_~#lock~0.base|) |c_~#lock~0.offset|) 0)) (forall ((v_ArrVal_1201 (Array Int Int))) (= (select (select (let ((.cse6 (store .cse2 |c_thr1Thread2of3ForFork0_acquire_lock_~#cond~0#1.base| v_ArrVal_1201))) (store .cse6 |c_thr1Thread3of3ForFork0_acquire_lock_~#cond~0#1.base| (store (select .cse6 |c_thr1Thread3of3ForFork0_acquire_lock_~#cond~0#1.base|) .cse1 0))) |c_~#lock~0.base|) (+ |c_~#lock~0.offset| 1)) 0))))) is different from false [2022-11-04 12:07:12,473 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_thr1Thread3of3ForFork0_acquire_lock_~#cond~0#1.offset| 3)) (.cse3 (+ |c_~#lock~0.offset| 3)) (.cse5 (+ |c_thr1Thread3of3ForFork0_acquire_lock_~#cond~0#1.offset| 2))) (and (forall ((v_ArrVal_1201 (Array Int Int)) (v_ArrVal_1196 (Array Int Int))) (= (select (select (let ((.cse0 (store (let ((.cse2 (let ((.cse4 (store |c_#race| |c_thr1Thread2of3ForFork0_acquire_lock_~#cond~0#1.base| v_ArrVal_1196))) (store .cse4 |c_thr1Thread3of3ForFork0_acquire_lock_~#cond~0#1.base| (store (select .cse4 |c_thr1Thread3of3ForFork0_acquire_lock_~#cond~0#1.base|) .cse5 0))))) (store .cse2 |c_~#lock~0.base| (store (select .cse2 |c_~#lock~0.base|) .cse3 0))) |c_thr1Thread2of3ForFork0_acquire_lock_~#cond~0#1.base| v_ArrVal_1201))) (store .cse0 |c_thr1Thread3of3ForFork0_acquire_lock_~#cond~0#1.base| (store (select .cse0 |c_thr1Thread3of3ForFork0_acquire_lock_~#cond~0#1.base|) .cse1 0))) |c_~#lock~0.base|) |c_~#lock~0.offset|) 0)) (forall ((v_ArrVal_1201 (Array Int Int)) (v_ArrVal_1196 (Array Int Int))) (= (select (select (let ((.cse6 (store (let ((.cse7 (let ((.cse8 (store |c_#race| |c_thr1Thread2of3ForFork0_acquire_lock_~#cond~0#1.base| v_ArrVal_1196))) (store .cse8 |c_thr1Thread3of3ForFork0_acquire_lock_~#cond~0#1.base| (store (select .cse8 |c_thr1Thread3of3ForFork0_acquire_lock_~#cond~0#1.base|) .cse5 0))))) (store .cse7 |c_~#lock~0.base| (store (select .cse7 |c_~#lock~0.base|) .cse3 0))) |c_thr1Thread2of3ForFork0_acquire_lock_~#cond~0#1.base| v_ArrVal_1201))) (store .cse6 |c_thr1Thread3of3ForFork0_acquire_lock_~#cond~0#1.base| (store (select .cse6 |c_thr1Thread3of3ForFork0_acquire_lock_~#cond~0#1.base|) .cse1 0))) |c_~#lock~0.base|) (+ |c_~#lock~0.offset| 2)) 0)) (forall ((v_ArrVal_1201 (Array Int Int)) (v_ArrVal_1196 (Array Int Int))) (= (select (select (let ((.cse9 (store (let ((.cse10 (let ((.cse11 (store |c_#race| |c_thr1Thread2of3ForFork0_acquire_lock_~#cond~0#1.base| v_ArrVal_1196))) (store .cse11 |c_thr1Thread3of3ForFork0_acquire_lock_~#cond~0#1.base| (store (select .cse11 |c_thr1Thread3of3ForFork0_acquire_lock_~#cond~0#1.base|) .cse5 0))))) (store .cse10 |c_~#lock~0.base| (store (select .cse10 |c_~#lock~0.base|) .cse3 0))) |c_thr1Thread2of3ForFork0_acquire_lock_~#cond~0#1.base| v_ArrVal_1201))) (store .cse9 |c_thr1Thread3of3ForFork0_acquire_lock_~#cond~0#1.base| (store (select .cse9 |c_thr1Thread3of3ForFork0_acquire_lock_~#cond~0#1.base|) .cse1 0))) |c_~#lock~0.base|) .cse3) 0)) (forall ((v_ArrVal_1201 (Array Int Int)) (v_ArrVal_1196 (Array Int Int))) (= (select (select (let ((.cse12 (store (let ((.cse13 (let ((.cse14 (store |c_#race| |c_thr1Thread2of3ForFork0_acquire_lock_~#cond~0#1.base| v_ArrVal_1196))) (store .cse14 |c_thr1Thread3of3ForFork0_acquire_lock_~#cond~0#1.base| (store (select .cse14 |c_thr1Thread3of3ForFork0_acquire_lock_~#cond~0#1.base|) .cse5 0))))) (store .cse13 |c_~#lock~0.base| (store (select .cse13 |c_~#lock~0.base|) .cse3 0))) |c_thr1Thread2of3ForFork0_acquire_lock_~#cond~0#1.base| v_ArrVal_1201))) (store .cse12 |c_thr1Thread3of3ForFork0_acquire_lock_~#cond~0#1.base| (store (select .cse12 |c_thr1Thread3of3ForFork0_acquire_lock_~#cond~0#1.base|) .cse1 0))) |c_~#lock~0.base|) (+ |c_~#lock~0.offset| 1)) 0)))) is different from false [2022-11-04 12:07:14,194 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_thr1Thread3of3ForFork0_acquire_lock_~#cond~0#1.offset| 3)) (.cse3 (+ |c_~#lock~0.offset| 3)) (.cse5 (+ |c_thr1Thread3of3ForFork0_acquire_lock_~#cond~0#1.offset| 2)) (.cse7 (+ |c_~#lock~0.offset| 2)) (.cse9 (+ |c_thr1Thread3of3ForFork0_acquire_lock_~#cond~0#1.offset| 1))) (and (forall ((v_ArrVal_1191 (Array Int Int)) (v_ArrVal_1201 (Array Int Int)) (v_ArrVal_1196 (Array Int Int))) (= (select (select (let ((.cse0 (store (let ((.cse2 (let ((.cse4 (store (let ((.cse6 (let ((.cse8 (store |c_#race| |c_thr1Thread2of3ForFork0_acquire_lock_~#cond~0#1.base| v_ArrVal_1191))) (store .cse8 |c_thr1Thread3of3ForFork0_acquire_lock_~#cond~0#1.base| (store (select .cse8 |c_thr1Thread3of3ForFork0_acquire_lock_~#cond~0#1.base|) .cse9 0))))) (store .cse6 |c_~#lock~0.base| (store (select .cse6 |c_~#lock~0.base|) .cse7 0))) |c_thr1Thread2of3ForFork0_acquire_lock_~#cond~0#1.base| v_ArrVal_1196))) (store .cse4 |c_thr1Thread3of3ForFork0_acquire_lock_~#cond~0#1.base| (store (select .cse4 |c_thr1Thread3of3ForFork0_acquire_lock_~#cond~0#1.base|) .cse5 0))))) (store .cse2 |c_~#lock~0.base| (store (select .cse2 |c_~#lock~0.base|) .cse3 0))) |c_thr1Thread2of3ForFork0_acquire_lock_~#cond~0#1.base| v_ArrVal_1201))) (store .cse0 |c_thr1Thread3of3ForFork0_acquire_lock_~#cond~0#1.base| (store (select .cse0 |c_thr1Thread3of3ForFork0_acquire_lock_~#cond~0#1.base|) .cse1 0))) |c_~#lock~0.base|) .cse3) 0)) (forall ((v_ArrVal_1191 (Array Int Int)) (v_ArrVal_1201 (Array Int Int)) (v_ArrVal_1196 (Array Int Int))) (= (select (select (let ((.cse10 (store (let ((.cse11 (let ((.cse12 (store (let ((.cse13 (let ((.cse14 (store |c_#race| |c_thr1Thread2of3ForFork0_acquire_lock_~#cond~0#1.base| v_ArrVal_1191))) (store .cse14 |c_thr1Thread3of3ForFork0_acquire_lock_~#cond~0#1.base| (store (select .cse14 |c_thr1Thread3of3ForFork0_acquire_lock_~#cond~0#1.base|) .cse9 0))))) (store .cse13 |c_~#lock~0.base| (store (select .cse13 |c_~#lock~0.base|) .cse7 0))) |c_thr1Thread2of3ForFork0_acquire_lock_~#cond~0#1.base| v_ArrVal_1196))) (store .cse12 |c_thr1Thread3of3ForFork0_acquire_lock_~#cond~0#1.base| (store (select .cse12 |c_thr1Thread3of3ForFork0_acquire_lock_~#cond~0#1.base|) .cse5 0))))) (store .cse11 |c_~#lock~0.base| (store (select .cse11 |c_~#lock~0.base|) .cse3 0))) |c_thr1Thread2of3ForFork0_acquire_lock_~#cond~0#1.base| v_ArrVal_1201))) (store .cse10 |c_thr1Thread3of3ForFork0_acquire_lock_~#cond~0#1.base| (store (select .cse10 |c_thr1Thread3of3ForFork0_acquire_lock_~#cond~0#1.base|) .cse1 0))) |c_~#lock~0.base|) (+ |c_~#lock~0.offset| 1)) 0)) (forall ((v_ArrVal_1191 (Array Int Int)) (v_ArrVal_1201 (Array Int Int)) (v_ArrVal_1196 (Array Int Int))) (= (select (select (let ((.cse15 (store (let ((.cse16 (let ((.cse17 (store (let ((.cse18 (let ((.cse19 (store |c_#race| |c_thr1Thread2of3ForFork0_acquire_lock_~#cond~0#1.base| v_ArrVal_1191))) (store .cse19 |c_thr1Thread3of3ForFork0_acquire_lock_~#cond~0#1.base| (store (select .cse19 |c_thr1Thread3of3ForFork0_acquire_lock_~#cond~0#1.base|) .cse9 0))))) (store .cse18 |c_~#lock~0.base| (store (select .cse18 |c_~#lock~0.base|) .cse7 0))) |c_thr1Thread2of3ForFork0_acquire_lock_~#cond~0#1.base| v_ArrVal_1196))) (store .cse17 |c_thr1Thread3of3ForFork0_acquire_lock_~#cond~0#1.base| (store (select .cse17 |c_thr1Thread3of3ForFork0_acquire_lock_~#cond~0#1.base|) .cse5 0))))) (store .cse16 |c_~#lock~0.base| (store (select .cse16 |c_~#lock~0.base|) .cse3 0))) |c_thr1Thread2of3ForFork0_acquire_lock_~#cond~0#1.base| v_ArrVal_1201))) (store .cse15 |c_thr1Thread3of3ForFork0_acquire_lock_~#cond~0#1.base| (store (select .cse15 |c_thr1Thread3of3ForFork0_acquire_lock_~#cond~0#1.base|) .cse1 0))) |c_~#lock~0.base|) .cse7) 0)) (forall ((v_ArrVal_1191 (Array Int Int)) (v_ArrVal_1201 (Array Int Int)) (v_ArrVal_1196 (Array Int Int))) (= (select (select (let ((.cse20 (store (let ((.cse21 (let ((.cse22 (store (let ((.cse23 (let ((.cse24 (store |c_#race| |c_thr1Thread2of3ForFork0_acquire_lock_~#cond~0#1.base| v_ArrVal_1191))) (store .cse24 |c_thr1Thread3of3ForFork0_acquire_lock_~#cond~0#1.base| (store (select .cse24 |c_thr1Thread3of3ForFork0_acquire_lock_~#cond~0#1.base|) .cse9 0))))) (store .cse23 |c_~#lock~0.base| (store (select .cse23 |c_~#lock~0.base|) .cse7 0))) |c_thr1Thread2of3ForFork0_acquire_lock_~#cond~0#1.base| v_ArrVal_1196))) (store .cse22 |c_thr1Thread3of3ForFork0_acquire_lock_~#cond~0#1.base| (store (select .cse22 |c_thr1Thread3of3ForFork0_acquire_lock_~#cond~0#1.base|) .cse5 0))))) (store .cse21 |c_~#lock~0.base| (store (select .cse21 |c_~#lock~0.base|) .cse3 0))) |c_thr1Thread2of3ForFork0_acquire_lock_~#cond~0#1.base| v_ArrVal_1201))) (store .cse20 |c_thr1Thread3of3ForFork0_acquire_lock_~#cond~0#1.base| (store (select .cse20 |c_thr1Thread3of3ForFork0_acquire_lock_~#cond~0#1.base|) .cse1 0))) |c_~#lock~0.base|) |c_~#lock~0.offset|) 0)))) is different from false [2022-11-04 12:07:14,391 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse26 (+ |c_~#lock~0.offset| 1))) (let ((.cse1 (+ |c_thr1Thread3of3ForFork0_acquire_lock_~#cond~0#1.offset| 3)) (.cse3 (+ |c_~#lock~0.offset| 3)) (.cse5 (+ |c_thr1Thread3of3ForFork0_acquire_lock_~#cond~0#1.offset| 2)) (.cse7 (+ |c_~#lock~0.offset| 2)) (.cse9 (+ |c_thr1Thread3of3ForFork0_acquire_lock_~#cond~0#1.offset| 1)) (.cse10 (store |c_#race| |c_~#lock~0.base| (store (select |c_#race| |c_~#lock~0.base|) .cse26 0)))) (and (forall ((v_ArrVal_1191 (Array Int Int)) (v_ArrVal_1201 (Array Int Int)) (v_ArrVal_1196 (Array Int Int))) (= (select (select (let ((.cse0 (store (let ((.cse2 (let ((.cse4 (store (let ((.cse6 (let ((.cse8 (store .cse10 |c_thr1Thread2of3ForFork0_acquire_lock_~#cond~0#1.base| v_ArrVal_1191))) (store .cse8 |c_thr1Thread3of3ForFork0_acquire_lock_~#cond~0#1.base| (store (select .cse8 |c_thr1Thread3of3ForFork0_acquire_lock_~#cond~0#1.base|) .cse9 0))))) (store .cse6 |c_~#lock~0.base| (store (select .cse6 |c_~#lock~0.base|) .cse7 0))) |c_thr1Thread2of3ForFork0_acquire_lock_~#cond~0#1.base| v_ArrVal_1196))) (store .cse4 |c_thr1Thread3of3ForFork0_acquire_lock_~#cond~0#1.base| (store (select .cse4 |c_thr1Thread3of3ForFork0_acquire_lock_~#cond~0#1.base|) .cse5 0))))) (store .cse2 |c_~#lock~0.base| (store (select .cse2 |c_~#lock~0.base|) .cse3 0))) |c_thr1Thread2of3ForFork0_acquire_lock_~#cond~0#1.base| v_ArrVal_1201))) (store .cse0 |c_thr1Thread3of3ForFork0_acquire_lock_~#cond~0#1.base| (store (select .cse0 |c_thr1Thread3of3ForFork0_acquire_lock_~#cond~0#1.base|) .cse1 0))) |c_~#lock~0.base|) .cse7) 0)) (forall ((v_ArrVal_1191 (Array Int Int)) (v_ArrVal_1201 (Array Int Int)) (v_ArrVal_1196 (Array Int Int))) (= 0 (select (select (let ((.cse11 (store (let ((.cse12 (let ((.cse13 (store (let ((.cse14 (let ((.cse15 (store .cse10 |c_thr1Thread2of3ForFork0_acquire_lock_~#cond~0#1.base| v_ArrVal_1191))) (store .cse15 |c_thr1Thread3of3ForFork0_acquire_lock_~#cond~0#1.base| (store (select .cse15 |c_thr1Thread3of3ForFork0_acquire_lock_~#cond~0#1.base|) .cse9 0))))) (store .cse14 |c_~#lock~0.base| (store (select .cse14 |c_~#lock~0.base|) .cse7 0))) |c_thr1Thread2of3ForFork0_acquire_lock_~#cond~0#1.base| v_ArrVal_1196))) (store .cse13 |c_thr1Thread3of3ForFork0_acquire_lock_~#cond~0#1.base| (store (select .cse13 |c_thr1Thread3of3ForFork0_acquire_lock_~#cond~0#1.base|) .cse5 0))))) (store .cse12 |c_~#lock~0.base| (store (select .cse12 |c_~#lock~0.base|) .cse3 0))) |c_thr1Thread2of3ForFork0_acquire_lock_~#cond~0#1.base| v_ArrVal_1201))) (store .cse11 |c_thr1Thread3of3ForFork0_acquire_lock_~#cond~0#1.base| (store (select .cse11 |c_thr1Thread3of3ForFork0_acquire_lock_~#cond~0#1.base|) .cse1 0))) |c_~#lock~0.base|) .cse3))) (forall ((v_ArrVal_1191 (Array Int Int)) (v_ArrVal_1201 (Array Int Int)) (v_ArrVal_1196 (Array Int Int))) (= 0 (select (select (let ((.cse16 (store (let ((.cse17 (let ((.cse18 (store (let ((.cse19 (let ((.cse20 (store .cse10 |c_thr1Thread2of3ForFork0_acquire_lock_~#cond~0#1.base| v_ArrVal_1191))) (store .cse20 |c_thr1Thread3of3ForFork0_acquire_lock_~#cond~0#1.base| (store (select .cse20 |c_thr1Thread3of3ForFork0_acquire_lock_~#cond~0#1.base|) .cse9 0))))) (store .cse19 |c_~#lock~0.base| (store (select .cse19 |c_~#lock~0.base|) .cse7 0))) |c_thr1Thread2of3ForFork0_acquire_lock_~#cond~0#1.base| v_ArrVal_1196))) (store .cse18 |c_thr1Thread3of3ForFork0_acquire_lock_~#cond~0#1.base| (store (select .cse18 |c_thr1Thread3of3ForFork0_acquire_lock_~#cond~0#1.base|) .cse5 0))))) (store .cse17 |c_~#lock~0.base| (store (select .cse17 |c_~#lock~0.base|) .cse3 0))) |c_thr1Thread2of3ForFork0_acquire_lock_~#cond~0#1.base| v_ArrVal_1201))) (store .cse16 |c_thr1Thread3of3ForFork0_acquire_lock_~#cond~0#1.base| (store (select .cse16 |c_thr1Thread3of3ForFork0_acquire_lock_~#cond~0#1.base|) .cse1 0))) |c_~#lock~0.base|) |c_~#lock~0.offset|))) (forall ((v_ArrVal_1191 (Array Int Int)) (v_ArrVal_1201 (Array Int Int)) (v_ArrVal_1196 (Array Int Int))) (= (select (select (let ((.cse21 (store (let ((.cse22 (let ((.cse23 (store (let ((.cse24 (let ((.cse25 (store .cse10 |c_thr1Thread2of3ForFork0_acquire_lock_~#cond~0#1.base| v_ArrVal_1191))) (store .cse25 |c_thr1Thread3of3ForFork0_acquire_lock_~#cond~0#1.base| (store (select .cse25 |c_thr1Thread3of3ForFork0_acquire_lock_~#cond~0#1.base|) .cse9 0))))) (store .cse24 |c_~#lock~0.base| (store (select .cse24 |c_~#lock~0.base|) .cse7 0))) |c_thr1Thread2of3ForFork0_acquire_lock_~#cond~0#1.base| v_ArrVal_1196))) (store .cse23 |c_thr1Thread3of3ForFork0_acquire_lock_~#cond~0#1.base| (store (select .cse23 |c_thr1Thread3of3ForFork0_acquire_lock_~#cond~0#1.base|) .cse5 0))))) (store .cse22 |c_~#lock~0.base| (store (select .cse22 |c_~#lock~0.base|) .cse3 0))) |c_thr1Thread2of3ForFork0_acquire_lock_~#cond~0#1.base| v_ArrVal_1201))) (store .cse21 |c_thr1Thread3of3ForFork0_acquire_lock_~#cond~0#1.base| (store (select .cse21 |c_thr1Thread3of3ForFork0_acquire_lock_~#cond~0#1.base|) .cse1 0))) |c_~#lock~0.base|) .cse26) 0))))) is different from false [2022-11-04 12:07:23,318 INFO L356 Elim1Store]: treesize reduction 54, result has 33.3 percent of original size [2022-11-04 12:07:23,318 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 2299 treesize of output 470 [2022-11-04 12:07:24,936 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-04 12:07:24,938 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 179552 treesize of output 177858 [2022-11-04 12:07:26,005 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 193766 treesize of output 185566 [2022-11-04 12:07:41,515 WARN L234 SmtUtils]: Spent 15.51s on a formula simplification. DAG size of input: 1037 DAG size of output: 1035 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-11-04 12:07:41,644 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 185942 treesize of output 182290 [2022-11-04 12:07:56,690 WARN L234 SmtUtils]: Spent 15.04s on a formula simplification. DAG size of input: 1021 DAG size of output: 1016 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-11-04 12:07:56,827 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 180698 treesize of output 177382 [2022-11-04 12:08:13,998 WARN L234 SmtUtils]: Spent 17.17s on a formula simplification. DAG size of input: 942 DAG size of output: 932 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)