./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-data-race.prp --file ../../sv-benchmarks/c/pthread-race-challenges/per-thread-struct-race.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 0e0057cc Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_95064286-8457-47f4-8e88-4f3af14b16f9/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_95064286-8457-47f4-8e88-4f3af14b16f9/bin/uautomizer-verify-BQ2R08f2Ya/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_95064286-8457-47f4-8e88-4f3af14b16f9/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_95064286-8457-47f4-8e88-4f3af14b16f9/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-race-challenges/per-thread-struct-race.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_95064286-8457-47f4-8e88-4f3af14b16f9/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_95064286-8457-47f4-8e88-4f3af14b16f9/bin/uautomizer-verify-BQ2R08f2Ya --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! data-race) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash bdf6537ef41e6e97eaabcf1f32a2477c3eb925663d5b8e717e1252d54a113bc0 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-29 00:37:21,666 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-29 00:37:21,736 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_95064286-8457-47f4-8e88-4f3af14b16f9/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-DataRace-32bit-Automizer_Default.epf [2023-11-29 00:37:21,741 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-29 00:37:21,741 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-29 00:37:21,765 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-29 00:37:21,766 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-29 00:37:21,767 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-29 00:37:21,767 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-29 00:37:21,768 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-29 00:37:21,769 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-29 00:37:21,769 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-29 00:37:21,770 INFO L153 SettingsManager]: * Use SBE=true [2023-11-29 00:37:21,770 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-29 00:37:21,771 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-29 00:37:21,771 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-29 00:37:21,772 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-29 00:37:21,772 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-29 00:37:21,773 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-29 00:37:21,773 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-29 00:37:21,774 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-29 00:37:21,774 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-29 00:37:21,775 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2023-11-29 00:37:21,775 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-29 00:37:21,776 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-29 00:37:21,776 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-29 00:37:21,776 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-29 00:37:21,777 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-29 00:37:21,777 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-29 00:37:21,778 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-29 00:37:21,778 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 00:37:21,779 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-29 00:37:21,779 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-29 00:37:21,779 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-29 00:37:21,779 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-29 00:37:21,780 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-29 00:37:21,780 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-29 00:37:21,780 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-29 00:37:21,780 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-29 00:37:21,780 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-29 00:37:21,781 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-29 00:37:21,781 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_95064286-8457-47f4-8e88-4f3af14b16f9/bin/uautomizer-verify-BQ2R08f2Ya/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_95064286-8457-47f4-8e88-4f3af14b16f9/bin/uautomizer-verify-BQ2R08f2Ya Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! data-race) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> bdf6537ef41e6e97eaabcf1f32a2477c3eb925663d5b8e717e1252d54a113bc0 [2023-11-29 00:37:22,000 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-29 00:37:22,027 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-29 00:37:22,030 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-29 00:37:22,031 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-29 00:37:22,032 INFO L274 PluginConnector]: CDTParser initialized [2023-11-29 00:37:22,033 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_95064286-8457-47f4-8e88-4f3af14b16f9/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/pthread-race-challenges/per-thread-struct-race.i [2023-11-29 00:37:24,851 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-29 00:37:25,073 INFO L384 CDTParser]: Found 1 translation units. [2023-11-29 00:37:25,074 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_95064286-8457-47f4-8e88-4f3af14b16f9/sv-benchmarks/c/pthread-race-challenges/per-thread-struct-race.i [2023-11-29 00:37:25,091 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_95064286-8457-47f4-8e88-4f3af14b16f9/bin/uautomizer-verify-BQ2R08f2Ya/data/f92e982f1/d82aaea9bcb34a168a609c202cda9c90/FLAGed57f788c [2023-11-29 00:37:25,104 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_95064286-8457-47f4-8e88-4f3af14b16f9/bin/uautomizer-verify-BQ2R08f2Ya/data/f92e982f1/d82aaea9bcb34a168a609c202cda9c90 [2023-11-29 00:37:25,106 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-29 00:37:25,107 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-29 00:37:25,108 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-29 00:37:25,108 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-29 00:37:25,113 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-29 00:37:25,113 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 12:37:25" (1/1) ... [2023-11-29 00:37:25,114 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1419cf7c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:37:25, skipping insertion in model container [2023-11-29 00:37:25,115 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 12:37:25" (1/1) ... [2023-11-29 00:37:25,164 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 00:37:25,568 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 00:37:25,577 INFO L202 MainTranslator]: Completed pre-run [2023-11-29 00:37:25,623 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 00:37:25,670 INFO L206 MainTranslator]: Completed translation [2023-11-29 00:37:25,671 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:37:25 WrapperNode [2023-11-29 00:37:25,671 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-29 00:37:25,672 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-29 00:37:25,672 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-29 00:37:25,672 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-29 00:37:25,678 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:37:25" (1/1) ... [2023-11-29 00:37:25,697 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:37:25" (1/1) ... [2023-11-29 00:37:25,722 INFO L138 Inliner]: procedures = 265, calls = 18, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 80 [2023-11-29 00:37:25,722 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-29 00:37:25,723 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-29 00:37:25,723 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-29 00:37:25,724 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-29 00:37:25,731 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:37:25" (1/1) ... [2023-11-29 00:37:25,731 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:37:25" (1/1) ... [2023-11-29 00:37:25,736 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:37:25" (1/1) ... [2023-11-29 00:37:25,737 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:37:25" (1/1) ... [2023-11-29 00:37:25,747 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:37:25" (1/1) ... [2023-11-29 00:37:25,751 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:37:25" (1/1) ... [2023-11-29 00:37:25,753 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:37:25" (1/1) ... [2023-11-29 00:37:25,755 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:37:25" (1/1) ... [2023-11-29 00:37:25,758 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-29 00:37:25,759 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-29 00:37:25,760 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-29 00:37:25,760 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-29 00:37:25,761 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:37:25" (1/1) ... [2023-11-29 00:37:25,767 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 00:37:25,777 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_95064286-8457-47f4-8e88-4f3af14b16f9/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 00:37:25,789 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_95064286-8457-47f4-8e88-4f3af14b16f9/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-29 00:37:25,796 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_95064286-8457-47f4-8e88-4f3af14b16f9/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-29 00:37:25,824 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-29 00:37:25,824 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-11-29 00:37:25,824 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-29 00:37:25,825 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2023-11-29 00:37:25,825 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-29 00:37:25,825 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-29 00:37:25,825 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-29 00:37:25,825 INFO L130 BoogieDeclarations]: Found specification of procedure thread [2023-11-29 00:37:25,826 INFO L138 BoogieDeclarations]: Found implementation of procedure thread [2023-11-29 00:37:25,826 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-29 00:37:25,826 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-29 00:37:25,827 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-29 00:37:25,952 INFO L241 CfgBuilder]: Building ICFG [2023-11-29 00:37:25,953 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-29 00:37:26,163 INFO L282 CfgBuilder]: Performing block encoding [2023-11-29 00:37:26,173 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-29 00:37:26,174 INFO L309 CfgBuilder]: Removed 2 assume(true) statements. [2023-11-29 00:37:26,175 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 12:37:26 BoogieIcfgContainer [2023-11-29 00:37:26,175 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-29 00:37:26,188 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-29 00:37:26,188 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-29 00:37:26,192 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-29 00:37:26,192 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.11 12:37:25" (1/3) ... [2023-11-29 00:37:26,193 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@708dbcf6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 12:37:26, skipping insertion in model container [2023-11-29 00:37:26,193 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:37:25" (2/3) ... [2023-11-29 00:37:26,193 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@708dbcf6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 12:37:26, skipping insertion in model container [2023-11-29 00:37:26,193 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 12:37:26" (3/3) ... [2023-11-29 00:37:26,195 INFO L112 eAbstractionObserver]: Analyzing ICFG per-thread-struct-race.i [2023-11-29 00:37:26,204 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-11-29 00:37:26,215 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-29 00:37:26,215 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 5 error locations. [2023-11-29 00:37:26,215 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-29 00:37:26,280 INFO L144 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2023-11-29 00:37:26,312 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 102 places, 103 transitions, 213 flow [2023-11-29 00:37:26,374 INFO L124 PetriNetUnfolderBase]: 6/152 cut-off events. [2023-11-29 00:37:26,375 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2023-11-29 00:37:26,380 INFO L83 FinitePrefix]: Finished finitePrefix Result has 157 conditions, 152 events. 6/152 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 316 event pairs, 0 based on Foata normal form. 0/134 useless extension candidates. Maximal degree in co-relation 73. Up to 4 conditions per place. [2023-11-29 00:37:26,380 INFO L82 GeneralOperation]: Start removeDead. Operand has 102 places, 103 transitions, 213 flow [2023-11-29 00:37:26,384 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 102 places, 103 transitions, 213 flow [2023-11-29 00:37:26,393 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-29 00:37:26,400 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@6b147214, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-29 00:37:26,400 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2023-11-29 00:37:26,414 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-29 00:37:26,414 INFO L124 PetriNetUnfolderBase]: 3/47 cut-off events. [2023-11-29 00:37:26,414 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-29 00:37:26,415 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 00:37:26,415 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:37:26,416 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 4 more)] === [2023-11-29 00:37:26,421 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:37:26,421 INFO L85 PathProgramCache]: Analyzing trace with hash -1764504615, now seen corresponding path program 1 times [2023-11-29 00:37:26,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:37:26,432 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [406883677] [2023-11-29 00:37:26,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:37:26,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:37:26,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:37:27,163 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:37:27,164 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:37:27,164 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [406883677] [2023-11-29 00:37:27,165 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [406883677] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:37:27,165 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:37:27,165 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 00:37:27,167 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [717578662] [2023-11-29 00:37:27,167 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:37:27,176 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 00:37:27,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:37:27,207 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 00:37:27,207 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-29 00:37:27,503 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 72 out of 103 [2023-11-29 00:37:27,507 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 103 transitions, 213 flow. Second operand has 6 states, 6 states have (on average 73.16666666666667) internal successors, (439), 6 states have internal predecessors, (439), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:37:27,507 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 00:37:27,507 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 72 of 103 [2023-11-29 00:37:27,508 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 00:37:27,700 INFO L124 PetriNetUnfolderBase]: 117/574 cut-off events. [2023-11-29 00:37:27,700 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2023-11-29 00:37:27,703 INFO L83 FinitePrefix]: Finished finitePrefix Result has 886 conditions, 574 events. 117/574 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 3190 event pairs, 6 based on Foata normal form. 13/537 useless extension candidates. Maximal degree in co-relation 751. Up to 194 conditions per place. [2023-11-29 00:37:27,707 INFO L140 encePairwiseOnDemand]: 77/103 looper letters, 38 selfloop transitions, 29 changer transitions 1/139 dead transitions. [2023-11-29 00:37:27,708 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 139 transitions, 422 flow [2023-11-29 00:37:27,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 00:37:27,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-29 00:37:27,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 507 transitions. [2023-11-29 00:37:27,724 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8203883495145631 [2023-11-29 00:37:27,725 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 507 transitions. [2023-11-29 00:37:27,726 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 507 transitions. [2023-11-29 00:37:27,728 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 00:37:27,731 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 507 transitions. [2023-11-29 00:37:27,735 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 84.5) internal successors, (507), 6 states have internal predecessors, (507), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:37:27,742 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 103.0) internal successors, (721), 7 states have internal predecessors, (721), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:37:27,743 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 103.0) internal successors, (721), 7 states have internal predecessors, (721), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:37:27,745 INFO L175 Difference]: Start difference. First operand has 102 places, 103 transitions, 213 flow. Second operand 6 states and 507 transitions. [2023-11-29 00:37:27,746 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 107 places, 139 transitions, 422 flow [2023-11-29 00:37:27,750 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 139 transitions, 422 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-29 00:37:27,755 INFO L231 Difference]: Finished difference. Result has 112 places, 128 transitions, 425 flow [2023-11-29 00:37:27,757 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=103, PETRI_DIFFERENCE_MINUEND_FLOW=207, PETRI_DIFFERENCE_MINUEND_PLACES=102, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=100, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=80, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=425, PETRI_PLACES=112, PETRI_TRANSITIONS=128} [2023-11-29 00:37:27,761 INFO L281 CegarLoopForPetriNet]: 102 programPoint places, 10 predicate places. [2023-11-29 00:37:27,761 INFO L495 AbstractCegarLoop]: Abstraction has has 112 places, 128 transitions, 425 flow [2023-11-29 00:37:27,762 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 73.16666666666667) internal successors, (439), 6 states have internal predecessors, (439), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:37:27,762 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 00:37:27,762 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:37:27,763 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-29 00:37:27,763 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 4 more)] === [2023-11-29 00:37:27,764 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:37:27,764 INFO L85 PathProgramCache]: Analyzing trace with hash -75319162, now seen corresponding path program 1 times [2023-11-29 00:37:27,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:37:27,764 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [70135722] [2023-11-29 00:37:27,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:37:27,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:37:27,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:37:27,882 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:37:27,883 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:37:27,883 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [70135722] [2023-11-29 00:37:27,883 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [70135722] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:37:27,883 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:37:27,884 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 00:37:27,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [51122564] [2023-11-29 00:37:27,884 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:37:27,885 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 00:37:27,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:37:27,886 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 00:37:27,886 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-29 00:37:27,954 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 103 [2023-11-29 00:37:27,955 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 112 places, 128 transitions, 425 flow. Second operand has 5 states, 5 states have (on average 88.4) internal successors, (442), 5 states have internal predecessors, (442), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:37:27,955 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 00:37:27,955 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 103 [2023-11-29 00:37:27,955 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 00:37:28,056 INFO L124 PetriNetUnfolderBase]: 82/524 cut-off events. [2023-11-29 00:37:28,057 INFO L125 PetriNetUnfolderBase]: For 76/76 co-relation queries the response was YES. [2023-11-29 00:37:28,060 INFO L83 FinitePrefix]: Finished finitePrefix Result has 956 conditions, 524 events. 82/524 cut-off events. For 76/76 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 2925 event pairs, 3 based on Foata normal form. 1/496 useless extension candidates. Maximal degree in co-relation 765. Up to 98 conditions per place. [2023-11-29 00:37:28,063 INFO L140 encePairwiseOnDemand]: 95/103 looper letters, 11 selfloop transitions, 2 changer transitions 5/133 dead transitions. [2023-11-29 00:37:28,063 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 133 transitions, 471 flow [2023-11-29 00:37:28,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 00:37:28,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-29 00:37:28,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 541 transitions. [2023-11-29 00:37:28,066 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8754045307443366 [2023-11-29 00:37:28,066 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 541 transitions. [2023-11-29 00:37:28,066 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 541 transitions. [2023-11-29 00:37:28,067 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 00:37:28,067 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 541 transitions. [2023-11-29 00:37:28,069 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 90.16666666666667) internal successors, (541), 6 states have internal predecessors, (541), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:37:28,071 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 103.0) internal successors, (721), 7 states have internal predecessors, (721), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:37:28,072 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 103.0) internal successors, (721), 7 states have internal predecessors, (721), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:37:28,072 INFO L175 Difference]: Start difference. First operand has 112 places, 128 transitions, 425 flow. Second operand 6 states and 541 transitions. [2023-11-29 00:37:28,072 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 133 transitions, 471 flow [2023-11-29 00:37:28,078 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 116 places, 133 transitions, 471 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-29 00:37:28,081 INFO L231 Difference]: Finished difference. Result has 120 places, 128 transitions, 443 flow [2023-11-29 00:37:28,081 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=103, PETRI_DIFFERENCE_MINUEND_FLOW=425, PETRI_DIFFERENCE_MINUEND_PLACES=111, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=128, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=126, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=443, PETRI_PLACES=120, PETRI_TRANSITIONS=128} [2023-11-29 00:37:28,082 INFO L281 CegarLoopForPetriNet]: 102 programPoint places, 18 predicate places. [2023-11-29 00:37:28,082 INFO L495 AbstractCegarLoop]: Abstraction has has 120 places, 128 transitions, 443 flow [2023-11-29 00:37:28,083 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 88.4) internal successors, (442), 5 states have internal predecessors, (442), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:37:28,083 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 00:37:28,083 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:37:28,083 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-29 00:37:28,084 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 4 more)] === [2023-11-29 00:37:28,084 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:37:28,084 INFO L85 PathProgramCache]: Analyzing trace with hash -141094382, now seen corresponding path program 1 times [2023-11-29 00:37:28,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:37:28,085 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1339063614] [2023-11-29 00:37:28,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:37:28,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:37:28,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:37:28,478 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:37:28,479 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:37:28,479 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1339063614] [2023-11-29 00:37:28,479 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1339063614] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:37:28,479 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:37:28,480 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 00:37:28,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1880485194] [2023-11-29 00:37:28,480 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:37:28,480 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 00:37:28,481 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:37:28,481 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 00:37:28,482 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-29 00:37:28,600 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 73 out of 103 [2023-11-29 00:37:28,601 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 120 places, 128 transitions, 443 flow. Second operand has 6 states, 6 states have (on average 75.0) internal successors, (450), 6 states have internal predecessors, (450), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:37:28,602 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 00:37:28,602 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 73 of 103 [2023-11-29 00:37:28,602 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 00:37:28,997 INFO L124 PetriNetUnfolderBase]: 337/1184 cut-off events. [2023-11-29 00:37:28,997 INFO L125 PetriNetUnfolderBase]: For 430/514 co-relation queries the response was YES. [2023-11-29 00:37:29,001 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2752 conditions, 1184 events. 337/1184 cut-off events. For 430/514 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 8161 event pairs, 62 based on Foata normal form. 14/1132 useless extension candidates. Maximal degree in co-relation 2682. Up to 596 conditions per place. [2023-11-29 00:37:29,008 INFO L140 encePairwiseOnDemand]: 80/103 looper letters, 49 selfloop transitions, 82 changer transitions 2/209 dead transitions. [2023-11-29 00:37:29,008 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 209 transitions, 1045 flow [2023-11-29 00:37:29,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 00:37:29,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-29 00:37:29,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 535 transitions. [2023-11-29 00:37:29,011 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8656957928802589 [2023-11-29 00:37:29,011 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 535 transitions. [2023-11-29 00:37:29,011 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 535 transitions. [2023-11-29 00:37:29,012 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 00:37:29,012 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 535 transitions. [2023-11-29 00:37:29,014 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 89.16666666666667) internal successors, (535), 6 states have internal predecessors, (535), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:37:29,016 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 103.0) internal successors, (721), 7 states have internal predecessors, (721), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:37:29,017 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 103.0) internal successors, (721), 7 states have internal predecessors, (721), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:37:29,017 INFO L175 Difference]: Start difference. First operand has 120 places, 128 transitions, 443 flow. Second operand 6 states and 535 transitions. [2023-11-29 00:37:29,017 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 122 places, 209 transitions, 1045 flow [2023-11-29 00:37:29,026 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 209 transitions, 1031 flow, removed 5 selfloop flow, removed 5 redundant places. [2023-11-29 00:37:29,031 INFO L231 Difference]: Finished difference. Result has 122 places, 207 transitions, 1149 flow [2023-11-29 00:37:29,031 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=103, PETRI_DIFFERENCE_MINUEND_FLOW=429, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=128, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=94, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1149, PETRI_PLACES=122, PETRI_TRANSITIONS=207} [2023-11-29 00:37:29,032 INFO L281 CegarLoopForPetriNet]: 102 programPoint places, 20 predicate places. [2023-11-29 00:37:29,032 INFO L495 AbstractCegarLoop]: Abstraction has has 122 places, 207 transitions, 1149 flow [2023-11-29 00:37:29,033 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 75.0) internal successors, (450), 6 states have internal predecessors, (450), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:37:29,033 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 00:37:29,033 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:37:29,034 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-29 00:37:29,034 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 4 more)] === [2023-11-29 00:37:29,034 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:37:29,035 INFO L85 PathProgramCache]: Analyzing trace with hash 941060820, now seen corresponding path program 1 times [2023-11-29 00:37:29,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:37:29,035 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [884075926] [2023-11-29 00:37:29,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:37:29,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:37:29,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 00:37:29,068 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 00:37:29,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 00:37:29,112 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 00:37:29,113 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-29 00:37:29,114 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (6 of 7 remaining) [2023-11-29 00:37:29,116 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (5 of 7 remaining) [2023-11-29 00:37:29,117 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (4 of 7 remaining) [2023-11-29 00:37:29,117 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (3 of 7 remaining) [2023-11-29 00:37:29,117 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (2 of 7 remaining) [2023-11-29 00:37:29,117 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (1 of 7 remaining) [2023-11-29 00:37:29,118 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (0 of 7 remaining) [2023-11-29 00:37:29,118 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-29 00:37:29,118 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2023-11-29 00:37:29,121 WARN L233 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2023-11-29 00:37:29,121 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2023-11-29 00:37:29,150 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2023-11-29 00:37:29,154 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 121 places, 121 transitions, 258 flow [2023-11-29 00:37:29,179 INFO L124 PetriNetUnfolderBase]: 11/271 cut-off events. [2023-11-29 00:37:29,180 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2023-11-29 00:37:29,180 INFO L83 FinitePrefix]: Finished finitePrefix Result has 283 conditions, 271 events. 11/271 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 651 event pairs, 0 based on Foata normal form. 0/239 useless extension candidates. Maximal degree in co-relation 154. Up to 8 conditions per place. [2023-11-29 00:37:29,180 INFO L82 GeneralOperation]: Start removeDead. Operand has 121 places, 121 transitions, 258 flow [2023-11-29 00:37:29,182 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 121 places, 121 transitions, 258 flow [2023-11-29 00:37:29,183 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-29 00:37:29,185 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@6b147214, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-29 00:37:29,185 INFO L358 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2023-11-29 00:37:29,189 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-29 00:37:29,189 INFO L124 PetriNetUnfolderBase]: 3/47 cut-off events. [2023-11-29 00:37:29,189 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-29 00:37:29,190 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 00:37:29,190 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:37:29,190 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2023-11-29 00:37:29,190 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:37:29,191 INFO L85 PathProgramCache]: Analyzing trace with hash 435998066, now seen corresponding path program 1 times [2023-11-29 00:37:29,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:37:29,191 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [949347239] [2023-11-29 00:37:29,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:37:29,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:37:29,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:37:29,390 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:37:29,390 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:37:29,391 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [949347239] [2023-11-29 00:37:29,391 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [949347239] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:37:29,391 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:37:29,391 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 00:37:29,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1820270654] [2023-11-29 00:37:29,392 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:37:29,392 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 00:37:29,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:37:29,393 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 00:37:29,393 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-29 00:37:29,623 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 84 out of 121 [2023-11-29 00:37:29,624 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 121 places, 121 transitions, 258 flow. Second operand has 6 states, 6 states have (on average 85.16666666666667) internal successors, (511), 6 states have internal predecessors, (511), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:37:29,624 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 00:37:29,625 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 121 [2023-11-29 00:37:29,625 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 00:37:30,367 INFO L124 PetriNetUnfolderBase]: 1710/4914 cut-off events. [2023-11-29 00:37:30,367 INFO L125 PetriNetUnfolderBase]: For 125/125 co-relation queries the response was YES. [2023-11-29 00:37:30,375 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7978 conditions, 4914 events. 1710/4914 cut-off events. For 125/125 co-relation queries the response was YES. Maximal size of possible extension queue 227. Compared 40598 event pairs, 258 based on Foata normal form. 85/4617 useless extension candidates. Maximal degree in co-relation 4669. Up to 2239 conditions per place. [2023-11-29 00:37:30,400 INFO L140 encePairwiseOnDemand]: 91/121 looper letters, 46 selfloop transitions, 48 changer transitions 1/178 dead transitions. [2023-11-29 00:37:30,400 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 126 places, 178 transitions, 571 flow [2023-11-29 00:37:30,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 00:37:30,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-29 00:37:30,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 606 transitions. [2023-11-29 00:37:30,403 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8347107438016529 [2023-11-29 00:37:30,404 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 606 transitions. [2023-11-29 00:37:30,404 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 606 transitions. [2023-11-29 00:37:30,404 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 00:37:30,404 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 606 transitions. [2023-11-29 00:37:30,407 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 101.0) internal successors, (606), 6 states have internal predecessors, (606), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:37:30,409 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 121.0) internal successors, (847), 7 states have internal predecessors, (847), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:37:30,409 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 121.0) internal successors, (847), 7 states have internal predecessors, (847), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:37:30,409 INFO L175 Difference]: Start difference. First operand has 121 places, 121 transitions, 258 flow. Second operand 6 states and 606 transitions. [2023-11-29 00:37:30,410 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 126 places, 178 transitions, 571 flow [2023-11-29 00:37:30,412 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 126 places, 178 transitions, 571 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-29 00:37:30,415 INFO L231 Difference]: Finished difference. Result has 131 places, 165 transitions, 592 flow [2023-11-29 00:37:30,416 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=121, PETRI_DIFFERENCE_MINUEND_FLOW=252, PETRI_DIFFERENCE_MINUEND_PLACES=121, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=118, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=94, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=592, PETRI_PLACES=131, PETRI_TRANSITIONS=165} [2023-11-29 00:37:30,416 INFO L281 CegarLoopForPetriNet]: 121 programPoint places, 10 predicate places. [2023-11-29 00:37:30,417 INFO L495 AbstractCegarLoop]: Abstraction has has 131 places, 165 transitions, 592 flow [2023-11-29 00:37:30,417 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 85.16666666666667) internal successors, (511), 6 states have internal predecessors, (511), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:37:30,417 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 00:37:30,417 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:37:30,418 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-29 00:37:30,418 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2023-11-29 00:37:30,418 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:37:30,418 INFO L85 PathProgramCache]: Analyzing trace with hash 354992102, now seen corresponding path program 1 times [2023-11-29 00:37:30,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:37:30,419 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1467741343] [2023-11-29 00:37:30,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:37:30,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:37:30,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:37:30,503 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:37:30,503 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:37:30,503 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1467741343] [2023-11-29 00:37:30,503 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1467741343] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:37:30,504 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:37:30,504 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 00:37:30,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [691107970] [2023-11-29 00:37:30,504 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:37:30,504 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 00:37:30,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:37:30,505 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 00:37:30,505 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-29 00:37:30,565 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 103 out of 121 [2023-11-29 00:37:30,566 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 131 places, 165 transitions, 592 flow. Second operand has 5 states, 5 states have (on average 104.4) internal successors, (522), 5 states have internal predecessors, (522), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:37:30,566 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 00:37:30,566 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 121 [2023-11-29 00:37:30,566 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 00:37:31,058 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([266] L1036-5-->L1036-6: Formula: (let ((.cse0 (select |v_#race_20| |v_ULTIMATE.start_main_~#tids~0#1.base_17|))) (and (= (select .cse0 (+ |v_ULTIMATE.start_main_~#tids~0#1.offset_17| 1)) 0) (= (select .cse0 |v_ULTIMATE.start_main_~#tids~0#1.offset_17|) 0) (= (select .cse0 (+ |v_ULTIMATE.start_main_~#tids~0#1.offset_17| 3)) 0) (= (select .cse0 (+ |v_ULTIMATE.start_main_~#tids~0#1.offset_17| 2)) 0))) InVars {#race=|v_#race_20|, ULTIMATE.start_main_~#tids~0#1.offset=|v_ULTIMATE.start_main_~#tids~0#1.offset_17|, ULTIMATE.start_main_~#tids~0#1.base=|v_ULTIMATE.start_main_~#tids~0#1.base_17|} OutVars{#race=|v_#race_20|, ULTIMATE.start_main_~#tids~0#1.offset=|v_ULTIMATE.start_main_~#tids~0#1.offset_17|, ULTIMATE.start_main_~#tids~0#1.base=|v_ULTIMATE.start_main_~#tids~0#1.base_17|} AuxVars[] AssignedVars[][108], [136#true, 34#L1024-6true, Black: 124#true, Black: 128#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 127#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 126#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), 12#L1036-6true, threadThread1of2ForFork0InUse, threadThread2of2ForFork0InUse, 129#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 3)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), 10#L1024-8true]) [2023-11-29 00:37:31,058 INFO L294 olderBase$Statistics]: this new event has 84 ancestors and is not cut-off event [2023-11-29 00:37:31,058 INFO L297 olderBase$Statistics]: existing Event has 84 ancestors and is not cut-off event [2023-11-29 00:37:31,058 INFO L297 olderBase$Statistics]: existing Event has 84 ancestors and is not cut-off event [2023-11-29 00:37:31,059 INFO L297 olderBase$Statistics]: existing Event has 84 ancestors and is not cut-off event [2023-11-29 00:37:31,214 INFO L124 PetriNetUnfolderBase]: 1252/4216 cut-off events. [2023-11-29 00:37:31,214 INFO L125 PetriNetUnfolderBase]: For 863/867 co-relation queries the response was YES. [2023-11-29 00:37:31,227 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8138 conditions, 4216 events. 1252/4216 cut-off events. For 863/867 co-relation queries the response was YES. Maximal size of possible extension queue 204. Compared 36616 event pairs, 176 based on Foata normal form. 1/3991 useless extension candidates. Maximal degree in co-relation 4677. Up to 1342 conditions per place. [2023-11-29 00:37:31,252 INFO L140 encePairwiseOnDemand]: 113/121 looper letters, 14 selfloop transitions, 2 changer transitions 5/171 dead transitions. [2023-11-29 00:37:31,252 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 135 places, 171 transitions, 646 flow [2023-11-29 00:37:31,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 00:37:31,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-29 00:37:31,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 640 transitions. [2023-11-29 00:37:31,255 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8815426997245179 [2023-11-29 00:37:31,255 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 640 transitions. [2023-11-29 00:37:31,255 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 640 transitions. [2023-11-29 00:37:31,256 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 00:37:31,256 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 640 transitions. [2023-11-29 00:37:31,258 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 106.66666666666667) internal successors, (640), 6 states have internal predecessors, (640), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:37:31,260 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 121.0) internal successors, (847), 7 states have internal predecessors, (847), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:37:31,261 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 121.0) internal successors, (847), 7 states have internal predecessors, (847), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:37:31,261 INFO L175 Difference]: Start difference. First operand has 131 places, 165 transitions, 592 flow. Second operand 6 states and 640 transitions. [2023-11-29 00:37:31,261 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 135 places, 171 transitions, 646 flow [2023-11-29 00:37:31,274 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 135 places, 171 transitions, 646 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-29 00:37:31,277 INFO L231 Difference]: Finished difference. Result has 139 places, 166 transitions, 614 flow [2023-11-29 00:37:31,278 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=121, PETRI_DIFFERENCE_MINUEND_FLOW=592, PETRI_DIFFERENCE_MINUEND_PLACES=130, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=165, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=163, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=614, PETRI_PLACES=139, PETRI_TRANSITIONS=166} [2023-11-29 00:37:31,279 INFO L281 CegarLoopForPetriNet]: 121 programPoint places, 18 predicate places. [2023-11-29 00:37:31,279 INFO L495 AbstractCegarLoop]: Abstraction has has 139 places, 166 transitions, 614 flow [2023-11-29 00:37:31,279 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 104.4) internal successors, (522), 5 states have internal predecessors, (522), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:37:31,279 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 00:37:31,279 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:37:31,280 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-29 00:37:31,280 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2023-11-29 00:37:31,280 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:37:31,280 INFO L85 PathProgramCache]: Analyzing trace with hash 791198914, now seen corresponding path program 1 times [2023-11-29 00:37:31,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:37:31,281 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1784573240] [2023-11-29 00:37:31,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:37:31,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:37:31,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:37:31,548 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:37:31,548 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:37:31,548 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1784573240] [2023-11-29 00:37:31,549 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1784573240] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:37:31,549 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:37:31,549 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 00:37:31,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1978205057] [2023-11-29 00:37:31,549 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:37:31,550 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 00:37:31,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:37:31,550 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 00:37:31,551 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-29 00:37:31,702 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 121 [2023-11-29 00:37:31,703 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 139 places, 166 transitions, 614 flow. Second operand has 6 states, 6 states have (on average 87.0) internal successors, (522), 6 states have internal predecessors, (522), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:37:31,703 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 00:37:31,703 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 121 [2023-11-29 00:37:31,703 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 00:37:33,198 INFO L124 PetriNetUnfolderBase]: 4895/11733 cut-off events. [2023-11-29 00:37:33,198 INFO L125 PetriNetUnfolderBase]: For 5295/6921 co-relation queries the response was YES. [2023-11-29 00:37:33,224 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28905 conditions, 11733 events. 4895/11733 cut-off events. For 5295/6921 co-relation queries the response was YES. Maximal size of possible extension queue 453. Compared 105452 event pairs, 1134 based on Foata normal form. 45/11087 useless extension candidates. Maximal degree in co-relation 28834. Up to 6769 conditions per place. [2023-11-29 00:37:33,277 INFO L140 encePairwiseOnDemand]: 94/121 looper letters, 80 selfloop transitions, 142 changer transitions 0/311 dead transitions. [2023-11-29 00:37:33,277 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 141 places, 311 transitions, 1722 flow [2023-11-29 00:37:33,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 00:37:33,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-29 00:37:33,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 637 transitions. [2023-11-29 00:37:33,281 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8774104683195593 [2023-11-29 00:37:33,281 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 637 transitions. [2023-11-29 00:37:33,281 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 637 transitions. [2023-11-29 00:37:33,281 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 00:37:33,282 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 637 transitions. [2023-11-29 00:37:33,284 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 106.16666666666667) internal successors, (637), 6 states have internal predecessors, (637), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:37:33,286 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 121.0) internal successors, (847), 7 states have internal predecessors, (847), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:37:33,286 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 121.0) internal successors, (847), 7 states have internal predecessors, (847), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:37:33,286 INFO L175 Difference]: Start difference. First operand has 139 places, 166 transitions, 614 flow. Second operand 6 states and 637 transitions. [2023-11-29 00:37:33,287 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 141 places, 311 transitions, 1722 flow [2023-11-29 00:37:33,302 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 137 places, 311 transitions, 1710 flow, removed 5 selfloop flow, removed 4 redundant places. [2023-11-29 00:37:33,307 INFO L231 Difference]: Finished difference. Result has 142 places, 303 transitions, 1900 flow [2023-11-29 00:37:33,308 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=121, PETRI_DIFFERENCE_MINUEND_FLOW=602, PETRI_DIFFERENCE_MINUEND_PLACES=132, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=166, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=105, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1900, PETRI_PLACES=142, PETRI_TRANSITIONS=303} [2023-11-29 00:37:33,309 INFO L281 CegarLoopForPetriNet]: 121 programPoint places, 21 predicate places. [2023-11-29 00:37:33,309 INFO L495 AbstractCegarLoop]: Abstraction has has 142 places, 303 transitions, 1900 flow [2023-11-29 00:37:33,309 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 87.0) internal successors, (522), 6 states have internal predecessors, (522), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:37:33,309 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 00:37:33,310 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:37:33,310 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-29 00:37:33,310 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2023-11-29 00:37:33,310 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:37:33,311 INFO L85 PathProgramCache]: Analyzing trace with hash -1969644416, now seen corresponding path program 1 times [2023-11-29 00:37:33,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:37:33,311 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [129086383] [2023-11-29 00:37:33,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:37:33,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:37:33,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:37:33,823 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:37:33,824 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:37:33,824 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [129086383] [2023-11-29 00:37:33,824 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [129086383] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 00:37:33,825 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [510504784] [2023-11-29 00:37:33,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:37:33,825 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 00:37:33,825 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_95064286-8457-47f4-8e88-4f3af14b16f9/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 00:37:33,829 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_95064286-8457-47f4-8e88-4f3af14b16f9/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 00:37:33,838 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_95064286-8457-47f4-8e88-4f3af14b16f9/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-29 00:37:33,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:37:33,954 INFO L262 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 24 conjunts are in the unsatisfiable core [2023-11-29 00:37:33,959 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:37:34,161 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-29 00:37:34,200 INFO L378 Elim1Store]: Elim1 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 21 treesize of output 20 [2023-11-29 00:37:34,253 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 00:37:34,254 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 32 [2023-11-29 00:37:34,313 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 00:37:34,314 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 44 [2023-11-29 00:37:34,389 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 00:37:34,390 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 32 [2023-11-29 00:37:34,402 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:37:34,402 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 00:37:34,551 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_threadThread1of2ForFork0_~t~0.offset 3))) (let ((.cse0 (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (select |c_#race| c_threadThread1of2ForFork0_~t~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_255 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_255) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset))) (forall ((v_ArrVal_255 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_255) c_threadThread1of2ForFork0_~t~0.base) .cse1))) (forall ((v_ArrVal_255 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_255) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 2)))) (forall ((v_ArrVal_255 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_255) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1))))))) is different from false [2023-11-29 00:37:34,575 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (+ c_threadThread1of2ForFork0_~t~0.offset 2)) (.cse1 (+ c_threadThread1of2ForFork0_~t~0.offset 3))) (let ((.cse0 (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (store (select |c_#race| c_threadThread1of2ForFork0_~t~0.base) .cse2 |c_threadThread1of2ForFork0_#t~nondet4|) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_255 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_255) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1)))) (forall ((v_ArrVal_255 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_255) c_threadThread1of2ForFork0_~t~0.base) .cse1))) (forall ((v_ArrVal_255 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_255) c_threadThread1of2ForFork0_~t~0.base) .cse2))) (forall ((v_ArrVal_255 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_255) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset)))))) is different from false [2023-11-29 00:37:34,777 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:37:34,778 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [510504784] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 00:37:34,778 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 00:37:34,778 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 29 [2023-11-29 00:37:34,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1091723661] [2023-11-29 00:37:34,779 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 00:37:34,779 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2023-11-29 00:37:34,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:37:34,780 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2023-11-29 00:37:34,781 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=646, Unknown=8, NotChecked=106, Total=870 [2023-11-29 00:37:35,148 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 58 out of 121 [2023-11-29 00:37:35,150 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 142 places, 303 transitions, 1900 flow. Second operand has 30 states, 30 states have (on average 60.2) internal successors, (1806), 30 states have internal predecessors, (1806), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:37:35,150 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 00:37:35,150 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 58 of 121 [2023-11-29 00:37:35,150 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 00:37:40,047 INFO L124 PetriNetUnfolderBase]: 13429/26306 cut-off events. [2023-11-29 00:37:40,048 INFO L125 PetriNetUnfolderBase]: For 27125/27159 co-relation queries the response was YES. [2023-11-29 00:37:40,119 INFO L83 FinitePrefix]: Finished finitePrefix Result has 84178 conditions, 26306 events. 13429/26306 cut-off events. For 27125/27159 co-relation queries the response was YES. Maximal size of possible extension queue 891. Compared 234364 event pairs, 1506 based on Foata normal form. 356/25180 useless extension candidates. Maximal degree in co-relation 71500. Up to 12677 conditions per place. [2023-11-29 00:37:40,286 INFO L140 encePairwiseOnDemand]: 98/121 looper letters, 510 selfloop transitions, 206 changer transitions 1/775 dead transitions. [2023-11-29 00:37:40,286 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 155 places, 775 transitions, 6168 flow [2023-11-29 00:37:40,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-11-29 00:37:40,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2023-11-29 00:37:40,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1139 transitions. [2023-11-29 00:37:40,290 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6723730814639906 [2023-11-29 00:37:40,290 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 1139 transitions. [2023-11-29 00:37:40,290 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 1139 transitions. [2023-11-29 00:37:40,291 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 00:37:40,291 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 1139 transitions. [2023-11-29 00:37:40,294 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 81.35714285714286) internal successors, (1139), 14 states have internal predecessors, (1139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:37:40,298 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 15 states, 15 states have (on average 121.0) internal successors, (1815), 15 states have internal predecessors, (1815), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:37:40,298 INFO L81 ComplementDD]: Finished complementDD. Result has 15 states, 15 states have (on average 121.0) internal successors, (1815), 15 states have internal predecessors, (1815), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:37:40,299 INFO L175 Difference]: Start difference. First operand has 142 places, 303 transitions, 1900 flow. Second operand 14 states and 1139 transitions. [2023-11-29 00:37:40,299 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 155 places, 775 transitions, 6168 flow [2023-11-29 00:37:40,639 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 155 places, 775 transitions, 6114 flow, removed 27 selfloop flow, removed 0 redundant places. [2023-11-29 00:37:40,649 INFO L231 Difference]: Finished difference. Result has 164 places, 488 transitions, 4174 flow [2023-11-29 00:37:40,650 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=121, PETRI_DIFFERENCE_MINUEND_FLOW=1846, PETRI_DIFFERENCE_MINUEND_PLACES=142, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=303, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=84, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=183, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=4174, PETRI_PLACES=164, PETRI_TRANSITIONS=488} [2023-11-29 00:37:40,651 INFO L281 CegarLoopForPetriNet]: 121 programPoint places, 43 predicate places. [2023-11-29 00:37:40,651 INFO L495 AbstractCegarLoop]: Abstraction has has 164 places, 488 transitions, 4174 flow [2023-11-29 00:37:40,652 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 60.2) internal successors, (1806), 30 states have internal predecessors, (1806), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:37:40,652 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 00:37:40,652 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:37:40,658 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_95064286-8457-47f4-8e88-4f3af14b16f9/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-29 00:37:40,852 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_95064286-8457-47f4-8e88-4f3af14b16f9/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 00:37:40,853 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2023-11-29 00:37:40,853 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:37:40,853 INFO L85 PathProgramCache]: Analyzing trace with hash -1161061333, now seen corresponding path program 1 times [2023-11-29 00:37:40,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:37:40,854 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [755694741] [2023-11-29 00:37:40,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:37:40,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:37:40,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:37:41,420 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:37:41,420 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:37:41,420 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [755694741] [2023-11-29 00:37:41,421 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [755694741] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 00:37:41,421 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [503311357] [2023-11-29 00:37:41,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:37:41,421 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 00:37:41,421 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_95064286-8457-47f4-8e88-4f3af14b16f9/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 00:37:41,422 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_95064286-8457-47f4-8e88-4f3af14b16f9/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 00:37:41,424 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_95064286-8457-47f4-8e88-4f3af14b16f9/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-29 00:37:41,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:37:41,534 INFO L262 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 20 conjunts are in the unsatisfiable core [2023-11-29 00:37:41,538 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:37:41,767 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-29 00:37:41,805 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2023-11-29 00:37:41,853 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2023-11-29 00:37:41,910 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 38 [2023-11-29 00:37:42,090 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 00:37:42,091 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 26 [2023-11-29 00:37:42,133 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:37:42,134 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 00:37:42,164 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_333 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_333) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) 0)) (forall ((v_ArrVal_333 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_333) |c_ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |c_ULTIMATE.start_main_~#tids~0#1.offset|)) 0)) (forall ((v_ArrVal_333 (Array Int Int))) (= 0 (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_333) |c_ULTIMATE.start_main_~#tids~0#1.base|) (+ 3 |c_ULTIMATE.start_main_~#tids~0#1.offset|)))) (forall ((v_ArrVal_333 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_333) |c_ULTIMATE.start_main_~#tids~0#1.base|) (+ |c_ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0))) is different from false [2023-11-29 00:37:42,267 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_threadThread1of2ForFork0_~t~0.base_21 Int)) (or (< c_threadThread1of2ForFork0_~arg.base v_threadThread1of2ForFork0_~t~0.base_21) (forall ((v_ArrVal_333 (Array Int Int))) (= (select (select (store |c_#race| v_threadThread1of2ForFork0_~t~0.base_21 v_ArrVal_333) |c_ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |c_ULTIMATE.start_main_~#tids~0#1.offset|)) 0)))) (forall ((v_threadThread1of2ForFork0_~t~0.base_21 Int)) (or (< c_threadThread1of2ForFork0_~arg.base v_threadThread1of2ForFork0_~t~0.base_21) (forall ((v_ArrVal_333 (Array Int Int))) (= (select (select (store |c_#race| v_threadThread1of2ForFork0_~t~0.base_21 v_ArrVal_333) |c_ULTIMATE.start_main_~#tids~0#1.base|) (+ |c_ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0)))) (forall ((v_threadThread1of2ForFork0_~t~0.base_21 Int)) (or (< c_threadThread1of2ForFork0_~arg.base v_threadThread1of2ForFork0_~t~0.base_21) (forall ((v_ArrVal_333 (Array Int Int))) (= (select (select (store |c_#race| v_threadThread1of2ForFork0_~t~0.base_21 v_ArrVal_333) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) 0)))) (forall ((v_threadThread1of2ForFork0_~t~0.base_21 Int)) (or (< c_threadThread1of2ForFork0_~arg.base v_threadThread1of2ForFork0_~t~0.base_21) (forall ((v_ArrVal_333 (Array Int Int))) (= (select (select (store |c_#race| v_threadThread1of2ForFork0_~t~0.base_21 v_ArrVal_333) |c_ULTIMATE.start_main_~#tids~0#1.base|) (+ 3 |c_ULTIMATE.start_main_~#tids~0#1.offset|)) 0))))) is different from false [2023-11-29 00:37:42,587 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 2 |c_ULTIMATE.start_main_~#tids~0#1.offset|)) (.cse2 (+ 3 |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base|) .cse1 0) .cse2 0)))) (and (forall ((v_threadThread1of2ForFork0_~t~0.base_21 Int)) (or (< c_threadThread1of2ForFork0_~arg.base v_threadThread1of2ForFork0_~t~0.base_21) (forall ((v_ArrVal_333 (Array Int Int))) (= (select (select (store .cse0 v_threadThread1of2ForFork0_~t~0.base_21 v_ArrVal_333) |c_ULTIMATE.start_main_~#tids~0#1.base|) .cse1) 0)))) (forall ((v_threadThread1of2ForFork0_~t~0.base_21 Int)) (or (< c_threadThread1of2ForFork0_~arg.base v_threadThread1of2ForFork0_~t~0.base_21) (forall ((v_ArrVal_333 (Array Int Int))) (= (select (select (store .cse0 v_threadThread1of2ForFork0_~t~0.base_21 v_ArrVal_333) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) 0)))) (forall ((v_threadThread1of2ForFork0_~t~0.base_21 Int)) (or (forall ((v_ArrVal_333 (Array Int Int))) (= (select (select (store .cse0 v_threadThread1of2ForFork0_~t~0.base_21 v_ArrVal_333) |c_ULTIMATE.start_main_~#tids~0#1.base|) .cse2) 0)) (< c_threadThread1of2ForFork0_~arg.base v_threadThread1of2ForFork0_~t~0.base_21))) (forall ((v_threadThread1of2ForFork0_~t~0.base_21 Int)) (or (< c_threadThread1of2ForFork0_~arg.base v_threadThread1of2ForFork0_~t~0.base_21) (forall ((v_ArrVal_333 (Array Int Int))) (= 0 (select (select (store .cse0 v_threadThread1of2ForFork0_~t~0.base_21 v_ArrVal_333) |c_ULTIMATE.start_main_~#tids~0#1.base|) (+ |c_ULTIMATE.start_main_~#tids~0#1.offset| 1))))))))) is different from false [2023-11-29 00:37:42,636 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~#tids~0#1.offset| 1)) (.cse2 (+ 2 |c_ULTIMATE.start_main_~#tids~0#1.offset|)) (.cse3 (+ 3 |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| (store (store (store (select |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base|) .cse1 0) .cse2 0) .cse3 0)))) (and (forall ((v_threadThread1of2ForFork0_~t~0.base_21 Int)) (or (< c_threadThread1of2ForFork0_~arg.base v_threadThread1of2ForFork0_~t~0.base_21) (forall ((v_ArrVal_333 (Array Int Int))) (= (select (select (store .cse0 v_threadThread1of2ForFork0_~t~0.base_21 v_ArrVal_333) |c_ULTIMATE.start_main_~#tids~0#1.base|) .cse1) 0)))) (forall ((v_threadThread1of2ForFork0_~t~0.base_21 Int)) (or (< c_threadThread1of2ForFork0_~arg.base v_threadThread1of2ForFork0_~t~0.base_21) (forall ((v_ArrVal_333 (Array Int Int))) (= (select (select (store .cse0 v_threadThread1of2ForFork0_~t~0.base_21 v_ArrVal_333) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) 0)))) (forall ((v_threadThread1of2ForFork0_~t~0.base_21 Int)) (or (< c_threadThread1of2ForFork0_~arg.base v_threadThread1of2ForFork0_~t~0.base_21) (forall ((v_ArrVal_333 (Array Int Int))) (= (select (select (store .cse0 v_threadThread1of2ForFork0_~t~0.base_21 v_ArrVal_333) |c_ULTIMATE.start_main_~#tids~0#1.base|) .cse2) 0)))) (forall ((v_threadThread1of2ForFork0_~t~0.base_21 Int)) (or (< c_threadThread1of2ForFork0_~arg.base v_threadThread1of2ForFork0_~t~0.base_21) (forall ((v_ArrVal_333 (Array Int Int))) (= (select (select (store .cse0 v_threadThread1of2ForFork0_~t~0.base_21 v_ArrVal_333) |c_ULTIMATE.start_main_~#tids~0#1.base|) .cse3) 0))))))) is different from false [2023-11-29 00:37:42,671 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 00:37:42,671 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 33 treesize of output 49 [2023-11-29 00:37:42,680 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 00:37:42,681 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 60 treesize of output 34 [2023-11-29 00:37:42,686 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-11-29 00:37:42,696 INFO L349 Elim1Store]: treesize reduction 38, result has 2.6 percent of original size [2023-11-29 00:37:42,697 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 35 treesize of output 1 [2023-11-29 00:37:42,704 INFO L349 Elim1Store]: treesize reduction 38, result has 2.6 percent of original size [2023-11-29 00:37:42,704 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 35 treesize of output 1 [2023-11-29 00:37:42,712 INFO L349 Elim1Store]: treesize reduction 38, result has 2.6 percent of original size [2023-11-29 00:37:42,712 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 35 treesize of output 1 [2023-11-29 00:37:42,860 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2023-11-29 00:37:42,861 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [503311357] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 00:37:42,861 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 00:37:42,861 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 33 [2023-11-29 00:37:42,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1016613744] [2023-11-29 00:37:42,861 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 00:37:42,862 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2023-11-29 00:37:42,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:37:42,864 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2023-11-29 00:37:42,864 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=748, Unknown=5, NotChecked=236, Total=1122 [2023-11-29 00:37:42,936 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 60 out of 121 [2023-11-29 00:37:42,939 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 164 places, 488 transitions, 4174 flow. Second operand has 34 states, 34 states have (on average 62.05882352941177) internal successors, (2110), 34 states have internal predecessors, (2110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:37:42,939 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 00:37:42,939 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 60 of 121 [2023-11-29 00:37:42,939 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 00:37:49,358 INFO L124 PetriNetUnfolderBase]: 15353/30543 cut-off events. [2023-11-29 00:37:49,358 INFO L125 PetriNetUnfolderBase]: For 76362/76448 co-relation queries the response was YES. [2023-11-29 00:37:49,458 INFO L83 FinitePrefix]: Finished finitePrefix Result has 121475 conditions, 30543 events. 15353/30543 cut-off events. For 76362/76448 co-relation queries the response was YES. Maximal size of possible extension queue 970. Compared 274545 event pairs, 1158 based on Foata normal form. 206/28909 useless extension candidates. Maximal degree in co-relation 113900. Up to 13032 conditions per place. [2023-11-29 00:37:49,591 INFO L140 encePairwiseOnDemand]: 87/121 looper letters, 554 selfloop transitions, 282 changer transitions 4/904 dead transitions. [2023-11-29 00:37:49,591 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 178 places, 904 transitions, 8990 flow [2023-11-29 00:37:49,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-11-29 00:37:49,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2023-11-29 00:37:49,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 1187 transitions. [2023-11-29 00:37:49,596 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6539944903581267 [2023-11-29 00:37:49,596 INFO L72 ComplementDD]: Start complementDD. Operand 15 states and 1187 transitions. [2023-11-29 00:37:49,596 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 1187 transitions. [2023-11-29 00:37:49,597 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 00:37:49,597 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 1187 transitions. [2023-11-29 00:37:49,600 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 16 states, 15 states have (on average 79.13333333333334) internal successors, (1187), 15 states have internal predecessors, (1187), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:37:49,604 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 16 states, 16 states have (on average 121.0) internal successors, (1936), 16 states have internal predecessors, (1936), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:37:49,605 INFO L81 ComplementDD]: Finished complementDD. Result has 16 states, 16 states have (on average 121.0) internal successors, (1936), 16 states have internal predecessors, (1936), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:37:49,605 INFO L175 Difference]: Start difference. First operand has 164 places, 488 transitions, 4174 flow. Second operand 15 states and 1187 transitions. [2023-11-29 00:37:49,605 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 178 places, 904 transitions, 8990 flow [2023-11-29 00:37:51,148 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 174 places, 904 transitions, 8964 flow, removed 8 selfloop flow, removed 4 redundant places. [2023-11-29 00:37:51,159 INFO L231 Difference]: Finished difference. Result has 183 places, 643 transitions, 7009 flow [2023-11-29 00:37:51,159 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=121, PETRI_DIFFERENCE_MINUEND_FLOW=4150, PETRI_DIFFERENCE_MINUEND_PLACES=160, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=488, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=142, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=248, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=7009, PETRI_PLACES=183, PETRI_TRANSITIONS=643} [2023-11-29 00:37:51,160 INFO L281 CegarLoopForPetriNet]: 121 programPoint places, 62 predicate places. [2023-11-29 00:37:51,160 INFO L495 AbstractCegarLoop]: Abstraction has has 183 places, 643 transitions, 7009 flow [2023-11-29 00:37:51,161 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 62.05882352941177) internal successors, (2110), 34 states have internal predecessors, (2110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:37:51,161 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 00:37:51,162 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:37:51,167 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_95064286-8457-47f4-8e88-4f3af14b16f9/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-11-29 00:37:51,362 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_95064286-8457-47f4-8e88-4f3af14b16f9/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 00:37:51,362 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2023-11-29 00:37:51,363 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:37:51,363 INFO L85 PathProgramCache]: Analyzing trace with hash 210800945, now seen corresponding path program 1 times [2023-11-29 00:37:51,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:37:51,363 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [997577965] [2023-11-29 00:37:51,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:37:51,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:37:51,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:37:51,597 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-29 00:37:51,597 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:37:51,597 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [997577965] [2023-11-29 00:37:51,598 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [997577965] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:37:51,598 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:37:51,598 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 00:37:51,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [386372188] [2023-11-29 00:37:51,598 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:37:51,598 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 00:37:51,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:37:51,599 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 00:37:51,599 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-29 00:37:51,846 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 121 [2023-11-29 00:37:51,847 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 183 places, 643 transitions, 7009 flow. Second operand has 6 states, 6 states have (on average 94.5) internal successors, (567), 6 states have internal predecessors, (567), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:37:51,847 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 00:37:51,847 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 121 [2023-11-29 00:37:51,847 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 00:37:55,436 INFO L124 PetriNetUnfolderBase]: 8466/19320 cut-off events. [2023-11-29 00:37:55,436 INFO L125 PetriNetUnfolderBase]: For 91795/93189 co-relation queries the response was YES. [2023-11-29 00:37:55,506 INFO L83 FinitePrefix]: Finished finitePrefix Result has 88824 conditions, 19320 events. 8466/19320 cut-off events. For 91795/93189 co-relation queries the response was YES. Maximal size of possible extension queue 662. Compared 178553 event pairs, 711 based on Foata normal form. 222/18943 useless extension candidates. Maximal degree in co-relation 85226. Up to 8378 conditions per place. [2023-11-29 00:37:55,595 INFO L140 encePairwiseOnDemand]: 106/121 looper letters, 376 selfloop transitions, 259 changer transitions 0/893 dead transitions. [2023-11-29 00:37:55,595 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 188 places, 893 transitions, 11552 flow [2023-11-29 00:37:55,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 00:37:55,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-29 00:37:55,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 623 transitions. [2023-11-29 00:37:55,598 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8581267217630854 [2023-11-29 00:37:55,598 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 623 transitions. [2023-11-29 00:37:55,598 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 623 transitions. [2023-11-29 00:37:55,599 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 00:37:55,599 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 623 transitions. [2023-11-29 00:37:55,601 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 103.83333333333333) internal successors, (623), 6 states have internal predecessors, (623), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:37:55,602 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 121.0) internal successors, (847), 7 states have internal predecessors, (847), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:37:55,603 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 121.0) internal successors, (847), 7 states have internal predecessors, (847), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:37:55,603 INFO L175 Difference]: Start difference. First operand has 183 places, 643 transitions, 7009 flow. Second operand 6 states and 623 transitions. [2023-11-29 00:37:55,603 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 188 places, 893 transitions, 11552 flow [2023-11-29 00:37:56,315 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 183 places, 893 transitions, 11519 flow, removed 0 selfloop flow, removed 5 redundant places. [2023-11-29 00:37:56,331 INFO L231 Difference]: Finished difference. Result has 188 places, 891 transitions, 11450 flow [2023-11-29 00:37:56,332 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=121, PETRI_DIFFERENCE_MINUEND_FLOW=6976, PETRI_DIFFERENCE_MINUEND_PLACES=178, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=643, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=65, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=546, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=11450, PETRI_PLACES=188, PETRI_TRANSITIONS=891} [2023-11-29 00:37:56,332 INFO L281 CegarLoopForPetriNet]: 121 programPoint places, 67 predicate places. [2023-11-29 00:37:56,332 INFO L495 AbstractCegarLoop]: Abstraction has has 188 places, 891 transitions, 11450 flow [2023-11-29 00:37:56,333 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 94.5) internal successors, (567), 6 states have internal predecessors, (567), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:37:56,333 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 00:37:56,333 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:37:56,334 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-29 00:37:56,335 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2023-11-29 00:37:56,335 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:37:56,335 INFO L85 PathProgramCache]: Analyzing trace with hash -89455300, now seen corresponding path program 1 times [2023-11-29 00:37:56,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:37:56,335 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1653536849] [2023-11-29 00:37:56,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:37:56,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:37:56,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:37:56,738 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2023-11-29 00:37:56,738 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:37:56,739 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1653536849] [2023-11-29 00:37:56,739 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1653536849] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:37:56,739 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:37:56,739 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 00:37:56,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1077080371] [2023-11-29 00:37:56,739 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:37:56,739 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 00:37:56,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:37:56,740 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 00:37:56,740 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-29 00:37:56,852 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 121 [2023-11-29 00:37:56,853 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 188 places, 891 transitions, 11450 flow. Second operand has 6 states, 6 states have (on average 87.16666666666667) internal successors, (523), 6 states have internal predecessors, (523), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:37:56,853 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 00:37:56,853 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 121 [2023-11-29 00:37:56,853 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 00:38:04,579 INFO L124 PetriNetUnfolderBase]: 15874/34875 cut-off events. [2023-11-29 00:38:04,579 INFO L125 PetriNetUnfolderBase]: For 189840/202050 co-relation queries the response was YES. [2023-11-29 00:38:04,725 INFO L83 FinitePrefix]: Finished finitePrefix Result has 164129 conditions, 34875 events. 15874/34875 cut-off events. For 189840/202050 co-relation queries the response was YES. Maximal size of possible extension queue 1315. Compared 355612 event pairs, 2012 based on Foata normal form. 679/34063 useless extension candidates. Maximal degree in co-relation 158825. Up to 19945 conditions per place. [2023-11-29 00:38:04,870 INFO L140 encePairwiseOnDemand]: 94/121 looper letters, 685 selfloop transitions, 494 changer transitions 5/1322 dead transitions. [2023-11-29 00:38:04,870 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 193 places, 1322 transitions, 18790 flow [2023-11-29 00:38:04,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 00:38:04,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-29 00:38:04,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 633 transitions. [2023-11-29 00:38:04,872 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.871900826446281 [2023-11-29 00:38:04,872 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 633 transitions. [2023-11-29 00:38:04,872 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 633 transitions. [2023-11-29 00:38:04,872 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 00:38:04,872 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 633 transitions. [2023-11-29 00:38:04,874 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 105.5) internal successors, (633), 6 states have internal predecessors, (633), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:38:04,875 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 121.0) internal successors, (847), 7 states have internal predecessors, (847), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:38:04,875 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 121.0) internal successors, (847), 7 states have internal predecessors, (847), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:38:04,875 INFO L175 Difference]: Start difference. First operand has 188 places, 891 transitions, 11450 flow. Second operand 6 states and 633 transitions. [2023-11-29 00:38:04,875 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 193 places, 1322 transitions, 18790 flow [2023-11-29 00:38:06,583 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 193 places, 1322 transitions, 18574 flow, removed 108 selfloop flow, removed 0 redundant places. [2023-11-29 00:38:06,604 INFO L231 Difference]: Finished difference. Result has 198 places, 1313 transitions, 18674 flow [2023-11-29 00:38:06,605 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=121, PETRI_DIFFERENCE_MINUEND_FLOW=11342, PETRI_DIFFERENCE_MINUEND_PLACES=188, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=891, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=123, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=550, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=18674, PETRI_PLACES=198, PETRI_TRANSITIONS=1313} [2023-11-29 00:38:06,606 INFO L281 CegarLoopForPetriNet]: 121 programPoint places, 77 predicate places. [2023-11-29 00:38:06,606 INFO L495 AbstractCegarLoop]: Abstraction has has 198 places, 1313 transitions, 18674 flow [2023-11-29 00:38:06,606 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 87.16666666666667) internal successors, (523), 6 states have internal predecessors, (523), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:38:06,606 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 00:38:06,606 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:38:06,606 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-29 00:38:06,606 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2023-11-29 00:38:06,606 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:38:06,606 INFO L85 PathProgramCache]: Analyzing trace with hash 1387385231, now seen corresponding path program 1 times [2023-11-29 00:38:06,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:38:06,607 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1295491474] [2023-11-29 00:38:06,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:38:06,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:38:06,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:38:07,171 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:38:07,171 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:38:07,171 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1295491474] [2023-11-29 00:38:07,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1295491474] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 00:38:07,171 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [500844236] [2023-11-29 00:38:07,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:38:07,172 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 00:38:07,172 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_95064286-8457-47f4-8e88-4f3af14b16f9/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 00:38:07,173 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_95064286-8457-47f4-8e88-4f3af14b16f9/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 00:38:07,178 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_95064286-8457-47f4-8e88-4f3af14b16f9/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-29 00:38:07,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:38:07,299 INFO L262 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 43 conjunts are in the unsatisfiable core [2023-11-29 00:38:07,305 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:38:07,308 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-29 00:38:07,326 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-11-29 00:38:07,327 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2023-11-29 00:38:07,414 INFO L349 Elim1Store]: treesize reduction 8, result has 61.9 percent of original size [2023-11-29 00:38:07,414 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 22 [2023-11-29 00:38:07,688 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 00:38:07,688 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 32 [2023-11-29 00:38:07,799 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2023-11-29 00:38:07,823 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-29 00:38:07,832 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2023-11-29 00:38:07,848 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 00:38:07,849 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 32 [2023-11-29 00:38:07,868 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 00:38:07,868 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 44 [2023-11-29 00:38:07,890 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 32 [2023-11-29 00:38:07,903 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:38:07,903 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 00:38:07,930 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_517 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_517) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_517 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_517) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1)) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_517 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_517) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 2)) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_517 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_517) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 3)) |c_threadThread1of2ForFork0_#t~nondet4|))) is different from false [2023-11-29 00:38:07,951 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_threadThread1of2ForFork0_~t~0.offset 3))) (let ((.cse0 (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (select |c_#race| c_threadThread1of2ForFork0_~t~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_517 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_517) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset))) (forall ((v_ArrVal_517 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_517) c_threadThread1of2ForFork0_~t~0.base) .cse1))) (forall ((v_ArrVal_517 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_517) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1)) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_517 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_517) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 2)) |c_threadThread1of2ForFork0_#t~nondet4|))))) is different from false [2023-11-29 00:38:07,976 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (+ c_threadThread1of2ForFork0_~t~0.offset 2)) (.cse1 (+ c_threadThread1of2ForFork0_~t~0.offset 3))) (let ((.cse0 (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (store (select |c_#race| c_threadThread1of2ForFork0_~t~0.base) .cse2 |c_threadThread1of2ForFork0_#t~nondet4|) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_517 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_517) c_threadThread1of2ForFork0_~t~0.base) .cse1) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_517 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_517) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1)))) (forall ((v_ArrVal_517 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_517) c_threadThread1of2ForFork0_~t~0.base) .cse2))) (forall ((v_ArrVal_517 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_517) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset)))))) is different from false [2023-11-29 00:38:08,189 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_508 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) v_ArrVal_508) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) |c_ULTIMATE.start_main_#t~malloc7#1.base|))) is different from false [2023-11-29 00:38:08,229 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 29 [2023-11-29 00:38:08,234 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 6 [2023-11-29 00:38:08,303 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:38:08,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [500844236] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 00:38:08,303 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 00:38:08,303 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16, 17] total 32 [2023-11-29 00:38:08,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1706036899] [2023-11-29 00:38:08,303 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 00:38:08,304 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2023-11-29 00:38:08,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:38:08,305 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2023-11-29 00:38:08,305 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=711, Unknown=16, NotChecked=228, Total=1056 [2023-11-29 00:38:08,355 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 51 out of 121 [2023-11-29 00:38:08,357 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 198 places, 1313 transitions, 18674 flow. Second operand has 33 states, 33 states have (on average 53.09090909090909) internal successors, (1752), 33 states have internal predecessors, (1752), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:38:08,357 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 00:38:08,357 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 51 of 121 [2023-11-29 00:38:08,357 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 00:38:40,195 INFO L124 PetriNetUnfolderBase]: 56116/103147 cut-off events. [2023-11-29 00:38:40,195 INFO L125 PetriNetUnfolderBase]: For 666642/667274 co-relation queries the response was YES. [2023-11-29 00:38:40,729 INFO L83 FinitePrefix]: Finished finitePrefix Result has 555436 conditions, 103147 events. 56116/103147 cut-off events. For 666642/667274 co-relation queries the response was YES. Maximal size of possible extension queue 3368. Compared 1047591 event pairs, 8412 based on Foata normal form. 527/103358 useless extension candidates. Maximal degree in co-relation 517448. Up to 38184 conditions per place. [2023-11-29 00:38:41,344 INFO L140 encePairwiseOnDemand]: 76/121 looper letters, 2921 selfloop transitions, 1065 changer transitions 21/4059 dead transitions. [2023-11-29 00:38:41,344 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 223 places, 4059 transitions, 68513 flow [2023-11-29 00:38:41,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2023-11-29 00:38:41,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2023-11-29 00:38:41,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 1752 transitions. [2023-11-29 00:38:41,348 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5568976478067387 [2023-11-29 00:38:41,348 INFO L72 ComplementDD]: Start complementDD. Operand 26 states and 1752 transitions. [2023-11-29 00:38:41,349 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 1752 transitions. [2023-11-29 00:38:41,349 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 00:38:41,349 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 26 states and 1752 transitions. [2023-11-29 00:38:41,353 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 27 states, 26 states have (on average 67.38461538461539) internal successors, (1752), 26 states have internal predecessors, (1752), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:38:41,358 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 27 states, 27 states have (on average 121.0) internal successors, (3267), 27 states have internal predecessors, (3267), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:38:41,359 INFO L81 ComplementDD]: Finished complementDD. Result has 27 states, 27 states have (on average 121.0) internal successors, (3267), 27 states have internal predecessors, (3267), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:38:41,359 INFO L175 Difference]: Start difference. First operand has 198 places, 1313 transitions, 18674 flow. Second operand 26 states and 1752 transitions. [2023-11-29 00:38:41,359 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 223 places, 4059 transitions, 68513 flow [2023-11-29 00:39:04,140 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 223 places, 4059 transitions, 67793 flow, removed 360 selfloop flow, removed 0 redundant places. [2023-11-29 00:39:04,199 INFO L231 Difference]: Finished difference. Result has 240 places, 2388 transitions, 41700 flow [2023-11-29 00:39:04,201 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=121, PETRI_DIFFERENCE_MINUEND_FLOW=18422, PETRI_DIFFERENCE_MINUEND_PLACES=198, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1313, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=255, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=754, PETRI_DIFFERENCE_SUBTRAHEND_STATES=26, PETRI_FLOW=41700, PETRI_PLACES=240, PETRI_TRANSITIONS=2388} [2023-11-29 00:39:04,201 INFO L281 CegarLoopForPetriNet]: 121 programPoint places, 119 predicate places. [2023-11-29 00:39:04,201 INFO L495 AbstractCegarLoop]: Abstraction has has 240 places, 2388 transitions, 41700 flow [2023-11-29 00:39:04,202 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 53.09090909090909) internal successors, (1752), 33 states have internal predecessors, (1752), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:39:04,202 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 00:39:04,203 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:39:04,207 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_95064286-8457-47f4-8e88-4f3af14b16f9/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2023-11-29 00:39:04,403 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_95064286-8457-47f4-8e88-4f3af14b16f9/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2023-11-29 00:39:04,403 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2023-11-29 00:39:04,404 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:39:04,404 INFO L85 PathProgramCache]: Analyzing trace with hash -1451785483, now seen corresponding path program 2 times [2023-11-29 00:39:04,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:39:04,404 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1477393869] [2023-11-29 00:39:04,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:39:04,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:39:04,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:39:05,048 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:39:05,048 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:39:05,049 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1477393869] [2023-11-29 00:39:05,049 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1477393869] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 00:39:05,049 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1721498407] [2023-11-29 00:39:05,049 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-29 00:39:05,049 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 00:39:05,049 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_95064286-8457-47f4-8e88-4f3af14b16f9/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 00:39:05,050 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_95064286-8457-47f4-8e88-4f3af14b16f9/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 00:39:05,053 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_95064286-8457-47f4-8e88-4f3af14b16f9/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-11-29 00:39:05,240 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-29 00:39:05,240 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 00:39:05,242 INFO L262 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 42 conjunts are in the unsatisfiable core [2023-11-29 00:39:05,246 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:39:05,270 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-29 00:39:05,350 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2023-11-29 00:39:05,350 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2023-11-29 00:39:05,549 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 00:39:05,549 INFO L378 Elim1Store]: Elim1 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 33 [2023-11-29 00:39:05,676 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 00:39:05,676 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 19 [2023-11-29 00:39:05,734 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2023-11-29 00:39:05,747 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-29 00:39:05,753 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2023-11-29 00:39:05,767 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 00:39:05,767 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 32 [2023-11-29 00:39:05,786 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 00:39:05,787 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 44 [2023-11-29 00:39:05,818 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 32 [2023-11-29 00:39:05,829 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:39:05,829 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 00:39:05,852 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_617 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_617) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 3)))) (forall ((v_ArrVal_617 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_617) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1)) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_617 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_617) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset))) (forall ((v_ArrVal_617 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_617) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 2))))) is different from false [2023-11-29 00:39:05,878 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_threadThread1of2ForFork0_~t~0.offset 3))) (let ((.cse0 (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (select |c_#race| c_threadThread1of2ForFork0_~t~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_617 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_617) c_threadThread1of2ForFork0_~t~0.base) .cse1))) (forall ((v_ArrVal_617 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_617) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset))) (forall ((v_ArrVal_617 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_617) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 2)))) (forall ((v_ArrVal_617 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_617) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1))))))) is different from false [2023-11-29 00:39:05,894 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (+ c_threadThread1of2ForFork0_~t~0.offset 2)) (.cse1 (+ c_threadThread1of2ForFork0_~t~0.offset 3))) (let ((.cse0 (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (store (select |c_#race| c_threadThread1of2ForFork0_~t~0.base) .cse2 |c_threadThread1of2ForFork0_#t~nondet4|) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_617 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_617) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset))) (forall ((v_ArrVal_617 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_617) c_threadThread1of2ForFork0_~t~0.base) .cse1))) (forall ((v_ArrVal_617 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_617) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1)))) (forall ((v_ArrVal_617 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_617) c_threadThread1of2ForFork0_~t~0.base) .cse2)))))) is different from false [2023-11-29 00:39:05,910 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_threadThread1of2ForFork0_~t~0.offset 1)) (.cse2 (+ c_threadThread1of2ForFork0_~t~0.offset 2)) (.cse3 (+ c_threadThread1of2ForFork0_~t~0.offset 3))) (let ((.cse0 (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (store (store (select |c_#race| c_threadThread1of2ForFork0_~t~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|) .cse2 |c_threadThread1of2ForFork0_#t~nondet4|) .cse3 |c_threadThread1of2ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_617 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_617) c_threadThread1of2ForFork0_~t~0.base) .cse1))) (forall ((v_ArrVal_617 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_617) c_threadThread1of2ForFork0_~t~0.base) .cse2))) (forall ((v_ArrVal_617 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_617) c_threadThread1of2ForFork0_~t~0.base) .cse3))) (forall ((v_ArrVal_617 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_617) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset)))))) is different from false [2023-11-29 00:39:05,925 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 00:39:05,926 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 35 treesize of output 51 [2023-11-29 00:39:05,932 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 00:39:05,932 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 84 treesize of output 32 [2023-11-29 00:39:05,940 INFO L349 Elim1Store]: treesize reduction 38, result has 2.6 percent of original size [2023-11-29 00:39:05,940 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 35 treesize of output 1 [2023-11-29 00:39:05,945 INFO L349 Elim1Store]: treesize reduction 38, result has 2.6 percent of original size [2023-11-29 00:39:05,946 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 35 treesize of output 1 [2023-11-29 00:39:05,950 INFO L349 Elim1Store]: treesize reduction 38, result has 2.6 percent of original size [2023-11-29 00:39:05,951 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 33 treesize of output 1 [2023-11-29 00:39:06,057 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_608 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| c_threadThread1of2ForFork0_~arg.base v_ArrVal_608) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) c_threadThread1of2ForFork0_~arg.base))) is different from false [2023-11-29 00:39:06,108 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_608 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~t~1#1.base| v_ArrVal_608) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) |c_ULTIMATE.start_main_~t~1#1.base|))) is different from false [2023-11-29 00:39:06,185 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_607 (Array Int Int)) (v_ArrVal_608 (Array Int Int))) (not (= (select (select (store (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) v_ArrVal_607) |c_ULTIMATE.start_main_~t~1#1.base| v_ArrVal_608) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) |c_ULTIMATE.start_main_~t~1#1.base|))) is different from false [2023-11-29 00:39:06,202 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_607 (Array Int Int)) (v_ArrVal_608 (Array Int Int))) (not (= (select (select (store (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) v_ArrVal_607) |c_ULTIMATE.start_main_#t~malloc7#1.base| v_ArrVal_608) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) |c_ULTIMATE.start_main_#t~malloc7#1.base|))) is different from false [2023-11-29 00:39:06,279 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 163 treesize of output 119 [2023-11-29 00:39:06,289 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 50 [2023-11-29 00:39:06,294 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 46 [2023-11-29 00:39:06,388 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 00:39:06,388 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 40 [2023-11-29 00:39:06,426 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2023-11-29 00:39:06,426 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1721498407] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 00:39:06,426 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 00:39:06,426 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16, 18] total 41 [2023-11-29 00:39:06,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [273622123] [2023-11-29 00:39:06,427 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 00:39:06,427 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2023-11-29 00:39:06,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:39:06,428 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2023-11-29 00:39:06,429 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=1000, Unknown=25, NotChecked=568, Total=1722 [2023-11-29 00:39:06,432 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 50 out of 121 [2023-11-29 00:39:06,435 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 240 places, 2388 transitions, 41700 flow. Second operand has 42 states, 42 states have (on average 51.95238095238095) internal successors, (2182), 42 states have internal predecessors, (2182), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:39:06,435 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 00:39:06,435 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 50 of 121 [2023-11-29 00:39:06,435 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 00:40:18,672 INFO L124 PetriNetUnfolderBase]: 75353/136906 cut-off events. [2023-11-29 00:40:18,672 INFO L125 PetriNetUnfolderBase]: For 1302333/1303236 co-relation queries the response was YES. [2023-11-29 00:40:19,653 INFO L83 FinitePrefix]: Finished finitePrefix Result has 839429 conditions, 136906 events. 75353/136906 cut-off events. For 1302333/1303236 co-relation queries the response was YES. Maximal size of possible extension queue 4592. Compared 1416514 event pairs, 8239 based on Foata normal form. 616/137131 useless extension candidates. Maximal degree in co-relation 836896. Up to 70924 conditions per place. [2023-11-29 00:40:20,359 INFO L140 encePairwiseOnDemand]: 77/121 looper letters, 3293 selfloop transitions, 1548 changer transitions 33/4925 dead transitions. [2023-11-29 00:40:20,359 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 275 places, 4925 transitions, 90383 flow [2023-11-29 00:40:20,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2023-11-29 00:40:20,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2023-11-29 00:40:20,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 2343 transitions. [2023-11-29 00:40:20,364 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5378787878787878 [2023-11-29 00:40:20,364 INFO L72 ComplementDD]: Start complementDD. Operand 36 states and 2343 transitions. [2023-11-29 00:40:20,364 INFO L73 IsDeterministic]: Start isDeterministic. Operand 36 states and 2343 transitions. [2023-11-29 00:40:20,365 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 00:40:20,365 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 36 states and 2343 transitions. [2023-11-29 00:40:20,369 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 37 states, 36 states have (on average 65.08333333333333) internal successors, (2343), 36 states have internal predecessors, (2343), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:40:20,377 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 37 states, 37 states have (on average 121.0) internal successors, (4477), 37 states have internal predecessors, (4477), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:40:20,378 INFO L81 ComplementDD]: Finished complementDD. Result has 37 states, 37 states have (on average 121.0) internal successors, (4477), 37 states have internal predecessors, (4477), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:40:20,379 INFO L175 Difference]: Start difference. First operand has 240 places, 2388 transitions, 41700 flow. Second operand 36 states and 2343 transitions. [2023-11-29 00:40:20,379 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 275 places, 4925 transitions, 90383 flow [2023-11-29 00:41:13,906 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 269 places, 4925 transitions, 90251 flow, removed 60 selfloop flow, removed 6 redundant places. [2023-11-29 00:41:13,988 INFO L231 Difference]: Finished difference. Result has 287 places, 3562 transitions, 70106 flow [2023-11-29 00:41:13,990 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=121, PETRI_DIFFERENCE_MINUEND_FLOW=41614, PETRI_DIFFERENCE_MINUEND_PLACES=234, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=2388, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=548, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1429, PETRI_DIFFERENCE_SUBTRAHEND_STATES=36, PETRI_FLOW=70106, PETRI_PLACES=287, PETRI_TRANSITIONS=3562} [2023-11-29 00:41:13,990 INFO L281 CegarLoopForPetriNet]: 121 programPoint places, 166 predicate places. [2023-11-29 00:41:13,991 INFO L495 AbstractCegarLoop]: Abstraction has has 287 places, 3562 transitions, 70106 flow [2023-11-29 00:41:13,992 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 42 states have (on average 51.95238095238095) internal successors, (2182), 42 states have internal predecessors, (2182), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:41:13,992 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 00:41:13,992 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:41:13,996 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_95064286-8457-47f4-8e88-4f3af14b16f9/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2023-11-29 00:41:14,192 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_95064286-8457-47f4-8e88-4f3af14b16f9/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 00:41:14,192 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2023-11-29 00:41:14,193 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:41:14,193 INFO L85 PathProgramCache]: Analyzing trace with hash -1586495579, now seen corresponding path program 3 times [2023-11-29 00:41:14,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:41:14,193 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1079169107] [2023-11-29 00:41:14,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:41:14,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:41:14,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:41:15,070 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:41:15,070 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:41:15,070 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1079169107] [2023-11-29 00:41:15,070 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1079169107] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 00:41:15,070 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1310099040] [2023-11-29 00:41:15,071 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-29 00:41:15,071 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 00:41:15,071 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_95064286-8457-47f4-8e88-4f3af14b16f9/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 00:41:15,072 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_95064286-8457-47f4-8e88-4f3af14b16f9/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 00:41:15,072 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_95064286-8457-47f4-8e88-4f3af14b16f9/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-11-29 00:41:15,188 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-11-29 00:41:15,188 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 00:41:15,190 INFO L262 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 46 conjunts are in the unsatisfiable core [2023-11-29 00:41:15,195 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:41:15,203 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-29 00:41:15,286 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2023-11-29 00:41:15,286 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2023-11-29 00:41:15,463 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 00:41:15,463 INFO L378 Elim1Store]: Elim1 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 33 [2023-11-29 00:41:15,593 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 00:41:15,594 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 19 [2023-11-29 00:41:15,610 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-29 00:41:15,653 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2023-11-29 00:41:15,705 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 00:41:15,705 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 32 [2023-11-29 00:41:15,761 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 00:41:15,761 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 44 [2023-11-29 00:41:15,983 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2023-11-29 00:41:16,042 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 00:41:16,043 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 32 [2023-11-29 00:41:16,064 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 00:41:16,065 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 32 [2023-11-29 00:41:16,089 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 00:41:16,090 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 32 [2023-11-29 00:41:16,113 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 00:41:16,113 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 32 [2023-11-29 00:41:16,155 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 32 [2023-11-29 00:41:16,163 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:41:16,163 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 00:41:16,180 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_721 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_721) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset))) (forall ((v_ArrVal_721 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_721) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 3)) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_721 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_721) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 2)))) (forall ((v_ArrVal_721 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_721) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1))))) is different from false [2023-11-29 00:41:16,207 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_721 (Array Int Int)) (v_ArrVal_720 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_720) |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_721) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset))) (forall ((v_ArrVal_721 (Array Int Int)) (v_ArrVal_720 (Array Int Int))) (= (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_720) |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_721) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 2)) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_721 (Array Int Int)) (v_ArrVal_720 (Array Int Int))) (= (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_720) |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_721) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1)) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_721 (Array Int Int)) (v_ArrVal_720 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_720) |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_721) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 3))))) is different from false [2023-11-29 00:41:16,258 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (and (forall ((v_ArrVal_721 (Array Int Int)) (v_ArrVal_720 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_720) .cse0 v_ArrVal_721) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1)))) (forall ((v_ArrVal_721 (Array Int Int)) (v_ArrVal_720 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_720) .cse0 v_ArrVal_721) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 3)))) (forall ((v_ArrVal_721 (Array Int Int)) (v_ArrVal_720 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_720) .cse0 v_ArrVal_721) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset))) (forall ((v_ArrVal_721 (Array Int Int)) (v_ArrVal_720 (Array Int Int))) (= (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_720) .cse0 v_ArrVal_721) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 2)) |c_threadThread1of2ForFork0_#t~nondet4|)))) is different from false [2023-11-29 00:41:16,387 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (+ c_threadThread1of2ForFork0_~t~0.offset 3))) (let ((.cse0 (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (select |c_#race| c_threadThread1of2ForFork0_~t~0.base) .cse2 |c_threadThread1of2ForFork0_#t~nondet4|))) (.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (and (forall ((v_ArrVal_721 (Array Int Int)) (v_ArrVal_720 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_720) .cse1 v_ArrVal_721) c_threadThread1of2ForFork0_~t~0.base) .cse2))) (forall ((v_ArrVal_721 (Array Int Int)) (v_ArrVal_720 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_720) .cse1 v_ArrVal_721) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1)))) (forall ((v_ArrVal_721 (Array Int Int)) (v_ArrVal_720 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_720) .cse1 v_ArrVal_721) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 2)))) (forall ((v_ArrVal_721 (Array Int Int)) (v_ArrVal_720 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_720) .cse1 v_ArrVal_721) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset)))))) is different from false [2023-11-29 00:41:16,408 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (+ c_threadThread1of2ForFork0_~t~0.offset 2)) (.cse3 (+ c_threadThread1of2ForFork0_~t~0.offset 3))) (let ((.cse0 (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (store (select |c_#race| c_threadThread1of2ForFork0_~t~0.base) .cse2 |c_threadThread1of2ForFork0_#t~nondet4|) .cse3 |c_threadThread1of2ForFork0_#t~nondet4|))) (.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (and (forall ((v_ArrVal_721 (Array Int Int)) (v_ArrVal_720 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_720) .cse1 v_ArrVal_721) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1)))) (forall ((v_ArrVal_721 (Array Int Int)) (v_ArrVal_720 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_720) .cse1 v_ArrVal_721) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset))) (forall ((v_ArrVal_721 (Array Int Int)) (v_ArrVal_720 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_720) .cse1 v_ArrVal_721) c_threadThread1of2ForFork0_~t~0.base) .cse2))) (forall ((v_ArrVal_721 (Array Int Int)) (v_ArrVal_720 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_720) .cse1 v_ArrVal_721) c_threadThread1of2ForFork0_~t~0.base) .cse3)))))) is different from false [2023-11-29 00:41:16,428 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (+ c_threadThread1of2ForFork0_~t~0.offset 1)) (.cse2 (+ c_threadThread1of2ForFork0_~t~0.offset 2)) (.cse4 (+ c_threadThread1of2ForFork0_~t~0.offset 3))) (let ((.cse0 (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (store (store (select |c_#race| c_threadThread1of2ForFork0_~t~0.base) .cse3 |c_threadThread1of2ForFork0_#t~nondet4|) .cse2 |c_threadThread1of2ForFork0_#t~nondet4|) .cse4 |c_threadThread1of2ForFork0_#t~nondet4|))) (.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (and (forall ((v_ArrVal_721 (Array Int Int)) (v_ArrVal_720 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_720) .cse1 v_ArrVal_721) c_threadThread1of2ForFork0_~t~0.base) .cse2))) (forall ((v_ArrVal_721 (Array Int Int)) (v_ArrVal_720 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_720) .cse1 v_ArrVal_721) c_threadThread1of2ForFork0_~t~0.base) .cse3))) (forall ((v_ArrVal_721 (Array Int Int)) (v_ArrVal_720 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_720) .cse1 v_ArrVal_721) c_threadThread1of2ForFork0_~t~0.base) .cse4))) (forall ((v_ArrVal_721 (Array Int Int)) (v_ArrVal_720 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_720) .cse1 v_ArrVal_721) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset)))))) is different from false [2023-11-29 00:41:16,445 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 00:41:16,445 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 40 treesize of output 56 [2023-11-29 00:41:16,452 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 00:41:16,452 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 232 treesize of output 142 [2023-11-29 00:41:16,458 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 24 [2023-11-29 00:41:16,462 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 17 [2023-11-29 00:41:16,482 INFO L349 Elim1Store]: treesize reduction 38, result has 2.6 percent of original size [2023-11-29 00:41:16,482 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 42 treesize of output 1 [2023-11-29 00:41:16,488 INFO L349 Elim1Store]: treesize reduction 38, result has 2.6 percent of original size [2023-11-29 00:41:16,488 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 42 treesize of output 1 [2023-11-29 00:41:16,495 INFO L349 Elim1Store]: treesize reduction 38, result has 2.6 percent of original size [2023-11-29 00:41:16,495 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 42 treesize of output 1 [2023-11-29 00:41:16,806 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 46 [2023-11-29 00:41:16,899 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 00:41:16,899 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 40 [2023-11-29 00:41:16,954 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2023-11-29 00:41:16,954 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1310099040] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 00:41:16,954 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 00:41:16,954 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17, 18] total 42 [2023-11-29 00:41:16,954 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1989096511] [2023-11-29 00:41:16,954 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 00:41:16,955 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2023-11-29 00:41:16,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:41:16,956 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2023-11-29 00:41:16,957 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=161, Invalid=1187, Unknown=8, NotChecked=450, Total=1806 [2023-11-29 00:41:17,111 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 50 out of 121 [2023-11-29 00:41:17,114 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 287 places, 3562 transitions, 70106 flow. Second operand has 43 states, 43 states have (on average 52.116279069767444) internal successors, (2241), 43 states have internal predecessors, (2241), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:41:17,114 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 00:41:17,114 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 50 of 121 [2023-11-29 00:41:17,114 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 00:43:05,653 INFO L124 PetriNetUnfolderBase]: 75905/137615 cut-off events. [2023-11-29 00:43:05,654 INFO L125 PetriNetUnfolderBase]: For 1817817/1819339 co-relation queries the response was YES. [2023-11-29 00:43:06,919 INFO L83 FinitePrefix]: Finished finitePrefix Result has 942838 conditions, 137615 events. 75905/137615 cut-off events. For 1817817/1819339 co-relation queries the response was YES. Maximal size of possible extension queue 4597. Compared 1422260 event pairs, 9178 based on Foata normal form. 523/137779 useless extension candidates. Maximal degree in co-relation 940943. Up to 101869 conditions per place. [2023-11-29 00:43:07,734 INFO L140 encePairwiseOnDemand]: 78/121 looper letters, 3062 selfloop transitions, 1241 changer transitions 11/4365 dead transitions. [2023-11-29 00:43:07,734 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 320 places, 4365 transitions, 90062 flow [2023-11-29 00:43:07,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2023-11-29 00:43:07,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2023-11-29 00:43:07,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 2204 transitions. [2023-11-29 00:43:07,737 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5204250295159386 [2023-11-29 00:43:07,738 INFO L72 ComplementDD]: Start complementDD. Operand 35 states and 2204 transitions. [2023-11-29 00:43:07,738 INFO L73 IsDeterministic]: Start isDeterministic. Operand 35 states and 2204 transitions. [2023-11-29 00:43:07,738 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 00:43:07,738 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 35 states and 2204 transitions. [2023-11-29 00:43:07,742 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 36 states, 35 states have (on average 62.97142857142857) internal successors, (2204), 35 states have internal predecessors, (2204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:43:07,748 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 36 states, 36 states have (on average 121.0) internal successors, (4356), 36 states have internal predecessors, (4356), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:43:07,749 INFO L81 ComplementDD]: Finished complementDD. Result has 36 states, 36 states have (on average 121.0) internal successors, (4356), 36 states have internal predecessors, (4356), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:43:07,749 INFO L175 Difference]: Start difference. First operand has 287 places, 3562 transitions, 70106 flow. Second operand 35 states and 2204 transitions. [2023-11-29 00:43:07,749 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 320 places, 4365 transitions, 90062 flow [2023-11-29 00:44:25,116 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 312 places, 4365 transitions, 88927 flow, removed 546 selfloop flow, removed 8 redundant places. [2023-11-29 00:44:25,224 INFO L231 Difference]: Finished difference. Result has 322 places, 3855 transitions, 79580 flow [2023-11-29 00:44:25,228 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=121, PETRI_DIFFERENCE_MINUEND_FLOW=69233, PETRI_DIFFERENCE_MINUEND_PLACES=278, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=3562, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=982, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=2434, PETRI_DIFFERENCE_SUBTRAHEND_STATES=35, PETRI_FLOW=79580, PETRI_PLACES=322, PETRI_TRANSITIONS=3855} [2023-11-29 00:44:25,228 INFO L281 CegarLoopForPetriNet]: 121 programPoint places, 201 predicate places. [2023-11-29 00:44:25,228 INFO L495 AbstractCegarLoop]: Abstraction has has 322 places, 3855 transitions, 79580 flow [2023-11-29 00:44:25,230 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 43 states have (on average 52.116279069767444) internal successors, (2241), 43 states have internal predecessors, (2241), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:44:25,230 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 00:44:25,230 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:44:25,235 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_95064286-8457-47f4-8e88-4f3af14b16f9/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2023-11-29 00:44:25,430 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_95064286-8457-47f4-8e88-4f3af14b16f9/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 00:44:25,431 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2023-11-29 00:44:25,431 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:44:25,431 INFO L85 PathProgramCache]: Analyzing trace with hash -1921522245, now seen corresponding path program 4 times [2023-11-29 00:44:25,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:44:25,431 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [20859091] [2023-11-29 00:44:25,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:44:25,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:44:25,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:44:26,280 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:44:26,280 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:44:26,280 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [20859091] [2023-11-29 00:44:26,280 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [20859091] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 00:44:26,280 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [968164422] [2023-11-29 00:44:26,281 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-11-29 00:44:26,281 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 00:44:26,281 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_95064286-8457-47f4-8e88-4f3af14b16f9/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 00:44:26,282 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_95064286-8457-47f4-8e88-4f3af14b16f9/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 00:44:26,285 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_95064286-8457-47f4-8e88-4f3af14b16f9/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-11-29 00:44:26,467 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-11-29 00:44:26,467 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 00:44:26,470 INFO L262 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 71 conjunts are in the unsatisfiable core [2023-11-29 00:44:26,475 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:44:26,504 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-29 00:44:26,597 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2023-11-29 00:44:26,597 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2023-11-29 00:44:26,909 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 00:44:26,909 INFO L378 Elim1Store]: Elim1 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2023-11-29 00:44:26,917 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 00:44:26,918 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2023-11-29 00:44:27,109 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 00:44:27,109 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-11-29 00:44:27,114 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 00:44:27,115 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 19 [2023-11-29 00:44:27,144 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-29 00:44:27,213 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2023-11-29 00:44:27,460 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-11-29 00:44:27,471 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2023-11-29 00:44:27,536 INFO L378 Elim1Store]: Elim1 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 26 treesize of output 28 [2023-11-29 00:44:27,613 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 38 [2023-11-29 00:44:27,693 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 00:44:27,694 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 26 [2023-11-29 00:44:27,714 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 00:44:27,714 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 26 [2023-11-29 00:44:27,743 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 00:44:27,743 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 26 [2023-11-29 00:44:27,769 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 00:44:27,769 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 26 [2023-11-29 00:44:27,870 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 52 [2023-11-29 00:44:27,953 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:44:27,953 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 00:44:28,082 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_#t~mem13#1.offset| (* |c_ULTIMATE.start_main_~i~1#1| 4)))) (and (forall ((v_ArrVal_826 (Array Int Int))) (= (select (select (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_826))) (store .cse0 |c_ULTIMATE.start_main_#t~mem13#1.base| (store (select .cse0 |c_ULTIMATE.start_main_#t~mem13#1.base|) .cse1 0))) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 3)) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_826 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse2 (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_826))) (store .cse2 |c_ULTIMATE.start_main_#t~mem13#1.base| (store (select .cse2 |c_ULTIMATE.start_main_#t~mem13#1.base|) .cse1 0))) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1)))) (forall ((v_ArrVal_826 (Array Int Int))) (= (select (select (let ((.cse3 (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_826))) (store .cse3 |c_ULTIMATE.start_main_#t~mem13#1.base| (store (select .cse3 |c_ULTIMATE.start_main_#t~mem13#1.base|) .cse1 0))) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_826 (Array Int Int))) (= (select (select (let ((.cse4 (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_826))) (store .cse4 |c_ULTIMATE.start_main_#t~mem13#1.base| (store (select .cse4 |c_ULTIMATE.start_main_#t~mem13#1.base|) .cse1 0))) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 2)) |c_threadThread1of2ForFork0_#t~nondet4|)))) is different from false [2023-11-29 00:44:44,456 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse8 (+ c_threadThread1of2ForFork0_~t~0.offset 2)) (.cse6 (+ c_threadThread1of2ForFork0_~t~0.offset 3))) (let ((.cse3 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|)) (.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|)) (.cse2 (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (store (select |c_#race| c_threadThread1of2ForFork0_~t~0.base) .cse8 |c_threadThread1of2ForFork0_#t~nondet4|) .cse6 |c_threadThread1of2ForFork0_#t~nondet4|)))) (and (forall ((|v_ULTIMATE.start_main_~i~1#1_19| Int)) (or (< 0 |v_ULTIMATE.start_main_~i~1#1_19|) (forall ((|v_ULTIMATE.start_main_#t~mem13#1.offset_15| Int)) (or (forall ((v_ArrVal_826 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse0 (store .cse2 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_826))) (store .cse0 .cse1 (store (select .cse0 .cse1) (+ |v_ULTIMATE.start_main_#t~mem13#1.offset_15| (* |v_ULTIMATE.start_main_~i~1#1_19| 4)) 0))) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset))) (< .cse3 |v_ULTIMATE.start_main_#t~mem13#1.offset_15|))))) (forall ((|v_ULTIMATE.start_main_~i~1#1_19| Int)) (or (< 0 |v_ULTIMATE.start_main_~i~1#1_19|) (forall ((|v_ULTIMATE.start_main_#t~mem13#1.offset_15| Int)) (or (forall ((v_ArrVal_826 (Array Int Int))) (= (select (select (let ((.cse4 (store .cse2 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_826))) (store .cse4 .cse1 (store (select .cse4 .cse1) (+ |v_ULTIMATE.start_main_#t~mem13#1.offset_15| (* |v_ULTIMATE.start_main_~i~1#1_19| 4)) 0))) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1)) |c_threadThread1of2ForFork0_#t~nondet4|)) (< .cse3 |v_ULTIMATE.start_main_#t~mem13#1.offset_15|))))) (forall ((|v_ULTIMATE.start_main_~i~1#1_19| Int)) (or (< 0 |v_ULTIMATE.start_main_~i~1#1_19|) (forall ((|v_ULTIMATE.start_main_#t~mem13#1.offset_15| Int)) (or (forall ((v_ArrVal_826 (Array Int Int))) (= (select (select (let ((.cse5 (store .cse2 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_826))) (store .cse5 .cse1 (store (select .cse5 .cse1) (+ |v_ULTIMATE.start_main_#t~mem13#1.offset_15| (* |v_ULTIMATE.start_main_~i~1#1_19| 4)) 0))) c_threadThread1of2ForFork0_~t~0.base) .cse6) |c_threadThread1of2ForFork0_#t~nondet4|)) (< .cse3 |v_ULTIMATE.start_main_#t~mem13#1.offset_15|))))) (forall ((|v_ULTIMATE.start_main_~i~1#1_19| Int)) (or (< 0 |v_ULTIMATE.start_main_~i~1#1_19|) (forall ((|v_ULTIMATE.start_main_#t~mem13#1.offset_15| Int)) (or (< .cse3 |v_ULTIMATE.start_main_#t~mem13#1.offset_15|) (forall ((v_ArrVal_826 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse7 (store .cse2 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_826))) (store .cse7 .cse1 (store (select .cse7 .cse1) (+ |v_ULTIMATE.start_main_#t~mem13#1.offset_15| (* |v_ULTIMATE.start_main_~i~1#1_19| 4)) 0))) c_threadThread1of2ForFork0_~t~0.base) .cse8)))))))))) is different from false [2023-11-29 00:44:46,658 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse9 (+ c_threadThread1of2ForFork0_~t~0.offset 1)) (.cse6 (+ c_threadThread1of2ForFork0_~t~0.offset 2)) (.cse3 (+ c_threadThread1of2ForFork0_~t~0.offset 3))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|)) (.cse2 (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (store (store (select |c_#race| c_threadThread1of2ForFork0_~t~0.base) .cse9 |c_threadThread1of2ForFork0_#t~nondet4|) .cse6 |c_threadThread1of2ForFork0_#t~nondet4|) .cse3 |c_threadThread1of2ForFork0_#t~nondet4|))) (.cse4 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (and (forall ((|v_ULTIMATE.start_main_~i~1#1_19| Int)) (or (< 0 |v_ULTIMATE.start_main_~i~1#1_19|) (forall ((|v_ULTIMATE.start_main_#t~mem13#1.offset_15| Int)) (or (forall ((v_ArrVal_826 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse0 (store .cse2 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_826))) (store .cse0 .cse1 (store (select .cse0 .cse1) (+ |v_ULTIMATE.start_main_#t~mem13#1.offset_15| (* |v_ULTIMATE.start_main_~i~1#1_19| 4)) 0))) c_threadThread1of2ForFork0_~t~0.base) .cse3))) (< .cse4 |v_ULTIMATE.start_main_#t~mem13#1.offset_15|))))) (forall ((|v_ULTIMATE.start_main_~i~1#1_19| Int)) (or (forall ((|v_ULTIMATE.start_main_#t~mem13#1.offset_15| Int)) (or (forall ((v_ArrVal_826 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse5 (store .cse2 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_826))) (store .cse5 .cse1 (store (select .cse5 .cse1) (+ |v_ULTIMATE.start_main_#t~mem13#1.offset_15| (* |v_ULTIMATE.start_main_~i~1#1_19| 4)) 0))) c_threadThread1of2ForFork0_~t~0.base) .cse6))) (< .cse4 |v_ULTIMATE.start_main_#t~mem13#1.offset_15|))) (< 0 |v_ULTIMATE.start_main_~i~1#1_19|))) (forall ((|v_ULTIMATE.start_main_~i~1#1_19| Int)) (or (< 0 |v_ULTIMATE.start_main_~i~1#1_19|) (forall ((|v_ULTIMATE.start_main_#t~mem13#1.offset_15| Int)) (or (< .cse4 |v_ULTIMATE.start_main_#t~mem13#1.offset_15|) (forall ((v_ArrVal_826 (Array Int Int))) (= (select (select (let ((.cse7 (store .cse2 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_826))) (store .cse7 .cse1 (store (select .cse7 .cse1) (+ |v_ULTIMATE.start_main_#t~mem13#1.offset_15| (* |v_ULTIMATE.start_main_~i~1#1_19| 4)) 0))) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset) |c_threadThread1of2ForFork0_#t~nondet4|)))))) (forall ((|v_ULTIMATE.start_main_~i~1#1_19| Int)) (or (< 0 |v_ULTIMATE.start_main_~i~1#1_19|) (forall ((|v_ULTIMATE.start_main_#t~mem13#1.offset_15| Int)) (or (forall ((v_ArrVal_826 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse8 (store .cse2 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_826))) (store .cse8 .cse1 (store (select .cse8 .cse1) (+ |v_ULTIMATE.start_main_#t~mem13#1.offset_15| (* |v_ULTIMATE.start_main_~i~1#1_19| 4)) 0))) c_threadThread1of2ForFork0_~t~0.base) .cse9))) (< .cse4 |v_ULTIMATE.start_main_#t~mem13#1.offset_15|)))))))) is different from false [2023-11-29 00:44:46,702 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 00:44:46,703 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 81 treesize of output 74 [2023-11-29 00:44:46,718 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 00:44:46,718 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 548 treesize of output 484 [2023-11-29 00:44:46,738 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 222 treesize of output 206 [2023-11-29 00:44:46,931 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 00:44:46,931 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 122 treesize of output 88 [2023-11-29 00:44:46,990 INFO L349 Elim1Store]: treesize reduction 38, result has 2.6 percent of original size [2023-11-29 00:44:46,990 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 81 treesize of output 1 [2023-11-29 00:44:47,012 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 00:44:47,013 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 79 treesize of output 72 [2023-11-29 00:44:47,020 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 00:44:47,033 INFO L349 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2023-11-29 00:44:47,033 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 168 treesize of output 142 [2023-11-29 00:44:47,046 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 48 [2023-11-29 00:44:47,055 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 134 treesize of output 94 [2023-11-29 00:44:47,085 INFO L349 Elim1Store]: treesize reduction 38, result has 2.6 percent of original size [2023-11-29 00:44:47,085 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 81 treesize of output 1 [2023-11-29 00:44:52,069 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 106 treesize of output 74 [2023-11-29 00:44:52,074 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 85 treesize of output 77 [2023-11-29 00:44:52,085 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2023-11-29 00:44:52,094 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 30 [2023-11-29 00:44:52,254 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 00:44:52,255 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 40 [2023-11-29 00:44:52,336 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2023-11-29 00:44:52,336 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [968164422] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 00:44:52,336 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 00:44:52,337 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 19] total 52 [2023-11-29 00:44:52,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [847017399] [2023-11-29 00:44:52,337 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 00:44:52,339 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 53 states [2023-11-29 00:44:52,339 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:44:52,340 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2023-11-29 00:44:52,341 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=215, Invalid=2213, Unknown=34, NotChecked=294, Total=2756 [2023-11-29 00:44:53,402 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 44 out of 121 [2023-11-29 00:44:53,404 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 322 places, 3855 transitions, 79580 flow. Second operand has 53 states, 53 states have (on average 46.0188679245283) internal successors, (2439), 53 states have internal predecessors, (2439), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:44:53,404 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 00:44:53,404 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 44 of 121 [2023-11-29 00:44:53,404 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 00:45:14,608 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 00:45:19,163 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 00:47:35,053 INFO L124 PetriNetUnfolderBase]: 80628/146167 cut-off events. [2023-11-29 00:47:35,053 INFO L125 PetriNetUnfolderBase]: For 2242802/2244625 co-relation queries the response was YES. [2023-11-29 00:47:36,556 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1047748 conditions, 146167 events. 80628/146167 cut-off events. For 2242802/2244625 co-relation queries the response was YES. Maximal size of possible extension queue 4911. Compared 1514996 event pairs, 9480 based on Foata normal form. 733/146338 useless extension candidates. Maximal degree in co-relation 1046584. Up to 106085 conditions per place. [2023-11-29 00:47:37,388 INFO L140 encePairwiseOnDemand]: 71/121 looper letters, 3676 selfloop transitions, 1873 changer transitions 22/5616 dead transitions. [2023-11-29 00:47:37,388 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 376 places, 5616 transitions, 122783 flow [2023-11-29 00:47:37,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2023-11-29 00:47:37,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2023-11-29 00:47:37,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 3177 transitions. [2023-11-29 00:47:37,392 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47738542449286253 [2023-11-29 00:47:37,392 INFO L72 ComplementDD]: Start complementDD. Operand 55 states and 3177 transitions. [2023-11-29 00:47:37,392 INFO L73 IsDeterministic]: Start isDeterministic. Operand 55 states and 3177 transitions. [2023-11-29 00:47:37,393 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 00:47:37,393 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 55 states and 3177 transitions. [2023-11-29 00:47:37,397 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 56 states, 55 states have (on average 57.763636363636365) internal successors, (3177), 55 states have internal predecessors, (3177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:47:37,403 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 56 states, 56 states have (on average 121.0) internal successors, (6776), 56 states have internal predecessors, (6776), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:47:37,404 INFO L81 ComplementDD]: Finished complementDD. Result has 56 states, 56 states have (on average 121.0) internal successors, (6776), 56 states have internal predecessors, (6776), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:47:37,404 INFO L175 Difference]: Start difference. First operand has 322 places, 3855 transitions, 79580 flow. Second operand 55 states and 3177 transitions. [2023-11-29 00:47:37,404 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 376 places, 5616 transitions, 122783 flow [2023-11-29 00:49:03,048 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 361 places, 5616 transitions, 122092 flow, removed 297 selfloop flow, removed 15 redundant places. [2023-11-29 00:49:03,166 INFO L231 Difference]: Finished difference. Result has 389 places, 4647 transitions, 105527 flow [2023-11-29 00:49:03,169 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=121, PETRI_DIFFERENCE_MINUEND_FLOW=79120, PETRI_DIFFERENCE_MINUEND_PLACES=307, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=3855, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1167, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=2609, PETRI_DIFFERENCE_SUBTRAHEND_STATES=55, PETRI_FLOW=105527, PETRI_PLACES=389, PETRI_TRANSITIONS=4647} [2023-11-29 00:49:03,170 INFO L281 CegarLoopForPetriNet]: 121 programPoint places, 268 predicate places. [2023-11-29 00:49:03,170 INFO L495 AbstractCegarLoop]: Abstraction has has 389 places, 4647 transitions, 105527 flow [2023-11-29 00:49:03,170 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 53 states, 53 states have (on average 46.0188679245283) internal successors, (2439), 53 states have internal predecessors, (2439), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:49:03,171 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 00:49:03,171 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:49:03,175 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_95064286-8457-47f4-8e88-4f3af14b16f9/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2023-11-29 00:49:03,371 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_95064286-8457-47f4-8e88-4f3af14b16f9/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2023-11-29 00:49:03,371 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2023-11-29 00:49:03,372 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:49:03,372 INFO L85 PathProgramCache]: Analyzing trace with hash -1060161155, now seen corresponding path program 5 times [2023-11-29 00:49:03,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:49:03,372 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1162897016] [2023-11-29 00:49:03,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:49:03,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:49:03,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:49:04,149 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:49:04,149 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:49:04,149 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1162897016] [2023-11-29 00:49:04,149 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1162897016] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 00:49:04,149 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1291336940] [2023-11-29 00:49:04,149 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-11-29 00:49:04,149 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 00:49:04,149 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_95064286-8457-47f4-8e88-4f3af14b16f9/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 00:49:04,150 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_95064286-8457-47f4-8e88-4f3af14b16f9/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 00:49:04,151 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_95064286-8457-47f4-8e88-4f3af14b16f9/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-11-29 00:49:04,289 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-29 00:49:04,289 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 00:49:04,292 INFO L262 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 67 conjunts are in the unsatisfiable core [2023-11-29 00:49:04,296 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:49:04,408 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-29 00:49:04,451 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-11-29 00:49:04,451 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2023-11-29 00:49:04,544 INFO L349 Elim1Store]: treesize reduction 8, result has 61.9 percent of original size [2023-11-29 00:49:04,544 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 22 [2023-11-29 00:49:04,873 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 00:49:04,873 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 32 [2023-11-29 00:49:05,069 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 18 [2023-11-29 00:49:05,100 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-29 00:49:05,153 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2023-11-29 00:49:05,213 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2023-11-29 00:49:05,432 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2023-11-29 00:49:05,499 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 8 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 38 [2023-11-29 00:49:05,570 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 26 [2023-11-29 00:49:05,596 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 26 [2023-11-29 00:49:05,620 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 26 [2023-11-29 00:49:05,645 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 26 [2023-11-29 00:49:05,744 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 26 [2023-11-29 00:49:05,802 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:49:05,802 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 00:49:05,824 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_932 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_932) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 3)))) (forall ((v_ArrVal_932 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_932) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1)))) (forall ((v_ArrVal_932 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_932) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset))) (forall ((v_ArrVal_932 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_932) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 2)) |c_threadThread1of2ForFork0_#t~nondet4|))) is different from false [2023-11-29 00:49:27,151 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_threadThread1of2ForFork0_~t~0.offset 3))) (let ((.cse0 (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (select |c_#race| c_threadThread1of2ForFork0_~t~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_931 (Array Int Int)) (v_ArrVal_932 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_931) |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_932) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 2)))) (forall ((v_ArrVal_931 (Array Int Int)) (v_ArrVal_932 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_931) |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_932) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset))) (forall ((v_ArrVal_931 (Array Int Int)) (v_ArrVal_932 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_931) |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_932) c_threadThread1of2ForFork0_~t~0.base) .cse1) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_931 (Array Int Int)) (v_ArrVal_932 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_931) |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_932) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1))))))) is different from false [2023-11-29 00:49:28,584 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 00:49:28,585 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 42 treesize of output 58 [2023-11-29 00:49:28,592 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 00:49:28,592 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 228 treesize of output 154 [2023-11-29 00:49:28,599 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2023-11-29 00:49:28,604 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 24 [2023-11-29 00:49:28,624 INFO L349 Elim1Store]: treesize reduction 38, result has 2.6 percent of original size [2023-11-29 00:49:28,625 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 40 treesize of output 1 [2023-11-29 00:49:28,632 INFO L349 Elim1Store]: treesize reduction 38, result has 2.6 percent of original size [2023-11-29 00:49:28,633 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 42 treesize of output 1 [2023-11-29 00:49:28,640 INFO L349 Elim1Store]: treesize reduction 38, result has 2.6 percent of original size [2023-11-29 00:49:28,640 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 42 treesize of output 1 [2023-11-29 00:49:29,376 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 35 [2023-11-29 00:49:29,379 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 6 [2023-11-29 00:49:29,580 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:49:29,580 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1291336940] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 00:49:29,580 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 00:49:29,580 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 22, 20] total 53 [2023-11-29 00:49:29,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [709314383] [2023-11-29 00:49:29,580 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 00:49:29,581 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 54 states [2023-11-29 00:49:29,581 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:49:29,581 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2023-11-29 00:49:29,582 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=213, Invalid=2342, Unknown=105, NotChecked=202, Total=2862 [2023-11-29 00:49:30,169 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 34 out of 121 [2023-11-29 00:49:30,171 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 389 places, 4647 transitions, 105527 flow. Second operand has 54 states, 54 states have (on average 36.388888888888886) internal successors, (1965), 54 states have internal predecessors, (1965), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:49:30,171 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 00:49:30,171 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 34 of 121 [2023-11-29 00:49:30,171 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand