./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-data-race.prp --file ../../sv-benchmarks/c/goblint-regression/28-race_reach_01-simple_racing.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 0e0057cc Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3c29451-9883-46e4-a77f-7b54233baefe/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3c29451-9883-46e4-a77f-7b54233baefe/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_d3c29451-9883-46e4-a77f-7b54233baefe/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3c29451-9883-46e4-a77f-7b54233baefe/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerReach.xml -i ../../sv-benchmarks/c/goblint-regression/28-race_reach_01-simple_racing.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3c29451-9883-46e4-a77f-7b54233baefe/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_d3c29451-9883-46e4-a77f-7b54233baefe/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 eddb66a74cd149f880832378d52d5c02c94fd6efcf2d83aeade11bcdaaabe426 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-29 05:25:56,593 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-29 05:25:56,662 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3c29451-9883-46e4-a77f-7b54233baefe/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-DataRace-32bit-Automizer_Default.epf [2023-11-29 05:25:56,667 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-29 05:25:56,667 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-29 05:25:56,690 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-29 05:25:56,690 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-29 05:25:56,691 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-29 05:25:56,692 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-29 05:25:56,692 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-29 05:25:56,693 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-29 05:25:56,694 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-29 05:25:56,694 INFO L153 SettingsManager]: * Use SBE=true [2023-11-29 05:25:56,695 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-29 05:25:56,695 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-29 05:25:56,695 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-29 05:25:56,696 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-29 05:25:56,696 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-29 05:25:56,697 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-29 05:25:56,697 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-29 05:25:56,698 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-29 05:25:56,698 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-29 05:25:56,699 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2023-11-29 05:25:56,699 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-29 05:25:56,700 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-29 05:25:56,700 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-29 05:25:56,700 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-29 05:25:56,701 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-29 05:25:56,701 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-29 05:25:56,702 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-29 05:25:56,702 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 05:25:56,703 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-29 05:25:56,703 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-29 05:25:56,703 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-29 05:25:56,704 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-29 05:25:56,704 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-29 05:25:56,705 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-29 05:25:56,705 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-29 05:25:56,705 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-29 05:25:56,705 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-29 05:25:56,706 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-29 05:25:56,706 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_d3c29451-9883-46e4-a77f-7b54233baefe/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_d3c29451-9883-46e4-a77f-7b54233baefe/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 -> eddb66a74cd149f880832378d52d5c02c94fd6efcf2d83aeade11bcdaaabe426 [2023-11-29 05:25:56,943 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-29 05:25:56,965 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-29 05:25:56,968 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-29 05:25:56,969 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-29 05:25:56,970 INFO L274 PluginConnector]: CDTParser initialized [2023-11-29 05:25:56,971 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3c29451-9883-46e4-a77f-7b54233baefe/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/goblint-regression/28-race_reach_01-simple_racing.i [2023-11-29 05:25:59,709 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-29 05:25:59,940 INFO L384 CDTParser]: Found 1 translation units. [2023-11-29 05:25:59,941 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3c29451-9883-46e4-a77f-7b54233baefe/sv-benchmarks/c/goblint-regression/28-race_reach_01-simple_racing.i [2023-11-29 05:25:59,956 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3c29451-9883-46e4-a77f-7b54233baefe/bin/uautomizer-verify-BQ2R08f2Ya/data/336dd8040/95570c079869471d81b9639b152c087b/FLAGf69ccfffe [2023-11-29 05:25:59,970 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3c29451-9883-46e4-a77f-7b54233baefe/bin/uautomizer-verify-BQ2R08f2Ya/data/336dd8040/95570c079869471d81b9639b152c087b [2023-11-29 05:25:59,973 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-29 05:25:59,974 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-29 05:25:59,976 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-29 05:25:59,976 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-29 05:25:59,981 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-29 05:25:59,982 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 05:25:59" (1/1) ... [2023-11-29 05:25:59,983 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@26614bb7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:25:59, skipping insertion in model container [2023-11-29 05:25:59,983 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 05:25:59" (1/1) ... [2023-11-29 05:26:00,028 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 05:26:00,334 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 05:26:00,347 INFO L202 MainTranslator]: Completed pre-run [2023-11-29 05:26:00,392 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 05:26:00,425 INFO L206 MainTranslator]: Completed translation [2023-11-29 05:26:00,425 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:26:00 WrapperNode [2023-11-29 05:26:00,426 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-29 05:26:00,427 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-29 05:26:00,427 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-29 05:26:00,427 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-29 05:26:00,433 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:26:00" (1/1) ... [2023-11-29 05:26:00,445 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:26:00" (1/1) ... [2023-11-29 05:26:00,468 INFO L138 Inliner]: procedures = 171, calls = 42, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 96 [2023-11-29 05:26:00,468 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-29 05:26:00,469 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-29 05:26:00,469 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-29 05:26:00,469 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-29 05:26:00,476 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:26:00" (1/1) ... [2023-11-29 05:26:00,476 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:26:00" (1/1) ... [2023-11-29 05:26:00,480 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:26:00" (1/1) ... [2023-11-29 05:26:00,480 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:26:00" (1/1) ... [2023-11-29 05:26:00,487 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:26:00" (1/1) ... [2023-11-29 05:26:00,490 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:26:00" (1/1) ... [2023-11-29 05:26:00,492 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:26:00" (1/1) ... [2023-11-29 05:26:00,494 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:26:00" (1/1) ... [2023-11-29 05:26:00,497 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-29 05:26:00,498 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-29 05:26:00,498 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-29 05:26:00,499 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-29 05:26:00,499 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:26:00" (1/1) ... [2023-11-29 05:26:00,505 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 05:26:00,514 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3c29451-9883-46e4-a77f-7b54233baefe/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:26:00,524 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3c29451-9883-46e4-a77f-7b54233baefe/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-29 05:26:00,526 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3c29451-9883-46e4-a77f-7b54233baefe/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-29 05:26:00,552 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-29 05:26:00,552 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-29 05:26:00,553 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2023-11-29 05:26:00,553 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-29 05:26:00,553 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-29 05:26:00,553 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2023-11-29 05:26:00,553 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2023-11-29 05:26:00,553 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-29 05:26:00,553 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-29 05:26:00,554 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2023-11-29 05:26:00,554 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-29 05:26:00,554 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-29 05:26:00,555 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-29 05:26:00,677 INFO L241 CfgBuilder]: Building ICFG [2023-11-29 05:26:00,679 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-29 05:26:00,902 INFO L282 CfgBuilder]: Performing block encoding [2023-11-29 05:26:00,938 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-29 05:26:00,938 INFO L309 CfgBuilder]: Removed 10 assume(true) statements. [2023-11-29 05:26:00,940 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 05:26:00 BoogieIcfgContainer [2023-11-29 05:26:00,940 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-29 05:26:00,942 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-29 05:26:00,942 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-29 05:26:00,945 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-29 05:26:00,945 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.11 05:25:59" (1/3) ... [2023-11-29 05:26:00,946 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f30257a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 05:26:00, skipping insertion in model container [2023-11-29 05:26:00,946 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:26:00" (2/3) ... [2023-11-29 05:26:00,946 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f30257a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 05:26:00, skipping insertion in model container [2023-11-29 05:26:00,947 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 05:26:00" (3/3) ... [2023-11-29 05:26:00,948 INFO L112 eAbstractionObserver]: Analyzing ICFG 28-race_reach_01-simple_racing.i [2023-11-29 05:26:00,955 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-11-29 05:26:00,964 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-29 05:26:00,964 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 6 error locations. [2023-11-29 05:26:00,964 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-29 05:26:01,021 INFO L144 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2023-11-29 05:26:01,082 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 134 places, 144 transitions, 295 flow [2023-11-29 05:26:01,162 INFO L124 PetriNetUnfolderBase]: 19/197 cut-off events. [2023-11-29 05:26:01,162 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2023-11-29 05:26:01,169 INFO L83 FinitePrefix]: Finished finitePrefix Result has 202 conditions, 197 events. 19/197 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 637 event pairs, 0 based on Foata normal form. 0/167 useless extension candidates. Maximal degree in co-relation 105. Up to 4 conditions per place. [2023-11-29 05:26:01,169 INFO L82 GeneralOperation]: Start removeDead. Operand has 134 places, 144 transitions, 295 flow [2023-11-29 05:26:01,176 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 134 places, 144 transitions, 295 flow [2023-11-29 05:26:01,186 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-29 05:26:01,193 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;@6a299ca4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-29 05:26:01,194 INFO L358 AbstractCegarLoop]: Starting to check reachability of 11 error locations. [2023-11-29 05:26:01,209 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-29 05:26:01,209 INFO L124 PetriNetUnfolderBase]: 2/56 cut-off events. [2023-11-29 05:26:01,209 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-29 05:26:01,209 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:26:01,210 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] [2023-11-29 05:26:01,211 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 8 more)] === [2023-11-29 05:26:01,216 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:26:01,216 INFO L85 PathProgramCache]: Analyzing trace with hash -348104698, now seen corresponding path program 1 times [2023-11-29 05:26:01,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:26:01,224 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2002329095] [2023-11-29 05:26:01,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:26:01,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:26:01,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:26:01,505 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 05:26:01,505 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:26:01,506 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2002329095] [2023-11-29 05:26:01,506 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2002329095] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:26:01,507 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:26:01,507 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 05:26:01,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1402240924] [2023-11-29 05:26:01,509 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:26:01,517 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 05:26:01,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:26:01,546 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 05:26:01,546 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 05:26:01,563 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 144 [2023-11-29 05:26:01,566 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 134 places, 144 transitions, 295 flow. Second operand has 3 states, 3 states have (on average 115.0) internal successors, (345), 3 states have internal predecessors, (345), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:26:01,567 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:26:01,567 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 144 [2023-11-29 05:26:01,568 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:26:01,700 INFO L124 PetriNetUnfolderBase]: 48/479 cut-off events. [2023-11-29 05:26:01,700 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2023-11-29 05:26:01,702 INFO L83 FinitePrefix]: Finished finitePrefix Result has 600 conditions, 479 events. 48/479 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 2264 event pairs, 0 based on Foata normal form. 66/502 useless extension candidates. Maximal degree in co-relation 524. Up to 108 conditions per place. [2023-11-29 05:26:01,706 INFO L140 encePairwiseOnDemand]: 129/144 looper letters, 22 selfloop transitions, 2 changer transitions 0/135 dead transitions. [2023-11-29 05:26:01,706 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 133 places, 135 transitions, 325 flow [2023-11-29 05:26:01,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 05:26:01,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 05:26:01,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 383 transitions. [2023-11-29 05:26:01,722 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8865740740740741 [2023-11-29 05:26:01,722 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 383 transitions. [2023-11-29 05:26:01,723 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 383 transitions. [2023-11-29 05:26:01,725 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:26:01,728 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 383 transitions. [2023-11-29 05:26:01,733 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 127.66666666666667) internal successors, (383), 3 states have internal predecessors, (383), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:26:01,738 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 144.0) internal successors, (576), 4 states have internal predecessors, (576), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:26:01,739 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 144.0) internal successors, (576), 4 states have internal predecessors, (576), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:26:01,741 INFO L175 Difference]: Start difference. First operand has 134 places, 144 transitions, 295 flow. Second operand 3 states and 383 transitions. [2023-11-29 05:26:01,742 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 133 places, 135 transitions, 325 flow [2023-11-29 05:26:01,746 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 133 places, 135 transitions, 325 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-29 05:26:01,751 INFO L231 Difference]: Finished difference. Result has 134 places, 129 transitions, 273 flow [2023-11-29 05:26:01,753 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=144, PETRI_DIFFERENCE_MINUEND_FLOW=265, PETRI_DIFFERENCE_MINUEND_PLACES=131, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=129, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=127, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=273, PETRI_PLACES=134, PETRI_TRANSITIONS=129} [2023-11-29 05:26:01,756 INFO L281 CegarLoopForPetriNet]: 134 programPoint places, 0 predicate places. [2023-11-29 05:26:01,757 INFO L495 AbstractCegarLoop]: Abstraction has has 134 places, 129 transitions, 273 flow [2023-11-29 05:26:01,757 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 115.0) internal successors, (345), 3 states have internal predecessors, (345), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:26:01,757 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:26:01,758 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] [2023-11-29 05:26:01,758 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-29 05:26:01,758 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 8 more)] === [2023-11-29 05:26:01,759 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:26:01,759 INFO L85 PathProgramCache]: Analyzing trace with hash 831660367, now seen corresponding path program 1 times [2023-11-29 05:26:01,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:26:01,759 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [418279394] [2023-11-29 05:26:01,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:26:01,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:26:01,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:26:01,836 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 05:26:01,836 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:26:01,837 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [418279394] [2023-11-29 05:26:01,837 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [418279394] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:26:01,837 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:26:01,837 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 05:26:01,837 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1691450016] [2023-11-29 05:26:01,838 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:26:01,839 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 05:26:01,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:26:01,840 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 05:26:01,840 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 05:26:01,862 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 144 [2023-11-29 05:26:01,863 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 134 places, 129 transitions, 273 flow. Second operand has 3 states, 3 states have (on average 109.66666666666667) internal successors, (329), 3 states have internal predecessors, (329), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:26:01,863 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:26:01,863 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 144 [2023-11-29 05:26:01,863 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:26:02,051 INFO L124 PetriNetUnfolderBase]: 91/775 cut-off events. [2023-11-29 05:26:02,052 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2023-11-29 05:26:02,054 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1004 conditions, 775 events. 91/775 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 4525 event pairs, 27 based on Foata normal form. 0/707 useless extension candidates. Maximal degree in co-relation 952. Up to 125 conditions per place. [2023-11-29 05:26:02,057 INFO L140 encePairwiseOnDemand]: 135/144 looper letters, 30 selfloop transitions, 6 changer transitions 0/142 dead transitions. [2023-11-29 05:26:02,057 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 134 places, 142 transitions, 374 flow [2023-11-29 05:26:02,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 05:26:02,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 05:26:02,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 363 transitions. [2023-11-29 05:26:02,060 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8402777777777778 [2023-11-29 05:26:02,060 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 363 transitions. [2023-11-29 05:26:02,061 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 363 transitions. [2023-11-29 05:26:02,061 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:26:02,061 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 363 transitions. [2023-11-29 05:26:02,063 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 121.0) internal successors, (363), 3 states have internal predecessors, (363), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:26:02,065 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 144.0) internal successors, (576), 4 states have internal predecessors, (576), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:26:02,066 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 144.0) internal successors, (576), 4 states have internal predecessors, (576), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:26:02,066 INFO L175 Difference]: Start difference. First operand has 134 places, 129 transitions, 273 flow. Second operand 3 states and 363 transitions. [2023-11-29 05:26:02,066 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 134 places, 142 transitions, 374 flow [2023-11-29 05:26:02,068 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 132 places, 142 transitions, 370 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 05:26:02,071 INFO L231 Difference]: Finished difference. Result has 134 places, 131 transitions, 307 flow [2023-11-29 05:26:02,071 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=144, PETRI_DIFFERENCE_MINUEND_FLOW=265, PETRI_DIFFERENCE_MINUEND_PLACES=130, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=127, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=121, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=307, PETRI_PLACES=134, PETRI_TRANSITIONS=131} [2023-11-29 05:26:02,072 INFO L281 CegarLoopForPetriNet]: 134 programPoint places, 0 predicate places. [2023-11-29 05:26:02,072 INFO L495 AbstractCegarLoop]: Abstraction has has 134 places, 131 transitions, 307 flow [2023-11-29 05:26:02,073 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 109.66666666666667) internal successors, (329), 3 states have internal predecessors, (329), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:26:02,073 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:26:02,073 INFO L208 CegarLoopForPetriNet]: trace histogram [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 05:26:02,073 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-29 05:26:02,074 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 8 more)] === [2023-11-29 05:26:02,074 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:26:02,074 INFO L85 PathProgramCache]: Analyzing trace with hash -632524784, now seen corresponding path program 1 times [2023-11-29 05:26:02,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:26:02,075 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [530600857] [2023-11-29 05:26:02,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:26:02,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:26:02,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 05:26:02,106 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 05:26:02,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 05:26:02,150 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 05:26:02,150 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-29 05:26:02,151 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (10 of 11 remaining) [2023-11-29 05:26:02,153 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (9 of 11 remaining) [2023-11-29 05:26:02,153 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (8 of 11 remaining) [2023-11-29 05:26:02,154 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (7 of 11 remaining) [2023-11-29 05:26:02,154 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (6 of 11 remaining) [2023-11-29 05:26:02,154 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (5 of 11 remaining) [2023-11-29 05:26:02,154 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE (4 of 11 remaining) [2023-11-29 05:26:02,155 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (3 of 11 remaining) [2023-11-29 05:26:02,155 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (2 of 11 remaining) [2023-11-29 05:26:02,155 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (1 of 11 remaining) [2023-11-29 05:26:02,155 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE (0 of 11 remaining) [2023-11-29 05:26:02,156 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-29 05:26:02,156 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2023-11-29 05:26:02,158 WARN L233 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2023-11-29 05:26:02,159 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2023-11-29 05:26:02,192 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2023-11-29 05:26:02,198 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 178 places, 193 transitions, 402 flow [2023-11-29 05:26:02,248 INFO L124 PetriNetUnfolderBase]: 34/331 cut-off events. [2023-11-29 05:26:02,248 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2023-11-29 05:26:02,250 INFO L83 FinitePrefix]: Finished finitePrefix Result has 343 conditions, 331 events. 34/331 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 1232 event pairs, 0 based on Foata normal form. 0/278 useless extension candidates. Maximal degree in co-relation 199. Up to 8 conditions per place. [2023-11-29 05:26:02,250 INFO L82 GeneralOperation]: Start removeDead. Operand has 178 places, 193 transitions, 402 flow [2023-11-29 05:26:02,255 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 178 places, 193 transitions, 402 flow [2023-11-29 05:26:02,256 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-29 05:26:02,257 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;@6a299ca4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-29 05:26:02,257 INFO L358 AbstractCegarLoop]: Starting to check reachability of 15 error locations. [2023-11-29 05:26:02,264 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-29 05:26:02,264 INFO L124 PetriNetUnfolderBase]: 2/56 cut-off events. [2023-11-29 05:26:02,264 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-29 05:26:02,264 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:26:02,264 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] [2023-11-29 05:26:02,265 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2023-11-29 05:26:02,265 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:26:02,265 INFO L85 PathProgramCache]: Analyzing trace with hash 1372539526, now seen corresponding path program 1 times [2023-11-29 05:26:02,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:26:02,266 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2083199412] [2023-11-29 05:26:02,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:26:02,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:26:02,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:26:02,330 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 05:26:02,330 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:26:02,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2083199412] [2023-11-29 05:26:02,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2083199412] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:26:02,331 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:26:02,331 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 05:26:02,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1478495739] [2023-11-29 05:26:02,331 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:26:02,331 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 05:26:02,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:26:02,332 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 05:26:02,333 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 05:26:02,344 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 148 out of 193 [2023-11-29 05:26:02,345 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 178 places, 193 transitions, 402 flow. Second operand has 3 states, 3 states have (on average 150.0) internal successors, (450), 3 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 05:26:02,345 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:26:02,346 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 148 of 193 [2023-11-29 05:26:02,346 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:26:02,902 INFO L124 PetriNetUnfolderBase]: 788/4225 cut-off events. [2023-11-29 05:26:02,902 INFO L125 PetriNetUnfolderBase]: For 77/77 co-relation queries the response was YES. [2023-11-29 05:26:02,909 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5578 conditions, 4225 events. 788/4225 cut-off events. For 77/77 co-relation queries the response was YES. Maximal size of possible extension queue 114. Compared 40426 event pairs, 348 based on Foata normal form. 749/4593 useless extension candidates. Maximal degree in co-relation 717. Up to 1303 conditions per place. [2023-11-29 05:26:02,926 INFO L140 encePairwiseOnDemand]: 172/193 looper letters, 31 selfloop transitions, 2 changer transitions 0/179 dead transitions. [2023-11-29 05:26:02,926 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 177 places, 179 transitions, 440 flow [2023-11-29 05:26:02,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 05:26:02,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 05:26:02,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 503 transitions. [2023-11-29 05:26:02,929 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8687392055267703 [2023-11-29 05:26:02,929 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 503 transitions. [2023-11-29 05:26:02,929 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 503 transitions. [2023-11-29 05:26:02,930 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:26:02,930 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 503 transitions. [2023-11-29 05:26:02,932 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 167.66666666666666) internal successors, (503), 3 states have internal predecessors, (503), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:26:02,934 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 193.0) internal successors, (772), 4 states have internal predecessors, (772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:26:02,935 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 193.0) internal successors, (772), 4 states have internal predecessors, (772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:26:02,935 INFO L175 Difference]: Start difference. First operand has 178 places, 193 transitions, 402 flow. Second operand 3 states and 503 transitions. [2023-11-29 05:26:02,935 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 177 places, 179 transitions, 440 flow [2023-11-29 05:26:02,938 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 177 places, 179 transitions, 440 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-29 05:26:02,941 INFO L231 Difference]: Finished difference. Result has 178 places, 173 transitions, 372 flow [2023-11-29 05:26:02,942 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=193, PETRI_DIFFERENCE_MINUEND_FLOW=360, PETRI_DIFFERENCE_MINUEND_PLACES=175, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=172, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=170, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=372, PETRI_PLACES=178, PETRI_TRANSITIONS=173} [2023-11-29 05:26:02,943 INFO L281 CegarLoopForPetriNet]: 178 programPoint places, 0 predicate places. [2023-11-29 05:26:02,943 INFO L495 AbstractCegarLoop]: Abstraction has has 178 places, 173 transitions, 372 flow [2023-11-29 05:26:02,944 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 150.0) internal successors, (450), 3 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 05:26:02,944 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:26:02,944 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] [2023-11-29 05:26:02,944 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-29 05:26:02,944 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2023-11-29 05:26:02,945 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:26:02,945 INFO L85 PathProgramCache]: Analyzing trace with hash -964591489, now seen corresponding path program 1 times [2023-11-29 05:26:02,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:26:02,945 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1058171371] [2023-11-29 05:26:02,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:26:02,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:26:02,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:26:02,993 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 05:26:02,993 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:26:02,993 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1058171371] [2023-11-29 05:26:02,993 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1058171371] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:26:02,994 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:26:02,994 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 05:26:02,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [948894510] [2023-11-29 05:26:02,994 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:26:02,995 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 05:26:02,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:26:02,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 05:26:02,996 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 05:26:03,033 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 135 out of 193 [2023-11-29 05:26:03,034 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 178 places, 173 transitions, 372 flow. Second operand has 3 states, 3 states have (on average 136.66666666666666) internal successors, (410), 3 states have internal predecessors, (410), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:26:03,034 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:26:03,034 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 135 of 193 [2023-11-29 05:26:03,034 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:26:05,052 INFO L124 PetriNetUnfolderBase]: 3893/14942 cut-off events. [2023-11-29 05:26:05,052 INFO L125 PetriNetUnfolderBase]: For 237/237 co-relation queries the response was YES. [2023-11-29 05:26:05,092 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21480 conditions, 14942 events. 3893/14942 cut-off events. For 237/237 co-relation queries the response was YES. Maximal size of possible extension queue 398. Compared 170515 event pairs, 1530 based on Foata normal form. 0/13360 useless extension candidates. Maximal degree in co-relation 21427. Up to 3516 conditions per place. [2023-11-29 05:26:05,161 INFO L140 encePairwiseOnDemand]: 174/193 looper letters, 58 selfloop transitions, 14 changer transitions 0/206 dead transitions. [2023-11-29 05:26:05,161 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 180 places, 206 transitions, 593 flow [2023-11-29 05:26:05,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 05:26:05,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 05:26:05,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 482 transitions. [2023-11-29 05:26:05,164 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8324697754749568 [2023-11-29 05:26:05,164 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 482 transitions. [2023-11-29 05:26:05,164 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 482 transitions. [2023-11-29 05:26:05,165 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:26:05,165 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 482 transitions. [2023-11-29 05:26:05,167 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 160.66666666666666) internal successors, (482), 3 states have internal predecessors, (482), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:26:05,169 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 193.0) internal successors, (772), 4 states have internal predecessors, (772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:26:05,170 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 193.0) internal successors, (772), 4 states have internal predecessors, (772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:26:05,170 INFO L175 Difference]: Start difference. First operand has 178 places, 173 transitions, 372 flow. Second operand 3 states and 482 transitions. [2023-11-29 05:26:05,171 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 180 places, 206 transitions, 593 flow [2023-11-29 05:26:05,174 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 179 places, 206 transitions, 591 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-29 05:26:05,178 INFO L231 Difference]: Finished difference. Result has 181 places, 187 transitions, 492 flow [2023-11-29 05:26:05,178 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=193, PETRI_DIFFERENCE_MINUEND_FLOW=370, PETRI_DIFFERENCE_MINUEND_PLACES=177, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=173, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=159, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=492, PETRI_PLACES=181, PETRI_TRANSITIONS=187} [2023-11-29 05:26:05,179 INFO L281 CegarLoopForPetriNet]: 178 programPoint places, 3 predicate places. [2023-11-29 05:26:05,179 INFO L495 AbstractCegarLoop]: Abstraction has has 181 places, 187 transitions, 492 flow [2023-11-29 05:26:05,180 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 136.66666666666666) internal successors, (410), 3 states have internal predecessors, (410), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:26:05,180 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:26:05,180 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] [2023-11-29 05:26:05,180 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-29 05:26:05,181 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2023-11-29 05:26:05,181 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:26:05,181 INFO L85 PathProgramCache]: Analyzing trace with hash -1963150244, now seen corresponding path program 1 times [2023-11-29 05:26:05,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:26:05,182 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [306904300] [2023-11-29 05:26:05,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:26:05,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:26:05,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:26:05,236 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 05:26:05,236 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:26:05,236 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [306904300] [2023-11-29 05:26:05,236 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [306904300] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:26:05,236 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:26:05,237 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 05:26:05,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [754504299] [2023-11-29 05:26:05,237 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:26:05,237 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 05:26:05,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:26:05,238 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 05:26:05,238 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 05:26:05,277 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 141 out of 193 [2023-11-29 05:26:05,278 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 181 places, 187 transitions, 492 flow. Second operand has 3 states, 3 states have (on average 143.33333333333334) internal successors, (430), 3 states have internal predecessors, (430), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:26:05,278 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:26:05,278 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 141 of 193 [2023-11-29 05:26:05,278 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:26:07,281 INFO L124 PetriNetUnfolderBase]: 4051/17146 cut-off events. [2023-11-29 05:26:07,281 INFO L125 PetriNetUnfolderBase]: For 4322/4510 co-relation queries the response was YES. [2023-11-29 05:26:07,309 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27922 conditions, 17146 events. 4051/17146 cut-off events. For 4322/4510 co-relation queries the response was YES. Maximal size of possible extension queue 468. Compared 206669 event pairs, 2548 based on Foata normal form. 37/15580 useless extension candidates. Maximal degree in co-relation 26654. Up to 5551 conditions per place. [2023-11-29 05:26:07,354 INFO L140 encePairwiseOnDemand]: 184/193 looper letters, 52 selfloop transitions, 14 changer transitions 0/211 dead transitions. [2023-11-29 05:26:07,354 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 183 places, 211 transitions, 710 flow [2023-11-29 05:26:07,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 05:26:07,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 05:26:07,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 476 transitions. [2023-11-29 05:26:07,356 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8221070811744386 [2023-11-29 05:26:07,356 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 476 transitions. [2023-11-29 05:26:07,356 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 476 transitions. [2023-11-29 05:26:07,356 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:26:07,356 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 476 transitions. [2023-11-29 05:26:07,358 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 158.66666666666666) internal successors, (476), 3 states have internal predecessors, (476), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:26:07,359 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 193.0) internal successors, (772), 4 states have internal predecessors, (772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:26:07,359 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 193.0) internal successors, (772), 4 states have internal predecessors, (772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:26:07,359 INFO L175 Difference]: Start difference. First operand has 181 places, 187 transitions, 492 flow. Second operand 3 states and 476 transitions. [2023-11-29 05:26:07,360 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 183 places, 211 transitions, 710 flow [2023-11-29 05:26:07,370 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 181 places, 211 transitions, 672 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 05:26:07,372 INFO L231 Difference]: Finished difference. Result has 183 places, 199 transitions, 590 flow [2023-11-29 05:26:07,373 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=193, PETRI_DIFFERENCE_MINUEND_FLOW=464, PETRI_DIFFERENCE_MINUEND_PLACES=179, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=187, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=173, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=590, PETRI_PLACES=183, PETRI_TRANSITIONS=199} [2023-11-29 05:26:07,373 INFO L281 CegarLoopForPetriNet]: 178 programPoint places, 5 predicate places. [2023-11-29 05:26:07,374 INFO L495 AbstractCegarLoop]: Abstraction has has 183 places, 199 transitions, 590 flow [2023-11-29 05:26:07,374 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 143.33333333333334) internal successors, (430), 3 states have internal predecessors, (430), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:26:07,374 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:26:07,375 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 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] [2023-11-29 05:26:07,375 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-29 05:26:07,375 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2023-11-29 05:26:07,375 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:26:07,375 INFO L85 PathProgramCache]: Analyzing trace with hash 2062277515, now seen corresponding path program 1 times [2023-11-29 05:26:07,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:26:07,376 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2127499021] [2023-11-29 05:26:07,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:26:07,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:26:07,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 05:26:07,395 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 05:26:07,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 05:26:07,416 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 05:26:07,416 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-29 05:26:07,417 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (14 of 15 remaining) [2023-11-29 05:26:07,417 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (13 of 15 remaining) [2023-11-29 05:26:07,417 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (12 of 15 remaining) [2023-11-29 05:26:07,417 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (11 of 15 remaining) [2023-11-29 05:26:07,417 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (10 of 15 remaining) [2023-11-29 05:26:07,417 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (9 of 15 remaining) [2023-11-29 05:26:07,418 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE (8 of 15 remaining) [2023-11-29 05:26:07,418 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (7 of 15 remaining) [2023-11-29 05:26:07,418 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (6 of 15 remaining) [2023-11-29 05:26:07,418 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (5 of 15 remaining) [2023-11-29 05:26:07,418 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE (4 of 15 remaining) [2023-11-29 05:26:07,418 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (3 of 15 remaining) [2023-11-29 05:26:07,418 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (2 of 15 remaining) [2023-11-29 05:26:07,419 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (1 of 15 remaining) [2023-11-29 05:26:07,419 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE (0 of 15 remaining) [2023-11-29 05:26:07,419 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-29 05:26:07,419 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2023-11-29 05:26:07,420 WARN L233 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2023-11-29 05:26:07,420 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2023-11-29 05:26:07,456 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2023-11-29 05:26:07,460 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 222 places, 242 transitions, 511 flow [2023-11-29 05:26:07,508 INFO L124 PetriNetUnfolderBase]: 54/512 cut-off events. [2023-11-29 05:26:07,508 INFO L125 PetriNetUnfolderBase]: For 19/19 co-relation queries the response was YES. [2023-11-29 05:26:07,511 INFO L83 FinitePrefix]: Finished finitePrefix Result has 537 conditions, 512 events. 54/512 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 2104 event pairs, 1 based on Foata normal form. 0/430 useless extension candidates. Maximal degree in co-relation 339. Up to 16 conditions per place. [2023-11-29 05:26:07,511 INFO L82 GeneralOperation]: Start removeDead. Operand has 222 places, 242 transitions, 511 flow [2023-11-29 05:26:07,515 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 222 places, 242 transitions, 511 flow [2023-11-29 05:26:07,516 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-29 05:26:07,517 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;@6a299ca4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-29 05:26:07,517 INFO L358 AbstractCegarLoop]: Starting to check reachability of 19 error locations. [2023-11-29 05:26:07,521 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-29 05:26:07,521 INFO L124 PetriNetUnfolderBase]: 2/56 cut-off events. [2023-11-29 05:26:07,521 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-29 05:26:07,521 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:26:07,521 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] [2023-11-29 05:26:07,521 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 16 more)] === [2023-11-29 05:26:07,522 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:26:07,522 INFO L85 PathProgramCache]: Analyzing trace with hash -497891450, now seen corresponding path program 1 times [2023-11-29 05:26:07,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:26:07,522 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [680702206] [2023-11-29 05:26:07,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:26:07,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:26:07,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:26:07,626 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 05:26:07,626 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:26:07,626 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [680702206] [2023-11-29 05:26:07,627 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [680702206] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:26:07,627 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:26:07,627 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 05:26:07,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1650971242] [2023-11-29 05:26:07,627 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:26:07,628 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 05:26:07,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:26:07,628 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 05:26:07,629 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 05:26:07,642 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 183 out of 242 [2023-11-29 05:26:07,643 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 222 places, 242 transitions, 511 flow. Second operand has 3 states, 3 states have (on average 185.0) internal successors, (555), 3 states have internal predecessors, (555), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:26:07,643 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:26:07,643 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 183 of 242 [2023-11-29 05:26:07,643 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:26:11,505 INFO L124 PetriNetUnfolderBase]: 8948/35197 cut-off events. [2023-11-29 05:26:11,505 INFO L125 PetriNetUnfolderBase]: For 952/952 co-relation queries the response was YES. [2023-11-29 05:26:11,583 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48435 conditions, 35197 events. 8948/35197 cut-off events. For 952/952 co-relation queries the response was YES. Maximal size of possible extension queue 775. Compared 459377 event pairs, 7791 based on Foata normal form. 7659/39623 useless extension candidates. Maximal degree in co-relation 6247. Up to 12802 conditions per place. [2023-11-29 05:26:11,703 INFO L140 encePairwiseOnDemand]: 215/242 looper letters, 39 selfloop transitions, 2 changer transitions 0/222 dead transitions. [2023-11-29 05:26:11,703 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 221 places, 222 transitions, 553 flow [2023-11-29 05:26:11,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 05:26:11,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 05:26:11,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 622 transitions. [2023-11-29 05:26:11,707 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8567493112947658 [2023-11-29 05:26:11,707 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 622 transitions. [2023-11-29 05:26:11,707 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 622 transitions. [2023-11-29 05:26:11,708 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:26:11,708 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 622 transitions. [2023-11-29 05:26:11,709 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 207.33333333333334) internal successors, (622), 3 states have internal predecessors, (622), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:26:11,711 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 242.0) internal successors, (968), 4 states have internal predecessors, (968), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:26:11,712 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 242.0) internal successors, (968), 4 states have internal predecessors, (968), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:26:11,712 INFO L175 Difference]: Start difference. First operand has 222 places, 242 transitions, 511 flow. Second operand 3 states and 622 transitions. [2023-11-29 05:26:11,712 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 221 places, 222 transitions, 553 flow [2023-11-29 05:26:11,715 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 221 places, 222 transitions, 553 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-29 05:26:11,719 INFO L231 Difference]: Finished difference. Result has 222 places, 216 transitions, 469 flow [2023-11-29 05:26:11,719 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=242, PETRI_DIFFERENCE_MINUEND_FLOW=457, PETRI_DIFFERENCE_MINUEND_PLACES=219, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=215, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=213, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=469, PETRI_PLACES=222, PETRI_TRANSITIONS=216} [2023-11-29 05:26:11,720 INFO L281 CegarLoopForPetriNet]: 222 programPoint places, 0 predicate places. [2023-11-29 05:26:11,720 INFO L495 AbstractCegarLoop]: Abstraction has has 222 places, 216 transitions, 469 flow [2023-11-29 05:26:11,721 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 185.0) internal successors, (555), 3 states have internal predecessors, (555), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:26:11,721 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:26:11,722 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] [2023-11-29 05:26:11,722 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-29 05:26:11,722 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 16 more)] === [2023-11-29 05:26:11,722 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:26:11,722 INFO L85 PathProgramCache]: Analyzing trace with hash -621742048, now seen corresponding path program 1 times [2023-11-29 05:26:11,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:26:11,723 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1236669635] [2023-11-29 05:26:11,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:26:11,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:26:11,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:26:11,764 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 05:26:11,764 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:26:11,764 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1236669635] [2023-11-29 05:26:11,764 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1236669635] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:26:11,765 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:26:11,765 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 05:26:11,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [536664787] [2023-11-29 05:26:11,765 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:26:11,765 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 05:26:11,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:26:11,766 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 05:26:11,766 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 05:26:11,813 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 162 out of 242 [2023-11-29 05:26:11,814 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 222 places, 216 transitions, 469 flow. Second operand has 3 states, 3 states have (on average 163.66666666666666) internal successors, (491), 3 states have internal predecessors, (491), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:26:11,814 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:26:11,814 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 162 of 242 [2023-11-29 05:26:11,814 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:26:42,009 INFO L124 PetriNetUnfolderBase]: 108047/277322 cut-off events. [2023-11-29 05:26:42,009 INFO L125 PetriNetUnfolderBase]: For 6263/6263 co-relation queries the response was YES. [2023-11-29 05:26:42,784 INFO L83 FinitePrefix]: Finished finitePrefix Result has 433273 conditions, 277322 events. 108047/277322 cut-off events. For 6263/6263 co-relation queries the response was YES. Maximal size of possible extension queue 5951. Compared 4048035 event pairs, 45980 based on Foata normal form. 0/246080 useless extension candidates. Maximal degree in co-relation 433219. Up to 82478 conditions per place. [2023-11-29 05:26:43,784 INFO L140 encePairwiseOnDemand]: 215/242 looper letters, 82 selfloop transitions, 20 changer transitions 0/263 dead transitions. [2023-11-29 05:26:43,784 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 224 places, 263 transitions, 788 flow [2023-11-29 05:26:43,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 05:26:43,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 05:26:43,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 595 transitions. [2023-11-29 05:26:43,786 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8195592286501377 [2023-11-29 05:26:43,786 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 595 transitions. [2023-11-29 05:26:43,786 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 595 transitions. [2023-11-29 05:26:43,787 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:26:43,787 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 595 transitions. [2023-11-29 05:26:43,789 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 198.33333333333334) internal successors, (595), 3 states have internal predecessors, (595), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:26:43,790 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 242.0) internal successors, (968), 4 states have internal predecessors, (968), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:26:43,791 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 242.0) internal successors, (968), 4 states have internal predecessors, (968), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:26:43,791 INFO L175 Difference]: Start difference. First operand has 222 places, 216 transitions, 469 flow. Second operand 3 states and 595 transitions. [2023-11-29 05:26:43,791 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 224 places, 263 transitions, 788 flow [2023-11-29 05:26:43,813 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 223 places, 263 transitions, 786 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-29 05:26:43,817 INFO L231 Difference]: Finished difference. Result has 225 places, 236 transitions, 641 flow [2023-11-29 05:26:43,818 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=242, PETRI_DIFFERENCE_MINUEND_FLOW=467, PETRI_DIFFERENCE_MINUEND_PLACES=221, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=216, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=196, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=641, PETRI_PLACES=225, PETRI_TRANSITIONS=236} [2023-11-29 05:26:43,819 INFO L281 CegarLoopForPetriNet]: 222 programPoint places, 3 predicate places. [2023-11-29 05:26:43,819 INFO L495 AbstractCegarLoop]: Abstraction has has 225 places, 236 transitions, 641 flow [2023-11-29 05:26:43,819 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 163.66666666666666) internal successors, (491), 3 states have internal predecessors, (491), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:26:43,819 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:26:43,820 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] [2023-11-29 05:26:43,820 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-29 05:26:43,820 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 16 more)] === [2023-11-29 05:26:43,820 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:26:43,820 INFO L85 PathProgramCache]: Analyzing trace with hash 444106411, now seen corresponding path program 1 times [2023-11-29 05:26:43,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:26:43,820 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1245285201] [2023-11-29 05:26:43,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:26:43,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:26:43,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:26:43,863 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 05:26:43,863 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:26:43,864 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1245285201] [2023-11-29 05:26:43,864 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1245285201] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:26:43,864 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:26:43,864 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 05:26:43,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [952443258] [2023-11-29 05:26:43,864 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:26:43,865 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 05:26:43,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:26:43,865 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 05:26:43,865 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 05:26:43,924 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 172 out of 242 [2023-11-29 05:26:43,925 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 225 places, 236 transitions, 641 flow. Second operand has 3 states, 3 states have (on average 174.33333333333334) internal successors, (523), 3 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 05:26:43,925 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:26:43,925 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 172 of 242 [2023-11-29 05:26:43,925 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:26:47,875 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([848] L702-9-->L702-10: Formula: (= |v_t_funThread2of3ForFork0_#t~nondet6_3| |v_#race~global~0_7|) InVars {t_funThread2of3ForFork0_#t~nondet6=|v_t_funThread2of3ForFork0_#t~nondet6_3|} OutVars{t_funThread2of3ForFork0_#t~nondet6=|v_t_funThread2of3ForFork0_#t~nondet6_3|, #race~global~0=|v_#race~global~0_7|} AuxVars[] AssignedVars[#race~global~0][103], [38#L709-6true, 106#L701-3true, 156#L702-10true, Black: 227#(= |ULTIMATE.start_main_~i~0#1| 0), 236#true, 64#L702-16true, Black: 232#(= |#race~global~0| 0), t_funThread1of3ForFork0InUse, 230#true, t_funThread2of3ForFork0InUse, t_funThread3of3ForFork0InUse]) [2023-11-29 05:26:47,875 INFO L294 olderBase$Statistics]: this new event has 100 ancestors and is cut-off event [2023-11-29 05:26:47,875 INFO L297 olderBase$Statistics]: existing Event has 100 ancestors and is cut-off event [2023-11-29 05:26:47,875 INFO L297 olderBase$Statistics]: existing Event has 100 ancestors and is cut-off event [2023-11-29 05:26:47,875 INFO L297 olderBase$Statistics]: existing Event has 100 ancestors and is cut-off event [2023-11-29 05:26:48,168 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([931] L702-23-->L702-24: Formula: (= |v_#race~global~0_10| 0) InVars {} OutVars{#race~global~0=|v_#race~global~0_10|} AuxVars[] AssignedVars[#race~global~0][179], [38#L709-6true, 106#L701-3true, 99#L702-6true, Black: 227#(= |ULTIMATE.start_main_~i~0#1| 0), 236#true, 67#L702-24true, Black: 230#true, t_funThread1of3ForFork0InUse, t_funThread2of3ForFork0InUse, 232#(= |#race~global~0| 0), t_funThread3of3ForFork0InUse]) [2023-11-29 05:26:48,168 INFO L294 olderBase$Statistics]: this new event has 101 ancestors and is cut-off event [2023-11-29 05:26:48,169 INFO L297 olderBase$Statistics]: existing Event has 101 ancestors and is cut-off event [2023-11-29 05:26:48,169 INFO L297 olderBase$Statistics]: existing Event has 101 ancestors and is cut-off event [2023-11-29 05:26:48,169 INFO L297 olderBase$Statistics]: existing Event has 101 ancestors and is cut-off event [2023-11-29 05:26:48,170 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([882] L702-4-->L702-5: Formula: (= |v_#race~global~0_4| 0) InVars {} OutVars{#race~global~0=|v_#race~global~0_4|} AuxVars[] AssignedVars[#race~global~0][174], [38#L709-6true, 99#L702-6true, Black: 227#(= |ULTIMATE.start_main_~i~0#1| 0), 236#true, Black: 230#true, 64#L702-16true, t_funThread1of3ForFork0InUse, 118#L702-5true, t_funThread2of3ForFork0InUse, 232#(= |#race~global~0| 0), t_funThread3of3ForFork0InUse]) [2023-11-29 05:26:48,170 INFO L294 olderBase$Statistics]: this new event has 101 ancestors and is cut-off event [2023-11-29 05:26:48,170 INFO L297 olderBase$Statistics]: existing Event has 101 ancestors and is cut-off event [2023-11-29 05:26:48,170 INFO L297 olderBase$Statistics]: existing Event has 101 ancestors and is cut-off event [2023-11-29 05:26:48,170 INFO L297 olderBase$Statistics]: existing Event has 101 ancestors and is cut-off event [2023-11-29 05:26:48,971 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([848] L702-9-->L702-10: Formula: (= |v_t_funThread2of3ForFork0_#t~nondet6_3| |v_#race~global~0_7|) InVars {t_funThread2of3ForFork0_#t~nondet6=|v_t_funThread2of3ForFork0_#t~nondet6_3|} OutVars{t_funThread2of3ForFork0_#t~nondet6=|v_t_funThread2of3ForFork0_#t~nondet6_3|, #race~global~0=|v_#race~global~0_7|} AuxVars[] AssignedVars[#race~global~0][103], [38#L709-6true, 106#L701-3true, 170#L702-22true, 156#L702-10true, Black: 227#(= |ULTIMATE.start_main_~i~0#1| 0), 236#true, Black: 232#(= |#race~global~0| 0), t_funThread1of3ForFork0InUse, 230#true, t_funThread2of3ForFork0InUse, t_funThread3of3ForFork0InUse]) [2023-11-29 05:26:48,971 INFO L294 olderBase$Statistics]: this new event has 103 ancestors and is cut-off event [2023-11-29 05:26:48,971 INFO L297 olderBase$Statistics]: existing Event has 103 ancestors and is cut-off event [2023-11-29 05:26:48,971 INFO L297 olderBase$Statistics]: existing Event has 103 ancestors and is cut-off event [2023-11-29 05:26:48,971 INFO L297 olderBase$Statistics]: existing Event has 103 ancestors and is cut-off event [2023-11-29 05:26:48,972 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([848] L702-9-->L702-10: Formula: (= |v_t_funThread2of3ForFork0_#t~nondet6_3| |v_#race~global~0_7|) InVars {t_funThread2of3ForFork0_#t~nondet6=|v_t_funThread2of3ForFork0_#t~nondet6_3|} OutVars{t_funThread2of3ForFork0_#t~nondet6=|v_t_funThread2of3ForFork0_#t~nondet6_3|, #race~global~0=|v_#race~global~0_7|} AuxVars[] AssignedVars[#race~global~0][103], [38#L709-6true, 156#L702-10true, Black: 227#(= |ULTIMATE.start_main_~i~0#1| 0), 236#true, 28#L702-3true, 64#L702-16true, Black: 232#(= |#race~global~0| 0), t_funThread1of3ForFork0InUse, 230#true, t_funThread2of3ForFork0InUse, t_funThread3of3ForFork0InUse]) [2023-11-29 05:26:48,972 INFO L294 olderBase$Statistics]: this new event has 103 ancestors and is cut-off event [2023-11-29 05:26:48,972 INFO L297 olderBase$Statistics]: existing Event has 103 ancestors and is cut-off event [2023-11-29 05:26:48,972 INFO L297 olderBase$Statistics]: existing Event has 103 ancestors and is cut-off event [2023-11-29 05:26:48,973 INFO L297 olderBase$Statistics]: existing Event has 103 ancestors and is cut-off event [2023-11-29 05:26:49,333 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([931] L702-23-->L702-24: Formula: (= |v_#race~global~0_10| 0) InVars {} OutVars{#race~global~0=|v_#race~global~0_10|} AuxVars[] AssignedVars[#race~global~0][179], [38#L709-6true, 99#L702-6true, Black: 227#(= |ULTIMATE.start_main_~i~0#1| 0), 236#true, 28#L702-3true, 67#L702-24true, Black: 230#true, t_funThread1of3ForFork0InUse, t_funThread2of3ForFork0InUse, 232#(= |#race~global~0| 0), t_funThread3of3ForFork0InUse]) [2023-11-29 05:26:49,333 INFO L294 olderBase$Statistics]: this new event has 104 ancestors and is cut-off event [2023-11-29 05:26:49,333 INFO L297 olderBase$Statistics]: existing Event has 104 ancestors and is cut-off event [2023-11-29 05:26:49,333 INFO L297 olderBase$Statistics]: existing Event has 104 ancestors and is cut-off event [2023-11-29 05:26:49,333 INFO L297 olderBase$Statistics]: existing Event has 104 ancestors and is cut-off event [2023-11-29 05:26:49,335 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([882] L702-4-->L702-5: Formula: (= |v_#race~global~0_4| 0) InVars {} OutVars{#race~global~0=|v_#race~global~0_4|} AuxVars[] AssignedVars[#race~global~0][174], [38#L709-6true, 170#L702-22true, 99#L702-6true, Black: 227#(= |ULTIMATE.start_main_~i~0#1| 0), 236#true, Black: 230#true, t_funThread1of3ForFork0InUse, 118#L702-5true, t_funThread2of3ForFork0InUse, 232#(= |#race~global~0| 0), t_funThread3of3ForFork0InUse]) [2023-11-29 05:26:49,335 INFO L294 olderBase$Statistics]: this new event has 104 ancestors and is cut-off event [2023-11-29 05:26:49,335 INFO L297 olderBase$Statistics]: existing Event has 104 ancestors and is cut-off event [2023-11-29 05:26:49,335 INFO L297 olderBase$Statistics]: existing Event has 104 ancestors and is cut-off event [2023-11-29 05:26:49,335 INFO L297 olderBase$Statistics]: existing Event has 104 ancestors and is cut-off event [2023-11-29 05:26:50,439 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([848] L702-9-->L702-10: Formula: (= |v_t_funThread2of3ForFork0_#t~nondet6_3| |v_#race~global~0_7|) InVars {t_funThread2of3ForFork0_#t~nondet6=|v_t_funThread2of3ForFork0_#t~nondet6_3|} OutVars{t_funThread2of3ForFork0_#t~nondet6=|v_t_funThread2of3ForFork0_#t~nondet6_3|, #race~global~0=|v_#race~global~0_7|} AuxVars[] AssignedVars[#race~global~0][103], [38#L709-6true, 170#L702-22true, 156#L702-10true, Black: 227#(= |ULTIMATE.start_main_~i~0#1| 0), 236#true, 28#L702-3true, Black: 232#(= |#race~global~0| 0), t_funThread1of3ForFork0InUse, 230#true, t_funThread2of3ForFork0InUse, t_funThread3of3ForFork0InUse]) [2023-11-29 05:26:50,439 INFO L294 olderBase$Statistics]: this new event has 106 ancestors and is cut-off event [2023-11-29 05:26:50,439 INFO L297 olderBase$Statistics]: existing Event has 106 ancestors and is cut-off event [2023-11-29 05:26:50,439 INFO L297 olderBase$Statistics]: existing Event has 106 ancestors and is cut-off event [2023-11-29 05:26:50,439 INFO L297 olderBase$Statistics]: existing Event has 106 ancestors and is cut-off event [2023-11-29 05:27:22,692 INFO L124 PetriNetUnfolderBase]: 109071/321942 cut-off events. [2023-11-29 05:27:22,692 INFO L125 PetriNetUnfolderBase]: For 111238/117922 co-relation queries the response was YES. [2023-11-29 05:27:23,756 INFO L83 FinitePrefix]: Finished finitePrefix Result has 582149 conditions, 321942 events. 109071/321942 cut-off events. For 111238/117922 co-relation queries the response was YES. Maximal size of possible extension queue 6706. Compared 5117245 event pairs, 67369 based on Foata normal form. 930/291883 useless extension candidates. Maximal degree in co-relation 552732. Up to 128767 conditions per place. [2023-11-29 05:27:25,081 INFO L140 encePairwiseOnDemand]: 229/242 looper letters, 76 selfloop transitions, 22 changer transitions 0/276 dead transitions. [2023-11-29 05:27:25,082 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 227 places, 276 transitions, 989 flow [2023-11-29 05:27:25,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 05:27:25,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 05:27:25,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 593 transitions. [2023-11-29 05:27:25,084 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8168044077134986 [2023-11-29 05:27:25,084 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 593 transitions. [2023-11-29 05:27:25,084 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 593 transitions. [2023-11-29 05:27:25,085 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:27:25,085 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 593 transitions. [2023-11-29 05:27:25,087 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 197.66666666666666) internal successors, (593), 3 states have internal predecessors, (593), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:27:25,089 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 242.0) internal successors, (968), 4 states have internal predecessors, (968), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:27:25,090 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 242.0) internal successors, (968), 4 states have internal predecessors, (968), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:27:25,090 INFO L175 Difference]: Start difference. First operand has 225 places, 236 transitions, 641 flow. Second operand 3 states and 593 transitions. [2023-11-29 05:27:25,090 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 227 places, 276 transitions, 989 flow [2023-11-29 05:27:25,316 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 225 places, 276 transitions, 931 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 05:27:25,321 INFO L231 Difference]: Finished difference. Result has 227 places, 256 transitions, 807 flow [2023-11-29 05:27:25,321 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=242, PETRI_DIFFERENCE_MINUEND_FLOW=601, PETRI_DIFFERENCE_MINUEND_PLACES=223, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=236, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=214, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=807, PETRI_PLACES=227, PETRI_TRANSITIONS=256} [2023-11-29 05:27:25,322 INFO L281 CegarLoopForPetriNet]: 222 programPoint places, 5 predicate places. [2023-11-29 05:27:25,322 INFO L495 AbstractCegarLoop]: Abstraction has has 227 places, 256 transitions, 807 flow [2023-11-29 05:27:25,323 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 174.33333333333334) internal successors, (523), 3 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 05:27:25,323 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:27:25,323 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:27:25,323 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-29 05:27:25,323 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 16 more)] === [2023-11-29 05:27:25,324 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:27:25,324 INFO L85 PathProgramCache]: Analyzing trace with hash -154796670, now seen corresponding path program 1 times [2023-11-29 05:27:25,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:27:25,324 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1164994104] [2023-11-29 05:27:25,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:27:25,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:27:25,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:27:25,372 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-11-29 05:27:25,373 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:27:25,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1164994104] [2023-11-29 05:27:25,373 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1164994104] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:27:25,373 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:27:25,373 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 05:27:25,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [368490231] [2023-11-29 05:27:25,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:27:25,374 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 05:27:25,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:27:25,375 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 05:27:25,375 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 05:27:25,437 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 172 out of 242 [2023-11-29 05:27:25,438 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 227 places, 256 transitions, 807 flow. Second operand has 3 states, 3 states have (on average 174.66666666666666) internal successors, (524), 3 states have internal predecessors, (524), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:27:25,438 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:27:25,438 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 172 of 242 [2023-11-29 05:27:25,438 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:27:28,475 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([848] L702-9-->L702-10: Formula: (= |v_t_funThread2of3ForFork0_#t~nondet6_3| |v_#race~global~0_7|) InVars {t_funThread2of3ForFork0_#t~nondet6=|v_t_funThread2of3ForFork0_#t~nondet6_3|} OutVars{t_funThread2of3ForFork0_#t~nondet6=|v_t_funThread2of3ForFork0_#t~nondet6_3|, #race~global~0=|v_#race~global~0_7|} AuxVars[] AssignedVars[#race~global~0][186], [38#L709-6true, Black: 238#(= |t_funThread1of3ForFork0_#t~nondet6| |#race~global~0|), 106#L701-3true, 156#L702-10true, Black: 227#(= |ULTIMATE.start_main_~i~0#1| 0), 236#true, 244#(= |#race~global~0| |t_funThread2of3ForFork0_#t~nondet6|), 98#L702-11true, t_funThread1of3ForFork0InUse, Black: 232#(= |#race~global~0| 0), t_funThread2of3ForFork0InUse, t_funThread3of3ForFork0InUse]) [2023-11-29 05:27:28,475 INFO L294 olderBase$Statistics]: this new event has 97 ancestors and is cut-off event [2023-11-29 05:27:28,475 INFO L297 olderBase$Statistics]: existing Event has 97 ancestors and is cut-off event [2023-11-29 05:27:28,476 INFO L297 olderBase$Statistics]: existing Event has 97 ancestors and is cut-off event [2023-11-29 05:27:28,476 INFO L297 olderBase$Statistics]: existing Event has 97 ancestors and is cut-off event [2023-11-29 05:27:29,595 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([848] L702-9-->L702-10: Formula: (= |v_t_funThread2of3ForFork0_#t~nondet6_3| |v_#race~global~0_7|) InVars {t_funThread2of3ForFork0_#t~nondet6=|v_t_funThread2of3ForFork0_#t~nondet6_3|} OutVars{t_funThread2of3ForFork0_#t~nondet6=|v_t_funThread2of3ForFork0_#t~nondet6_3|, #race~global~0=|v_#race~global~0_7|} AuxVars[] AssignedVars[#race~global~0][186], [38#L709-6true, Black: 238#(= |t_funThread1of3ForFork0_#t~nondet6| |#race~global~0|), 156#L702-10true, Black: 227#(= |ULTIMATE.start_main_~i~0#1| 0), 236#true, 28#L702-3true, 244#(= |#race~global~0| |t_funThread2of3ForFork0_#t~nondet6|), 98#L702-11true, t_funThread1of3ForFork0InUse, Black: 232#(= |#race~global~0| 0), t_funThread2of3ForFork0InUse, t_funThread3of3ForFork0InUse]) [2023-11-29 05:27:29,595 INFO L294 olderBase$Statistics]: this new event has 100 ancestors and is cut-off event [2023-11-29 05:27:29,595 INFO L297 olderBase$Statistics]: existing Event has 100 ancestors and is cut-off event [2023-11-29 05:27:29,595 INFO L297 olderBase$Statistics]: existing Event has 100 ancestors and is cut-off event [2023-11-29 05:27:29,595 INFO L297 olderBase$Statistics]: existing Event has 100 ancestors and is cut-off event [2023-11-29 05:27:29,957 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([882] L702-4-->L702-5: Formula: (= |v_#race~global~0_4| 0) InVars {} OutVars{#race~global~0=|v_#race~global~0_4|} AuxVars[] AssignedVars[#race~global~0][245], [38#L709-6true, Black: 238#(= |t_funThread1of3ForFork0_#t~nondet6| |#race~global~0|), Black: 227#(= |ULTIMATE.start_main_~i~0#1| 0), 236#true, 242#true, Black: 230#true, 98#L702-11true, t_funThread1of3ForFork0InUse, 117#L702-9true, 118#L702-5true, t_funThread2of3ForFork0InUse, t_funThread3of3ForFork0InUse]) [2023-11-29 05:27:29,957 INFO L294 olderBase$Statistics]: this new event has 101 ancestors and is cut-off event [2023-11-29 05:27:29,957 INFO L297 olderBase$Statistics]: existing Event has 101 ancestors and is cut-off event [2023-11-29 05:27:29,957 INFO L297 olderBase$Statistics]: existing Event has 101 ancestors and is cut-off event [2023-11-29 05:27:29,957 INFO L297 olderBase$Statistics]: existing Event has 101 ancestors and is cut-off event [2023-11-29 05:27:36,161 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([895] L702-9-->L702-10: Formula: (= |v_t_funThread3of3ForFork0_#t~nondet6_3| |v_#race~global~0_7|) InVars {t_funThread3of3ForFork0_#t~nondet6=|v_t_funThread3of3ForFork0_#t~nondet6_3|} OutVars{t_funThread3of3ForFork0_#t~nondet6=|v_t_funThread3of3ForFork0_#t~nondet6_3|, #race~global~0=|v_#race~global~0_7|} AuxVars[] AssignedVars[#race~global~0][233], [Black: 238#(= |t_funThread1of3ForFork0_#t~nondet6| |#race~global~0|), Black: 227#(= |ULTIMATE.start_main_~i~0#1| 0), 236#true, 73#ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACEtrue, 128#L702-10true, 242#true, 98#L702-11true, Black: 232#(= |#race~global~0| 0), t_funThread1of3ForFork0InUse, t_funThread2of3ForFork0InUse, t_funThread3of3ForFork0InUse, 212#L702-22true]) [2023-11-29 05:27:36,161 INFO L294 olderBase$Statistics]: this new event has 114 ancestors and is cut-off event [2023-11-29 05:27:36,162 INFO L297 olderBase$Statistics]: existing Event has 114 ancestors and is cut-off event [2023-11-29 05:27:36,162 INFO L297 olderBase$Statistics]: existing Event has 114 ancestors and is cut-off event [2023-11-29 05:27:36,162 INFO L297 olderBase$Statistics]: existing Event has 114 ancestors and is cut-off event [2023-11-29 05:27:36,162 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([895] L702-9-->L702-10: Formula: (= |v_t_funThread3of3ForFork0_#t~nondet6_3| |v_#race~global~0_7|) InVars {t_funThread3of3ForFork0_#t~nondet6=|v_t_funThread3of3ForFork0_#t~nondet6_3|} OutVars{t_funThread3of3ForFork0_#t~nondet6=|v_t_funThread3of3ForFork0_#t~nondet6_3|, #race~global~0=|v_#race~global~0_7|} AuxVars[] AssignedVars[#race~global~0][233], [Black: 238#(= |t_funThread1of3ForFork0_#t~nondet6| |#race~global~0|), 177#L702-16true, Black: 227#(= |ULTIMATE.start_main_~i~0#1| 0), 236#true, 73#ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACEtrue, 242#true, 128#L702-10true, 98#L702-11true, t_funThread1of3ForFork0InUse, Black: 232#(= |#race~global~0| 0), t_funThread2of3ForFork0InUse, t_funThread3of3ForFork0InUse]) [2023-11-29 05:27:36,162 INFO L294 olderBase$Statistics]: this new event has 111 ancestors and is cut-off event [2023-11-29 05:27:36,162 INFO L297 olderBase$Statistics]: existing Event has 111 ancestors and is cut-off event [2023-11-29 05:27:36,162 INFO L297 olderBase$Statistics]: existing Event has 111 ancestors and is cut-off event [2023-11-29 05:27:36,162 INFO L297 olderBase$Statistics]: existing Event has 111 ancestors and is cut-off event [2023-11-29 05:27:36,166 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([837] L702-23-->L702-24: Formula: (= |v_#race~global~0_10| 0) InVars {} OutVars{#race~global~0=|v_#race~global~0_10|} AuxVars[] AssignedVars[#race~global~0][278], [Black: 238#(= |t_funThread1of3ForFork0_#t~nondet6| |#race~global~0|), 179#L702-6true, Black: 227#(= |ULTIMATE.start_main_~i~0#1| 0), 236#true, 73#ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACEtrue, 242#true, 98#L702-11true, Black: 230#true, 207#L702-24true, t_funThread1of3ForFork0InUse, t_funThread2of3ForFork0InUse, t_funThread3of3ForFork0InUse]) [2023-11-29 05:27:36,166 INFO L294 olderBase$Statistics]: this new event has 112 ancestors and is cut-off event [2023-11-29 05:27:36,166 INFO L297 olderBase$Statistics]: existing Event has 112 ancestors and is cut-off event [2023-11-29 05:27:36,166 INFO L297 olderBase$Statistics]: existing Event has 112 ancestors and is cut-off event [2023-11-29 05:27:36,166 INFO L297 olderBase$Statistics]: existing Event has 112 ancestors and is cut-off event [2023-11-29 05:27:36,169 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([837] L702-23-->L702-24: Formula: (= |v_#race~global~0_10| 0) InVars {} OutVars{#race~global~0=|v_#race~global~0_10|} AuxVars[] AssignedVars[#race~global~0][278], [38#L709-6true, Black: 238#(= |t_funThread1of3ForFork0_#t~nondet6| |#race~global~0|), Black: 227#(= |ULTIMATE.start_main_~i~0#1| 0), 236#true, 242#true, Black: 230#true, 98#L702-11true, 207#L702-24true, t_funThread1of3ForFork0InUse, 215#t_funErr0ASSERT_VIOLATIONDATA_RACEtrue, t_funThread2of3ForFork0InUse, t_funThread3of3ForFork0InUse]) [2023-11-29 05:27:36,169 INFO L294 olderBase$Statistics]: this new event has 112 ancestors and is cut-off event [2023-11-29 05:27:36,169 INFO L297 olderBase$Statistics]: existing Event has 112 ancestors and is cut-off event [2023-11-29 05:27:36,169 INFO L297 olderBase$Statistics]: existing Event has 112 ancestors and is cut-off event [2023-11-29 05:27:36,169 INFO L297 olderBase$Statistics]: existing Event has 112 ancestors and is cut-off event [2023-11-29 05:27:38,268 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([837] L702-23-->L702-24: Formula: (= |v_#race~global~0_10| 0) InVars {} OutVars{#race~global~0=|v_#race~global~0_10|} AuxVars[] AssignedVars[#race~global~0][208], [38#L709-6true, Black: 238#(= |t_funThread1of3ForFork0_#t~nondet6| |#race~global~0|), Black: 227#(= |ULTIMATE.start_main_~i~0#1| 0), 236#true, 242#true, Black: 230#true, 207#L702-24true, t_funThread1of3ForFork0InUse, 159#t_funErr1ASSERT_VIOLATIONDATA_RACEtrue, 215#t_funErr0ASSERT_VIOLATIONDATA_RACEtrue, t_funThread2of3ForFork0InUse, t_funThread3of3ForFork0InUse]) [2023-11-29 05:27:38,268 INFO L294 olderBase$Statistics]: this new event has 112 ancestors and is cut-off event [2023-11-29 05:27:38,268 INFO L297 olderBase$Statistics]: existing Event has 112 ancestors and is cut-off event [2023-11-29 05:27:38,268 INFO L297 olderBase$Statistics]: existing Event has 112 ancestors and is cut-off event [2023-11-29 05:27:38,268 INFO L297 olderBase$Statistics]: existing Event has 112 ancestors and is cut-off event [2023-11-29 05:27:38,341 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([895] L702-9-->L702-10: Formula: (= |v_t_funThread3of3ForFork0_#t~nondet6_3| |v_#race~global~0_7|) InVars {t_funThread3of3ForFork0_#t~nondet6=|v_t_funThread3of3ForFork0_#t~nondet6_3|} OutVars{t_funThread3of3ForFork0_#t~nondet6=|v_t_funThread3of3ForFork0_#t~nondet6_3|, #race~global~0=|v_#race~global~0_7|} AuxVars[] AssignedVars[#race~global~0][169], [177#L702-16true, Black: 238#(= |t_funThread1of3ForFork0_#t~nondet6| |#race~global~0|), Black: 227#(= |ULTIMATE.start_main_~i~0#1| 0), 236#true, 73#ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACEtrue, 128#L702-10true, 242#true, t_funThread1of3ForFork0InUse, Black: 232#(= |#race~global~0| 0), 159#t_funErr1ASSERT_VIOLATIONDATA_RACEtrue, t_funThread2of3ForFork0InUse, t_funThread3of3ForFork0InUse]) [2023-11-29 05:27:38,341 INFO L294 olderBase$Statistics]: this new event has 111 ancestors and is not cut-off event [2023-11-29 05:27:38,341 INFO L297 olderBase$Statistics]: existing Event has 111 ancestors and is not cut-off event [2023-11-29 05:27:38,341 INFO L297 olderBase$Statistics]: existing Event has 111 ancestors and is not cut-off event [2023-11-29 05:27:38,341 INFO L297 olderBase$Statistics]: existing Event has 111 ancestors and is not cut-off event [2023-11-29 05:27:39,025 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([837] L702-23-->L702-24: Formula: (= |v_#race~global~0_10| 0) InVars {} OutVars{#race~global~0=|v_#race~global~0_10|} AuxVars[] AssignedVars[#race~global~0][230], [Black: 238#(= |t_funThread1of3ForFork0_#t~nondet6| |#race~global~0|), Black: 227#(= |ULTIMATE.start_main_~i~0#1| 0), 236#true, 73#ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACEtrue, 242#true, 98#L702-11true, Black: 230#true, 207#L702-24true, t_funThread1of3ForFork0InUse, 215#t_funErr0ASSERT_VIOLATIONDATA_RACEtrue, t_funThread2of3ForFork0InUse, t_funThread3of3ForFork0InUse]) [2023-11-29 05:27:39,026 INFO L294 olderBase$Statistics]: this new event has 112 ancestors and is not cut-off event [2023-11-29 05:27:39,026 INFO L297 olderBase$Statistics]: existing Event has 112 ancestors and is not cut-off event [2023-11-29 05:27:39,026 INFO L297 olderBase$Statistics]: existing Event has 112 ancestors and is not cut-off event [2023-11-29 05:27:39,026 INFO L297 olderBase$Statistics]: existing Event has 112 ancestors and is not cut-off event [2023-11-29 05:27:39,042 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([837] L702-23-->L702-24: Formula: (= |v_#race~global~0_10| 0) InVars {} OutVars{#race~global~0=|v_#race~global~0_10|} AuxVars[] AssignedVars[#race~global~0][208], [Black: 238#(= |t_funThread1of3ForFork0_#t~nondet6| |#race~global~0|), 179#L702-6true, Black: 227#(= |ULTIMATE.start_main_~i~0#1| 0), 236#true, 73#ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACEtrue, 242#true, Black: 230#true, 207#L702-24true, t_funThread1of3ForFork0InUse, 159#t_funErr1ASSERT_VIOLATIONDATA_RACEtrue, t_funThread2of3ForFork0InUse, t_funThread3of3ForFork0InUse]) [2023-11-29 05:27:39,042 INFO L294 olderBase$Statistics]: this new event has 112 ancestors and is not cut-off event [2023-11-29 05:27:39,042 INFO L297 olderBase$Statistics]: existing Event has 112 ancestors and is not cut-off event [2023-11-29 05:27:39,042 INFO L297 olderBase$Statistics]: existing Event has 112 ancestors and is not cut-off event [2023-11-29 05:27:39,042 INFO L297 olderBase$Statistics]: existing Event has 112 ancestors and is not cut-off event [2023-11-29 05:27:40,168 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([895] L702-9-->L702-10: Formula: (= |v_t_funThread3of3ForFork0_#t~nondet6_3| |v_#race~global~0_7|) InVars {t_funThread3of3ForFork0_#t~nondet6=|v_t_funThread3of3ForFork0_#t~nondet6_3|} OutVars{t_funThread3of3ForFork0_#t~nondet6=|v_t_funThread3of3ForFork0_#t~nondet6_3|, #race~global~0=|v_#race~global~0_7|} AuxVars[] AssignedVars[#race~global~0][169], [Black: 238#(= |t_funThread1of3ForFork0_#t~nondet6| |#race~global~0|), Black: 227#(= |ULTIMATE.start_main_~i~0#1| 0), 236#true, 73#ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACEtrue, 242#true, 128#L702-10true, t_funThread1of3ForFork0InUse, Black: 232#(= |#race~global~0| 0), 159#t_funErr1ASSERT_VIOLATIONDATA_RACEtrue, t_funThread2of3ForFork0InUse, t_funThread3of3ForFork0InUse, 212#L702-22true]) [2023-11-29 05:27:40,168 INFO L294 olderBase$Statistics]: this new event has 114 ancestors and is cut-off event [2023-11-29 05:27:40,168 INFO L297 olderBase$Statistics]: existing Event has 114 ancestors and is cut-off event [2023-11-29 05:27:40,168 INFO L297 olderBase$Statistics]: existing Event has 114 ancestors and is cut-off event [2023-11-29 05:27:40,168 INFO L297 olderBase$Statistics]: existing Event has 114 ancestors and is cut-off event [2023-11-29 05:27:49,477 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([896] L702-28-->L702-29: Formula: (= |v_#race~global~0_13| |v_t_funThread3of3ForFork0_#t~nondet10_3|) InVars {t_funThread3of3ForFork0_#t~nondet10=|v_t_funThread3of3ForFork0_#t~nondet10_3|} OutVars{t_funThread3of3ForFork0_#t~nondet10=|v_t_funThread3of3ForFork0_#t~nondet10_3|, #race~global~0=|v_#race~global~0_13|} AuxVars[] AssignedVars[#race~global~0][284], [177#L702-16true, Black: 238#(= |t_funThread1of3ForFork0_#t~nondet6| |#race~global~0|), Black: 227#(= |ULTIMATE.start_main_~i~0#1| 0), 193#L702-29true, 236#true, 73#ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACEtrue, 242#true, 98#L702-11true, t_funThread1of3ForFork0InUse, Black: 232#(= |#race~global~0| 0), t_funThread2of3ForFork0InUse, t_funThread3of3ForFork0InUse]) [2023-11-29 05:27:49,477 INFO L294 olderBase$Statistics]: this new event has 125 ancestors and is cut-off event [2023-11-29 05:27:49,477 INFO L297 olderBase$Statistics]: existing Event has 125 ancestors and is cut-off event [2023-11-29 05:27:49,477 INFO L297 olderBase$Statistics]: existing Event has 125 ancestors and is cut-off event [2023-11-29 05:27:49,477 INFO L297 olderBase$Statistics]: existing Event has 125 ancestors and is cut-off event [2023-11-29 05:27:49,486 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([837] L702-23-->L702-24: Formula: (= |v_#race~global~0_10| 0) InVars {} OutVars{#race~global~0=|v_#race~global~0_10|} AuxVars[] AssignedVars[#race~global~0][278], [38#L709-6true, Black: 238#(= |t_funThread1of3ForFork0_#t~nondet6| |#race~global~0|), 154#t_funErr2ASSERT_VIOLATIONDATA_RACEtrue, Black: 227#(= |ULTIMATE.start_main_~i~0#1| 0), 236#true, 242#true, 98#L702-11true, Black: 230#true, 207#L702-24true, t_funThread1of3ForFork0InUse, t_funThread2of3ForFork0InUse, t_funThread3of3ForFork0InUse]) [2023-11-29 05:27:49,486 INFO L294 olderBase$Statistics]: this new event has 126 ancestors and is cut-off event [2023-11-29 05:27:49,486 INFO L297 olderBase$Statistics]: existing Event has 126 ancestors and is cut-off event [2023-11-29 05:27:49,487 INFO L297 olderBase$Statistics]: existing Event has 126 ancestors and is cut-off event [2023-11-29 05:27:49,487 INFO L297 olderBase$Statistics]: existing Event has 126 ancestors and is cut-off event [2023-11-29 05:27:49,494 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([837] L702-23-->L702-24: Formula: (= |v_#race~global~0_10| 0) InVars {} OutVars{#race~global~0=|v_#race~global~0_10|} AuxVars[] AssignedVars[#race~global~0][278], [Black: 238#(= |t_funThread1of3ForFork0_#t~nondet6| |#race~global~0|), Black: 227#(= |ULTIMATE.start_main_~i~0#1| 0), 236#true, 73#ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACEtrue, 102#L702-25true, 242#true, 98#L702-11true, Black: 230#true, 207#L702-24true, t_funThread1of3ForFork0InUse, t_funThread2of3ForFork0InUse, t_funThread3of3ForFork0InUse]) [2023-11-29 05:27:49,494 INFO L294 olderBase$Statistics]: this new event has 126 ancestors and is cut-off event [2023-11-29 05:27:49,494 INFO L297 olderBase$Statistics]: existing Event has 126 ancestors and is cut-off event [2023-11-29 05:27:49,494 INFO L297 olderBase$Statistics]: existing Event has 126 ancestors and is cut-off event [2023-11-29 05:27:49,494 INFO L297 olderBase$Statistics]: existing Event has 126 ancestors and is cut-off event [2023-11-29 05:27:51,912 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([837] L702-23-->L702-24: Formula: (= |v_#race~global~0_10| 0) InVars {} OutVars{#race~global~0=|v_#race~global~0_10|} AuxVars[] AssignedVars[#race~global~0][208], [38#L709-6true, Black: 238#(= |t_funThread1of3ForFork0_#t~nondet6| |#race~global~0|), 154#t_funErr2ASSERT_VIOLATIONDATA_RACEtrue, Black: 227#(= |ULTIMATE.start_main_~i~0#1| 0), 236#true, 242#true, 207#L702-24true, Black: 230#true, t_funThread1of3ForFork0InUse, 159#t_funErr1ASSERT_VIOLATIONDATA_RACEtrue, t_funThread2of3ForFork0InUse, t_funThread3of3ForFork0InUse]) [2023-11-29 05:27:51,913 INFO L294 olderBase$Statistics]: this new event has 126 ancestors and is not cut-off event [2023-11-29 05:27:51,913 INFO L297 olderBase$Statistics]: existing Event has 126 ancestors and is not cut-off event [2023-11-29 05:27:51,913 INFO L297 olderBase$Statistics]: existing Event has 126 ancestors and is not cut-off event [2023-11-29 05:27:51,913 INFO L297 olderBase$Statistics]: existing Event has 126 ancestors and is not cut-off event [2023-11-29 05:27:52,049 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([896] L702-28-->L702-29: Formula: (= |v_#race~global~0_13| |v_t_funThread3of3ForFork0_#t~nondet10_3|) InVars {t_funThread3of3ForFork0_#t~nondet10=|v_t_funThread3of3ForFork0_#t~nondet10_3|} OutVars{t_funThread3of3ForFork0_#t~nondet10=|v_t_funThread3of3ForFork0_#t~nondet10_3|, #race~global~0=|v_#race~global~0_13|} AuxVars[] AssignedVars[#race~global~0][284], [Black: 238#(= |t_funThread1of3ForFork0_#t~nondet6| |#race~global~0|), 193#L702-29true, Black: 227#(= |ULTIMATE.start_main_~i~0#1| 0), 236#true, 73#ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACEtrue, 242#true, 98#L702-11true, t_funThread1of3ForFork0InUse, Black: 232#(= |#race~global~0| 0), t_funThread2of3ForFork0InUse, t_funThread3of3ForFork0InUse, 212#L702-22true]) [2023-11-29 05:27:52,050 INFO L294 olderBase$Statistics]: this new event has 128 ancestors and is cut-off event [2023-11-29 05:27:52,050 INFO L297 olderBase$Statistics]: existing Event has 128 ancestors and is cut-off event [2023-11-29 05:27:52,050 INFO L297 olderBase$Statistics]: existing Event has 128 ancestors and is cut-off event [2023-11-29 05:27:52,050 INFO L297 olderBase$Statistics]: existing Event has 128 ancestors and is cut-off event