./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-data-race.prp --file ../../sv-benchmarks/c/pthread-deagle/airline-20.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_134da552-ab6a-4313-9d17-0e65a57f8ff7/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_134da552-ab6a-4313-9d17-0e65a57f8ff7/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_134da552-ab6a-4313-9d17-0e65a57f8ff7/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_134da552-ab6a-4313-9d17-0e65a57f8ff7/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-deagle/airline-20.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_134da552-ab6a-4313-9d17-0e65a57f8ff7/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_134da552-ab6a-4313-9d17-0e65a57f8ff7/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 012c46975e61d3a8df350de2a682cb9d47f59406509497c2ea72a562542ce55a --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-29 06:24:36,274 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-29 06:24:36,341 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_134da552-ab6a-4313-9d17-0e65a57f8ff7/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-DataRace-32bit-Automizer_Default.epf [2023-11-29 06:24:36,346 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-29 06:24:36,346 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-29 06:24:36,369 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-29 06:24:36,369 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-29 06:24:36,370 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-29 06:24:36,370 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-29 06:24:36,371 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-29 06:24:36,372 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-29 06:24:36,372 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-29 06:24:36,373 INFO L153 SettingsManager]: * Use SBE=true [2023-11-29 06:24:36,373 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-29 06:24:36,374 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-29 06:24:36,374 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-29 06:24:36,375 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-29 06:24:36,375 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-29 06:24:36,376 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-29 06:24:36,377 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-29 06:24:36,377 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-29 06:24:36,381 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-29 06:24:36,381 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2023-11-29 06:24:36,382 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-29 06:24:36,382 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-29 06:24:36,382 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-29 06:24:36,382 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-29 06:24:36,383 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-29 06:24:36,383 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-29 06:24:36,384 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-29 06:24:36,384 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 06:24:36,385 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-29 06:24:36,385 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-29 06:24:36,385 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-29 06:24:36,385 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-29 06:24:36,386 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-29 06:24:36,386 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-29 06:24:36,386 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-29 06:24:36,386 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-29 06:24:36,386 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-29 06:24:36,387 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-29 06:24:36,387 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_134da552-ab6a-4313-9d17-0e65a57f8ff7/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_134da552-ab6a-4313-9d17-0e65a57f8ff7/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 -> 012c46975e61d3a8df350de2a682cb9d47f59406509497c2ea72a562542ce55a [2023-11-29 06:24:36,617 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-29 06:24:36,637 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-29 06:24:36,640 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-29 06:24:36,641 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-29 06:24:36,641 INFO L274 PluginConnector]: CDTParser initialized [2023-11-29 06:24:36,643 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_134da552-ab6a-4313-9d17-0e65a57f8ff7/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/pthread-deagle/airline-20.i [2023-11-29 06:24:39,411 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-29 06:24:39,635 INFO L384 CDTParser]: Found 1 translation units. [2023-11-29 06:24:39,636 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_134da552-ab6a-4313-9d17-0e65a57f8ff7/sv-benchmarks/c/pthread-deagle/airline-20.i [2023-11-29 06:24:39,652 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_134da552-ab6a-4313-9d17-0e65a57f8ff7/bin/uautomizer-verify-BQ2R08f2Ya/data/df03de46a/a12010ce713f41eca7a9df68cd76cd9e/FLAG81dfa34bc [2023-11-29 06:24:39,667 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_134da552-ab6a-4313-9d17-0e65a57f8ff7/bin/uautomizer-verify-BQ2R08f2Ya/data/df03de46a/a12010ce713f41eca7a9df68cd76cd9e [2023-11-29 06:24:39,669 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-29 06:24:39,671 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-29 06:24:39,673 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-29 06:24:39,673 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-29 06:24:39,678 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-29 06:24:39,679 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 06:24:39" (1/1) ... [2023-11-29 06:24:39,694 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4428d819 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:24:39, skipping insertion in model container [2023-11-29 06:24:39,695 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 06:24:39" (1/1) ... [2023-11-29 06:24:39,744 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 06:24:40,058 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 06:24:40,067 INFO L202 MainTranslator]: Completed pre-run [2023-11-29 06:24:40,108 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 06:24:40,138 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-29 06:24:40,138 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-29 06:24:40,146 INFO L206 MainTranslator]: Completed translation [2023-11-29 06:24:40,146 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:24:40 WrapperNode [2023-11-29 06:24:40,146 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-29 06:24:40,147 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-29 06:24:40,148 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-29 06:24:40,148 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-29 06:24:40,155 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:24:40" (1/1) ... [2023-11-29 06:24:40,169 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:24:40" (1/1) ... [2023-11-29 06:24:40,193 INFO L138 Inliner]: procedures = 162, calls = 24, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 83 [2023-11-29 06:24:40,193 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-29 06:24:40,194 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-29 06:24:40,194 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-29 06:24:40,194 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-29 06:24:40,203 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:24:40" (1/1) ... [2023-11-29 06:24:40,203 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:24:40" (1/1) ... [2023-11-29 06:24:40,207 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:24:40" (1/1) ... [2023-11-29 06:24:40,207 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:24:40" (1/1) ... [2023-11-29 06:24:40,214 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:24:40" (1/1) ... [2023-11-29 06:24:40,217 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:24:40" (1/1) ... [2023-11-29 06:24:40,219 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:24:40" (1/1) ... [2023-11-29 06:24:40,221 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:24:40" (1/1) ... [2023-11-29 06:24:40,224 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-29 06:24:40,225 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-29 06:24:40,225 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-29 06:24:40,225 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-29 06:24:40,226 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:24:40" (1/1) ... [2023-11-29 06:24:40,232 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 06:24:40,243 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_134da552-ab6a-4313-9d17-0e65a57f8ff7/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 06:24:40,255 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_134da552-ab6a-4313-9d17-0e65a57f8ff7/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-29 06:24:40,258 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_134da552-ab6a-4313-9d17-0e65a57f8ff7/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-29 06:24:40,289 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-29 06:24:40,289 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-29 06:24:40,289 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-29 06:24:40,289 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-29 06:24:40,290 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-29 06:24:40,290 INFO L130 BoogieDeclarations]: Found specification of procedure salethread [2023-11-29 06:24:40,290 INFO L138 BoogieDeclarations]: Found implementation of procedure salethread [2023-11-29 06:24:40,290 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-29 06:24:40,290 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-29 06:24:40,290 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-29 06:24:40,291 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-29 06:24:40,291 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-29 06:24:40,292 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-29 06:24:40,424 INFO L241 CfgBuilder]: Building ICFG [2023-11-29 06:24:40,426 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-29 06:24:40,598 INFO L282 CfgBuilder]: Performing block encoding [2023-11-29 06:24:40,627 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-29 06:24:40,627 INFO L309 CfgBuilder]: Removed 2 assume(true) statements. [2023-11-29 06:24:40,628 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 06:24:40 BoogieIcfgContainer [2023-11-29 06:24:40,629 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-29 06:24:40,631 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-29 06:24:40,631 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-29 06:24:40,635 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-29 06:24:40,635 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.11 06:24:39" (1/3) ... [2023-11-29 06:24:40,636 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6297de7c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 06:24:40, skipping insertion in model container [2023-11-29 06:24:40,636 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:24:40" (2/3) ... [2023-11-29 06:24:40,636 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6297de7c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 06:24:40, skipping insertion in model container [2023-11-29 06:24:40,636 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 06:24:40" (3/3) ... [2023-11-29 06:24:40,637 INFO L112 eAbstractionObserver]: Analyzing ICFG airline-20.i [2023-11-29 06:24:40,646 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-11-29 06:24:40,654 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-29 06:24:40,654 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 9 error locations. [2023-11-29 06:24:40,654 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-29 06:24:40,700 INFO L144 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2023-11-29 06:24:40,734 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 88 places, 92 transitions, 191 flow [2023-11-29 06:24:40,781 INFO L124 PetriNetUnfolderBase]: 11/131 cut-off events. [2023-11-29 06:24:40,781 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2023-11-29 06:24:40,785 INFO L83 FinitePrefix]: Finished finitePrefix Result has 136 conditions, 131 events. 11/131 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 322 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 63. Up to 4 conditions per place. [2023-11-29 06:24:40,786 INFO L82 GeneralOperation]: Start removeDead. Operand has 88 places, 92 transitions, 191 flow [2023-11-29 06:24:40,789 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 88 places, 92 transitions, 191 flow [2023-11-29 06:24:40,806 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-29 06:24:40,813 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;@302edf09, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-29 06:24:40,813 INFO L358 AbstractCegarLoop]: Starting to check reachability of 14 error locations. [2023-11-29 06:24:40,819 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-29 06:24:40,819 INFO L124 PetriNetUnfolderBase]: 0/15 cut-off events. [2023-11-29 06:24:40,819 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-29 06:24:40,819 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 06:24:40,820 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 06:24:40,820 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [salethreadErr0ASSERT_VIOLATIONDATA_RACE, salethreadErr1ASSERT_VIOLATIONDATA_RACE, salethreadErr2ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2023-11-29 06:24:40,826 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:24:40,826 INFO L85 PathProgramCache]: Analyzing trace with hash 1557855436, now seen corresponding path program 1 times [2023-11-29 06:24:40,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:24:40,836 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [682244955] [2023-11-29 06:24:40,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:24:40,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:24:40,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:24:41,040 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 06:24:41,040 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 06:24:41,041 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [682244955] [2023-11-29 06:24:41,041 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [682244955] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:24:41,041 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:24:41,042 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-29 06:24:41,043 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1499473449] [2023-11-29 06:24:41,043 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:24:41,050 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-29 06:24:41,054 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 06:24:41,075 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-29 06:24:41,075 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-29 06:24:41,077 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 75 out of 92 [2023-11-29 06:24:41,080 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 92 transitions, 191 flow. Second operand has 2 states, 2 states have (on average 75.5) internal successors, (151), 2 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:24:41,080 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 06:24:41,080 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 75 of 92 [2023-11-29 06:24:41,081 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 06:24:41,123 INFO L124 PetriNetUnfolderBase]: 3/112 cut-off events. [2023-11-29 06:24:41,124 INFO L125 PetriNetUnfolderBase]: For 4/5 co-relation queries the response was YES. [2023-11-29 06:24:41,125 INFO L83 FinitePrefix]: Finished finitePrefix Result has 125 conditions, 112 events. 3/112 cut-off events. For 4/5 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 264 event pairs, 0 based on Foata normal form. 10/108 useless extension candidates. Maximal degree in co-relation 56. Up to 8 conditions per place. [2023-11-29 06:24:41,126 INFO L140 encePairwiseOnDemand]: 83/92 looper letters, 7 selfloop transitions, 0 changer transitions 0/80 dead transitions. [2023-11-29 06:24:41,126 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 80 transitions, 181 flow [2023-11-29 06:24:41,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-29 06:24:41,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-11-29 06:24:41,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 166 transitions. [2023-11-29 06:24:41,137 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9021739130434783 [2023-11-29 06:24:41,137 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 166 transitions. [2023-11-29 06:24:41,138 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 166 transitions. [2023-11-29 06:24:41,139 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 06:24:41,141 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 166 transitions. [2023-11-29 06:24:41,143 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 83.0) internal successors, (166), 2 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:24:41,147 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 92.0) internal successors, (276), 3 states have internal predecessors, (276), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:24:41,148 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 92.0) internal successors, (276), 3 states have internal predecessors, (276), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:24:41,149 INFO L175 Difference]: Start difference. First operand has 88 places, 92 transitions, 191 flow. Second operand 2 states and 166 transitions. [2023-11-29 06:24:41,150 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 80 transitions, 181 flow [2023-11-29 06:24:41,152 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 80 transitions, 181 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-29 06:24:41,156 INFO L231 Difference]: Finished difference. Result has 81 places, 80 transitions, 167 flow [2023-11-29 06:24:41,157 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=92, PETRI_DIFFERENCE_MINUEND_FLOW=167, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=80, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=167, PETRI_PLACES=81, PETRI_TRANSITIONS=80} [2023-11-29 06:24:41,160 INFO L281 CegarLoopForPetriNet]: 88 programPoint places, -7 predicate places. [2023-11-29 06:24:41,160 INFO L495 AbstractCegarLoop]: Abstraction has has 81 places, 80 transitions, 167 flow [2023-11-29 06:24:41,161 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 75.5) internal successors, (151), 2 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:24:41,161 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 06:24:41,161 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] [2023-11-29 06:24:41,161 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-29 06:24:41,161 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [salethreadErr0ASSERT_VIOLATIONDATA_RACE, salethreadErr1ASSERT_VIOLATIONDATA_RACE, salethreadErr2ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2023-11-29 06:24:41,162 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:24:41,162 INFO L85 PathProgramCache]: Analyzing trace with hash -974512921, now seen corresponding path program 1 times [2023-11-29 06:24:41,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:24:41,163 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1122609214] [2023-11-29 06:24:41,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:24:41,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:24:41,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:24:41,265 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 06:24:41,265 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 06:24:41,266 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1122609214] [2023-11-29 06:24:41,266 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1122609214] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:24:41,266 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:24:41,266 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 06:24:41,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [622519573] [2023-11-29 06:24:41,267 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:24:41,268 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 06:24:41,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 06:24:41,269 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 06:24:41,269 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 06:24:41,283 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 69 out of 92 [2023-11-29 06:24:41,283 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 80 transitions, 167 flow. Second operand has 3 states, 3 states have (on average 71.33333333333333) internal successors, (214), 3 states have internal predecessors, (214), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:24:41,283 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 06:24:41,283 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 69 of 92 [2023-11-29 06:24:41,284 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 06:24:41,330 INFO L124 PetriNetUnfolderBase]: 10/152 cut-off events. [2023-11-29 06:24:41,330 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2023-11-29 06:24:41,331 INFO L83 FinitePrefix]: Finished finitePrefix Result has 185 conditions, 152 events. 10/152 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 378 event pairs, 0 based on Foata normal form. 1/133 useless extension candidates. Maximal degree in co-relation 181. Up to 23 conditions per place. [2023-11-29 06:24:41,332 INFO L140 encePairwiseOnDemand]: 89/92 looper letters, 13 selfloop transitions, 2 changer transitions 0/82 dead transitions. [2023-11-29 06:24:41,332 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 82 transitions, 201 flow [2023-11-29 06:24:41,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 06:24:41,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 06:24:41,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 223 transitions. [2023-11-29 06:24:41,335 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8079710144927537 [2023-11-29 06:24:41,336 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 223 transitions. [2023-11-29 06:24:41,336 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 223 transitions. [2023-11-29 06:24:41,337 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 06:24:41,337 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 223 transitions. [2023-11-29 06:24:41,339 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 74.33333333333333) internal successors, (223), 3 states have internal predecessors, (223), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:24:41,341 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 92.0) internal successors, (368), 4 states have internal predecessors, (368), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:24:41,341 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 92.0) internal successors, (368), 4 states have internal predecessors, (368), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:24:41,341 INFO L175 Difference]: Start difference. First operand has 81 places, 80 transitions, 167 flow. Second operand 3 states and 223 transitions. [2023-11-29 06:24:41,341 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 82 transitions, 201 flow [2023-11-29 06:24:41,343 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 82 transitions, 201 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-29 06:24:41,345 INFO L231 Difference]: Finished difference. Result has 84 places, 80 transitions, 175 flow [2023-11-29 06:24:41,345 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=92, PETRI_DIFFERENCE_MINUEND_FLOW=167, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=78, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=175, PETRI_PLACES=84, PETRI_TRANSITIONS=80} [2023-11-29 06:24:41,346 INFO L281 CegarLoopForPetriNet]: 88 programPoint places, -4 predicate places. [2023-11-29 06:24:41,346 INFO L495 AbstractCegarLoop]: Abstraction has has 84 places, 80 transitions, 175 flow [2023-11-29 06:24:41,347 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 71.33333333333333) internal successors, (214), 3 states have internal predecessors, (214), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:24:41,347 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 06:24:41,347 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] [2023-11-29 06:24:41,347 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-29 06:24:41,348 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting salethreadErr0ASSERT_VIOLATIONDATA_RACE === [salethreadErr0ASSERT_VIOLATIONDATA_RACE, salethreadErr1ASSERT_VIOLATIONDATA_RACE, salethreadErr2ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2023-11-29 06:24:41,348 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:24:41,348 INFO L85 PathProgramCache]: Analyzing trace with hash -929159752, now seen corresponding path program 1 times [2023-11-29 06:24:41,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:24:41,349 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2063729759] [2023-11-29 06:24:41,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:24:41,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:24:41,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:24:41,409 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 06:24:41,409 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 06:24:41,410 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2063729759] [2023-11-29 06:24:41,410 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2063729759] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:24:41,410 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:24:41,410 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 06:24:41,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [420004784] [2023-11-29 06:24:41,411 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:24:41,411 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 06:24:41,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 06:24:41,412 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 06:24:41,412 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 06:24:41,415 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 72 out of 92 [2023-11-29 06:24:41,416 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 80 transitions, 175 flow. Second operand has 3 states, 3 states have (on average 74.0) internal successors, (222), 3 states have internal predecessors, (222), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:24:41,416 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 06:24:41,416 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 72 of 92 [2023-11-29 06:24:41,416 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 06:24:41,456 INFO L124 PetriNetUnfolderBase]: 1/141 cut-off events. [2023-11-29 06:24:41,457 INFO L125 PetriNetUnfolderBase]: For 11/19 co-relation queries the response was YES. [2023-11-29 06:24:41,457 INFO L83 FinitePrefix]: Finished finitePrefix Result has 165 conditions, 141 events. 1/141 cut-off events. For 11/19 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 267 event pairs, 0 based on Foata normal form. 0/126 useless extension candidates. Maximal degree in co-relation 159. Up to 7 conditions per place. [2023-11-29 06:24:41,458 INFO L140 encePairwiseOnDemand]: 89/92 looper letters, 8 selfloop transitions, 2 changer transitions 0/80 dead transitions. [2023-11-29 06:24:41,458 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 80 transitions, 198 flow [2023-11-29 06:24:41,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 06:24:41,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 06:24:41,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 227 transitions. [2023-11-29 06:24:41,461 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.822463768115942 [2023-11-29 06:24:41,462 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 227 transitions. [2023-11-29 06:24:41,462 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 227 transitions. [2023-11-29 06:24:41,462 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 06:24:41,462 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 227 transitions. [2023-11-29 06:24:41,464 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 75.66666666666667) internal successors, (227), 3 states have internal predecessors, (227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:24:41,465 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 92.0) internal successors, (368), 4 states have internal predecessors, (368), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:24:41,466 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 92.0) internal successors, (368), 4 states have internal predecessors, (368), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:24:41,466 INFO L175 Difference]: Start difference. First operand has 84 places, 80 transitions, 175 flow. Second operand 3 states and 227 transitions. [2023-11-29 06:24:41,466 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 80 transitions, 198 flow [2023-11-29 06:24:41,467 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 80 transitions, 194 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 06:24:41,469 INFO L231 Difference]: Finished difference. Result has 83 places, 79 transitions, 173 flow [2023-11-29 06:24:41,470 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=92, PETRI_DIFFERENCE_MINUEND_FLOW=169, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=77, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=173, PETRI_PLACES=83, PETRI_TRANSITIONS=79} [2023-11-29 06:24:41,470 INFO L281 CegarLoopForPetriNet]: 88 programPoint places, -5 predicate places. [2023-11-29 06:24:41,471 INFO L495 AbstractCegarLoop]: Abstraction has has 83 places, 79 transitions, 173 flow [2023-11-29 06:24:41,471 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 74.0) internal successors, (222), 3 states have internal predecessors, (222), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:24:41,471 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 06:24:41,471 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] [2023-11-29 06:24:41,472 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-29 06:24:41,472 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting salethreadErr1ASSERT_VIOLATIONDATA_RACE === [salethreadErr0ASSERT_VIOLATIONDATA_RACE, salethreadErr1ASSERT_VIOLATIONDATA_RACE, salethreadErr2ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2023-11-29 06:24:41,472 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:24:41,472 INFO L85 PathProgramCache]: Analyzing trace with hash 466346869, now seen corresponding path program 1 times [2023-11-29 06:24:41,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:24:41,473 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [117579974] [2023-11-29 06:24:41,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:24:41,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:24:41,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:24:41,525 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 06:24:41,526 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 06:24:41,526 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [117579974] [2023-11-29 06:24:41,526 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [117579974] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:24:41,526 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:24:41,527 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 06:24:41,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1240714500] [2023-11-29 06:24:41,527 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:24:41,527 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 06:24:41,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 06:24:41,528 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 06:24:41,528 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 06:24:41,536 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 69 out of 92 [2023-11-29 06:24:41,536 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 79 transitions, 173 flow. Second operand has 3 states, 3 states have (on average 71.0) internal successors, (213), 3 states have internal predecessors, (213), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:24:41,536 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 06:24:41,537 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 69 of 92 [2023-11-29 06:24:41,537 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 06:24:41,623 INFO L124 PetriNetUnfolderBase]: 8/215 cut-off events. [2023-11-29 06:24:41,623 INFO L125 PetriNetUnfolderBase]: For 13/21 co-relation queries the response was YES. [2023-11-29 06:24:41,625 INFO L83 FinitePrefix]: Finished finitePrefix Result has 265 conditions, 215 events. 8/215 cut-off events. For 13/21 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 780 event pairs, 4 based on Foata normal form. 0/193 useless extension candidates. Maximal degree in co-relation 259. Up to 25 conditions per place. [2023-11-29 06:24:41,625 INFO L140 encePairwiseOnDemand]: 86/92 looper letters, 12 selfloop transitions, 4 changer transitions 0/82 dead transitions. [2023-11-29 06:24:41,626 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 82 transitions, 214 flow [2023-11-29 06:24:41,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 06:24:41,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 06:24:41,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 225 transitions. [2023-11-29 06:24:41,628 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8152173913043478 [2023-11-29 06:24:41,628 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 225 transitions. [2023-11-29 06:24:41,628 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 225 transitions. [2023-11-29 06:24:41,629 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 06:24:41,629 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 225 transitions. [2023-11-29 06:24:41,630 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 75.0) internal successors, (225), 3 states have internal predecessors, (225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:24:41,631 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 92.0) internal successors, (368), 4 states have internal predecessors, (368), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:24:41,632 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 92.0) internal successors, (368), 4 states have internal predecessors, (368), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:24:41,632 INFO L175 Difference]: Start difference. First operand has 83 places, 79 transitions, 173 flow. Second operand 3 states and 225 transitions. [2023-11-29 06:24:41,632 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 82 transitions, 214 flow [2023-11-29 06:24:41,634 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 82 transitions, 210 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 06:24:41,636 INFO L231 Difference]: Finished difference. Result has 84 places, 81 transitions, 197 flow [2023-11-29 06:24:41,636 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=92, PETRI_DIFFERENCE_MINUEND_FLOW=167, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=197, PETRI_PLACES=84, PETRI_TRANSITIONS=81} [2023-11-29 06:24:41,637 INFO L281 CegarLoopForPetriNet]: 88 programPoint places, -4 predicate places. [2023-11-29 06:24:41,637 INFO L495 AbstractCegarLoop]: Abstraction has has 84 places, 81 transitions, 197 flow [2023-11-29 06:24:41,638 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 71.0) internal successors, (213), 3 states have internal predecessors, (213), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:24:41,638 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 06:24:41,638 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] [2023-11-29 06:24:41,638 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-29 06:24:41,638 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [salethreadErr0ASSERT_VIOLATIONDATA_RACE, salethreadErr1ASSERT_VIOLATIONDATA_RACE, salethreadErr2ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2023-11-29 06:24:41,639 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:24:41,639 INFO L85 PathProgramCache]: Analyzing trace with hash -432073854, now seen corresponding path program 1 times [2023-11-29 06:24:41,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:24:41,640 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2028095619] [2023-11-29 06:24:41,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:24:41,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:24:41,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 06:24:41,668 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 06:24:41,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 06:24:41,708 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 06:24:41,708 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-29 06:24:41,709 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (13 of 14 remaining) [2023-11-29 06:24:41,711 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr0ASSERT_VIOLATIONDATA_RACE (12 of 14 remaining) [2023-11-29 06:24:41,712 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr1ASSERT_VIOLATIONDATA_RACE (11 of 14 remaining) [2023-11-29 06:24:41,712 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr2ASSERT_VIOLATIONDATA_RACE (10 of 14 remaining) [2023-11-29 06:24:41,712 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr3ASSERT_VIOLATIONDATA_RACE (9 of 14 remaining) [2023-11-29 06:24:41,712 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (8 of 14 remaining) [2023-11-29 06:24:41,713 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (7 of 14 remaining) [2023-11-29 06:24:41,713 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (6 of 14 remaining) [2023-11-29 06:24:41,713 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (5 of 14 remaining) [2023-11-29 06:24:41,714 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (4 of 14 remaining) [2023-11-29 06:24:41,714 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr0ASSERT_VIOLATIONDATA_RACE (3 of 14 remaining) [2023-11-29 06:24:41,714 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr1ASSERT_VIOLATIONDATA_RACE (2 of 14 remaining) [2023-11-29 06:24:41,714 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr2ASSERT_VIOLATIONDATA_RACE (1 of 14 remaining) [2023-11-29 06:24:41,715 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr3ASSERT_VIOLATIONDATA_RACE (0 of 14 remaining) [2023-11-29 06:24:41,715 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-29 06:24:41,715 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2023-11-29 06:24:41,718 WARN L233 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2023-11-29 06:24:41,718 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2023-11-29 06:24:41,747 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2023-11-29 06:24:41,751 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 108 places, 113 transitions, 242 flow [2023-11-29 06:24:41,790 INFO L124 PetriNetUnfolderBase]: 22/237 cut-off events. [2023-11-29 06:24:41,790 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2023-11-29 06:24:41,792 INFO L83 FinitePrefix]: Finished finitePrefix Result has 249 conditions, 237 events. 22/237 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 669 event pairs, 0 based on Foata normal form. 0/192 useless extension candidates. Maximal degree in co-relation 133. Up to 8 conditions per place. [2023-11-29 06:24:41,792 INFO L82 GeneralOperation]: Start removeDead. Operand has 108 places, 113 transitions, 242 flow [2023-11-29 06:24:41,795 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 108 places, 113 transitions, 242 flow [2023-11-29 06:24:41,797 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-29 06:24:41,798 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;@302edf09, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-29 06:24:41,798 INFO L358 AbstractCegarLoop]: Starting to check reachability of 18 error locations. [2023-11-29 06:24:41,801 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-29 06:24:41,801 INFO L124 PetriNetUnfolderBase]: 0/15 cut-off events. [2023-11-29 06:24:41,801 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-29 06:24:41,802 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 06:24:41,802 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 06:24:41,802 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [salethreadErr0ASSERT_VIOLATIONDATA_RACE, salethreadErr1ASSERT_VIOLATIONDATA_RACE, salethreadErr2ASSERT_VIOLATIONDATA_RACE (and 15 more)] === [2023-11-29 06:24:41,802 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:24:41,803 INFO L85 PathProgramCache]: Analyzing trace with hash -216625716, now seen corresponding path program 1 times [2023-11-29 06:24:41,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:24:41,803 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [661406844] [2023-11-29 06:24:41,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:24:41,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:24:41,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:24:41,824 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 06:24:41,825 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 06:24:41,825 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [661406844] [2023-11-29 06:24:41,825 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [661406844] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:24:41,825 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:24:41,825 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-29 06:24:41,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [755440139] [2023-11-29 06:24:41,826 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:24:41,826 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-29 06:24:41,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 06:24:41,827 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-29 06:24:41,827 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-29 06:24:41,828 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 113 [2023-11-29 06:24:41,828 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 108 places, 113 transitions, 242 flow. Second operand has 2 states, 2 states have (on average 90.5) internal successors, (181), 2 states have internal predecessors, (181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:24:41,829 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 06:24:41,829 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 113 [2023-11-29 06:24:41,829 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 06:24:41,882 INFO L124 PetriNetUnfolderBase]: 19/231 cut-off events. [2023-11-29 06:24:41,882 INFO L125 PetriNetUnfolderBase]: For 36/42 co-relation queries the response was YES. [2023-11-29 06:24:41,883 INFO L83 FinitePrefix]: Finished finitePrefix Result has 281 conditions, 231 events. 19/231 cut-off events. For 36/42 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 781 event pairs, 4 based on Foata normal form. 26/227 useless extension candidates. Maximal degree in co-relation 136. Up to 30 conditions per place. [2023-11-29 06:24:41,884 INFO L140 encePairwiseOnDemand]: 102/113 looper letters, 11 selfloop transitions, 0 changer transitions 0/99 dead transitions. [2023-11-29 06:24:41,884 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 99 transitions, 236 flow [2023-11-29 06:24:41,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-29 06:24:41,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-11-29 06:24:41,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 202 transitions. [2023-11-29 06:24:41,886 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8938053097345132 [2023-11-29 06:24:41,886 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 202 transitions. [2023-11-29 06:24:41,886 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 202 transitions. [2023-11-29 06:24:41,886 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 06:24:41,887 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 202 transitions. [2023-11-29 06:24:41,887 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 101.0) internal successors, (202), 2 states have internal predecessors, (202), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:24:41,888 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 113.0) internal successors, (339), 3 states have internal predecessors, (339), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:24:41,889 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 113.0) internal successors, (339), 3 states have internal predecessors, (339), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:24:41,889 INFO L175 Difference]: Start difference. First operand has 108 places, 113 transitions, 242 flow. Second operand 2 states and 202 transitions. [2023-11-29 06:24:41,889 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 99 transitions, 236 flow [2023-11-29 06:24:41,890 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 99 transitions, 236 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-29 06:24:41,892 INFO L231 Difference]: Finished difference. Result has 99 places, 99 transitions, 214 flow [2023-11-29 06:24:41,893 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=113, PETRI_DIFFERENCE_MINUEND_FLOW=214, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=99, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=99, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=214, PETRI_PLACES=99, PETRI_TRANSITIONS=99} [2023-11-29 06:24:41,893 INFO L281 CegarLoopForPetriNet]: 108 programPoint places, -9 predicate places. [2023-11-29 06:24:41,894 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 99 transitions, 214 flow [2023-11-29 06:24:41,894 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 90.5) internal successors, (181), 2 states have internal predecessors, (181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:24:41,894 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 06:24:41,894 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] [2023-11-29 06:24:41,894 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-29 06:24:41,895 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [salethreadErr0ASSERT_VIOLATIONDATA_RACE, salethreadErr1ASSERT_VIOLATIONDATA_RACE, salethreadErr2ASSERT_VIOLATIONDATA_RACE (and 15 more)] === [2023-11-29 06:24:41,895 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:24:41,895 INFO L85 PathProgramCache]: Analyzing trace with hash -645241721, now seen corresponding path program 1 times [2023-11-29 06:24:41,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:24:41,896 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [190636089] [2023-11-29 06:24:41,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:24:41,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:24:41,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:24:41,934 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 06:24:41,934 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 06:24:41,935 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [190636089] [2023-11-29 06:24:41,935 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [190636089] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:24:41,935 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:24:41,935 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 06:24:41,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [684358340] [2023-11-29 06:24:41,935 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:24:41,936 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 06:24:41,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 06:24:41,936 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 06:24:41,937 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 06:24:41,948 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 84 out of 113 [2023-11-29 06:24:41,948 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 99 transitions, 214 flow. Second operand has 3 states, 3 states have (on average 86.33333333333333) internal successors, (259), 3 states have internal predecessors, (259), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:24:41,948 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 06:24:41,948 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 113 [2023-11-29 06:24:41,949 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 06:24:42,032 INFO L124 PetriNetUnfolderBase]: 59/445 cut-off events. [2023-11-29 06:24:42,032 INFO L125 PetriNetUnfolderBase]: For 29/29 co-relation queries the response was YES. [2023-11-29 06:24:42,033 INFO L83 FinitePrefix]: Finished finitePrefix Result has 561 conditions, 445 events. 59/445 cut-off events. For 29/29 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 2319 event pairs, 10 based on Foata normal form. 1/382 useless extension candidates. Maximal degree in co-relation 556. Up to 94 conditions per place. [2023-11-29 06:24:42,036 INFO L140 encePairwiseOnDemand]: 110/113 looper letters, 18 selfloop transitions, 2 changer transitions 0/102 dead transitions. [2023-11-29 06:24:42,036 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 102 transitions, 260 flow [2023-11-29 06:24:42,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 06:24:42,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 06:24:42,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 273 transitions. [2023-11-29 06:24:42,038 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8053097345132744 [2023-11-29 06:24:42,038 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 273 transitions. [2023-11-29 06:24:42,038 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 273 transitions. [2023-11-29 06:24:42,039 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 06:24:42,039 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 273 transitions. [2023-11-29 06:24:42,040 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 91.0) internal successors, (273), 3 states have internal predecessors, (273), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:24:42,041 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 113.0) internal successors, (452), 4 states have internal predecessors, (452), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:24:42,041 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 113.0) internal successors, (452), 4 states have internal predecessors, (452), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:24:42,042 INFO L175 Difference]: Start difference. First operand has 99 places, 99 transitions, 214 flow. Second operand 3 states and 273 transitions. [2023-11-29 06:24:42,042 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 102 transitions, 260 flow [2023-11-29 06:24:42,043 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 101 places, 102 transitions, 260 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-29 06:24:42,053 INFO L231 Difference]: Finished difference. Result has 102 places, 100 transitions, 226 flow [2023-11-29 06:24:42,054 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=113, PETRI_DIFFERENCE_MINUEND_FLOW=214, PETRI_DIFFERENCE_MINUEND_PLACES=99, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=99, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=97, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=226, PETRI_PLACES=102, PETRI_TRANSITIONS=100} [2023-11-29 06:24:42,054 INFO L281 CegarLoopForPetriNet]: 108 programPoint places, -6 predicate places. [2023-11-29 06:24:42,055 INFO L495 AbstractCegarLoop]: Abstraction has has 102 places, 100 transitions, 226 flow [2023-11-29 06:24:42,055 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 86.33333333333333) internal successors, (259), 3 states have internal predecessors, (259), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:24:42,055 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 06:24:42,055 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] [2023-11-29 06:24:42,055 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-29 06:24:42,056 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting salethreadErr0ASSERT_VIOLATIONDATA_RACE === [salethreadErr0ASSERT_VIOLATIONDATA_RACE, salethreadErr1ASSERT_VIOLATIONDATA_RACE, salethreadErr2ASSERT_VIOLATIONDATA_RACE (and 15 more)] === [2023-11-29 06:24:42,056 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:24:42,056 INFO L85 PathProgramCache]: Analyzing trace with hash 688878998, now seen corresponding path program 1 times [2023-11-29 06:24:42,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:24:42,056 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1971739841] [2023-11-29 06:24:42,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:24:42,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:24:42,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:24:42,088 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 06:24:42,088 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 06:24:42,088 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1971739841] [2023-11-29 06:24:42,088 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1971739841] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:24:42,088 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:24:42,089 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 06:24:42,089 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1538415247] [2023-11-29 06:24:42,089 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:24:42,089 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 06:24:42,090 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 06:24:42,090 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 06:24:42,090 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 06:24:42,096 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 84 out of 113 [2023-11-29 06:24:42,097 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 100 transitions, 226 flow. Second operand has 3 states, 3 states have (on average 86.0) internal successors, (258), 3 states have internal predecessors, (258), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:24:42,097 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 06:24:42,097 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 113 [2023-11-29 06:24:42,097 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 06:24:42,264 INFO L124 PetriNetUnfolderBase]: 60/739 cut-off events. [2023-11-29 06:24:42,265 INFO L125 PetriNetUnfolderBase]: For 125/311 co-relation queries the response was YES. [2023-11-29 06:24:42,267 INFO L83 FinitePrefix]: Finished finitePrefix Result has 908 conditions, 739 events. 60/739 cut-off events. For 125/311 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 4838 event pairs, 11 based on Foata normal form. 0/629 useless extension candidates. Maximal degree in co-relation 901. Up to 59 conditions per place. [2023-11-29 06:24:42,271 INFO L140 encePairwiseOnDemand]: 105/113 looper letters, 22 selfloop transitions, 6 changer transitions 0/111 dead transitions. [2023-11-29 06:24:42,271 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 111 transitions, 315 flow [2023-11-29 06:24:42,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 06:24:42,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 06:24:42,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 282 transitions. [2023-11-29 06:24:42,273 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.831858407079646 [2023-11-29 06:24:42,273 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 282 transitions. [2023-11-29 06:24:42,273 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 282 transitions. [2023-11-29 06:24:42,273 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 06:24:42,273 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 282 transitions. [2023-11-29 06:24:42,275 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 94.0) internal successors, (282), 3 states have internal predecessors, (282), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:24:42,276 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 113.0) internal successors, (452), 4 states have internal predecessors, (452), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:24:42,276 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 113.0) internal successors, (452), 4 states have internal predecessors, (452), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:24:42,276 INFO L175 Difference]: Start difference. First operand has 102 places, 100 transitions, 226 flow. Second operand 3 states and 282 transitions. [2023-11-29 06:24:42,276 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 111 transitions, 315 flow [2023-11-29 06:24:42,278 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 103 places, 111 transitions, 313 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-29 06:24:42,280 INFO L231 Difference]: Finished difference. Result has 105 places, 106 transitions, 276 flow [2023-11-29 06:24:42,280 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=113, PETRI_DIFFERENCE_MINUEND_FLOW=224, PETRI_DIFFERENCE_MINUEND_PLACES=101, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=100, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=94, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=276, PETRI_PLACES=105, PETRI_TRANSITIONS=106} [2023-11-29 06:24:42,281 INFO L281 CegarLoopForPetriNet]: 108 programPoint places, -3 predicate places. [2023-11-29 06:24:42,281 INFO L495 AbstractCegarLoop]: Abstraction has has 105 places, 106 transitions, 276 flow [2023-11-29 06:24:42,282 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 86.0) internal successors, (258), 3 states have internal predecessors, (258), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:24:42,282 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 06:24:42,282 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] [2023-11-29 06:24:42,282 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-29 06:24:42,282 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting salethreadErr1ASSERT_VIOLATIONDATA_RACE === [salethreadErr0ASSERT_VIOLATIONDATA_RACE, salethreadErr1ASSERT_VIOLATIONDATA_RACE, salethreadErr2ASSERT_VIOLATIONDATA_RACE (and 15 more)] === [2023-11-29 06:24:42,282 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:24:42,283 INFO L85 PathProgramCache]: Analyzing trace with hash 1040897320, now seen corresponding path program 1 times [2023-11-29 06:24:42,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:24:42,283 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [117529706] [2023-11-29 06:24:42,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:24:42,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:24:42,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:24:42,315 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 06:24:42,315 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 06:24:42,315 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [117529706] [2023-11-29 06:24:42,316 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [117529706] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:24:42,316 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:24:42,316 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 06:24:42,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [962033465] [2023-11-29 06:24:42,316 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:24:42,316 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 06:24:42,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 06:24:42,317 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 06:24:42,317 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 06:24:42,328 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 81 out of 113 [2023-11-29 06:24:42,328 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 106 transitions, 276 flow. Second operand has 3 states, 3 states have (on average 83.0) internal successors, (249), 3 states have internal predecessors, (249), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:24:42,328 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 06:24:42,329 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 81 of 113 [2023-11-29 06:24:42,329 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 06:24:42,641 INFO L124 PetriNetUnfolderBase]: 272/1930 cut-off events. [2023-11-29 06:24:42,641 INFO L125 PetriNetUnfolderBase]: For 392/838 co-relation queries the response was YES. [2023-11-29 06:24:42,646 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2719 conditions, 1930 events. 272/1930 cut-off events. For 392/838 co-relation queries the response was YES. Maximal size of possible extension queue 104. Compared 17298 event pairs, 91 based on Foata normal form. 1/1670 useless extension candidates. Maximal degree in co-relation 2711. Up to 395 conditions per place. [2023-11-29 06:24:42,654 INFO L140 encePairwiseOnDemand]: 102/113 looper letters, 27 selfloop transitions, 8 changer transitions 0/119 dead transitions. [2023-11-29 06:24:42,654 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 119 transitions, 391 flow [2023-11-29 06:24:42,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 06:24:42,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 06:24:42,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 279 transitions. [2023-11-29 06:24:42,656 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8230088495575221 [2023-11-29 06:24:42,656 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 279 transitions. [2023-11-29 06:24:42,656 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 279 transitions. [2023-11-29 06:24:42,656 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 06:24:42,656 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 279 transitions. [2023-11-29 06:24:42,657 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 93.0) internal successors, (279), 3 states have internal predecessors, (279), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:24:42,658 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 113.0) internal successors, (452), 4 states have internal predecessors, (452), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:24:42,658 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 113.0) internal successors, (452), 4 states have internal predecessors, (452), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:24:42,658 INFO L175 Difference]: Start difference. First operand has 105 places, 106 transitions, 276 flow. Second operand 3 states and 279 transitions. [2023-11-29 06:24:42,659 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 107 places, 119 transitions, 391 flow [2023-11-29 06:24:42,661 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 105 places, 119 transitions, 375 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 06:24:42,664 INFO L231 Difference]: Finished difference. Result has 107 places, 114 transitions, 334 flow [2023-11-29 06:24:42,664 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=113, PETRI_DIFFERENCE_MINUEND_FLOW=264, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=106, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=98, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=334, PETRI_PLACES=107, PETRI_TRANSITIONS=114} [2023-11-29 06:24:42,665 INFO L281 CegarLoopForPetriNet]: 108 programPoint places, -1 predicate places. [2023-11-29 06:24:42,665 INFO L495 AbstractCegarLoop]: Abstraction has has 107 places, 114 transitions, 334 flow [2023-11-29 06:24:42,665 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 83.0) internal successors, (249), 3 states have internal predecessors, (249), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:24:42,665 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 06:24:42,665 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] [2023-11-29 06:24:42,666 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-29 06:24:42,666 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [salethreadErr0ASSERT_VIOLATIONDATA_RACE, salethreadErr1ASSERT_VIOLATIONDATA_RACE, salethreadErr2ASSERT_VIOLATIONDATA_RACE (and 15 more)] === [2023-11-29 06:24:42,666 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:24:42,666 INFO L85 PathProgramCache]: Analyzing trace with hash -457973571, now seen corresponding path program 1 times [2023-11-29 06:24:42,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:24:42,667 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1132267391] [2023-11-29 06:24:42,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:24:42,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:24:42,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:24:42,750 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 06:24:42,751 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 06:24:42,751 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1132267391] [2023-11-29 06:24:42,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1132267391] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 06:24:42,751 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [984911476] [2023-11-29 06:24:42,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:24:42,751 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 06:24:42,752 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_134da552-ab6a-4313-9d17-0e65a57f8ff7/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 06:24:42,755 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_134da552-ab6a-4313-9d17-0e65a57f8ff7/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 06:24:42,757 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_134da552-ab6a-4313-9d17-0e65a57f8ff7/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-29 06:24:42,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:24:42,846 INFO L262 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-29 06:24:42,849 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 06:24:42,926 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 06:24:42,926 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 06:24:42,971 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 06:24:42,971 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [984911476] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 06:24:42,971 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 06:24:42,972 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2023-11-29 06:24:42,972 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1079082784] [2023-11-29 06:24:42,972 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 06:24:42,973 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-29 06:24:42,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 06:24:42,973 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-29 06:24:42,974 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2023-11-29 06:24:42,996 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 81 out of 113 [2023-11-29 06:24:42,997 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 114 transitions, 334 flow. Second operand has 10 states, 10 states have (on average 83.4) internal successors, (834), 10 states have internal predecessors, (834), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:24:42,997 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 06:24:42,997 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 81 of 113 [2023-11-29 06:24:42,998 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 06:24:43,194 INFO L124 PetriNetUnfolderBase]: 165/615 cut-off events. [2023-11-29 06:24:43,194 INFO L125 PetriNetUnfolderBase]: For 368/420 co-relation queries the response was YES. [2023-11-29 06:24:43,196 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1238 conditions, 615 events. 165/615 cut-off events. For 368/420 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 4273 event pairs, 5 based on Foata normal form. 37/600 useless extension candidates. Maximal degree in co-relation 1229. Up to 104 conditions per place. [2023-11-29 06:24:43,199 INFO L140 encePairwiseOnDemand]: 108/113 looper letters, 47 selfloop transitions, 7 changer transitions 0/112 dead transitions. [2023-11-29 06:24:43,200 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 112 transitions, 494 flow [2023-11-29 06:24:43,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-29 06:24:43,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-11-29 06:24:43,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 769 transitions. [2023-11-29 06:24:43,203 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7561455260570304 [2023-11-29 06:24:43,203 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 769 transitions. [2023-11-29 06:24:43,203 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 769 transitions. [2023-11-29 06:24:43,204 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 06:24:43,204 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 769 transitions. [2023-11-29 06:24:43,206 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 85.44444444444444) internal successors, (769), 9 states have internal predecessors, (769), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:24:43,209 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 113.0) internal successors, (1130), 10 states have internal predecessors, (1130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:24:43,209 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 113.0) internal successors, (1130), 10 states have internal predecessors, (1130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:24:43,209 INFO L175 Difference]: Start difference. First operand has 107 places, 114 transitions, 334 flow. Second operand 9 states and 769 transitions. [2023-11-29 06:24:43,209 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 112 transitions, 494 flow [2023-11-29 06:24:43,212 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 112 transitions, 464 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 06:24:43,214 INFO L231 Difference]: Finished difference. Result has 81 places, 80 transitions, 246 flow [2023-11-29 06:24:43,214 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=113, PETRI_DIFFERENCE_MINUEND_FLOW=228, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=73, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=246, PETRI_PLACES=81, PETRI_TRANSITIONS=80} [2023-11-29 06:24:43,215 INFO L281 CegarLoopForPetriNet]: 108 programPoint places, -27 predicate places. [2023-11-29 06:24:43,215 INFO L495 AbstractCegarLoop]: Abstraction has has 81 places, 80 transitions, 246 flow [2023-11-29 06:24:43,216 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 83.4) internal successors, (834), 10 states have internal predecessors, (834), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:24:43,216 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 06:24:43,216 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] [2023-11-29 06:24:43,226 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_134da552-ab6a-4313-9d17-0e65a57f8ff7/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-29 06:24:43,416 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_134da552-ab6a-4313-9d17-0e65a57f8ff7/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 06:24:43,417 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [salethreadErr0ASSERT_VIOLATIONDATA_RACE, salethreadErr1ASSERT_VIOLATIONDATA_RACE, salethreadErr2ASSERT_VIOLATIONDATA_RACE (and 15 more)] === [2023-11-29 06:24:43,417 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:24:43,417 INFO L85 PathProgramCache]: Analyzing trace with hash 1772929582, now seen corresponding path program 1 times [2023-11-29 06:24:43,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:24:43,418 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [913732561] [2023-11-29 06:24:43,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:24:43,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:24:43,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 06:24:43,434 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 06:24:43,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 06:24:43,451 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 06:24:43,452 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-29 06:24:43,452 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (17 of 18 remaining) [2023-11-29 06:24:43,452 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr0ASSERT_VIOLATIONDATA_RACE (16 of 18 remaining) [2023-11-29 06:24:43,452 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr1ASSERT_VIOLATIONDATA_RACE (15 of 18 remaining) [2023-11-29 06:24:43,452 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr2ASSERT_VIOLATIONDATA_RACE (14 of 18 remaining) [2023-11-29 06:24:43,452 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr3ASSERT_VIOLATIONDATA_RACE (13 of 18 remaining) [2023-11-29 06:24:43,453 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (12 of 18 remaining) [2023-11-29 06:24:43,453 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (11 of 18 remaining) [2023-11-29 06:24:43,453 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (10 of 18 remaining) [2023-11-29 06:24:43,453 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (9 of 18 remaining) [2023-11-29 06:24:43,453 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (8 of 18 remaining) [2023-11-29 06:24:43,453 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr0ASSERT_VIOLATIONDATA_RACE (7 of 18 remaining) [2023-11-29 06:24:43,454 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr1ASSERT_VIOLATIONDATA_RACE (6 of 18 remaining) [2023-11-29 06:24:43,454 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr2ASSERT_VIOLATIONDATA_RACE (5 of 18 remaining) [2023-11-29 06:24:43,454 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr3ASSERT_VIOLATIONDATA_RACE (4 of 18 remaining) [2023-11-29 06:24:43,454 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr0ASSERT_VIOLATIONDATA_RACE (3 of 18 remaining) [2023-11-29 06:24:43,454 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr1ASSERT_VIOLATIONDATA_RACE (2 of 18 remaining) [2023-11-29 06:24:43,454 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr2ASSERT_VIOLATIONDATA_RACE (1 of 18 remaining) [2023-11-29 06:24:43,454 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr3ASSERT_VIOLATIONDATA_RACE (0 of 18 remaining) [2023-11-29 06:24:43,455 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-29 06:24:43,455 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2023-11-29 06:24:43,455 WARN L233 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2023-11-29 06:24:43,456 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2023-11-29 06:24:43,480 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2023-11-29 06:24:43,483 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 128 places, 134 transitions, 295 flow [2023-11-29 06:24:43,532 INFO L124 PetriNetUnfolderBase]: 42/418 cut-off events. [2023-11-29 06:24:43,532 INFO L125 PetriNetUnfolderBase]: For 19/19 co-relation queries the response was YES. [2023-11-29 06:24:43,534 INFO L83 FinitePrefix]: Finished finitePrefix Result has 443 conditions, 418 events. 42/418 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 1425 event pairs, 1 based on Foata normal form. 0/341 useless extension candidates. Maximal degree in co-relation 245. Up to 16 conditions per place. [2023-11-29 06:24:43,534 INFO L82 GeneralOperation]: Start removeDead. Operand has 128 places, 134 transitions, 295 flow [2023-11-29 06:24:43,539 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 128 places, 134 transitions, 295 flow [2023-11-29 06:24:43,540 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-29 06:24:43,541 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;@302edf09, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-29 06:24:43,541 INFO L358 AbstractCegarLoop]: Starting to check reachability of 22 error locations. [2023-11-29 06:24:43,543 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-29 06:24:43,543 INFO L124 PetriNetUnfolderBase]: 0/15 cut-off events. [2023-11-29 06:24:43,543 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-29 06:24:43,543 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 06:24:43,543 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 06:24:43,543 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [salethreadErr0ASSERT_VIOLATIONDATA_RACE, salethreadErr1ASSERT_VIOLATIONDATA_RACE, salethreadErr2ASSERT_VIOLATIONDATA_RACE (and 19 more)] === [2023-11-29 06:24:43,544 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:24:43,544 INFO L85 PathProgramCache]: Analyzing trace with hash -1902783540, now seen corresponding path program 1 times [2023-11-29 06:24:43,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:24:43,544 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [826731012] [2023-11-29 06:24:43,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:24:43,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:24:43,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:24:43,557 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 06:24:43,558 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 06:24:43,558 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [826731012] [2023-11-29 06:24:43,558 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [826731012] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:24:43,558 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:24:43,558 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-29 06:24:43,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1769782291] [2023-11-29 06:24:43,558 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:24:43,559 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-29 06:24:43,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 06:24:43,559 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-29 06:24:43,559 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-29 06:24:43,560 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 134 [2023-11-29 06:24:43,560 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 128 places, 134 transitions, 295 flow. Second operand has 2 states, 2 states have (on average 105.5) internal successors, (211), 2 states have internal predecessors, (211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:24:43,560 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 06:24:43,560 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 134 [2023-11-29 06:24:43,561 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 06:24:43,650 INFO L124 PetriNetUnfolderBase]: 91/514 cut-off events. [2023-11-29 06:24:43,650 INFO L125 PetriNetUnfolderBase]: For 182/202 co-relation queries the response was YES. [2023-11-29 06:24:43,652 INFO L83 FinitePrefix]: Finished finitePrefix Result has 711 conditions, 514 events. 91/514 cut-off events. For 182/202 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 2378 event pairs, 27 based on Foata normal form. 72/523 useless extension candidates. Maximal degree in co-relation 362. Up to 122 conditions per place. [2023-11-29 06:24:43,656 INFO L140 encePairwiseOnDemand]: 121/134 looper letters, 15 selfloop transitions, 0 changer transitions 0/118 dead transitions. [2023-11-29 06:24:43,657 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 118 transitions, 293 flow [2023-11-29 06:24:43,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-29 06:24:43,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-11-29 06:24:43,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 238 transitions. [2023-11-29 06:24:43,658 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8880597014925373 [2023-11-29 06:24:43,658 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 238 transitions. [2023-11-29 06:24:43,658 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 238 transitions. [2023-11-29 06:24:43,659 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 06:24:43,659 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 238 transitions. [2023-11-29 06:24:43,660 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 119.0) internal successors, (238), 2 states have internal predecessors, (238), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:24:43,660 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 134.0) internal successors, (402), 3 states have internal predecessors, (402), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:24:43,661 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 134.0) internal successors, (402), 3 states have internal predecessors, (402), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:24:43,661 INFO L175 Difference]: Start difference. First operand has 128 places, 134 transitions, 295 flow. Second operand 2 states and 238 transitions. [2023-11-29 06:24:43,661 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 117 places, 118 transitions, 293 flow [2023-11-29 06:24:43,662 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 118 transitions, 293 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-29 06:24:43,664 INFO L231 Difference]: Finished difference. Result has 117 places, 118 transitions, 263 flow [2023-11-29 06:24:43,664 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=134, PETRI_DIFFERENCE_MINUEND_FLOW=263, PETRI_DIFFERENCE_MINUEND_PLACES=116, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=118, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=118, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=263, PETRI_PLACES=117, PETRI_TRANSITIONS=118} [2023-11-29 06:24:43,665 INFO L281 CegarLoopForPetriNet]: 128 programPoint places, -11 predicate places. [2023-11-29 06:24:43,665 INFO L495 AbstractCegarLoop]: Abstraction has has 117 places, 118 transitions, 263 flow [2023-11-29 06:24:43,665 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 105.5) internal successors, (211), 2 states have internal predecessors, (211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:24:43,666 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 06:24:43,666 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] [2023-11-29 06:24:43,666 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-29 06:24:43,666 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [salethreadErr0ASSERT_VIOLATIONDATA_RACE, salethreadErr1ASSERT_VIOLATIONDATA_RACE, salethreadErr2ASSERT_VIOLATIONDATA_RACE (and 19 more)] === [2023-11-29 06:24:43,666 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:24:43,666 INFO L85 PathProgramCache]: Analyzing trace with hash 1645649479, now seen corresponding path program 1 times [2023-11-29 06:24:43,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:24:43,667 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [160922856] [2023-11-29 06:24:43,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:24:43,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:24:43,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:24:43,695 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 06:24:43,695 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 06:24:43,696 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [160922856] [2023-11-29 06:24:43,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [160922856] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:24:43,696 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:24:43,696 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 06:24:43,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1410151350] [2023-11-29 06:24:43,696 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:24:43,696 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 06:24:43,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 06:24:43,697 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 06:24:43,697 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 06:24:43,707 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 134 [2023-11-29 06:24:43,708 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 118 transitions, 263 flow. Second operand has 3 states, 3 states have (on average 101.33333333333333) internal successors, (304), 3 states have internal predecessors, (304), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:24:43,708 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 06:24:43,708 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 134 [2023-11-29 06:24:43,708 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 06:24:43,935 INFO L124 PetriNetUnfolderBase]: 234/1288 cut-off events. [2023-11-29 06:24:43,935 INFO L125 PetriNetUnfolderBase]: For 136/136 co-relation queries the response was YES. [2023-11-29 06:24:43,940 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1673 conditions, 1288 events. 234/1288 cut-off events. For 136/136 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 9034 event pairs, 64 based on Foata normal form. 1/1113 useless extension candidates. Maximal degree in co-relation 1667. Up to 325 conditions per place. [2023-11-29 06:24:43,949 INFO L140 encePairwiseOnDemand]: 131/134 looper letters, 22 selfloop transitions, 2 changer transitions 0/121 dead transitions. [2023-11-29 06:24:43,949 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 121 transitions, 317 flow [2023-11-29 06:24:43,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 06:24:43,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 06:24:43,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 322 transitions. [2023-11-29 06:24:43,952 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8009950248756219 [2023-11-29 06:24:43,952 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 322 transitions. [2023-11-29 06:24:43,952 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 322 transitions. [2023-11-29 06:24:43,952 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 06:24:43,952 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 322 transitions. [2023-11-29 06:24:43,954 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 107.33333333333333) internal successors, (322), 3 states have internal predecessors, (322), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:24:43,955 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 134.0) internal successors, (536), 4 states have internal predecessors, (536), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:24:43,955 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 134.0) internal successors, (536), 4 states have internal predecessors, (536), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:24:43,956 INFO L175 Difference]: Start difference. First operand has 117 places, 118 transitions, 263 flow. Second operand 3 states and 322 transitions. [2023-11-29 06:24:43,956 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 121 transitions, 317 flow [2023-11-29 06:24:43,957 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 119 places, 121 transitions, 317 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-29 06:24:43,960 INFO L231 Difference]: Finished difference. Result has 120 places, 119 transitions, 275 flow [2023-11-29 06:24:43,960 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=134, PETRI_DIFFERENCE_MINUEND_FLOW=263, PETRI_DIFFERENCE_MINUEND_PLACES=117, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=118, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=116, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=275, PETRI_PLACES=120, PETRI_TRANSITIONS=119} [2023-11-29 06:24:43,960 INFO L281 CegarLoopForPetriNet]: 128 programPoint places, -8 predicate places. [2023-11-29 06:24:43,961 INFO L495 AbstractCegarLoop]: Abstraction has has 120 places, 119 transitions, 275 flow [2023-11-29 06:24:43,961 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 101.33333333333333) internal successors, (304), 3 states have internal predecessors, (304), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:24:43,961 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 06:24:43,961 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] [2023-11-29 06:24:43,961 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-29 06:24:43,961 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting salethreadErr0ASSERT_VIOLATIONDATA_RACE === [salethreadErr0ASSERT_VIOLATIONDATA_RACE, salethreadErr1ASSERT_VIOLATIONDATA_RACE, salethreadErr2ASSERT_VIOLATIONDATA_RACE (and 19 more)] === [2023-11-29 06:24:43,962 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:24:43,962 INFO L85 PathProgramCache]: Analyzing trace with hash -1307333937, now seen corresponding path program 1 times [2023-11-29 06:24:43,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:24:43,962 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1086293093] [2023-11-29 06:24:43,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:24:43,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:24:43,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:24:43,990 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 06:24:43,991 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 06:24:43,991 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1086293093] [2023-11-29 06:24:43,991 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1086293093] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:24:43,991 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:24:43,991 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 06:24:43,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1151390676] [2023-11-29 06:24:43,991 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:24:43,992 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 06:24:43,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 06:24:43,992 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 06:24:43,992 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 06:24:44,001 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 134 [2023-11-29 06:24:44,002 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 120 places, 119 transitions, 275 flow. Second operand has 3 states, 3 states have (on average 98.0) internal successors, (294), 3 states have internal predecessors, (294), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:24:44,002 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 06:24:44,002 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 134 [2023-11-29 06:24:44,002 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 06:24:44,491 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([573] salethreadEXIT-->L750-7: Formula: (= v_salethreadThread2of3ForFork0_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem10#1_15| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) InVars {salethreadThread2of3ForFork0_thidvar0=v_salethreadThread2of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem10#1=|v_ULTIMATE.start_main_#t~mem10#1_15|} OutVars{salethreadThread2of3ForFork0_thidvar0=v_salethreadThread2of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem10#1=|v_ULTIMATE.start_main_#t~mem10#1_15|} AuxVars[] AssignedVars[][121], [salethreadThread3of3ForFork0NotInUse, 141#(= |#race~stopSales~0| 0), 39#L750-7true, 131#true, 134#true, Black: 136#(= |ULTIMATE.start_main_~i~0#1| 0), salethreadThread1of3ForFork0InUse, 89#L721-1true, salethreadThread2of3ForFork0NotInUse]) [2023-11-29 06:24:44,491 INFO L294 olderBase$Statistics]: this new event has 92 ancestors and is cut-off event [2023-11-29 06:24:44,491 INFO L297 olderBase$Statistics]: existing Event has 64 ancestors and is cut-off event [2023-11-29 06:24:44,491 INFO L297 olderBase$Statistics]: existing Event has 58 ancestors and is cut-off event [2023-11-29 06:24:44,491 INFO L297 olderBase$Statistics]: existing Event has 86 ancestors and is cut-off event [2023-11-29 06:24:44,491 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([573] salethreadEXIT-->L750-7: Formula: (= v_salethreadThread2of3ForFork0_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem10#1_15| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) InVars {salethreadThread2of3ForFork0_thidvar0=v_salethreadThread2of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem10#1=|v_ULTIMATE.start_main_#t~mem10#1_15|} OutVars{salethreadThread2of3ForFork0_thidvar0=v_salethreadThread2of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem10#1=|v_ULTIMATE.start_main_#t~mem10#1_15|} AuxVars[] AssignedVars[][121], [salethreadThread3of3ForFork0NotInUse, 141#(= |#race~stopSales~0| 0), 39#L750-7true, 96#L721-2true, 131#true, 134#true, Black: 136#(= |ULTIMATE.start_main_~i~0#1| 0), salethreadThread1of3ForFork0InUse, salethreadThread2of3ForFork0NotInUse]) [2023-11-29 06:24:44,491 INFO L294 olderBase$Statistics]: this new event has 93 ancestors and is cut-off event [2023-11-29 06:24:44,492 INFO L297 olderBase$Statistics]: existing Event has 59 ancestors and is cut-off event [2023-11-29 06:24:44,492 INFO L297 olderBase$Statistics]: existing Event has 65 ancestors and is cut-off event [2023-11-29 06:24:44,492 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is cut-off event [2023-11-29 06:24:44,520 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([573] salethreadEXIT-->L750-7: Formula: (= v_salethreadThread2of3ForFork0_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem10#1_15| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) InVars {salethreadThread2of3ForFork0_thidvar0=v_salethreadThread2of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem10#1=|v_ULTIMATE.start_main_#t~mem10#1_15|} OutVars{salethreadThread2of3ForFork0_thidvar0=v_salethreadThread2of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem10#1=|v_ULTIMATE.start_main_#t~mem10#1_15|} AuxVars[] AssignedVars[][121], [salethreadThread3of3ForFork0NotInUse, 141#(= |#race~stopSales~0| 0), 39#L750-7true, 131#true, 134#true, Black: 136#(= |ULTIMATE.start_main_~i~0#1| 0), 71#L730true, salethreadThread1of3ForFork0InUse, salethreadThread2of3ForFork0NotInUse]) [2023-11-29 06:24:44,520 INFO L294 olderBase$Statistics]: this new event has 93 ancestors and is cut-off event [2023-11-29 06:24:44,520 INFO L297 olderBase$Statistics]: existing Event has 99 ancestors and is cut-off event [2023-11-29 06:24:44,520 INFO L297 olderBase$Statistics]: existing Event has 71 ancestors and is cut-off event [2023-11-29 06:24:44,520 INFO L297 olderBase$Statistics]: existing Event has 65 ancestors and is cut-off event [2023-11-29 06:24:44,554 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([573] salethreadEXIT-->L750-7: Formula: (= v_salethreadThread2of3ForFork0_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem10#1_15| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) InVars {salethreadThread2of3ForFork0_thidvar0=v_salethreadThread2of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem10#1=|v_ULTIMATE.start_main_#t~mem10#1_15|} OutVars{salethreadThread2of3ForFork0_thidvar0=v_salethreadThread2of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem10#1=|v_ULTIMATE.start_main_#t~mem10#1_15|} AuxVars[] AssignedVars[][120], [salethreadThread3of3ForFork0NotInUse, 139#true, 39#L750-7true, 131#true, 134#true, Black: 136#(= |ULTIMATE.start_main_~i~0#1| 0), 71#L730true, salethreadThread1of3ForFork0InUse, salethreadThread2of3ForFork0NotInUse]) [2023-11-29 06:24:44,555 INFO L294 olderBase$Statistics]: this new event has 99 ancestors and is cut-off event [2023-11-29 06:24:44,555 INFO L297 olderBase$Statistics]: existing Event has 93 ancestors and is cut-off event [2023-11-29 06:24:44,555 INFO L297 olderBase$Statistics]: existing Event has 65 ancestors and is cut-off event [2023-11-29 06:24:44,555 INFO L297 olderBase$Statistics]: existing Event has 71 ancestors and is cut-off event [2023-11-29 06:24:44,636 INFO L124 PetriNetUnfolderBase]: 724/4772 cut-off events. [2023-11-29 06:24:44,636 INFO L125 PetriNetUnfolderBase]: For 1376/3596 co-relation queries the response was YES. [2023-11-29 06:24:44,651 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6291 conditions, 4772 events. 724/4772 cut-off events. For 1376/3596 co-relation queries the response was YES. Maximal size of possible extension queue 202. Compared 51849 event pairs, 153 based on Foata normal form. 9/3960 useless extension candidates. Maximal degree in co-relation 6283. Up to 584 conditions per place. [2023-11-29 06:24:44,681 INFO L140 encePairwiseOnDemand]: 122/134 looper letters, 32 selfloop transitions, 9 changer transitions 0/136 dead transitions. [2023-11-29 06:24:44,681 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 136 transitions, 412 flow [2023-11-29 06:24:44,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 06:24:44,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 06:24:44,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 332 transitions. [2023-11-29 06:24:44,683 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8258706467661692 [2023-11-29 06:24:44,683 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 332 transitions. [2023-11-29 06:24:44,683 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 332 transitions. [2023-11-29 06:24:44,684 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 06:24:44,684 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 332 transitions. [2023-11-29 06:24:44,685 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 110.66666666666667) internal successors, (332), 3 states have internal predecessors, (332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:24:44,686 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 134.0) internal successors, (536), 4 states have internal predecessors, (536), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:24:44,686 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 134.0) internal successors, (536), 4 states have internal predecessors, (536), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:24:44,687 INFO L175 Difference]: Start difference. First operand has 120 places, 119 transitions, 275 flow. Second operand 3 states and 332 transitions. [2023-11-29 06:24:44,687 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 122 places, 136 transitions, 412 flow [2023-11-29 06:24:44,689 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 121 places, 136 transitions, 410 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-29 06:24:44,691 INFO L231 Difference]: Finished difference. Result has 123 places, 128 transitions, 351 flow [2023-11-29 06:24:44,691 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=134, PETRI_DIFFERENCE_MINUEND_FLOW=273, PETRI_DIFFERENCE_MINUEND_PLACES=119, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=119, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=110, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=351, PETRI_PLACES=123, PETRI_TRANSITIONS=128} [2023-11-29 06:24:44,692 INFO L281 CegarLoopForPetriNet]: 128 programPoint places, -5 predicate places. [2023-11-29 06:24:44,692 INFO L495 AbstractCegarLoop]: Abstraction has has 123 places, 128 transitions, 351 flow [2023-11-29 06:24:44,692 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 98.0) internal successors, (294), 3 states have internal predecessors, (294), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:24:44,692 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 06:24:44,693 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] [2023-11-29 06:24:44,693 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-29 06:24:44,693 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting salethreadErr1ASSERT_VIOLATIONDATA_RACE === [salethreadErr0ASSERT_VIOLATIONDATA_RACE, salethreadErr1ASSERT_VIOLATIONDATA_RACE, salethreadErr2ASSERT_VIOLATIONDATA_RACE (and 19 more)] === [2023-11-29 06:24:44,693 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:24:44,693 INFO L85 PathProgramCache]: Analyzing trace with hash -21298053, now seen corresponding path program 1 times [2023-11-29 06:24:44,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:24:44,693 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [488699640] [2023-11-29 06:24:44,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:24:44,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:24:44,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:24:44,719 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 06:24:44,719 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 06:24:44,720 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [488699640] [2023-11-29 06:24:44,720 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [488699640] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:24:44,720 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:24:44,720 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 06:24:44,720 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [65346847] [2023-11-29 06:24:44,720 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:24:44,721 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 06:24:44,721 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 06:24:44,721 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 06:24:44,721 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 06:24:44,734 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 134 [2023-11-29 06:24:44,735 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 123 places, 128 transitions, 351 flow. Second operand has 3 states, 3 states have (on average 95.0) internal successors, (285), 3 states have internal predecessors, (285), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:24:44,735 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 06:24:44,735 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 134 [2023-11-29 06:24:44,735 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 06:24:46,621 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([572] salethreadEXIT-->L750-7: Formula: (= v_salethreadThread1of3ForFork0_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem10#1_13| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) InVars {salethreadThread1of3ForFork0_thidvar0=v_salethreadThread1of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem10#1=|v_ULTIMATE.start_main_#t~mem10#1_13|} OutVars{salethreadThread1of3ForFork0_thidvar0=v_salethreadThread1of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem10#1=|v_ULTIMATE.start_main_#t~mem10#1_13|} AuxVars[] AssignedVars[][80], [salethreadThread3of3ForFork0NotInUse, 147#(= |#race~numberOfSeatsSold~0| 0), 141#(= |#race~stopSales~0| 0), 39#L750-7true, 107#L722-2true, 131#true, Black: 136#(= |ULTIMATE.start_main_~i~0#1| 0), salethreadThread1of3ForFork0NotInUse, salethreadThread2of3ForFork0InUse, Black: 139#true]) [2023-11-29 06:24:46,621 INFO L294 olderBase$Statistics]: this new event has 90 ancestors and is cut-off event [2023-11-29 06:24:46,621 INFO L297 olderBase$Statistics]: existing Event has 62 ancestors and is cut-off event [2023-11-29 06:24:46,621 INFO L297 olderBase$Statistics]: existing Event has 96 ancestors and is cut-off event [2023-11-29 06:24:46,621 INFO L297 olderBase$Statistics]: existing Event has 68 ancestors and is cut-off event [2023-11-29 06:24:46,621 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([572] salethreadEXIT-->L750-7: Formula: (= v_salethreadThread1of3ForFork0_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem10#1_13| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) InVars {salethreadThread1of3ForFork0_thidvar0=v_salethreadThread1of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem10#1=|v_ULTIMATE.start_main_#t~mem10#1_13|} OutVars{salethreadThread1of3ForFork0_thidvar0=v_salethreadThread1of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem10#1=|v_ULTIMATE.start_main_#t~mem10#1_13|} AuxVars[] AssignedVars[][80], [salethreadThread3of3ForFork0NotInUse, 111#L722-1true, 147#(= |#race~numberOfSeatsSold~0| 0), 141#(= |#race~stopSales~0| 0), 39#L750-7true, 131#true, Black: 136#(= |ULTIMATE.start_main_~i~0#1| 0), salethreadThread1of3ForFork0NotInUse, salethreadThread2of3ForFork0InUse, Black: 139#true]) [2023-11-29 06:24:46,621 INFO L294 olderBase$Statistics]: this new event has 89 ancestors and is cut-off event [2023-11-29 06:24:46,622 INFO L297 olderBase$Statistics]: existing Event has 61 ancestors and is cut-off event [2023-11-29 06:24:46,622 INFO L297 olderBase$Statistics]: existing Event has 95 ancestors and is cut-off event [2023-11-29 06:24:46,622 INFO L297 olderBase$Statistics]: existing Event has 67 ancestors and is cut-off event [2023-11-29 06:24:46,622 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([572] salethreadEXIT-->L750-7: Formula: (= v_salethreadThread1of3ForFork0_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem10#1_13| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) InVars {salethreadThread1of3ForFork0_thidvar0=v_salethreadThread1of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem10#1=|v_ULTIMATE.start_main_#t~mem10#1_13|} OutVars{salethreadThread1of3ForFork0_thidvar0=v_salethreadThread1of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem10#1=|v_ULTIMATE.start_main_#t~mem10#1_13|} AuxVars[] AssignedVars[][80], [Black: 141#(= |#race~stopSales~0| 0), salethreadThread3of3ForFork0NotInUse, 139#true, 147#(= |#race~numberOfSeatsSold~0| 0), 39#L750-7true, 16#L730true, 131#true, Black: 136#(= |ULTIMATE.start_main_~i~0#1| 0), salethreadThread1of3ForFork0NotInUse, salethreadThread2of3ForFork0InUse]) [2023-11-29 06:24:46,622 INFO L294 olderBase$Statistics]: this new event has 93 ancestors and is cut-off event [2023-11-29 06:24:46,622 INFO L297 olderBase$Statistics]: existing Event has 65 ancestors and is cut-off event [2023-11-29 06:24:46,622 INFO L297 olderBase$Statistics]: existing Event has 99 ancestors and is cut-off event [2023-11-29 06:24:46,622 INFO L297 olderBase$Statistics]: existing Event has 71 ancestors and is cut-off event [2023-11-29 06:24:46,622 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([572] salethreadEXIT-->L750-7: Formula: (= v_salethreadThread1of3ForFork0_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem10#1_13| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) InVars {salethreadThread1of3ForFork0_thidvar0=v_salethreadThread1of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem10#1=|v_ULTIMATE.start_main_#t~mem10#1_13|} OutVars{salethreadThread1of3ForFork0_thidvar0=v_salethreadThread1of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem10#1=|v_ULTIMATE.start_main_#t~mem10#1_13|} AuxVars[] AssignedVars[][81], [salethreadThread3of3ForFork0NotInUse, 141#(= |#race~stopSales~0| 0), 39#L750-7true, 145#true, 16#L730true, 131#true, Black: 136#(= |ULTIMATE.start_main_~i~0#1| 0), salethreadThread1of3ForFork0NotInUse, salethreadThread2of3ForFork0InUse, Black: 139#true]) [2023-11-29 06:24:46,623 INFO L294 olderBase$Statistics]: this new event has 93 ancestors and is cut-off event [2023-11-29 06:24:46,623 INFO L297 olderBase$Statistics]: existing Event has 71 ancestors and is cut-off event [2023-11-29 06:24:46,623 INFO L297 olderBase$Statistics]: existing Event has 65 ancestors and is cut-off event [2023-11-29 06:24:46,623 INFO L297 olderBase$Statistics]: existing Event has 99 ancestors and is cut-off event [2023-11-29 06:24:46,644 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([517] L722-->L722-1: Formula: (= |v_#race~numberOfSeatsSold~0_1| 0) InVars {} OutVars{#race~numberOfSeatsSold~0=|v_#race~numberOfSeatsSold~0_1|} AuxVars[] AssignedVars[#race~numberOfSeatsSold~0][94], [salethreadThread3of3ForFork0NotInUse, 111#L722-1true, 147#(= |#race~numberOfSeatsSold~0| 0), 141#(= |#race~stopSales~0| 0), 63#L752-2true, 131#true, Black: 136#(= |ULTIMATE.start_main_~i~0#1| 0), 71#L730true, salethreadThread1of3ForFork0InUse, Black: 139#true, salethreadThread2of3ForFork0InUse]) [2023-11-29 06:24:46,644 INFO L294 olderBase$Statistics]: this new event has 88 ancestors and is cut-off event [2023-11-29 06:24:46,644 INFO L297 olderBase$Statistics]: existing Event has 60 ancestors and is cut-off event [2023-11-29 06:24:46,644 INFO L297 olderBase$Statistics]: existing Event has 60 ancestors and is cut-off event [2023-11-29 06:24:46,644 INFO L297 olderBase$Statistics]: existing Event has 60 ancestors and is cut-off event [2023-11-29 06:24:46,653 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([517] L722-->L722-1: Formula: (= |v_#race~numberOfSeatsSold~0_1| 0) InVars {} OutVars{#race~numberOfSeatsSold~0=|v_#race~numberOfSeatsSold~0_1|} AuxVars[] AssignedVars[#race~numberOfSeatsSold~0][94], [salethreadThread3of3ForFork0NotInUse, 111#L722-1true, 147#(= |#race~numberOfSeatsSold~0| 0), 141#(= |#race~stopSales~0| 0), 49#L722-1true, 131#true, 50#L752-1true, Black: 136#(= |ULTIMATE.start_main_~i~0#1| 0), salethreadThread1of3ForFork0InUse, Black: 139#true, salethreadThread2of3ForFork0InUse]) [2023-11-29 06:24:46,654 INFO L294 olderBase$Statistics]: this new event has 89 ancestors and is cut-off event [2023-11-29 06:24:46,654 INFO L297 olderBase$Statistics]: existing Event has 55 ancestors and is cut-off event [2023-11-29 06:24:46,654 INFO L297 olderBase$Statistics]: existing Event has 55 ancestors and is cut-off event [2023-11-29 06:24:46,654 INFO L297 olderBase$Statistics]: existing Event has 83 ancestors and is cut-off event [2023-11-29 06:24:46,683 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([573] salethreadEXIT-->L750-7: Formula: (= v_salethreadThread2of3ForFork0_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem10#1_15| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) InVars {salethreadThread2of3ForFork0_thidvar0=v_salethreadThread2of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem10#1=|v_ULTIMATE.start_main_#t~mem10#1_15|} OutVars{salethreadThread2of3ForFork0_thidvar0=v_salethreadThread2of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem10#1=|v_ULTIMATE.start_main_#t~mem10#1_15|} AuxVars[] AssignedVars[][121], [Black: 141#(= |#race~stopSales~0| 0), salethreadThread3of3ForFork0NotInUse, 139#true, 147#(= |#race~numberOfSeatsSold~0| 0), 39#L750-7true, 131#true, Black: 136#(= |ULTIMATE.start_main_~i~0#1| 0), 71#L730true, salethreadThread1of3ForFork0InUse, salethreadThread2of3ForFork0NotInUse]) [2023-11-29 06:24:46,683 INFO L294 olderBase$Statistics]: this new event has 99 ancestors and is cut-off event [2023-11-29 06:24:46,684 INFO L297 olderBase$Statistics]: existing Event has 71 ancestors and is cut-off event [2023-11-29 06:24:46,684 INFO L297 olderBase$Statistics]: existing Event has 65 ancestors and is cut-off event [2023-11-29 06:24:46,684 INFO L297 olderBase$Statistics]: existing Event has 93 ancestors and is cut-off event [2023-11-29 06:24:46,684 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([573] salethreadEXIT-->L750-7: Formula: (= v_salethreadThread2of3ForFork0_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem10#1_15| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) InVars {salethreadThread2of3ForFork0_thidvar0=v_salethreadThread2of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem10#1=|v_ULTIMATE.start_main_#t~mem10#1_15|} OutVars{salethreadThread2of3ForFork0_thidvar0=v_salethreadThread2of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem10#1=|v_ULTIMATE.start_main_#t~mem10#1_15|} AuxVars[] AssignedVars[][122], [salethreadThread3of3ForFork0NotInUse, 141#(= |#race~stopSales~0| 0), 39#L750-7true, 145#true, 131#true, Black: 136#(= |ULTIMATE.start_main_~i~0#1| 0), 71#L730true, salethreadThread1of3ForFork0InUse, salethreadThread2of3ForFork0NotInUse, Black: 139#true]) [2023-11-29 06:24:46,684 INFO L294 olderBase$Statistics]: this new event has 99 ancestors and is cut-off event [2023-11-29 06:24:46,684 INFO L297 olderBase$Statistics]: existing Event has 65 ancestors and is cut-off event [2023-11-29 06:24:46,684 INFO L297 olderBase$Statistics]: existing Event has 71 ancestors and is cut-off event [2023-11-29 06:24:46,684 INFO L297 olderBase$Statistics]: existing Event has 93 ancestors and is cut-off event [2023-11-29 06:24:46,690 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([517] L722-->L722-1: Formula: (= |v_#race~numberOfSeatsSold~0_1| 0) InVars {} OutVars{#race~numberOfSeatsSold~0=|v_#race~numberOfSeatsSold~0_1|} AuxVars[] AssignedVars[#race~numberOfSeatsSold~0][94], [salethreadThread3of3ForFork0NotInUse, 111#L722-1true, 147#(= |#race~numberOfSeatsSold~0| 0), 141#(= |#race~stopSales~0| 0), 131#true, Black: 136#(= |ULTIMATE.start_main_~i~0#1| 0), 50#L752-1true, salethreadThread1of3ForFork0InUse, 94#L722-2true, salethreadThread2of3ForFork0InUse, Black: 139#true]) [2023-11-29 06:24:46,690 INFO L294 olderBase$Statistics]: this new event has 90 ancestors and is cut-off event [2023-11-29 06:24:46,690 INFO L297 olderBase$Statistics]: existing Event has 56 ancestors and is cut-off event [2023-11-29 06:24:46,690 INFO L297 olderBase$Statistics]: existing Event has 84 ancestors and is cut-off event [2023-11-29 06:24:46,690 INFO L297 olderBase$Statistics]: existing Event has 56 ancestors and is cut-off event [2023-11-29 06:24:46,690 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([564] L724-->L730: Formula: (= v_~stopSales~0_20 1) InVars {} OutVars{~stopSales~0=v_~stopSales~0_20, salethreadThread1of3ForFork0_#t~nondet1=|v_salethreadThread1of3ForFork0_#t~nondet1_3|, #race~stopSales~0=|v_#race~stopSales~0_24|} AuxVars[] AssignedVars[~stopSales~0, #race~stopSales~0, salethreadThread1of3ForFork0_#t~nondet1][47], [salethreadThread3of3ForFork0NotInUse, Black: 141#(= |#race~stopSales~0| 0), 139#true, 147#(= |#race~numberOfSeatsSold~0| 0), 131#true, Black: 136#(= |ULTIMATE.start_main_~i~0#1| 0), 50#L752-1true, 108#L721-2true, 71#L730true, salethreadThread1of3ForFork0InUse, salethreadThread2of3ForFork0InUse]) [2023-11-29 06:24:46,690 INFO L294 olderBase$Statistics]: this new event has 91 ancestors and is cut-off event [2023-11-29 06:24:46,690 INFO L297 olderBase$Statistics]: existing Event has 85 ancestors and is cut-off event [2023-11-29 06:24:46,690 INFO L297 olderBase$Statistics]: existing Event has 57 ancestors and is cut-off event [2023-11-29 06:24:46,690 INFO L297 olderBase$Statistics]: existing Event has 57 ancestors and is cut-off event [2023-11-29 06:24:46,696 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([517] L722-->L722-1: Formula: (= |v_#race~numberOfSeatsSold~0_1| 0) InVars {} OutVars{#race~numberOfSeatsSold~0=|v_#race~numberOfSeatsSold~0_1|} AuxVars[] AssignedVars[#race~numberOfSeatsSold~0][94], [salethreadThread3of3ForFork0NotInUse, 111#L722-1true, 147#(= |#race~numberOfSeatsSold~0| 0), 141#(= |#race~stopSales~0| 0), 49#L722-1true, 63#L752-2true, 131#true, Black: 136#(= |ULTIMATE.start_main_~i~0#1| 0), salethreadThread1of3ForFork0InUse, Black: 139#true, salethreadThread2of3ForFork0InUse]) [2023-11-29 06:24:46,696 INFO L294 olderBase$Statistics]: this new event has 90 ancestors and is cut-off event [2023-11-29 06:24:46,696 INFO L297 olderBase$Statistics]: existing Event has 84 ancestors and is cut-off event [2023-11-29 06:24:46,696 INFO L297 olderBase$Statistics]: existing Event has 56 ancestors and is cut-off event [2023-11-29 06:24:46,696 INFO L297 olderBase$Statistics]: existing Event has 56 ancestors and is cut-off event [2023-11-29 06:24:46,730 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([517] L722-->L722-1: Formula: (= |v_#race~numberOfSeatsSold~0_1| 0) InVars {} OutVars{#race~numberOfSeatsSold~0=|v_#race~numberOfSeatsSold~0_1|} AuxVars[] AssignedVars[#race~numberOfSeatsSold~0][94], [salethreadThread3of3ForFork0NotInUse, 111#L722-1true, 147#(= |#race~numberOfSeatsSold~0| 0), 141#(= |#race~stopSales~0| 0), 63#L752-2true, 131#true, Black: 136#(= |ULTIMATE.start_main_~i~0#1| 0), salethreadThread1of3ForFork0InUse, 94#L722-2true, salethreadThread2of3ForFork0InUse, Black: 139#true]) [2023-11-29 06:24:46,731 INFO L294 olderBase$Statistics]: this new event has 91 ancestors and is cut-off event [2023-11-29 06:24:46,731 INFO L297 olderBase$Statistics]: existing Event has 57 ancestors and is cut-off event [2023-11-29 06:24:46,731 INFO L297 olderBase$Statistics]: existing Event has 85 ancestors and is cut-off event [2023-11-29 06:24:46,731 INFO L297 olderBase$Statistics]: existing Event has 57 ancestors and is cut-off event [2023-11-29 06:24:46,731 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([564] L724-->L730: Formula: (= v_~stopSales~0_20 1) InVars {} OutVars{~stopSales~0=v_~stopSales~0_20, salethreadThread1of3ForFork0_#t~nondet1=|v_salethreadThread1of3ForFork0_#t~nondet1_3|, #race~stopSales~0=|v_#race~stopSales~0_24|} AuxVars[] AssignedVars[~stopSales~0, #race~stopSales~0, salethreadThread1of3ForFork0_#t~nondet1][47], [Black: 141#(= |#race~stopSales~0| 0), salethreadThread3of3ForFork0NotInUse, 139#true, 147#(= |#race~numberOfSeatsSold~0| 0), 63#L752-2true, 131#true, Black: 136#(= |ULTIMATE.start_main_~i~0#1| 0), 71#L730true, 108#L721-2true, salethreadThread1of3ForFork0InUse, salethreadThread2of3ForFork0InUse]) [2023-11-29 06:24:46,731 INFO L294 olderBase$Statistics]: this new event has 92 ancestors and is cut-off event [2023-11-29 06:24:46,731 INFO L297 olderBase$Statistics]: existing Event has 86 ancestors and is cut-off event [2023-11-29 06:24:46,731 INFO L297 olderBase$Statistics]: existing Event has 58 ancestors and is cut-off event [2023-11-29 06:24:46,731 INFO L297 olderBase$Statistics]: existing Event has 58 ancestors and is cut-off event [2023-11-29 06:24:46,757 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([572] salethreadEXIT-->L750-7: Formula: (= v_salethreadThread1of3ForFork0_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem10#1_13| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) InVars {salethreadThread1of3ForFork0_thidvar0=v_salethreadThread1of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem10#1=|v_ULTIMATE.start_main_#t~mem10#1_13|} OutVars{salethreadThread1of3ForFork0_thidvar0=v_salethreadThread1of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem10#1=|v_ULTIMATE.start_main_#t~mem10#1_13|} AuxVars[] AssignedVars[][80], [salethreadThread3of3ForFork0NotInUse, 111#L722-1true, 147#(= |#race~numberOfSeatsSold~0| 0), 141#(= |#race~stopSales~0| 0), 39#L750-7true, 131#true, Black: 136#(= |ULTIMATE.start_main_~i~0#1| 0), salethreadThread1of3ForFork0NotInUse, Black: 139#true, salethreadThread2of3ForFork0InUse]) [2023-11-29 06:24:46,757 INFO L294 olderBase$Statistics]: this new event has 95 ancestors and is cut-off event [2023-11-29 06:24:46,757 INFO L297 olderBase$Statistics]: existing Event has 61 ancestors and is cut-off event [2023-11-29 06:24:46,757 INFO L297 olderBase$Statistics]: existing Event has 95 ancestors and is cut-off event [2023-11-29 06:24:46,757 INFO L297 olderBase$Statistics]: existing Event has 67 ancestors and is cut-off event [2023-11-29 06:24:46,757 INFO L297 olderBase$Statistics]: existing Event has 89 ancestors and is cut-off event [2023-11-29 06:24:46,797 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([572] salethreadEXIT-->L750-7: Formula: (= v_salethreadThread1of3ForFork0_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem10#1_13| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) InVars {salethreadThread1of3ForFork0_thidvar0=v_salethreadThread1of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem10#1=|v_ULTIMATE.start_main_#t~mem10#1_13|} OutVars{salethreadThread1of3ForFork0_thidvar0=v_salethreadThread1of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem10#1=|v_ULTIMATE.start_main_#t~mem10#1_13|} AuxVars[] AssignedVars[][80], [salethreadThread3of3ForFork0NotInUse, 147#(= |#race~numberOfSeatsSold~0| 0), 141#(= |#race~stopSales~0| 0), 39#L750-7true, 107#L722-2true, 131#true, Black: 136#(= |ULTIMATE.start_main_~i~0#1| 0), salethreadThread1of3ForFork0NotInUse, Black: 139#true, salethreadThread2of3ForFork0InUse]) [2023-11-29 06:24:46,797 INFO L294 olderBase$Statistics]: this new event has 96 ancestors and is cut-off event [2023-11-29 06:24:46,797 INFO L297 olderBase$Statistics]: existing Event has 62 ancestors and is cut-off event [2023-11-29 06:24:46,797 INFO L297 olderBase$Statistics]: existing Event has 96 ancestors and is cut-off event [2023-11-29 06:24:46,797 INFO L297 olderBase$Statistics]: existing Event has 90 ancestors and is cut-off event [2023-11-29 06:24:46,797 INFO L297 olderBase$Statistics]: existing Event has 68 ancestors and is cut-off event [2023-11-29 06:24:46,814 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([517] L722-->L722-1: Formula: (= |v_#race~numberOfSeatsSold~0_1| 0) InVars {} OutVars{#race~numberOfSeatsSold~0=|v_#race~numberOfSeatsSold~0_1|} AuxVars[] AssignedVars[#race~numberOfSeatsSold~0][73], [salethreadThread3of3ForFork0NotInUse, 111#L722-1true, 147#(= |#race~numberOfSeatsSold~0| 0), 141#(= |#race~stopSales~0| 0), 131#true, Black: 136#(= |ULTIMATE.start_main_~i~0#1| 0), 50#L752-1true, 71#L730true, salethreadThread1of3ForFork0InUse, salethreadThread2of3ForFork0InUse, Black: 139#true]) [2023-11-29 06:24:46,814 INFO L294 olderBase$Statistics]: this new event has 93 ancestors and is cut-off event [2023-11-29 06:24:46,814 INFO L297 olderBase$Statistics]: existing Event has 59 ancestors and is cut-off event [2023-11-29 06:24:46,814 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is cut-off event [2023-11-29 06:24:46,814 INFO L297 olderBase$Statistics]: existing Event has 59 ancestors and is cut-off event [2023-11-29 06:24:46,881 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([517] L722-->L722-1: Formula: (= |v_#race~numberOfSeatsSold~0_1| 0) InVars {} OutVars{#race~numberOfSeatsSold~0=|v_#race~numberOfSeatsSold~0_1|} AuxVars[] AssignedVars[#race~numberOfSeatsSold~0][73], [salethreadThread3of3ForFork0NotInUse, 111#L722-1true, 147#(= |#race~numberOfSeatsSold~0| 0), 141#(= |#race~stopSales~0| 0), 63#L752-2true, 131#true, Black: 136#(= |ULTIMATE.start_main_~i~0#1| 0), 71#L730true, salethreadThread1of3ForFork0InUse, salethreadThread2of3ForFork0InUse, Black: 139#true]) [2023-11-29 06:24:46,882 INFO L294 olderBase$Statistics]: this new event has 94 ancestors and is cut-off event [2023-11-29 06:24:46,882 INFO L297 olderBase$Statistics]: existing Event has 60 ancestors and is cut-off event [2023-11-29 06:24:46,882 INFO L297 olderBase$Statistics]: existing Event has 88 ancestors and is cut-off event [2023-11-29 06:24:46,882 INFO L297 olderBase$Statistics]: existing Event has 60 ancestors and is cut-off event [2023-11-29 06:24:46,884 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([517] L722-->L722-1: Formula: (= |v_#race~numberOfSeatsSold~0_1| 0) InVars {} OutVars{#race~numberOfSeatsSold~0=|v_#race~numberOfSeatsSold~0_1|} AuxVars[] AssignedVars[#race~numberOfSeatsSold~0][73], [salethreadThread3of3ForFork0NotInUse, 111#L722-1true, 147#(= |#race~numberOfSeatsSold~0| 0), 141#(= |#race~stopSales~0| 0), 28#ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACEtrue, 131#true, Black: 136#(= |ULTIMATE.start_main_~i~0#1| 0), 71#L730true, salethreadThread1of3ForFork0InUse, salethreadThread2of3ForFork0InUse, Black: 139#true]) [2023-11-29 06:24:46,884 INFO L294 olderBase$Statistics]: this new event has 94 ancestors and is cut-off event [2023-11-29 06:24:46,884 INFO L297 olderBase$Statistics]: existing Event has 60 ancestors and is cut-off event [2023-11-29 06:24:46,884 INFO L297 olderBase$Statistics]: existing Event has 88 ancestors and is cut-off event [2023-11-29 06:24:46,884 INFO L297 olderBase$Statistics]: existing Event has 60 ancestors and is cut-off event [2023-11-29 06:24:46,888 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([573] salethreadEXIT-->L750-7: Formula: (= v_salethreadThread2of3ForFork0_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem10#1_15| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) InVars {salethreadThread2of3ForFork0_thidvar0=v_salethreadThread2of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem10#1=|v_ULTIMATE.start_main_#t~mem10#1_15|} OutVars{salethreadThread2of3ForFork0_thidvar0=v_salethreadThread2of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem10#1=|v_ULTIMATE.start_main_#t~mem10#1_15|} AuxVars[] AssignedVars[][122], [salethreadThread3of3ForFork0NotInUse, 141#(= |#race~stopSales~0| 0), 39#L750-7true, 145#true, 131#true, Black: 136#(= |ULTIMATE.start_main_~i~0#1| 0), 71#L730true, salethreadThread1of3ForFork0InUse, salethreadThread2of3ForFork0NotInUse, Black: 139#true]) [2023-11-29 06:24:46,888 INFO L294 olderBase$Statistics]: this new event has 99 ancestors and is cut-off event [2023-11-29 06:24:46,888 INFO L297 olderBase$Statistics]: existing Event has 65 ancestors and is cut-off event [2023-11-29 06:24:46,888 INFO L297 olderBase$Statistics]: existing Event has 71 ancestors and is cut-off event [2023-11-29 06:24:46,889 INFO L297 olderBase$Statistics]: existing Event has 93 ancestors and is cut-off event [2023-11-29 06:24:46,889 INFO L297 olderBase$Statistics]: existing Event has 99 ancestors and is cut-off event [2023-11-29 06:24:46,892 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([573] salethreadEXIT-->L750-7: Formula: (= v_salethreadThread2of3ForFork0_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem10#1_15| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) InVars {salethreadThread2of3ForFork0_thidvar0=v_salethreadThread2of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem10#1=|v_ULTIMATE.start_main_#t~mem10#1_15|} OutVars{salethreadThread2of3ForFork0_thidvar0=v_salethreadThread2of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem10#1=|v_ULTIMATE.start_main_#t~mem10#1_15|} AuxVars[] AssignedVars[][121], [salethreadThread3of3ForFork0NotInUse, 147#(= |#race~numberOfSeatsSold~0| 0), 141#(= |#race~stopSales~0| 0), 49#L722-1true, 39#L750-7true, 131#true, Black: 136#(= |ULTIMATE.start_main_~i~0#1| 0), salethreadThread1of3ForFork0InUse, salethreadThread2of3ForFork0NotInUse, Black: 139#true]) [2023-11-29 06:24:46,893 INFO L294 olderBase$Statistics]: this new event has 95 ancestors and is cut-off event [2023-11-29 06:24:46,893 INFO L297 olderBase$Statistics]: existing Event has 95 ancestors and is cut-off event [2023-11-29 06:24:46,893 INFO L297 olderBase$Statistics]: existing Event has 89 ancestors and is cut-off event [2023-11-29 06:24:46,893 INFO L297 olderBase$Statistics]: existing Event has 61 ancestors and is cut-off event [2023-11-29 06:24:46,900 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([574] salethreadEXIT-->L750-7: Formula: (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem10#1_17| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0))) v_salethreadThread3of3ForFork0_thidvar0_4) InVars {salethreadThread3of3ForFork0_thidvar0=v_salethreadThread3of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem10#1=|v_ULTIMATE.start_main_#t~mem10#1_17|} OutVars{salethreadThread3of3ForFork0_thidvar0=v_salethreadThread3of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem10#1=|v_ULTIMATE.start_main_#t~mem10#1_17|} AuxVars[] AssignedVars[][142], [salethreadThread3of3ForFork0NotInUse, 111#L722-1true, 147#(= |#race~numberOfSeatsSold~0| 0), 141#(= |#race~stopSales~0| 0), 39#L750-7true, 131#true, Black: 136#(= |ULTIMATE.start_main_~i~0#1| 0), salethreadThread1of3ForFork0NotInUse, Black: 139#true, salethreadThread2of3ForFork0InUse]) [2023-11-29 06:24:46,900 INFO L294 olderBase$Statistics]: this new event has 95 ancestors and is cut-off event [2023-11-29 06:24:46,901 INFO L297 olderBase$Statistics]: existing Event has 89 ancestors and is cut-off event [2023-11-29 06:24:46,901 INFO L297 olderBase$Statistics]: existing Event has 89 ancestors and is cut-off event [2023-11-29 06:24:46,901 INFO L297 olderBase$Statistics]: existing Event has 95 ancestors and is cut-off event [2023-11-29 06:24:46,912 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([574] salethreadEXIT-->L750-7: Formula: (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem10#1_17| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0))) v_salethreadThread3of3ForFork0_thidvar0_4) InVars {salethreadThread3of3ForFork0_thidvar0=v_salethreadThread3of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem10#1=|v_ULTIMATE.start_main_#t~mem10#1_17|} OutVars{salethreadThread3of3ForFork0_thidvar0=v_salethreadThread3of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem10#1=|v_ULTIMATE.start_main_#t~mem10#1_17|} AuxVars[] AssignedVars[][143], [salethreadThread3of3ForFork0NotInUse, 141#(= |#race~stopSales~0| 0), 39#L750-7true, 145#true, 16#L730true, 131#true, Black: 136#(= |ULTIMATE.start_main_~i~0#1| 0), salethreadThread1of3ForFork0NotInUse, Black: 139#true, salethreadThread2of3ForFork0InUse]) [2023-11-29 06:24:46,912 INFO L294 olderBase$Statistics]: this new event has 99 ancestors and is cut-off event [2023-11-29 06:24:46,913 INFO L297 olderBase$Statistics]: existing Event has 93 ancestors and is cut-off event [2023-11-29 06:24:46,913 INFO L297 olderBase$Statistics]: existing Event has 99 ancestors and is cut-off event [2023-11-29 06:24:46,913 INFO L297 olderBase$Statistics]: existing Event has 93 ancestors and is cut-off event [2023-11-29 06:24:46,923 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([573] salethreadEXIT-->L750-7: Formula: (= v_salethreadThread2of3ForFork0_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem10#1_15| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) InVars {salethreadThread2of3ForFork0_thidvar0=v_salethreadThread2of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem10#1=|v_ULTIMATE.start_main_#t~mem10#1_15|} OutVars{salethreadThread2of3ForFork0_thidvar0=v_salethreadThread2of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem10#1=|v_ULTIMATE.start_main_#t~mem10#1_15|} AuxVars[] AssignedVars[][121], [salethreadThread3of3ForFork0NotInUse, 147#(= |#race~numberOfSeatsSold~0| 0), 141#(= |#race~stopSales~0| 0), 39#L750-7true, 131#true, Black: 136#(= |ULTIMATE.start_main_~i~0#1| 0), salethreadThread1of3ForFork0InUse, salethreadThread2of3ForFork0NotInUse, Black: 139#true, 94#L722-2true]) [2023-11-29 06:24:46,923 INFO L294 olderBase$Statistics]: this new event has 96 ancestors and is cut-off event [2023-11-29 06:24:46,923 INFO L297 olderBase$Statistics]: existing Event has 96 ancestors and is cut-off event [2023-11-29 06:24:46,923 INFO L297 olderBase$Statistics]: existing Event has 62 ancestors and is cut-off event [2023-11-29 06:24:46,923 INFO L297 olderBase$Statistics]: existing Event has 90 ancestors and is cut-off event [2023-11-29 06:24:46,933 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([574] salethreadEXIT-->L750-7: Formula: (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem10#1_17| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0))) v_salethreadThread3of3ForFork0_thidvar0_4) InVars {salethreadThread3of3ForFork0_thidvar0=v_salethreadThread3of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem10#1=|v_ULTIMATE.start_main_#t~mem10#1_17|} OutVars{salethreadThread3of3ForFork0_thidvar0=v_salethreadThread3of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem10#1=|v_ULTIMATE.start_main_#t~mem10#1_17|} AuxVars[] AssignedVars[][142], [salethreadThread3of3ForFork0NotInUse, 147#(= |#race~numberOfSeatsSold~0| 0), 141#(= |#race~stopSales~0| 0), 39#L750-7true, 107#L722-2true, 131#true, Black: 136#(= |ULTIMATE.start_main_~i~0#1| 0), salethreadThread1of3ForFork0NotInUse, Black: 139#true, salethreadThread2of3ForFork0InUse]) [2023-11-29 06:24:46,933 INFO L294 olderBase$Statistics]: this new event has 96 ancestors and is cut-off event [2023-11-29 06:24:46,933 INFO L297 olderBase$Statistics]: existing Event has 90 ancestors and is cut-off event [2023-11-29 06:24:46,933 INFO L297 olderBase$Statistics]: existing Event has 90 ancestors and is cut-off event [2023-11-29 06:24:46,933 INFO L297 olderBase$Statistics]: existing Event has 96 ancestors and is cut-off event [2023-11-29 06:24:47,079 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([573] salethreadEXIT-->L750-7: Formula: (= v_salethreadThread2of3ForFork0_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem10#1_15| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) InVars {salethreadThread2of3ForFork0_thidvar0=v_salethreadThread2of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem10#1=|v_ULTIMATE.start_main_#t~mem10#1_15|} OutVars{salethreadThread2of3ForFork0_thidvar0=v_salethreadThread2of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem10#1=|v_ULTIMATE.start_main_#t~mem10#1_15|} AuxVars[] AssignedVars[][122], [salethreadThread3of3ForFork0NotInUse, 141#(= |#race~stopSales~0| 0), 39#L750-7true, 145#true, 131#true, Black: 136#(= |ULTIMATE.start_main_~i~0#1| 0), salethreadThread1of3ForFork0NotInUse, salethreadThread2of3ForFork0NotInUse, Black: 139#true]) [2023-11-29 06:24:47,079 INFO L294 olderBase$Statistics]: this new event has 114 ancestors and is cut-off event [2023-11-29 06:24:47,079 INFO L297 olderBase$Statistics]: existing Event has 80 ancestors and is cut-off event [2023-11-29 06:24:47,080 INFO L297 olderBase$Statistics]: existing Event has 74 ancestors and is cut-off event [2023-11-29 06:24:47,080 INFO L297 olderBase$Statistics]: existing Event has 102 ancestors and is cut-off event [2023-11-29 06:24:47,089 INFO L124 PetriNetUnfolderBase]: 4754/19531 cut-off events. [2023-11-29 06:24:47,089 INFO L125 PetriNetUnfolderBase]: For 6179/14413 co-relation queries the response was YES. [2023-11-29 06:24:47,177 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30730 conditions, 19531 events. 4754/19531 cut-off events. For 6179/14413 co-relation queries the response was YES. Maximal size of possible extension queue 921. Compared 255010 event pairs, 1453 based on Foata normal form. 28/16746 useless extension candidates. Maximal degree in co-relation 30721. Up to 5204 conditions per place. [2023-11-29 06:24:47,241 INFO L140 encePairwiseOnDemand]: 119/134 looper letters, 41 selfloop transitions, 11 changer transitions 0/150 dead transitions. [2023-11-29 06:24:47,241 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 125 places, 150 transitions, 538 flow [2023-11-29 06:24:47,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 06:24:47,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 06:24:47,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 329 transitions. [2023-11-29 06:24:47,243 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.818407960199005 [2023-11-29 06:24:47,243 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 329 transitions. [2023-11-29 06:24:47,244 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 329 transitions. [2023-11-29 06:24:47,244 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 06:24:47,244 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 329 transitions. [2023-11-29 06:24:47,245 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 109.66666666666667) internal successors, (329), 3 states have internal predecessors, (329), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:24:47,246 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 134.0) internal successors, (536), 4 states have internal predecessors, (536), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:24:47,247 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 134.0) internal successors, (536), 4 states have internal predecessors, (536), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:24:47,247 INFO L175 Difference]: Start difference. First operand has 123 places, 128 transitions, 351 flow. Second operand 3 states and 329 transitions. [2023-11-29 06:24:47,247 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 125 places, 150 transitions, 538 flow [2023-11-29 06:24:47,256 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 123 places, 150 transitions, 514 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 06:24:47,258 INFO L231 Difference]: Finished difference. Result has 125 places, 139 transitions, 429 flow [2023-11-29 06:24:47,259 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=134, PETRI_DIFFERENCE_MINUEND_FLOW=333, PETRI_DIFFERENCE_MINUEND_PLACES=121, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=128, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=117, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=429, PETRI_PLACES=125, PETRI_TRANSITIONS=139} [2023-11-29 06:24:47,259 INFO L281 CegarLoopForPetriNet]: 128 programPoint places, -3 predicate places. [2023-11-29 06:24:47,260 INFO L495 AbstractCegarLoop]: Abstraction has has 125 places, 139 transitions, 429 flow [2023-11-29 06:24:47,260 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 95.0) internal successors, (285), 3 states have internal predecessors, (285), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:24:47,260 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 06:24:47,260 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] [2023-11-29 06:24:47,260 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-11-29 06:24:47,260 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [salethreadErr0ASSERT_VIOLATIONDATA_RACE, salethreadErr1ASSERT_VIOLATIONDATA_RACE, salethreadErr2ASSERT_VIOLATIONDATA_RACE (and 19 more)] === [2023-11-29 06:24:47,261 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:24:47,261 INFO L85 PathProgramCache]: Analyzing trace with hash 1810559632, now seen corresponding path program 1 times [2023-11-29 06:24:47,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:24:47,261 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [4135871] [2023-11-29 06:24:47,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:24:47,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:24:47,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:24:47,330 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 06:24:47,330 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 06:24:47,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [4135871] [2023-11-29 06:24:47,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [4135871] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 06:24:47,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [465128291] [2023-11-29 06:24:47,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:24:47,331 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 06:24:47,331 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_134da552-ab6a-4313-9d17-0e65a57f8ff7/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 06:24:47,332 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_134da552-ab6a-4313-9d17-0e65a57f8ff7/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 06:24:47,334 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_134da552-ab6a-4313-9d17-0e65a57f8ff7/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-29 06:24:47,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:24:47,415 INFO L262 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-29 06:24:47,417 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 06:24:47,451 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 06:24:47,452 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 06:24:47,495 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 06:24:47,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [465128291] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 06:24:47,496 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 06:24:47,496 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2023-11-29 06:24:47,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1637470913] [2023-11-29 06:24:47,496 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 06:24:47,497 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-29 06:24:47,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 06:24:47,498 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-29 06:24:47,498 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2023-11-29 06:24:47,519 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 134 [2023-11-29 06:24:47,520 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 125 places, 139 transitions, 429 flow. Second operand has 10 states, 10 states have (on average 98.4) internal successors, (984), 10 states have internal predecessors, (984), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:24:47,521 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 06:24:47,521 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 134 [2023-11-29 06:24:47,521 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 06:24:50,475 INFO L124 PetriNetUnfolderBase]: 6843/29541 cut-off events. [2023-11-29 06:24:50,475 INFO L125 PetriNetUnfolderBase]: For 11830/14504 co-relation queries the response was YES. [2023-11-29 06:24:50,567 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50263 conditions, 29541 events. 6843/29541 cut-off events. For 11830/14504 co-relation queries the response was YES. Maximal size of possible extension queue 959. Compared 413558 event pairs, 1394 based on Foata normal form. 159/25410 useless extension candidates. Maximal degree in co-relation 50253. Up to 5597 conditions per place. [2023-11-29 06:24:50,664 INFO L140 encePairwiseOnDemand]: 128/134 looper letters, 72 selfloop transitions, 9 changer transitions 0/189 dead transitions. [2023-11-29 06:24:50,665 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 133 places, 189 transitions, 801 flow [2023-11-29 06:24:50,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-29 06:24:50,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-11-29 06:24:50,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 923 transitions. [2023-11-29 06:24:50,668 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7653399668325042 [2023-11-29 06:24:50,668 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 923 transitions. [2023-11-29 06:24:50,668 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 923 transitions. [2023-11-29 06:24:50,669 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 06:24:50,669 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 923 transitions. [2023-11-29 06:24:50,672 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 102.55555555555556) internal successors, (923), 9 states have internal predecessors, (923), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:24:50,675 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 134.0) internal successors, (1340), 10 states have internal predecessors, (1340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:24:50,675 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 134.0) internal successors, (1340), 10 states have internal predecessors, (1340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:24:50,675 INFO L175 Difference]: Start difference. First operand has 125 places, 139 transitions, 429 flow. Second operand 9 states and 923 transitions. [2023-11-29 06:24:50,675 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 133 places, 189 transitions, 801 flow [2023-11-29 06:24:50,748 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 131 places, 189 transitions, 755 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 06:24:50,750 INFO L231 Difference]: Finished difference. Result has 134 places, 145 transitions, 457 flow [2023-11-29 06:24:50,751 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=134, PETRI_DIFFERENCE_MINUEND_FLOW=407, PETRI_DIFFERENCE_MINUEND_PLACES=123, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=139, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=133, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=457, PETRI_PLACES=134, PETRI_TRANSITIONS=145} [2023-11-29 06:24:50,751 INFO L281 CegarLoopForPetriNet]: 128 programPoint places, 6 predicate places. [2023-11-29 06:24:50,751 INFO L495 AbstractCegarLoop]: Abstraction has has 134 places, 145 transitions, 457 flow [2023-11-29 06:24:50,752 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 98.4) internal successors, (984), 10 states have internal predecessors, (984), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:24:50,752 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 06:24:50,752 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 06:24:50,757 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_134da552-ab6a-4313-9d17-0e65a57f8ff7/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-11-29 06:24:50,952 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_134da552-ab6a-4313-9d17-0e65a57f8ff7/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2023-11-29 06:24:50,953 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting salethreadErr0ASSERT_VIOLATIONDATA_RACE === [salethreadErr0ASSERT_VIOLATIONDATA_RACE, salethreadErr1ASSERT_VIOLATIONDATA_RACE, salethreadErr2ASSERT_VIOLATIONDATA_RACE (and 19 more)] === [2023-11-29 06:24:50,953 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:24:50,954 INFO L85 PathProgramCache]: Analyzing trace with hash 1744744612, now seen corresponding path program 1 times [2023-11-29 06:24:50,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:24:50,954 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [966031074] [2023-11-29 06:24:50,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:24:50,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:24:50,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:24:51,040 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-11-29 06:24:51,041 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 06:24:51,041 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [966031074] [2023-11-29 06:24:51,041 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [966031074] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:24:51,041 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:24:51,041 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 06:24:51,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [718526466] [2023-11-29 06:24:51,042 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:24:51,042 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 06:24:51,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 06:24:51,043 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 06:24:51,043 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 06:24:51,053 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 134 [2023-11-29 06:24:51,054 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 134 places, 145 transitions, 457 flow. Second operand has 4 states, 4 states have (on average 103.25) internal successors, (413), 4 states have internal predecessors, (413), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:24:51,054 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 06:24:51,054 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 134 [2023-11-29 06:24:51,055 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 06:24:53,662 INFO L124 PetriNetUnfolderBase]: 5075/27838 cut-off events. [2023-11-29 06:24:53,662 INFO L125 PetriNetUnfolderBase]: For 5599/9439 co-relation queries the response was YES. [2023-11-29 06:24:53,747 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41170 conditions, 27838 events. 5075/27838 cut-off events. For 5599/9439 co-relation queries the response was YES. Maximal size of possible extension queue 1145. Compared 412368 event pairs, 1263 based on Foata normal form. 290/24503 useless extension candidates. Maximal degree in co-relation 41158. Up to 4173 conditions per place. [2023-11-29 06:24:53,830 INFO L140 encePairwiseOnDemand]: 127/134 looper letters, 55 selfloop transitions, 8 changer transitions 0/183 dead transitions. [2023-11-29 06:24:53,830 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 138 places, 183 transitions, 762 flow [2023-11-29 06:24:53,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 06:24:53,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-29 06:24:53,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 555 transitions. [2023-11-29 06:24:53,833 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8283582089552238 [2023-11-29 06:24:53,833 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 555 transitions. [2023-11-29 06:24:53,833 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 555 transitions. [2023-11-29 06:24:53,833 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 06:24:53,833 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 555 transitions. [2023-11-29 06:24:53,834 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 111.0) internal successors, (555), 5 states have internal predecessors, (555), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:24:53,836 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 134.0) internal successors, (804), 6 states have internal predecessors, (804), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:24:53,836 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 134.0) internal successors, (804), 6 states have internal predecessors, (804), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:24:53,836 INFO L175 Difference]: Start difference. First operand has 134 places, 145 transitions, 457 flow. Second operand 5 states and 555 transitions. [2023-11-29 06:24:53,836 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 138 places, 183 transitions, 762 flow [2023-11-29 06:24:53,839 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 137 places, 183 transitions, 756 flow, removed 2 selfloop flow, removed 1 redundant places. [2023-11-29 06:24:53,842 INFO L231 Difference]: Finished difference. Result has 140 places, 152 transitions, 521 flow [2023-11-29 06:24:53,842 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=134, PETRI_DIFFERENCE_MINUEND_FLOW=451, PETRI_DIFFERENCE_MINUEND_PLACES=133, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=145, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=139, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=521, PETRI_PLACES=140, PETRI_TRANSITIONS=152} [2023-11-29 06:24:53,843 INFO L281 CegarLoopForPetriNet]: 128 programPoint places, 12 predicate places. [2023-11-29 06:24:53,843 INFO L495 AbstractCegarLoop]: Abstraction has has 140 places, 152 transitions, 521 flow [2023-11-29 06:24:53,843 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 103.25) internal successors, (413), 4 states have internal predecessors, (413), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:24:53,843 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 06:24:53,844 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 06:24:53,844 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-11-29 06:24:53,844 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting salethreadErr0ASSERT_VIOLATIONDATA_RACE === [salethreadErr0ASSERT_VIOLATIONDATA_RACE, salethreadErr1ASSERT_VIOLATIONDATA_RACE, salethreadErr2ASSERT_VIOLATIONDATA_RACE (and 19 more)] === [2023-11-29 06:24:53,844 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:24:53,844 INFO L85 PathProgramCache]: Analyzing trace with hash -547111440, now seen corresponding path program 1 times [2023-11-29 06:24:53,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:24:53,845 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [556091801] [2023-11-29 06:24:53,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:24:53,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:24:53,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:24:53,920 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-11-29 06:24:53,920 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 06:24:53,921 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [556091801] [2023-11-29 06:24:53,921 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [556091801] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:24:53,921 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:24:53,921 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 06:24:53,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1202055021] [2023-11-29 06:24:53,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:24:53,922 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 06:24:53,922 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 06:24:53,922 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 06:24:53,923 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 06:24:53,934 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 134 [2023-11-29 06:24:53,935 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 140 places, 152 transitions, 521 flow. Second operand has 4 states, 4 states have (on average 103.25) internal successors, (413), 4 states have internal predecessors, (413), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:24:53,935 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 06:24:53,935 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 134 [2023-11-29 06:24:53,935 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 06:24:56,244 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([572] salethreadEXIT-->L750-7: Formula: (= v_salethreadThread1of3ForFork0_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem10#1_13| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) InVars {salethreadThread1of3ForFork0_thidvar0=v_salethreadThread1of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem10#1=|v_ULTIMATE.start_main_#t~mem10#1_13|} OutVars{salethreadThread1of3ForFork0_thidvar0=v_salethreadThread1of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem10#1=|v_ULTIMATE.start_main_#t~mem10#1_13|} AuxVars[] AssignedVars[][177], [salethreadThread3of3ForFork0NotInUse, 16#L730true, 131#true, Black: 136#(= |ULTIMATE.start_main_~i~0#1| 0), 151#true, Black: 302#(< |ULTIMATE.start_main_~i~0#1| 20), Black: 139#true, Black: 155#(<= |ULTIMATE.start_main_~i~0#1| 1), 414#(= salethreadThread2of3ForFork0_~_numberOfSeatsSold~0 0), Black: 147#(= |#race~numberOfSeatsSold~0| 0), 39#L750-7true, Black: 406#(and (= salethreadThread1of3ForFork0_~_numberOfSeatsSold~0 0) (= ~numberOfSeatsSold~0 0)), Black: 404#(= salethreadThread1of3ForFork0_~_numberOfSeatsSold~0 0), Black: 403#(= ~numberOfSeatsSold~0 0), salethreadThread1of3ForFork0NotInUse, 401#true, salethreadThread2of3ForFork0InUse]) [2023-11-29 06:24:56,244 INFO L294 olderBase$Statistics]: this new event has 99 ancestors and is cut-off event [2023-11-29 06:24:56,245 INFO L297 olderBase$Statistics]: existing Event has 99 ancestors and is cut-off event [2023-11-29 06:24:56,245 INFO L297 olderBase$Statistics]: existing Event has 99 ancestors and is cut-off event [2023-11-29 06:24:56,245 INFO L297 olderBase$Statistics]: existing Event has 93 ancestors and is cut-off event [2023-11-29 06:24:56,468 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([574] salethreadEXIT-->L750-7: Formula: (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem10#1_17| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0))) v_salethreadThread3of3ForFork0_thidvar0_4) InVars {salethreadThread3of3ForFork0_thidvar0=v_salethreadThread3of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem10#1=|v_ULTIMATE.start_main_#t~mem10#1_17|} OutVars{salethreadThread3of3ForFork0_thidvar0=v_salethreadThread3of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem10#1=|v_ULTIMATE.start_main_#t~mem10#1_17|} AuxVars[] AssignedVars[][168], [salethreadThread3of3ForFork0NotInUse, 16#L730true, 131#true, Black: 136#(= |ULTIMATE.start_main_~i~0#1| 0), 151#true, Black: 302#(< |ULTIMATE.start_main_~i~0#1| 20), Black: 139#true, Black: 155#(<= |ULTIMATE.start_main_~i~0#1| 1), 414#(= salethreadThread2of3ForFork0_~_numberOfSeatsSold~0 0), Black: 147#(= |#race~numberOfSeatsSold~0| 0), 39#L750-7true, Black: 406#(and (= salethreadThread1of3ForFork0_~_numberOfSeatsSold~0 0) (= ~numberOfSeatsSold~0 0)), Black: 404#(= salethreadThread1of3ForFork0_~_numberOfSeatsSold~0 0), Black: 403#(= ~numberOfSeatsSold~0 0), salethreadThread1of3ForFork0NotInUse, 401#true, salethreadThread2of3ForFork0InUse]) [2023-11-29 06:24:56,469 INFO L294 olderBase$Statistics]: this new event has 99 ancestors and is cut-off event [2023-11-29 06:24:56,469 INFO L297 olderBase$Statistics]: existing Event has 93 ancestors and is cut-off event [2023-11-29 06:24:56,469 INFO L297 olderBase$Statistics]: existing Event has 99 ancestors and is cut-off event [2023-11-29 06:24:56,469 INFO L297 olderBase$Statistics]: existing Event has 93 ancestors and is cut-off event [2023-11-29 06:24:56,510 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([572] salethreadEXIT-->L750-7: Formula: (= v_salethreadThread1of3ForFork0_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem10#1_13| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) InVars {salethreadThread1of3ForFork0_thidvar0=v_salethreadThread1of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem10#1=|v_ULTIMATE.start_main_#t~mem10#1_13|} OutVars{salethreadThread1of3ForFork0_thidvar0=v_salethreadThread1of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem10#1=|v_ULTIMATE.start_main_#t~mem10#1_13|} AuxVars[] AssignedVars[][144], [salethreadThread3of3ForFork0NotInUse, 411#true, 131#true, Black: 136#(= |ULTIMATE.start_main_~i~0#1| 0), 151#true, Black: 302#(< |ULTIMATE.start_main_~i~0#1| 20), Black: 139#true, Black: 155#(<= |ULTIMATE.start_main_~i~0#1| 1), 116#L721-4true, Black: 147#(= |#race~numberOfSeatsSold~0| 0), 39#L750-7true, Black: 406#(and (= salethreadThread1of3ForFork0_~_numberOfSeatsSold~0 0) (= ~numberOfSeatsSold~0 0)), Black: 404#(= salethreadThread1of3ForFork0_~_numberOfSeatsSold~0 0), Black: 403#(= ~numberOfSeatsSold~0 0), salethreadThread1of3ForFork0NotInUse, 401#true, salethreadThread2of3ForFork0InUse]) [2023-11-29 06:24:56,510 INFO L294 olderBase$Statistics]: this new event has 100 ancestors and is cut-off event [2023-11-29 06:24:56,510 INFO L297 olderBase$Statistics]: existing Event has 94 ancestors and is cut-off event [2023-11-29 06:24:56,511 INFO L297 olderBase$Statistics]: existing Event has 100 ancestors and is cut-off event [2023-11-29 06:24:56,511 INFO L297 olderBase$Statistics]: existing Event has 100 ancestors and is cut-off event [2023-11-29 06:24:56,536 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([574] salethreadEXIT-->L750-7: Formula: (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem10#1_17| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0))) v_salethreadThread3of3ForFork0_thidvar0_4) InVars {salethreadThread3of3ForFork0_thidvar0=v_salethreadThread3of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem10#1=|v_ULTIMATE.start_main_#t~mem10#1_17|} OutVars{salethreadThread3of3ForFork0_thidvar0=v_salethreadThread3of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem10#1=|v_ULTIMATE.start_main_#t~mem10#1_17|} AuxVars[] AssignedVars[][140], [salethreadThread3of3ForFork0NotInUse, 411#true, 131#true, Black: 136#(= |ULTIMATE.start_main_~i~0#1| 0), 151#true, Black: 302#(< |ULTIMATE.start_main_~i~0#1| 20), Black: 139#true, Black: 155#(<= |ULTIMATE.start_main_~i~0#1| 1), 116#L721-4true, Black: 147#(= |#race~numberOfSeatsSold~0| 0), 39#L750-7true, Black: 406#(and (= salethreadThread1of3ForFork0_~_numberOfSeatsSold~0 0) (= ~numberOfSeatsSold~0 0)), Black: 404#(= salethreadThread1of3ForFork0_~_numberOfSeatsSold~0 0), Black: 403#(= ~numberOfSeatsSold~0 0), salethreadThread1of3ForFork0NotInUse, 401#true, salethreadThread2of3ForFork0InUse]) [2023-11-29 06:24:56,536 INFO L294 olderBase$Statistics]: this new event has 100 ancestors and is cut-off event [2023-11-29 06:24:56,536 INFO L297 olderBase$Statistics]: existing Event has 94 ancestors and is cut-off event [2023-11-29 06:24:56,537 INFO L297 olderBase$Statistics]: existing Event has 100 ancestors and is cut-off event [2023-11-29 06:24:56,537 INFO L297 olderBase$Statistics]: existing Event has 94 ancestors and is cut-off event [2023-11-29 06:24:57,029 INFO L124 PetriNetUnfolderBase]: 5072/28011 cut-off events. [2023-11-29 06:24:57,029 INFO L125 PetriNetUnfolderBase]: For 11635/15435 co-relation queries the response was YES. [2023-11-29 06:24:57,132 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44769 conditions, 28011 events. 5072/28011 cut-off events. For 11635/15435 co-relation queries the response was YES. Maximal size of possible extension queue 1199. Compared 416856 event pairs, 1316 based on Foata normal form. 432/24897 useless extension candidates. Maximal degree in co-relation 44753. Up to 3862 conditions per place. [2023-11-29 06:24:57,325 INFO L140 encePairwiseOnDemand]: 127/134 looper letters, 47 selfloop transitions, 11 changer transitions 0/180 dead transitions. [2023-11-29 06:24:57,325 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 144 places, 180 transitions, 791 flow [2023-11-29 06:24:57,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 06:24:57,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-29 06:24:57,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 551 transitions. [2023-11-29 06:24:57,328 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8223880597014925 [2023-11-29 06:24:57,328 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 551 transitions. [2023-11-29 06:24:57,328 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 551 transitions. [2023-11-29 06:24:57,328 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 06:24:57,328 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 551 transitions. [2023-11-29 06:24:57,330 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 110.2) internal successors, (551), 5 states have internal predecessors, (551), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:24:57,332 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 134.0) internal successors, (804), 6 states have internal predecessors, (804), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:24:57,332 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 134.0) internal successors, (804), 6 states have internal predecessors, (804), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:24:57,332 INFO L175 Difference]: Start difference. First operand has 140 places, 152 transitions, 521 flow. Second operand 5 states and 551 transitions. [2023-11-29 06:24:57,332 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 144 places, 180 transitions, 791 flow [2023-11-29 06:24:57,339 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 143 places, 180 transitions, 786 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-29 06:24:57,341 INFO L231 Difference]: Finished difference. Result has 146 places, 157 transitions, 590 flow [2023-11-29 06:24:57,341 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=134, PETRI_DIFFERENCE_MINUEND_FLOW=517, PETRI_DIFFERENCE_MINUEND_PLACES=139, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=152, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=144, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=590, PETRI_PLACES=146, PETRI_TRANSITIONS=157} [2023-11-29 06:24:57,342 INFO L281 CegarLoopForPetriNet]: 128 programPoint places, 18 predicate places. [2023-11-29 06:24:57,342 INFO L495 AbstractCegarLoop]: Abstraction has has 146 places, 157 transitions, 590 flow [2023-11-29 06:24:57,342 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 103.25) internal successors, (413), 4 states have internal predecessors, (413), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:24:57,342 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 06:24:57,342 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 06:24:57,342 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-11-29 06:24:57,343 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting salethreadErr1ASSERT_VIOLATIONDATA_RACE === [salethreadErr0ASSERT_VIOLATIONDATA_RACE, salethreadErr1ASSERT_VIOLATIONDATA_RACE, salethreadErr2ASSERT_VIOLATIONDATA_RACE (and 19 more)] === [2023-11-29 06:24:57,343 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:24:57,343 INFO L85 PathProgramCache]: Analyzing trace with hash 758635425, now seen corresponding path program 1 times [2023-11-29 06:24:57,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:24:57,343 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [208932563] [2023-11-29 06:24:57,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:24:57,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:24:57,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 06:24:57,355 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 06:24:57,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 06:24:57,369 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 06:24:57,370 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-29 06:24:57,370 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location salethreadErr1ASSERT_VIOLATIONDATA_RACE (21 of 22 remaining) [2023-11-29 06:24:57,370 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr0ASSERT_VIOLATIONDATA_RACE (20 of 22 remaining) [2023-11-29 06:24:57,370 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr1ASSERT_VIOLATIONDATA_RACE (19 of 22 remaining) [2023-11-29 06:24:57,370 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr2ASSERT_VIOLATIONDATA_RACE (18 of 22 remaining) [2023-11-29 06:24:57,371 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr3ASSERT_VIOLATIONDATA_RACE (17 of 22 remaining) [2023-11-29 06:24:57,371 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (16 of 22 remaining) [2023-11-29 06:24:57,371 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (15 of 22 remaining) [2023-11-29 06:24:57,371 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (14 of 22 remaining) [2023-11-29 06:24:57,371 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (13 of 22 remaining) [2023-11-29 06:24:57,371 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (12 of 22 remaining) [2023-11-29 06:24:57,371 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (11 of 22 remaining) [2023-11-29 06:24:57,371 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr0ASSERT_VIOLATIONDATA_RACE (10 of 22 remaining) [2023-11-29 06:24:57,372 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr2ASSERT_VIOLATIONDATA_RACE (9 of 22 remaining) [2023-11-29 06:24:57,372 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr3ASSERT_VIOLATIONDATA_RACE (8 of 22 remaining) [2023-11-29 06:24:57,372 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr0ASSERT_VIOLATIONDATA_RACE (7 of 22 remaining) [2023-11-29 06:24:57,372 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr1ASSERT_VIOLATIONDATA_RACE (6 of 22 remaining) [2023-11-29 06:24:57,372 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr2ASSERT_VIOLATIONDATA_RACE (5 of 22 remaining) [2023-11-29 06:24:57,372 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr3ASSERT_VIOLATIONDATA_RACE (4 of 22 remaining) [2023-11-29 06:24:57,372 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr0ASSERT_VIOLATIONDATA_RACE (3 of 22 remaining) [2023-11-29 06:24:57,372 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr1ASSERT_VIOLATIONDATA_RACE (2 of 22 remaining) [2023-11-29 06:24:57,373 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr2ASSERT_VIOLATIONDATA_RACE (1 of 22 remaining) [2023-11-29 06:24:57,373 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr3ASSERT_VIOLATIONDATA_RACE (0 of 22 remaining) [2023-11-29 06:24:57,373 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-11-29 06:24:57,373 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 06:24:57,377 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 3 thread instances [2023-11-29 06:24:57,377 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-29 06:24:57,416 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated [2023-11-29 06:24:57,417 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated [2023-11-29 06:24:57,427 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.11 06:24:57 BasicIcfg [2023-11-29 06:24:57,428 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-29 06:24:57,428 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-29 06:24:57,428 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-29 06:24:57,428 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-29 06:24:57,429 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 06:24:40" (3/4) ... [2023-11-29 06:24:57,430 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-11-29 06:24:57,431 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-29 06:24:57,431 INFO L158 Benchmark]: Toolchain (without parser) took 17760.60ms. Allocated memory was 121.6MB in the beginning and 3.3GB in the end (delta: 3.2GB). Free memory was 60.4MB in the beginning and 2.5GB in the end (delta: -2.5GB). Peak memory consumption was 682.4MB. Max. memory is 16.1GB. [2023-11-29 06:24:57,431 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 121.6MB. Free memory was 93.0MB in the beginning and 92.9MB in the end (delta: 118.9kB). There was no memory consumed. Max. memory is 16.1GB. [2023-11-29 06:24:57,432 INFO L158 Benchmark]: CACSL2BoogieTranslator took 474.06ms. Allocated memory was 121.6MB in the beginning and 157.3MB in the end (delta: 35.7MB). Free memory was 60.2MB in the beginning and 109.9MB in the end (delta: -49.8MB). Peak memory consumption was 7.6MB. Max. memory is 16.1GB. [2023-11-29 06:24:57,432 INFO L158 Benchmark]: Boogie Procedure Inliner took 46.08ms. Allocated memory is still 157.3MB. Free memory was 109.9MB in the beginning and 108.0MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-29 06:24:57,432 INFO L158 Benchmark]: Boogie Preprocessor took 30.11ms. Allocated memory is still 157.3MB. Free memory was 108.0MB in the beginning and 106.4MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-29 06:24:57,433 INFO L158 Benchmark]: RCFGBuilder took 403.80ms. Allocated memory is still 157.3MB. Free memory was 106.4MB in the beginning and 89.6MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2023-11-29 06:24:57,433 INFO L158 Benchmark]: TraceAbstraction took 16796.51ms. Allocated memory was 157.3MB in the beginning and 3.3GB in the end (delta: 3.1GB). Free memory was 88.7MB in the beginning and 2.5GB in the end (delta: -2.4GB). Peak memory consumption was 672.7MB. Max. memory is 16.1GB. [2023-11-29 06:24:57,433 INFO L158 Benchmark]: Witness Printer took 2.68ms. Allocated memory is still 3.3GB. Free memory is still 2.5GB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-29 06:24:57,435 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16ms. Allocated memory is still 121.6MB. Free memory was 93.0MB in the beginning and 92.9MB in the end (delta: 118.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 474.06ms. Allocated memory was 121.6MB in the beginning and 157.3MB in the end (delta: 35.7MB). Free memory was 60.2MB in the beginning and 109.9MB in the end (delta: -49.8MB). Peak memory consumption was 7.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 46.08ms. Allocated memory is still 157.3MB. Free memory was 109.9MB in the beginning and 108.0MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 30.11ms. Allocated memory is still 157.3MB. Free memory was 108.0MB in the beginning and 106.4MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 403.80ms. Allocated memory is still 157.3MB. Free memory was 106.4MB in the beginning and 89.6MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 16796.51ms. Allocated memory was 157.3MB in the beginning and 3.3GB in the end (delta: 3.1GB). Free memory was 88.7MB in the beginning and 2.5GB in the end (delta: -2.4GB). Peak memory consumption was 672.7MB. Max. memory is 16.1GB. * Witness Printer took 2.68ms. Allocated memory is still 3.3GB. Free memory is still 2.5GB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - DataRaceFoundResult [Line: 722]: Data race detected [2023-11-29 06:24:57,461 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated [2023-11-29 06:24:57,462 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated [2023-11-29 06:24:57,483 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated [2023-11-29 06:24:57,484 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated Data race detected The following path leads to a data race: [L717] 0 int numberOfSeatsSold; VAL [numberOfSeatsSold=0] [L718] 0 int stopSales; VAL [numberOfSeatsSold=0, stopSales=0] [L719] 0 int numOfTickets; VAL [numOfTickets=0, numberOfSeatsSold=0, stopSales=0] [L736] 0 pthread_t salethreads[20]; VAL [\old(argc)=81, argc=81, argv={84:82}, numOfTickets=0, numberOfSeatsSold=0, salethreads={3:0}, stopSales=0] [L738] 0 numOfTickets = 20 VAL [\old(argc)=81, argc=81, argv={84:82}, numOfTickets=20, numberOfSeatsSold=0, salethreads={3:0}, stopSales=0] [L741] 0 numberOfSeatsSold = 0 VAL [\old(argc)=81, argc=81, argv={84:82}, numOfTickets=20, numberOfSeatsSold=0, salethreads={3:0}, stopSales=0] [L744] 0 stopSales = 0 VAL [\old(argc)=81, argc=81, argv={84:82}, numOfTickets=20, numberOfSeatsSold=0, salethreads={3:0}, stopSales=0] [L746] 0 int i = 0; VAL [\old(argc)=81, argc=81, argv={84:82}, i=0, numOfTickets=20, numberOfSeatsSold=0, salethreads={3:0}, stopSales=0] [L746] COND TRUE 0 i < 20 VAL [\old(argc)=81, argc=81, argv={84:82}, i=0, numOfTickets=20, numberOfSeatsSold=0, salethreads={3:0}, stopSales=0] [L747] FCALL, FORK 0 pthread_create(&salethreads[i], 0, salethread, ((void *)0)) VAL [\old(argc)=81, arg={0:0}, argc=81, argv={84:82}, i=0, numOfTickets=20, numberOfSeatsSold=0, salethreads={3:0}, stopSales=0] [L721] 1 !stopSales VAL [arg={0:0}, arg={0:0}, numOfTickets=20, numberOfSeatsSold=0, stopSales=0] [L746] 0 i++ VAL [\old(argc)=81, arg={0:0}, arg={0:0}, argc=81, argv={84:82}, i=1, numOfTickets=20, numberOfSeatsSold=0, salethreads={3:0}, stopSales=0] [L746] COND TRUE 0 i < 20 VAL [\old(argc)=81, arg={0:0}, arg={0:0}, argc=81, argv={84:82}, i=1, numOfTickets=20, numberOfSeatsSold=0, salethreads={3:0}, stopSales=0] [L747] FCALL, FORK 0 pthread_create(&salethreads[i], 0, salethread, ((void *)0)) VAL [\old(argc)=81, arg={0:0}, arg={0:0}, argc=81, argv={84:82}, i=1, numOfTickets=20, numberOfSeatsSold=0, salethreads={3:0}, stopSales=0] [L721] 2 !stopSales VAL [arg={0:0}, arg={0:0}, numOfTickets=20, numberOfSeatsSold=0, stopSales=0] [L721] COND TRUE 1 !stopSales VAL [arg={0:0}, arg={0:0}, numOfTickets=20, numberOfSeatsSold=0, stopSales=0] [L722] 1 int _numberOfSeatsSold = numberOfSeatsSold; VAL [arg={0:0}, arg={0:0}, numOfTickets=20, numberOfSeatsSold=0, stopSales=0] [L721] 2 !stopSales VAL [arg={0:0}, arg={0:0}, numOfTickets=20, numberOfSeatsSold=0, stopSales=0] [L721] COND TRUE 2 !stopSales VAL [arg={0:0}, arg={0:0}, numOfTickets=20, numberOfSeatsSold=0, stopSales=0] [L722] 2 int _numberOfSeatsSold = numberOfSeatsSold; VAL [_numberOfSeatsSold=0, arg={0:0}, arg={0:0}, numOfTickets=20, numberOfSeatsSold=0, stopSales=0] [L723] COND FALSE 1 !(_numberOfSeatsSold >= (20 - (((20 / 10) == 0) ? 1 : (20 / 10)))) VAL [_numberOfSeatsSold=0, arg={0:0}, arg={0:0}, numOfTickets=20, numberOfSeatsSold=0, stopSales=0] [L729] 1 numberOfSeatsSold = _numberOfSeatsSold + 1 VAL [_numberOfSeatsSold=0, arg={0:0}, arg={0:0}, numOfTickets=20, numberOfSeatsSold=1, stopSales=0] [L722] 2 int _numberOfSeatsSold = numberOfSeatsSold; VAL [_numberOfSeatsSold=0, arg={0:0}, arg={0:0}, numOfTickets=20, numberOfSeatsSold=1, stopSales=0] Now there is a data race on ~numberOfSeatsSold~0 between C: numberOfSeatsSold = _numberOfSeatsSold + 1 [729] and C: int _numberOfSeatsSold = numberOfSeatsSold; [722] - UnprovableResult [Line: 721]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 725]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 729]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 738]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 741]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 744]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 752]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 750]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 747]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 3 procedures, 104 locations, 14 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 1.0s, OverallIterations: 5, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 30 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 12 mSDsluCounter, 11 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 5 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 63 IncrementalHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 5 mSolverCounterUnsat, 11 mSDtfsCounter, 63 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=197occurred in iteration=4, InterpolantAutomatonStates: 11, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 133 NumberOfCodeBlocks, 133 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 95 ConstructedInterpolants, 0 QuantifiedInterpolants, 101 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 4 InterpolantComputations, 4 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data with 2 thread instances CFG has 4 procedures, 122 locations, 18 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 1.7s, OverallIterations: 6, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 111 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 83 mSDsluCounter, 30 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 11 mSDsCounter, 15 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 200 IncrementalHoareTripleChecker+Invalid, 215 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 15 mSolverCounterUnsat, 19 mSDtfsCounter, 200 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 93 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=334occurred in iteration=4, InterpolantAutomatonStates: 20, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 221 NumberOfCodeBlocks, 221 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 209 ConstructedInterpolants, 0 QuantifiedInterpolants, 281 SizeOfPredicates, 2 NumberOfNonLiveVariables, 101 ConjunctsInSsa, 4 ConjunctsInUnsatCore, 7 InterpolantComputations, 4 PerfectInterpolantSequences, 0/3 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data with 3 thread instances CFG has 5 procedures, 140 locations, 22 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 13.9s, OverallIterations: 8, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 13.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 210 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 157 mSDsluCounter, 53 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 22 mSDsCounter, 26 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 422 IncrementalHoareTripleChecker+Invalid, 448 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 26 mSolverCounterUnsat, 31 mSDtfsCounter, 422 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 103 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=590occurred in iteration=7, InterpolantAutomatonStates: 30, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 318 NumberOfCodeBlocks, 318 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 299 ConstructedInterpolants, 0 QuantifiedInterpolants, 479 SizeOfPredicates, 2 NumberOfNonLiveVariables, 101 ConjunctsInSsa, 4 ConjunctsInUnsatCore, 9 InterpolantComputations, 6 PerfectInterpolantSequences, 10/13 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2023-11-29 06:24:57,503 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_134da552-ab6a-4313-9d17-0e65a57f8ff7/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE