./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-data-race.prp --file ../../sv-benchmarks/c/pthread-race-challenges/thread-join-array-const-race-3.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 527bcce2 Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3cfb2781-b003-41b5-9a20-f8b9d4ddb3cd/bin/uautomizer-verify-bycVGegfSx/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3cfb2781-b003-41b5-9a20-f8b9d4ddb3cd/bin/uautomizer-verify-bycVGegfSx/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3cfb2781-b003-41b5-9a20-f8b9d4ddb3cd/bin/uautomizer-verify-bycVGegfSx/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3cfb2781-b003-41b5-9a20-f8b9d4ddb3cd/bin/uautomizer-verify-bycVGegfSx/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-race-challenges/thread-join-array-const-race-3.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3cfb2781-b003-41b5-9a20-f8b9d4ddb3cd/bin/uautomizer-verify-bycVGegfSx/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3cfb2781-b003-41b5-9a20-f8b9d4ddb3cd/bin/uautomizer-verify-bycVGegfSx --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 fa0ecdfec37b7bd940900ff854c772fdadeb6c6111223868a85a6141c0a777e6 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-527bcce [2023-11-21 22:27:14,270 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-21 22:27:14,384 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3cfb2781-b003-41b5-9a20-f8b9d4ddb3cd/bin/uautomizer-verify-bycVGegfSx/config/svcomp-DataRace-32bit-Automizer_Default.epf [2023-11-21 22:27:14,391 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-21 22:27:14,392 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-21 22:27:14,429 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-21 22:27:14,430 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-21 22:27:14,431 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-21 22:27:14,432 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-21 22:27:14,437 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-21 22:27:14,439 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-21 22:27:14,439 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-21 22:27:14,440 INFO L153 SettingsManager]: * Use SBE=true [2023-11-21 22:27:14,442 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-21 22:27:14,442 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-21 22:27:14,443 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-21 22:27:14,443 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-21 22:27:14,444 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-21 22:27:14,444 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-21 22:27:14,445 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-21 22:27:14,445 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-21 22:27:14,446 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-21 22:27:14,446 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2023-11-21 22:27:14,447 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-21 22:27:14,447 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-21 22:27:14,448 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-21 22:27:14,448 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-21 22:27:14,449 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-21 22:27:14,450 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-21 22:27:14,450 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-21 22:27:14,452 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-21 22:27:14,452 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-21 22:27:14,453 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-21 22:27:14,453 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-21 22:27:14,453 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-21 22:27:14,454 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-21 22:27:14,454 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-21 22:27:14,454 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-21 22:27:14,455 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-21 22:27:14,455 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-21 22:27:14,455 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-21 22:27:14,456 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_3cfb2781-b003-41b5-9a20-f8b9d4ddb3cd/bin/uautomizer-verify-bycVGegfSx/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_3cfb2781-b003-41b5-9a20-f8b9d4ddb3cd/bin/uautomizer-verify-bycVGegfSx 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 -> fa0ecdfec37b7bd940900ff854c772fdadeb6c6111223868a85a6141c0a777e6 [2023-11-21 22:27:14,800 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-21 22:27:14,826 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-21 22:27:14,830 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-21 22:27:14,832 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-21 22:27:14,833 INFO L274 PluginConnector]: CDTParser initialized [2023-11-21 22:27:14,834 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3cfb2781-b003-41b5-9a20-f8b9d4ddb3cd/bin/uautomizer-verify-bycVGegfSx/../../sv-benchmarks/c/pthread-race-challenges/thread-join-array-const-race-3.i [2023-11-21 22:27:17,986 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-21 22:27:18,342 INFO L384 CDTParser]: Found 1 translation units. [2023-11-21 22:27:18,343 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3cfb2781-b003-41b5-9a20-f8b9d4ddb3cd/sv-benchmarks/c/pthread-race-challenges/thread-join-array-const-race-3.i [2023-11-21 22:27:18,364 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3cfb2781-b003-41b5-9a20-f8b9d4ddb3cd/bin/uautomizer-verify-bycVGegfSx/data/a245a422d/b51ea995891540298aa056fbcecdbd84/FLAG0f2796807 [2023-11-21 22:27:18,380 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3cfb2781-b003-41b5-9a20-f8b9d4ddb3cd/bin/uautomizer-verify-bycVGegfSx/data/a245a422d/b51ea995891540298aa056fbcecdbd84 [2023-11-21 22:27:18,382 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-21 22:27:18,384 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-21 22:27:18,386 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-21 22:27:18,386 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-21 22:27:18,394 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-21 22:27:18,396 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 10:27:18" (1/1) ... [2023-11-21 22:27:18,397 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1067aa5f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:27:18, skipping insertion in model container [2023-11-21 22:27:18,398 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 10:27:18" (1/1) ... [2023-11-21 22:27:18,454 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-21 22:27:18,843 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-21 22:27:18,865 INFO L202 MainTranslator]: Completed pre-run [2023-11-21 22:27:18,935 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-21 22:27:19,003 INFO L206 MainTranslator]: Completed translation [2023-11-21 22:27:19,004 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:27:19 WrapperNode [2023-11-21 22:27:19,004 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-21 22:27:19,006 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-21 22:27:19,006 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-21 22:27:19,006 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-21 22:27:19,015 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:27:19" (1/1) ... [2023-11-21 22:27:19,050 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:27:19" (1/1) ... [2023-11-21 22:27:19,084 INFO L138 Inliner]: procedures = 158, calls = 18, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 60 [2023-11-21 22:27:19,084 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-21 22:27:19,087 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-21 22:27:19,088 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-21 22:27:19,088 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-21 22:27:19,105 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:27:19" (1/1) ... [2023-11-21 22:27:19,105 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:27:19" (1/1) ... [2023-11-21 22:27:19,108 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:27:19" (1/1) ... [2023-11-21 22:27:19,109 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:27:19" (1/1) ... [2023-11-21 22:27:19,122 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:27:19" (1/1) ... [2023-11-21 22:27:19,126 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:27:19" (1/1) ... [2023-11-21 22:27:19,128 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:27:19" (1/1) ... [2023-11-21 22:27:19,131 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:27:19" (1/1) ... [2023-11-21 22:27:19,134 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-21 22:27:19,135 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-21 22:27:19,135 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-21 22:27:19,135 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-21 22:27:19,136 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:27:19" (1/1) ... [2023-11-21 22:27:19,141 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-21 22:27:19,158 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3cfb2781-b003-41b5-9a20-f8b9d4ddb3cd/bin/uautomizer-verify-bycVGegfSx/z3 [2023-11-21 22:27:19,171 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3cfb2781-b003-41b5-9a20-f8b9d4ddb3cd/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-21 22:27:19,205 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3cfb2781-b003-41b5-9a20-f8b9d4ddb3cd/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-21 22:27:19,216 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-21 22:27:19,216 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-21 22:27:19,217 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2023-11-21 22:27:19,217 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-21 22:27:19,217 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-21 22:27:19,217 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-21 22:27:19,217 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-21 22:27:19,218 INFO L130 BoogieDeclarations]: Found specification of procedure thread [2023-11-21 22:27:19,218 INFO L138 BoogieDeclarations]: Found implementation of procedure thread [2023-11-21 22:27:19,218 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2023-11-21 22:27:19,218 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-21 22:27:19,218 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-21 22:27:19,219 WARN L212 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-21 22:27:19,369 INFO L240 CfgBuilder]: Building ICFG [2023-11-21 22:27:19,373 INFO L266 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-21 22:27:19,620 INFO L281 CfgBuilder]: Performing block encoding [2023-11-21 22:27:19,655 INFO L303 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-21 22:27:19,656 INFO L308 CfgBuilder]: Removed 2 assume(true) statements. [2023-11-21 22:27:19,657 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 10:27:19 BoogieIcfgContainer [2023-11-21 22:27:19,658 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-21 22:27:19,660 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-21 22:27:19,660 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-21 22:27:19,664 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-21 22:27:19,665 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.11 10:27:18" (1/3) ... [2023-11-21 22:27:19,666 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@494bef0c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 10:27:19, skipping insertion in model container [2023-11-21 22:27:19,666 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:27:19" (2/3) ... [2023-11-21 22:27:19,667 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@494bef0c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 10:27:19, skipping insertion in model container [2023-11-21 22:27:19,667 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 10:27:19" (3/3) ... [2023-11-21 22:27:19,669 INFO L112 eAbstractionObserver]: Analyzing ICFG thread-join-array-const-race-3.i [2023-11-21 22:27:19,678 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-11-21 22:27:19,687 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-21 22:27:19,687 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2023-11-21 22:27:19,687 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-21 22:27:19,762 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2023-11-21 22:27:19,801 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 97 places, 95 transitions, 204 flow [2023-11-21 22:27:19,885 INFO L124 PetriNetUnfolderBase]: 8/194 cut-off events. [2023-11-21 22:27:19,885 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2023-11-21 22:27:19,892 INFO L83 FinitePrefix]: Finished finitePrefix Result has 207 conditions, 194 events. 8/194 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 550 event pairs, 0 based on Foata normal form. 0/171 useless extension candidates. Maximal degree in co-relation 99. Up to 8 conditions per place. [2023-11-21 22:27:19,892 INFO L82 GeneralOperation]: Start removeDead. Operand has 97 places, 95 transitions, 204 flow [2023-11-21 22:27:19,898 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 96 places, 94 transitions, 201 flow [2023-11-21 22:27:19,909 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-21 22:27:19,916 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;@1d3f373c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-21 22:27:19,917 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2023-11-21 22:27:19,937 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-21 22:27:19,938 INFO L124 PetriNetUnfolderBase]: 3/65 cut-off events. [2023-11-21 22:27:19,938 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-21 22:27:19,938 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-21 22:27:19,939 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] [2023-11-21 22:27:19,939 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-21 22:27:19,954 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:27:19,955 INFO L85 PathProgramCache]: Analyzing trace with hash 1347678120, now seen corresponding path program 1 times [2023-11-21 22:27:19,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:27:19,966 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [50108977] [2023-11-21 22:27:19,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:27:19,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:27:20,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:27:20,375 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-21 22:27:20,376 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:27:20,376 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [50108977] [2023-11-21 22:27:20,377 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [50108977] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 22:27:20,377 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 22:27:20,377 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-21 22:27:20,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1395578595] [2023-11-21 22:27:20,380 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 22:27:20,390 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-21 22:27:20,397 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:27:20,425 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-21 22:27:20,426 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-21 22:27:20,463 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 78 out of 95 [2023-11-21 22:27:20,466 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 94 transitions, 201 flow. Second operand has 4 states, 4 states have (on average 79.5) internal successors, (318), 4 states have internal predecessors, (318), 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-21 22:27:20,467 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-21 22:27:20,467 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 78 of 95 [2023-11-21 22:27:20,468 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-21 22:27:20,635 INFO L124 PetriNetUnfolderBase]: 33/373 cut-off events. [2023-11-21 22:27:20,636 INFO L125 PetriNetUnfolderBase]: For 28/28 co-relation queries the response was YES. [2023-11-21 22:27:20,642 INFO L83 FinitePrefix]: Finished finitePrefix Result has 473 conditions, 373 events. 33/373 cut-off events. For 28/28 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1662 event pairs, 9 based on Foata normal form. 13/348 useless extension candidates. Maximal degree in co-relation 351. Up to 43 conditions per place. [2023-11-21 22:27:20,646 INFO L140 encePairwiseOnDemand]: 88/95 looper letters, 17 selfloop transitions, 4 changer transitions 0/98 dead transitions. [2023-11-21 22:27:20,647 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 98 transitions, 251 flow [2023-11-21 22:27:20,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-21 22:27:20,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-21 22:27:20,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 337 transitions. [2023-11-21 22:27:20,687 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8868421052631579 [2023-11-21 22:27:20,690 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 337 transitions. [2023-11-21 22:27:20,690 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 337 transitions. [2023-11-21 22:27:20,694 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-21 22:27:20,697 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 337 transitions. [2023-11-21 22:27:20,706 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 84.25) internal successors, (337), 4 states have internal predecessors, (337), 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-21 22:27:20,711 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 95.0) internal successors, (475), 5 states have internal predecessors, (475), 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-21 22:27:20,712 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 95.0) internal successors, (475), 5 states have internal predecessors, (475), 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-21 22:27:20,714 INFO L175 Difference]: Start difference. First operand has 96 places, 94 transitions, 201 flow. Second operand 4 states and 337 transitions. [2023-11-21 22:27:20,715 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 98 transitions, 251 flow [2023-11-21 22:27:20,719 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 98 transitions, 247 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-21 22:27:20,725 INFO L231 Difference]: Finished difference. Result has 98 places, 92 transitions, 205 flow [2023-11-21 22:27:20,728 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=95, PETRI_DIFFERENCE_MINUEND_FLOW=193, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=92, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=205, PETRI_PLACES=98, PETRI_TRANSITIONS=92} [2023-11-21 22:27:20,734 INFO L281 CegarLoopForPetriNet]: 96 programPoint places, 2 predicate places. [2023-11-21 22:27:20,735 INFO L495 AbstractCegarLoop]: Abstraction has has 98 places, 92 transitions, 205 flow [2023-11-21 22:27:20,735 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 79.5) internal successors, (318), 4 states have internal predecessors, (318), 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-21 22:27:20,736 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-21 22:27:20,736 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] [2023-11-21 22:27:20,737 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-21 22:27:20,737 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-21 22:27:20,738 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:27:20,739 INFO L85 PathProgramCache]: Analyzing trace with hash -428281827, now seen corresponding path program 1 times [2023-11-21 22:27:20,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:27:20,739 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [502939656] [2023-11-21 22:27:20,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:27:20,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:27:20,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:27:20,883 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-21 22:27:20,886 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:27:20,887 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [502939656] [2023-11-21 22:27:20,887 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [502939656] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 22:27:20,887 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 22:27:20,887 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-21 22:27:20,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1215650317] [2023-11-21 22:27:20,888 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 22:27:20,889 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-21 22:27:20,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:27:20,890 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-21 22:27:20,891 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-21 22:27:20,910 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 78 out of 95 [2023-11-21 22:27:20,911 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 92 transitions, 205 flow. Second operand has 3 states, 3 states have (on average 79.66666666666667) internal successors, (239), 3 states have internal predecessors, (239), 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-21 22:27:20,912 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-21 22:27:20,912 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 78 of 95 [2023-11-21 22:27:20,912 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-21 22:27:21,045 INFO L124 PetriNetUnfolderBase]: 112/655 cut-off events. [2023-11-21 22:27:21,046 INFO L125 PetriNetUnfolderBase]: For 28/28 co-relation queries the response was YES. [2023-11-21 22:27:21,049 INFO L83 FinitePrefix]: Finished finitePrefix Result has 915 conditions, 655 events. 112/655 cut-off events. For 28/28 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 4005 event pairs, 77 based on Foata normal form. 0/589 useless extension candidates. Maximal degree in co-relation 871. Up to 182 conditions per place. [2023-11-21 22:27:21,053 INFO L140 encePairwiseOnDemand]: 89/95 looper letters, 18 selfloop transitions, 5 changer transitions 0/100 dead transitions. [2023-11-21 22:27:21,054 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 100 transitions, 269 flow [2023-11-21 22:27:21,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-21 22:27:21,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-21 22:27:21,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 258 transitions. [2023-11-21 22:27:21,056 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9052631578947369 [2023-11-21 22:27:21,056 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 258 transitions. [2023-11-21 22:27:21,056 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 258 transitions. [2023-11-21 22:27:21,057 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-21 22:27:21,057 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 258 transitions. [2023-11-21 22:27:21,058 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 86.0) internal successors, (258), 3 states have internal predecessors, (258), 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-21 22:27:21,060 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 95.0) internal successors, (380), 4 states have internal predecessors, (380), 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-21 22:27:21,061 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 95.0) internal successors, (380), 4 states have internal predecessors, (380), 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-21 22:27:21,061 INFO L175 Difference]: Start difference. First operand has 98 places, 92 transitions, 205 flow. Second operand 3 states and 258 transitions. [2023-11-21 22:27:21,061 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 100 transitions, 269 flow [2023-11-21 22:27:21,064 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 100 transitions, 261 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-11-21 22:27:21,066 INFO L231 Difference]: Finished difference. Result has 99 places, 96 transitions, 235 flow [2023-11-21 22:27:21,067 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=95, PETRI_DIFFERENCE_MINUEND_FLOW=197, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=92, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=235, PETRI_PLACES=99, PETRI_TRANSITIONS=96} [2023-11-21 22:27:21,068 INFO L281 CegarLoopForPetriNet]: 96 programPoint places, 3 predicate places. [2023-11-21 22:27:21,068 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 96 transitions, 235 flow [2023-11-21 22:27:21,069 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 79.66666666666667) internal successors, (239), 3 states have internal predecessors, (239), 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-21 22:27:21,069 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-21 22:27:21,069 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-21 22:27:21,070 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-21 22:27:21,072 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-21 22:27:21,075 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:27:21,076 INFO L85 PathProgramCache]: Analyzing trace with hash 1219669538, now seen corresponding path program 1 times [2023-11-21 22:27:21,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:27:21,077 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [851247324] [2023-11-21 22:27:21,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:27:21,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:27:21,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-21 22:27:21,119 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-21 22:27:21,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-21 22:27:21,157 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-21 22:27:21,160 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-21 22:27:21,161 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (6 of 7 remaining) [2023-11-21 22:27:21,163 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (5 of 7 remaining) [2023-11-21 22:27:21,164 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (4 of 7 remaining) [2023-11-21 22:27:21,164 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2023-11-21 22:27:21,164 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (2 of 7 remaining) [2023-11-21 22:27:21,164 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (1 of 7 remaining) [2023-11-21 22:27:21,165 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (0 of 7 remaining) [2023-11-21 22:27:21,165 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-21 22:27:21,165 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2023-11-21 22:27:21,168 WARN L233 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2023-11-21 22:27:21,168 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2023-11-21 22:27:21,211 INFO L144 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2023-11-21 22:27:21,215 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 135 places, 131 transitions, 294 flow [2023-11-21 22:27:21,270 INFO L124 PetriNetUnfolderBase]: 18/350 cut-off events. [2023-11-21 22:27:21,270 INFO L125 PetriNetUnfolderBase]: For 14/14 co-relation queries the response was YES. [2023-11-21 22:27:21,272 INFO L83 FinitePrefix]: Finished finitePrefix Result has 378 conditions, 350 events. 18/350 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 1257 event pairs, 1 based on Foata normal form. 0/307 useless extension candidates. Maximal degree in co-relation 373. Up to 16 conditions per place. [2023-11-21 22:27:21,272 INFO L82 GeneralOperation]: Start removeDead. Operand has 135 places, 131 transitions, 294 flow [2023-11-21 22:27:21,275 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 115 places, 112 transitions, 246 flow [2023-11-21 22:27:21,276 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-21 22:27:21,278 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;@1d3f373c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-21 22:27:21,278 INFO L358 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2023-11-21 22:27:21,286 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-21 22:27:21,286 INFO L124 PetriNetUnfolderBase]: 3/64 cut-off events. [2023-11-21 22:27:21,287 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-21 22:27:21,287 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-21 22:27:21,287 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] [2023-11-21 22:27:21,287 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2023-11-21 22:27:21,288 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:27:21,288 INFO L85 PathProgramCache]: Analyzing trace with hash 480846600, now seen corresponding path program 1 times [2023-11-21 22:27:21,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:27:21,289 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1783611824] [2023-11-21 22:27:21,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:27:21,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:27:21,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:27:21,454 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-21 22:27:21,454 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:27:21,455 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1783611824] [2023-11-21 22:27:21,455 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1783611824] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 22:27:21,455 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 22:27:21,456 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-21 22:27:21,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [512825639] [2023-11-21 22:27:21,457 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 22:27:21,458 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-21 22:27:21,459 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:27:21,459 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-21 22:27:21,460 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-21 22:27:21,495 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 131 [2023-11-21 22:27:21,496 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 112 transitions, 246 flow. Second operand has 4 states, 4 states have (on average 107.5) internal successors, (430), 4 states have internal predecessors, (430), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:27:21,496 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-21 22:27:21,496 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 131 [2023-11-21 22:27:21,497 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-21 22:27:21,880 INFO L124 PetriNetUnfolderBase]: 253/1567 cut-off events. [2023-11-21 22:27:21,880 INFO L125 PetriNetUnfolderBase]: For 184/184 co-relation queries the response was YES. [2023-11-21 22:27:21,888 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2098 conditions, 1567 events. 253/1567 cut-off events. For 184/184 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 12104 event pairs, 101 based on Foata normal form. 55/1467 useless extension candidates. Maximal degree in co-relation 594. Up to 267 conditions per place. [2023-11-21 22:27:21,900 INFO L140 encePairwiseOnDemand]: 124/131 looper letters, 24 selfloop transitions, 4 changer transitions 0/119 dead transitions. [2023-11-21 22:27:21,900 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 119 transitions, 316 flow [2023-11-21 22:27:21,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-21 22:27:21,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-21 22:27:21,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 456 transitions. [2023-11-21 22:27:21,903 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8702290076335878 [2023-11-21 22:27:21,904 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 456 transitions. [2023-11-21 22:27:21,904 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 456 transitions. [2023-11-21 22:27:21,906 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-21 22:27:21,906 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 456 transitions. [2023-11-21 22:27:21,908 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 114.0) internal successors, (456), 4 states have internal predecessors, (456), 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-21 22:27:21,911 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 131.0) internal successors, (655), 5 states have internal predecessors, (655), 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-21 22:27:21,912 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 131.0) internal successors, (655), 5 states have internal predecessors, (655), 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-21 22:27:21,912 INFO L175 Difference]: Start difference. First operand has 115 places, 112 transitions, 246 flow. Second operand 4 states and 456 transitions. [2023-11-21 22:27:21,912 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 118 places, 119 transitions, 316 flow [2023-11-21 22:27:21,917 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 116 places, 119 transitions, 312 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-21 22:27:21,921 INFO L231 Difference]: Finished difference. Result has 117 places, 111 transitions, 254 flow [2023-11-21 22:27:21,922 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=131, PETRI_DIFFERENCE_MINUEND_FLOW=238, PETRI_DIFFERENCE_MINUEND_PLACES=113, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=110, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=106, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=254, PETRI_PLACES=117, PETRI_TRANSITIONS=111} [2023-11-21 22:27:21,925 INFO L281 CegarLoopForPetriNet]: 115 programPoint places, 2 predicate places. [2023-11-21 22:27:21,925 INFO L495 AbstractCegarLoop]: Abstraction has has 117 places, 111 transitions, 254 flow [2023-11-21 22:27:21,926 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 107.5) internal successors, (430), 4 states have internal predecessors, (430), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:27:21,926 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-21 22:27:21,926 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] [2023-11-21 22:27:21,926 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-21 22:27:21,927 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2023-11-21 22:27:21,927 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:27:21,928 INFO L85 PathProgramCache]: Analyzing trace with hash 1824515582, now seen corresponding path program 1 times [2023-11-21 22:27:21,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:27:21,928 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [40404127] [2023-11-21 22:27:21,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:27:21,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:27:21,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:27:22,014 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-21 22:27:22,015 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:27:22,015 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [40404127] [2023-11-21 22:27:22,015 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [40404127] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 22:27:22,015 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 22:27:22,015 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-21 22:27:22,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1224981015] [2023-11-21 22:27:22,016 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 22:27:22,017 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-21 22:27:22,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:27:22,018 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-21 22:27:22,018 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-21 22:27:22,055 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 131 [2023-11-21 22:27:22,056 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 111 transitions, 254 flow. Second operand has 3 states, 3 states have (on average 105.66666666666667) internal successors, (317), 3 states have internal predecessors, (317), 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-21 22:27:22,056 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-21 22:27:22,057 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 131 [2023-11-21 22:27:22,057 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-21 22:27:22,782 INFO L124 PetriNetUnfolderBase]: 1069/4222 cut-off events. [2023-11-21 22:27:22,782 INFO L125 PetriNetUnfolderBase]: For 342/398 co-relation queries the response was YES. [2023-11-21 22:27:22,801 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6099 conditions, 4222 events. 1069/4222 cut-off events. For 342/398 co-relation queries the response was YES. Maximal size of possible extension queue 172. Compared 40365 event pairs, 597 based on Foata normal form. 2/3714 useless extension candidates. Maximal degree in co-relation 5960. Up to 1391 conditions per place. [2023-11-21 22:27:22,829 INFO L140 encePairwiseOnDemand]: 124/131 looper letters, 27 selfloop transitions, 6 changer transitions 0/124 dead transitions. [2023-11-21 22:27:22,829 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 124 transitions, 356 flow [2023-11-21 22:27:22,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-21 22:27:22,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-21 22:27:22,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 346 transitions. [2023-11-21 22:27:22,831 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8804071246819338 [2023-11-21 22:27:22,832 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 346 transitions. [2023-11-21 22:27:22,832 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 346 transitions. [2023-11-21 22:27:22,832 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-21 22:27:22,832 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 346 transitions. [2023-11-21 22:27:22,834 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 115.33333333333333) internal successors, (346), 3 states have internal predecessors, (346), 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-21 22:27:22,835 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 131.0) internal successors, (524), 4 states have internal predecessors, (524), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:27:22,836 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 131.0) internal successors, (524), 4 states have internal predecessors, (524), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:27:22,836 INFO L175 Difference]: Start difference. First operand has 117 places, 111 transitions, 254 flow. Second operand 3 states and 346 transitions. [2023-11-21 22:27:22,836 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 124 transitions, 356 flow [2023-11-21 22:27:22,839 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 124 transitions, 350 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-21 22:27:22,842 INFO L231 Difference]: Finished difference. Result has 119 places, 116 transitions, 294 flow [2023-11-21 22:27:22,843 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=131, PETRI_DIFFERENCE_MINUEND_FLOW=248, PETRI_DIFFERENCE_MINUEND_PLACES=115, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=111, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=105, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=294, PETRI_PLACES=119, PETRI_TRANSITIONS=116} [2023-11-21 22:27:22,844 INFO L281 CegarLoopForPetriNet]: 115 programPoint places, 4 predicate places. [2023-11-21 22:27:22,844 INFO L495 AbstractCegarLoop]: Abstraction has has 119 places, 116 transitions, 294 flow [2023-11-21 22:27:22,845 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 105.66666666666667) internal successors, (317), 3 states have internal predecessors, (317), 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-21 22:27:22,845 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-21 22:27:22,845 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-21 22:27:22,846 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-21 22:27:22,846 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2023-11-21 22:27:22,846 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:27:22,847 INFO L85 PathProgramCache]: Analyzing trace with hash -201902399, now seen corresponding path program 1 times [2023-11-21 22:27:22,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:27:22,847 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [801289276] [2023-11-21 22:27:22,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:27:22,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:27:22,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:27:22,978 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-21 22:27:22,978 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:27:22,978 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [801289276] [2023-11-21 22:27:22,978 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [801289276] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 22:27:22,979 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 22:27:22,979 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-21 22:27:22,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1738913570] [2023-11-21 22:27:22,979 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 22:27:22,980 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-21 22:27:22,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:27:22,982 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-21 22:27:22,982 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-21 22:27:23,020 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 131 [2023-11-21 22:27:23,021 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 116 transitions, 294 flow. Second operand has 4 states, 4 states have (on average 107.75) internal successors, (431), 4 states have internal predecessors, (431), 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-21 22:27:23,021 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-21 22:27:23,021 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 131 [2023-11-21 22:27:23,021 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-21 22:27:23,648 INFO L124 PetriNetUnfolderBase]: 624/3294 cut-off events. [2023-11-21 22:27:23,648 INFO L125 PetriNetUnfolderBase]: For 284/288 co-relation queries the response was YES. [2023-11-21 22:27:23,663 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4766 conditions, 3294 events. 624/3294 cut-off events. For 284/288 co-relation queries the response was YES. Maximal size of possible extension queue 148. Compared 30949 event pairs, 276 based on Foata normal form. 60/3034 useless extension candidates. Maximal degree in co-relation 4020. Up to 572 conditions per place. [2023-11-21 22:27:23,683 INFO L140 encePairwiseOnDemand]: 126/131 looper letters, 31 selfloop transitions, 4 changer transitions 0/132 dead transitions. [2023-11-21 22:27:23,683 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 132 transitions, 403 flow [2023-11-21 22:27:23,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-21 22:27:23,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-21 22:27:23,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 460 transitions. [2023-11-21 22:27:23,686 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8778625954198473 [2023-11-21 22:27:23,686 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 460 transitions. [2023-11-21 22:27:23,687 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 460 transitions. [2023-11-21 22:27:23,687 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-21 22:27:23,688 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 460 transitions. [2023-11-21 22:27:23,690 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 115.0) internal successors, (460), 4 states have internal predecessors, (460), 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-21 22:27:23,692 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 131.0) internal successors, (655), 5 states have internal predecessors, (655), 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-21 22:27:23,692 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 131.0) internal successors, (655), 5 states have internal predecessors, (655), 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-21 22:27:23,693 INFO L175 Difference]: Start difference. First operand has 119 places, 116 transitions, 294 flow. Second operand 4 states and 460 transitions. [2023-11-21 22:27:23,693 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 122 places, 132 transitions, 403 flow [2023-11-21 22:27:23,698 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 120 places, 132 transitions, 391 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-21 22:27:23,701 INFO L231 Difference]: Finished difference. Result has 121 places, 117 transitions, 298 flow [2023-11-21 22:27:23,702 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=131, PETRI_DIFFERENCE_MINUEND_FLOW=282, PETRI_DIFFERENCE_MINUEND_PLACES=117, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=116, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=112, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=298, PETRI_PLACES=121, PETRI_TRANSITIONS=117} [2023-11-21 22:27:23,702 INFO L281 CegarLoopForPetriNet]: 115 programPoint places, 6 predicate places. [2023-11-21 22:27:23,703 INFO L495 AbstractCegarLoop]: Abstraction has has 121 places, 117 transitions, 298 flow [2023-11-21 22:27:23,703 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 107.75) internal successors, (431), 4 states have internal predecessors, (431), 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-21 22:27:23,704 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-21 22:27:23,704 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-21 22:27:23,704 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-21 22:27:23,704 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2023-11-21 22:27:23,705 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:27:23,705 INFO L85 PathProgramCache]: Analyzing trace with hash -848975196, now seen corresponding path program 1 times [2023-11-21 22:27:23,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:27:23,706 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2067594139] [2023-11-21 22:27:23,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:27:23,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:27:23,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:27:23,757 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-11-21 22:27:23,758 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:27:23,758 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2067594139] [2023-11-21 22:27:23,758 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2067594139] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 22:27:23,758 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 22:27:23,759 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-21 22:27:23,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [674914054] [2023-11-21 22:27:23,759 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 22:27:23,760 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-21 22:27:23,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:27:23,760 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-21 22:27:23,761 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-21 22:27:23,791 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 131 [2023-11-21 22:27:23,792 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 121 places, 117 transitions, 298 flow. Second operand has 3 states, 3 states have (on average 106.0) internal successors, (318), 3 states have internal predecessors, (318), 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-21 22:27:23,792 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-21 22:27:23,792 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 131 [2023-11-21 22:27:23,793 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-21 22:27:24,453 INFO L124 PetriNetUnfolderBase]: 948/4164 cut-off events. [2023-11-21 22:27:24,454 INFO L125 PetriNetUnfolderBase]: For 791/820 co-relation queries the response was YES. [2023-11-21 22:27:24,473 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6792 conditions, 4164 events. 948/4164 cut-off events. For 791/820 co-relation queries the response was YES. Maximal size of possible extension queue 184. Compared 41546 event pairs, 556 based on Foata normal form. 1/3777 useless extension candidates. Maximal degree in co-relation 6177. Up to 1245 conditions per place. [2023-11-21 22:27:24,499 INFO L140 encePairwiseOnDemand]: 124/131 looper letters, 28 selfloop transitions, 9 changer transitions 0/131 dead transitions. [2023-11-21 22:27:24,499 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 123 places, 131 transitions, 415 flow [2023-11-21 22:27:24,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-21 22:27:24,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-21 22:27:24,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 345 transitions. [2023-11-21 22:27:24,501 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8778625954198473 [2023-11-21 22:27:24,501 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 345 transitions. [2023-11-21 22:27:24,502 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 345 transitions. [2023-11-21 22:27:24,502 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-21 22:27:24,502 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 345 transitions. [2023-11-21 22:27:24,504 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 115.0) internal successors, (345), 3 states have internal predecessors, (345), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:27:24,505 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 131.0) internal successors, (524), 4 states have internal predecessors, (524), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:27:24,506 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 131.0) internal successors, (524), 4 states have internal predecessors, (524), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:27:24,506 INFO L175 Difference]: Start difference. First operand has 121 places, 117 transitions, 298 flow. Second operand 3 states and 345 transitions. [2023-11-21 22:27:24,506 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 123 places, 131 transitions, 415 flow [2023-11-21 22:27:24,509 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 121 places, 131 transitions, 409 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-21 22:27:24,511 INFO L231 Difference]: Finished difference. Result has 123 places, 124 transitions, 368 flow [2023-11-21 22:27:24,512 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=131, PETRI_DIFFERENCE_MINUEND_FLOW=292, PETRI_DIFFERENCE_MINUEND_PLACES=119, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=117, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=108, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=368, PETRI_PLACES=123, PETRI_TRANSITIONS=124} [2023-11-21 22:27:24,513 INFO L281 CegarLoopForPetriNet]: 115 programPoint places, 8 predicate places. [2023-11-21 22:27:24,513 INFO L495 AbstractCegarLoop]: Abstraction has has 123 places, 124 transitions, 368 flow [2023-11-21 22:27:24,513 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 106.0) internal successors, (318), 3 states have internal predecessors, (318), 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-21 22:27:24,514 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-21 22:27:24,514 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-21 22:27:24,514 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-21 22:27:24,514 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2023-11-21 22:27:24,515 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:27:24,515 INFO L85 PathProgramCache]: Analyzing trace with hash -841860322, now seen corresponding path program 1 times [2023-11-21 22:27:24,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:27:24,515 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1708583226] [2023-11-21 22:27:24,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:27:24,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:27:24,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-21 22:27:24,535 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-21 22:27:24,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-21 22:27:24,554 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-21 22:27:24,554 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-21 22:27:24,555 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (8 of 9 remaining) [2023-11-21 22:27:24,555 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (7 of 9 remaining) [2023-11-21 22:27:24,555 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (6 of 9 remaining) [2023-11-21 22:27:24,556 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (5 of 9 remaining) [2023-11-21 22:27:24,556 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (4 of 9 remaining) [2023-11-21 22:27:24,556 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (3 of 9 remaining) [2023-11-21 22:27:24,556 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (2 of 9 remaining) [2023-11-21 22:27:24,556 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (1 of 9 remaining) [2023-11-21 22:27:24,557 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (0 of 9 remaining) [2023-11-21 22:27:24,557 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-21 22:27:24,557 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2023-11-21 22:27:24,558 WARN L233 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2023-11-21 22:27:24,558 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2023-11-21 22:27:24,603 INFO L144 ThreadInstanceAdder]: Constructed 6 joinOtherThreadTransitions. [2023-11-21 22:27:24,637 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 173 places, 167 transitions, 388 flow [2023-11-21 22:27:24,715 INFO L124 PetriNetUnfolderBase]: 40/614 cut-off events. [2023-11-21 22:27:24,715 INFO L125 PetriNetUnfolderBase]: For 39/39 co-relation queries the response was YES. [2023-11-21 22:27:24,719 INFO L83 FinitePrefix]: Finished finitePrefix Result has 670 conditions, 614 events. 40/614 cut-off events. For 39/39 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 2685 event pairs, 6 based on Foata normal form. 0/535 useless extension candidates. Maximal degree in co-relation 663. Up to 32 conditions per place. [2023-11-21 22:27:24,719 INFO L82 GeneralOperation]: Start removeDead. Operand has 173 places, 167 transitions, 388 flow [2023-11-21 22:27:24,723 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 134 places, 130 transitions, 293 flow [2023-11-21 22:27:24,724 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-21 22:27:24,725 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;@1d3f373c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-21 22:27:24,725 INFO L358 AbstractCegarLoop]: Starting to check reachability of 11 error locations. [2023-11-21 22:27:24,730 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-21 22:27:24,730 INFO L124 PetriNetUnfolderBase]: 3/64 cut-off events. [2023-11-21 22:27:24,730 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-21 22:27:24,730 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-21 22:27:24,731 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] [2023-11-21 22:27:24,731 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 8 more)] === [2023-11-21 22:27:24,731 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:27:24,731 INFO L85 PathProgramCache]: Analyzing trace with hash -413256344, now seen corresponding path program 1 times [2023-11-21 22:27:24,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:27:24,732 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2045624435] [2023-11-21 22:27:24,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:27:24,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:27:24,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:27:24,788 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-21 22:27:24,789 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:27:24,789 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2045624435] [2023-11-21 22:27:24,789 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2045624435] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 22:27:24,789 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 22:27:24,789 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-21 22:27:24,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [470703036] [2023-11-21 22:27:24,789 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 22:27:24,790 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-21 22:27:24,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:27:24,790 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-21 22:27:24,791 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-21 22:27:24,817 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 134 out of 167 [2023-11-21 22:27:24,818 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 134 places, 130 transitions, 293 flow. Second operand has 4 states, 4 states have (on average 135.5) internal successors, (542), 4 states have internal predecessors, (542), 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-21 22:27:24,818 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-21 22:27:24,819 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 134 of 167 [2023-11-21 22:27:24,819 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-21 22:27:25,915 INFO L124 PetriNetUnfolderBase]: 1406/6202 cut-off events. [2023-11-21 22:27:25,915 INFO L125 PetriNetUnfolderBase]: For 973/973 co-relation queries the response was YES. [2023-11-21 22:27:25,955 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8727 conditions, 6202 events. 1406/6202 cut-off events. For 973/973 co-relation queries the response was YES. Maximal size of possible extension queue 186. Compared 62471 event pairs, 529 based on Foata normal form. 228/5840 useless extension candidates. Maximal degree in co-relation 2424. Up to 1304 conditions per place. [2023-11-21 22:27:25,998 INFO L140 encePairwiseOnDemand]: 160/167 looper letters, 30 selfloop transitions, 4 changer transitions 0/139 dead transitions. [2023-11-21 22:27:25,998 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 137 places, 139 transitions, 379 flow [2023-11-21 22:27:25,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-21 22:27:25,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-21 22:27:26,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 574 transitions. [2023-11-21 22:27:26,001 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8592814371257484 [2023-11-21 22:27:26,002 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 574 transitions. [2023-11-21 22:27:26,002 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 574 transitions. [2023-11-21 22:27:26,003 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-21 22:27:26,003 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 574 transitions. [2023-11-21 22:27:26,005 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 143.5) internal successors, (574), 4 states have internal predecessors, (574), 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-21 22:27:26,008 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 167.0) internal successors, (835), 5 states have internal predecessors, (835), 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-21 22:27:26,008 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 167.0) internal successors, (835), 5 states have internal predecessors, (835), 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-21 22:27:26,009 INFO L175 Difference]: Start difference. First operand has 134 places, 130 transitions, 293 flow. Second operand 4 states and 574 transitions. [2023-11-21 22:27:26,009 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 137 places, 139 transitions, 379 flow [2023-11-21 22:27:26,012 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 135 places, 139 transitions, 375 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-21 22:27:26,015 INFO L231 Difference]: Finished difference. Result has 136 places, 129 transitions, 301 flow [2023-11-21 22:27:26,016 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=167, PETRI_DIFFERENCE_MINUEND_FLOW=285, PETRI_DIFFERENCE_MINUEND_PLACES=132, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=128, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=124, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=301, PETRI_PLACES=136, PETRI_TRANSITIONS=129} [2023-11-21 22:27:26,017 INFO L281 CegarLoopForPetriNet]: 134 programPoint places, 2 predicate places. [2023-11-21 22:27:26,018 INFO L495 AbstractCegarLoop]: Abstraction has has 136 places, 129 transitions, 301 flow [2023-11-21 22:27:26,018 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 135.5) internal successors, (542), 4 states have internal predecessors, (542), 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-21 22:27:26,018 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-21 22:27:26,019 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] [2023-11-21 22:27:26,019 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-21 22:27:26,019 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 8 more)] === [2023-11-21 22:27:26,020 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:27:26,020 INFO L85 PathProgramCache]: Analyzing trace with hash -1587104429, now seen corresponding path program 1 times [2023-11-21 22:27:26,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:27:26,020 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1875892104] [2023-11-21 22:27:26,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:27:26,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:27:26,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:27:26,062 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-21 22:27:26,063 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:27:26,063 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1875892104] [2023-11-21 22:27:26,063 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1875892104] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 22:27:26,063 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 22:27:26,064 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-21 22:27:26,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1323776941] [2023-11-21 22:27:26,064 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 22:27:26,064 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-21 22:27:26,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:27:26,065 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-21 22:27:26,065 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-21 22:27:26,100 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 130 out of 167 [2023-11-21 22:27:26,102 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 136 places, 129 transitions, 301 flow. Second operand has 3 states, 3 states have (on average 131.66666666666666) internal successors, (395), 3 states have internal predecessors, (395), 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-21 22:27:26,102 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-21 22:27:26,103 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 130 of 167 [2023-11-21 22:27:26,103 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-21 22:27:29,727 INFO L124 PetriNetUnfolderBase]: 7641/22362 cut-off events. [2023-11-21 22:27:29,727 INFO L125 PetriNetUnfolderBase]: For 2779/2798 co-relation queries the response was YES. [2023-11-21 22:27:29,846 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34301 conditions, 22362 events. 7641/22362 cut-off events. For 2779/2798 co-relation queries the response was YES. Maximal size of possible extension queue 778. Compared 263078 event pairs, 5229 based on Foata normal form. 0/19875 useless extension candidates. Maximal degree in co-relation 33951. Up to 8993 conditions per place. [2023-11-21 22:27:30,109 INFO L140 encePairwiseOnDemand]: 159/167 looper letters, 36 selfloop transitions, 7 changer transitions 0/147 dead transitions. [2023-11-21 22:27:30,109 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 138 places, 147 transitions, 443 flow [2023-11-21 22:27:30,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-21 22:27:30,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-21 22:27:30,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 434 transitions. [2023-11-21 22:27:30,112 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8662674650698603 [2023-11-21 22:27:30,112 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 434 transitions. [2023-11-21 22:27:30,112 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 434 transitions. [2023-11-21 22:27:30,113 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-21 22:27:30,113 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 434 transitions. [2023-11-21 22:27:30,114 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 144.66666666666666) internal successors, (434), 3 states have internal predecessors, (434), 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-21 22:27:30,116 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 167.0) internal successors, (668), 4 states have internal predecessors, (668), 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-21 22:27:30,117 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 167.0) internal successors, (668), 4 states have internal predecessors, (668), 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-21 22:27:30,117 INFO L175 Difference]: Start difference. First operand has 136 places, 129 transitions, 301 flow. Second operand 3 states and 434 transitions. [2023-11-21 22:27:30,120 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 138 places, 147 transitions, 443 flow [2023-11-21 22:27:30,144 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 136 places, 147 transitions, 437 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-21 22:27:30,147 INFO L231 Difference]: Finished difference. Result has 138 places, 135 transitions, 349 flow [2023-11-21 22:27:30,148 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=167, PETRI_DIFFERENCE_MINUEND_FLOW=295, PETRI_DIFFERENCE_MINUEND_PLACES=134, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=129, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=122, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=349, PETRI_PLACES=138, PETRI_TRANSITIONS=135} [2023-11-21 22:27:30,150 INFO L281 CegarLoopForPetriNet]: 134 programPoint places, 4 predicate places. [2023-11-21 22:27:30,150 INFO L495 AbstractCegarLoop]: Abstraction has has 138 places, 135 transitions, 349 flow [2023-11-21 22:27:30,151 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 131.66666666666666) internal successors, (395), 3 states have internal predecessors, (395), 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-21 22:27:30,151 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-21 22:27:30,151 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-21 22:27:30,151 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-21 22:27:30,152 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 8 more)] === [2023-11-21 22:27:30,152 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:27:30,152 INFO L85 PathProgramCache]: Analyzing trace with hash 1612202178, now seen corresponding path program 1 times [2023-11-21 22:27:30,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:27:30,158 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1931320005] [2023-11-21 22:27:30,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:27:30,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:27:30,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:27:30,247 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-21 22:27:30,247 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:27:30,248 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1931320005] [2023-11-21 22:27:30,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1931320005] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 22:27:30,248 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 22:27:30,248 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-21 22:27:30,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1496307244] [2023-11-21 22:27:30,249 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 22:27:30,250 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-21 22:27:30,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:27:30,252 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-21 22:27:30,253 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-21 22:27:30,290 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 134 out of 167 [2023-11-21 22:27:30,291 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 138 places, 135 transitions, 349 flow. Second operand has 4 states, 4 states have (on average 135.75) internal successors, (543), 4 states have internal predecessors, (543), 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-21 22:27:30,292 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-21 22:27:30,292 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 134 of 167 [2023-11-21 22:27:30,292 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-21 22:27:33,095 INFO L124 PetriNetUnfolderBase]: 5614/20334 cut-off events. [2023-11-21 22:27:33,096 INFO L125 PetriNetUnfolderBase]: For 1948/2028 co-relation queries the response was YES. [2023-11-21 22:27:33,236 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30758 conditions, 20334 events. 5614/20334 cut-off events. For 1948/2028 co-relation queries the response was YES. Maximal size of possible extension queue 778. Compared 248858 event pairs, 2964 based on Foata normal form. 256/18164 useless extension candidates. Maximal degree in co-relation 25705. Up to 4081 conditions per place. [2023-11-21 22:27:33,354 INFO L140 encePairwiseOnDemand]: 162/167 looper letters, 40 selfloop transitions, 4 changer transitions 0/156 dead transitions. [2023-11-21 22:27:33,354 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 141 places, 156 transitions, 489 flow [2023-11-21 22:27:33,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-21 22:27:33,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-21 22:27:33,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 581 transitions. [2023-11-21 22:27:33,358 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8697604790419161 [2023-11-21 22:27:33,358 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 581 transitions. [2023-11-21 22:27:33,358 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 581 transitions. [2023-11-21 22:27:33,359 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-21 22:27:33,359 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 581 transitions. [2023-11-21 22:27:33,362 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 145.25) internal successors, (581), 4 states have internal predecessors, (581), 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-21 22:27:33,364 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 167.0) internal successors, (835), 5 states have internal predecessors, (835), 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-21 22:27:33,365 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 167.0) internal successors, (835), 5 states have internal predecessors, (835), 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-21 22:27:33,365 INFO L175 Difference]: Start difference. First operand has 138 places, 135 transitions, 349 flow. Second operand 4 states and 581 transitions. [2023-11-21 22:27:33,365 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 141 places, 156 transitions, 489 flow [2023-11-21 22:27:33,394 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 139 places, 156 transitions, 475 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-21 22:27:33,398 INFO L231 Difference]: Finished difference. Result has 140 places, 136 transitions, 351 flow [2023-11-21 22:27:33,398 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=167, PETRI_DIFFERENCE_MINUEND_FLOW=335, PETRI_DIFFERENCE_MINUEND_PLACES=136, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=135, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=131, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=351, PETRI_PLACES=140, PETRI_TRANSITIONS=136} [2023-11-21 22:27:33,399 INFO L281 CegarLoopForPetriNet]: 134 programPoint places, 6 predicate places. [2023-11-21 22:27:33,400 INFO L495 AbstractCegarLoop]: Abstraction has has 140 places, 136 transitions, 351 flow [2023-11-21 22:27:33,400 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 135.75) internal successors, (543), 4 states have internal predecessors, (543), 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-21 22:27:33,400 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-21 22:27:33,401 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-21 22:27:33,401 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-21 22:27:33,401 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 8 more)] === [2023-11-21 22:27:33,402 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:27:33,402 INFO L85 PathProgramCache]: Analyzing trace with hash -2140690920, now seen corresponding path program 1 times [2023-11-21 22:27:33,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:27:33,403 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1485660273] [2023-11-21 22:27:33,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:27:33,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:27:33,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:27:33,453 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-11-21 22:27:33,453 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:27:33,453 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1485660273] [2023-11-21 22:27:33,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1485660273] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 22:27:33,454 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 22:27:33,454 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-21 22:27:33,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [719119179] [2023-11-21 22:27:33,454 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 22:27:33,455 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-21 22:27:33,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:27:33,456 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-21 22:27:33,456 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-21 22:27:33,492 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 130 out of 167 [2023-11-21 22:27:33,493 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 140 places, 136 transitions, 351 flow. Second operand has 3 states, 3 states have (on average 132.0) internal successors, (396), 3 states have internal predecessors, (396), 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-21 22:27:33,493 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-21 22:27:33,493 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 130 of 167 [2023-11-21 22:27:33,493 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-21 22:27:37,573 INFO L124 PetriNetUnfolderBase]: 9067/29984 cut-off events. [2023-11-21 22:27:37,573 INFO L125 PetriNetUnfolderBase]: For 7438/8079 co-relation queries the response was YES. [2023-11-21 22:27:37,683 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50936 conditions, 29984 events. 9067/29984 cut-off events. For 7438/8079 co-relation queries the response was YES. Maximal size of possible extension queue 1118. Compared 386250 event pairs, 5516 based on Foata normal form. 21/26894 useless extension candidates. Maximal degree in co-relation 43863. Up to 10447 conditions per place. [2023-11-21 22:27:37,843 INFO L140 encePairwiseOnDemand]: 159/167 looper letters, 38 selfloop transitions, 11 changer transitions 0/156 dead transitions. [2023-11-21 22:27:37,843 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 142 places, 156 transitions, 518 flow [2023-11-21 22:27:37,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-21 22:27:37,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-21 22:27:37,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 433 transitions. [2023-11-21 22:27:37,850 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8642714570858283 [2023-11-21 22:27:37,850 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 433 transitions. [2023-11-21 22:27:37,850 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 433 transitions. [2023-11-21 22:27:37,851 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-21 22:27:37,851 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 433 transitions. [2023-11-21 22:27:37,854 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 144.33333333333334) internal successors, (433), 3 states have internal predecessors, (433), 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-21 22:27:37,856 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 167.0) internal successors, (668), 4 states have internal predecessors, (668), 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-21 22:27:37,857 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 167.0) internal successors, (668), 4 states have internal predecessors, (668), 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-21 22:27:37,857 INFO L175 Difference]: Start difference. First operand has 140 places, 136 transitions, 351 flow. Second operand 3 states and 433 transitions. [2023-11-21 22:27:37,857 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 142 places, 156 transitions, 518 flow [2023-11-21 22:27:37,866 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 140 places, 156 transitions, 512 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-21 22:27:37,870 INFO L231 Difference]: Finished difference. Result has 142 places, 145 transitions, 441 flow [2023-11-21 22:27:37,871 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=167, PETRI_DIFFERENCE_MINUEND_FLOW=345, PETRI_DIFFERENCE_MINUEND_PLACES=138, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=136, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=125, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=441, PETRI_PLACES=142, PETRI_TRANSITIONS=145} [2023-11-21 22:27:37,872 INFO L281 CegarLoopForPetriNet]: 134 programPoint places, 8 predicate places. [2023-11-21 22:27:37,872 INFO L495 AbstractCegarLoop]: Abstraction has has 142 places, 145 transitions, 441 flow [2023-11-21 22:27:37,873 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 132.0) internal successors, (396), 3 states have internal predecessors, (396), 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-21 22:27:37,873 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-21 22:27:37,873 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-21 22:27:37,873 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-21 22:27:37,873 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 8 more)] === [2023-11-21 22:27:37,874 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:27:37,874 INFO L85 PathProgramCache]: Analyzing trace with hash -1833098318, now seen corresponding path program 1 times [2023-11-21 22:27:37,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:27:37,876 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [961925333] [2023-11-21 22:27:37,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:27:37,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:27:37,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:27:37,918 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-21 22:27:37,919 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:27:37,919 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [961925333] [2023-11-21 22:27:37,919 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [961925333] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 22:27:37,919 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 22:27:37,919 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-21 22:27:37,920 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [509359151] [2023-11-21 22:27:37,920 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 22:27:37,920 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-21 22:27:37,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:27:37,921 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-21 22:27:37,921 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-21 22:27:37,956 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 130 out of 167 [2023-11-21 22:27:37,957 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 142 places, 145 transitions, 441 flow. Second operand has 3 states, 3 states have (on average 132.0) internal successors, (396), 3 states have internal predecessors, (396), 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-21 22:27:37,958 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-21 22:27:37,958 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 130 of 167 [2023-11-21 22:27:37,958 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-21 22:27:39,938 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([467] L685-4-->L685-5: Formula: (= |v_#race~data~0_4| |v_threadThread3of3ForFork1_#t~nondet2_3|) InVars {threadThread3of3ForFork1_#t~nondet2=|v_threadThread3of3ForFork1_#t~nondet2_3|} OutVars{threadThread3of3ForFork1_#t~nondet2=|v_threadThread3of3ForFork1_#t~nondet2_3|, #race~data~0=|v_#race~data~0_4|} AuxVars[] AssignedVars[#race~data~0][120], [Black: 191#(and (= |ULTIMATE.start_main_~i~1#1| 0) (<= 4 |ULTIMATE.start_main_~threads_total~0#1|)), 26#L685-6true, 161#threadErr0ASSERT_VIOLATIONDATA_RACEtrue, 37#L695-4true, 2#L686-3true, Black: 196#(= |threadThread2of3ForFork1_#t~nondet2| |#race~data~0|), threadThread1of3ForFork1InUse, threadThread2of3ForFork1InUse, threadThread3of3ForFork1InUse, 194#true, 200#true, Black: 179#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= 4 |ULTIMATE.start_main_~threads_total~0#1|)), 31#L685-5true, Black: 184#(= |#race~data~0| |threadThread1of3ForFork1_#t~nondet2|)]) [2023-11-21 22:27:39,938 INFO L294 olderBase$Statistics]: this new event has 89 ancestors and is not cut-off event [2023-11-21 22:27:39,938 INFO L297 olderBase$Statistics]: existing Event has 89 ancestors and is not cut-off event [2023-11-21 22:27:39,939 INFO L297 olderBase$Statistics]: existing Event has 89 ancestors and is not cut-off event [2023-11-21 22:27:39,939 INFO L297 olderBase$Statistics]: existing Event has 89 ancestors and is not cut-off event [2023-11-21 22:27:42,016 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([467] L685-4-->L685-5: Formula: (= |v_#race~data~0_4| |v_threadThread3of3ForFork1_#t~nondet2_3|) InVars {threadThread3of3ForFork1_#t~nondet2=|v_threadThread3of3ForFork1_#t~nondet2_3|} OutVars{threadThread3of3ForFork1_#t~nondet2=|v_threadThread3of3ForFork1_#t~nondet2_3|, #race~data~0=|v_#race~data~0_4|} AuxVars[] AssignedVars[#race~data~0][120], [26#L685-6true, 161#threadErr0ASSERT_VIOLATIONDATA_RACEtrue, Black: 196#(= |threadThread2of3ForFork1_#t~nondet2| |#race~data~0|), threadThread1of3ForFork1InUse, 191#(and (= |ULTIMATE.start_main_~i~1#1| 0) (<= 4 |ULTIMATE.start_main_~threads_total~0#1|)), threadThread2of3ForFork1InUse, threadThread3of3ForFork1InUse, 10#L697-7true, 194#true, 200#true, Black: 179#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= 4 |ULTIMATE.start_main_~threads_total~0#1|)), 31#L685-5true, Black: 184#(= |#race~data~0| |threadThread1of3ForFork1_#t~nondet2|)]) [2023-11-21 22:27:42,017 INFO L294 olderBase$Statistics]: this new event has 103 ancestors and is not cut-off event [2023-11-21 22:27:42,017 INFO L297 olderBase$Statistics]: existing Event has 103 ancestors and is not cut-off event [2023-11-21 22:27:42,017 INFO L297 olderBase$Statistics]: existing Event has 103 ancestors and is not cut-off event [2023-11-21 22:27:42,017 INFO L297 olderBase$Statistics]: existing Event has 103 ancestors and is not cut-off event [2023-11-21 22:27:42,018 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([411] L699-->L699-1: Formula: (= |v_#race~data~0_1| 0) InVars {} OutVars{#race~data~0=|v_#race~data~0_1|} AuxVars[] AssignedVars[#race~data~0][161], [Black: 191#(and (= |ULTIMATE.start_main_~i~1#1| 0) (<= 4 |ULTIMATE.start_main_~threads_total~0#1|)), 26#L685-6true, 161#threadErr0ASSERT_VIOLATIONDATA_RACEtrue, 14#L684-3true, Black: 196#(= |threadThread2of3ForFork1_#t~nondet2| |#race~data~0|), threadThread1of3ForFork1InUse, threadThread2of3ForFork1InUse, 105#L699-1true, threadThread3of3ForFork1InUse, 194#true, 200#true, Black: 179#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= 4 |ULTIMATE.start_main_~threads_total~0#1|)), Black: 184#(= |#race~data~0| |threadThread1of3ForFork1_#t~nondet2|)]) [2023-11-21 22:27:42,018 INFO L294 olderBase$Statistics]: this new event has 104 ancestors and is cut-off event [2023-11-21 22:27:42,018 INFO L297 olderBase$Statistics]: existing Event has 104 ancestors and is cut-off event [2023-11-21 22:27:42,018 INFO L297 olderBase$Statistics]: existing Event has 104 ancestors and is cut-off event [2023-11-21 22:27:42,019 INFO L297 olderBase$Statistics]: existing Event has 104 ancestors and is cut-off event [2023-11-21 22:27:43,438 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([411] L699-->L699-1: Formula: (= |v_#race~data~0_1| 0) InVars {} OutVars{#race~data~0=|v_#race~data~0_1|} AuxVars[] AssignedVars[#race~data~0][157], [Black: 191#(and (= |ULTIMATE.start_main_~i~1#1| 0) (<= 4 |ULTIMATE.start_main_~threads_total~0#1|)), 32#L686-3true, Black: 196#(= |threadThread2of3ForFork1_#t~nondet2| |#race~data~0|), threadThread1of3ForFork1InUse, threadThread2of3ForFork1InUse, 105#L699-1true, threadThread3of3ForFork1InUse, 94#L685-6true, 200#true, 194#true, Black: 179#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= 4 |ULTIMATE.start_main_~threads_total~0#1|)), Black: 184#(= |#race~data~0| |threadThread1of3ForFork1_#t~nondet2|), 127#threadErr0ASSERT_VIOLATIONDATA_RACEtrue]) [2023-11-21 22:27:43,438 INFO L294 olderBase$Statistics]: this new event has 114 ancestors and is cut-off event [2023-11-21 22:27:43,443 INFO L297 olderBase$Statistics]: existing Event has 114 ancestors and is cut-off event [2023-11-21 22:27:43,444 INFO L297 olderBase$Statistics]: existing Event has 114 ancestors and is cut-off event [2023-11-21 22:27:43,444 INFO L297 olderBase$Statistics]: existing Event has 114 ancestors and is cut-off event [2023-11-21 22:27:43,445 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([411] L699-->L699-1: Formula: (= |v_#race~data~0_1| 0) InVars {} OutVars{#race~data~0=|v_#race~data~0_1|} AuxVars[] AssignedVars[#race~data~0][157], [Black: 191#(and (= |ULTIMATE.start_main_~i~1#1| 0) (<= 4 |ULTIMATE.start_main_~threads_total~0#1|)), 2#L686-3true, Black: 196#(= |threadThread2of3ForFork1_#t~nondet2| |#race~data~0|), threadThread1of3ForFork1InUse, threadThread2of3ForFork1InUse, 105#L699-1true, threadThread3of3ForFork1NotInUse, 94#L685-6true, 194#true, 200#true, Black: 179#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= 4 |ULTIMATE.start_main_~threads_total~0#1|)), Black: 184#(= |#race~data~0| |threadThread1of3ForFork1_#t~nondet2|), 127#threadErr0ASSERT_VIOLATIONDATA_RACEtrue]) [2023-11-21 22:27:43,445 INFO L294 olderBase$Statistics]: this new event has 114 ancestors and is cut-off event [2023-11-21 22:27:43,445 INFO L297 olderBase$Statistics]: existing Event has 114 ancestors and is cut-off event [2023-11-21 22:27:43,446 INFO L297 olderBase$Statistics]: existing Event has 114 ancestors and is cut-off event [2023-11-21 22:27:43,446 INFO L297 olderBase$Statistics]: existing Event has 114 ancestors and is cut-off event [2023-11-21 22:27:43,467 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([411] L699-->L699-1: Formula: (= |v_#race~data~0_1| 0) InVars {} OutVars{#race~data~0=|v_#race~data~0_1|} AuxVars[] AssignedVars[#race~data~0][161], [Black: 191#(and (= |ULTIMATE.start_main_~i~1#1| 0) (<= 4 |ULTIMATE.start_main_~threads_total~0#1|)), 26#L685-6true, 161#threadErr0ASSERT_VIOLATIONDATA_RACEtrue, 32#L686-3true, Black: 196#(= |threadThread2of3ForFork1_#t~nondet2| |#race~data~0|), threadThread1of3ForFork1InUse, threadThread2of3ForFork1InUse, 105#L699-1true, threadThread3of3ForFork1InUse, 194#true, 200#true, Black: 179#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= 4 |ULTIMATE.start_main_~threads_total~0#1|)), Black: 184#(= |#race~data~0| |threadThread1of3ForFork1_#t~nondet2|)]) [2023-11-21 22:27:43,467 INFO L294 olderBase$Statistics]: this new event has 114 ancestors and is cut-off event [2023-11-21 22:27:43,467 INFO L297 olderBase$Statistics]: existing Event has 114 ancestors and is cut-off event [2023-11-21 22:27:43,467 INFO L297 olderBase$Statistics]: existing Event has 114 ancestors and is cut-off event [2023-11-21 22:27:43,467 INFO L297 olderBase$Statistics]: existing Event has 114 ancestors and is cut-off event [2023-11-21 22:27:43,469 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([411] L699-->L699-1: Formula: (= |v_#race~data~0_1| 0) InVars {} OutVars{#race~data~0=|v_#race~data~0_1|} AuxVars[] AssignedVars[#race~data~0][161], [Black: 191#(and (= |ULTIMATE.start_main_~i~1#1| 0) (<= 4 |ULTIMATE.start_main_~threads_total~0#1|)), 26#L685-6true, 161#threadErr0ASSERT_VIOLATIONDATA_RACEtrue, 2#L686-3true, Black: 196#(= |threadThread2of3ForFork1_#t~nondet2| |#race~data~0|), threadThread1of3ForFork1InUse, 105#L699-1true, threadThread2of3ForFork1InUse, threadThread3of3ForFork1NotInUse, 194#true, 200#true, Black: 179#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= 4 |ULTIMATE.start_main_~threads_total~0#1|)), Black: 184#(= |#race~data~0| |threadThread1of3ForFork1_#t~nondet2|)]) [2023-11-21 22:27:43,469 INFO L294 olderBase$Statistics]: this new event has 114 ancestors and is cut-off event [2023-11-21 22:27:43,470 INFO L297 olderBase$Statistics]: existing Event has 114 ancestors and is cut-off event [2023-11-21 22:27:43,470 INFO L297 olderBase$Statistics]: existing Event has 114 ancestors and is cut-off event [2023-11-21 22:27:43,470 INFO L297 olderBase$Statistics]: existing Event has 114 ancestors and is cut-off event [2023-11-21 22:27:43,476 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([411] L699-->L699-1: Formula: (= |v_#race~data~0_1| 0) InVars {} OutVars{#race~data~0=|v_#race~data~0_1|} AuxVars[] AssignedVars[#race~data~0][143], [Black: 191#(and (= |ULTIMATE.start_main_~i~1#1| 0) (<= 4 |ULTIMATE.start_main_~threads_total~0#1|)), 161#threadErr0ASSERT_VIOLATIONDATA_RACEtrue, 32#L686-3true, Black: 196#(= |threadThread2of3ForFork1_#t~nondet2| |#race~data~0|), threadThread1of3ForFork1InUse, 105#L699-1true, threadThread2of3ForFork1InUse, threadThread3of3ForFork1InUse, 200#true, 194#true, Black: 179#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= 4 |ULTIMATE.start_main_~threads_total~0#1|)), Black: 184#(= |#race~data~0| |threadThread1of3ForFork1_#t~nondet2|), 127#threadErr0ASSERT_VIOLATIONDATA_RACEtrue]) [2023-11-21 22:27:43,476 INFO L294 olderBase$Statistics]: this new event has 114 ancestors and is cut-off event [2023-11-21 22:27:43,476 INFO L297 olderBase$Statistics]: existing Event has 114 ancestors and is cut-off event [2023-11-21 22:27:43,476 INFO L297 olderBase$Statistics]: existing Event has 114 ancestors and is cut-off event [2023-11-21 22:27:43,476 INFO L297 olderBase$Statistics]: existing Event has 114 ancestors and is cut-off event [2023-11-21 22:27:43,477 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([411] L699-->L699-1: Formula: (= |v_#race~data~0_1| 0) InVars {} OutVars{#race~data~0=|v_#race~data~0_1|} AuxVars[] AssignedVars[#race~data~0][143], [Black: 191#(and (= |ULTIMATE.start_main_~i~1#1| 0) (<= 4 |ULTIMATE.start_main_~threads_total~0#1|)), 161#threadErr0ASSERT_VIOLATIONDATA_RACEtrue, 2#L686-3true, Black: 196#(= |threadThread2of3ForFork1_#t~nondet2| |#race~data~0|), threadThread1of3ForFork1InUse, threadThread2of3ForFork1InUse, 105#L699-1true, threadThread3of3ForFork1NotInUse, 194#true, 200#true, Black: 179#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= 4 |ULTIMATE.start_main_~threads_total~0#1|)), Black: 184#(= |#race~data~0| |threadThread1of3ForFork1_#t~nondet2|), 127#threadErr0ASSERT_VIOLATIONDATA_RACEtrue]) [2023-11-21 22:27:43,478 INFO L294 olderBase$Statistics]: this new event has 114 ancestors and is cut-off event [2023-11-21 22:27:43,478 INFO L297 olderBase$Statistics]: existing Event has 114 ancestors and is cut-off event [2023-11-21 22:27:43,478 INFO L297 olderBase$Statistics]: existing Event has 114 ancestors and is cut-off event [2023-11-21 22:27:43,478 INFO L297 olderBase$Statistics]: existing Event has 114 ancestors and is cut-off event [2023-11-21 22:27:44,157 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([411] L699-->L699-1: Formula: (= |v_#race~data~0_1| 0) InVars {} OutVars{#race~data~0=|v_#race~data~0_1|} AuxVars[] AssignedVars[#race~data~0][157], [Black: 191#(and (= |ULTIMATE.start_main_~i~1#1| 0) (<= 4 |ULTIMATE.start_main_~threads_total~0#1|)), 194#true, 200#true, Black: 179#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= 4 |ULTIMATE.start_main_~threads_total~0#1|)), Black: 196#(= |threadThread2of3ForFork1_#t~nondet2| |#race~data~0|), threadThread1of3ForFork1InUse, Black: 184#(= |#race~data~0| |threadThread1of3ForFork1_#t~nondet2|), threadThread2of3ForFork1InUse, 127#threadErr0ASSERT_VIOLATIONDATA_RACEtrue, 105#L699-1true, threadThread3of3ForFork1NotInUse, 94#L685-6true]) [2023-11-21 22:27:44,157 INFO L294 olderBase$Statistics]: this new event has 129 ancestors and is cut-off event [2023-11-21 22:27:44,157 INFO L297 olderBase$Statistics]: existing Event has 92 ancestors and is cut-off event [2023-11-21 22:27:44,157 INFO L297 olderBase$Statistics]: existing Event has 92 ancestors and is cut-off event [2023-11-21 22:27:44,157 INFO L297 olderBase$Statistics]: existing Event has 92 ancestors and is cut-off event [2023-11-21 22:27:44,249 INFO L124 PetriNetUnfolderBase]: 13206/45000 cut-off events. [2023-11-21 22:27:44,249 INFO L125 PetriNetUnfolderBase]: For 27765/31419 co-relation queries the response was YES. [2023-11-21 22:27:44,483 INFO L83 FinitePrefix]: Finished finitePrefix Result has 85160 conditions, 45000 events. 13206/45000 cut-off events. For 27765/31419 co-relation queries the response was YES. Maximal size of possible extension queue 1664. Compared 623070 event pairs, 6978 based on Foata normal form. 42/39967 useless extension candidates. Maximal degree in co-relation 74256. Up to 14689 conditions per place. [2023-11-21 22:27:44,813 INFO L140 encePairwiseOnDemand]: 159/167 looper letters, 41 selfloop transitions, 18 changer transitions 0/168 dead transitions. [2023-11-21 22:27:44,814 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 144 places, 168 transitions, 676 flow [2023-11-21 22:27:44,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-21 22:27:44,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-21 22:27:44,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 431 transitions. [2023-11-21 22:27:44,815 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8602794411177644 [2023-11-21 22:27:44,816 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 431 transitions. [2023-11-21 22:27:44,816 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 431 transitions. [2023-11-21 22:27:44,816 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-21 22:27:44,816 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 431 transitions. [2023-11-21 22:27:44,818 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 143.66666666666666) internal successors, (431), 3 states have internal predecessors, (431), 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-21 22:27:44,819 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 167.0) internal successors, (668), 4 states have internal predecessors, (668), 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-21 22:27:44,819 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 167.0) internal successors, (668), 4 states have internal predecessors, (668), 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-21 22:27:44,819 INFO L175 Difference]: Start difference. First operand has 142 places, 145 transitions, 441 flow. Second operand 3 states and 431 transitions. [2023-11-21 22:27:44,820 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 144 places, 168 transitions, 676 flow [2023-11-21 22:27:44,978 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 142 places, 168 transitions, 640 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-21 22:27:44,981 INFO L231 Difference]: Finished difference. Result has 144 places, 159 transitions, 597 flow [2023-11-21 22:27:44,981 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=167, PETRI_DIFFERENCE_MINUEND_FLOW=419, PETRI_DIFFERENCE_MINUEND_PLACES=140, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=145, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=127, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=597, PETRI_PLACES=144, PETRI_TRANSITIONS=159} [2023-11-21 22:27:44,982 INFO L281 CegarLoopForPetriNet]: 134 programPoint places, 10 predicate places. [2023-11-21 22:27:44,982 INFO L495 AbstractCegarLoop]: Abstraction has has 144 places, 159 transitions, 597 flow [2023-11-21 22:27:44,983 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 132.0) internal successors, (396), 3 states have internal predecessors, (396), 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-21 22:27:44,983 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-21 22:27:44,983 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] [2023-11-21 22:27:44,983 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-21 22:27:44,983 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 8 more)] === [2023-11-21 22:27:44,984 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:27:44,984 INFO L85 PathProgramCache]: Analyzing trace with hash 928912541, now seen corresponding path program 1 times [2023-11-21 22:27:44,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:27:44,984 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [101634480] [2023-11-21 22:27:44,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:27:44,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:27:45,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:27:45,098 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 22:27:45,098 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:27:45,098 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [101634480] [2023-11-21 22:27:45,099 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [101634480] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-21 22:27:45,099 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1641564640] [2023-11-21 22:27:45,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:27:45,099 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-21 22:27:45,100 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3cfb2781-b003-41b5-9a20-f8b9d4ddb3cd/bin/uautomizer-verify-bycVGegfSx/z3 [2023-11-21 22:27:45,110 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3cfb2781-b003-41b5-9a20-f8b9d4ddb3cd/bin/uautomizer-verify-bycVGegfSx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-21 22:27:45,126 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3cfb2781-b003-41b5-9a20-f8b9d4ddb3cd/bin/uautomizer-verify-bycVGegfSx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-21 22:27:45,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:27:45,235 INFO L262 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-21 22:27:45,239 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-21 22:27:45,429 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 22:27:45,430 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-21 22:27:45,507 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 22:27:45,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1641564640] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-21 22:27:45,507 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-21 22:27:45,507 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 13 [2023-11-21 22:27:45,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1033759003] [2023-11-21 22:27:45,508 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-21 22:27:45,509 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-11-21 22:27:45,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:27:45,511 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-11-21 22:27:45,511 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156 [2023-11-21 22:27:45,570 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 131 out of 167 [2023-11-21 22:27:45,573 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 144 places, 159 transitions, 597 flow. Second operand has 13 states, 13 states have (on average 133.0) internal successors, (1729), 13 states have internal predecessors, (1729), 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-21 22:27:45,573 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-21 22:27:45,573 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 131 of 167 [2023-11-21 22:27:45,573 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-21 22:27:47,838 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([411] L699-->L699-1: Formula: (= |v_#race~data~0_1| 0) InVars {} OutVars{#race~data~0=|v_#race~data~0_1|} AuxVars[] AssignedVars[#race~data~0][191], [Black: 191#(and (= |ULTIMATE.start_main_~i~1#1| 0) (<= 4 |ULTIMATE.start_main_~threads_total~0#1|)), Black: 196#(= |threadThread2of3ForFork1_#t~nondet2| |#race~data~0|), 133#$Ultimate##0true, threadThread1of3ForFork1InUse, threadThread2of3ForFork1NotInUse, 105#L699-1true, Black: 202#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet2|), 54#L685-6true, threadThread3of3ForFork1InUse, 94#L685-6true, 208#(<= 4 |ULTIMATE.start_main_~threads_total~0#1|), 200#true, Black: 179#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= 4 |ULTIMATE.start_main_~threads_total~0#1|)), Black: 184#(= |#race~data~0| |threadThread1of3ForFork1_#t~nondet2|)]) [2023-11-21 22:27:47,838 INFO L294 olderBase$Statistics]: this new event has 102 ancestors and is cut-off event [2023-11-21 22:27:47,838 INFO L297 olderBase$Statistics]: existing Event has 102 ancestors and is cut-off event [2023-11-21 22:27:47,839 INFO L297 olderBase$Statistics]: existing Event has 102 ancestors and is cut-off event [2023-11-21 22:27:47,839 INFO L297 olderBase$Statistics]: existing Event has 102 ancestors and is cut-off event [2023-11-21 22:27:48,011 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([411] L699-->L699-1: Formula: (= |v_#race~data~0_1| 0) InVars {} OutVars{#race~data~0=|v_#race~data~0_1|} AuxVars[] AssignedVars[#race~data~0][191], [Black: 191#(and (= |ULTIMATE.start_main_~i~1#1| 0) (<= 4 |ULTIMATE.start_main_~threads_total~0#1|)), 14#L684-3true, Black: 196#(= |threadThread2of3ForFork1_#t~nondet2| |#race~data~0|), threadThread1of3ForFork1InUse, threadThread2of3ForFork1NotInUse, 105#L699-1true, Black: 202#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet2|), 54#L685-6true, threadThread3of3ForFork1InUse, 94#L685-6true, 208#(<= 4 |ULTIMATE.start_main_~threads_total~0#1|), 200#true, Black: 179#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= 4 |ULTIMATE.start_main_~threads_total~0#1|)), Black: 184#(= |#race~data~0| |threadThread1of3ForFork1_#t~nondet2|)]) [2023-11-21 22:27:48,011 INFO L294 olderBase$Statistics]: this new event has 104 ancestors and is cut-off event [2023-11-21 22:27:48,011 INFO L297 olderBase$Statistics]: existing Event has 104 ancestors and is cut-off event [2023-11-21 22:27:48,012 INFO L297 olderBase$Statistics]: existing Event has 104 ancestors and is cut-off event [2023-11-21 22:27:48,012 INFO L297 olderBase$Statistics]: existing Event has 104 ancestors and is cut-off event [2023-11-21 22:27:48,163 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([411] L699-->L699-1: Formula: (= |v_#race~data~0_1| 0) InVars {} OutVars{#race~data~0=|v_#race~data~0_1|} AuxVars[] AssignedVars[#race~data~0][197], [Black: 191#(and (= |ULTIMATE.start_main_~i~1#1| 0) (<= 4 |ULTIMATE.start_main_~threads_total~0#1|)), 26#L685-6true, Black: 196#(= |threadThread2of3ForFork1_#t~nondet2| |#race~data~0|), threadThread1of3ForFork1InUse, 105#L699-1true, threadThread2of3ForFork1InUse, 54#L685-6true, Black: 202#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet2|), threadThread3of3ForFork1NotInUse, 94#L685-6true, 208#(<= 4 |ULTIMATE.start_main_~threads_total~0#1|), 200#true, Black: 179#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= 4 |ULTIMATE.start_main_~threads_total~0#1|)), Black: 184#(= |#race~data~0| |threadThread1of3ForFork1_#t~nondet2|)]) [2023-11-21 22:27:48,164 INFO L294 olderBase$Statistics]: this new event has 111 ancestors and is cut-off event [2023-11-21 22:27:48,164 INFO L297 olderBase$Statistics]: existing Event has 111 ancestors and is cut-off event [2023-11-21 22:27:48,164 INFO L297 olderBase$Statistics]: existing Event has 111 ancestors and is cut-off event [2023-11-21 22:27:48,164 INFO L297 olderBase$Statistics]: existing Event has 111 ancestors and is cut-off event [2023-11-21 22:27:48,183 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([411] L699-->L699-1: Formula: (= |v_#race~data~0_1| 0) InVars {} OutVars{#race~data~0=|v_#race~data~0_1|} AuxVars[] AssignedVars[#race~data~0][190], [Black: 191#(and (= |ULTIMATE.start_main_~i~1#1| 0) (<= 4 |ULTIMATE.start_main_~threads_total~0#1|)), 26#L685-6true, 162#L685-5true, Black: 196#(= |threadThread2of3ForFork1_#t~nondet2| |#race~data~0|), threadThread1of3ForFork1InUse, 105#L699-1true, threadThread2of3ForFork1InUse, Black: 202#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet2|), threadThread3of3ForFork1NotInUse, 94#L685-6true, 208#(<= 4 |ULTIMATE.start_main_~threads_total~0#1|), 200#true, Black: 179#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= 4 |ULTIMATE.start_main_~threads_total~0#1|)), Black: 184#(= |#race~data~0| |threadThread1of3ForFork1_#t~nondet2|)]) [2023-11-21 22:27:48,183 INFO L294 olderBase$Statistics]: this new event has 110 ancestors and is cut-off event [2023-11-21 22:27:48,184 INFO L297 olderBase$Statistics]: existing Event has 110 ancestors and is cut-off event [2023-11-21 22:27:48,184 INFO L297 olderBase$Statistics]: existing Event has 110 ancestors and is cut-off event [2023-11-21 22:27:48,184 INFO L297 olderBase$Statistics]: existing Event has 110 ancestors and is cut-off event [2023-11-21 22:27:48,186 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([411] L699-->L699-1: Formula: (= |v_#race~data~0_1| 0) InVars {} OutVars{#race~data~0=|v_#race~data~0_1|} AuxVars[] AssignedVars[#race~data~0][190], [Black: 191#(and (= |ULTIMATE.start_main_~i~1#1| 0) (<= 4 |ULTIMATE.start_main_~threads_total~0#1|)), 26#L685-6true, Black: 196#(= |threadThread2of3ForFork1_#t~nondet2| |#race~data~0|), threadThread1of3ForFork1InUse, 105#L699-1true, threadThread2of3ForFork1InUse, Black: 202#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet2|), threadThread3of3ForFork1NotInUse, 94#L685-6true, 208#(<= 4 |ULTIMATE.start_main_~threads_total~0#1|), 200#true, Black: 179#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= 4 |ULTIMATE.start_main_~threads_total~0#1|)), 123#threadErr0ASSERT_VIOLATIONDATA_RACEtrue, Black: 184#(= |#race~data~0| |threadThread1of3ForFork1_#t~nondet2|)]) [2023-11-21 22:27:48,186 INFO L294 olderBase$Statistics]: this new event has 111 ancestors and is cut-off event [2023-11-21 22:27:48,187 INFO L297 olderBase$Statistics]: existing Event has 111 ancestors and is cut-off event [2023-11-21 22:27:48,187 INFO L297 olderBase$Statistics]: existing Event has 111 ancestors and is cut-off event [2023-11-21 22:27:48,187 INFO L297 olderBase$Statistics]: existing Event has 111 ancestors and is cut-off event [2023-11-21 22:27:48,188 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([411] L699-->L699-1: Formula: (= |v_#race~data~0_1| 0) InVars {} OutVars{#race~data~0=|v_#race~data~0_1|} AuxVars[] AssignedVars[#race~data~0][197], [Black: 191#(and (= |ULTIMATE.start_main_~i~1#1| 0) (<= 4 |ULTIMATE.start_main_~threads_total~0#1|)), 26#L685-6true, Black: 196#(= |threadThread2of3ForFork1_#t~nondet2| |#race~data~0|), threadThread1of3ForFork1InUse, 105#L699-1true, threadThread2of3ForFork1InUse, Black: 202#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet2|), threadThread3of3ForFork1NotInUse, 54#L685-6true, 94#L685-6true, 208#(<= 4 |ULTIMATE.start_main_~threads_total~0#1|), 200#true, Black: 179#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= 4 |ULTIMATE.start_main_~threads_total~0#1|)), Black: 184#(= |#race~data~0| |threadThread1of3ForFork1_#t~nondet2|)]) [2023-11-21 22:27:48,188 INFO L294 olderBase$Statistics]: this new event has 111 ancestors and is cut-off event [2023-11-21 22:27:48,189 INFO L297 olderBase$Statistics]: existing Event has 111 ancestors and is cut-off event [2023-11-21 22:27:48,189 INFO L297 olderBase$Statistics]: existing Event has 111 ancestors and is cut-off event [2023-11-21 22:27:48,189 INFO L297 olderBase$Statistics]: existing Event has 111 ancestors and is cut-off event [2023-11-21 22:27:48,189 INFO L297 olderBase$Statistics]: existing Event has 111 ancestors and is cut-off event [2023-11-21 22:27:48,343 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([411] L699-->L699-1: Formula: (= |v_#race~data~0_1| 0) InVars {} OutVars{#race~data~0=|v_#race~data~0_1|} AuxVars[] AssignedVars[#race~data~0][190], [Black: 191#(and (= |ULTIMATE.start_main_~i~1#1| 0) (<= 4 |ULTIMATE.start_main_~threads_total~0#1|)), 26#L685-6true, Black: 196#(= |threadThread2of3ForFork1_#t~nondet2| |#race~data~0|), threadThread1of3ForFork1InUse, 105#L699-1true, threadThread2of3ForFork1InUse, Black: 202#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet2|), 54#L685-6true, threadThread3of3ForFork1NotInUse, 94#L685-6true, 208#(<= 4 |ULTIMATE.start_main_~threads_total~0#1|), 200#true, Black: 179#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= 4 |ULTIMATE.start_main_~threads_total~0#1|)), Black: 184#(= |#race~data~0| |threadThread1of3ForFork1_#t~nondet2|)]) [2023-11-21 22:27:48,343 INFO L294 olderBase$Statistics]: this new event has 111 ancestors and is cut-off event [2023-11-21 22:27:48,343 INFO L297 olderBase$Statistics]: existing Event has 111 ancestors and is cut-off event [2023-11-21 22:27:48,344 INFO L297 olderBase$Statistics]: existing Event has 111 ancestors and is cut-off event [2023-11-21 22:27:48,344 INFO L297 olderBase$Statistics]: existing Event has 111 ancestors and is cut-off event [2023-11-21 22:27:48,503 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([411] L699-->L699-1: Formula: (= |v_#race~data~0_1| 0) InVars {} OutVars{#race~data~0=|v_#race~data~0_1|} AuxVars[] AssignedVars[#race~data~0][192], [Black: 191#(and (= |ULTIMATE.start_main_~i~1#1| 0) (<= 4 |ULTIMATE.start_main_~threads_total~0#1|)), 26#L685-6true, Black: 196#(= |threadThread2of3ForFork1_#t~nondet2| |#race~data~0|), threadThread1of3ForFork1InUse, 105#L699-1true, threadThread2of3ForFork1InUse, Black: 202#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet2|), 54#L685-6true, threadThread3of3ForFork1NotInUse, 208#(<= 4 |ULTIMATE.start_main_~threads_total~0#1|), 101#L686true, 200#true, Black: 179#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= 4 |ULTIMATE.start_main_~threads_total~0#1|)), Black: 184#(= |#race~data~0| |threadThread1of3ForFork1_#t~nondet2|)]) [2023-11-21 22:27:48,503 INFO L294 olderBase$Statistics]: this new event has 113 ancestors and is cut-off event [2023-11-21 22:27:48,503 INFO L297 olderBase$Statistics]: existing Event has 113 ancestors and is cut-off event [2023-11-21 22:27:48,503 INFO L297 olderBase$Statistics]: existing Event has 113 ancestors and is cut-off event [2023-11-21 22:27:48,504 INFO L297 olderBase$Statistics]: existing Event has 113 ancestors and is cut-off event [2023-11-21 22:27:48,505 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([411] L699-->L699-1: Formula: (= |v_#race~data~0_1| 0) InVars {} OutVars{#race~data~0=|v_#race~data~0_1|} AuxVars[] AssignedVars[#race~data~0][177], [Black: 191#(and (= |ULTIMATE.start_main_~i~1#1| 0) (<= 4 |ULTIMATE.start_main_~threads_total~0#1|)), 26#L685-6true, 162#L685-5true, Black: 196#(= |threadThread2of3ForFork1_#t~nondet2| |#race~data~0|), threadThread1of3ForFork1InUse, 105#L699-1true, threadThread2of3ForFork1InUse, Black: 202#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet2|), threadThread3of3ForFork1NotInUse, 208#(<= 4 |ULTIMATE.start_main_~threads_total~0#1|), 101#L686true, 200#true, Black: 179#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= 4 |ULTIMATE.start_main_~threads_total~0#1|)), Black: 184#(= |#race~data~0| |threadThread1of3ForFork1_#t~nondet2|)]) [2023-11-21 22:27:48,506 INFO L294 olderBase$Statistics]: this new event has 112 ancestors and is cut-off event [2023-11-21 22:27:48,506 INFO L297 olderBase$Statistics]: existing Event has 112 ancestors and is cut-off event [2023-11-21 22:27:48,506 INFO L297 olderBase$Statistics]: existing Event has 112 ancestors and is cut-off event [2023-11-21 22:27:48,506 INFO L297 olderBase$Statistics]: existing Event has 112 ancestors and is cut-off event [2023-11-21 22:27:48,507 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([411] L699-->L699-1: Formula: (= |v_#race~data~0_1| 0) InVars {} OutVars{#race~data~0=|v_#race~data~0_1|} AuxVars[] AssignedVars[#race~data~0][192], [Black: 191#(and (= |ULTIMATE.start_main_~i~1#1| 0) (<= 4 |ULTIMATE.start_main_~threads_total~0#1|)), 26#L685-6true, Black: 196#(= |threadThread2of3ForFork1_#t~nondet2| |#race~data~0|), threadThread1of3ForFork1InUse, threadThread2of3ForFork1InUse, 105#L699-1true, Black: 202#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet2|), 54#L685-6true, threadThread3of3ForFork1NotInUse, 208#(<= 4 |ULTIMATE.start_main_~threads_total~0#1|), 101#L686true, 200#true, Black: 179#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= 4 |ULTIMATE.start_main_~threads_total~0#1|)), Black: 184#(= |#race~data~0| |threadThread1of3ForFork1_#t~nondet2|)]) [2023-11-21 22:27:48,507 INFO L294 olderBase$Statistics]: this new event has 113 ancestors and is cut-off event [2023-11-21 22:27:48,507 INFO L297 olderBase$Statistics]: existing Event has 113 ancestors and is cut-off event [2023-11-21 22:27:48,508 INFO L297 olderBase$Statistics]: existing Event has 113 ancestors and is cut-off event [2023-11-21 22:27:48,508 INFO L297 olderBase$Statistics]: existing Event has 113 ancestors and is cut-off event [2023-11-21 22:27:48,508 INFO L297 olderBase$Statistics]: existing Event has 113 ancestors and is cut-off event [2023-11-21 22:27:48,618 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([411] L699-->L699-1: Formula: (= |v_#race~data~0_1| 0) InVars {} OutVars{#race~data~0=|v_#race~data~0_1|} AuxVars[] AssignedVars[#race~data~0][177], [Black: 191#(and (= |ULTIMATE.start_main_~i~1#1| 0) (<= 4 |ULTIMATE.start_main_~threads_total~0#1|)), 26#L685-6true, Black: 196#(= |threadThread2of3ForFork1_#t~nondet2| |#race~data~0|), threadThread1of3ForFork1InUse, 105#L699-1true, threadThread2of3ForFork1InUse, Black: 202#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet2|), 54#L685-6true, threadThread3of3ForFork1NotInUse, 208#(<= 4 |ULTIMATE.start_main_~threads_total~0#1|), 101#L686true, 200#true, Black: 179#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= 4 |ULTIMATE.start_main_~threads_total~0#1|)), Black: 184#(= |#race~data~0| |threadThread1of3ForFork1_#t~nondet2|)]) [2023-11-21 22:27:48,618 INFO L294 olderBase$Statistics]: this new event has 113 ancestors and is cut-off event [2023-11-21 22:27:48,618 INFO L297 olderBase$Statistics]: existing Event has 113 ancestors and is cut-off event [2023-11-21 22:27:48,618 INFO L297 olderBase$Statistics]: existing Event has 113 ancestors and is cut-off event [2023-11-21 22:27:48,618 INFO L297 olderBase$Statistics]: existing Event has 113 ancestors and is cut-off event [2023-11-21 22:27:49,245 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([411] L699-->L699-1: Formula: (= |v_#race~data~0_1| 0) InVars {} OutVars{#race~data~0=|v_#race~data~0_1|} AuxVars[] AssignedVars[#race~data~0][177], [Black: 191#(and (= |ULTIMATE.start_main_~i~1#1| 0) (<= 4 |ULTIMATE.start_main_~threads_total~0#1|)), 26#L685-6true, Black: 196#(= |threadThread2of3ForFork1_#t~nondet2| |#race~data~0|), threadThread1of3ForFork1InUse, 105#L699-1true, threadThread2of3ForFork1InUse, Black: 202#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet2|), threadThread3of3ForFork1NotInUse, 208#(<= 4 |ULTIMATE.start_main_~threads_total~0#1|), 101#L686true, 200#true, Black: 179#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= 4 |ULTIMATE.start_main_~threads_total~0#1|)), 123#threadErr0ASSERT_VIOLATIONDATA_RACEtrue, Black: 184#(= |#race~data~0| |threadThread1of3ForFork1_#t~nondet2|)]) [2023-11-21 22:27:49,245 INFO L294 olderBase$Statistics]: this new event has 113 ancestors and is cut-off event [2023-11-21 22:27:49,245 INFO L297 olderBase$Statistics]: existing Event has 113 ancestors and is cut-off event [2023-11-21 22:27:49,245 INFO L297 olderBase$Statistics]: existing Event has 113 ancestors and is cut-off event [2023-11-21 22:27:49,245 INFO L297 olderBase$Statistics]: existing Event has 113 ancestors and is cut-off event [2023-11-21 22:27:49,304 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([411] L699-->L699-1: Formula: (= |v_#race~data~0_1| 0) InVars {} OutVars{#race~data~0=|v_#race~data~0_1|} AuxVars[] AssignedVars[#race~data~0][177], [Black: 191#(and (= |ULTIMATE.start_main_~i~1#1| 0) (<= 4 |ULTIMATE.start_main_~threads_total~0#1|)), 26#L685-6true, Black: 196#(= |threadThread2of3ForFork1_#t~nondet2| |#race~data~0|), threadThread1of3ForFork1InUse, 105#L699-1true, threadThread2of3ForFork1InUse, Black: 202#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet2|), threadThread3of3ForFork1NotInUse, 208#(<= 4 |ULTIMATE.start_main_~threads_total~0#1|), 101#L686true, 200#true, Black: 179#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= 4 |ULTIMATE.start_main_~threads_total~0#1|)), 123#threadErr0ASSERT_VIOLATIONDATA_RACEtrue, Black: 184#(= |#race~data~0| |threadThread1of3ForFork1_#t~nondet2|)]) [2023-11-21 22:27:49,304 INFO L294 olderBase$Statistics]: this new event has 113 ancestors and is cut-off event [2023-11-21 22:27:49,304 INFO L297 olderBase$Statistics]: existing Event has 113 ancestors and is cut-off event [2023-11-21 22:27:49,305 INFO L297 olderBase$Statistics]: existing Event has 113 ancestors and is cut-off event [2023-11-21 22:27:49,305 INFO L297 olderBase$Statistics]: existing Event has 113 ancestors and is cut-off event [2023-11-21 22:27:49,305 INFO L297 olderBase$Statistics]: existing Event has 113 ancestors and is cut-off event [2023-11-21 22:27:50,341 INFO L124 PetriNetUnfolderBase]: 8227/31447 cut-off events. [2023-11-21 22:27:50,341 INFO L125 PetriNetUnfolderBase]: For 17956/26512 co-relation queries the response was YES. [2023-11-21 22:27:50,533 INFO L83 FinitePrefix]: Finished finitePrefix Result has 59576 conditions, 31447 events. 8227/31447 cut-off events. For 17956/26512 co-relation queries the response was YES. Maximal size of possible extension queue 1199. Compared 418976 event pairs, 1456 based on Foata normal form. 35/27486 useless extension candidates. Maximal degree in co-relation 22651. Up to 4904 conditions per place. [2023-11-21 22:27:50,653 INFO L140 encePairwiseOnDemand]: 159/167 looper letters, 56 selfloop transitions, 11 changer transitions 0/199 dead transitions. [2023-11-21 22:27:50,653 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 153 places, 199 transitions, 813 flow [2023-11-21 22:27:50,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-21 22:27:50,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-11-21 22:27:50,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1379 transitions. [2023-11-21 22:27:50,659 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8257485029940119 [2023-11-21 22:27:50,659 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1379 transitions. [2023-11-21 22:27:50,659 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1379 transitions. [2023-11-21 22:27:50,660 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-21 22:27:50,661 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1379 transitions. [2023-11-21 22:27:50,665 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 137.9) internal successors, (1379), 10 states have internal predecessors, (1379), 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-21 22:27:50,669 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 167.0) internal successors, (1837), 11 states have internal predecessors, (1837), 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-21 22:27:50,670 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 167.0) internal successors, (1837), 11 states have internal predecessors, (1837), 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-21 22:27:50,671 INFO L175 Difference]: Start difference. First operand has 144 places, 159 transitions, 597 flow. Second operand 10 states and 1379 transitions. [2023-11-21 22:27:50,671 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 153 places, 199 transitions, 813 flow [2023-11-21 22:27:50,765 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 151 places, 199 transitions, 777 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-21 22:27:50,769 INFO L231 Difference]: Finished difference. Result has 154 places, 165 transitions, 617 flow [2023-11-21 22:27:50,769 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=167, PETRI_DIFFERENCE_MINUEND_FLOW=561, PETRI_DIFFERENCE_MINUEND_PLACES=142, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=159, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=151, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=617, PETRI_PLACES=154, PETRI_TRANSITIONS=165} [2023-11-21 22:27:50,770 INFO L281 CegarLoopForPetriNet]: 134 programPoint places, 20 predicate places. [2023-11-21 22:27:50,770 INFO L495 AbstractCegarLoop]: Abstraction has has 154 places, 165 transitions, 617 flow [2023-11-21 22:27:50,771 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 133.0) internal successors, (1729), 13 states have internal predecessors, (1729), 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-21 22:27:50,771 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-21 22:27:50,771 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-21 22:27:50,786 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3cfb2781-b003-41b5-9a20-f8b9d4ddb3cd/bin/uautomizer-verify-bycVGegfSx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-21 22:27:50,972 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3cfb2781-b003-41b5-9a20-f8b9d4ddb3cd/bin/uautomizer-verify-bycVGegfSx/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2023-11-21 22:27:50,972 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 8 more)] === [2023-11-21 22:27:50,973 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:27:50,973 INFO L85 PathProgramCache]: Analyzing trace with hash -1825003820, now seen corresponding path program 1 times [2023-11-21 22:27:50,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:27:50,973 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [441477611] [2023-11-21 22:27:50,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:27:50,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:27:50,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:27:51,062 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 22:27:51,063 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:27:51,063 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [441477611] [2023-11-21 22:27:51,063 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [441477611] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 22:27:51,063 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 22:27:51,063 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-21 22:27:51,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1408287672] [2023-11-21 22:27:51,064 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 22:27:51,064 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-21 22:27:51,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:27:51,065 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-21 22:27:51,065 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-21 22:27:51,075 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 140 out of 167 [2023-11-21 22:27:51,076 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 154 places, 165 transitions, 617 flow. Second operand has 3 states, 3 states have (on average 141.66666666666666) internal successors, (425), 3 states have internal predecessors, (425), 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-21 22:27:51,076 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-21 22:27:51,076 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 140 of 167 [2023-11-21 22:27:51,076 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-21 22:27:51,866 INFO L124 PetriNetUnfolderBase]: 537/5371 cut-off events. [2023-11-21 22:27:51,866 INFO L125 PetriNetUnfolderBase]: For 1669/2201 co-relation queries the response was YES. [2023-11-21 22:27:51,881 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8452 conditions, 5371 events. 537/5371 cut-off events. For 1669/2201 co-relation queries the response was YES. Maximal size of possible extension queue 197. Compared 58326 event pairs, 214 based on Foata normal form. 134/4965 useless extension candidates. Maximal degree in co-relation 4413. Up to 446 conditions per place. [2023-11-21 22:27:51,890 INFO L140 encePairwiseOnDemand]: 159/167 looper letters, 16 selfloop transitions, 8 changer transitions 0/152 dead transitions. [2023-11-21 22:27:51,890 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 156 places, 152 transitions, 542 flow [2023-11-21 22:27:51,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-21 22:27:51,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-21 22:27:51,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 448 transitions. [2023-11-21 22:27:51,893 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8942115768463074 [2023-11-21 22:27:51,893 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 448 transitions. [2023-11-21 22:27:51,893 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 448 transitions. [2023-11-21 22:27:51,894 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-21 22:27:51,894 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 448 transitions. [2023-11-21 22:27:51,895 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 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-21 22:27:51,897 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 167.0) internal successors, (668), 4 states have internal predecessors, (668), 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-21 22:27:51,897 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 167.0) internal successors, (668), 4 states have internal predecessors, (668), 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-21 22:27:51,897 INFO L175 Difference]: Start difference. First operand has 154 places, 165 transitions, 617 flow. Second operand 3 states and 448 transitions. [2023-11-21 22:27:51,897 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 156 places, 152 transitions, 542 flow [2023-11-21 22:27:51,909 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 154 places, 152 transitions, 522 flow, removed 8 selfloop flow, removed 2 redundant places. [2023-11-21 22:27:51,912 INFO L231 Difference]: Finished difference. Result has 154 places, 145 transitions, 453 flow [2023-11-21 22:27:51,912 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=167, PETRI_DIFFERENCE_MINUEND_FLOW=437, PETRI_DIFFERENCE_MINUEND_PLACES=152, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=145, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=137, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=453, PETRI_PLACES=154, PETRI_TRANSITIONS=145} [2023-11-21 22:27:51,913 INFO L281 CegarLoopForPetriNet]: 134 programPoint places, 20 predicate places. [2023-11-21 22:27:51,913 INFO L495 AbstractCegarLoop]: Abstraction has has 154 places, 145 transitions, 453 flow [2023-11-21 22:27:51,913 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 141.66666666666666) internal successors, (425), 3 states have internal predecessors, (425), 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-21 22:27:51,914 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-21 22:27:51,914 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-21 22:27:51,914 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-11-21 22:27:51,914 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 8 more)] === [2023-11-21 22:27:51,915 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:27:51,915 INFO L85 PathProgramCache]: Analyzing trace with hash -1898177012, now seen corresponding path program 1 times [2023-11-21 22:27:51,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:27:51,915 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1122094548] [2023-11-21 22:27:51,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:27:51,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:27:51,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:27:51,988 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2023-11-21 22:27:51,988 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:27:51,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1122094548] [2023-11-21 22:27:51,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1122094548] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 22:27:51,989 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 22:27:51,989 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-21 22:27:51,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [905845412] [2023-11-21 22:27:51,989 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 22:27:51,991 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-21 22:27:51,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:27:51,991 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-21 22:27:51,992 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-21 22:27:52,023 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 130 out of 167 [2023-11-21 22:27:52,024 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 154 places, 145 transitions, 453 flow. Second operand has 3 states, 3 states have (on average 132.33333333333334) internal successors, (397), 3 states have internal predecessors, (397), 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-21 22:27:52,024 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-21 22:27:52,024 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 130 of 167 [2023-11-21 22:27:52,024 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-21 22:27:52,705 INFO L124 PetriNetUnfolderBase]: 895/5684 cut-off events. [2023-11-21 22:27:52,705 INFO L125 PetriNetUnfolderBase]: For 3999/3999 co-relation queries the response was YES. [2023-11-21 22:27:52,726 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10475 conditions, 5684 events. 895/5684 cut-off events. For 3999/3999 co-relation queries the response was YES. Maximal size of possible extension queue 265. Compared 62709 event pairs, 681 based on Foata normal form. 0/5188 useless extension candidates. Maximal degree in co-relation 10177. Up to 1484 conditions per place. [2023-11-21 22:27:52,739 INFO L140 encePairwiseOnDemand]: 162/167 looper letters, 31 selfloop transitions, 4 changer transitions 0/152 dead transitions. [2023-11-21 22:27:52,739 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 156 places, 152 transitions, 551 flow [2023-11-21 22:27:52,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-21 22:27:52,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-21 22:27:52,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 423 transitions. [2023-11-21 22:27:52,742 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.844311377245509 [2023-11-21 22:27:52,742 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 423 transitions. [2023-11-21 22:27:52,742 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 423 transitions. [2023-11-21 22:27:52,743 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-21 22:27:52,743 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 423 transitions. [2023-11-21 22:27:52,744 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 141.0) internal successors, (423), 3 states have internal predecessors, (423), 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-21 22:27:52,746 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 167.0) internal successors, (668), 4 states have internal predecessors, (668), 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-21 22:27:52,746 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 167.0) internal successors, (668), 4 states have internal predecessors, (668), 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-21 22:27:52,746 INFO L175 Difference]: Start difference. First operand has 154 places, 145 transitions, 453 flow. Second operand 3 states and 423 transitions. [2023-11-21 22:27:52,746 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 156 places, 152 transitions, 551 flow [2023-11-21 22:27:52,767 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 155 places, 152 transitions, 543 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-21 22:27:52,769 INFO L231 Difference]: Finished difference. Result has 157 places, 148 transitions, 481 flow [2023-11-21 22:27:52,769 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=167, PETRI_DIFFERENCE_MINUEND_FLOW=445, PETRI_DIFFERENCE_MINUEND_PLACES=153, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=145, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=141, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=481, PETRI_PLACES=157, PETRI_TRANSITIONS=148} [2023-11-21 22:27:52,769 INFO L281 CegarLoopForPetriNet]: 134 programPoint places, 23 predicate places. [2023-11-21 22:27:52,770 INFO L495 AbstractCegarLoop]: Abstraction has has 157 places, 148 transitions, 481 flow [2023-11-21 22:27:52,770 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 132.33333333333334) internal successors, (397), 3 states have internal predecessors, (397), 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-21 22:27:52,770 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-21 22:27:52,770 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-21 22:27:52,770 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-11-21 22:27:52,771 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 8 more)] === [2023-11-21 22:27:52,771 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:27:52,771 INFO L85 PathProgramCache]: Analyzing trace with hash -1397407907, now seen corresponding path program 1 times [2023-11-21 22:27:52,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:27:52,772 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1541128544] [2023-11-21 22:27:52,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:27:52,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:27:52,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-21 22:27:52,795 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-21 22:27:52,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-21 22:27:52,828 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-21 22:27:52,828 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-21 22:27:52,828 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (10 of 11 remaining) [2023-11-21 22:27:52,828 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (9 of 11 remaining) [2023-11-21 22:27:52,829 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (8 of 11 remaining) [2023-11-21 22:27:52,829 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (7 of 11 remaining) [2023-11-21 22:27:52,829 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (6 of 11 remaining) [2023-11-21 22:27:52,829 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (5 of 11 remaining) [2023-11-21 22:27:52,829 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (4 of 11 remaining) [2023-11-21 22:27:52,830 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (3 of 11 remaining) [2023-11-21 22:27:52,830 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (2 of 11 remaining) [2023-11-21 22:27:52,830 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (1 of 11 remaining) [2023-11-21 22:27:52,830 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (0 of 11 remaining) [2023-11-21 22:27:52,830 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-11-21 22:27:52,831 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-21 22:27:52,831 WARN L233 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2023-11-21 22:27:52,831 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2023-11-21 22:27:52,895 INFO L144 ThreadInstanceAdder]: Constructed 8 joinOtherThreadTransitions. [2023-11-21 22:27:52,899 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 211 places, 203 transitions, 486 flow [2023-11-21 22:27:53,122 INFO L124 PetriNetUnfolderBase]: 90/1098 cut-off events. [2023-11-21 22:27:53,122 INFO L125 PetriNetUnfolderBase]: For 96/96 co-relation queries the response was YES. [2023-11-21 22:27:53,127 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1211 conditions, 1098 events. 90/1098 cut-off events. For 96/96 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 5738 event pairs, 23 based on Foata normal form. 0/951 useless extension candidates. Maximal degree in co-relation 1202. Up to 80 conditions per place. [2023-11-21 22:27:53,127 INFO L82 GeneralOperation]: Start removeDead. Operand has 211 places, 203 transitions, 486 flow [2023-11-21 22:27:53,132 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 153 places, 148 transitions, 342 flow [2023-11-21 22:27:53,134 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-21 22:27:53,135 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;@1d3f373c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-21 22:27:53,135 INFO L358 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2023-11-21 22:27:53,141 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-21 22:27:53,141 INFO L124 PetriNetUnfolderBase]: 3/64 cut-off events. [2023-11-21 22:27:53,141 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-21 22:27:53,142 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-21 22:27:53,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] [2023-11-21 22:27:53,142 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 10 more)] === [2023-11-21 22:27:53,142 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:27:53,143 INFO L85 PathProgramCache]: Analyzing trace with hash -1334630712, now seen corresponding path program 1 times [2023-11-21 22:27:53,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:27:53,143 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1805592556] [2023-11-21 22:27:53,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:27:53,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:27:53,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:27:53,217 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-21 22:27:53,217 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:27:53,217 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1805592556] [2023-11-21 22:27:53,220 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1805592556] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 22:27:53,220 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 22:27:53,220 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-21 22:27:53,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [82021165] [2023-11-21 22:27:53,220 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 22:27:53,221 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-21 22:27:53,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:27:53,221 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-21 22:27:53,222 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-21 22:27:53,242 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 162 out of 203 [2023-11-21 22:27:53,244 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 153 places, 148 transitions, 342 flow. Second operand has 4 states, 4 states have (on average 163.5) internal successors, (654), 4 states have internal predecessors, (654), 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-21 22:27:53,244 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-21 22:27:53,244 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 162 of 203 [2023-11-21 22:27:53,244 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-21 22:27:56,629 INFO L124 PetriNetUnfolderBase]: 6972/24454 cut-off events. [2023-11-21 22:27:56,629 INFO L125 PetriNetUnfolderBase]: For 4726/4726 co-relation queries the response was YES. [2023-11-21 22:27:56,748 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35912 conditions, 24454 events. 6972/24454 cut-off events. For 4726/4726 co-relation queries the response was YES. Maximal size of possible extension queue 683. Compared 293484 event pairs, 3483 based on Foata normal form. 916/23139 useless extension candidates. Maximal degree in co-relation 10449. Up to 5914 conditions per place. [2023-11-21 22:27:56,836 INFO L140 encePairwiseOnDemand]: 196/203 looper letters, 36 selfloop transitions, 4 changer transitions 0/159 dead transitions. [2023-11-21 22:27:56,836 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 156 places, 159 transitions, 444 flow [2023-11-21 22:27:56,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-21 22:27:56,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-21 22:27:56,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 692 transitions. [2023-11-21 22:27:56,839 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8522167487684729 [2023-11-21 22:27:56,839 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 692 transitions. [2023-11-21 22:27:56,839 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 692 transitions. [2023-11-21 22:27:56,840 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-21 22:27:56,840 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 692 transitions. [2023-11-21 22:27:56,842 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 173.0) internal successors, (692), 4 states have internal predecessors, (692), 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-21 22:27:56,844 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 203.0) internal successors, (1015), 5 states have internal predecessors, (1015), 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-21 22:27:56,845 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 203.0) internal successors, (1015), 5 states have internal predecessors, (1015), 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-21 22:27:56,845 INFO L175 Difference]: Start difference. First operand has 153 places, 148 transitions, 342 flow. Second operand 4 states and 692 transitions. [2023-11-21 22:27:56,845 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 156 places, 159 transitions, 444 flow [2023-11-21 22:27:56,849 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 154 places, 159 transitions, 440 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-21 22:27:56,852 INFO L231 Difference]: Finished difference. Result has 155 places, 147 transitions, 350 flow [2023-11-21 22:27:56,852 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=203, PETRI_DIFFERENCE_MINUEND_FLOW=334, PETRI_DIFFERENCE_MINUEND_PLACES=151, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=146, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=142, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=350, PETRI_PLACES=155, PETRI_TRANSITIONS=147} [2023-11-21 22:27:56,853 INFO L281 CegarLoopForPetriNet]: 153 programPoint places, 2 predicate places. [2023-11-21 22:27:56,853 INFO L495 AbstractCegarLoop]: Abstraction has has 155 places, 147 transitions, 350 flow [2023-11-21 22:27:56,854 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 163.5) internal successors, (654), 4 states have internal predecessors, (654), 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-21 22:27:56,854 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-21 22:27:56,854 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] [2023-11-21 22:27:56,854 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-11-21 22:27:56,854 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 10 more)] === [2023-11-21 22:27:56,855 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:27:56,855 INFO L85 PathProgramCache]: Analyzing trace with hash -270948980, now seen corresponding path program 1 times [2023-11-21 22:27:56,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:27:56,855 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1596967404] [2023-11-21 22:27:56,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:27:56,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:27:56,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:27:56,882 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 22:27:56,882 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:27:56,883 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1596967404] [2023-11-21 22:27:56,883 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1596967404] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 22:27:56,883 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 22:27:56,883 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-21 22:27:56,883 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [539796482] [2023-11-21 22:27:56,883 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 22:27:56,884 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-21 22:27:56,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:27:56,884 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-21 22:27:56,885 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-21 22:27:56,926 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 156 out of 203 [2023-11-21 22:27:56,927 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 155 places, 147 transitions, 350 flow. Second operand has 3 states, 3 states have (on average 157.66666666666666) internal successors, (473), 3 states have internal predecessors, (473), 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-21 22:27:56,927 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-21 22:27:56,927 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 156 of 203 [2023-11-21 22:27:56,927 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand