./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-data-race.prp --file ../../sv-benchmarks/c/pthread-race-challenges/thread-join-counter-outer-race-3.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 0e0057cc Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93a8f88d-684c-4c00-8a0f-548996e42739/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93a8f88d-684c-4c00-8a0f-548996e42739/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_93a8f88d-684c-4c00-8a0f-548996e42739/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93a8f88d-684c-4c00-8a0f-548996e42739/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-race-challenges/thread-join-counter-outer-race-3.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93a8f88d-684c-4c00-8a0f-548996e42739/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_93a8f88d-684c-4c00-8a0f-548996e42739/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 a77d68c8e15036e88d70009e5342d88dd2f93f021b72148028da08073ac36a38 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-29 00:01:34,995 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-29 00:01:35,059 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93a8f88d-684c-4c00-8a0f-548996e42739/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-DataRace-32bit-Automizer_Default.epf [2023-11-29 00:01:35,065 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-29 00:01:35,066 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-29 00:01:35,090 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-29 00:01:35,091 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-29 00:01:35,092 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-29 00:01:35,092 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-29 00:01:35,093 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-29 00:01:35,094 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-29 00:01:35,094 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-29 00:01:35,095 INFO L153 SettingsManager]: * Use SBE=true [2023-11-29 00:01:35,095 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-29 00:01:35,096 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-29 00:01:35,096 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-29 00:01:35,097 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-29 00:01:35,097 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-29 00:01:35,098 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-29 00:01:35,098 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-29 00:01:35,099 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-29 00:01:35,099 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-29 00:01:35,100 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2023-11-29 00:01:35,100 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-29 00:01:35,101 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-29 00:01:35,101 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-29 00:01:35,102 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-29 00:01:35,102 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-29 00:01:35,103 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-29 00:01:35,103 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-29 00:01:35,104 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 00:01:35,104 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-29 00:01:35,104 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-29 00:01:35,104 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-29 00:01:35,105 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-29 00:01:35,105 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-29 00:01:35,105 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-29 00:01:35,105 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-29 00:01:35,105 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-29 00:01:35,106 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-29 00:01:35,106 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-29 00:01:35,106 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_93a8f88d-684c-4c00-8a0f-548996e42739/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_93a8f88d-684c-4c00-8a0f-548996e42739/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 -> a77d68c8e15036e88d70009e5342d88dd2f93f021b72148028da08073ac36a38 [2023-11-29 00:01:35,316 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-29 00:01:35,338 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-29 00:01:35,341 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-29 00:01:35,342 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-29 00:01:35,342 INFO L274 PluginConnector]: CDTParser initialized [2023-11-29 00:01:35,344 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93a8f88d-684c-4c00-8a0f-548996e42739/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/pthread-race-challenges/thread-join-counter-outer-race-3.i [2023-11-29 00:01:38,111 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-29 00:01:38,364 INFO L384 CDTParser]: Found 1 translation units. [2023-11-29 00:01:38,364 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93a8f88d-684c-4c00-8a0f-548996e42739/sv-benchmarks/c/pthread-race-challenges/thread-join-counter-outer-race-3.i [2023-11-29 00:01:38,380 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93a8f88d-684c-4c00-8a0f-548996e42739/bin/uautomizer-verify-BQ2R08f2Ya/data/c9e9fe147/1eeb056c33ff447081eace9dd24adb36/FLAG2d18282da [2023-11-29 00:01:38,394 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93a8f88d-684c-4c00-8a0f-548996e42739/bin/uautomizer-verify-BQ2R08f2Ya/data/c9e9fe147/1eeb056c33ff447081eace9dd24adb36 [2023-11-29 00:01:38,397 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-29 00:01:38,398 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-29 00:01:38,400 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-29 00:01:38,400 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-29 00:01:38,405 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-29 00:01:38,406 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 12:01:38" (1/1) ... [2023-11-29 00:01:38,407 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3430dca1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:01:38, skipping insertion in model container [2023-11-29 00:01:38,407 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 12:01:38" (1/1) ... [2023-11-29 00:01:38,450 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 00:01:38,743 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 00:01:38,759 INFO L202 MainTranslator]: Completed pre-run [2023-11-29 00:01:38,798 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 00:01:38,833 WARN L675 CHandler]: The function pthread_detach is called, but not defined or handled by StandardFunctionHandler. [2023-11-29 00:01:38,841 INFO L206 MainTranslator]: Completed translation [2023-11-29 00:01:38,841 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:01:38 WrapperNode [2023-11-29 00:01:38,841 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-29 00:01:38,842 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-29 00:01:38,842 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-29 00:01:38,843 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-29 00:01:38,850 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:01:38" (1/1) ... [2023-11-29 00:01:38,864 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:01:38" (1/1) ... [2023-11-29 00:01:38,888 INFO L138 Inliner]: procedures = 160, calls = 42, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 105 [2023-11-29 00:01:38,889 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-29 00:01:38,889 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-29 00:01:38,890 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-29 00:01:38,890 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-29 00:01:38,899 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:01:38" (1/1) ... [2023-11-29 00:01:38,899 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:01:38" (1/1) ... [2023-11-29 00:01:38,903 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:01:38" (1/1) ... [2023-11-29 00:01:38,903 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:01:38" (1/1) ... [2023-11-29 00:01:38,911 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:01:38" (1/1) ... [2023-11-29 00:01:38,914 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:01:38" (1/1) ... [2023-11-29 00:01:38,916 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:01:38" (1/1) ... [2023-11-29 00:01:38,918 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:01:38" (1/1) ... [2023-11-29 00:01:38,921 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-29 00:01:38,922 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-29 00:01:38,922 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-29 00:01:38,922 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-29 00:01:38,923 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:01:38" (1/1) ... [2023-11-29 00:01:38,929 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 00:01:38,940 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93a8f88d-684c-4c00-8a0f-548996e42739/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 00:01:38,952 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93a8f88d-684c-4c00-8a0f-548996e42739/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-29 00:01:38,958 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93a8f88d-684c-4c00-8a0f-548996e42739/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-29 00:01:38,993 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-29 00:01:38,993 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-29 00:01:38,993 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2023-11-29 00:01:38,993 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-29 00:01:38,993 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-29 00:01:38,994 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-29 00:01:38,994 INFO L130 BoogieDeclarations]: Found specification of procedure pthread_detach [2023-11-29 00:01:38,994 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-29 00:01:38,994 INFO L130 BoogieDeclarations]: Found specification of procedure thread [2023-11-29 00:01:38,994 INFO L138 BoogieDeclarations]: Found implementation of procedure thread [2023-11-29 00:01:38,994 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2023-11-29 00:01:38,995 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-29 00:01:38,995 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-29 00:01:38,996 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-29 00:01:39,116 INFO L241 CfgBuilder]: Building ICFG [2023-11-29 00:01:39,118 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-29 00:01:39,330 INFO L282 CfgBuilder]: Performing block encoding [2023-11-29 00:01:39,363 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-29 00:01:39,363 INFO L309 CfgBuilder]: Removed 2 assume(true) statements. [2023-11-29 00:01:39,365 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 12:01:39 BoogieIcfgContainer [2023-11-29 00:01:39,365 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-29 00:01:39,368 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-29 00:01:39,368 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-29 00:01:39,371 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-29 00:01:39,372 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.11 12:01:38" (1/3) ... [2023-11-29 00:01:39,372 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@716552ee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 12:01:39, skipping insertion in model container [2023-11-29 00:01:39,372 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:01:38" (2/3) ... [2023-11-29 00:01:39,373 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@716552ee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 12:01:39, skipping insertion in model container [2023-11-29 00:01:39,373 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 12:01:39" (3/3) ... [2023-11-29 00:01:39,374 INFO L112 eAbstractionObserver]: Analyzing ICFG thread-join-counter-outer-race-3.i [2023-11-29 00:01:39,380 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-11-29 00:01:39,390 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-29 00:01:39,390 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 8 error locations. [2023-11-29 00:01:39,390 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-29 00:01:39,439 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-29 00:01:39,474 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 139 places, 140 transitions, 284 flow [2023-11-29 00:01:39,560 INFO L124 PetriNetUnfolderBase]: 7/184 cut-off events. [2023-11-29 00:01:39,560 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-29 00:01:39,565 INFO L83 FinitePrefix]: Finished finitePrefix Result has 188 conditions, 184 events. 7/184 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 261 event pairs, 0 based on Foata normal form. 0/163 useless extension candidates. Maximal degree in co-relation 93. Up to 4 conditions per place. [2023-11-29 00:01:39,566 INFO L82 GeneralOperation]: Start removeDead. Operand has 139 places, 140 transitions, 284 flow [2023-11-29 00:01:39,572 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 139 places, 140 transitions, 284 flow [2023-11-29 00:01:39,582 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-29 00:01:39,590 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;@f811091, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-29 00:01:39,590 INFO L358 AbstractCegarLoop]: Starting to check reachability of 12 error locations. [2023-11-29 00:01:39,606 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-29 00:01:39,606 INFO L124 PetriNetUnfolderBase]: 2/54 cut-off events. [2023-11-29 00:01:39,606 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-29 00:01:39,606 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 00:01:39,607 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] [2023-11-29 00:01:39,608 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 9 more)] === [2023-11-29 00:01:39,613 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:01:39,613 INFO L85 PathProgramCache]: Analyzing trace with hash -1778244919, now seen corresponding path program 1 times [2023-11-29 00:01:39,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:01:39,624 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [483489503] [2023-11-29 00:01:39,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:01:39,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:01:39,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:01:39,878 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:01:39,878 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:01:39,878 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [483489503] [2023-11-29 00:01:39,879 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [483489503] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:01:39,880 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:01:39,880 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 00:01:39,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [787592308] [2023-11-29 00:01:39,883 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:01:39,892 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 00:01:39,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:01:39,916 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 00:01:39,917 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 00:01:39,946 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 140 [2023-11-29 00:01:39,950 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 139 places, 140 transitions, 284 flow. Second operand has 3 states, 3 states have (on average 116.0) internal successors, (348), 3 states have internal predecessors, (348), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:01:39,950 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 00:01:39,950 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 140 [2023-11-29 00:01:39,951 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 00:01:40,142 INFO L124 PetriNetUnfolderBase]: 98/626 cut-off events. [2023-11-29 00:01:40,142 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2023-11-29 00:01:40,145 INFO L83 FinitePrefix]: Finished finitePrefix Result has 860 conditions, 626 events. 98/626 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 3503 event pairs, 33 based on Foata normal form. 6/567 useless extension candidates. Maximal degree in co-relation 753. Up to 138 conditions per place. [2023-11-29 00:01:40,149 INFO L140 encePairwiseOnDemand]: 126/140 looper letters, 32 selfloop transitions, 8 changer transitions 1/155 dead transitions. [2023-11-29 00:01:40,149 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 141 places, 155 transitions, 394 flow [2023-11-29 00:01:40,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 00:01:40,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 00:01:40,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 393 transitions. [2023-11-29 00:01:40,162 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9357142857142857 [2023-11-29 00:01:40,163 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 393 transitions. [2023-11-29 00:01:40,164 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 393 transitions. [2023-11-29 00:01:40,166 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 00:01:40,168 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 393 transitions. [2023-11-29 00:01:40,172 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 131.0) internal successors, (393), 3 states have internal predecessors, (393), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:01:40,177 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 140.0) internal successors, (560), 4 states have internal predecessors, (560), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:01:40,178 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 140.0) internal successors, (560), 4 states have internal predecessors, (560), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:01:40,180 INFO L175 Difference]: Start difference. First operand has 139 places, 140 transitions, 284 flow. Second operand 3 states and 393 transitions. [2023-11-29 00:01:40,181 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 141 places, 155 transitions, 394 flow [2023-11-29 00:01:40,184 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 141 places, 155 transitions, 394 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-29 00:01:40,188 INFO L231 Difference]: Finished difference. Result has 143 places, 144 transitions, 346 flow [2023-11-29 00:01:40,190 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=140, PETRI_DIFFERENCE_MINUEND_FLOW=278, PETRI_DIFFERENCE_MINUEND_PLACES=139, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=137, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=129, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=346, PETRI_PLACES=143, PETRI_TRANSITIONS=144} [2023-11-29 00:01:40,194 INFO L281 CegarLoopForPetriNet]: 139 programPoint places, 4 predicate places. [2023-11-29 00:01:40,194 INFO L495 AbstractCegarLoop]: Abstraction has has 143 places, 144 transitions, 346 flow [2023-11-29 00:01:40,195 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 116.0) internal successors, (348), 3 states have internal predecessors, (348), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:01:40,195 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 00:01:40,195 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:01:40,195 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-29 00:01:40,195 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 9 more)] === [2023-11-29 00:01:40,196 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:01:40,196 INFO L85 PathProgramCache]: Analyzing trace with hash 1258247059, now seen corresponding path program 1 times [2023-11-29 00:01:40,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:01:40,196 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [346083828] [2023-11-29 00:01:40,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:01:40,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:01:40,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:01:40,284 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:01:40,284 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:01:40,285 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [346083828] [2023-11-29 00:01:40,285 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [346083828] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:01:40,285 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:01:40,285 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 00:01:40,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [272295008] [2023-11-29 00:01:40,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:01:40,287 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 00:01:40,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:01:40,288 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 00:01:40,288 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 00:01:40,322 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 140 [2023-11-29 00:01:40,323 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 143 places, 144 transitions, 346 flow. Second operand has 3 states, 3 states have (on average 117.0) internal successors, (351), 3 states have internal predecessors, (351), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:01:40,323 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 00:01:40,323 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 140 [2023-11-29 00:01:40,323 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 00:01:40,512 INFO L124 PetriNetUnfolderBase]: 114/757 cut-off events. [2023-11-29 00:01:40,513 INFO L125 PetriNetUnfolderBase]: For 168/173 co-relation queries the response was YES. [2023-11-29 00:01:40,516 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1193 conditions, 757 events. 114/757 cut-off events. For 168/173 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 4579 event pairs, 72 based on Foata normal form. 4/698 useless extension candidates. Maximal degree in co-relation 1074. Up to 226 conditions per place. [2023-11-29 00:01:40,519 INFO L140 encePairwiseOnDemand]: 134/140 looper letters, 29 selfloop transitions, 7 changer transitions 0/153 dead transitions. [2023-11-29 00:01:40,520 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 144 places, 153 transitions, 446 flow [2023-11-29 00:01:40,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 00:01:40,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 00:01:40,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 376 transitions. [2023-11-29 00:01:40,523 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8952380952380953 [2023-11-29 00:01:40,523 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 376 transitions. [2023-11-29 00:01:40,523 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 376 transitions. [2023-11-29 00:01:40,523 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 00:01:40,524 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 376 transitions. [2023-11-29 00:01:40,525 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 125.33333333333333) internal successors, (376), 3 states have internal predecessors, (376), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:01:40,527 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 140.0) internal successors, (560), 4 states have internal predecessors, (560), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:01:40,528 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 140.0) internal successors, (560), 4 states have internal predecessors, (560), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:01:40,528 INFO L175 Difference]: Start difference. First operand has 143 places, 144 transitions, 346 flow. Second operand 3 states and 376 transitions. [2023-11-29 00:01:40,528 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 144 places, 153 transitions, 446 flow [2023-11-29 00:01:40,532 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 142 places, 153 transitions, 426 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 00:01:40,535 INFO L231 Difference]: Finished difference. Result has 144 places, 149 transitions, 386 flow [2023-11-29 00:01:40,535 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=140, PETRI_DIFFERENCE_MINUEND_FLOW=330, PETRI_DIFFERENCE_MINUEND_PLACES=140, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=144, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=137, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=386, PETRI_PLACES=144, PETRI_TRANSITIONS=149} [2023-11-29 00:01:40,536 INFO L281 CegarLoopForPetriNet]: 139 programPoint places, 5 predicate places. [2023-11-29 00:01:40,536 INFO L495 AbstractCegarLoop]: Abstraction has has 144 places, 149 transitions, 386 flow [2023-11-29 00:01:40,537 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 117.0) internal successors, (351), 3 states have internal predecessors, (351), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:01:40,537 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 00:01:40,537 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:01:40,537 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-29 00:01:40,538 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 9 more)] === [2023-11-29 00:01:40,538 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:01:40,538 INFO L85 PathProgramCache]: Analyzing trace with hash -776479161, now seen corresponding path program 1 times [2023-11-29 00:01:40,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:01:40,539 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [134027702] [2023-11-29 00:01:40,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:01:40,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:01:40,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:01:40,651 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:01:40,651 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:01:40,652 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [134027702] [2023-11-29 00:01:40,652 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [134027702] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:01:40,652 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:01:40,652 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 00:01:40,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [938562825] [2023-11-29 00:01:40,653 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:01:40,653 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 00:01:40,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:01:40,654 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 00:01:40,654 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 00:01:40,665 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 122 out of 140 [2023-11-29 00:01:40,666 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 144 places, 149 transitions, 386 flow. Second operand has 3 states, 3 states have (on average 123.33333333333333) internal successors, (370), 3 states have internal predecessors, (370), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:01:40,666 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 00:01:40,666 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 140 [2023-11-29 00:01:40,666 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 00:01:40,796 INFO L124 PetriNetUnfolderBase]: 94/682 cut-off events. [2023-11-29 00:01:40,796 INFO L125 PetriNetUnfolderBase]: For 70/74 co-relation queries the response was YES. [2023-11-29 00:01:40,798 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1013 conditions, 682 events. 94/682 cut-off events. For 70/74 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 4014 event pairs, 56 based on Foata normal form. 3/626 useless extension candidates. Maximal degree in co-relation 909. Up to 144 conditions per place. [2023-11-29 00:01:40,801 INFO L140 encePairwiseOnDemand]: 137/140 looper letters, 15 selfloop transitions, 2 changer transitions 3/154 dead transitions. [2023-11-29 00:01:40,802 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 146 places, 154 transitions, 436 flow [2023-11-29 00:01:40,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 00:01:40,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 00:01:40,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 387 transitions. [2023-11-29 00:01:40,804 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9214285714285714 [2023-11-29 00:01:40,804 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 387 transitions. [2023-11-29 00:01:40,804 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 387 transitions. [2023-11-29 00:01:40,804 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 00:01:40,805 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 387 transitions. [2023-11-29 00:01:40,806 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 129.0) internal successors, (387), 3 states have internal predecessors, (387), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:01:40,807 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 140.0) internal successors, (560), 4 states have internal predecessors, (560), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:01:40,808 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 140.0) internal successors, (560), 4 states have internal predecessors, (560), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:01:40,808 INFO L175 Difference]: Start difference. First operand has 144 places, 149 transitions, 386 flow. Second operand 3 states and 387 transitions. [2023-11-29 00:01:40,808 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 146 places, 154 transitions, 436 flow [2023-11-29 00:01:40,812 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 144 places, 154 transitions, 422 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 00:01:40,815 INFO L231 Difference]: Finished difference. Result has 145 places, 150 transitions, 384 flow [2023-11-29 00:01:40,815 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=140, PETRI_DIFFERENCE_MINUEND_FLOW=372, PETRI_DIFFERENCE_MINUEND_PLACES=142, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=149, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=147, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=384, PETRI_PLACES=145, PETRI_TRANSITIONS=150} [2023-11-29 00:01:40,816 INFO L281 CegarLoopForPetriNet]: 139 programPoint places, 6 predicate places. [2023-11-29 00:01:40,816 INFO L495 AbstractCegarLoop]: Abstraction has has 145 places, 150 transitions, 384 flow [2023-11-29 00:01:40,816 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 123.33333333333333) internal successors, (370), 3 states have internal predecessors, (370), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:01:40,817 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 00:01:40,817 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:01:40,817 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-29 00:01:40,817 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 9 more)] === [2023-11-29 00:01:40,818 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:01:40,818 INFO L85 PathProgramCache]: Analyzing trace with hash -538905304, now seen corresponding path program 1 times [2023-11-29 00:01:40,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:01:40,818 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [32381475] [2023-11-29 00:01:40,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:01:40,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:01:40,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:01:41,297 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:01:41,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:01:41,298 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [32381475] [2023-11-29 00:01:41,298 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [32381475] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:01:41,298 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:01:41,299 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 00:01:41,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [355010579] [2023-11-29 00:01:41,299 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:01:41,300 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 00:01:41,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:01:41,301 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 00:01:41,301 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-29 00:01:41,347 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 140 [2023-11-29 00:01:41,349 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 145 places, 150 transitions, 384 flow. Second operand has 6 states, 6 states have (on average 116.66666666666667) internal successors, (700), 6 states have internal predecessors, (700), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:01:41,349 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 00:01:41,349 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 140 [2023-11-29 00:01:41,349 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 00:01:41,515 INFO L124 PetriNetUnfolderBase]: 96/798 cut-off events. [2023-11-29 00:01:41,515 INFO L125 PetriNetUnfolderBase]: For 44/44 co-relation queries the response was YES. [2023-11-29 00:01:41,516 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1160 conditions, 798 events. 96/798 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 4764 event pairs, 39 based on Foata normal form. 0/741 useless extension candidates. Maximal degree in co-relation 1077. Up to 127 conditions per place. [2023-11-29 00:01:41,519 INFO L140 encePairwiseOnDemand]: 134/140 looper letters, 32 selfloop transitions, 5 changer transitions 0/165 dead transitions. [2023-11-29 00:01:41,519 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 149 places, 165 transitions, 488 flow [2023-11-29 00:01:41,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 00:01:41,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-29 00:01:41,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 728 transitions. [2023-11-29 00:01:41,522 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8666666666666667 [2023-11-29 00:01:41,522 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 728 transitions. [2023-11-29 00:01:41,522 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 728 transitions. [2023-11-29 00:01:41,523 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 00:01:41,523 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 728 transitions. [2023-11-29 00:01:41,524 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 121.33333333333333) internal successors, (728), 6 states have internal predecessors, (728), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:01:41,527 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 140.0) internal successors, (980), 7 states have internal predecessors, (980), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:01:41,527 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 140.0) internal successors, (980), 7 states have internal predecessors, (980), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:01:41,527 INFO L175 Difference]: Start difference. First operand has 145 places, 150 transitions, 384 flow. Second operand 6 states and 728 transitions. [2023-11-29 00:01:41,527 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 149 places, 165 transitions, 488 flow [2023-11-29 00:01:41,530 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 148 places, 165 transitions, 486 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-29 00:01:41,532 INFO L231 Difference]: Finished difference. Result has 148 places, 149 transitions, 390 flow [2023-11-29 00:01:41,532 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=140, PETRI_DIFFERENCE_MINUEND_FLOW=380, PETRI_DIFFERENCE_MINUEND_PLACES=143, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=149, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=144, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=390, PETRI_PLACES=148, PETRI_TRANSITIONS=149} [2023-11-29 00:01:41,533 INFO L281 CegarLoopForPetriNet]: 139 programPoint places, 9 predicate places. [2023-11-29 00:01:41,533 INFO L495 AbstractCegarLoop]: Abstraction has has 148 places, 149 transitions, 390 flow [2023-11-29 00:01:41,534 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 116.66666666666667) internal successors, (700), 6 states have internal predecessors, (700), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:01:41,534 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 00:01:41,534 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:01:41,535 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-29 00:01:41,535 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 9 more)] === [2023-11-29 00:01:41,535 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:01:41,535 INFO L85 PathProgramCache]: Analyzing trace with hash 299978077, now seen corresponding path program 1 times [2023-11-29 00:01:41,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:01:41,536 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [259343689] [2023-11-29 00:01:41,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:01:41,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:01:41,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:01:41,583 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:01:41,583 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:01:41,583 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [259343689] [2023-11-29 00:01:41,584 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [259343689] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:01:41,584 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:01:41,584 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 00:01:41,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1610341176] [2023-11-29 00:01:41,584 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:01:41,585 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 00:01:41,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:01:41,586 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 00:01:41,586 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 00:01:41,597 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 120 out of 140 [2023-11-29 00:01:41,598 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 148 places, 149 transitions, 390 flow. Second operand has 3 states, 3 states have (on average 122.33333333333333) internal successors, (367), 3 states have internal predecessors, (367), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:01:41,598 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 00:01:41,598 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 140 [2023-11-29 00:01:41,598 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 00:01:41,701 INFO L124 PetriNetUnfolderBase]: 93/632 cut-off events. [2023-11-29 00:01:41,701 INFO L125 PetriNetUnfolderBase]: For 35/39 co-relation queries the response was YES. [2023-11-29 00:01:41,702 INFO L83 FinitePrefix]: Finished finitePrefix Result has 957 conditions, 632 events. 93/632 cut-off events. For 35/39 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 3738 event pairs, 55 based on Foata normal form. 0/581 useless extension candidates. Maximal degree in co-relation 854. Up to 131 conditions per place. [2023-11-29 00:01:41,704 INFO L140 encePairwiseOnDemand]: 135/140 looper letters, 22 selfloop transitions, 4 changer transitions 0/158 dead transitions. [2023-11-29 00:01:41,704 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 150 places, 158 transitions, 460 flow [2023-11-29 00:01:41,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 00:01:41,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 00:01:41,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 387 transitions. [2023-11-29 00:01:41,707 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9214285714285714 [2023-11-29 00:01:41,708 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 387 transitions. [2023-11-29 00:01:41,708 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 387 transitions. [2023-11-29 00:01:41,708 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 00:01:41,708 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 387 transitions. [2023-11-29 00:01:41,710 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 129.0) internal successors, (387), 3 states have internal predecessors, (387), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:01:41,711 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 140.0) internal successors, (560), 4 states have internal predecessors, (560), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:01:41,711 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 140.0) internal successors, (560), 4 states have internal predecessors, (560), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:01:41,711 INFO L175 Difference]: Start difference. First operand has 148 places, 149 transitions, 390 flow. Second operand 3 states and 387 transitions. [2023-11-29 00:01:41,712 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 150 places, 158 transitions, 460 flow [2023-11-29 00:01:41,714 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 145 places, 158 transitions, 450 flow, removed 0 selfloop flow, removed 5 redundant places. [2023-11-29 00:01:41,715 INFO L231 Difference]: Finished difference. Result has 147 places, 152 transitions, 410 flow [2023-11-29 00:01:41,716 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=140, PETRI_DIFFERENCE_MINUEND_FLOW=380, PETRI_DIFFERENCE_MINUEND_PLACES=143, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=149, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=145, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=410, PETRI_PLACES=147, PETRI_TRANSITIONS=152} [2023-11-29 00:01:41,717 INFO L281 CegarLoopForPetriNet]: 139 programPoint places, 8 predicate places. [2023-11-29 00:01:41,717 INFO L495 AbstractCegarLoop]: Abstraction has has 147 places, 152 transitions, 410 flow [2023-11-29 00:01:41,717 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 122.33333333333333) internal successors, (367), 3 states have internal predecessors, (367), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:01:41,717 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 00:01:41,718 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:01:41,718 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-29 00:01:41,718 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting threadErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 9 more)] === [2023-11-29 00:01:41,718 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:01:41,719 INFO L85 PathProgramCache]: Analyzing trace with hash 537362920, now seen corresponding path program 1 times [2023-11-29 00:01:41,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:01:41,719 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1732740812] [2023-11-29 00:01:41,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:01:41,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:01:41,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:01:41,767 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:01:41,767 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:01:41,767 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1732740812] [2023-11-29 00:01:41,767 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1732740812] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:01:41,768 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:01:41,768 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 00:01:41,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [679783685] [2023-11-29 00:01:41,768 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:01:41,768 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 00:01:41,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:01:41,769 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 00:01:41,769 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 00:01:41,794 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 140 [2023-11-29 00:01:41,795 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 147 places, 152 transitions, 410 flow. Second operand has 3 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 00:01:41,795 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 00:01:41,795 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 140 [2023-11-29 00:01:41,795 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 00:01:41,926 INFO L124 PetriNetUnfolderBase]: 160/835 cut-off events. [2023-11-29 00:01:41,926 INFO L125 PetriNetUnfolderBase]: For 182/186 co-relation queries the response was YES. [2023-11-29 00:01:41,928 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1467 conditions, 835 events. 160/835 cut-off events. For 182/186 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 5233 event pairs, 74 based on Foata normal form. 1/784 useless extension candidates. Maximal degree in co-relation 1357. Up to 262 conditions per place. [2023-11-29 00:01:41,931 INFO L140 encePairwiseOnDemand]: 133/140 looper letters, 30 selfloop transitions, 11 changer transitions 0/165 dead transitions. [2023-11-29 00:01:41,931 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 149 places, 165 transitions, 532 flow [2023-11-29 00:01:41,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 00:01:41,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 00:01:41,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 383 transitions. [2023-11-29 00:01:41,933 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9119047619047619 [2023-11-29 00:01:41,933 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 383 transitions. [2023-11-29 00:01:41,933 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 383 transitions. [2023-11-29 00:01:41,934 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 00:01:41,934 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 383 transitions. [2023-11-29 00:01:41,935 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 00:01:41,936 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 140.0) internal successors, (560), 4 states have internal predecessors, (560), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:01:41,936 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 140.0) internal successors, (560), 4 states have internal predecessors, (560), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:01:41,936 INFO L175 Difference]: Start difference. First operand has 147 places, 152 transitions, 410 flow. Second operand 3 states and 383 transitions. [2023-11-29 00:01:41,936 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 149 places, 165 transitions, 532 flow [2023-11-29 00:01:41,938 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 147 places, 165 transitions, 524 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 00:01:41,940 INFO L231 Difference]: Finished difference. Result has 149 places, 159 transitions, 490 flow [2023-11-29 00:01:41,941 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=140, PETRI_DIFFERENCE_MINUEND_FLOW=402, PETRI_DIFFERENCE_MINUEND_PLACES=145, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=152, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=141, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=490, PETRI_PLACES=149, PETRI_TRANSITIONS=159} [2023-11-29 00:01:41,941 INFO L281 CegarLoopForPetriNet]: 139 programPoint places, 10 predicate places. [2023-11-29 00:01:41,942 INFO L495 AbstractCegarLoop]: Abstraction has has 149 places, 159 transitions, 490 flow [2023-11-29 00:01:41,942 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 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 00:01:41,942 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 00:01:41,942 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:01:41,942 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-29 00:01:41,943 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 9 more)] === [2023-11-29 00:01:41,943 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:01:41,943 INFO L85 PathProgramCache]: Analyzing trace with hash 79354702, now seen corresponding path program 1 times [2023-11-29 00:01:41,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:01:41,944 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1448805332] [2023-11-29 00:01:41,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:01:41,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:01:41,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:01:42,001 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-29 00:01:42,002 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:01:42,002 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1448805332] [2023-11-29 00:01:42,002 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1448805332] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:01:42,003 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:01:42,003 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 00:01:42,003 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1874525736] [2023-11-29 00:01:42,003 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:01:42,004 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 00:01:42,004 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:01:42,004 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 00:01:42,005 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 00:01:42,011 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 122 out of 140 [2023-11-29 00:01:42,012 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 149 places, 159 transitions, 490 flow. Second operand has 3 states, 3 states have (on average 124.33333333333333) internal successors, (373), 3 states have internal predecessors, (373), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:01:42,012 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 00:01:42,012 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 140 [2023-11-29 00:01:42,012 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 00:01:42,126 INFO L124 PetriNetUnfolderBase]: 112/788 cut-off events. [2023-11-29 00:01:42,126 INFO L125 PetriNetUnfolderBase]: For 272/279 co-relation queries the response was YES. [2023-11-29 00:01:42,128 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1386 conditions, 788 events. 112/788 cut-off events. For 272/279 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 5008 event pairs, 47 based on Foata normal form. 0/744 useless extension candidates. Maximal degree in co-relation 1275. Up to 129 conditions per place. [2023-11-29 00:01:42,130 INFO L140 encePairwiseOnDemand]: 136/140 looper letters, 15 selfloop transitions, 3 changer transitions 6/165 dead transitions. [2023-11-29 00:01:42,131 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 151 places, 165 transitions, 548 flow [2023-11-29 00:01:42,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 00:01:42,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 00:01:42,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 388 transitions. [2023-11-29 00:01:42,133 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9238095238095239 [2023-11-29 00:01:42,133 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 388 transitions. [2023-11-29 00:01:42,133 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 388 transitions. [2023-11-29 00:01:42,133 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 00:01:42,133 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 388 transitions. [2023-11-29 00:01:42,134 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 129.33333333333334) internal successors, (388), 3 states have internal predecessors, (388), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:01:42,135 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 140.0) internal successors, (560), 4 states have internal predecessors, (560), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:01:42,136 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 140.0) internal successors, (560), 4 states have internal predecessors, (560), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:01:42,136 INFO L175 Difference]: Start difference. First operand has 149 places, 159 transitions, 490 flow. Second operand 3 states and 388 transitions. [2023-11-29 00:01:42,136 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 151 places, 165 transitions, 548 flow [2023-11-29 00:01:42,138 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 149 places, 165 transitions, 526 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 00:01:42,140 INFO L231 Difference]: Finished difference. Result has 151 places, 158 transitions, 482 flow [2023-11-29 00:01:42,140 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=140, PETRI_DIFFERENCE_MINUEND_FLOW=468, PETRI_DIFFERENCE_MINUEND_PLACES=147, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=159, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=156, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=482, PETRI_PLACES=151, PETRI_TRANSITIONS=158} [2023-11-29 00:01:42,141 INFO L281 CegarLoopForPetriNet]: 139 programPoint places, 12 predicate places. [2023-11-29 00:01:42,141 INFO L495 AbstractCegarLoop]: Abstraction has has 151 places, 158 transitions, 482 flow [2023-11-29 00:01:42,141 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 124.33333333333333) internal successors, (373), 3 states have internal predecessors, (373), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:01:42,142 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 00:01:42,142 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:01:42,142 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-29 00:01:42,142 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 9 more)] === [2023-11-29 00:01:42,143 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:01:42,143 INFO L85 PathProgramCache]: Analyzing trace with hash 2136836131, now seen corresponding path program 1 times [2023-11-29 00:01:42,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:01:42,143 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [926062861] [2023-11-29 00:01:42,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:01:42,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:01:42,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 00:01:42,172 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 00:01:42,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 00:01:42,214 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 00:01:42,214 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-29 00:01:42,215 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (11 of 12 remaining) [2023-11-29 00:01:42,217 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (10 of 12 remaining) [2023-11-29 00:01:42,217 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (9 of 12 remaining) [2023-11-29 00:01:42,217 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (8 of 12 remaining) [2023-11-29 00:01:42,217 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (7 of 12 remaining) [2023-11-29 00:01:42,218 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (6 of 12 remaining) [2023-11-29 00:01:42,218 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (5 of 12 remaining) [2023-11-29 00:01:42,218 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (4 of 12 remaining) [2023-11-29 00:01:42,218 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr2ASSERT_VIOLATIONDATA_RACE (3 of 12 remaining) [2023-11-29 00:01:42,218 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (2 of 12 remaining) [2023-11-29 00:01:42,219 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (1 of 12 remaining) [2023-11-29 00:01:42,219 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr2ASSERT_VIOLATIONDATA_RACE (0 of 12 remaining) [2023-11-29 00:01:42,219 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-29 00:01:42,219 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:01:42,221 WARN L233 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2023-11-29 00:01:42,221 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2023-11-29 00:01:42,246 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-29 00:01:42,251 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 173 places, 172 transitions, 354 flow [2023-11-29 00:01:42,281 INFO L124 PetriNetUnfolderBase]: 10/278 cut-off events. [2023-11-29 00:01:42,282 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-11-29 00:01:42,282 INFO L83 FinitePrefix]: Finished finitePrefix Result has 286 conditions, 278 events. 10/278 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 454 event pairs, 0 based on Foata normal form. 0/245 useless extension candidates. Maximal degree in co-relation 185. Up to 6 conditions per place. [2023-11-29 00:01:42,282 INFO L82 GeneralOperation]: Start removeDead. Operand has 173 places, 172 transitions, 354 flow [2023-11-29 00:01:42,286 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 173 places, 172 transitions, 354 flow [2023-11-29 00:01:42,287 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-29 00:01:42,288 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;@f811091, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-29 00:01:42,288 INFO L358 AbstractCegarLoop]: Starting to check reachability of 15 error locations. [2023-11-29 00:01:42,294 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-29 00:01:42,294 INFO L124 PetriNetUnfolderBase]: 2/54 cut-off events. [2023-11-29 00:01:42,294 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-29 00:01:42,294 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 00:01:42,294 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] [2023-11-29 00:01:42,294 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2023-11-29 00:01:42,295 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:01:42,295 INFO L85 PathProgramCache]: Analyzing trace with hash -391076151, now seen corresponding path program 1 times [2023-11-29 00:01:42,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:01:42,295 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1547296720] [2023-11-29 00:01:42,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:01:42,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:01:42,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:01:42,321 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:01:42,321 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:01:42,321 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1547296720] [2023-11-29 00:01:42,321 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1547296720] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:01:42,322 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:01:42,322 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 00:01:42,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1107877810] [2023-11-29 00:01:42,322 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:01:42,322 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 00:01:42,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:01:42,323 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 00:01:42,323 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 00:01:42,352 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 138 out of 172 [2023-11-29 00:01:42,352 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 173 places, 172 transitions, 354 flow. Second operand has 3 states, 3 states have (on average 139.0) internal successors, (417), 3 states have internal predecessors, (417), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:01:42,352 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 00:01:42,353 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 138 of 172 [2023-11-29 00:01:42,353 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 00:01:43,662 INFO L124 PetriNetUnfolderBase]: 2216/7143 cut-off events. [2023-11-29 00:01:43,662 INFO L125 PetriNetUnfolderBase]: For 49/49 co-relation queries the response was YES. [2023-11-29 00:01:43,676 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10847 conditions, 7143 events. 2216/7143 cut-off events. For 49/49 co-relation queries the response was YES. Maximal size of possible extension queue 312. Compared 71017 event pairs, 879 based on Foata normal form. 75/6412 useless extension candidates. Maximal degree in co-relation 9274. Up to 2089 conditions per place. [2023-11-29 00:01:43,717 INFO L140 encePairwiseOnDemand]: 154/172 looper letters, 46 selfloop transitions, 11 changer transitions 1/195 dead transitions. [2023-11-29 00:01:43,718 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 175 places, 195 transitions, 519 flow [2023-11-29 00:01:43,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 00:01:43,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 00:01:43,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 480 transitions. [2023-11-29 00:01:43,720 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9302325581395349 [2023-11-29 00:01:43,720 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 480 transitions. [2023-11-29 00:01:43,720 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 480 transitions. [2023-11-29 00:01:43,721 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 00:01:43,721 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 480 transitions. [2023-11-29 00:01:43,750 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 160.0) internal successors, (480), 3 states have internal predecessors, (480), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:01:43,751 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 172.0) internal successors, (688), 4 states have internal predecessors, (688), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:01:43,752 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 172.0) internal successors, (688), 4 states have internal predecessors, (688), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:01:43,752 INFO L175 Difference]: Start difference. First operand has 173 places, 172 transitions, 354 flow. Second operand 3 states and 480 transitions. [2023-11-29 00:01:43,752 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 175 places, 195 transitions, 519 flow [2023-11-29 00:01:43,753 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 175 places, 195 transitions, 519 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-29 00:01:43,755 INFO L231 Difference]: Finished difference. Result has 177 places, 179 transitions, 442 flow [2023-11-29 00:01:43,755 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=172, PETRI_DIFFERENCE_MINUEND_FLOW=348, PETRI_DIFFERENCE_MINUEND_PLACES=173, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=169, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=158, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=442, PETRI_PLACES=177, PETRI_TRANSITIONS=179} [2023-11-29 00:01:43,756 INFO L281 CegarLoopForPetriNet]: 173 programPoint places, 4 predicate places. [2023-11-29 00:01:43,756 INFO L495 AbstractCegarLoop]: Abstraction has has 177 places, 179 transitions, 442 flow [2023-11-29 00:01:43,757 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 139.0) internal successors, (417), 3 states have internal predecessors, (417), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:01:43,757 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 00:01:43,757 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:01:43,757 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-29 00:01:43,757 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2023-11-29 00:01:43,758 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:01:43,758 INFO L85 PathProgramCache]: Analyzing trace with hash -1098128065, now seen corresponding path program 1 times [2023-11-29 00:01:43,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:01:43,758 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [317291181] [2023-11-29 00:01:43,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:01:43,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:01:43,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:01:43,783 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:01:43,784 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:01:43,784 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [317291181] [2023-11-29 00:01:43,784 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [317291181] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:01:43,784 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:01:43,784 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 00:01:43,785 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1944486323] [2023-11-29 00:01:43,785 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:01:43,785 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 00:01:43,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:01:43,786 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 00:01:43,786 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 00:01:43,824 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 140 out of 172 [2023-11-29 00:01:43,825 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 177 places, 179 transitions, 442 flow. Second operand has 3 states, 3 states have (on average 142.0) internal successors, (426), 3 states have internal predecessors, (426), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:01:43,825 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 00:01:43,825 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 140 of 172 [2023-11-29 00:01:43,825 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 00:01:45,129 INFO L124 PetriNetUnfolderBase]: 2480/9000 cut-off events. [2023-11-29 00:01:45,129 INFO L125 PetriNetUnfolderBase]: For 2871/3041 co-relation queries the response was YES. [2023-11-29 00:01:45,150 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15766 conditions, 9000 events. 2480/9000 cut-off events. For 2871/3041 co-relation queries the response was YES. Maximal size of possible extension queue 316. Compared 96099 event pairs, 1597 based on Foata normal form. 62/8224 useless extension candidates. Maximal degree in co-relation 13630. Up to 3442 conditions per place. [2023-11-29 00:01:45,197 INFO L140 encePairwiseOnDemand]: 164/172 looper letters, 42 selfloop transitions, 12 changer transitions 0/197 dead transitions. [2023-11-29 00:01:45,197 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 178 places, 197 transitions, 610 flow [2023-11-29 00:01:45,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 00:01:45,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 00:01:45,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 464 transitions. [2023-11-29 00:01:45,199 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8992248062015504 [2023-11-29 00:01:45,199 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 464 transitions. [2023-11-29 00:01:45,200 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 464 transitions. [2023-11-29 00:01:45,200 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 00:01:45,200 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 464 transitions. [2023-11-29 00:01:45,202 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 154.66666666666666) internal successors, (464), 3 states have internal predecessors, (464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:01:45,203 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 172.0) internal successors, (688), 4 states have internal predecessors, (688), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:01:45,204 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 172.0) internal successors, (688), 4 states have internal predecessors, (688), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:01:45,204 INFO L175 Difference]: Start difference. First operand has 177 places, 179 transitions, 442 flow. Second operand 3 states and 464 transitions. [2023-11-29 00:01:45,204 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 178 places, 197 transitions, 610 flow [2023-11-29 00:01:45,214 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 176 places, 197 transitions, 580 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 00:01:45,217 INFO L231 Difference]: Finished difference. Result has 178 places, 189 transitions, 526 flow [2023-11-29 00:01:45,218 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=172, PETRI_DIFFERENCE_MINUEND_FLOW=420, PETRI_DIFFERENCE_MINUEND_PLACES=174, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=179, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=167, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=526, PETRI_PLACES=178, PETRI_TRANSITIONS=189} [2023-11-29 00:01:45,219 INFO L281 CegarLoopForPetriNet]: 173 programPoint places, 5 predicate places. [2023-11-29 00:01:45,219 INFO L495 AbstractCegarLoop]: Abstraction has has 178 places, 189 transitions, 526 flow [2023-11-29 00:01:45,219 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 142.0) internal successors, (426), 3 states have internal predecessors, (426), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:01:45,220 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 00:01:45,220 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:01:45,220 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-29 00:01:45,220 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2023-11-29 00:01:45,221 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:01:45,221 INFO L85 PathProgramCache]: Analyzing trace with hash -809663801, now seen corresponding path program 1 times [2023-11-29 00:01:45,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:01:45,221 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1519972898] [2023-11-29 00:01:45,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:01:45,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:01:45,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:01:45,283 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:01:45,283 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:01:45,284 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1519972898] [2023-11-29 00:01:45,284 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1519972898] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:01:45,284 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:01:45,284 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 00:01:45,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [534625175] [2023-11-29 00:01:45,284 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:01:45,285 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 00:01:45,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:01:45,286 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 00:01:45,286 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 00:01:45,296 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 148 out of 172 [2023-11-29 00:01:45,297 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 178 places, 189 transitions, 526 flow. Second operand has 3 states, 3 states have (on average 149.33333333333334) internal successors, (448), 3 states have internal predecessors, (448), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:01:45,297 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 00:01:45,297 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 148 of 172 [2023-11-29 00:01:45,297 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 00:01:46,382 INFO L124 PetriNetUnfolderBase]: 1987/8137 cut-off events. [2023-11-29 00:01:46,382 INFO L125 PetriNetUnfolderBase]: For 1271/1722 co-relation queries the response was YES. [2023-11-29 00:01:46,402 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13288 conditions, 8137 events. 1987/8137 cut-off events. For 1271/1722 co-relation queries the response was YES. Maximal size of possible extension queue 311. Compared 88478 event pairs, 1348 based on Foata normal form. 34/7321 useless extension candidates. Maximal degree in co-relation 11492. Up to 2231 conditions per place. [2023-11-29 00:01:46,429 INFO L140 encePairwiseOnDemand]: 169/172 looper letters, 21 selfloop transitions, 2 changer transitions 3/194 dead transitions. [2023-11-29 00:01:46,429 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 180 places, 194 transitions, 588 flow [2023-11-29 00:01:46,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 00:01:46,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 00:01:46,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 471 transitions. [2023-11-29 00:01:46,432 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9127906976744186 [2023-11-29 00:01:46,432 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 471 transitions. [2023-11-29 00:01:46,432 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 471 transitions. [2023-11-29 00:01:46,433 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 00:01:46,433 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 471 transitions. [2023-11-29 00:01:46,434 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 157.0) internal successors, (471), 3 states have internal predecessors, (471), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:01:46,435 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 172.0) internal successors, (688), 4 states have internal predecessors, (688), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:01:46,436 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 172.0) internal successors, (688), 4 states have internal predecessors, (688), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:01:46,436 INFO L175 Difference]: Start difference. First operand has 178 places, 189 transitions, 526 flow. Second operand 3 states and 471 transitions. [2023-11-29 00:01:46,436 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 180 places, 194 transitions, 588 flow [2023-11-29 00:01:46,442 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 178 places, 194 transitions, 564 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 00:01:46,445 INFO L231 Difference]: Finished difference. Result has 179 places, 190 transitions, 514 flow [2023-11-29 00:01:46,446 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=172, PETRI_DIFFERENCE_MINUEND_FLOW=502, PETRI_DIFFERENCE_MINUEND_PLACES=176, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=189, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=187, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=514, PETRI_PLACES=179, PETRI_TRANSITIONS=190} [2023-11-29 00:01:46,446 INFO L281 CegarLoopForPetriNet]: 173 programPoint places, 6 predicate places. [2023-11-29 00:01:46,447 INFO L495 AbstractCegarLoop]: Abstraction has has 179 places, 190 transitions, 514 flow [2023-11-29 00:01:46,447 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 149.33333333333334) internal successors, (448), 3 states have internal predecessors, (448), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:01:46,447 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 00:01:46,447 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:01:46,447 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-29 00:01:46,448 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2023-11-29 00:01:46,448 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:01:46,448 INFO L85 PathProgramCache]: Analyzing trace with hash -1217841465, now seen corresponding path program 1 times [2023-11-29 00:01:46,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:01:46,448 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [402927403] [2023-11-29 00:01:46,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:01:46,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:01:46,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:01:46,809 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:01:46,809 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:01:46,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [402927403] [2023-11-29 00:01:46,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [402927403] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:01:46,810 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:01:46,810 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 00:01:46,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1926927697] [2023-11-29 00:01:46,810 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:01:46,810 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 00:01:46,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:01:46,811 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 00:01:46,811 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-29 00:01:46,860 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 142 out of 172 [2023-11-29 00:01:46,861 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 179 places, 190 transitions, 514 flow. Second operand has 6 states, 6 states have (on average 143.66666666666666) internal successors, (862), 6 states have internal predecessors, (862), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:01:46,861 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 00:01:46,861 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 142 of 172 [2023-11-29 00:01:46,861 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 00:01:47,895 INFO L124 PetriNetUnfolderBase]: 1805/8276 cut-off events. [2023-11-29 00:01:47,896 INFO L125 PetriNetUnfolderBase]: For 774/1670 co-relation queries the response was YES. [2023-11-29 00:01:47,914 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12914 conditions, 8276 events. 1805/8276 cut-off events. For 774/1670 co-relation queries the response was YES. Maximal size of possible extension queue 301. Compared 90054 event pairs, 1003 based on Foata normal form. 6/7468 useless extension candidates. Maximal degree in co-relation 12830. Up to 1560 conditions per place. [2023-11-29 00:01:47,938 INFO L140 encePairwiseOnDemand]: 166/172 looper letters, 53 selfloop transitions, 5 changer transitions 0/221 dead transitions. [2023-11-29 00:01:47,938 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 183 places, 221 transitions, 692 flow [2023-11-29 00:01:47,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 00:01:47,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-29 00:01:47,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 911 transitions. [2023-11-29 00:01:47,942 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8827519379844961 [2023-11-29 00:01:47,942 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 911 transitions. [2023-11-29 00:01:47,942 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 911 transitions. [2023-11-29 00:01:47,943 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 00:01:47,943 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 911 transitions. [2023-11-29 00:01:47,945 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 151.83333333333334) internal successors, (911), 6 states have internal predecessors, (911), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:01:47,947 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 172.0) internal successors, (1204), 7 states have internal predecessors, (1204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:01:47,947 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 172.0) internal successors, (1204), 7 states have internal predecessors, (1204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:01:47,947 INFO L175 Difference]: Start difference. First operand has 179 places, 190 transitions, 514 flow. Second operand 6 states and 911 transitions. [2023-11-29 00:01:47,947 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 183 places, 221 transitions, 692 flow [2023-11-29 00:01:47,949 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 182 places, 221 transitions, 690 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-29 00:01:47,952 INFO L231 Difference]: Finished difference. Result has 182 places, 189 transitions, 520 flow [2023-11-29 00:01:47,952 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=172, PETRI_DIFFERENCE_MINUEND_FLOW=510, PETRI_DIFFERENCE_MINUEND_PLACES=177, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=189, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=184, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=520, PETRI_PLACES=182, PETRI_TRANSITIONS=189} [2023-11-29 00:01:47,953 INFO L281 CegarLoopForPetriNet]: 173 programPoint places, 9 predicate places. [2023-11-29 00:01:47,953 INFO L495 AbstractCegarLoop]: Abstraction has has 182 places, 189 transitions, 520 flow [2023-11-29 00:01:47,954 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 143.66666666666666) internal successors, (862), 6 states have internal predecessors, (862), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:01:47,954 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 00:01:47,954 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:01:47,954 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-29 00:01:47,954 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2023-11-29 00:01:47,955 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:01:47,955 INFO L85 PathProgramCache]: Analyzing trace with hash 727793738, now seen corresponding path program 1 times [2023-11-29 00:01:47,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:01:47,955 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1295036911] [2023-11-29 00:01:47,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:01:47,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:01:47,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:01:47,990 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:01:47,990 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:01:47,990 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1295036911] [2023-11-29 00:01:47,990 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1295036911] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:01:47,990 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:01:47,990 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 00:01:47,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [622625010] [2023-11-29 00:01:47,991 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:01:47,991 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 00:01:47,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:01:47,992 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 00:01:47,992 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 00:01:48,006 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 146 out of 172 [2023-11-29 00:01:48,007 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 182 places, 189 transitions, 520 flow. Second operand has 3 states, 3 states have (on average 148.33333333333334) internal successors, (445), 3 states have internal predecessors, (445), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:01:48,007 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 00:01:48,007 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 146 of 172 [2023-11-29 00:01:48,007 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 00:01:49,082 INFO L124 PetriNetUnfolderBase]: 2252/9161 cut-off events. [2023-11-29 00:01:49,082 INFO L125 PetriNetUnfolderBase]: For 871/1783 co-relation queries the response was YES. [2023-11-29 00:01:49,102 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14700 conditions, 9161 events. 2252/9161 cut-off events. For 871/1783 co-relation queries the response was YES. Maximal size of possible extension queue 391. Compared 104521 event pairs, 1333 based on Foata normal form. 10/8116 useless extension candidates. Maximal degree in co-relation 13109. Up to 2161 conditions per place. [2023-11-29 00:01:49,127 INFO L140 encePairwiseOnDemand]: 166/172 looper letters, 33 selfloop transitions, 5 changer transitions 0/204 dead transitions. [2023-11-29 00:01:49,127 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 184 places, 204 transitions, 631 flow [2023-11-29 00:01:49,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 00:01:49,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 00:01:49,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 477 transitions. [2023-11-29 00:01:49,129 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9244186046511628 [2023-11-29 00:01:49,130 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 477 transitions. [2023-11-29 00:01:49,130 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 477 transitions. [2023-11-29 00:01:49,130 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 00:01:49,130 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 477 transitions. [2023-11-29 00:01:49,131 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 159.0) internal successors, (477), 3 states have internal predecessors, (477), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:01:49,133 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 172.0) internal successors, (688), 4 states have internal predecessors, (688), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:01:49,133 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 172.0) internal successors, (688), 4 states have internal predecessors, (688), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:01:49,134 INFO L175 Difference]: Start difference. First operand has 182 places, 189 transitions, 520 flow. Second operand 3 states and 477 transitions. [2023-11-29 00:01:49,134 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 184 places, 204 transitions, 631 flow [2023-11-29 00:01:49,137 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 179 places, 204 transitions, 621 flow, removed 0 selfloop flow, removed 5 redundant places. [2023-11-29 00:01:49,140 INFO L231 Difference]: Finished difference. Result has 181 places, 193 transitions, 548 flow [2023-11-29 00:01:49,140 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=172, PETRI_DIFFERENCE_MINUEND_FLOW=510, PETRI_DIFFERENCE_MINUEND_PLACES=177, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=189, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=184, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=548, PETRI_PLACES=181, PETRI_TRANSITIONS=193} [2023-11-29 00:01:49,141 INFO L281 CegarLoopForPetriNet]: 173 programPoint places, 8 predicate places. [2023-11-29 00:01:49,141 INFO L495 AbstractCegarLoop]: Abstraction has has 181 places, 193 transitions, 548 flow [2023-11-29 00:01:49,141 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 148.33333333333334) internal successors, (445), 3 states have internal predecessors, (445), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:01:49,141 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 00:01:49,142 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:01:49,142 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-29 00:01:49,142 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting threadErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2023-11-29 00:01:49,142 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:01:49,143 INFO L85 PathProgramCache]: Analyzing trace with hash 695646151, now seen corresponding path program 1 times [2023-11-29 00:01:49,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:01:49,143 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [942695951] [2023-11-29 00:01:49,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:01:49,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:01:49,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:01:49,186 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:01:49,187 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:01:49,187 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [942695951] [2023-11-29 00:01:49,187 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [942695951] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:01:49,187 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:01:49,187 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 00:01:49,188 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [508007854] [2023-11-29 00:01:49,188 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:01:49,188 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 00:01:49,189 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:01:49,189 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 00:01:49,189 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 00:01:49,218 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 142 out of 172 [2023-11-29 00:01:49,219 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 181 places, 193 transitions, 548 flow. Second operand has 3 states, 3 states have (on average 146.0) internal successors, (438), 3 states have internal predecessors, (438), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:01:49,219 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 00:01:49,220 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 142 of 172 [2023-11-29 00:01:49,220 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 00:01:50,606 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([405] L712-4-->L712-1: Formula: (= 0 |v_#race~threads_alive~0_7|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_7|} AuxVars[] AssignedVars[#race~threads_alive~0][179], [Black: 190#(<= (+ ~threads_alive~0 1) 0), 116#L695-2true, 200#true, Black: 176#true, 206#true, 100#L695-7true, Black: 184#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet12#1|), 93#L712-1true, threadThread1of2ForFork0InUse, Black: 202#(= |threadThread1of2ForFork0_#t~nondet2| |#race~data~0|), threadThread2of2ForFork0InUse]) [2023-11-29 00:01:50,606 INFO L294 olderBase$Statistics]: this new event has 166 ancestors and is cut-off event [2023-11-29 00:01:50,606 INFO L297 olderBase$Statistics]: existing Event has 159 ancestors and is cut-off event [2023-11-29 00:01:50,607 INFO L297 olderBase$Statistics]: existing Event has 159 ancestors and is cut-off event [2023-11-29 00:01:50,607 INFO L297 olderBase$Statistics]: existing Event has 166 ancestors and is cut-off event [2023-11-29 00:01:50,715 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([405] L712-4-->L712-1: Formula: (= 0 |v_#race~threads_alive~0_7|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_7|} AuxVars[] AssignedVars[#race~threads_alive~0][66], [Black: 190#(<= (+ ~threads_alive~0 1) 0), 116#L695-2true, 42#L697true, 200#true, Black: 176#true, 206#true, Black: 184#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet12#1|), 93#L712-1true, threadThread1of2ForFork0InUse, Black: 202#(= |threadThread1of2ForFork0_#t~nondet2| |#race~data~0|), threadThread2of2ForFork0InUse]) [2023-11-29 00:01:50,715 INFO L294 olderBase$Statistics]: this new event has 168 ancestors and is cut-off event [2023-11-29 00:01:50,715 INFO L297 olderBase$Statistics]: existing Event has 168 ancestors and is cut-off event [2023-11-29 00:01:50,716 INFO L297 olderBase$Statistics]: existing Event has 161 ancestors and is cut-off event [2023-11-29 00:01:50,716 INFO L297 olderBase$Statistics]: existing Event has 161 ancestors and is cut-off event [2023-11-29 00:01:50,748 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([405] L712-4-->L712-1: Formula: (= 0 |v_#race~threads_alive~0_7|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_7|} AuxVars[] AssignedVars[#race~threads_alive~0][66], [Black: 190#(<= (+ ~threads_alive~0 1) 0), 116#L695-2true, 170#L697-3true, Black: 176#true, 200#true, 206#true, 93#L712-1true, Black: 184#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet12#1|), threadThread1of2ForFork0InUse, Black: 202#(= |threadThread1of2ForFork0_#t~nondet2| |#race~data~0|), threadThread2of2ForFork0InUse]) [2023-11-29 00:01:50,748 INFO L294 olderBase$Statistics]: this new event has 169 ancestors and is cut-off event [2023-11-29 00:01:50,749 INFO L297 olderBase$Statistics]: existing Event has 162 ancestors and is cut-off event [2023-11-29 00:01:50,749 INFO L297 olderBase$Statistics]: existing Event has 169 ancestors and is cut-off event [2023-11-29 00:01:50,749 INFO L297 olderBase$Statistics]: existing Event has 162 ancestors and is cut-off event [2023-11-29 00:01:50,885 INFO L124 PetriNetUnfolderBase]: 3855/12798 cut-off events. [2023-11-29 00:01:50,885 INFO L125 PetriNetUnfolderBase]: For 4923/5223 co-relation queries the response was YES. [2023-11-29 00:01:50,910 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23902 conditions, 12798 events. 3855/12798 cut-off events. For 4923/5223 co-relation queries the response was YES. Maximal size of possible extension queue 451. Compared 143350 event pairs, 1990 based on Foata normal form. 65/11504 useless extension candidates. Maximal degree in co-relation 20126. Up to 4823 conditions per place. [2023-11-29 00:01:50,954 INFO L140 encePairwiseOnDemand]: 163/172 looper letters, 49 selfloop transitions, 19 changer transitions 0/219 dead transitions. [2023-11-29 00:01:50,954 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 183 places, 219 transitions, 785 flow [2023-11-29 00:01:50,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 00:01:50,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 00:01:50,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 472 transitions. [2023-11-29 00:01:50,956 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9147286821705426 [2023-11-29 00:01:50,956 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 472 transitions. [2023-11-29 00:01:50,956 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 472 transitions. [2023-11-29 00:01:50,957 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 00:01:50,957 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 472 transitions. [2023-11-29 00:01:50,959 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 157.33333333333334) internal successors, (472), 3 states have internal predecessors, (472), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:01:50,960 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 172.0) internal successors, (688), 4 states have internal predecessors, (688), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:01:50,960 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 172.0) internal successors, (688), 4 states have internal predecessors, (688), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:01:50,960 INFO L175 Difference]: Start difference. First operand has 181 places, 193 transitions, 548 flow. Second operand 3 states and 472 transitions. [2023-11-29 00:01:50,960 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 183 places, 219 transitions, 785 flow [2023-11-29 00:01:50,964 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 181 places, 219 transitions, 775 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 00:01:50,967 INFO L231 Difference]: Finished difference. Result has 183 places, 208 transitions, 720 flow [2023-11-29 00:01:50,968 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=172, PETRI_DIFFERENCE_MINUEND_FLOW=538, PETRI_DIFFERENCE_MINUEND_PLACES=179, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=193, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=174, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=720, PETRI_PLACES=183, PETRI_TRANSITIONS=208} [2023-11-29 00:01:50,968 INFO L281 CegarLoopForPetriNet]: 173 programPoint places, 10 predicate places. [2023-11-29 00:01:50,969 INFO L495 AbstractCegarLoop]: Abstraction has has 183 places, 208 transitions, 720 flow [2023-11-29 00:01:50,969 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 146.0) internal successors, (438), 3 states have internal predecessors, (438), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:01:50,969 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 00:01:50,969 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:01:50,969 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-29 00:01:50,969 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2023-11-29 00:01:50,970 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:01:50,970 INFO L85 PathProgramCache]: Analyzing trace with hash -318370195, now seen corresponding path program 1 times [2023-11-29 00:01:50,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:01:50,970 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1605302039] [2023-11-29 00:01:50,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:01:50,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:01:50,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:01:51,009 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-29 00:01:51,010 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:01:51,010 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1605302039] [2023-11-29 00:01:51,010 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1605302039] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:01:51,010 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:01:51,010 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 00:01:51,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1083051995] [2023-11-29 00:01:51,011 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:01:51,011 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 00:01:51,012 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:01:51,012 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 00:01:51,012 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 00:01:51,022 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 148 out of 172 [2023-11-29 00:01:51,023 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 183 places, 208 transitions, 720 flow. Second operand has 3 states, 3 states have (on average 150.33333333333334) internal successors, (451), 3 states have internal predecessors, (451), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:01:51,023 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 00:01:51,023 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 148 of 172 [2023-11-29 00:01:51,023 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 00:01:52,274 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([405] L712-4-->L712-1: Formula: (= 0 |v_#race~threads_alive~0_7|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_7|} AuxVars[] AssignedVars[#race~threads_alive~0][180], [Black: 190#(<= (+ ~threads_alive~0 1) 0), 116#L695-2true, Black: 208#(= |threadThread1of2ForFork0_#t~nondet6| |#race~threads_alive~0|), Black: 176#true, 100#L695-7true, 206#true, Black: 184#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet12#1|), 93#L712-1true, threadThread1of2ForFork0InUse, Black: 202#(= |threadThread1of2ForFork0_#t~nondet2| |#race~data~0|), threadThread2of2ForFork0InUse, 212#true]) [2023-11-29 00:01:52,274 INFO L294 olderBase$Statistics]: this new event has 166 ancestors and is cut-off event [2023-11-29 00:01:52,275 INFO L297 olderBase$Statistics]: existing Event has 159 ancestors and is cut-off event [2023-11-29 00:01:52,275 INFO L297 olderBase$Statistics]: existing Event has 159 ancestors and is cut-off event [2023-11-29 00:01:52,275 INFO L297 olderBase$Statistics]: existing Event has 166 ancestors and is cut-off event [2023-11-29 00:01:52,275 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([405] L712-4-->L712-1: Formula: (= 0 |v_#race~threads_alive~0_7|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_7|} AuxVars[] AssignedVars[#race~threads_alive~0][180], [Black: 190#(<= (+ ~threads_alive~0 1) 0), 116#L695-2true, Black: 208#(= |threadThread1of2ForFork0_#t~nondet6| |#race~threads_alive~0|), Black: 176#true, 100#L695-7true, 206#true, Black: 184#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet12#1|), 93#L712-1true, threadThread1of2ForFork0InUse, Black: 202#(= |threadThread1of2ForFork0_#t~nondet2| |#race~data~0|), threadThread2of2ForFork0InUse, 212#true]) [2023-11-29 00:01:52,275 INFO L294 olderBase$Statistics]: this new event has 166 ancestors and is cut-off event [2023-11-29 00:01:52,275 INFO L297 olderBase$Statistics]: existing Event has 159 ancestors and is cut-off event [2023-11-29 00:01:52,275 INFO L297 olderBase$Statistics]: existing Event has 159 ancestors and is cut-off event [2023-11-29 00:01:52,275 INFO L297 olderBase$Statistics]: existing Event has 166 ancestors and is cut-off event [2023-11-29 00:01:52,275 INFO L297 olderBase$Statistics]: existing Event has 166 ancestors and is cut-off event [2023-11-29 00:01:52,316 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([561] L695-->L695-1: Formula: (= |v_#race~threads_alive~0_10| 0) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_10|} AuxVars[] AssignedVars[#race~threads_alive~0][212], [Black: 190#(<= (+ ~threads_alive~0 1) 0), Black: 208#(= |threadThread1of2ForFork0_#t~nondet6| |#race~threads_alive~0|), Black: 176#true, 74#L712-2true, 206#true, 100#L695-7true, Black: 184#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet12#1|), threadThread1of2ForFork0InUse, Black: 202#(= |threadThread1of2ForFork0_#t~nondet2| |#race~data~0|), 89#L695-1true, threadThread2of2ForFork0InUse, 212#true]) [2023-11-29 00:01:52,316 INFO L294 olderBase$Statistics]: this new event has 166 ancestors and is cut-off event [2023-11-29 00:01:52,316 INFO L297 olderBase$Statistics]: existing Event has 159 ancestors and is cut-off event [2023-11-29 00:01:52,316 INFO L297 olderBase$Statistics]: existing Event has 159 ancestors and is cut-off event [2023-11-29 00:01:52,316 INFO L297 olderBase$Statistics]: existing Event has 166 ancestors and is cut-off event [2023-11-29 00:01:52,335 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([405] L712-4-->L712-1: Formula: (= 0 |v_#race~threads_alive~0_7|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_7|} AuxVars[] AssignedVars[#race~threads_alive~0][180], [Black: 190#(<= (+ ~threads_alive~0 1) 0), Black: 208#(= |threadThread1of2ForFork0_#t~nondet6| |#race~threads_alive~0|), Black: 176#true, 206#true, 100#L695-7true, Black: 184#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet12#1|), 93#L712-1true, threadThread1of2ForFork0InUse, Black: 202#(= |threadThread1of2ForFork0_#t~nondet2| |#race~data~0|), threadThread2of2ForFork0InUse, 89#L695-1true, 212#true]) [2023-11-29 00:01:52,335 INFO L294 olderBase$Statistics]: this new event has 165 ancestors and is cut-off event [2023-11-29 00:01:52,335 INFO L297 olderBase$Statistics]: existing Event has 165 ancestors and is cut-off event [2023-11-29 00:01:52,335 INFO L297 olderBase$Statistics]: existing Event has 158 ancestors and is cut-off event [2023-11-29 00:01:52,335 INFO L297 olderBase$Statistics]: existing Event has 165 ancestors and is cut-off event [2023-11-29 00:01:52,391 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([405] L712-4-->L712-1: Formula: (= 0 |v_#race~threads_alive~0_7|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_7|} AuxVars[] AssignedVars[#race~threads_alive~0][66], [Black: 190#(<= (+ ~threads_alive~0 1) 0), 116#L695-2true, 42#L697true, Black: 208#(= |threadThread1of2ForFork0_#t~nondet6| |#race~threads_alive~0|), Black: 176#true, 206#true, Black: 184#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet12#1|), 93#L712-1true, threadThread1of2ForFork0InUse, Black: 202#(= |threadThread1of2ForFork0_#t~nondet2| |#race~data~0|), threadThread2of2ForFork0InUse, 212#true]) [2023-11-29 00:01:52,391 INFO L294 olderBase$Statistics]: this new event has 168 ancestors and is cut-off event [2023-11-29 00:01:52,391 INFO L297 olderBase$Statistics]: existing Event has 161 ancestors and is cut-off event [2023-11-29 00:01:52,391 INFO L297 olderBase$Statistics]: existing Event has 161 ancestors and is cut-off event [2023-11-29 00:01:52,391 INFO L297 olderBase$Statistics]: existing Event has 168 ancestors and is cut-off event [2023-11-29 00:01:52,408 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([405] L712-4-->L712-1: Formula: (= 0 |v_#race~threads_alive~0_7|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_7|} AuxVars[] AssignedVars[#race~threads_alive~0][66], [Black: 190#(<= (+ ~threads_alive~0 1) 0), 116#L695-2true, 30#threadErr2ASSERT_VIOLATIONDATA_RACEtrue, Black: 208#(= |threadThread1of2ForFork0_#t~nondet6| |#race~threads_alive~0|), Black: 176#true, 206#true, 93#L712-1true, Black: 184#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet12#1|), threadThread1of2ForFork0InUse, Black: 202#(= |threadThread1of2ForFork0_#t~nondet2| |#race~data~0|), threadThread2of2ForFork0InUse, 212#true]) [2023-11-29 00:01:52,409 INFO L294 olderBase$Statistics]: this new event has 166 ancestors and is cut-off event [2023-11-29 00:01:52,409 INFO L297 olderBase$Statistics]: existing Event has 166 ancestors and is cut-off event [2023-11-29 00:01:52,409 INFO L297 olderBase$Statistics]: existing Event has 166 ancestors and is cut-off event [2023-11-29 00:01:52,409 INFO L297 olderBase$Statistics]: existing Event has 159 ancestors and is cut-off event [2023-11-29 00:01:52,421 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([561] L695-->L695-1: Formula: (= |v_#race~threads_alive~0_10| 0) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_10|} AuxVars[] AssignedVars[#race~threads_alive~0][197], [Black: 190#(<= (+ ~threads_alive~0 1) 0), Black: 208#(= |threadThread1of2ForFork0_#t~nondet6| |#race~threads_alive~0|), 42#L697true, 74#L712-2true, Black: 176#true, 206#true, Black: 184#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet12#1|), threadThread1of2ForFork0InUse, Black: 202#(= |threadThread1of2ForFork0_#t~nondet2| |#race~data~0|), threadThread2of2ForFork0InUse, 89#L695-1true, 212#true]) [2023-11-29 00:01:52,421 INFO L294 olderBase$Statistics]: this new event has 168 ancestors and is cut-off event [2023-11-29 00:01:52,421 INFO L297 olderBase$Statistics]: existing Event has 161 ancestors and is cut-off event [2023-11-29 00:01:52,421 INFO L297 olderBase$Statistics]: existing Event has 168 ancestors and is cut-off event [2023-11-29 00:01:52,422 INFO L297 olderBase$Statistics]: existing Event has 161 ancestors and is cut-off event [2023-11-29 00:01:52,558 INFO L124 PetriNetUnfolderBase]: 2978/12011 cut-off events. [2023-11-29 00:01:52,558 INFO L125 PetriNetUnfolderBase]: For 5547/8840 co-relation queries the response was YES. [2023-11-29 00:01:52,587 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22344 conditions, 12011 events. 2978/12011 cut-off events. For 5547/8840 co-relation queries the response was YES. Maximal size of possible extension queue 524. Compared 142012 event pairs, 1401 based on Foata normal form. 24/10683 useless extension candidates. Maximal degree in co-relation 19299. Up to 2356 conditions per place. [2023-11-29 00:01:52,615 INFO L140 encePairwiseOnDemand]: 167/172 looper letters, 29 selfloop transitions, 6 changer transitions 0/220 dead transitions. [2023-11-29 00:01:52,615 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 185 places, 220 transitions, 820 flow [2023-11-29 00:01:52,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 00:01:52,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 00:01:52,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 477 transitions. [2023-11-29 00:01:52,618 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9244186046511628 [2023-11-29 00:01:52,618 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 477 transitions. [2023-11-29 00:01:52,618 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 477 transitions. [2023-11-29 00:01:52,618 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 00:01:52,619 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 477 transitions. [2023-11-29 00:01:52,620 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 159.0) internal successors, (477), 3 states have internal predecessors, (477), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:01:52,622 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 172.0) internal successors, (688), 4 states have internal predecessors, (688), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:01:52,622 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 172.0) internal successors, (688), 4 states have internal predecessors, (688), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:01:52,622 INFO L175 Difference]: Start difference. First operand has 183 places, 208 transitions, 720 flow. Second operand 3 states and 477 transitions. [2023-11-29 00:01:52,622 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 185 places, 220 transitions, 820 flow [2023-11-29 00:01:52,645 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 183 places, 220 transitions, 782 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 00:01:52,648 INFO L231 Difference]: Finished difference. Result has 185 places, 212 transitions, 730 flow [2023-11-29 00:01:52,649 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=172, PETRI_DIFFERENCE_MINUEND_FLOW=682, PETRI_DIFFERENCE_MINUEND_PLACES=181, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=208, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=202, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=730, PETRI_PLACES=185, PETRI_TRANSITIONS=212} [2023-11-29 00:01:52,649 INFO L281 CegarLoopForPetriNet]: 173 programPoint places, 12 predicate places. [2023-11-29 00:01:52,650 INFO L495 AbstractCegarLoop]: Abstraction has has 185 places, 212 transitions, 730 flow [2023-11-29 00:01:52,650 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 150.33333333333334) internal successors, (451), 3 states have internal predecessors, (451), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:01:52,650 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 00:01:52,650 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:01:52,651 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-11-29 00:01:52,651 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2023-11-29 00:01:52,651 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:01:52,651 INFO L85 PathProgramCache]: Analyzing trace with hash -1620341463, now seen corresponding path program 1 times [2023-11-29 00:01:52,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:01:52,651 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [214594905] [2023-11-29 00:01:52,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:01:52,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:01:52,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 00:01:52,676 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 00:01:52,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 00:01:52,704 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 00:01:52,704 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-29 00:01:52,705 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location threadErr0ASSERT_VIOLATIONDATA_RACE (14 of 15 remaining) [2023-11-29 00:01:52,705 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (13 of 15 remaining) [2023-11-29 00:01:52,705 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (12 of 15 remaining) [2023-11-29 00:01:52,706 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (11 of 15 remaining) [2023-11-29 00:01:52,706 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (10 of 15 remaining) [2023-11-29 00:01:52,706 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (9 of 15 remaining) [2023-11-29 00:01:52,706 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (8 of 15 remaining) [2023-11-29 00:01:52,706 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (7 of 15 remaining) [2023-11-29 00:01:52,707 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (6 of 15 remaining) [2023-11-29 00:01:52,707 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr2ASSERT_VIOLATIONDATA_RACE (5 of 15 remaining) [2023-11-29 00:01:52,707 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (4 of 15 remaining) [2023-11-29 00:01:52,707 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr2ASSERT_VIOLATIONDATA_RACE (3 of 15 remaining) [2023-11-29 00:01:52,707 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (2 of 15 remaining) [2023-11-29 00:01:52,708 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (1 of 15 remaining) [2023-11-29 00:01:52,708 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr2ASSERT_VIOLATIONDATA_RACE (0 of 15 remaining) [2023-11-29 00:01:52,708 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-11-29 00:01:52,708 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:01:52,713 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 2 thread instances [2023-11-29 00:01:52,713 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-29 00:01:52,768 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet8 could not be translated [2023-11-29 00:01:52,770 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre14 could not be translated [2023-11-29 00:01:52,771 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem16 could not be translated [2023-11-29 00:01:52,771 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem16 could not be translated [2023-11-29 00:01:52,772 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Expected StepInfo for loop construct to contain Condition, but it did not [2023-11-29 00:01:52,772 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Expected StepInfo for loop construct to contain Condition, but it did not [2023-11-29 00:01:52,772 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Expected StepInfo for loop construct to contain Condition, but it did not [2023-11-29 00:01:52,773 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet1 could not be translated [2023-11-29 00:01:52,773 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet2 could not be translated [2023-11-29 00:01:52,773 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet1 could not be translated [2023-11-29 00:01:52,774 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet2 could not be translated [2023-11-29 00:01:52,774 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet1 could not be translated [2023-11-29 00:01:52,774 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet2 could not be translated [2023-11-29 00:01:52,783 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.11 12:01:52 BasicIcfg [2023-11-29 00:01:52,784 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-29 00:01:52,784 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-29 00:01:52,784 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-29 00:01:52,784 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-29 00:01:52,785 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 12:01:39" (3/4) ... [2023-11-29 00:01:52,787 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-11-29 00:01:52,788 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-29 00:01:52,788 INFO L158 Benchmark]: Toolchain (without parser) took 14389.87ms. Allocated memory was 146.8MB in the beginning and 1.6GB in the end (delta: 1.4GB). Free memory was 114.8MB in the beginning and 684.0MB in the end (delta: -569.2MB). Peak memory consumption was 871.8MB. Max. memory is 16.1GB. [2023-11-29 00:01:52,788 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 119.5MB. Free memory is still 77.9MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-29 00:01:52,789 INFO L158 Benchmark]: CACSL2BoogieTranslator took 441.99ms. Allocated memory is still 146.8MB. Free memory was 114.8MB in the beginning and 94.5MB in the end (delta: 20.3MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2023-11-29 00:01:52,789 INFO L158 Benchmark]: Boogie Procedure Inliner took 46.53ms. Allocated memory is still 146.8MB. Free memory was 94.5MB in the beginning and 92.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-29 00:01:52,789 INFO L158 Benchmark]: Boogie Preprocessor took 31.77ms. Allocated memory is still 146.8MB. Free memory was 92.4MB in the beginning and 90.9MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. [2023-11-29 00:01:52,790 INFO L158 Benchmark]: RCFGBuilder took 443.53ms. Allocated memory is still 146.8MB. Free memory was 90.9MB in the beginning and 71.4MB in the end (delta: 19.5MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2023-11-29 00:01:52,790 INFO L158 Benchmark]: TraceAbstraction took 13415.77ms. Allocated memory was 146.8MB in the beginning and 1.6GB in the end (delta: 1.4GB). Free memory was 70.2MB in the beginning and 684.0MB in the end (delta: -613.7MB). Peak memory consumption was 827.7MB. Max. memory is 16.1GB. [2023-11-29 00:01:52,790 INFO L158 Benchmark]: Witness Printer took 3.55ms. Allocated memory is still 1.6GB. Free memory is still 684.0MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-29 00:01:52,792 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16ms. Allocated memory is still 119.5MB. Free memory is still 77.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 441.99ms. Allocated memory is still 146.8MB. Free memory was 114.8MB in the beginning and 94.5MB in the end (delta: 20.3MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 46.53ms. Allocated memory is still 146.8MB. Free memory was 94.5MB in the beginning and 92.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 31.77ms. Allocated memory is still 146.8MB. Free memory was 92.4MB in the beginning and 90.9MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 443.53ms. Allocated memory is still 146.8MB. Free memory was 90.9MB in the beginning and 71.4MB in the end (delta: 19.5MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * TraceAbstraction took 13415.77ms. Allocated memory was 146.8MB in the beginning and 1.6GB in the end (delta: 1.4GB). Free memory was 70.2MB in the beginning and 684.0MB in the end (delta: -613.7MB). Peak memory consumption was 827.7MB. Max. memory is 16.1GB. * Witness Printer took 3.55ms. Allocated memory is still 1.6GB. Free memory is still 684.0MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet8 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre14 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem16 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem16 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expected StepInfo for loop construct to contain Condition, but it did not - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expected StepInfo for loop construct to contain Condition, but it did not - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expected StepInfo for loop construct to contain Condition, but it did not - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet1 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet2 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet1 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet2 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet1 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet2 could not be translated - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - DataRaceFoundResult [Line: 692]: Data race detected [2023-11-29 00:01:52,820 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet8 could not be translated [2023-11-29 00:01:52,821 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre14 could not be translated [2023-11-29 00:01:52,822 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem16 could not be translated [2023-11-29 00:01:52,822 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem16 could not be translated [2023-11-29 00:01:52,823 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Expected StepInfo for loop construct to contain Condition, but it did not [2023-11-29 00:01:52,823 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Expected StepInfo for loop construct to contain Condition, but it did not [2023-11-29 00:01:52,823 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Expected StepInfo for loop construct to contain Condition, but it did not [2023-11-29 00:01:52,823 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet1 could not be translated [2023-11-29 00:01:52,824 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet2 could not be translated [2023-11-29 00:01:52,824 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet1 could not be translated [2023-11-29 00:01:52,824 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet2 could not be translated [2023-11-29 00:01:52,824 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet1 could not be translated [2023-11-29 00:01:52,825 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet2 could not be translated [2023-11-29 00:01:52,846 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet8 could not be translated [2023-11-29 00:01:52,847 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre14 could not be translated [2023-11-29 00:01:52,847 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem16 could not be translated [2023-11-29 00:01:52,847 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem16 could not be translated [2023-11-29 00:01:52,848 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Expected StepInfo for loop construct to contain Condition, but it did not [2023-11-29 00:01:52,848 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Expected StepInfo for loop construct to contain Condition, but it did not [2023-11-29 00:01:52,848 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Expected StepInfo for loop construct to contain Condition, but it did not [2023-11-29 00:01:52,849 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet1 could not be translated [2023-11-29 00:01:52,849 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet2 could not be translated [2023-11-29 00:01:52,849 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet1 could not be translated [2023-11-29 00:01:52,849 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet2 could not be translated [2023-11-29 00:01:52,850 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet1 could not be translated [2023-11-29 00:01:52,850 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet2 could not be translated Data race detected The following path leads to a data race: [L685] 0 int threads_alive = -1; VAL [threads_alive=-1] [L686] 0 pthread_mutex_t threads_alive_mutex = { { 0, 0, 0, PTHREAD_MUTEX_TIMED_NP, 0, { { 0, 0 } } } }; VAL [threads_alive=-1, threads_alive_mutex={1:0}] [L687] 0 pthread_cond_t threads_alive_cond = { { {0}, {0}, {0, 0}, {0, 0}, 0, 0, {0, 0} } }; VAL [threads_alive=-1, threads_alive_cond={2:0}, threads_alive_mutex={1:0}] [L688] 0 int data = 0; VAL [data=0, threads_alive=-1, threads_alive_cond={2:0}, threads_alive_mutex={1:0}] [L689] 0 pthread_mutex_t data_mutex = { { 0, 0, 0, PTHREAD_MUTEX_TIMED_NP, 0, { { 0, 0 } } } }; VAL [data=0, data_mutex={3:0}, threads_alive=-1, threads_alive_cond={2:0}, threads_alive_mutex={1:0}] [L701] 0 int threads_total = __VERIFIER_nondet_int(); VAL [data=0, data_mutex={3:0}, threads_alive=-1, threads_alive_cond={2:0}, threads_alive_mutex={1:0}, threads_total=1] [L702] CALL 0 assume_abort_if_not(threads_total >= 0) [L682] COND FALSE 0 !(!cond) VAL [\old(cond)=1, cond=1, data=0, data_mutex={3:0}, threads_alive=-1, threads_alive_cond={2:0}, threads_alive_mutex={1:0}] [L702] RET 0 assume_abort_if_not(threads_total >= 0) [L703] 0 int i = 0; VAL [data=0, data_mutex={3:0}, i=0, threads_alive=-1, threads_alive_cond={2:0}, threads_alive_mutex={1:0}, threads_total=1] [L703] COND TRUE 0 i < threads_total VAL [data=0, data_mutex={3:0}, i=0, threads_alive=-1, threads_alive_cond={2:0}, threads_alive_mutex={1:0}, threads_total=1] [L705] 0 threads_alive++ VAL [data=0, data_mutex={3:0}, i=0, threads_alive=0, threads_alive_cond={2:0}, threads_alive_mutex={1:0}, threads_total=1] [L707] 0 pthread_t tid; VAL [data=0, data_mutex={3:0}, i=0, threads_alive=0, threads_alive_cond={2:0}, threads_alive_mutex={1:0}, threads_total=1, tid={5:0}] [L708] FCALL, FORK 0 pthread_create(&tid, ((void *)0), &thread, ((void *)0)) VAL [arg={0:0}, data=0, data_mutex={3:0}, i=0, threads_alive=0, threads_alive_cond={2:0}, threads_alive_mutex={1:0}, threads_total=1, tid={5:0}] [L709] EXPR 0 \read(tid) VAL [arg={0:0}, data=0, data_mutex={3:0}, i=0, threads_alive=0, threads_alive_cond={2:0}, threads_alive_mutex={1:0}, threads_total=1, tid={5:0}] [L709] 0 pthread_detach(tid) VAL [arg={0:0}, data=0, data_mutex={3:0}, i=0, threads_alive=0, threads_alive_cond={2:0}, threads_alive_mutex={1:0}, threads_total=1, tid={5:0}] [L703] 0 i++ VAL [arg={0:0}, data=0, data_mutex={3:0}, i=1, threads_alive=0, threads_alive_cond={2:0}, threads_alive_mutex={1:0}, threads_total=1, tid={5:0}] [L703] COND FALSE 0 !(i < threads_total) VAL [arg={0:0}, data=0, data_mutex={3:0}, i=1, threads_alive=0, threads_alive_cond={2:0}, threads_alive_mutex={1:0}, threads_total=1] [L712] COND FALSE 0 !(\read(threads_alive)) VAL [arg={0:0}, data=0, data_mutex={3:0}, threads_alive=0, threads_alive_cond={2:0}, threads_alive_mutex={1:0}, threads_total=1] [L692] 1 data = __VERIFIER_nondet_int() VAL [arg={0:0}, arg={0:0}, data=0, data_mutex={3:0}, threads_alive=0, threads_alive_cond={2:0}, threads_alive_mutex={1:0}] [L715] 0 return data; VAL [arg={0:0}, arg={0:0}, data=0, data_mutex={3:0}, threads_alive=0, threads_alive_cond={2:0}, threads_alive_mutex={1:0}, threads_total=1] [L692] 1 data = __VERIFIER_nondet_int() VAL [arg={0:0}, arg={0:0}, data=0, data_mutex={3:0}, threads_alive=0, threads_alive_cond={2:0}, threads_alive_mutex={1:0}] Now there is a data race on ~data~0 between C: return data; [715] and C: data = __VERIFIER_nondet_int() [692] - UnprovableResult [Line: 705]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 712]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 715]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 705]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 709]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 708]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 695]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 695]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 3 procedures, 169 locations, 12 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 2.8s, OverallIterations: 8, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 206 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 98 mSDsluCounter, 47 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 19 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 362 IncrementalHoareTripleChecker+Invalid, 381 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 19 mSolverCounterUnsat, 47 mSDtfsCounter, 362 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 19 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=490occurred in iteration=6, InterpolantAutomatonStates: 24, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 568 NumberOfCodeBlocks, 568 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 463 ConstructedInterpolants, 0 QuantifiedInterpolants, 742 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 PerfectInterpolantSequences, 1/1 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data with 2 thread instances CFG has 4 procedures, 201 locations, 15 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 10.5s, OverallIterations: 8, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 9.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 317 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 149 mSDsluCounter, 81 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 19 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 546 IncrementalHoareTripleChecker+Invalid, 565 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 19 mSolverCounterUnsat, 81 mSDtfsCounter, 546 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 19 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=730occurred in iteration=7, InterpolantAutomatonStates: 24, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 568 NumberOfCodeBlocks, 568 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 463 ConstructedInterpolants, 0 QuantifiedInterpolants, 742 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 PerfectInterpolantSequences, 1/1 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2023-11-29 00:01:52,864 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93a8f88d-684c-4c00-8a0f-548996e42739/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE