./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-data-race.prp --file ../../sv-benchmarks/c/goblint-regression/28-race_reach_60-invariant_racefree.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 0e0057cc Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d6a647e-6d30-4c1e-a98b-c4caa8a6fa56/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d6a647e-6d30-4c1e-a98b-c4caa8a6fa56/bin/uautomizer-verify-BQ2R08f2Ya/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d6a647e-6d30-4c1e-a98b-c4caa8a6fa56/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d6a647e-6d30-4c1e-a98b-c4caa8a6fa56/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerReach.xml -i ../../sv-benchmarks/c/goblint-regression/28-race_reach_60-invariant_racefree.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d6a647e-6d30-4c1e-a98b-c4caa8a6fa56/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d6a647e-6d30-4c1e-a98b-c4caa8a6fa56/bin/uautomizer-verify-BQ2R08f2Ya --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! data-race) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash ca8ac8d2a0a0bfcebfb7f99229747142c166641dd0f1bf091ac2b4ae67e9ee75 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-28 23:43:58,168 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-28 23:43:58,242 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d6a647e-6d30-4c1e-a98b-c4caa8a6fa56/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-DataRace-32bit-Automizer_Default.epf [2023-11-28 23:43:58,247 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-28 23:43:58,248 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-28 23:43:58,275 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-28 23:43:58,276 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-28 23:43:58,277 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-28 23:43:58,278 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-28 23:43:58,278 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-28 23:43:58,279 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-28 23:43:58,280 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-28 23:43:58,280 INFO L153 SettingsManager]: * Use SBE=true [2023-11-28 23:43:58,281 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-28 23:43:58,282 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-28 23:43:58,282 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-28 23:43:58,283 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-28 23:43:58,283 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-28 23:43:58,284 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-28 23:43:58,284 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-28 23:43:58,285 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-28 23:43:58,286 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-28 23:43:58,286 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2023-11-28 23:43:58,287 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-28 23:43:58,287 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-28 23:43:58,288 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-28 23:43:58,289 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-28 23:43:58,289 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-28 23:43:58,290 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-28 23:43:58,290 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-28 23:43:58,291 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-28 23:43:58,291 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-28 23:43:58,292 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-28 23:43:58,292 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-28 23:43:58,292 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-28 23:43:58,292 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-28 23:43:58,293 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-28 23:43:58,293 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-28 23:43:58,293 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-28 23:43:58,293 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-28 23:43:58,294 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-28 23:43:58,294 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_6d6a647e-6d30-4c1e-a98b-c4caa8a6fa56/bin/uautomizer-verify-BQ2R08f2Ya/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d6a647e-6d30-4c1e-a98b-c4caa8a6fa56/bin/uautomizer-verify-BQ2R08f2Ya Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! data-race) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> ca8ac8d2a0a0bfcebfb7f99229747142c166641dd0f1bf091ac2b4ae67e9ee75 [2023-11-28 23:43:58,546 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-28 23:43:58,568 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-28 23:43:58,571 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-28 23:43:58,572 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-28 23:43:58,572 INFO L274 PluginConnector]: CDTParser initialized [2023-11-28 23:43:58,573 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d6a647e-6d30-4c1e-a98b-c4caa8a6fa56/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/goblint-regression/28-race_reach_60-invariant_racefree.i [2023-11-28 23:44:01,621 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-28 23:44:01,895 INFO L384 CDTParser]: Found 1 translation units. [2023-11-28 23:44:01,895 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d6a647e-6d30-4c1e-a98b-c4caa8a6fa56/sv-benchmarks/c/goblint-regression/28-race_reach_60-invariant_racefree.i [2023-11-28 23:44:01,912 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d6a647e-6d30-4c1e-a98b-c4caa8a6fa56/bin/uautomizer-verify-BQ2R08f2Ya/data/08293d924/39937f3c4e8740ea85648a82361b7975/FLAG73936d2d7 [2023-11-28 23:44:02,184 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d6a647e-6d30-4c1e-a98b-c4caa8a6fa56/bin/uautomizer-verify-BQ2R08f2Ya/data/08293d924/39937f3c4e8740ea85648a82361b7975 [2023-11-28 23:44:02,187 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-28 23:44:02,189 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-28 23:44:02,190 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-28 23:44:02,190 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-28 23:44:02,195 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-28 23:44:02,196 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 11:44:02" (1/1) ... [2023-11-28 23:44:02,197 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1ee260b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:44:02, skipping insertion in model container [2023-11-28 23:44:02,197 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 11:44:02" (1/1) ... [2023-11-28 23:44:02,247 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-28 23:44:02,570 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-28 23:44:02,584 INFO L202 MainTranslator]: Completed pre-run [2023-11-28 23:44:02,631 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-28 23:44:02,669 INFO L206 MainTranslator]: Completed translation [2023-11-28 23:44:02,670 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:44:02 WrapperNode [2023-11-28 23:44:02,670 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-28 23:44:02,671 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-28 23:44:02,671 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-28 23:44:02,671 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-28 23:44:02,677 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:44:02" (1/1) ... [2023-11-28 23:44:02,693 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:44:02" (1/1) ... [2023-11-28 23:44:02,722 INFO L138 Inliner]: procedures = 171, calls = 44, calls flagged for inlining = 5, calls inlined = 6, statements flattened = 209 [2023-11-28 23:44:02,722 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-28 23:44:02,723 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-28 23:44:02,723 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-28 23:44:02,724 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-28 23:44:02,732 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:44:02" (1/1) ... [2023-11-28 23:44:02,733 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:44:02" (1/1) ... [2023-11-28 23:44:02,736 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:44:02" (1/1) ... [2023-11-28 23:44:02,736 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:44:02" (1/1) ... [2023-11-28 23:44:02,745 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:44:02" (1/1) ... [2023-11-28 23:44:02,751 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:44:02" (1/1) ... [2023-11-28 23:44:02,753 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:44:02" (1/1) ... [2023-11-28 23:44:02,755 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:44:02" (1/1) ... [2023-11-28 23:44:02,760 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-28 23:44:02,761 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-28 23:44:02,761 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-28 23:44:02,761 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-28 23:44:02,762 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:44:02" (1/1) ... [2023-11-28 23:44:02,769 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-28 23:44:02,779 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d6a647e-6d30-4c1e-a98b-c4caa8a6fa56/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-28 23:44:02,792 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d6a647e-6d30-4c1e-a98b-c4caa8a6fa56/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-28 23:44:02,794 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d6a647e-6d30-4c1e-a98b-c4caa8a6fa56/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-28 23:44:02,826 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-28 23:44:02,826 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-28 23:44:02,826 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2023-11-28 23:44:02,826 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-28 23:44:02,826 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-28 23:44:02,827 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2023-11-28 23:44:02,827 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2023-11-28 23:44:02,827 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-28 23:44:02,827 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-28 23:44:02,827 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2023-11-28 23:44:02,827 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-28 23:44:02,827 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-28 23:44:02,829 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-28 23:44:02,967 INFO L241 CfgBuilder]: Building ICFG [2023-11-28 23:44:02,969 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-28 23:44:03,276 INFO L282 CfgBuilder]: Performing block encoding [2023-11-28 23:44:03,325 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-28 23:44:03,325 INFO L309 CfgBuilder]: Removed 18 assume(true) statements. [2023-11-28 23:44:03,327 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:44:03 BoogieIcfgContainer [2023-11-28 23:44:03,328 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-28 23:44:03,330 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-28 23:44:03,330 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-28 23:44:03,333 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-28 23:44:03,333 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 11:44:02" (1/3) ... [2023-11-28 23:44:03,334 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@32b10b7d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 11:44:03, skipping insertion in model container [2023-11-28 23:44:03,334 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:44:02" (2/3) ... [2023-11-28 23:44:03,335 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@32b10b7d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 11:44:03, skipping insertion in model container [2023-11-28 23:44:03,335 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:44:03" (3/3) ... [2023-11-28 23:44:03,336 INFO L112 eAbstractionObserver]: Analyzing ICFG 28-race_reach_60-invariant_racefree.i [2023-11-28 23:44:03,344 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-11-28 23:44:03,353 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-28 23:44:03,353 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 12 error locations. [2023-11-28 23:44:03,353 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-28 23:44:03,422 INFO L144 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2023-11-28 23:44:03,461 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 187 places, 208 transitions, 423 flow [2023-11-28 23:44:03,576 INFO L124 PetriNetUnfolderBase]: 36/301 cut-off events. [2023-11-28 23:44:03,576 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2023-11-28 23:44:03,598 INFO L83 FinitePrefix]: Finished finitePrefix Result has 306 conditions, 301 events. 36/301 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 1356 event pairs, 0 based on Foata normal form. 0/244 useless extension candidates. Maximal degree in co-relation 176. Up to 6 conditions per place. [2023-11-28 23:44:03,599 INFO L82 GeneralOperation]: Start removeDead. Operand has 187 places, 208 transitions, 423 flow [2023-11-28 23:44:03,619 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 187 places, 208 transitions, 423 flow [2023-11-28 23:44:03,630 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-28 23:44:03,638 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;@2bfbc64b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-28 23:44:03,638 INFO L358 AbstractCegarLoop]: Starting to check reachability of 19 error locations. [2023-11-28 23:44:03,652 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-28 23:44:03,653 INFO L124 PetriNetUnfolderBase]: 4/62 cut-off events. [2023-11-28 23:44:03,653 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-28 23:44:03,653 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-28 23:44:03,654 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] [2023-11-28 23:44:03,654 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 16 more)] === [2023-11-28 23:44:03,660 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 23:44:03,660 INFO L85 PathProgramCache]: Analyzing trace with hash -940027554, now seen corresponding path program 1 times [2023-11-28 23:44:03,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 23:44:03,671 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1183733834] [2023-11-28 23:44:03,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 23:44:03,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 23:44:03,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:44:03,877 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-28 23:44:03,878 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 23:44:03,878 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1183733834] [2023-11-28 23:44:03,879 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1183733834] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 23:44:03,879 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 23:44:03,879 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-28 23:44:03,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1263597120] [2023-11-28 23:44:03,882 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 23:44:03,890 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-28 23:44:03,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 23:44:03,916 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-28 23:44:03,916 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-28 23:44:03,919 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 165 out of 208 [2023-11-28 23:44:03,923 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 187 places, 208 transitions, 423 flow. Second operand has 2 states, 2 states have (on average 166.5) internal successors, (333), 2 states have internal predecessors, (333), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:44:03,923 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-28 23:44:03,923 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 165 of 208 [2023-11-28 23:44:03,925 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-28 23:44:04,135 INFO L124 PetriNetUnfolderBase]: 82/842 cut-off events. [2023-11-28 23:44:04,135 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2023-11-28 23:44:04,140 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1019 conditions, 842 events. 82/842 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 5126 event pairs, 72 based on Foata normal form. 153/890 useless extension candidates. Maximal degree in co-relation 893. Up to 172 conditions per place. [2023-11-28 23:44:04,145 INFO L140 encePairwiseOnDemand]: 186/208 looper letters, 19 selfloop transitions, 0 changer transitions 0/180 dead transitions. [2023-11-28 23:44:04,145 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 182 places, 180 transitions, 405 flow [2023-11-28 23:44:04,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-28 23:44:04,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-11-28 23:44:04,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 371 transitions. [2023-11-28 23:44:04,160 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8918269230769231 [2023-11-28 23:44:04,161 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 371 transitions. [2023-11-28 23:44:04,162 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 371 transitions. [2023-11-28 23:44:04,163 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-28 23:44:04,166 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 371 transitions. [2023-11-28 23:44:04,170 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 185.5) internal successors, (371), 2 states have internal predecessors, (371), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:44:04,175 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 208.0) internal successors, (624), 3 states have internal predecessors, (624), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:44:04,176 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 208.0) internal successors, (624), 3 states have internal predecessors, (624), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:44:04,178 INFO L175 Difference]: Start difference. First operand has 187 places, 208 transitions, 423 flow. Second operand 2 states and 371 transitions. [2023-11-28 23:44:04,179 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 182 places, 180 transitions, 405 flow [2023-11-28 23:44:04,182 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 182 places, 180 transitions, 405 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-28 23:44:04,187 INFO L231 Difference]: Finished difference. Result has 182 places, 180 transitions, 367 flow [2023-11-28 23:44:04,189 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=208, PETRI_DIFFERENCE_MINUEND_FLOW=367, PETRI_DIFFERENCE_MINUEND_PLACES=181, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=180, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=180, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=367, PETRI_PLACES=182, PETRI_TRANSITIONS=180} [2023-11-28 23:44:04,193 INFO L281 CegarLoopForPetriNet]: 187 programPoint places, -5 predicate places. [2023-11-28 23:44:04,193 INFO L495 AbstractCegarLoop]: Abstraction has has 182 places, 180 transitions, 367 flow [2023-11-28 23:44:04,194 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 166.5) internal successors, (333), 2 states have internal predecessors, (333), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:44:04,194 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-28 23:44:04,194 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] [2023-11-28 23:44:04,194 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-28 23:44:04,195 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 16 more)] === [2023-11-28 23:44:04,195 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 23:44:04,195 INFO L85 PathProgramCache]: Analyzing trace with hash -937266551, now seen corresponding path program 1 times [2023-11-28 23:44:04,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 23:44:04,196 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [190990015] [2023-11-28 23:44:04,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 23:44:04,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 23:44:04,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:44:04,314 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-28 23:44:04,315 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 23:44:04,315 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [190990015] [2023-11-28 23:44:04,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [190990015] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 23:44:04,315 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 23:44:04,315 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-28 23:44:04,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [587123081] [2023-11-28 23:44:04,316 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 23:44:04,317 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-28 23:44:04,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 23:44:04,318 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-28 23:44:04,318 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-28 23:44:04,338 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 159 out of 208 [2023-11-28 23:44:04,339 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 182 places, 180 transitions, 367 flow. Second operand has 3 states, 3 states have (on average 161.0) internal successors, (483), 3 states have internal predecessors, (483), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:44:04,340 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-28 23:44:04,340 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 159 of 208 [2023-11-28 23:44:04,340 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-28 23:44:04,570 INFO L124 PetriNetUnfolderBase]: 110/1038 cut-off events. [2023-11-28 23:44:04,571 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2023-11-28 23:44:04,573 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1287 conditions, 1038 events. 110/1038 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 6564 event pairs, 88 based on Foata normal form. 1/927 useless extension candidates. Maximal degree in co-relation 1283. Up to 232 conditions per place. [2023-11-28 23:44:04,577 INFO L140 encePairwiseOnDemand]: 205/208 looper letters, 32 selfloop transitions, 2 changer transitions 0/189 dead transitions. [2023-11-28 23:44:04,578 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 184 places, 189 transitions, 453 flow [2023-11-28 23:44:04,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-28 23:44:04,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-28 23:44:04,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 512 transitions. [2023-11-28 23:44:04,582 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8205128205128205 [2023-11-28 23:44:04,582 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 512 transitions. [2023-11-28 23:44:04,583 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 512 transitions. [2023-11-28 23:44:04,583 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-28 23:44:04,584 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 512 transitions. [2023-11-28 23:44:04,586 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 170.66666666666666) internal successors, (512), 3 states have internal predecessors, (512), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:44:04,590 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 208.0) internal successors, (832), 4 states have internal predecessors, (832), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:44:04,590 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 208.0) internal successors, (832), 4 states have internal predecessors, (832), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:44:04,591 INFO L175 Difference]: Start difference. First operand has 182 places, 180 transitions, 367 flow. Second operand 3 states and 512 transitions. [2023-11-28 23:44:04,591 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 184 places, 189 transitions, 453 flow [2023-11-28 23:44:04,593 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 184 places, 189 transitions, 453 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-28 23:44:04,597 INFO L231 Difference]: Finished difference. Result has 185 places, 180 transitions, 375 flow [2023-11-28 23:44:04,597 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=208, PETRI_DIFFERENCE_MINUEND_FLOW=367, PETRI_DIFFERENCE_MINUEND_PLACES=182, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=180, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=178, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=375, PETRI_PLACES=185, PETRI_TRANSITIONS=180} [2023-11-28 23:44:04,598 INFO L281 CegarLoopForPetriNet]: 187 programPoint places, -2 predicate places. [2023-11-28 23:44:04,599 INFO L495 AbstractCegarLoop]: Abstraction has has 185 places, 180 transitions, 375 flow [2023-11-28 23:44:04,599 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 161.0) internal successors, (483), 3 states have internal predecessors, (483), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:44:04,600 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-28 23:44:04,600 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] [2023-11-28 23:44:04,600 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-28 23:44:04,600 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 16 more)] === [2023-11-28 23:44:04,601 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 23:44:04,601 INFO L85 PathProgramCache]: Analyzing trace with hash 1051888379, now seen corresponding path program 1 times [2023-11-28 23:44:04,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 23:44:04,602 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [253117509] [2023-11-28 23:44:04,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 23:44:04,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 23:44:04,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:44:04,665 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-28 23:44:04,665 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 23:44:04,665 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [253117509] [2023-11-28 23:44:04,666 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [253117509] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 23:44:04,666 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 23:44:04,666 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-28 23:44:04,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1990980699] [2023-11-28 23:44:04,667 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 23:44:04,667 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-28 23:44:04,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 23:44:04,668 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-28 23:44:04,668 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-28 23:44:04,722 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 140 out of 208 [2023-11-28 23:44:04,723 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 185 places, 180 transitions, 375 flow. Second operand has 3 states, 3 states have (on average 141.33333333333334) internal successors, (424), 3 states have internal predecessors, (424), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:44:04,723 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-28 23:44:04,723 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 140 of 208 [2023-11-28 23:44:04,723 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-28 23:44:05,140 INFO L124 PetriNetUnfolderBase]: 442/2612 cut-off events. [2023-11-28 23:44:05,141 INFO L125 PetriNetUnfolderBase]: For 11/11 co-relation queries the response was YES. [2023-11-28 23:44:05,144 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3598 conditions, 2612 events. 442/2612 cut-off events. For 11/11 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 21152 event pairs, 174 based on Foata normal form. 0/2367 useless extension candidates. Maximal degree in co-relation 3592. Up to 608 conditions per place. [2023-11-28 23:44:05,156 INFO L140 encePairwiseOnDemand]: 183/208 looper letters, 62 selfloop transitions, 18 changer transitions 0/216 dead transitions. [2023-11-28 23:44:05,156 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 187 places, 216 transitions, 610 flow [2023-11-28 23:44:05,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-28 23:44:05,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-28 23:44:05,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 507 transitions. [2023-11-28 23:44:05,159 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8125 [2023-11-28 23:44:05,159 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 507 transitions. [2023-11-28 23:44:05,159 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 507 transitions. [2023-11-28 23:44:05,160 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-28 23:44:05,160 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 507 transitions. [2023-11-28 23:44:05,162 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 169.0) internal successors, (507), 3 states have internal predecessors, (507), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:44:05,163 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 208.0) internal successors, (832), 4 states have internal predecessors, (832), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:44:05,164 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 208.0) internal successors, (832), 4 states have internal predecessors, (832), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:44:05,164 INFO L175 Difference]: Start difference. First operand has 185 places, 180 transitions, 375 flow. Second operand 3 states and 507 transitions. [2023-11-28 23:44:05,164 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 187 places, 216 transitions, 610 flow [2023-11-28 23:44:05,167 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 185 places, 216 transitions, 606 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-28 23:44:05,170 INFO L231 Difference]: Finished difference. Result has 187 places, 198 transitions, 529 flow [2023-11-28 23:44:05,171 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=208, PETRI_DIFFERENCE_MINUEND_FLOW=371, PETRI_DIFFERENCE_MINUEND_PLACES=183, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=180, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=162, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=529, PETRI_PLACES=187, PETRI_TRANSITIONS=198} [2023-11-28 23:44:05,172 INFO L281 CegarLoopForPetriNet]: 187 programPoint places, 0 predicate places. [2023-11-28 23:44:05,172 INFO L495 AbstractCegarLoop]: Abstraction has has 187 places, 198 transitions, 529 flow [2023-11-28 23:44:05,173 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 141.33333333333334) internal successors, (424), 3 states have internal predecessors, (424), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:44:05,173 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-28 23:44:05,173 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] [2023-11-28 23:44:05,173 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-28 23:44:05,174 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 16 more)] === [2023-11-28 23:44:05,174 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 23:44:05,174 INFO L85 PathProgramCache]: Analyzing trace with hash 1990133874, now seen corresponding path program 1 times [2023-11-28 23:44:05,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 23:44:05,175 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1296393562] [2023-11-28 23:44:05,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 23:44:05,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 23:44:05,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-28 23:44:05,206 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-28 23:44:05,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-28 23:44:05,247 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-28 23:44:05,247 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-28 23:44:05,248 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (18 of 19 remaining) [2023-11-28 23:44:05,250 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (17 of 19 remaining) [2023-11-28 23:44:05,250 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (16 of 19 remaining) [2023-11-28 23:44:05,250 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (15 of 19 remaining) [2023-11-28 23:44:05,250 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (14 of 19 remaining) [2023-11-28 23:44:05,251 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (13 of 19 remaining) [2023-11-28 23:44:05,251 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (12 of 19 remaining) [2023-11-28 23:44:05,251 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (11 of 19 remaining) [2023-11-28 23:44:05,252 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (10 of 19 remaining) [2023-11-28 23:44:05,252 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (9 of 19 remaining) [2023-11-28 23:44:05,252 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr4ASSERT_VIOLATIONDATA_RACE (8 of 19 remaining) [2023-11-28 23:44:05,253 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE (7 of 19 remaining) [2023-11-28 23:44:05,253 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr5ASSERT_VIOLATIONDATA_RACE (6 of 19 remaining) [2023-11-28 23:44:05,253 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (5 of 19 remaining) [2023-11-28 23:44:05,253 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (4 of 19 remaining) [2023-11-28 23:44:05,254 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (3 of 19 remaining) [2023-11-28 23:44:05,254 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr4ASSERT_VIOLATIONDATA_RACE (2 of 19 remaining) [2023-11-28 23:44:05,254 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE (1 of 19 remaining) [2023-11-28 23:44:05,255 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr5ASSERT_VIOLATIONDATA_RACE (0 of 19 remaining) [2023-11-28 23:44:05,255 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-28 23:44:05,255 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2023-11-28 23:44:05,258 WARN L233 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2023-11-28 23:44:05,258 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2023-11-28 23:44:05,304 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2023-11-28 23:44:05,310 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 257 places, 288 transitions, 592 flow [2023-11-28 23:44:05,378 INFO L124 PetriNetUnfolderBase]: 62/506 cut-off events. [2023-11-28 23:44:05,378 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2023-11-28 23:44:05,381 INFO L83 FinitePrefix]: Finished finitePrefix Result has 518 conditions, 506 events. 62/506 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 2531 event pairs, 0 based on Foata normal form. 0/409 useless extension candidates. Maximal degree in co-relation 303. Up to 9 conditions per place. [2023-11-28 23:44:05,382 INFO L82 GeneralOperation]: Start removeDead. Operand has 257 places, 288 transitions, 592 flow [2023-11-28 23:44:05,390 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 257 places, 288 transitions, 592 flow [2023-11-28 23:44:05,391 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-28 23:44:05,393 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;@2bfbc64b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-28 23:44:05,393 INFO L358 AbstractCegarLoop]: Starting to check reachability of 25 error locations. [2023-11-28 23:44:05,399 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-28 23:44:05,399 INFO L124 PetriNetUnfolderBase]: 4/62 cut-off events. [2023-11-28 23:44:05,399 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-28 23:44:05,400 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-28 23:44:05,400 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] [2023-11-28 23:44:05,400 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2023-11-28 23:44:05,401 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 23:44:05,401 INFO L85 PathProgramCache]: Analyzing trace with hash 162706782, now seen corresponding path program 1 times [2023-11-28 23:44:05,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 23:44:05,401 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [866274326] [2023-11-28 23:44:05,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 23:44:05,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 23:44:05,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:44:05,434 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-28 23:44:05,434 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 23:44:05,435 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [866274326] [2023-11-28 23:44:05,435 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [866274326] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 23:44:05,435 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 23:44:05,435 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-28 23:44:05,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [311356386] [2023-11-28 23:44:05,436 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 23:44:05,436 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-28 23:44:05,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 23:44:05,437 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-28 23:44:05,437 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-28 23:44:05,439 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 223 out of 288 [2023-11-28 23:44:05,440 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 257 places, 288 transitions, 592 flow. Second operand has 2 states, 2 states have (on average 224.5) internal successors, (449), 2 states have internal predecessors, (449), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:44:05,440 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-28 23:44:05,440 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 223 of 288 [2023-11-28 23:44:05,440 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-28 23:44:07,033 INFO L124 PetriNetUnfolderBase]: 1733/9092 cut-off events. [2023-11-28 23:44:07,033 INFO L125 PetriNetUnfolderBase]: For 101/101 co-relation queries the response was YES. [2023-11-28 23:44:07,068 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11792 conditions, 9092 events. 1733/9092 cut-off events. For 101/101 co-relation queries the response was YES. Maximal size of possible extension queue 220. Compared 101466 event pairs, 1620 based on Foata normal form. 2257/10230 useless extension candidates. Maximal degree in co-relation 10594. Up to 2642 conditions per place. [2023-11-28 23:44:07,125 INFO L140 encePairwiseOnDemand]: 256/288 looper letters, 30 selfloop transitions, 0 changer transitions 0/247 dead transitions. [2023-11-28 23:44:07,125 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 249 places, 247 transitions, 570 flow [2023-11-28 23:44:07,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-28 23:44:07,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-11-28 23:44:07,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 508 transitions. [2023-11-28 23:44:07,128 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8819444444444444 [2023-11-28 23:44:07,128 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 508 transitions. [2023-11-28 23:44:07,128 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 508 transitions. [2023-11-28 23:44:07,129 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-28 23:44:07,129 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 508 transitions. [2023-11-28 23:44:07,131 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 254.0) internal successors, (508), 2 states have internal predecessors, (508), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:44:07,133 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 288.0) internal successors, (864), 3 states have internal predecessors, (864), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:44:07,134 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 288.0) internal successors, (864), 3 states have internal predecessors, (864), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:44:07,134 INFO L175 Difference]: Start difference. First operand has 257 places, 288 transitions, 592 flow. Second operand 2 states and 508 transitions. [2023-11-28 23:44:07,134 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 249 places, 247 transitions, 570 flow [2023-11-28 23:44:07,137 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 249 places, 247 transitions, 570 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-28 23:44:07,141 INFO L231 Difference]: Finished difference. Result has 249 places, 247 transitions, 510 flow [2023-11-28 23:44:07,142 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=288, PETRI_DIFFERENCE_MINUEND_FLOW=510, PETRI_DIFFERENCE_MINUEND_PLACES=248, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=247, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=247, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=510, PETRI_PLACES=249, PETRI_TRANSITIONS=247} [2023-11-28 23:44:07,143 INFO L281 CegarLoopForPetriNet]: 257 programPoint places, -8 predicate places. [2023-11-28 23:44:07,143 INFO L495 AbstractCegarLoop]: Abstraction has has 249 places, 247 transitions, 510 flow [2023-11-28 23:44:07,144 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 224.5) internal successors, (449), 2 states have internal predecessors, (449), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:44:07,144 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-28 23:44:07,144 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] [2023-11-28 23:44:07,144 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-28 23:44:07,144 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2023-11-28 23:44:07,145 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 23:44:07,145 INFO L85 PathProgramCache]: Analyzing trace with hash 165467785, now seen corresponding path program 1 times [2023-11-28 23:44:07,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 23:44:07,145 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [409734771] [2023-11-28 23:44:07,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 23:44:07,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 23:44:07,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:44:07,196 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-28 23:44:07,196 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 23:44:07,196 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [409734771] [2023-11-28 23:44:07,197 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [409734771] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 23:44:07,197 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 23:44:07,197 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-28 23:44:07,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1494974795] [2023-11-28 23:44:07,197 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 23:44:07,198 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-28 23:44:07,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 23:44:07,199 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-28 23:44:07,199 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-28 23:44:07,242 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 217 out of 288 [2023-11-28 23:44:07,243 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 249 places, 247 transitions, 510 flow. Second operand has 3 states, 3 states have (on average 219.0) internal successors, (657), 3 states have internal predecessors, (657), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:44:07,243 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-28 23:44:07,243 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 217 of 288 [2023-11-28 23:44:07,243 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-28 23:44:09,090 INFO L124 PetriNetUnfolderBase]: 2529/12684 cut-off events. [2023-11-28 23:44:09,091 INFO L125 PetriNetUnfolderBase]: For 107/107 co-relation queries the response was YES. [2023-11-28 23:44:09,135 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16593 conditions, 12684 events. 2529/12684 cut-off events. For 107/107 co-relation queries the response was YES. Maximal size of possible extension queue 280. Compared 148652 event pairs, 1098 based on Foata normal form. 1/11258 useless extension candidates. Maximal degree in co-relation 16588. Up to 3840 conditions per place. [2023-11-28 23:44:09,193 INFO L140 encePairwiseOnDemand]: 285/288 looper letters, 44 selfloop transitions, 2 changer transitions 0/257 dead transitions. [2023-11-28 23:44:09,193 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 251 places, 257 transitions, 622 flow [2023-11-28 23:44:09,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-28 23:44:09,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-28 23:44:09,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 698 transitions. [2023-11-28 23:44:09,197 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8078703703703703 [2023-11-28 23:44:09,197 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 698 transitions. [2023-11-28 23:44:09,197 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 698 transitions. [2023-11-28 23:44:09,198 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-28 23:44:09,198 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 698 transitions. [2023-11-28 23:44:09,201 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 232.66666666666666) internal successors, (698), 3 states have internal predecessors, (698), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:44:09,204 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 288.0) internal successors, (1152), 4 states have internal predecessors, (1152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:44:09,205 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 288.0) internal successors, (1152), 4 states have internal predecessors, (1152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:44:09,206 INFO L175 Difference]: Start difference. First operand has 249 places, 247 transitions, 510 flow. Second operand 3 states and 698 transitions. [2023-11-28 23:44:09,206 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 251 places, 257 transitions, 622 flow [2023-11-28 23:44:09,208 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 251 places, 257 transitions, 622 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-28 23:44:09,213 INFO L231 Difference]: Finished difference. Result has 252 places, 248 transitions, 522 flow [2023-11-28 23:44:09,214 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=288, PETRI_DIFFERENCE_MINUEND_FLOW=510, PETRI_DIFFERENCE_MINUEND_PLACES=249, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=247, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=245, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=522, PETRI_PLACES=252, PETRI_TRANSITIONS=248} [2023-11-28 23:44:09,214 INFO L281 CegarLoopForPetriNet]: 257 programPoint places, -5 predicate places. [2023-11-28 23:44:09,215 INFO L495 AbstractCegarLoop]: Abstraction has has 252 places, 248 transitions, 522 flow [2023-11-28 23:44:09,215 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 219.0) internal successors, (657), 3 states have internal predecessors, (657), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:44:09,216 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-28 23:44:09,216 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] [2023-11-28 23:44:09,216 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-28 23:44:09,216 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2023-11-28 23:44:09,216 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 23:44:09,217 INFO L85 PathProgramCache]: Analyzing trace with hash -1184978803, now seen corresponding path program 1 times [2023-11-28 23:44:09,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 23:44:09,217 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [696378278] [2023-11-28 23:44:09,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 23:44:09,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 23:44:09,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:44:09,259 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-28 23:44:09,259 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 23:44:09,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [696378278] [2023-11-28 23:44:09,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [696378278] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 23:44:09,260 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 23:44:09,260 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-28 23:44:09,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [345913155] [2023-11-28 23:44:09,260 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 23:44:09,261 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-28 23:44:09,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 23:44:09,261 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-28 23:44:09,262 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-28 23:44:09,344 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 184 out of 288 [2023-11-28 23:44:09,346 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 252 places, 248 transitions, 522 flow. Second operand has 3 states, 3 states have (on average 185.33333333333334) internal successors, (556), 3 states have internal predecessors, (556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:44:09,346 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-28 23:44:09,346 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 184 of 288 [2023-11-28 23:44:09,346 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-28 23:44:19,818 INFO L124 PetriNetUnfolderBase]: 26162/86102 cut-off events. [2023-11-28 23:44:19,819 INFO L125 PetriNetUnfolderBase]: For 549/549 co-relation queries the response was YES. [2023-11-28 23:44:19,980 INFO L83 FinitePrefix]: Finished finitePrefix Result has 128385 conditions, 86102 events. 26162/86102 cut-off events. For 549/549 co-relation queries the response was YES. Maximal size of possible extension queue 1647. Compared 1204059 event pairs, 10794 based on Foata normal form. 0/77051 useless extension candidates. Maximal degree in co-relation 128378. Up to 26496 conditions per place. [2023-11-28 23:44:20,358 INFO L140 encePairwiseOnDemand]: 249/288 looper letters, 98 selfloop transitions, 28 changer transitions 0/305 dead transitions. [2023-11-28 23:44:20,358 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 254 places, 305 transitions, 899 flow [2023-11-28 23:44:20,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-28 23:44:20,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-28 23:44:20,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 689 transitions. [2023-11-28 23:44:20,362 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7974537037037037 [2023-11-28 23:44:20,362 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 689 transitions. [2023-11-28 23:44:20,362 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 689 transitions. [2023-11-28 23:44:20,363 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-28 23:44:20,363 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 689 transitions. [2023-11-28 23:44:20,365 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 229.66666666666666) internal successors, (689), 3 states have internal predecessors, (689), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:44:20,368 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 288.0) internal successors, (1152), 4 states have internal predecessors, (1152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:44:20,369 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 288.0) internal successors, (1152), 4 states have internal predecessors, (1152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:44:20,369 INFO L175 Difference]: Start difference. First operand has 252 places, 248 transitions, 522 flow. Second operand 3 states and 689 transitions. [2023-11-28 23:44:20,369 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 254 places, 305 transitions, 899 flow [2023-11-28 23:44:20,375 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 253 places, 305 transitions, 897 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-28 23:44:20,380 INFO L231 Difference]: Finished difference. Result has 255 places, 276 transitions, 766 flow [2023-11-28 23:44:20,381 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=288, PETRI_DIFFERENCE_MINUEND_FLOW=520, PETRI_DIFFERENCE_MINUEND_PLACES=251, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=248, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=220, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=766, PETRI_PLACES=255, PETRI_TRANSITIONS=276} [2023-11-28 23:44:20,382 INFO L281 CegarLoopForPetriNet]: 257 programPoint places, -2 predicate places. [2023-11-28 23:44:20,382 INFO L495 AbstractCegarLoop]: Abstraction has has 255 places, 276 transitions, 766 flow [2023-11-28 23:44:20,383 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 185.33333333333334) internal successors, (556), 3 states have internal predecessors, (556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:44:20,383 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-28 23:44:20,383 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-28 23:44:20,383 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-28 23:44:20,384 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting t_funErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2023-11-28 23:44:20,384 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 23:44:20,385 INFO L85 PathProgramCache]: Analyzing trace with hash 547700665, now seen corresponding path program 1 times [2023-11-28 23:44:20,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 23:44:20,385 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1471602748] [2023-11-28 23:44:20,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 23:44:20,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 23:44:20,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:44:20,442 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-28 23:44:20,442 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 23:44:20,443 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1471602748] [2023-11-28 23:44:20,443 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1471602748] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 23:44:20,443 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 23:44:20,443 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-28 23:44:20,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1242188900] [2023-11-28 23:44:20,444 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 23:44:20,444 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-28 23:44:20,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 23:44:20,445 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-28 23:44:20,445 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-28 23:44:20,478 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 212 out of 288 [2023-11-28 23:44:20,479 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 255 places, 276 transitions, 766 flow. Second operand has 3 states, 3 states have (on average 214.33333333333334) internal successors, (643), 3 states have internal predecessors, (643), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:44:20,479 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-28 23:44:20,479 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 212 of 288 [2023-11-28 23:44:20,479 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-28 23:44:32,542 INFO L124 PetriNetUnfolderBase]: 21691/93664 cut-off events. [2023-11-28 23:44:32,542 INFO L125 PetriNetUnfolderBase]: For 6530/6664 co-relation queries the response was YES. [2023-11-28 23:44:32,911 INFO L83 FinitePrefix]: Finished finitePrefix Result has 143787 conditions, 93664 events. 21691/93664 cut-off events. For 6530/6664 co-relation queries the response was YES. Maximal size of possible extension queue 2125. Compared 1457438 event pairs, 10188 based on Foata normal form. 0/84509 useless extension candidates. Maximal degree in co-relation 143779. Up to 17533 conditions per place. [2023-11-28 23:44:33,178 INFO L140 encePairwiseOnDemand]: 277/288 looper letters, 65 selfloop transitions, 9 changer transitions 0/307 dead transitions. [2023-11-28 23:44:33,178 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 256 places, 307 transitions, 976 flow [2023-11-28 23:44:33,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-28 23:44:33,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-28 23:44:33,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 712 transitions. [2023-11-28 23:44:33,181 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8240740740740741 [2023-11-28 23:44:33,181 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 712 transitions. [2023-11-28 23:44:33,181 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 712 transitions. [2023-11-28 23:44:33,182 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-28 23:44:33,182 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 712 transitions. [2023-11-28 23:44:33,184 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 237.33333333333334) internal successors, (712), 3 states have internal predecessors, (712), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:44:33,187 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 288.0) internal successors, (1152), 4 states have internal predecessors, (1152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:44:33,189 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 288.0) internal successors, (1152), 4 states have internal predecessors, (1152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:44:33,189 INFO L175 Difference]: Start difference. First operand has 255 places, 276 transitions, 766 flow. Second operand 3 states and 712 transitions. [2023-11-28 23:44:33,189 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 256 places, 307 transitions, 976 flow [2023-11-28 23:44:33,317 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 254 places, 307 transitions, 922 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-28 23:44:33,322 INFO L231 Difference]: Finished difference. Result has 256 places, 281 transitions, 770 flow [2023-11-28 23:44:33,323 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=288, PETRI_DIFFERENCE_MINUEND_FLOW=702, PETRI_DIFFERENCE_MINUEND_PLACES=252, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=274, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=265, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=770, PETRI_PLACES=256, PETRI_TRANSITIONS=281} [2023-11-28 23:44:33,324 INFO L281 CegarLoopForPetriNet]: 257 programPoint places, -1 predicate places. [2023-11-28 23:44:33,324 INFO L495 AbstractCegarLoop]: Abstraction has has 256 places, 281 transitions, 770 flow [2023-11-28 23:44:33,324 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 214.33333333333334) internal successors, (643), 3 states have internal predecessors, (643), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:44:33,325 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-28 23:44:33,325 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-28 23:44:33,325 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-28 23:44:33,325 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2023-11-28 23:44:33,325 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 23:44:33,326 INFO L85 PathProgramCache]: Analyzing trace with hash -517687831, now seen corresponding path program 1 times [2023-11-28 23:44:33,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 23:44:33,326 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [303123634] [2023-11-28 23:44:33,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 23:44:33,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 23:44:33,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:44:33,422 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-28 23:44:33,422 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 23:44:33,423 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [303123634] [2023-11-28 23:44:33,423 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [303123634] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-28 23:44:33,423 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [64389125] [2023-11-28 23:44:33,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 23:44:33,424 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-28 23:44:33,424 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d6a647e-6d30-4c1e-a98b-c4caa8a6fa56/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-28 23:44:33,433 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d6a647e-6d30-4c1e-a98b-c4caa8a6fa56/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-28 23:44:33,436 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d6a647e-6d30-4c1e-a98b-c4caa8a6fa56/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-28 23:44:33,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:44:33,558 INFO L262 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-28 23:44:33,562 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-28 23:44:33,593 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-28 23:44:33,594 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-28 23:44:33,594 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [64389125] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 23:44:33,594 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-28 23:44:33,594 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2023-11-28 23:44:33,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [893122128] [2023-11-28 23:44:33,595 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 23:44:33,595 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-28 23:44:33,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 23:44:33,596 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-28 23:44:33,596 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-28 23:44:33,699 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 200 out of 288 [2023-11-28 23:44:33,700 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 256 places, 281 transitions, 770 flow. Second operand has 3 states, 3 states have (on average 202.66666666666666) internal successors, (608), 3 states have internal predecessors, (608), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:44:33,700 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-28 23:44:33,700 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 200 of 288 [2023-11-28 23:44:33,700 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-28 23:44:34,727 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([877] L702-14-->L702-3: Formula: (let ((.cse0 (select |v_#pthreadsMutex_152| |v_~#__global_lock~0.base_61|))) (and (= (store |v_#pthreadsMutex_152| |v_~#__global_lock~0.base_61| (store .cse0 |v_~#__global_lock~0.offset_61| 1)) |v_#pthreadsMutex_151|) (= |v_t_funThread1of2ForFork0_#t~nondet4#1_1| 0) (= (select .cse0 |v_~#__global_lock~0.offset_61|) 0))) InVars {#pthreadsMutex=|v_#pthreadsMutex_152|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_61|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_61|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_151|, t_funThread1of2ForFork0_#t~nondet4#1=|v_t_funThread1of2ForFork0_#t~nondet4#1_1|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_61|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_61|} AuxVars[] AssignedVars[#pthreadsMutex, t_funThread1of2ForFork0_#t~nondet4#1][42], [260#true, Black: 268#true, t_funThread1of2ForFork0InUse, t_funThread2of2ForFork0InUse, Black: 274#true, 190#L702-5true, 276#(= ~x~0 0), 84#L702-3true, Black: 265#(= |ULTIMATE.start_main_~i~0#1| 0), 280#true, 173#L713-16true]) [2023-11-28 23:44:34,728 INFO L294 olderBase$Statistics]: this new event has 78 ancestors and is cut-off event [2023-11-28 23:44:34,728 INFO L297 olderBase$Statistics]: existing Event has 78 ancestors and is cut-off event [2023-11-28 23:44:34,728 INFO L297 olderBase$Statistics]: existing Event has 78 ancestors and is cut-off event [2023-11-28 23:44:34,728 INFO L297 olderBase$Statistics]: existing Event has 78 ancestors and is cut-off event [2023-11-28 23:44:35,209 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([877] L702-14-->L702-3: Formula: (let ((.cse0 (select |v_#pthreadsMutex_152| |v_~#__global_lock~0.base_61|))) (and (= (store |v_#pthreadsMutex_152| |v_~#__global_lock~0.base_61| (store .cse0 |v_~#__global_lock~0.offset_61| 1)) |v_#pthreadsMutex_151|) (= |v_t_funThread1of2ForFork0_#t~nondet4#1_1| 0) (= (select .cse0 |v_~#__global_lock~0.offset_61|) 0))) InVars {#pthreadsMutex=|v_#pthreadsMutex_152|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_61|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_61|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_151|, t_funThread1of2ForFork0_#t~nondet4#1=|v_t_funThread1of2ForFork0_#t~nondet4#1_1|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_61|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_61|} AuxVars[] AssignedVars[#pthreadsMutex, t_funThread1of2ForFork0_#t~nondet4#1][42], [260#true, Black: 268#true, t_funThread1of2ForFork0InUse, t_funThread2of2ForFork0InUse, Black: 274#true, 190#L702-5true, 276#(= ~x~0 0), 84#L702-3true, Black: 265#(= |ULTIMATE.start_main_~i~0#1| 0), 280#true, 23#L713-22true]) [2023-11-28 23:44:35,210 INFO L294 olderBase$Statistics]: this new event has 81 ancestors and is cut-off event [2023-11-28 23:44:35,210 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is cut-off event [2023-11-28 23:44:35,210 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is cut-off event [2023-11-28 23:44:35,210 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is cut-off event [2023-11-28 23:44:35,977 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([923] L706-9-->L706-10: Formula: (= |v_#race~x~0_19| |v_t_funThread1of2ForFork0_#t~nondet10#1_3|) InVars {t_funThread1of2ForFork0_#t~nondet10#1=|v_t_funThread1of2ForFork0_#t~nondet10#1_3|} OutVars{#race~x~0=|v_#race~x~0_19|, t_funThread1of2ForFork0_#t~nondet10#1=|v_t_funThread1of2ForFork0_#t~nondet10#1_3|} AuxVars[] AssignedVars[#race~x~0][161], [260#true, t_funThread1of2ForFork0InUse, 57#L706-10true, Black: 270#(= |#race~x~0| 0), t_funThread2of2ForFork0InUse, Black: 276#(= ~x~0 0), 16#L713-13true, 274#true, Black: 265#(= |ULTIMATE.start_main_~i~0#1| 0), 280#true, 126#L705-3true]) [2023-11-28 23:44:35,977 INFO L294 olderBase$Statistics]: this new event has 85 ancestors and is cut-off event [2023-11-28 23:44:35,977 INFO L297 olderBase$Statistics]: existing Event has 85 ancestors and is cut-off event [2023-11-28 23:44:35,977 INFO L297 olderBase$Statistics]: existing Event has 85 ancestors and is cut-off event [2023-11-28 23:44:35,978 INFO L297 olderBase$Statistics]: existing Event has 85 ancestors and is cut-off event [2023-11-28 23:44:36,289 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([923] L706-9-->L706-10: Formula: (= |v_#race~x~0_19| |v_t_funThread1of2ForFork0_#t~nondet10#1_3|) InVars {t_funThread1of2ForFork0_#t~nondet10#1=|v_t_funThread1of2ForFork0_#t~nondet10#1_3|} OutVars{#race~x~0=|v_#race~x~0_19|, t_funThread1of2ForFork0_#t~nondet10#1=|v_t_funThread1of2ForFork0_#t~nondet10#1_3|} AuxVars[] AssignedVars[#race~x~0][161], [260#true, t_funThread1of2ForFork0InUse, 57#L706-10true, Black: 270#(= |#race~x~0| 0), t_funThread2of2ForFork0InUse, Black: 276#(= ~x~0 0), 274#true, Black: 265#(= |ULTIMATE.start_main_~i~0#1| 0), 280#true, 173#L713-16true, 126#L705-3true]) [2023-11-28 23:44:36,290 INFO L294 olderBase$Statistics]: this new event has 86 ancestors and is cut-off event [2023-11-28 23:44:36,290 INFO L297 olderBase$Statistics]: existing Event has 86 ancestors and is cut-off event [2023-11-28 23:44:36,290 INFO L297 olderBase$Statistics]: existing Event has 86 ancestors and is cut-off event [2023-11-28 23:44:36,290 INFO L297 olderBase$Statistics]: existing Event has 86 ancestors and is cut-off event [2023-11-28 23:44:36,611 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1001] L706-9-->L706-10: Formula: (= |v_#race~x~0_19| |v_t_funThread2of2ForFork0_#t~nondet10#1_3|) InVars {t_funThread2of2ForFork0_#t~nondet10#1=|v_t_funThread2of2ForFork0_#t~nondet10#1_3|} OutVars{#race~x~0=|v_#race~x~0_19|, t_funThread2of2ForFork0_#t~nondet10#1=|v_t_funThread2of2ForFork0_#t~nondet10#1_3|} AuxVars[] AssignedVars[#race~x~0][217], [260#true, t_funThread1of2ForFork0InUse, Black: 270#(= |#race~x~0| 0), t_funThread2of2ForFork0InUse, 106#L706-10true, Black: 276#(= ~x~0 0), 243#L702-5true, 274#true, Black: 265#(= |ULTIMATE.start_main_~i~0#1| 0), 280#true, 173#L713-16true]) [2023-11-28 23:44:36,611 INFO L294 olderBase$Statistics]: this new event has 88 ancestors and is cut-off event [2023-11-28 23:44:36,612 INFO L297 olderBase$Statistics]: existing Event has 88 ancestors and is cut-off event [2023-11-28 23:44:36,612 INFO L297 olderBase$Statistics]: existing Event has 88 ancestors and is cut-off event [2023-11-28 23:44:36,612 INFO L297 olderBase$Statistics]: existing Event has 88 ancestors and is cut-off event [2023-11-28 23:44:36,644 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([923] L706-9-->L706-10: Formula: (= |v_#race~x~0_19| |v_t_funThread1of2ForFork0_#t~nondet10#1_3|) InVars {t_funThread1of2ForFork0_#t~nondet10#1=|v_t_funThread1of2ForFork0_#t~nondet10#1_3|} OutVars{#race~x~0=|v_#race~x~0_19|, t_funThread1of2ForFork0_#t~nondet10#1=|v_t_funThread1of2ForFork0_#t~nondet10#1_3|} AuxVars[] AssignedVars[#race~x~0][161], [260#true, t_funThread1of2ForFork0InUse, 57#L706-10true, Black: 270#(= |#race~x~0| 0), t_funThread2of2ForFork0InUse, Black: 276#(= ~x~0 0), 274#true, Black: 265#(= |ULTIMATE.start_main_~i~0#1| 0), 280#true, 126#L705-3true, 23#L713-22true]) [2023-11-28 23:44:36,644 INFO L294 olderBase$Statistics]: this new event has 89 ancestors and is cut-off event [2023-11-28 23:44:36,644 INFO L297 olderBase$Statistics]: existing Event has 89 ancestors and is cut-off event [2023-11-28 23:44:36,644 INFO L297 olderBase$Statistics]: existing Event has 89 ancestors and is cut-off event [2023-11-28 23:44:36,644 INFO L297 olderBase$Statistics]: existing Event has 89 ancestors and is cut-off event [2023-11-28 23:44:36,648 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([923] L706-9-->L706-10: Formula: (= |v_#race~x~0_19| |v_t_funThread1of2ForFork0_#t~nondet10#1_3|) InVars {t_funThread1of2ForFork0_#t~nondet10#1=|v_t_funThread1of2ForFork0_#t~nondet10#1_3|} OutVars{#race~x~0=|v_#race~x~0_19|, t_funThread1of2ForFork0_#t~nondet10#1=|v_t_funThread1of2ForFork0_#t~nondet10#1_3|} AuxVars[] AssignedVars[#race~x~0][161], [260#true, 57#L706-10true, t_funThread1of2ForFork0InUse, Black: 270#(= |#race~x~0| 0), t_funThread2of2ForFork0InUse, Black: 276#(= ~x~0 0), 16#L713-13true, 274#true, 58#L706-3true, 280#true, Black: 265#(= |ULTIMATE.start_main_~i~0#1| 0)]) [2023-11-28 23:44:36,648 INFO L294 olderBase$Statistics]: this new event has 88 ancestors and is cut-off event [2023-11-28 23:44:36,648 INFO L297 olderBase$Statistics]: existing Event has 88 ancestors and is cut-off event [2023-11-28 23:44:36,648 INFO L297 olderBase$Statistics]: existing Event has 88 ancestors and is cut-off event [2023-11-28 23:44:36,648 INFO L297 olderBase$Statistics]: existing Event has 88 ancestors and is cut-off event [2023-11-28 23:44:36,804 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1001] L706-9-->L706-10: Formula: (= |v_#race~x~0_19| |v_t_funThread2of2ForFork0_#t~nondet10#1_3|) InVars {t_funThread2of2ForFork0_#t~nondet10#1=|v_t_funThread2of2ForFork0_#t~nondet10#1_3|} OutVars{#race~x~0=|v_#race~x~0_19|, t_funThread2of2ForFork0_#t~nondet10#1=|v_t_funThread2of2ForFork0_#t~nondet10#1_3|} AuxVars[] AssignedVars[#race~x~0][217], [260#true, t_funThread1of2ForFork0InUse, Black: 270#(= |#race~x~0| 0), t_funThread2of2ForFork0InUse, 106#L706-10true, Black: 276#(= ~x~0 0), 274#true, Black: 265#(= |ULTIMATE.start_main_~i~0#1| 0), 280#true, 173#L713-16true, 94#L702-6true]) [2023-11-28 23:44:36,804 INFO L294 olderBase$Statistics]: this new event has 89 ancestors and is cut-off event [2023-11-28 23:44:36,804 INFO L297 olderBase$Statistics]: existing Event has 89 ancestors and is cut-off event [2023-11-28 23:44:36,804 INFO L297 olderBase$Statistics]: existing Event has 89 ancestors and is cut-off event [2023-11-28 23:44:36,804 INFO L297 olderBase$Statistics]: existing Event has 89 ancestors and is cut-off event [2023-11-28 23:44:36,842 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([923] L706-9-->L706-10: Formula: (= |v_#race~x~0_19| |v_t_funThread1of2ForFork0_#t~nondet10#1_3|) InVars {t_funThread1of2ForFork0_#t~nondet10#1=|v_t_funThread1of2ForFork0_#t~nondet10#1_3|} OutVars{#race~x~0=|v_#race~x~0_19|, t_funThread1of2ForFork0_#t~nondet10#1=|v_t_funThread1of2ForFork0_#t~nondet10#1_3|} AuxVars[] AssignedVars[#race~x~0][161], [260#true, t_funThread1of2ForFork0InUse, 57#L706-10true, Black: 270#(= |#race~x~0| 0), t_funThread2of2ForFork0InUse, Black: 276#(= ~x~0 0), 274#true, Black: 265#(= |ULTIMATE.start_main_~i~0#1| 0), 280#true, 58#L706-3true, 173#L713-16true]) [2023-11-28 23:44:36,842 INFO L294 olderBase$Statistics]: this new event has 89 ancestors and is cut-off event [2023-11-28 23:44:36,842 INFO L297 olderBase$Statistics]: existing Event has 89 ancestors and is cut-off event [2023-11-28 23:44:36,842 INFO L297 olderBase$Statistics]: existing Event has 89 ancestors and is cut-off event [2023-11-28 23:44:36,843 INFO L297 olderBase$Statistics]: existing Event has 89 ancestors and is cut-off event [2023-11-28 23:44:37,194 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1001] L706-9-->L706-10: Formula: (= |v_#race~x~0_19| |v_t_funThread2of2ForFork0_#t~nondet10#1_3|) InVars {t_funThread2of2ForFork0_#t~nondet10#1=|v_t_funThread2of2ForFork0_#t~nondet10#1_3|} OutVars{#race~x~0=|v_#race~x~0_19|, t_funThread2of2ForFork0_#t~nondet10#1=|v_t_funThread2of2ForFork0_#t~nondet10#1_3|} AuxVars[] AssignedVars[#race~x~0][217], [260#true, t_funThread1of2ForFork0InUse, Black: 270#(= |#race~x~0| 0), t_funThread2of2ForFork0InUse, 106#L706-10true, Black: 276#(= ~x~0 0), 243#L702-5true, 274#true, Black: 265#(= |ULTIMATE.start_main_~i~0#1| 0), 280#true, 23#L713-22true]) [2023-11-28 23:44:37,194 INFO L294 olderBase$Statistics]: this new event has 91 ancestors and is cut-off event [2023-11-28 23:44:37,194 INFO L297 olderBase$Statistics]: existing Event has 91 ancestors and is cut-off event [2023-11-28 23:44:37,195 INFO L297 olderBase$Statistics]: existing Event has 91 ancestors and is cut-off event [2023-11-28 23:44:37,195 INFO L297 olderBase$Statistics]: existing Event has 91 ancestors and is cut-off event [2023-11-28 23:44:37,230 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([923] L706-9-->L706-10: Formula: (= |v_#race~x~0_19| |v_t_funThread1of2ForFork0_#t~nondet10#1_3|) InVars {t_funThread1of2ForFork0_#t~nondet10#1=|v_t_funThread1of2ForFork0_#t~nondet10#1_3|} OutVars{#race~x~0=|v_#race~x~0_19|, t_funThread1of2ForFork0_#t~nondet10#1=|v_t_funThread1of2ForFork0_#t~nondet10#1_3|} AuxVars[] AssignedVars[#race~x~0][161], [260#true, t_funThread1of2ForFork0InUse, 57#L706-10true, Black: 270#(= |#race~x~0| 0), t_funThread2of2ForFork0InUse, Black: 276#(= ~x~0 0), 274#true, Black: 265#(= |ULTIMATE.start_main_~i~0#1| 0), 58#L706-3true, 280#true, 23#L713-22true]) [2023-11-28 23:44:37,230 INFO L294 olderBase$Statistics]: this new event has 92 ancestors and is cut-off event [2023-11-28 23:44:37,230 INFO L297 olderBase$Statistics]: existing Event has 92 ancestors and is cut-off event [2023-11-28 23:44:37,230 INFO L297 olderBase$Statistics]: existing Event has 92 ancestors and is cut-off event [2023-11-28 23:44:37,230 INFO L297 olderBase$Statistics]: existing Event has 92 ancestors and is cut-off event [2023-11-28 23:44:37,402 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1001] L706-9-->L706-10: Formula: (= |v_#race~x~0_19| |v_t_funThread2of2ForFork0_#t~nondet10#1_3|) InVars {t_funThread2of2ForFork0_#t~nondet10#1=|v_t_funThread2of2ForFork0_#t~nondet10#1_3|} OutVars{#race~x~0=|v_#race~x~0_19|, t_funThread2of2ForFork0_#t~nondet10#1=|v_t_funThread2of2ForFork0_#t~nondet10#1_3|} AuxVars[] AssignedVars[#race~x~0][217], [260#true, t_funThread1of2ForFork0InUse, Black: 270#(= |#race~x~0| 0), t_funThread2of2ForFork0InUse, 106#L706-10true, Black: 276#(= ~x~0 0), 274#true, Black: 265#(= |ULTIMATE.start_main_~i~0#1| 0), 280#true, 94#L702-6true, 23#L713-22true]) [2023-11-28 23:44:37,403 INFO L294 olderBase$Statistics]: this new event has 92 ancestors and is cut-off event [2023-11-28 23:44:37,403 INFO L297 olderBase$Statistics]: existing Event has 92 ancestors and is cut-off event [2023-11-28 23:44:37,403 INFO L297 olderBase$Statistics]: existing Event has 92 ancestors and is cut-off event [2023-11-28 23:44:37,403 INFO L297 olderBase$Statistics]: existing Event has 92 ancestors and is cut-off event [2023-11-28 23:44:38,661 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1001] L706-9-->L706-10: Formula: (= |v_#race~x~0_19| |v_t_funThread2of2ForFork0_#t~nondet10#1_3|) InVars {t_funThread2of2ForFork0_#t~nondet10#1=|v_t_funThread2of2ForFork0_#t~nondet10#1_3|} OutVars{#race~x~0=|v_#race~x~0_19|, t_funThread2of2ForFork0_#t~nondet10#1=|v_t_funThread2of2ForFork0_#t~nondet10#1_3|} AuxVars[] AssignedVars[#race~x~0][217], [260#true, t_funThread1of2ForFork0InUse, Black: 270#(= |#race~x~0| 0), t_funThread2of2ForFork0InUse, 106#L706-10true, Black: 276#(= ~x~0 0), 274#true, 168#L702-12true, Black: 265#(= |ULTIMATE.start_main_~i~0#1| 0), 280#true, 173#L713-16true]) [2023-11-28 23:44:38,661 INFO L294 olderBase$Statistics]: this new event has 96 ancestors and is cut-off event [2023-11-28 23:44:38,661 INFO L297 olderBase$Statistics]: existing Event has 96 ancestors and is cut-off event [2023-11-28 23:44:38,662 INFO L297 olderBase$Statistics]: existing Event has 96 ancestors and is cut-off event [2023-11-28 23:44:38,662 INFO L297 olderBase$Statistics]: existing Event has 96 ancestors and is cut-off event [2023-11-28 23:44:39,529 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1001] L706-9-->L706-10: Formula: (= |v_#race~x~0_19| |v_t_funThread2of2ForFork0_#t~nondet10#1_3|) InVars {t_funThread2of2ForFork0_#t~nondet10#1=|v_t_funThread2of2ForFork0_#t~nondet10#1_3|} OutVars{#race~x~0=|v_#race~x~0_19|, t_funThread2of2ForFork0_#t~nondet10#1=|v_t_funThread2of2ForFork0_#t~nondet10#1_3|} AuxVars[] AssignedVars[#race~x~0][217], [260#true, t_funThread1of2ForFork0InUse, Black: 270#(= |#race~x~0| 0), 106#L706-10true, t_funThread2of2ForFork0InUse, 220#L703-2true, Black: 276#(= ~x~0 0), 274#true, 280#true, Black: 265#(= |ULTIMATE.start_main_~i~0#1| 0), 173#L713-16true]) [2023-11-28 23:44:39,529 INFO L294 olderBase$Statistics]: this new event has 99 ancestors and is cut-off event [2023-11-28 23:44:39,529 INFO L297 olderBase$Statistics]: existing Event has 99 ancestors and is cut-off event [2023-11-28 23:44:39,529 INFO L297 olderBase$Statistics]: existing Event has 99 ancestors and is cut-off event [2023-11-28 23:44:39,530 INFO L297 olderBase$Statistics]: existing Event has 99 ancestors and is cut-off event [2023-11-28 23:44:39,532 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1001] L706-9-->L706-10: Formula: (= |v_#race~x~0_19| |v_t_funThread2of2ForFork0_#t~nondet10#1_3|) InVars {t_funThread2of2ForFork0_#t~nondet10#1=|v_t_funThread2of2ForFork0_#t~nondet10#1_3|} OutVars{#race~x~0=|v_#race~x~0_19|, t_funThread2of2ForFork0_#t~nondet10#1=|v_t_funThread2of2ForFork0_#t~nondet10#1_3|} AuxVars[] AssignedVars[#race~x~0][217], [260#true, t_funThread1of2ForFork0InUse, Black: 270#(= |#race~x~0| 0), t_funThread2of2ForFork0InUse, 106#L706-10true, Black: 276#(= ~x~0 0), 274#true, 168#L702-12true, Black: 265#(= |ULTIMATE.start_main_~i~0#1| 0), 280#true, 23#L713-22true]) [2023-11-28 23:44:39,532 INFO L294 olderBase$Statistics]: this new event has 99 ancestors and is cut-off event [2023-11-28 23:44:39,532 INFO L297 olderBase$Statistics]: existing Event has 99 ancestors and is cut-off event [2023-11-28 23:44:39,532 INFO L297 olderBase$Statistics]: existing Event has 99 ancestors and is cut-off event [2023-11-28 23:44:39,532 INFO L297 olderBase$Statistics]: existing Event has 99 ancestors and is cut-off event [2023-11-28 23:44:40,329 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1001] L706-9-->L706-10: Formula: (= |v_#race~x~0_19| |v_t_funThread2of2ForFork0_#t~nondet10#1_3|) InVars {t_funThread2of2ForFork0_#t~nondet10#1=|v_t_funThread2of2ForFork0_#t~nondet10#1_3|} OutVars{#race~x~0=|v_#race~x~0_19|, t_funThread2of2ForFork0_#t~nondet10#1=|v_t_funThread2of2ForFork0_#t~nondet10#1_3|} AuxVars[] AssignedVars[#race~x~0][217], [260#true, t_funThread1of2ForFork0InUse, Black: 270#(= |#race~x~0| 0), t_funThread2of2ForFork0InUse, 220#L703-2true, 106#L706-10true, Black: 276#(= ~x~0 0), 274#true, Black: 265#(= |ULTIMATE.start_main_~i~0#1| 0), 280#true, 23#L713-22true]) [2023-11-28 23:44:40,329 INFO L294 olderBase$Statistics]: this new event has 102 ancestors and is cut-off event [2023-11-28 23:44:40,329 INFO L297 olderBase$Statistics]: existing Event has 102 ancestors and is cut-off event [2023-11-28 23:44:40,329 INFO L297 olderBase$Statistics]: existing Event has 102 ancestors and is cut-off event [2023-11-28 23:44:40,329 INFO L297 olderBase$Statistics]: existing Event has 102 ancestors and is cut-off event [2023-11-28 23:44:40,347 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1005] L706-28-->L706-29: Formula: (= |v_#race~x~0_25| |v_t_funThread2of2ForFork0_#t~nondet14#1_3|) InVars {t_funThread2of2ForFork0_#t~nondet14#1=|v_t_funThread2of2ForFork0_#t~nondet14#1_3|} OutVars{t_funThread2of2ForFork0_#t~nondet14#1=|v_t_funThread2of2ForFork0_#t~nondet14#1_3|, #race~x~0=|v_#race~x~0_25|} AuxVars[] AssignedVars[#race~x~0][287], [260#true, t_funThread1of2ForFork0InUse, Black: 270#(= |#race~x~0| 0), t_funThread2of2ForFork0InUse, Black: 276#(= ~x~0 0), 243#L702-5true, 7#L706-29true, 274#true, 280#true, Black: 265#(= |ULTIMATE.start_main_~i~0#1| 0), 173#L713-16true]) [2023-11-28 23:44:40,347 INFO L294 olderBase$Statistics]: this new event has 102 ancestors and is cut-off event [2023-11-28 23:44:40,347 INFO L297 olderBase$Statistics]: existing Event has 102 ancestors and is cut-off event [2023-11-28 23:44:40,347 INFO L297 olderBase$Statistics]: existing Event has 102 ancestors and is cut-off event [2023-11-28 23:44:40,347 INFO L297 olderBase$Statistics]: existing Event has 102 ancestors and is cut-off event [2023-11-28 23:44:40,708 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1005] L706-28-->L706-29: Formula: (= |v_#race~x~0_25| |v_t_funThread2of2ForFork0_#t~nondet14#1_3|) InVars {t_funThread2of2ForFork0_#t~nondet14#1=|v_t_funThread2of2ForFork0_#t~nondet14#1_3|} OutVars{t_funThread2of2ForFork0_#t~nondet14#1=|v_t_funThread2of2ForFork0_#t~nondet14#1_3|, #race~x~0=|v_#race~x~0_25|} AuxVars[] AssignedVars[#race~x~0][287], [260#true, t_funThread1of2ForFork0InUse, Black: 270#(= |#race~x~0| 0), t_funThread2of2ForFork0InUse, Black: 276#(= ~x~0 0), 7#L706-29true, 274#true, Black: 265#(= |ULTIMATE.start_main_~i~0#1| 0), 280#true, 173#L713-16true, 94#L702-6true]) [2023-11-28 23:44:40,708 INFO L294 olderBase$Statistics]: this new event has 103 ancestors and is cut-off event [2023-11-28 23:44:40,708 INFO L297 olderBase$Statistics]: existing Event has 103 ancestors and is cut-off event [2023-11-28 23:44:40,708 INFO L297 olderBase$Statistics]: existing Event has 103 ancestors and is cut-off event [2023-11-28 23:44:40,709 INFO L297 olderBase$Statistics]: existing Event has 103 ancestors and is cut-off event [2023-11-28 23:44:40,790 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([927] L706-28-->L706-29: Formula: (= |v_#race~x~0_25| |v_t_funThread1of2ForFork0_#t~nondet14#1_3|) InVars {t_funThread1of2ForFork0_#t~nondet14#1=|v_t_funThread1of2ForFork0_#t~nondet14#1_3|} OutVars{#race~x~0=|v_#race~x~0_25|, t_funThread1of2ForFork0_#t~nondet14#1=|v_t_funThread1of2ForFork0_#t~nondet14#1_3|} AuxVars[] AssignedVars[#race~x~0][245], [260#true, t_funThread1of2ForFork0InUse, Black: 270#(= |#race~x~0| 0), t_funThread2of2ForFork0InUse, 231#L706-29true, Black: 276#(= ~x~0 0), 274#true, Black: 265#(= |ULTIMATE.start_main_~i~0#1| 0), 280#true, 173#L713-16true, 89#L702-6true]) [2023-11-28 23:44:40,790 INFO L294 olderBase$Statistics]: this new event has 103 ancestors and is cut-off event [2023-11-28 23:44:40,790 INFO L297 olderBase$Statistics]: existing Event has 103 ancestors and is cut-off event [2023-11-28 23:44:40,790 INFO L297 olderBase$Statistics]: existing Event has 103 ancestors and is cut-off event [2023-11-28 23:44:40,790 INFO L297 olderBase$Statistics]: existing Event has 103 ancestors and is cut-off event [2023-11-28 23:44:41,283 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1005] L706-28-->L706-29: Formula: (= |v_#race~x~0_25| |v_t_funThread2of2ForFork0_#t~nondet14#1_3|) InVars {t_funThread2of2ForFork0_#t~nondet14#1=|v_t_funThread2of2ForFork0_#t~nondet14#1_3|} OutVars{t_funThread2of2ForFork0_#t~nondet14#1=|v_t_funThread2of2ForFork0_#t~nondet14#1_3|, #race~x~0=|v_#race~x~0_25|} AuxVars[] AssignedVars[#race~x~0][287], [260#true, t_funThread1of2ForFork0InUse, Black: 270#(= |#race~x~0| 0), t_funThread2of2ForFork0InUse, Black: 276#(= ~x~0 0), 243#L702-5true, 274#true, 7#L706-29true, Black: 265#(= |ULTIMATE.start_main_~i~0#1| 0), 280#true, 23#L713-22true]) [2023-11-28 23:44:41,283 INFO L294 olderBase$Statistics]: this new event has 105 ancestors and is cut-off event [2023-11-28 23:44:41,283 INFO L297 olderBase$Statistics]: existing Event has 105 ancestors and is cut-off event [2023-11-28 23:44:41,283 INFO L297 olderBase$Statistics]: existing Event has 105 ancestors and is cut-off event [2023-11-28 23:44:41,283 INFO L297 olderBase$Statistics]: existing Event has 105 ancestors and is cut-off event [2023-11-28 23:44:41,487 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1005] L706-28-->L706-29: Formula: (= |v_#race~x~0_25| |v_t_funThread2of2ForFork0_#t~nondet14#1_3|) InVars {t_funThread2of2ForFork0_#t~nondet14#1=|v_t_funThread2of2ForFork0_#t~nondet14#1_3|} OutVars{t_funThread2of2ForFork0_#t~nondet14#1=|v_t_funThread2of2ForFork0_#t~nondet14#1_3|, #race~x~0=|v_#race~x~0_25|} AuxVars[] AssignedVars[#race~x~0][287], [260#true, t_funThread1of2ForFork0InUse, Black: 270#(= |#race~x~0| 0), t_funThread2of2ForFork0InUse, Black: 276#(= ~x~0 0), 274#true, 7#L706-29true, Black: 265#(= |ULTIMATE.start_main_~i~0#1| 0), 280#true, 94#L702-6true, 23#L713-22true]) [2023-11-28 23:44:41,487 INFO L294 olderBase$Statistics]: this new event has 106 ancestors and is cut-off event [2023-11-28 23:44:41,487 INFO L297 olderBase$Statistics]: existing Event has 106 ancestors and is cut-off event [2023-11-28 23:44:41,487 INFO L297 olderBase$Statistics]: existing Event has 106 ancestors and is cut-off event [2023-11-28 23:44:41,488 INFO L297 olderBase$Statistics]: existing Event has 106 ancestors and is cut-off event [2023-11-28 23:44:41,564 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([927] L706-28-->L706-29: Formula: (= |v_#race~x~0_25| |v_t_funThread1of2ForFork0_#t~nondet14#1_3|) InVars {t_funThread1of2ForFork0_#t~nondet14#1=|v_t_funThread1of2ForFork0_#t~nondet14#1_3|} OutVars{#race~x~0=|v_#race~x~0_25|, t_funThread1of2ForFork0_#t~nondet14#1=|v_t_funThread1of2ForFork0_#t~nondet14#1_3|} AuxVars[] AssignedVars[#race~x~0][245], [260#true, t_funThread1of2ForFork0InUse, Black: 270#(= |#race~x~0| 0), t_funThread2of2ForFork0InUse, 231#L706-29true, Black: 276#(= ~x~0 0), 274#true, Black: 265#(= |ULTIMATE.start_main_~i~0#1| 0), 280#true, 89#L702-6true, 23#L713-22true]) [2023-11-28 23:44:41,565 INFO L294 olderBase$Statistics]: this new event has 106 ancestors and is cut-off event [2023-11-28 23:44:41,565 INFO L297 olderBase$Statistics]: existing Event has 106 ancestors and is cut-off event [2023-11-28 23:44:41,565 INFO L297 olderBase$Statistics]: existing Event has 106 ancestors and is cut-off event [2023-11-28 23:44:41,565 INFO L297 olderBase$Statistics]: existing Event has 106 ancestors and is cut-off event [2023-11-28 23:44:42,744 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1005] L706-28-->L706-29: Formula: (= |v_#race~x~0_25| |v_t_funThread2of2ForFork0_#t~nondet14#1_3|) InVars {t_funThread2of2ForFork0_#t~nondet14#1=|v_t_funThread2of2ForFork0_#t~nondet14#1_3|} OutVars{t_funThread2of2ForFork0_#t~nondet14#1=|v_t_funThread2of2ForFork0_#t~nondet14#1_3|, #race~x~0=|v_#race~x~0_25|} AuxVars[] AssignedVars[#race~x~0][287], [260#true, t_funThread1of2ForFork0InUse, Black: 270#(= |#race~x~0| 0), t_funThread2of2ForFork0InUse, Black: 276#(= ~x~0 0), 274#true, 7#L706-29true, 168#L702-12true, Black: 265#(= |ULTIMATE.start_main_~i~0#1| 0), 280#true, 173#L713-16true]) [2023-11-28 23:44:42,744 INFO L294 olderBase$Statistics]: this new event has 110 ancestors and is cut-off event [2023-11-28 23:44:42,744 INFO L297 olderBase$Statistics]: existing Event has 110 ancestors and is cut-off event [2023-11-28 23:44:42,744 INFO L297 olderBase$Statistics]: existing Event has 110 ancestors and is cut-off event [2023-11-28 23:44:42,744 INFO L297 olderBase$Statistics]: existing Event has 110 ancestors and is cut-off event [2023-11-28 23:44:43,729 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1005] L706-28-->L706-29: Formula: (= |v_#race~x~0_25| |v_t_funThread2of2ForFork0_#t~nondet14#1_3|) InVars {t_funThread2of2ForFork0_#t~nondet14#1=|v_t_funThread2of2ForFork0_#t~nondet14#1_3|} OutVars{t_funThread2of2ForFork0_#t~nondet14#1=|v_t_funThread2of2ForFork0_#t~nondet14#1_3|, #race~x~0=|v_#race~x~0_25|} AuxVars[] AssignedVars[#race~x~0][287], [260#true, t_funThread1of2ForFork0InUse, Black: 270#(= |#race~x~0| 0), t_funThread2of2ForFork0InUse, 220#L703-2true, Black: 276#(= ~x~0 0), 7#L706-29true, 274#true, 280#true, Black: 265#(= |ULTIMATE.start_main_~i~0#1| 0), 173#L713-16true]) [2023-11-28 23:44:43,730 INFO L294 olderBase$Statistics]: this new event has 113 ancestors and is cut-off event [2023-11-28 23:44:43,730 INFO L297 olderBase$Statistics]: existing Event has 113 ancestors and is cut-off event [2023-11-28 23:44:43,730 INFO L297 olderBase$Statistics]: existing Event has 113 ancestors and is cut-off event [2023-11-28 23:44:43,730 INFO L297 olderBase$Statistics]: existing Event has 113 ancestors and is cut-off event [2023-11-28 23:44:43,735 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1005] L706-28-->L706-29: Formula: (= |v_#race~x~0_25| |v_t_funThread2of2ForFork0_#t~nondet14#1_3|) InVars {t_funThread2of2ForFork0_#t~nondet14#1=|v_t_funThread2of2ForFork0_#t~nondet14#1_3|} OutVars{t_funThread2of2ForFork0_#t~nondet14#1=|v_t_funThread2of2ForFork0_#t~nondet14#1_3|, #race~x~0=|v_#race~x~0_25|} AuxVars[] AssignedVars[#race~x~0][287], [260#true, t_funThread1of2ForFork0InUse, Black: 270#(= |#race~x~0| 0), t_funThread2of2ForFork0InUse, Black: 276#(= ~x~0 0), 7#L706-29true, 274#true, 168#L702-12true, Black: 265#(= |ULTIMATE.start_main_~i~0#1| 0), 280#true, 23#L713-22true]) [2023-11-28 23:44:43,735 INFO L294 olderBase$Statistics]: this new event has 113 ancestors and is cut-off event [2023-11-28 23:44:43,735 INFO L297 olderBase$Statistics]: existing Event has 113 ancestors and is cut-off event [2023-11-28 23:44:43,735 INFO L297 olderBase$Statistics]: existing Event has 113 ancestors and is cut-off event [2023-11-28 23:44:43,735 INFO L297 olderBase$Statistics]: existing Event has 113 ancestors and is cut-off event [2023-11-28 23:44:44,700 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1005] L706-28-->L706-29: Formula: (= |v_#race~x~0_25| |v_t_funThread2of2ForFork0_#t~nondet14#1_3|) InVars {t_funThread2of2ForFork0_#t~nondet14#1=|v_t_funThread2of2ForFork0_#t~nondet14#1_3|} OutVars{t_funThread2of2ForFork0_#t~nondet14#1=|v_t_funThread2of2ForFork0_#t~nondet14#1_3|, #race~x~0=|v_#race~x~0_25|} AuxVars[] AssignedVars[#race~x~0][287], [260#true, t_funThread1of2ForFork0InUse, Black: 270#(= |#race~x~0| 0), t_funThread2of2ForFork0InUse, 220#L703-2true, Black: 276#(= ~x~0 0), 274#true, 7#L706-29true, Black: 265#(= |ULTIMATE.start_main_~i~0#1| 0), 280#true, 23#L713-22true]) [2023-11-28 23:44:44,701 INFO L294 olderBase$Statistics]: this new event has 116 ancestors and is cut-off event [2023-11-28 23:44:44,701 INFO L297 olderBase$Statistics]: existing Event has 116 ancestors and is cut-off event [2023-11-28 23:44:44,701 INFO L297 olderBase$Statistics]: existing Event has 116 ancestors and is cut-off event [2023-11-28 23:44:44,701 INFO L297 olderBase$Statistics]: existing Event has 116 ancestors and is cut-off event [2023-11-28 23:44:50,712 INFO L124 PetriNetUnfolderBase]: 38601/138470 cut-off events. [2023-11-28 23:44:50,713 INFO L125 PetriNetUnfolderBase]: For 20317/22060 co-relation queries the response was YES. [2023-11-28 23:44:51,108 INFO L83 FinitePrefix]: Finished finitePrefix Result has 231059 conditions, 138470 events. 38601/138470 cut-off events. For 20317/22060 co-relation queries the response was YES. Maximal size of possible extension queue 2743. Compared 2133291 event pairs, 21878 based on Foata normal form. 278/124070 useless extension candidates. Maximal degree in co-relation 231050. Up to 51429 conditions per place. [2023-11-28 23:44:51,643 INFO L140 encePairwiseOnDemand]: 272/288 looper letters, 86 selfloop transitions, 28 changer transitions 0/325 dead transitions. [2023-11-28 23:44:51,643 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 258 places, 325 transitions, 1134 flow [2023-11-28 23:44:51,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-28 23:44:51,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-28 23:44:51,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 686 transitions. [2023-11-28 23:44:51,647 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7939814814814815 [2023-11-28 23:44:51,648 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 686 transitions. [2023-11-28 23:44:51,648 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 686 transitions. [2023-11-28 23:44:51,649 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-28 23:44:51,649 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 686 transitions. [2023-11-28 23:44:51,652 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 228.66666666666666) internal successors, (686), 3 states have internal predecessors, (686), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:44:51,656 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 288.0) internal successors, (1152), 4 states have internal predecessors, (1152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:44:51,656 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 288.0) internal successors, (1152), 4 states have internal predecessors, (1152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:44:51,657 INFO L175 Difference]: Start difference. First operand has 256 places, 281 transitions, 770 flow. Second operand 3 states and 686 transitions. [2023-11-28 23:44:51,657 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 258 places, 325 transitions, 1134 flow [2023-11-28 23:44:51,773 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 256 places, 325 transitions, 1116 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-28 23:44:51,780 INFO L231 Difference]: Finished difference. Result has 258 places, 307 transitions, 1018 flow [2023-11-28 23:44:51,781 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=288, PETRI_DIFFERENCE_MINUEND_FLOW=752, PETRI_DIFFERENCE_MINUEND_PLACES=254, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=281, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=253, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1018, PETRI_PLACES=258, PETRI_TRANSITIONS=307} [2023-11-28 23:44:51,782 INFO L281 CegarLoopForPetriNet]: 257 programPoint places, 1 predicate places. [2023-11-28 23:44:51,782 INFO L495 AbstractCegarLoop]: Abstraction has has 258 places, 307 transitions, 1018 flow [2023-11-28 23:44:51,782 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 202.66666666666666) internal successors, (608), 3 states have internal predecessors, (608), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:44:51,782 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-28 23:44:51,782 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-28 23:44:51,793 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d6a647e-6d30-4c1e-a98b-c4caa8a6fa56/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-28 23:44:51,983 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d6a647e-6d30-4c1e-a98b-c4caa8a6fa56/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-28 23:44:51,983 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2023-11-28 23:44:51,984 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 23:44:51,984 INFO L85 PathProgramCache]: Analyzing trace with hash -871295835, now seen corresponding path program 1 times [2023-11-28 23:44:51,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 23:44:51,984 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1870397484] [2023-11-28 23:44:51,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 23:44:51,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 23:44:52,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-28 23:44:52,008 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-28 23:44:52,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-28 23:44:52,029 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-28 23:44:52,030 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-28 23:44:52,030 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (24 of 25 remaining) [2023-11-28 23:44:52,030 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (23 of 25 remaining) [2023-11-28 23:44:52,030 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (22 of 25 remaining) [2023-11-28 23:44:52,031 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (21 of 25 remaining) [2023-11-28 23:44:52,031 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (20 of 25 remaining) [2023-11-28 23:44:52,031 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (19 of 25 remaining) [2023-11-28 23:44:52,032 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (18 of 25 remaining) [2023-11-28 23:44:52,032 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (17 of 25 remaining) [2023-11-28 23:44:52,032 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (16 of 25 remaining) [2023-11-28 23:44:52,032 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (15 of 25 remaining) [2023-11-28 23:44:52,032 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr4ASSERT_VIOLATIONDATA_RACE (14 of 25 remaining) [2023-11-28 23:44:52,032 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE (13 of 25 remaining) [2023-11-28 23:44:52,033 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr5ASSERT_VIOLATIONDATA_RACE (12 of 25 remaining) [2023-11-28 23:44:52,033 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (11 of 25 remaining) [2023-11-28 23:44:52,033 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (10 of 25 remaining) [2023-11-28 23:44:52,033 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (9 of 25 remaining) [2023-11-28 23:44:52,033 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr4ASSERT_VIOLATIONDATA_RACE (8 of 25 remaining) [2023-11-28 23:44:52,034 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE (7 of 25 remaining) [2023-11-28 23:44:52,034 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr5ASSERT_VIOLATIONDATA_RACE (6 of 25 remaining) [2023-11-28 23:44:52,034 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (5 of 25 remaining) [2023-11-28 23:44:52,034 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (4 of 25 remaining) [2023-11-28 23:44:52,034 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (3 of 25 remaining) [2023-11-28 23:44:52,034 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr4ASSERT_VIOLATIONDATA_RACE (2 of 25 remaining) [2023-11-28 23:44:52,035 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE (1 of 25 remaining) [2023-11-28 23:44:52,035 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr5ASSERT_VIOLATIONDATA_RACE (0 of 25 remaining) [2023-11-28 23:44:52,035 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-28 23:44:52,035 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2023-11-28 23:44:52,036 WARN L233 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2023-11-28 23:44:52,036 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2023-11-28 23:44:52,091 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2023-11-28 23:44:52,097 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 327 places, 368 transitions, 763 flow [2023-11-28 23:44:52,248 INFO L124 PetriNetUnfolderBase]: 93/758 cut-off events. [2023-11-28 23:44:52,248 INFO L125 PetriNetUnfolderBase]: For 19/19 co-relation queries the response was YES. [2023-11-28 23:44:52,255 INFO L83 FinitePrefix]: Finished finitePrefix Result has 783 conditions, 758 events. 93/758 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 3968 event pairs, 1 based on Foata normal form. 0/615 useless extension candidates. Maximal degree in co-relation 514. Up to 16 conditions per place. [2023-11-28 23:44:52,255 INFO L82 GeneralOperation]: Start removeDead. Operand has 327 places, 368 transitions, 763 flow [2023-11-28 23:44:52,269 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 327 places, 368 transitions, 763 flow [2023-11-28 23:44:52,270 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-28 23:44:52,271 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;@2bfbc64b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-28 23:44:52,271 INFO L358 AbstractCegarLoop]: Starting to check reachability of 31 error locations. [2023-11-28 23:44:52,279 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-28 23:44:52,279 INFO L124 PetriNetUnfolderBase]: 4/62 cut-off events. [2023-11-28 23:44:52,279 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-28 23:44:52,279 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-28 23:44:52,279 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-28 23:44:52,280 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 28 more)] === [2023-11-28 23:44:52,280 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 23:44:52,280 INFO L85 PathProgramCache]: Analyzing trace with hash 140100446, now seen corresponding path program 1 times [2023-11-28 23:44:52,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 23:44:52,281 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [372299417] [2023-11-28 23:44:52,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 23:44:52,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 23:44:52,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:44:52,308 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-28 23:44:52,309 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 23:44:52,309 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [372299417] [2023-11-28 23:44:52,309 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [372299417] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 23:44:52,309 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 23:44:52,310 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-28 23:44:52,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [133550980] [2023-11-28 23:44:52,310 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 23:44:52,311 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-28 23:44:52,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 23:44:52,312 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-28 23:44:52,312 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-28 23:44:52,313 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 281 out of 368 [2023-11-28 23:44:52,314 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 327 places, 368 transitions, 763 flow. Second operand has 2 states, 2 states have (on average 282.5) internal successors, (565), 2 states have internal predecessors, (565), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:44:52,315 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-28 23:44:52,315 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 281 of 368 [2023-11-28 23:44:52,315 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-28 23:45:06,641 INFO L124 PetriNetUnfolderBase]: 26755/100857 cut-off events. [2023-11-28 23:45:06,642 INFO L125 PetriNetUnfolderBase]: For 1786/1786 co-relation queries the response was YES. [2023-11-28 23:45:07,044 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137629 conditions, 100857 events. 26755/100857 cut-off events. For 1786/1786 co-relation queries the response was YES. Maximal size of possible extension queue 2177. Compared 1532677 event pairs, 25579 based on Foata normal form. 30044/119540 useless extension candidates. Maximal degree in co-relation 123737. Up to 35952 conditions per place. [2023-11-28 23:45:07,473 INFO L140 encePairwiseOnDemand]: 326/368 looper letters, 41 selfloop transitions, 0 changer transitions 0/314 dead transitions. [2023-11-28 23:45:07,473 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 316 places, 314 transitions, 737 flow [2023-11-28 23:45:07,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-28 23:45:07,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-11-28 23:45:07,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 645 transitions. [2023-11-28 23:45:07,476 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.876358695652174 [2023-11-28 23:45:07,476 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 645 transitions. [2023-11-28 23:45:07,477 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 645 transitions. [2023-11-28 23:45:07,477 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-28 23:45:07,477 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 645 transitions. [2023-11-28 23:45:07,479 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 322.5) internal successors, (645), 2 states have internal predecessors, (645), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:45:07,480 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 368.0) internal successors, (1104), 3 states have internal predecessors, (1104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:45:07,481 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 368.0) internal successors, (1104), 3 states have internal predecessors, (1104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:45:07,481 INFO L175 Difference]: Start difference. First operand has 327 places, 368 transitions, 763 flow. Second operand 2 states and 645 transitions. [2023-11-28 23:45:07,481 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 316 places, 314 transitions, 737 flow [2023-11-28 23:45:07,500 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 316 places, 314 transitions, 737 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-28 23:45:07,506 INFO L231 Difference]: Finished difference. Result has 316 places, 314 transitions, 655 flow [2023-11-28 23:45:07,507 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=368, PETRI_DIFFERENCE_MINUEND_FLOW=655, PETRI_DIFFERENCE_MINUEND_PLACES=315, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=314, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=314, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=655, PETRI_PLACES=316, PETRI_TRANSITIONS=314} [2023-11-28 23:45:07,508 INFO L281 CegarLoopForPetriNet]: 327 programPoint places, -11 predicate places. [2023-11-28 23:45:07,508 INFO L495 AbstractCegarLoop]: Abstraction has has 316 places, 314 transitions, 655 flow [2023-11-28 23:45:07,509 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 282.5) internal successors, (565), 2 states have internal predecessors, (565), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:45:07,509 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-28 23:45:07,509 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] [2023-11-28 23:45:07,509 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-28 23:45:07,510 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 28 more)] === [2023-11-28 23:45:07,510 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 23:45:07,510 INFO L85 PathProgramCache]: Analyzing trace with hash 142861449, now seen corresponding path program 1 times [2023-11-28 23:45:07,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 23:45:07,511 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [587832090] [2023-11-28 23:45:07,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 23:45:07,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 23:45:07,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:45:07,549 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-28 23:45:07,549 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 23:45:07,549 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [587832090] [2023-11-28 23:45:07,549 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [587832090] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 23:45:07,549 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 23:45:07,549 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-28 23:45:07,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1526137701] [2023-11-28 23:45:07,550 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 23:45:07,550 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-28 23:45:07,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 23:45:07,551 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-28 23:45:07,551 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-28 23:45:07,561 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 275 out of 368 [2023-11-28 23:45:07,562 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 316 places, 314 transitions, 655 flow. Second operand has 3 states, 3 states have (on average 277.0) internal successors, (831), 3 states have internal predecessors, (831), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:45:07,562 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-28 23:45:07,562 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 275 of 368 [2023-11-28 23:45:07,562 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-28 23:45:27,763 INFO L124 PetriNetUnfolderBase]: 39271/145140 cut-off events. [2023-11-28 23:45:27,763 INFO L125 PetriNetUnfolderBase]: For 1807/1807 co-relation queries the response was YES. [2023-11-28 23:45:28,376 INFO L83 FinitePrefix]: Finished finitePrefix Result has 198588 conditions, 145140 events. 39271/145140 cut-off events. For 1807/1807 co-relation queries the response was YES. Maximal size of possible extension queue 2848. Compared 2284362 event pairs, 24256 based on Foata normal form. 1/129045 useless extension candidates. Maximal degree in co-relation 198582. Up to 52618 conditions per place. [2023-11-28 23:45:29,076 INFO L140 encePairwiseOnDemand]: 365/368 looper letters, 55 selfloop transitions, 2 changer transitions 0/324 dead transitions. [2023-11-28 23:45:29,076 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 318 places, 324 transitions, 789 flow [2023-11-28 23:45:29,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-28 23:45:29,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-28 23:45:29,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 883 transitions. [2023-11-28 23:45:29,080 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7998188405797102 [2023-11-28 23:45:29,080 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 883 transitions. [2023-11-28 23:45:29,080 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 883 transitions. [2023-11-28 23:45:29,081 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-28 23:45:29,081 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 883 transitions. [2023-11-28 23:45:29,084 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 294.3333333333333) internal successors, (883), 3 states have internal predecessors, (883), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:45:29,087 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 368.0) internal successors, (1472), 4 states have internal predecessors, (1472), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:45:29,087 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 368.0) internal successors, (1472), 4 states have internal predecessors, (1472), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:45:29,087 INFO L175 Difference]: Start difference. First operand has 316 places, 314 transitions, 655 flow. Second operand 3 states and 883 transitions. [2023-11-28 23:45:29,087 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 318 places, 324 transitions, 789 flow [2023-11-28 23:45:29,091 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 318 places, 324 transitions, 789 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-28 23:45:29,096 INFO L231 Difference]: Finished difference. Result has 319 places, 315 transitions, 667 flow [2023-11-28 23:45:29,097 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=368, PETRI_DIFFERENCE_MINUEND_FLOW=655, PETRI_DIFFERENCE_MINUEND_PLACES=316, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=314, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=312, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=667, PETRI_PLACES=319, PETRI_TRANSITIONS=315} [2023-11-28 23:45:29,098 INFO L281 CegarLoopForPetriNet]: 327 programPoint places, -8 predicate places. [2023-11-28 23:45:29,098 INFO L495 AbstractCegarLoop]: Abstraction has has 319 places, 315 transitions, 667 flow [2023-11-28 23:45:29,099 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 277.0) internal successors, (831), 3 states have internal predecessors, (831), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:45:29,099 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-28 23:45:29,099 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] [2023-11-28 23:45:29,099 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-28 23:45:29,099 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 28 more)] === [2023-11-28 23:45:29,099 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 23:45:29,099 INFO L85 PathProgramCache]: Analyzing trace with hash 496170507, now seen corresponding path program 1 times [2023-11-28 23:45:29,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 23:45:29,100 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [513317208] [2023-11-28 23:45:29,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 23:45:29,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 23:45:29,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:45:29,131 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-28 23:45:29,132 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 23:45:29,132 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [513317208] [2023-11-28 23:45:29,132 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [513317208] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 23:45:29,132 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 23:45:29,132 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-28 23:45:29,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [96644220] [2023-11-28 23:45:29,133 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 23:45:29,133 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-28 23:45:29,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 23:45:29,134 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-28 23:45:29,134 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-28 23:45:29,213 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 228 out of 368 [2023-11-28 23:45:29,215 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 319 places, 315 transitions, 667 flow. Second operand has 3 states, 3 states have (on average 229.33333333333334) internal successors, (688), 3 states have internal predecessors, (688), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:45:29,215 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-28 23:45:29,215 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 228 of 368 [2023-11-28 23:45:29,215 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand