./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_09ea1619-d265-4dc3-a61e-09f20be41985/bin/uautomizer-verify-VRDe98Ueme/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09ea1619-d265-4dc3-a61e-09f20be41985/bin/uautomizer-verify-VRDe98Ueme/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09ea1619-d265-4dc3-a61e-09f20be41985/bin/uautomizer-verify-VRDe98Ueme/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09ea1619-d265-4dc3-a61e-09f20be41985/bin/uautomizer-verify-VRDe98Ueme/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-deagle/airline-20.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09ea1619-d265-4dc3-a61e-09f20be41985/bin/uautomizer-verify-VRDe98Ueme/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09ea1619-d265-4dc3-a61e-09f20be41985/bin/uautomizer-verify-VRDe98Ueme --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-26 10:48:37,425 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-26 10:48:37,567 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09ea1619-d265-4dc3-a61e-09f20be41985/bin/uautomizer-verify-VRDe98Ueme/config/svcomp-DataRace-32bit-Automizer_Default.epf [2023-11-26 10:48:37,574 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-26 10:48:37,575 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-26 10:48:37,619 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-26 10:48:37,620 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-26 10:48:37,621 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-26 10:48:37,622 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-26 10:48:37,623 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-26 10:48:37,624 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-26 10:48:37,625 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-26 10:48:37,626 INFO L153 SettingsManager]: * Use SBE=true [2023-11-26 10:48:37,627 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-26 10:48:37,628 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-26 10:48:37,629 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-26 10:48:37,633 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-26 10:48:37,634 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-26 10:48:37,634 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-26 10:48:37,635 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-26 10:48:37,637 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-26 10:48:37,642 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-26 10:48:37,642 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2023-11-26 10:48:37,643 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-26 10:48:37,644 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-26 10:48:37,644 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-26 10:48:37,645 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-26 10:48:37,645 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-26 10:48:37,646 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-26 10:48:37,647 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-26 10:48:37,649 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-26 10:48:37,650 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-26 10:48:37,650 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-26 10:48:37,651 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-26 10:48:37,651 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-26 10:48:37,651 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-26 10:48:37,652 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-26 10:48:37,652 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-26 10:48:37,652 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-26 10:48:37,653 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-26 10:48:37,653 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-26 10:48:37,654 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_09ea1619-d265-4dc3-a61e-09f20be41985/bin/uautomizer-verify-VRDe98Ueme/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_09ea1619-d265-4dc3-a61e-09f20be41985/bin/uautomizer-verify-VRDe98Ueme 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-26 10:48:38,077 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-26 10:48:38,116 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-26 10:48:38,119 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-26 10:48:38,120 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-26 10:48:38,121 INFO L274 PluginConnector]: CDTParser initialized [2023-11-26 10:48:38,122 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09ea1619-d265-4dc3-a61e-09f20be41985/bin/uautomizer-verify-VRDe98Ueme/../../sv-benchmarks/c/pthread-deagle/airline-20.i [2023-11-26 10:48:41,751 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-26 10:48:42,072 INFO L384 CDTParser]: Found 1 translation units. [2023-11-26 10:48:42,073 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09ea1619-d265-4dc3-a61e-09f20be41985/sv-benchmarks/c/pthread-deagle/airline-20.i [2023-11-26 10:48:42,103 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09ea1619-d265-4dc3-a61e-09f20be41985/bin/uautomizer-verify-VRDe98Ueme/data/13b7ae7df/003857fdc41b435bb0f92387e14340c0/FLAGd218c0075 [2023-11-26 10:48:42,125 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09ea1619-d265-4dc3-a61e-09f20be41985/bin/uautomizer-verify-VRDe98Ueme/data/13b7ae7df/003857fdc41b435bb0f92387e14340c0 [2023-11-26 10:48:42,127 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-26 10:48:42,130 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-26 10:48:42,132 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-26 10:48:42,132 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-26 10:48:42,140 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-26 10:48:42,141 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 10:48:42" (1/1) ... [2023-11-26 10:48:42,142 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3a6ff664 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:48:42, skipping insertion in model container [2023-11-26 10:48:42,143 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 10:48:42" (1/1) ... [2023-11-26 10:48:42,232 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-26 10:48:42,659 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-26 10:48:42,672 INFO L202 MainTranslator]: Completed pre-run [2023-11-26 10:48:42,733 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-26 10:48:42,772 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-26 10:48:42,773 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-26 10:48:42,783 INFO L206 MainTranslator]: Completed translation [2023-11-26 10:48:42,783 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:48:42 WrapperNode [2023-11-26 10:48:42,784 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-26 10:48:42,785 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-26 10:48:42,786 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-26 10:48:42,786 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-26 10:48:42,795 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:48:42" (1/1) ... [2023-11-26 10:48:42,813 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:48:42" (1/1) ... [2023-11-26 10:48:42,848 INFO L138 Inliner]: procedures = 162, calls = 24, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 83 [2023-11-26 10:48:42,852 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-26 10:48:42,854 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-26 10:48:42,854 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-26 10:48:42,854 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-26 10:48:42,873 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:48:42" (1/1) ... [2023-11-26 10:48:42,874 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:48:42" (1/1) ... [2023-11-26 10:48:42,885 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:48:42" (1/1) ... [2023-11-26 10:48:42,885 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:48:42" (1/1) ... [2023-11-26 10:48:42,909 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:48:42" (1/1) ... [2023-11-26 10:48:42,920 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:48:42" (1/1) ... [2023-11-26 10:48:42,927 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:48:42" (1/1) ... [2023-11-26 10:48:42,936 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:48:42" (1/1) ... [2023-11-26 10:48:42,939 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-26 10:48:42,973 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-26 10:48:42,974 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-26 10:48:42,974 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-26 10:48:42,975 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:48:42" (1/1) ... [2023-11-26 10:48:42,986 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-26 10:48:43,012 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09ea1619-d265-4dc3-a61e-09f20be41985/bin/uautomizer-verify-VRDe98Ueme/z3 [2023-11-26 10:48:43,031 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09ea1619-d265-4dc3-a61e-09f20be41985/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-26 10:48:43,035 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09ea1619-d265-4dc3-a61e-09f20be41985/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-26 10:48:43,075 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-26 10:48:43,075 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-26 10:48:43,076 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-26 10:48:43,076 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-26 10:48:43,076 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-26 10:48:43,078 INFO L130 BoogieDeclarations]: Found specification of procedure salethread [2023-11-26 10:48:43,078 INFO L138 BoogieDeclarations]: Found implementation of procedure salethread [2023-11-26 10:48:43,078 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-26 10:48:43,079 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-26 10:48:43,079 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-26 10:48:43,079 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-26 10:48:43,080 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-26 10:48:43,086 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-26 10:48:43,265 INFO L241 CfgBuilder]: Building ICFG [2023-11-26 10:48:43,268 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-26 10:48:43,571 INFO L282 CfgBuilder]: Performing block encoding [2023-11-26 10:48:43,622 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-26 10:48:43,623 INFO L309 CfgBuilder]: Removed 2 assume(true) statements. [2023-11-26 10:48:43,625 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 10:48:43 BoogieIcfgContainer [2023-11-26 10:48:43,625 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-26 10:48:43,629 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-26 10:48:43,629 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-26 10:48:43,633 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-26 10:48:43,634 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.11 10:48:42" (1/3) ... [2023-11-26 10:48:43,635 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4bf81540 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 10:48:43, skipping insertion in model container [2023-11-26 10:48:43,635 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:48:42" (2/3) ... [2023-11-26 10:48:43,635 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4bf81540 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 10:48:43, skipping insertion in model container [2023-11-26 10:48:43,636 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 10:48:43" (3/3) ... [2023-11-26 10:48:43,637 INFO L112 eAbstractionObserver]: Analyzing ICFG airline-20.i [2023-11-26 10:48:43,649 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-11-26 10:48:43,663 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-26 10:48:43,664 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 9 error locations. [2023-11-26 10:48:43,664 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-26 10:48:43,731 INFO L144 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2023-11-26 10:48:43,774 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 88 places, 92 transitions, 191 flow [2023-11-26 10:48:43,855 INFO L124 PetriNetUnfolderBase]: 11/131 cut-off events. [2023-11-26 10:48:43,855 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2023-11-26 10:48:43,864 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-26 10:48:43,864 INFO L82 GeneralOperation]: Start removeDead. Operand has 88 places, 92 transitions, 191 flow [2023-11-26 10:48:43,872 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 88 places, 92 transitions, 191 flow [2023-11-26 10:48:43,886 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-26 10:48:43,896 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;@3e2e7066, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-26 10:48:43,896 INFO L358 AbstractCegarLoop]: Starting to check reachability of 14 error locations. [2023-11-26 10:48:43,905 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-26 10:48:43,905 INFO L124 PetriNetUnfolderBase]: 0/15 cut-off events. [2023-11-26 10:48:43,905 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-26 10:48:43,906 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 10:48:43,907 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 10:48:43,907 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [salethreadErr0ASSERT_VIOLATIONDATA_RACE, salethreadErr1ASSERT_VIOLATIONDATA_RACE, salethreadErr2ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2023-11-26 10:48:43,915 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:48:43,915 INFO L85 PathProgramCache]: Analyzing trace with hash 1557855436, now seen corresponding path program 1 times [2023-11-26 10:48:43,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:48:43,929 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [231197977] [2023-11-26 10:48:43,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:48:43,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:48:44,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:48:44,147 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-26 10:48:44,148 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 10:48:44,148 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [231197977] [2023-11-26 10:48:44,149 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [231197977] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 10:48:44,149 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 10:48:44,149 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-26 10:48:44,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1221680276] [2023-11-26 10:48:44,152 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 10:48:44,164 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-26 10:48:44,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 10:48:44,205 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-26 10:48:44,206 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-26 10:48:44,210 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 75 out of 92 [2023-11-26 10:48:44,213 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-26 10:48:44,214 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 10:48:44,214 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 75 of 92 [2023-11-26 10:48:44,215 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 10:48:44,285 INFO L124 PetriNetUnfolderBase]: 3/112 cut-off events. [2023-11-26 10:48:44,285 INFO L125 PetriNetUnfolderBase]: For 4/5 co-relation queries the response was YES. [2023-11-26 10:48:44,286 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-26 10:48:44,288 INFO L140 encePairwiseOnDemand]: 83/92 looper letters, 7 selfloop transitions, 0 changer transitions 0/80 dead transitions. [2023-11-26 10:48:44,289 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 80 transitions, 181 flow [2023-11-26 10:48:44,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-26 10:48:44,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-11-26 10:48:44,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 166 transitions. [2023-11-26 10:48:44,308 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9021739130434783 [2023-11-26 10:48:44,309 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 166 transitions. [2023-11-26 10:48:44,309 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 166 transitions. [2023-11-26 10:48:44,311 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 10:48:44,315 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 166 transitions. [2023-11-26 10:48:44,319 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-26 10:48:44,325 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-26 10:48:44,325 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-26 10:48:44,328 INFO L175 Difference]: Start difference. First operand has 88 places, 92 transitions, 191 flow. Second operand 2 states and 166 transitions. [2023-11-26 10:48:44,329 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 80 transitions, 181 flow [2023-11-26 10:48:44,334 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 80 transitions, 181 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-26 10:48:44,339 INFO L231 Difference]: Finished difference. Result has 81 places, 80 transitions, 167 flow [2023-11-26 10:48:44,342 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-26 10:48:44,347 INFO L281 CegarLoopForPetriNet]: 88 programPoint places, -7 predicate places. [2023-11-26 10:48:44,347 INFO L495 AbstractCegarLoop]: Abstraction has has 81 places, 80 transitions, 167 flow [2023-11-26 10:48:44,348 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-26 10:48:44,348 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 10:48:44,348 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-26 10:48:44,349 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-26 10:48:44,349 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [salethreadErr0ASSERT_VIOLATIONDATA_RACE, salethreadErr1ASSERT_VIOLATIONDATA_RACE, salethreadErr2ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2023-11-26 10:48:44,350 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:48:44,350 INFO L85 PathProgramCache]: Analyzing trace with hash -974512921, now seen corresponding path program 1 times [2023-11-26 10:48:44,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:48:44,351 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [284314587] [2023-11-26 10:48:44,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:48:44,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:48:44,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:48:44,511 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-26 10:48:44,512 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 10:48:44,512 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [284314587] [2023-11-26 10:48:44,512 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [284314587] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 10:48:44,513 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 10:48:44,513 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-26 10:48:44,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [852366125] [2023-11-26 10:48:44,514 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 10:48:44,515 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 10:48:44,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 10:48:44,517 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 10:48:44,518 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 10:48:44,536 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 69 out of 92 [2023-11-26 10:48:44,537 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-26 10:48:44,538 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 10:48:44,538 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 69 of 92 [2023-11-26 10:48:44,538 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 10:48:44,632 INFO L124 PetriNetUnfolderBase]: 10/152 cut-off events. [2023-11-26 10:48:44,632 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2023-11-26 10:48:44,633 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-26 10:48:44,635 INFO L140 encePairwiseOnDemand]: 89/92 looper letters, 13 selfloop transitions, 2 changer transitions 0/82 dead transitions. [2023-11-26 10:48:44,635 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 82 transitions, 201 flow [2023-11-26 10:48:44,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 10:48:44,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-26 10:48:44,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 223 transitions. [2023-11-26 10:48:44,639 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8079710144927537 [2023-11-26 10:48:44,640 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 223 transitions. [2023-11-26 10:48:44,640 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 223 transitions. [2023-11-26 10:48:44,641 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 10:48:44,661 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 223 transitions. [2023-11-26 10:48:44,663 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-26 10:48:44,666 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-26 10:48:44,667 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-26 10:48:44,667 INFO L175 Difference]: Start difference. First operand has 81 places, 80 transitions, 167 flow. Second operand 3 states and 223 transitions. [2023-11-26 10:48:44,667 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 82 transitions, 201 flow [2023-11-26 10:48:44,669 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 82 transitions, 201 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-26 10:48:44,672 INFO L231 Difference]: Finished difference. Result has 84 places, 80 transitions, 175 flow [2023-11-26 10:48:44,672 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-26 10:48:44,673 INFO L281 CegarLoopForPetriNet]: 88 programPoint places, -4 predicate places. [2023-11-26 10:48:44,674 INFO L495 AbstractCegarLoop]: Abstraction has has 84 places, 80 transitions, 175 flow [2023-11-26 10:48:44,674 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-26 10:48:44,675 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 10:48:44,675 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-26 10:48:44,675 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-26 10:48:44,676 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting salethreadErr0ASSERT_VIOLATIONDATA_RACE === [salethreadErr0ASSERT_VIOLATIONDATA_RACE, salethreadErr1ASSERT_VIOLATIONDATA_RACE, salethreadErr2ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2023-11-26 10:48:44,676 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:48:44,677 INFO L85 PathProgramCache]: Analyzing trace with hash -929159752, now seen corresponding path program 1 times [2023-11-26 10:48:44,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:48:44,677 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1795072415] [2023-11-26 10:48:44,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:48:44,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:48:44,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:48:44,763 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-26 10:48:44,763 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 10:48:44,764 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1795072415] [2023-11-26 10:48:44,764 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1795072415] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 10:48:44,764 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 10:48:44,765 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-26 10:48:44,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1186289576] [2023-11-26 10:48:44,770 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 10:48:44,770 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 10:48:44,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 10:48:44,772 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 10:48:44,772 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 10:48:44,776 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 72 out of 92 [2023-11-26 10:48:44,787 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-26 10:48:44,787 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 10:48:44,788 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 72 of 92 [2023-11-26 10:48:44,788 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 10:48:44,869 INFO L124 PetriNetUnfolderBase]: 1/141 cut-off events. [2023-11-26 10:48:44,872 INFO L125 PetriNetUnfolderBase]: For 11/19 co-relation queries the response was YES. [2023-11-26 10:48:44,875 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-26 10:48:44,877 INFO L140 encePairwiseOnDemand]: 89/92 looper letters, 8 selfloop transitions, 2 changer transitions 0/80 dead transitions. [2023-11-26 10:48:44,877 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 80 transitions, 198 flow [2023-11-26 10:48:44,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 10:48:44,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-26 10:48:44,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 227 transitions. [2023-11-26 10:48:44,886 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.822463768115942 [2023-11-26 10:48:44,886 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 227 transitions. [2023-11-26 10:48:44,887 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 227 transitions. [2023-11-26 10:48:44,887 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 10:48:44,887 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 227 transitions. [2023-11-26 10:48:44,891 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-26 10:48:44,897 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-26 10:48:44,898 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-26 10:48:44,898 INFO L175 Difference]: Start difference. First operand has 84 places, 80 transitions, 175 flow. Second operand 3 states and 227 transitions. [2023-11-26 10:48:44,898 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 80 transitions, 198 flow [2023-11-26 10:48:44,902 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 80 transitions, 194 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-26 10:48:44,906 INFO L231 Difference]: Finished difference. Result has 83 places, 79 transitions, 173 flow [2023-11-26 10:48:44,906 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-26 10:48:44,908 INFO L281 CegarLoopForPetriNet]: 88 programPoint places, -5 predicate places. [2023-11-26 10:48:44,909 INFO L495 AbstractCegarLoop]: Abstraction has has 83 places, 79 transitions, 173 flow [2023-11-26 10:48:44,909 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-26 10:48:44,910 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 10:48:44,910 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-26 10:48:44,910 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-26 10:48:44,912 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting salethreadErr1ASSERT_VIOLATIONDATA_RACE === [salethreadErr0ASSERT_VIOLATIONDATA_RACE, salethreadErr1ASSERT_VIOLATIONDATA_RACE, salethreadErr2ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2023-11-26 10:48:44,914 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:48:44,914 INFO L85 PathProgramCache]: Analyzing trace with hash 466346869, now seen corresponding path program 1 times [2023-11-26 10:48:44,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:48:44,914 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1544559341] [2023-11-26 10:48:44,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:48:44,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:48:44,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:48:44,983 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-26 10:48:44,983 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 10:48:44,983 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1544559341] [2023-11-26 10:48:44,984 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1544559341] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 10:48:44,984 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 10:48:44,984 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-26 10:48:44,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1361225411] [2023-11-26 10:48:44,985 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 10:48:44,985 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 10:48:44,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 10:48:44,986 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 10:48:44,987 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 10:48:44,997 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 69 out of 92 [2023-11-26 10:48:44,998 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-26 10:48:44,998 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 10:48:44,998 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 69 of 92 [2023-11-26 10:48:44,999 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 10:48:45,067 INFO L124 PetriNetUnfolderBase]: 8/215 cut-off events. [2023-11-26 10:48:45,068 INFO L125 PetriNetUnfolderBase]: For 13/21 co-relation queries the response was YES. [2023-11-26 10:48:45,069 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-26 10:48:45,070 INFO L140 encePairwiseOnDemand]: 86/92 looper letters, 12 selfloop transitions, 4 changer transitions 0/82 dead transitions. [2023-11-26 10:48:45,071 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 82 transitions, 214 flow [2023-11-26 10:48:45,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 10:48:45,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-26 10:48:45,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 225 transitions. [2023-11-26 10:48:45,073 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8152173913043478 [2023-11-26 10:48:45,074 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 225 transitions. [2023-11-26 10:48:45,074 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 225 transitions. [2023-11-26 10:48:45,074 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 10:48:45,075 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 225 transitions. [2023-11-26 10:48:45,076 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-26 10:48:45,077 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-26 10:48:45,078 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-26 10:48:45,078 INFO L175 Difference]: Start difference. First operand has 83 places, 79 transitions, 173 flow. Second operand 3 states and 225 transitions. [2023-11-26 10:48:45,078 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 82 transitions, 214 flow [2023-11-26 10:48:45,080 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 82 transitions, 210 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-26 10:48:45,083 INFO L231 Difference]: Finished difference. Result has 84 places, 81 transitions, 197 flow [2023-11-26 10:48:45,083 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-26 10:48:45,084 INFO L281 CegarLoopForPetriNet]: 88 programPoint places, -4 predicate places. [2023-11-26 10:48:45,084 INFO L495 AbstractCegarLoop]: Abstraction has has 84 places, 81 transitions, 197 flow [2023-11-26 10:48:45,085 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-26 10:48:45,085 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 10:48:45,085 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-26 10:48:45,086 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-26 10:48:45,086 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-26 10:48:45,087 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:48:45,087 INFO L85 PathProgramCache]: Analyzing trace with hash -432073854, now seen corresponding path program 1 times [2023-11-26 10:48:45,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:48:45,088 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1706075495] [2023-11-26 10:48:45,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:48:45,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:48:45,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-26 10:48:45,145 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-26 10:48:45,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-26 10:48:45,217 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-26 10:48:45,218 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-26 10:48:45,219 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (13 of 14 remaining) [2023-11-26 10:48:45,222 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr0ASSERT_VIOLATIONDATA_RACE (12 of 14 remaining) [2023-11-26 10:48:45,222 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr1ASSERT_VIOLATIONDATA_RACE (11 of 14 remaining) [2023-11-26 10:48:45,223 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr2ASSERT_VIOLATIONDATA_RACE (10 of 14 remaining) [2023-11-26 10:48:45,223 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr3ASSERT_VIOLATIONDATA_RACE (9 of 14 remaining) [2023-11-26 10:48:45,223 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (8 of 14 remaining) [2023-11-26 10:48:45,224 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (7 of 14 remaining) [2023-11-26 10:48:45,224 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (6 of 14 remaining) [2023-11-26 10:48:45,225 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (5 of 14 remaining) [2023-11-26 10:48:45,225 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (4 of 14 remaining) [2023-11-26 10:48:45,225 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr0ASSERT_VIOLATIONDATA_RACE (3 of 14 remaining) [2023-11-26 10:48:45,226 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr1ASSERT_VIOLATIONDATA_RACE (2 of 14 remaining) [2023-11-26 10:48:45,226 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr2ASSERT_VIOLATIONDATA_RACE (1 of 14 remaining) [2023-11-26 10:48:45,226 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr3ASSERT_VIOLATIONDATA_RACE (0 of 14 remaining) [2023-11-26 10:48:45,227 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-26 10:48:45,227 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2023-11-26 10:48:45,231 WARN L233 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2023-11-26 10:48:45,231 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2023-11-26 10:48:45,265 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2023-11-26 10:48:45,271 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 108 places, 113 transitions, 242 flow [2023-11-26 10:48:45,314 INFO L124 PetriNetUnfolderBase]: 22/237 cut-off events. [2023-11-26 10:48:45,315 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2023-11-26 10:48:45,318 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-26 10:48:45,318 INFO L82 GeneralOperation]: Start removeDead. Operand has 108 places, 113 transitions, 242 flow [2023-11-26 10:48:45,322 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 108 places, 113 transitions, 242 flow [2023-11-26 10:48:45,325 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-26 10:48:45,326 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;@3e2e7066, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-26 10:48:45,327 INFO L358 AbstractCegarLoop]: Starting to check reachability of 18 error locations. [2023-11-26 10:48:45,330 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-26 10:48:45,330 INFO L124 PetriNetUnfolderBase]: 0/15 cut-off events. [2023-11-26 10:48:45,330 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-26 10:48:45,330 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 10:48:45,331 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 10:48:45,331 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [salethreadErr0ASSERT_VIOLATIONDATA_RACE, salethreadErr1ASSERT_VIOLATIONDATA_RACE, salethreadErr2ASSERT_VIOLATIONDATA_RACE (and 15 more)] === [2023-11-26 10:48:45,332 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:48:45,332 INFO L85 PathProgramCache]: Analyzing trace with hash -216625716, now seen corresponding path program 1 times [2023-11-26 10:48:45,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:48:45,332 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [892418202] [2023-11-26 10:48:45,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:48:45,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:48:45,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:48:45,360 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-26 10:48:45,360 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 10:48:45,360 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [892418202] [2023-11-26 10:48:45,361 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [892418202] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 10:48:45,361 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 10:48:45,361 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-26 10:48:45,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [655887681] [2023-11-26 10:48:45,362 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 10:48:45,362 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-26 10:48:45,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 10:48:45,363 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-26 10:48:45,363 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-26 10:48:45,364 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 113 [2023-11-26 10:48:45,365 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-26 10:48:45,365 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 10:48:45,365 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 113 [2023-11-26 10:48:45,365 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 10:48:45,484 INFO L124 PetriNetUnfolderBase]: 19/231 cut-off events. [2023-11-26 10:48:45,484 INFO L125 PetriNetUnfolderBase]: For 35/41 co-relation queries the response was YES. [2023-11-26 10:48:45,487 INFO L83 FinitePrefix]: Finished finitePrefix Result has 281 conditions, 231 events. 19/231 cut-off events. For 35/41 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-26 10:48:45,489 INFO L140 encePairwiseOnDemand]: 102/113 looper letters, 11 selfloop transitions, 0 changer transitions 0/99 dead transitions. [2023-11-26 10:48:45,489 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 99 transitions, 236 flow [2023-11-26 10:48:45,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-26 10:48:45,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-11-26 10:48:45,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 202 transitions. [2023-11-26 10:48:45,492 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8938053097345132 [2023-11-26 10:48:45,492 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 202 transitions. [2023-11-26 10:48:45,493 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 202 transitions. [2023-11-26 10:48:45,493 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 10:48:45,494 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 202 transitions. [2023-11-26 10:48:45,495 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-26 10:48:45,496 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-26 10:48:45,497 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-26 10:48:45,513 INFO L175 Difference]: Start difference. First operand has 108 places, 113 transitions, 242 flow. Second operand 2 states and 202 transitions. [2023-11-26 10:48:45,513 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 99 transitions, 236 flow [2023-11-26 10:48:45,515 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 99 transitions, 236 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-26 10:48:45,518 INFO L231 Difference]: Finished difference. Result has 99 places, 99 transitions, 214 flow [2023-11-26 10:48:45,519 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-26 10:48:45,520 INFO L281 CegarLoopForPetriNet]: 108 programPoint places, -9 predicate places. [2023-11-26 10:48:45,521 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 99 transitions, 214 flow [2023-11-26 10:48:45,522 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-26 10:48:45,522 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 10:48:45,522 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-26 10:48:45,522 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-26 10:48:45,523 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [salethreadErr0ASSERT_VIOLATIONDATA_RACE, salethreadErr1ASSERT_VIOLATIONDATA_RACE, salethreadErr2ASSERT_VIOLATIONDATA_RACE (and 15 more)] === [2023-11-26 10:48:45,524 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:48:45,524 INFO L85 PathProgramCache]: Analyzing trace with hash -645241721, now seen corresponding path program 1 times [2023-11-26 10:48:45,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:48:45,525 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1928820793] [2023-11-26 10:48:45,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:48:45,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:48:45,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:48:45,686 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-26 10:48:45,686 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 10:48:45,687 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1928820793] [2023-11-26 10:48:45,687 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1928820793] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 10:48:45,688 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 10:48:45,688 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-26 10:48:45,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [886000156] [2023-11-26 10:48:45,690 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 10:48:45,691 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 10:48:45,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 10:48:45,694 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 10:48:45,695 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 10:48:45,718 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 84 out of 113 [2023-11-26 10:48:45,719 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-26 10:48:45,719 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 10:48:45,719 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 113 [2023-11-26 10:48:45,720 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 10:48:45,884 INFO L124 PetriNetUnfolderBase]: 59/445 cut-off events. [2023-11-26 10:48:45,884 INFO L125 PetriNetUnfolderBase]: For 29/29 co-relation queries the response was YES. [2023-11-26 10:48:45,887 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-26 10:48:45,890 INFO L140 encePairwiseOnDemand]: 110/113 looper letters, 18 selfloop transitions, 2 changer transitions 0/102 dead transitions. [2023-11-26 10:48:45,891 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 102 transitions, 260 flow [2023-11-26 10:48:45,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 10:48:45,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-26 10:48:45,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 273 transitions. [2023-11-26 10:48:45,894 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8053097345132744 [2023-11-26 10:48:45,894 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 273 transitions. [2023-11-26 10:48:45,894 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 273 transitions. [2023-11-26 10:48:45,895 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 10:48:45,895 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 273 transitions. [2023-11-26 10:48:45,896 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-26 10:48:45,898 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-26 10:48:45,899 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-26 10:48:45,899 INFO L175 Difference]: Start difference. First operand has 99 places, 99 transitions, 214 flow. Second operand 3 states and 273 transitions. [2023-11-26 10:48:45,900 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 102 transitions, 260 flow [2023-11-26 10:48:45,903 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 101 places, 102 transitions, 260 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-26 10:48:45,906 INFO L231 Difference]: Finished difference. Result has 102 places, 100 transitions, 226 flow [2023-11-26 10:48:45,907 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-26 10:48:45,910 INFO L281 CegarLoopForPetriNet]: 108 programPoint places, -6 predicate places. [2023-11-26 10:48:45,910 INFO L495 AbstractCegarLoop]: Abstraction has has 102 places, 100 transitions, 226 flow [2023-11-26 10:48:45,911 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-26 10:48:45,911 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 10:48:45,912 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-26 10:48:45,912 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-26 10:48:45,912 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting salethreadErr0ASSERT_VIOLATIONDATA_RACE === [salethreadErr0ASSERT_VIOLATIONDATA_RACE, salethreadErr1ASSERT_VIOLATIONDATA_RACE, salethreadErr2ASSERT_VIOLATIONDATA_RACE (and 15 more)] === [2023-11-26 10:48:45,913 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:48:45,917 INFO L85 PathProgramCache]: Analyzing trace with hash 688878998, now seen corresponding path program 1 times [2023-11-26 10:48:45,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:48:45,918 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [760700795] [2023-11-26 10:48:45,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:48:45,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:48:45,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:48:46,000 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-26 10:48:46,000 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 10:48:46,000 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [760700795] [2023-11-26 10:48:46,008 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [760700795] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 10:48:46,010 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 10:48:46,010 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-26 10:48:46,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [228647437] [2023-11-26 10:48:46,011 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 10:48:46,011 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 10:48:46,012 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 10:48:46,013 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 10:48:46,014 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 10:48:46,027 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 84 out of 113 [2023-11-26 10:48:46,027 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-26 10:48:46,028 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 10:48:46,028 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 113 [2023-11-26 10:48:46,028 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 10:48:46,232 INFO L124 PetriNetUnfolderBase]: 60/739 cut-off events. [2023-11-26 10:48:46,232 INFO L125 PetriNetUnfolderBase]: For 125/311 co-relation queries the response was YES. [2023-11-26 10:48:46,237 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-26 10:48:46,243 INFO L140 encePairwiseOnDemand]: 105/113 looper letters, 22 selfloop transitions, 6 changer transitions 0/111 dead transitions. [2023-11-26 10:48:46,243 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 111 transitions, 315 flow [2023-11-26 10:48:46,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 10:48:46,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-26 10:48:46,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 282 transitions. [2023-11-26 10:48:46,246 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.831858407079646 [2023-11-26 10:48:46,246 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 282 transitions. [2023-11-26 10:48:46,246 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 282 transitions. [2023-11-26 10:48:46,247 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 10:48:46,247 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 282 transitions. [2023-11-26 10:48:46,248 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-26 10:48:46,250 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-26 10:48:46,252 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-26 10:48:46,252 INFO L175 Difference]: Start difference. First operand has 102 places, 100 transitions, 226 flow. Second operand 3 states and 282 transitions. [2023-11-26 10:48:46,252 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 111 transitions, 315 flow [2023-11-26 10:48:46,255 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 103 places, 111 transitions, 313 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-26 10:48:46,258 INFO L231 Difference]: Finished difference. Result has 105 places, 106 transitions, 276 flow [2023-11-26 10:48:46,258 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-26 10:48:46,261 INFO L281 CegarLoopForPetriNet]: 108 programPoint places, -3 predicate places. [2023-11-26 10:48:46,263 INFO L495 AbstractCegarLoop]: Abstraction has has 105 places, 106 transitions, 276 flow [2023-11-26 10:48:46,263 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-26 10:48:46,263 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 10:48:46,264 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 10:48:46,264 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-26 10:48:46,265 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting salethreadErr1ASSERT_VIOLATIONDATA_RACE === [salethreadErr0ASSERT_VIOLATIONDATA_RACE, salethreadErr1ASSERT_VIOLATIONDATA_RACE, salethreadErr2ASSERT_VIOLATIONDATA_RACE (and 15 more)] === [2023-11-26 10:48:46,266 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:48:46,266 INFO L85 PathProgramCache]: Analyzing trace with hash 1040897320, now seen corresponding path program 1 times [2023-11-26 10:48:46,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:48:46,267 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1893556819] [2023-11-26 10:48:46,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:48:46,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:48:46,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:48:46,345 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-26 10:48:46,346 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 10:48:46,346 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1893556819] [2023-11-26 10:48:46,349 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1893556819] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 10:48:46,350 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 10:48:46,350 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-26 10:48:46,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [397324387] [2023-11-26 10:48:46,350 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 10:48:46,351 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 10:48:46,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 10:48:46,352 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 10:48:46,352 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 10:48:46,369 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 81 out of 113 [2023-11-26 10:48:46,370 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-26 10:48:46,370 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 10:48:46,371 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 81 of 113 [2023-11-26 10:48:46,371 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 10:48:46,786 INFO L124 PetriNetUnfolderBase]: 272/1930 cut-off events. [2023-11-26 10:48:46,786 INFO L125 PetriNetUnfolderBase]: For 392/838 co-relation queries the response was YES. [2023-11-26 10:48:46,797 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-26 10:48:46,808 INFO L140 encePairwiseOnDemand]: 102/113 looper letters, 27 selfloop transitions, 8 changer transitions 0/119 dead transitions. [2023-11-26 10:48:46,809 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 119 transitions, 391 flow [2023-11-26 10:48:46,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 10:48:46,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-26 10:48:46,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 279 transitions. [2023-11-26 10:48:46,811 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8230088495575221 [2023-11-26 10:48:46,811 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 279 transitions. [2023-11-26 10:48:46,812 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 279 transitions. [2023-11-26 10:48:46,812 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 10:48:46,812 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 279 transitions. [2023-11-26 10:48:46,814 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-26 10:48:46,815 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-26 10:48:46,816 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-26 10:48:46,816 INFO L175 Difference]: Start difference. First operand has 105 places, 106 transitions, 276 flow. Second operand 3 states and 279 transitions. [2023-11-26 10:48:46,816 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 107 places, 119 transitions, 391 flow [2023-11-26 10:48:46,820 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 105 places, 119 transitions, 375 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-26 10:48:46,823 INFO L231 Difference]: Finished difference. Result has 107 places, 114 transitions, 334 flow [2023-11-26 10:48:46,824 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-26 10:48:46,824 INFO L281 CegarLoopForPetriNet]: 108 programPoint places, -1 predicate places. [2023-11-26 10:48:46,825 INFO L495 AbstractCegarLoop]: Abstraction has has 107 places, 114 transitions, 334 flow [2023-11-26 10:48:46,825 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-26 10:48:46,825 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 10:48:46,826 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-26 10:48:46,826 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-26 10:48:46,826 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [salethreadErr0ASSERT_VIOLATIONDATA_RACE, salethreadErr1ASSERT_VIOLATIONDATA_RACE, salethreadErr2ASSERT_VIOLATIONDATA_RACE (and 15 more)] === [2023-11-26 10:48:46,827 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:48:46,827 INFO L85 PathProgramCache]: Analyzing trace with hash -457973571, now seen corresponding path program 1 times [2023-11-26 10:48:46,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:48:46,828 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1268088611] [2023-11-26 10:48:46,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:48:46,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:48:46,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:48:46,936 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-26 10:48:46,937 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 10:48:46,937 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1268088611] [2023-11-26 10:48:46,937 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1268088611] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-26 10:48:46,938 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [127835359] [2023-11-26 10:48:46,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:48:46,938 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-26 10:48:46,939 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09ea1619-d265-4dc3-a61e-09f20be41985/bin/uautomizer-verify-VRDe98Ueme/z3 [2023-11-26 10:48:46,943 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09ea1619-d265-4dc3-a61e-09f20be41985/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-26 10:48:46,988 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09ea1619-d265-4dc3-a61e-09f20be41985/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-26 10:48:47,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:48:47,091 INFO L262 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-26 10:48:47,094 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-26 10:48:47,196 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-26 10:48:47,197 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-26 10:48:47,284 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-26 10:48:47,284 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [127835359] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-26 10:48:47,287 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-26 10:48:47,287 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2023-11-26 10:48:47,287 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [860262381] [2023-11-26 10:48:47,288 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-26 10:48:47,290 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-26 10:48:47,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 10:48:47,293 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-26 10:48:47,293 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2023-11-26 10:48:47,350 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 81 out of 113 [2023-11-26 10:48:47,351 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-26 10:48:47,351 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 10:48:47,352 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 81 of 113 [2023-11-26 10:48:47,352 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 10:48:47,609 INFO L124 PetriNetUnfolderBase]: 165/615 cut-off events. [2023-11-26 10:48:47,609 INFO L125 PetriNetUnfolderBase]: For 368/420 co-relation queries the response was YES. [2023-11-26 10:48:47,613 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-26 10:48:47,618 INFO L140 encePairwiseOnDemand]: 108/113 looper letters, 47 selfloop transitions, 7 changer transitions 0/112 dead transitions. [2023-11-26 10:48:47,618 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 112 transitions, 494 flow [2023-11-26 10:48:47,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-26 10:48:47,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-11-26 10:48:47,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 769 transitions. [2023-11-26 10:48:47,623 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7561455260570304 [2023-11-26 10:48:47,623 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 769 transitions. [2023-11-26 10:48:47,623 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 769 transitions. [2023-11-26 10:48:47,624 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 10:48:47,624 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 769 transitions. [2023-11-26 10:48:47,627 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-26 10:48:47,631 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-26 10:48:47,631 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-26 10:48:47,632 INFO L175 Difference]: Start difference. First operand has 107 places, 114 transitions, 334 flow. Second operand 9 states and 769 transitions. [2023-11-26 10:48:47,632 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 112 transitions, 494 flow [2023-11-26 10:48:47,638 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 112 transitions, 464 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-26 10:48:47,640 INFO L231 Difference]: Finished difference. Result has 81 places, 80 transitions, 246 flow [2023-11-26 10:48:47,641 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-26 10:48:47,642 INFO L281 CegarLoopForPetriNet]: 108 programPoint places, -27 predicate places. [2023-11-26 10:48:47,643 INFO L495 AbstractCegarLoop]: Abstraction has has 81 places, 80 transitions, 246 flow [2023-11-26 10:48:47,644 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-26 10:48:47,644 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 10:48:47,644 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-26 10:48:47,652 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09ea1619-d265-4dc3-a61e-09f20be41985/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-11-26 10:48:47,850 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09ea1619-d265-4dc3-a61e-09f20be41985/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-26 10:48:47,851 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-26 10:48:47,851 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:48:47,852 INFO L85 PathProgramCache]: Analyzing trace with hash 1772929582, now seen corresponding path program 1 times [2023-11-26 10:48:47,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:48:47,852 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [841853064] [2023-11-26 10:48:47,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:48:47,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:48:47,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-26 10:48:47,878 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-26 10:48:47,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-26 10:48:47,913 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-26 10:48:47,913 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-26 10:48:47,914 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (17 of 18 remaining) [2023-11-26 10:48:47,914 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr0ASSERT_VIOLATIONDATA_RACE (16 of 18 remaining) [2023-11-26 10:48:47,914 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr1ASSERT_VIOLATIONDATA_RACE (15 of 18 remaining) [2023-11-26 10:48:47,914 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr2ASSERT_VIOLATIONDATA_RACE (14 of 18 remaining) [2023-11-26 10:48:47,915 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr3ASSERT_VIOLATIONDATA_RACE (13 of 18 remaining) [2023-11-26 10:48:47,915 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (12 of 18 remaining) [2023-11-26 10:48:47,915 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (11 of 18 remaining) [2023-11-26 10:48:47,915 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (10 of 18 remaining) [2023-11-26 10:48:47,916 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (9 of 18 remaining) [2023-11-26 10:48:47,916 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (8 of 18 remaining) [2023-11-26 10:48:47,916 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr0ASSERT_VIOLATIONDATA_RACE (7 of 18 remaining) [2023-11-26 10:48:47,916 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr1ASSERT_VIOLATIONDATA_RACE (6 of 18 remaining) [2023-11-26 10:48:47,917 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr2ASSERT_VIOLATIONDATA_RACE (5 of 18 remaining) [2023-11-26 10:48:47,917 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr3ASSERT_VIOLATIONDATA_RACE (4 of 18 remaining) [2023-11-26 10:48:47,917 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr0ASSERT_VIOLATIONDATA_RACE (3 of 18 remaining) [2023-11-26 10:48:47,917 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr1ASSERT_VIOLATIONDATA_RACE (2 of 18 remaining) [2023-11-26 10:48:47,917 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr2ASSERT_VIOLATIONDATA_RACE (1 of 18 remaining) [2023-11-26 10:48:47,918 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr3ASSERT_VIOLATIONDATA_RACE (0 of 18 remaining) [2023-11-26 10:48:47,918 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-26 10:48:47,918 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2023-11-26 10:48:47,919 WARN L233 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2023-11-26 10:48:47,919 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2023-11-26 10:48:47,952 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2023-11-26 10:48:47,957 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 128 places, 134 transitions, 295 flow [2023-11-26 10:48:48,022 INFO L124 PetriNetUnfolderBase]: 42/418 cut-off events. [2023-11-26 10:48:48,023 INFO L125 PetriNetUnfolderBase]: For 19/19 co-relation queries the response was YES. [2023-11-26 10:48:48,027 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-26 10:48:48,027 INFO L82 GeneralOperation]: Start removeDead. Operand has 128 places, 134 transitions, 295 flow [2023-11-26 10:48:48,033 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 128 places, 134 transitions, 295 flow [2023-11-26 10:48:48,034 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-26 10:48:48,035 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;@3e2e7066, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-26 10:48:48,035 INFO L358 AbstractCegarLoop]: Starting to check reachability of 22 error locations. [2023-11-26 10:48:48,038 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-26 10:48:48,038 INFO L124 PetriNetUnfolderBase]: 0/15 cut-off events. [2023-11-26 10:48:48,038 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-26 10:48:48,038 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 10:48:48,038 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 10:48:48,039 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [salethreadErr0ASSERT_VIOLATIONDATA_RACE, salethreadErr1ASSERT_VIOLATIONDATA_RACE, salethreadErr2ASSERT_VIOLATIONDATA_RACE (and 19 more)] === [2023-11-26 10:48:48,039 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:48:48,039 INFO L85 PathProgramCache]: Analyzing trace with hash -1902783540, now seen corresponding path program 1 times [2023-11-26 10:48:48,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:48:48,040 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1276997572] [2023-11-26 10:48:48,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:48:48,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:48:48,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:48:48,056 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-26 10:48:48,056 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 10:48:48,057 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1276997572] [2023-11-26 10:48:48,057 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1276997572] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 10:48:48,057 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 10:48:48,057 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-26 10:48:48,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [869304870] [2023-11-26 10:48:48,058 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 10:48:48,058 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-26 10:48:48,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 10:48:48,059 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-26 10:48:48,059 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-26 10:48:48,059 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 134 [2023-11-26 10:48:48,060 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-26 10:48:48,060 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 10:48:48,060 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 134 [2023-11-26 10:48:48,060 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 10:48:48,184 INFO L124 PetriNetUnfolderBase]: 91/514 cut-off events. [2023-11-26 10:48:48,184 INFO L125 PetriNetUnfolderBase]: For 178/198 co-relation queries the response was YES. [2023-11-26 10:48:48,189 INFO L83 FinitePrefix]: Finished finitePrefix Result has 711 conditions, 514 events. 91/514 cut-off events. For 178/198 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-26 10:48:48,194 INFO L140 encePairwiseOnDemand]: 121/134 looper letters, 15 selfloop transitions, 0 changer transitions 0/118 dead transitions. [2023-11-26 10:48:48,194 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 118 transitions, 293 flow [2023-11-26 10:48:48,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-26 10:48:48,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-11-26 10:48:48,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 238 transitions. [2023-11-26 10:48:48,196 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8880597014925373 [2023-11-26 10:48:48,197 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 238 transitions. [2023-11-26 10:48:48,197 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 238 transitions. [2023-11-26 10:48:48,197 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 10:48:48,197 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 238 transitions. [2023-11-26 10:48:48,198 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-26 10:48:48,200 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-26 10:48:48,200 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-26 10:48:48,200 INFO L175 Difference]: Start difference. First operand has 128 places, 134 transitions, 295 flow. Second operand 2 states and 238 transitions. [2023-11-26 10:48:48,200 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 117 places, 118 transitions, 293 flow [2023-11-26 10:48:48,202 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 118 transitions, 293 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-26 10:48:48,205 INFO L231 Difference]: Finished difference. Result has 117 places, 118 transitions, 263 flow [2023-11-26 10:48:48,205 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-26 10:48:48,206 INFO L281 CegarLoopForPetriNet]: 128 programPoint places, -11 predicate places. [2023-11-26 10:48:48,206 INFO L495 AbstractCegarLoop]: Abstraction has has 117 places, 118 transitions, 263 flow [2023-11-26 10:48:48,207 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-26 10:48:48,207 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 10:48:48,207 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-26 10:48:48,207 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-26 10:48:48,208 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [salethreadErr0ASSERT_VIOLATIONDATA_RACE, salethreadErr1ASSERT_VIOLATIONDATA_RACE, salethreadErr2ASSERT_VIOLATIONDATA_RACE (and 19 more)] === [2023-11-26 10:48:48,208 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:48:48,208 INFO L85 PathProgramCache]: Analyzing trace with hash 1645649479, now seen corresponding path program 1 times [2023-11-26 10:48:48,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:48:48,208 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1871164104] [2023-11-26 10:48:48,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:48:48,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:48:48,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:48:48,249 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-26 10:48:48,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 10:48:48,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1871164104] [2023-11-26 10:48:48,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1871164104] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 10:48:48,250 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 10:48:48,250 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-26 10:48:48,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1879426917] [2023-11-26 10:48:48,250 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 10:48:48,251 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 10:48:48,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 10:48:48,251 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 10:48:48,252 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 10:48:48,264 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 134 [2023-11-26 10:48:48,265 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-26 10:48:48,265 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 10:48:48,265 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 134 [2023-11-26 10:48:48,265 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 10:48:48,554 INFO L124 PetriNetUnfolderBase]: 234/1288 cut-off events. [2023-11-26 10:48:48,554 INFO L125 PetriNetUnfolderBase]: For 136/136 co-relation queries the response was YES. [2023-11-26 10:48:48,563 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-26 10:48:48,573 INFO L140 encePairwiseOnDemand]: 131/134 looper letters, 22 selfloop transitions, 2 changer transitions 0/121 dead transitions. [2023-11-26 10:48:48,573 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 121 transitions, 317 flow [2023-11-26 10:48:48,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 10:48:48,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-26 10:48:48,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 322 transitions. [2023-11-26 10:48:48,575 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8009950248756219 [2023-11-26 10:48:48,575 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 322 transitions. [2023-11-26 10:48:48,576 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 322 transitions. [2023-11-26 10:48:48,576 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 10:48:48,576 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 322 transitions. [2023-11-26 10:48:48,577 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-26 10:48:48,578 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-26 10:48:48,579 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-26 10:48:48,579 INFO L175 Difference]: Start difference. First operand has 117 places, 118 transitions, 263 flow. Second operand 3 states and 322 transitions. [2023-11-26 10:48:48,579 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 121 transitions, 317 flow [2023-11-26 10:48:48,581 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 119 places, 121 transitions, 317 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-26 10:48:48,583 INFO L231 Difference]: Finished difference. Result has 120 places, 119 transitions, 275 flow [2023-11-26 10:48:48,584 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-26 10:48:48,584 INFO L281 CegarLoopForPetriNet]: 128 programPoint places, -8 predicate places. [2023-11-26 10:48:48,584 INFO L495 AbstractCegarLoop]: Abstraction has has 120 places, 119 transitions, 275 flow [2023-11-26 10:48:48,585 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-26 10:48:48,585 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 10:48:48,585 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-26 10:48:48,585 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-26 10:48:48,585 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting salethreadErr0ASSERT_VIOLATIONDATA_RACE === [salethreadErr0ASSERT_VIOLATIONDATA_RACE, salethreadErr1ASSERT_VIOLATIONDATA_RACE, salethreadErr2ASSERT_VIOLATIONDATA_RACE (and 19 more)] === [2023-11-26 10:48:48,586 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:48:48,586 INFO L85 PathProgramCache]: Analyzing trace with hash -1307333937, now seen corresponding path program 1 times [2023-11-26 10:48:48,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:48:48,586 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1316851174] [2023-11-26 10:48:48,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:48:48,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:48:48,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:48:48,614 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-26 10:48:48,614 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 10:48:48,614 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1316851174] [2023-11-26 10:48:48,614 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1316851174] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 10:48:48,615 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 10:48:48,615 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-26 10:48:48,615 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [678088791] [2023-11-26 10:48:48,615 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 10:48:48,616 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 10:48:48,616 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 10:48:48,616 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 10:48:48,617 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 10:48:48,626 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 134 [2023-11-26 10:48:48,626 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-26 10:48:48,627 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 10:48:48,627 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 134 [2023-11-26 10:48:48,627 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 10:48:49,403 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-26 10:48:49,404 INFO L294 olderBase$Statistics]: this new event has 92 ancestors and is cut-off event [2023-11-26 10:48:49,404 INFO L297 olderBase$Statistics]: existing Event has 64 ancestors and is cut-off event [2023-11-26 10:48:49,404 INFO L297 olderBase$Statistics]: existing Event has 58 ancestors and is cut-off event [2023-11-26 10:48:49,404 INFO L297 olderBase$Statistics]: existing Event has 86 ancestors and is cut-off event [2023-11-26 10:48:49,405 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-26 10:48:49,405 INFO L294 olderBase$Statistics]: this new event has 93 ancestors and is cut-off event [2023-11-26 10:48:49,405 INFO L297 olderBase$Statistics]: existing Event has 59 ancestors and is cut-off event [2023-11-26 10:48:49,405 INFO L297 olderBase$Statistics]: existing Event has 65 ancestors and is cut-off event [2023-11-26 10:48:49,406 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is cut-off event [2023-11-26 10:48:49,464 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-26 10:48:49,465 INFO L294 olderBase$Statistics]: this new event has 93 ancestors and is cut-off event [2023-11-26 10:48:49,465 INFO L297 olderBase$Statistics]: existing Event has 99 ancestors and is cut-off event [2023-11-26 10:48:49,465 INFO L297 olderBase$Statistics]: existing Event has 71 ancestors and is cut-off event [2023-11-26 10:48:49,465 INFO L297 olderBase$Statistics]: existing Event has 65 ancestors and is cut-off event [2023-11-26 10:48:49,529 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-26 10:48:49,530 INFO L294 olderBase$Statistics]: this new event has 99 ancestors and is cut-off event [2023-11-26 10:48:49,530 INFO L297 olderBase$Statistics]: existing Event has 93 ancestors and is cut-off event [2023-11-26 10:48:49,530 INFO L297 olderBase$Statistics]: existing Event has 65 ancestors and is cut-off event [2023-11-26 10:48:49,530 INFO L297 olderBase$Statistics]: existing Event has 71 ancestors and is cut-off event [2023-11-26 10:48:49,567 INFO L124 PetriNetUnfolderBase]: 724/4772 cut-off events. [2023-11-26 10:48:49,567 INFO L125 PetriNetUnfolderBase]: For 1376/3596 co-relation queries the response was YES. [2023-11-26 10:48:49,639 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-26 10:48:49,679 INFO L140 encePairwiseOnDemand]: 122/134 looper letters, 32 selfloop transitions, 9 changer transitions 0/136 dead transitions. [2023-11-26 10:48:49,680 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 136 transitions, 412 flow [2023-11-26 10:48:49,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 10:48:49,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-26 10:48:49,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 332 transitions. [2023-11-26 10:48:49,682 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8258706467661692 [2023-11-26 10:48:49,682 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 332 transitions. [2023-11-26 10:48:49,682 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 332 transitions. [2023-11-26 10:48:49,683 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 10:48:49,683 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 332 transitions. [2023-11-26 10:48:49,684 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-26 10:48:49,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-26 10:48:49,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-26 10:48:49,686 INFO L175 Difference]: Start difference. First operand has 120 places, 119 transitions, 275 flow. Second operand 3 states and 332 transitions. [2023-11-26 10:48:49,686 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 122 places, 136 transitions, 412 flow [2023-11-26 10:48:49,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-26 10:48:49,691 INFO L231 Difference]: Finished difference. Result has 123 places, 128 transitions, 351 flow [2023-11-26 10:48:49,692 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-26 10:48:49,693 INFO L281 CegarLoopForPetriNet]: 128 programPoint places, -5 predicate places. [2023-11-26 10:48:49,693 INFO L495 AbstractCegarLoop]: Abstraction has has 123 places, 128 transitions, 351 flow [2023-11-26 10:48:49,694 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-26 10:48:49,694 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 10:48:49,694 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-26 10:48:49,694 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-26 10:48:49,694 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting salethreadErr1ASSERT_VIOLATIONDATA_RACE === [salethreadErr0ASSERT_VIOLATIONDATA_RACE, salethreadErr1ASSERT_VIOLATIONDATA_RACE, salethreadErr2ASSERT_VIOLATIONDATA_RACE (and 19 more)] === [2023-11-26 10:48:49,695 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:48:49,695 INFO L85 PathProgramCache]: Analyzing trace with hash -21298053, now seen corresponding path program 1 times [2023-11-26 10:48:49,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:48:49,695 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1789972105] [2023-11-26 10:48:49,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:48:49,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:48:49,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:48:49,734 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-26 10:48:49,734 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 10:48:49,734 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1789972105] [2023-11-26 10:48:49,734 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1789972105] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 10:48:49,735 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 10:48:49,735 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-26 10:48:49,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1433639505] [2023-11-26 10:48:49,737 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 10:48:49,738 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 10:48:49,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 10:48:49,739 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 10:48:49,739 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 10:48:49,755 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 134 [2023-11-26 10:48:49,755 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-26 10:48:49,756 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 10:48:49,756 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 134 [2023-11-26 10:48:49,756 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 10:48:52,264 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-26 10:48:52,265 INFO L294 olderBase$Statistics]: this new event has 90 ancestors and is cut-off event [2023-11-26 10:48:52,265 INFO L297 olderBase$Statistics]: existing Event has 62 ancestors and is cut-off event [2023-11-26 10:48:52,265 INFO L297 olderBase$Statistics]: existing Event has 96 ancestors and is cut-off event [2023-11-26 10:48:52,266 INFO L297 olderBase$Statistics]: existing Event has 68 ancestors and is cut-off event [2023-11-26 10:48:52,266 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-26 10:48:52,266 INFO L294 olderBase$Statistics]: this new event has 89 ancestors and is cut-off event [2023-11-26 10:48:52,266 INFO L297 olderBase$Statistics]: existing Event has 61 ancestors and is cut-off event [2023-11-26 10:48:52,266 INFO L297 olderBase$Statistics]: existing Event has 95 ancestors and is cut-off event [2023-11-26 10:48:52,267 INFO L297 olderBase$Statistics]: existing Event has 67 ancestors and is cut-off event [2023-11-26 10:48:52,267 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-26 10:48:52,267 INFO L294 olderBase$Statistics]: this new event has 93 ancestors and is cut-off event [2023-11-26 10:48:52,267 INFO L297 olderBase$Statistics]: existing Event has 65 ancestors and is cut-off event [2023-11-26 10:48:52,267 INFO L297 olderBase$Statistics]: existing Event has 99 ancestors and is cut-off event [2023-11-26 10:48:52,267 INFO L297 olderBase$Statistics]: existing Event has 71 ancestors and is cut-off event [2023-11-26 10:48:52,268 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-26 10:48:52,268 INFO L294 olderBase$Statistics]: this new event has 93 ancestors and is cut-off event [2023-11-26 10:48:52,268 INFO L297 olderBase$Statistics]: existing Event has 71 ancestors and is cut-off event [2023-11-26 10:48:52,269 INFO L297 olderBase$Statistics]: existing Event has 65 ancestors and is cut-off event [2023-11-26 10:48:52,269 INFO L297 olderBase$Statistics]: existing Event has 99 ancestors and is cut-off event [2023-11-26 10:48:52,305 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-26 10:48:52,305 INFO L294 olderBase$Statistics]: this new event has 88 ancestors and is cut-off event [2023-11-26 10:48:52,305 INFO L297 olderBase$Statistics]: existing Event has 60 ancestors and is cut-off event [2023-11-26 10:48:52,305 INFO L297 olderBase$Statistics]: existing Event has 60 ancestors and is cut-off event [2023-11-26 10:48:52,305 INFO L297 olderBase$Statistics]: existing Event has 60 ancestors and is cut-off event [2023-11-26 10:48:52,323 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-26 10:48:52,323 INFO L294 olderBase$Statistics]: this new event has 89 ancestors and is cut-off event [2023-11-26 10:48:52,323 INFO L297 olderBase$Statistics]: existing Event has 55 ancestors and is cut-off event [2023-11-26 10:48:52,323 INFO L297 olderBase$Statistics]: existing Event has 55 ancestors and is cut-off event [2023-11-26 10:48:52,323 INFO L297 olderBase$Statistics]: existing Event has 83 ancestors and is cut-off event [2023-11-26 10:48:52,373 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-26 10:48:52,374 INFO L294 olderBase$Statistics]: this new event has 99 ancestors and is cut-off event [2023-11-26 10:48:52,374 INFO L297 olderBase$Statistics]: existing Event has 71 ancestors and is cut-off event [2023-11-26 10:48:52,374 INFO L297 olderBase$Statistics]: existing Event has 65 ancestors and is cut-off event [2023-11-26 10:48:52,374 INFO L297 olderBase$Statistics]: existing Event has 93 ancestors and is cut-off event [2023-11-26 10:48:52,374 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-26 10:48:52,375 INFO L294 olderBase$Statistics]: this new event has 99 ancestors and is cut-off event [2023-11-26 10:48:52,375 INFO L297 olderBase$Statistics]: existing Event has 65 ancestors and is cut-off event [2023-11-26 10:48:52,375 INFO L297 olderBase$Statistics]: existing Event has 71 ancestors and is cut-off event [2023-11-26 10:48:52,375 INFO L297 olderBase$Statistics]: existing Event has 93 ancestors and is cut-off event [2023-11-26 10:48:52,474 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-26 10:48:52,474 INFO L294 olderBase$Statistics]: this new event has 90 ancestors and is cut-off event [2023-11-26 10:48:52,474 INFO L297 olderBase$Statistics]: existing Event has 56 ancestors and is cut-off event [2023-11-26 10:48:52,474 INFO L297 olderBase$Statistics]: existing Event has 84 ancestors and is cut-off event [2023-11-26 10:48:52,475 INFO L297 olderBase$Statistics]: existing Event has 56 ancestors and is cut-off event [2023-11-26 10:48:52,475 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-26 10:48:52,475 INFO L294 olderBase$Statistics]: this new event has 91 ancestors and is cut-off event [2023-11-26 10:48:52,475 INFO L297 olderBase$Statistics]: existing Event has 85 ancestors and is cut-off event [2023-11-26 10:48:52,475 INFO L297 olderBase$Statistics]: existing Event has 57 ancestors and is cut-off event [2023-11-26 10:48:52,475 INFO L297 olderBase$Statistics]: existing Event has 57 ancestors and is cut-off event [2023-11-26 10:48:52,483 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-26 10:48:52,483 INFO L294 olderBase$Statistics]: this new event has 90 ancestors and is cut-off event [2023-11-26 10:48:52,483 INFO L297 olderBase$Statistics]: existing Event has 84 ancestors and is cut-off event [2023-11-26 10:48:52,483 INFO L297 olderBase$Statistics]: existing Event has 56 ancestors and is cut-off event [2023-11-26 10:48:52,483 INFO L297 olderBase$Statistics]: existing Event has 56 ancestors and is cut-off event [2023-11-26 10:48:52,543 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-26 10:48:52,544 INFO L294 olderBase$Statistics]: this new event has 91 ancestors and is cut-off event [2023-11-26 10:48:52,544 INFO L297 olderBase$Statistics]: existing Event has 57 ancestors and is cut-off event [2023-11-26 10:48:52,544 INFO L297 olderBase$Statistics]: existing Event has 85 ancestors and is cut-off event [2023-11-26 10:48:52,544 INFO L297 olderBase$Statistics]: existing Event has 57 ancestors and is cut-off event [2023-11-26 10:48:52,544 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-26 10:48:52,544 INFO L294 olderBase$Statistics]: this new event has 92 ancestors and is cut-off event [2023-11-26 10:48:52,545 INFO L297 olderBase$Statistics]: existing Event has 86 ancestors and is cut-off event [2023-11-26 10:48:52,545 INFO L297 olderBase$Statistics]: existing Event has 58 ancestors and is cut-off event [2023-11-26 10:48:52,545 INFO L297 olderBase$Statistics]: existing Event has 58 ancestors and is cut-off event [2023-11-26 10:48:52,585 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-26 10:48:52,586 INFO L294 olderBase$Statistics]: this new event has 95 ancestors and is cut-off event [2023-11-26 10:48:52,586 INFO L297 olderBase$Statistics]: existing Event has 61 ancestors and is cut-off event [2023-11-26 10:48:52,586 INFO L297 olderBase$Statistics]: existing Event has 95 ancestors and is cut-off event [2023-11-26 10:48:52,586 INFO L297 olderBase$Statistics]: existing Event has 67 ancestors and is cut-off event [2023-11-26 10:48:52,586 INFO L297 olderBase$Statistics]: existing Event has 89 ancestors and is cut-off event [2023-11-26 10:48:52,653 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-26 10:48:52,654 INFO L294 olderBase$Statistics]: this new event has 96 ancestors and is cut-off event [2023-11-26 10:48:52,654 INFO L297 olderBase$Statistics]: existing Event has 62 ancestors and is cut-off event [2023-11-26 10:48:52,654 INFO L297 olderBase$Statistics]: existing Event has 96 ancestors and is cut-off event [2023-11-26 10:48:52,654 INFO L297 olderBase$Statistics]: existing Event has 90 ancestors and is cut-off event [2023-11-26 10:48:52,654 INFO L297 olderBase$Statistics]: existing Event has 68 ancestors and is cut-off event [2023-11-26 10:48:52,675 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-26 10:48:52,675 INFO L294 olderBase$Statistics]: this new event has 93 ancestors and is cut-off event [2023-11-26 10:48:52,675 INFO L297 olderBase$Statistics]: existing Event has 59 ancestors and is cut-off event [2023-11-26 10:48:52,675 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is cut-off event [2023-11-26 10:48:52,676 INFO L297 olderBase$Statistics]: existing Event has 59 ancestors and is cut-off event [2023-11-26 10:48:52,727 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-26 10:48:52,728 INFO L294 olderBase$Statistics]: this new event has 94 ancestors and is cut-off event [2023-11-26 10:48:52,728 INFO L297 olderBase$Statistics]: existing Event has 60 ancestors and is cut-off event [2023-11-26 10:48:52,728 INFO L297 olderBase$Statistics]: existing Event has 88 ancestors and is cut-off event [2023-11-26 10:48:52,728 INFO L297 olderBase$Statistics]: existing Event has 60 ancestors and is cut-off event [2023-11-26 10:48:52,731 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-26 10:48:52,732 INFO L294 olderBase$Statistics]: this new event has 94 ancestors and is cut-off event [2023-11-26 10:48:52,732 INFO L297 olderBase$Statistics]: existing Event has 60 ancestors and is cut-off event [2023-11-26 10:48:52,732 INFO L297 olderBase$Statistics]: existing Event has 88 ancestors and is cut-off event [2023-11-26 10:48:52,732 INFO L297 olderBase$Statistics]: existing Event has 60 ancestors and is cut-off event [2023-11-26 10:48:52,738 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-26 10:48:52,738 INFO L294 olderBase$Statistics]: this new event has 99 ancestors and is cut-off event [2023-11-26 10:48:52,738 INFO L297 olderBase$Statistics]: existing Event has 65 ancestors and is cut-off event [2023-11-26 10:48:52,739 INFO L297 olderBase$Statistics]: existing Event has 71 ancestors and is cut-off event [2023-11-26 10:48:52,739 INFO L297 olderBase$Statistics]: existing Event has 93 ancestors and is cut-off event [2023-11-26 10:48:52,739 INFO L297 olderBase$Statistics]: existing Event has 99 ancestors and is cut-off event [2023-11-26 10:48:52,746 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-26 10:48:52,746 INFO L294 olderBase$Statistics]: this new event has 95 ancestors and is cut-off event [2023-11-26 10:48:52,746 INFO L297 olderBase$Statistics]: existing Event has 95 ancestors and is cut-off event [2023-11-26 10:48:52,746 INFO L297 olderBase$Statistics]: existing Event has 89 ancestors and is cut-off event [2023-11-26 10:48:52,746 INFO L297 olderBase$Statistics]: existing Event has 61 ancestors and is cut-off event [2023-11-26 10:48:52,759 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-26 10:48:52,759 INFO L294 olderBase$Statistics]: this new event has 95 ancestors and is cut-off event [2023-11-26 10:48:52,759 INFO L297 olderBase$Statistics]: existing Event has 89 ancestors and is cut-off event [2023-11-26 10:48:52,759 INFO L297 olderBase$Statistics]: existing Event has 89 ancestors and is cut-off event [2023-11-26 10:48:52,759 INFO L297 olderBase$Statistics]: existing Event has 95 ancestors and is cut-off event [2023-11-26 10:48:52,786 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-26 10:48:52,786 INFO L294 olderBase$Statistics]: this new event has 99 ancestors and is cut-off event [2023-11-26 10:48:52,786 INFO L297 olderBase$Statistics]: existing Event has 93 ancestors and is cut-off event [2023-11-26 10:48:52,786 INFO L297 olderBase$Statistics]: existing Event has 99 ancestors and is cut-off event [2023-11-26 10:48:52,786 INFO L297 olderBase$Statistics]: existing Event has 93 ancestors and is cut-off event [2023-11-26 10:48:52,805 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-26 10:48:52,805 INFO L294 olderBase$Statistics]: this new event has 96 ancestors and is cut-off event [2023-11-26 10:48:52,805 INFO L297 olderBase$Statistics]: existing Event has 96 ancestors and is cut-off event [2023-11-26 10:48:52,805 INFO L297 olderBase$Statistics]: existing Event has 62 ancestors and is cut-off event [2023-11-26 10:48:52,805 INFO L297 olderBase$Statistics]: existing Event has 90 ancestors and is cut-off event [2023-11-26 10:48:52,821 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-26 10:48:52,822 INFO L294 olderBase$Statistics]: this new event has 96 ancestors and is cut-off event [2023-11-26 10:48:52,822 INFO L297 olderBase$Statistics]: existing Event has 90 ancestors and is cut-off event [2023-11-26 10:48:52,822 INFO L297 olderBase$Statistics]: existing Event has 90 ancestors and is cut-off event [2023-11-26 10:48:52,822 INFO L297 olderBase$Statistics]: existing Event has 96 ancestors and is cut-off event [2023-11-26 10:48:53,151 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-26 10:48:53,152 INFO L294 olderBase$Statistics]: this new event has 114 ancestors and is cut-off event [2023-11-26 10:48:53,152 INFO L297 olderBase$Statistics]: existing Event has 80 ancestors and is cut-off event [2023-11-26 10:48:53,152 INFO L297 olderBase$Statistics]: existing Event has 74 ancestors and is cut-off event [2023-11-26 10:48:53,152 INFO L297 olderBase$Statistics]: existing Event has 102 ancestors and is cut-off event [2023-11-26 10:48:53,168 INFO L124 PetriNetUnfolderBase]: 4754/19531 cut-off events. [2023-11-26 10:48:53,168 INFO L125 PetriNetUnfolderBase]: For 6179/14413 co-relation queries the response was YES. [2023-11-26 10:48:53,265 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-26 10:48:53,353 INFO L140 encePairwiseOnDemand]: 119/134 looper letters, 41 selfloop transitions, 11 changer transitions 0/150 dead transitions. [2023-11-26 10:48:53,353 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 125 places, 150 transitions, 538 flow [2023-11-26 10:48:53,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 10:48:53,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-26 10:48:53,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 329 transitions. [2023-11-26 10:48:53,355 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.818407960199005 [2023-11-26 10:48:53,356 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 329 transitions. [2023-11-26 10:48:53,356 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 329 transitions. [2023-11-26 10:48:53,356 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 10:48:53,356 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 329 transitions. [2023-11-26 10:48:53,358 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-26 10:48:53,359 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-26 10:48:53,360 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-26 10:48:53,360 INFO L175 Difference]: Start difference. First operand has 123 places, 128 transitions, 351 flow. Second operand 3 states and 329 transitions. [2023-11-26 10:48:53,360 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 125 places, 150 transitions, 538 flow [2023-11-26 10:48:53,376 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 123 places, 150 transitions, 514 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-26 10:48:53,379 INFO L231 Difference]: Finished difference. Result has 125 places, 139 transitions, 429 flow [2023-11-26 10:48:53,380 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-26 10:48:53,380 INFO L281 CegarLoopForPetriNet]: 128 programPoint places, -3 predicate places. [2023-11-26 10:48:53,380 INFO L495 AbstractCegarLoop]: Abstraction has has 125 places, 139 transitions, 429 flow [2023-11-26 10:48:53,381 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-26 10:48:53,381 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 10:48:53,381 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-26 10:48:53,381 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-11-26 10:48:53,382 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [salethreadErr0ASSERT_VIOLATIONDATA_RACE, salethreadErr1ASSERT_VIOLATIONDATA_RACE, salethreadErr2ASSERT_VIOLATIONDATA_RACE (and 19 more)] === [2023-11-26 10:48:53,382 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:48:53,382 INFO L85 PathProgramCache]: Analyzing trace with hash 1810559632, now seen corresponding path program 1 times [2023-11-26 10:48:53,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:48:53,383 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1666447282] [2023-11-26 10:48:53,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:48:53,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:48:53,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:48:53,501 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-26 10:48:53,501 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 10:48:53,502 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1666447282] [2023-11-26 10:48:53,502 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1666447282] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-26 10:48:53,502 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1095970899] [2023-11-26 10:48:53,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:48:53,502 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-26 10:48:53,502 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09ea1619-d265-4dc3-a61e-09f20be41985/bin/uautomizer-verify-VRDe98Ueme/z3 [2023-11-26 10:48:53,504 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09ea1619-d265-4dc3-a61e-09f20be41985/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-26 10:48:53,521 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09ea1619-d265-4dc3-a61e-09f20be41985/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-26 10:48:53,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:48:53,602 INFO L262 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-26 10:48:53,606 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-26 10:48:53,650 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-26 10:48:53,650 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-26 10:48:53,699 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-26 10:48:53,699 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1095970899] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-26 10:48:53,699 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-26 10:48:53,699 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2023-11-26 10:48:53,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [696068817] [2023-11-26 10:48:53,700 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-26 10:48:53,701 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-26 10:48:53,703 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 10:48:53,703 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-26 10:48:53,703 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2023-11-26 10:48:53,728 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 134 [2023-11-26 10:48:53,729 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-26 10:48:53,729 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 10:48:53,730 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 134 [2023-11-26 10:48:53,730 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 10:48:57,940 INFO L124 PetriNetUnfolderBase]: 6843/29541 cut-off events. [2023-11-26 10:48:57,941 INFO L125 PetriNetUnfolderBase]: For 11830/14504 co-relation queries the response was YES. [2023-11-26 10:48:58,076 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-26 10:48:58,303 INFO L140 encePairwiseOnDemand]: 128/134 looper letters, 72 selfloop transitions, 9 changer transitions 0/189 dead transitions. [2023-11-26 10:48:58,303 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 133 places, 189 transitions, 801 flow [2023-11-26 10:48:58,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-26 10:48:58,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-11-26 10:48:58,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 923 transitions. [2023-11-26 10:48:58,308 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7653399668325042 [2023-11-26 10:48:58,309 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 923 transitions. [2023-11-26 10:48:58,309 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 923 transitions. [2023-11-26 10:48:58,310 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 10:48:58,310 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 923 transitions. [2023-11-26 10:48:58,314 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-26 10:48:58,318 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-26 10:48:58,319 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-26 10:48:58,319 INFO L175 Difference]: Start difference. First operand has 125 places, 139 transitions, 429 flow. Second operand 9 states and 923 transitions. [2023-11-26 10:48:58,319 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 133 places, 189 transitions, 801 flow [2023-11-26 10:48:58,466 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 131 places, 189 transitions, 755 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-26 10:48:58,470 INFO L231 Difference]: Finished difference. Result has 134 places, 145 transitions, 457 flow [2023-11-26 10:48:58,471 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-26 10:48:58,472 INFO L281 CegarLoopForPetriNet]: 128 programPoint places, 6 predicate places. [2023-11-26 10:48:58,472 INFO L495 AbstractCegarLoop]: Abstraction has has 134 places, 145 transitions, 457 flow [2023-11-26 10:48:58,473 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-26 10:48:58,473 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 10:48:58,473 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-26 10:48:58,484 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09ea1619-d265-4dc3-a61e-09f20be41985/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-11-26 10:48:58,679 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09ea1619-d265-4dc3-a61e-09f20be41985/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-26 10:48:58,680 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting salethreadErr0ASSERT_VIOLATIONDATA_RACE === [salethreadErr0ASSERT_VIOLATIONDATA_RACE, salethreadErr1ASSERT_VIOLATIONDATA_RACE, salethreadErr2ASSERT_VIOLATIONDATA_RACE (and 19 more)] === [2023-11-26 10:48:58,680 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:48:58,680 INFO L85 PathProgramCache]: Analyzing trace with hash 1744744612, now seen corresponding path program 1 times [2023-11-26 10:48:58,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:48:58,680 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1689585369] [2023-11-26 10:48:58,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:48:58,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:48:58,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:48:58,820 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-26 10:48:58,820 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 10:48:58,820 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1689585369] [2023-11-26 10:48:58,821 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1689585369] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 10:48:58,821 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 10:48:58,821 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-26 10:48:58,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [957111198] [2023-11-26 10:48:58,821 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 10:48:58,822 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-26 10:48:58,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 10:48:58,823 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-26 10:48:58,823 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-26 10:48:58,835 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 134 [2023-11-26 10:48:58,836 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-26 10:48:58,836 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 10:48:58,836 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 134 [2023-11-26 10:48:58,837 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 10:49:02,317 INFO L124 PetriNetUnfolderBase]: 5075/27838 cut-off events. [2023-11-26 10:49:02,317 INFO L125 PetriNetUnfolderBase]: For 5599/9439 co-relation queries the response was YES. [2023-11-26 10:49:02,500 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-26 10:49:02,636 INFO L140 encePairwiseOnDemand]: 127/134 looper letters, 55 selfloop transitions, 8 changer transitions 0/183 dead transitions. [2023-11-26 10:49:02,636 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 138 places, 183 transitions, 762 flow [2023-11-26 10:49:02,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-26 10:49:02,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-26 10:49:02,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 555 transitions. [2023-11-26 10:49:02,653 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8283582089552238 [2023-11-26 10:49:02,653 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 555 transitions. [2023-11-26 10:49:02,653 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 555 transitions. [2023-11-26 10:49:02,654 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 10:49:02,654 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 555 transitions. [2023-11-26 10:49:02,656 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-26 10:49:02,659 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-26 10:49:02,659 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-26 10:49:02,660 INFO L175 Difference]: Start difference. First operand has 134 places, 145 transitions, 457 flow. Second operand 5 states and 555 transitions. [2023-11-26 10:49:02,660 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 138 places, 183 transitions, 762 flow [2023-11-26 10:49:02,666 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 137 places, 183 transitions, 756 flow, removed 2 selfloop flow, removed 1 redundant places. [2023-11-26 10:49:02,672 INFO L231 Difference]: Finished difference. Result has 140 places, 152 transitions, 521 flow [2023-11-26 10:49:02,673 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-26 10:49:02,674 INFO L281 CegarLoopForPetriNet]: 128 programPoint places, 12 predicate places. [2023-11-26 10:49:02,675 INFO L495 AbstractCegarLoop]: Abstraction has has 140 places, 152 transitions, 521 flow [2023-11-26 10:49:02,675 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-26 10:49:02,675 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 10:49:02,676 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-26 10:49:02,676 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-11-26 10:49:02,676 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting salethreadErr0ASSERT_VIOLATIONDATA_RACE === [salethreadErr0ASSERT_VIOLATIONDATA_RACE, salethreadErr1ASSERT_VIOLATIONDATA_RACE, salethreadErr2ASSERT_VIOLATIONDATA_RACE (and 19 more)] === [2023-11-26 10:49:02,677 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:49:02,677 INFO L85 PathProgramCache]: Analyzing trace with hash -547111440, now seen corresponding path program 1 times [2023-11-26 10:49:02,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:49:02,677 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1654955025] [2023-11-26 10:49:02,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:49:02,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:49:02,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:49:02,852 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-26 10:49:02,852 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 10:49:02,852 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1654955025] [2023-11-26 10:49:02,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1654955025] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 10:49:02,853 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 10:49:02,853 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-26 10:49:02,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [742756139] [2023-11-26 10:49:02,854 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 10:49:02,854 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-26 10:49:02,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 10:49:02,855 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-26 10:49:02,856 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-26 10:49:02,870 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 134 [2023-11-26 10:49:02,871 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-26 10:49:02,871 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 10:49:02,871 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 134 [2023-11-26 10:49:02,871 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 10:49:05,857 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-26 10:49:05,857 INFO L294 olderBase$Statistics]: this new event has 99 ancestors and is cut-off event [2023-11-26 10:49:05,857 INFO L297 olderBase$Statistics]: existing Event has 99 ancestors and is cut-off event [2023-11-26 10:49:05,857 INFO L297 olderBase$Statistics]: existing Event has 99 ancestors and is cut-off event [2023-11-26 10:49:05,858 INFO L297 olderBase$Statistics]: existing Event has 93 ancestors and is cut-off event [2023-11-26 10:49:06,123 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-26 10:49:06,123 INFO L294 olderBase$Statistics]: this new event has 99 ancestors and is cut-off event [2023-11-26 10:49:06,123 INFO L297 olderBase$Statistics]: existing Event has 93 ancestors and is cut-off event [2023-11-26 10:49:06,123 INFO L297 olderBase$Statistics]: existing Event has 99 ancestors and is cut-off event [2023-11-26 10:49:06,123 INFO L297 olderBase$Statistics]: existing Event has 93 ancestors and is cut-off event [2023-11-26 10:49:06,176 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-26 10:49:06,176 INFO L294 olderBase$Statistics]: this new event has 100 ancestors and is cut-off event [2023-11-26 10:49:06,176 INFO L297 olderBase$Statistics]: existing Event has 94 ancestors and is cut-off event [2023-11-26 10:49:06,176 INFO L297 olderBase$Statistics]: existing Event has 100 ancestors and is cut-off event [2023-11-26 10:49:06,176 INFO L297 olderBase$Statistics]: existing Event has 100 ancestors and is cut-off event [2023-11-26 10:49:06,208 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-26 10:49:06,208 INFO L294 olderBase$Statistics]: this new event has 100 ancestors and is cut-off event [2023-11-26 10:49:06,208 INFO L297 olderBase$Statistics]: existing Event has 94 ancestors and is cut-off event [2023-11-26 10:49:06,208 INFO L297 olderBase$Statistics]: existing Event has 100 ancestors and is cut-off event [2023-11-26 10:49:06,209 INFO L297 olderBase$Statistics]: existing Event has 94 ancestors and is cut-off event [2023-11-26 10:49:06,750 INFO L124 PetriNetUnfolderBase]: 5072/28011 cut-off events. [2023-11-26 10:49:06,750 INFO L125 PetriNetUnfolderBase]: For 11635/15435 co-relation queries the response was YES. [2023-11-26 10:49:06,942 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-26 10:49:07,055 INFO L140 encePairwiseOnDemand]: 127/134 looper letters, 47 selfloop transitions, 11 changer transitions 0/180 dead transitions. [2023-11-26 10:49:07,055 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 144 places, 180 transitions, 791 flow [2023-11-26 10:49:07,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-26 10:49:07,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-26 10:49:07,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 551 transitions. [2023-11-26 10:49:07,060 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8223880597014925 [2023-11-26 10:49:07,062 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 551 transitions. [2023-11-26 10:49:07,062 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 551 transitions. [2023-11-26 10:49:07,063 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 10:49:07,063 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 551 transitions. [2023-11-26 10:49:07,066 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-26 10:49:07,068 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-26 10:49:07,069 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-26 10:49:07,069 INFO L175 Difference]: Start difference. First operand has 140 places, 152 transitions, 521 flow. Second operand 5 states and 551 transitions. [2023-11-26 10:49:07,069 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 144 places, 180 transitions, 791 flow [2023-11-26 10:49:07,084 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 143 places, 180 transitions, 786 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-26 10:49:07,088 INFO L231 Difference]: Finished difference. Result has 146 places, 157 transitions, 590 flow [2023-11-26 10:49:07,088 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-26 10:49:07,089 INFO L281 CegarLoopForPetriNet]: 128 programPoint places, 18 predicate places. [2023-11-26 10:49:07,089 INFO L495 AbstractCegarLoop]: Abstraction has has 146 places, 157 transitions, 590 flow [2023-11-26 10:49:07,090 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-26 10:49:07,090 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 10:49:07,090 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-26 10:49:07,090 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-11-26 10:49:07,090 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting salethreadErr1ASSERT_VIOLATIONDATA_RACE === [salethreadErr0ASSERT_VIOLATIONDATA_RACE, salethreadErr1ASSERT_VIOLATIONDATA_RACE, salethreadErr2ASSERT_VIOLATIONDATA_RACE (and 19 more)] === [2023-11-26 10:49:07,091 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:49:07,091 INFO L85 PathProgramCache]: Analyzing trace with hash 758635425, now seen corresponding path program 1 times [2023-11-26 10:49:07,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:49:07,091 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [647494074] [2023-11-26 10:49:07,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:49:07,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:49:07,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-26 10:49:07,115 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-26 10:49:07,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-26 10:49:07,150 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-26 10:49:07,150 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-26 10:49:07,150 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location salethreadErr1ASSERT_VIOLATIONDATA_RACE (21 of 22 remaining) [2023-11-26 10:49:07,151 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr0ASSERT_VIOLATIONDATA_RACE (20 of 22 remaining) [2023-11-26 10:49:07,151 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr1ASSERT_VIOLATIONDATA_RACE (19 of 22 remaining) [2023-11-26 10:49:07,151 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr2ASSERT_VIOLATIONDATA_RACE (18 of 22 remaining) [2023-11-26 10:49:07,151 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr3ASSERT_VIOLATIONDATA_RACE (17 of 22 remaining) [2023-11-26 10:49:07,151 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (16 of 22 remaining) [2023-11-26 10:49:07,152 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (15 of 22 remaining) [2023-11-26 10:49:07,152 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (14 of 22 remaining) [2023-11-26 10:49:07,152 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (13 of 22 remaining) [2023-11-26 10:49:07,152 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (12 of 22 remaining) [2023-11-26 10:49:07,152 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (11 of 22 remaining) [2023-11-26 10:49:07,153 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr0ASSERT_VIOLATIONDATA_RACE (10 of 22 remaining) [2023-11-26 10:49:07,153 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr2ASSERT_VIOLATIONDATA_RACE (9 of 22 remaining) [2023-11-26 10:49:07,153 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr3ASSERT_VIOLATIONDATA_RACE (8 of 22 remaining) [2023-11-26 10:49:07,153 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr0ASSERT_VIOLATIONDATA_RACE (7 of 22 remaining) [2023-11-26 10:49:07,153 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr1ASSERT_VIOLATIONDATA_RACE (6 of 22 remaining) [2023-11-26 10:49:07,153 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr2ASSERT_VIOLATIONDATA_RACE (5 of 22 remaining) [2023-11-26 10:49:07,154 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr3ASSERT_VIOLATIONDATA_RACE (4 of 22 remaining) [2023-11-26 10:49:07,154 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr0ASSERT_VIOLATIONDATA_RACE (3 of 22 remaining) [2023-11-26 10:49:07,154 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr1ASSERT_VIOLATIONDATA_RACE (2 of 22 remaining) [2023-11-26 10:49:07,154 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr2ASSERT_VIOLATIONDATA_RACE (1 of 22 remaining) [2023-11-26 10:49:07,154 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr3ASSERT_VIOLATIONDATA_RACE (0 of 22 remaining) [2023-11-26 10:49:07,155 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-11-26 10:49:07,155 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 10:49:07,160 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 3 thread instances [2023-11-26 10:49:07,161 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-26 10:49:07,232 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated [2023-11-26 10:49:07,235 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated [2023-11-26 10:49:07,255 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.11 10:49:07 BasicIcfg [2023-11-26 10:49:07,256 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-26 10:49:07,257 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-26 10:49:07,257 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-26 10:49:07,257 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-26 10:49:07,257 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 10:48:43" (3/4) ... [2023-11-26 10:49:07,259 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-11-26 10:49:07,261 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-26 10:49:07,261 INFO L158 Benchmark]: Toolchain (without parser) took 25131.97ms. Allocated memory was 117.4MB in the beginning and 4.2GB in the end (delta: 4.1GB). Free memory was 48.5MB in the beginning and 1.5GB in the end (delta: -1.4GB). Peak memory consumption was 2.7GB. Max. memory is 16.1GB. [2023-11-26 10:49:07,262 INFO L158 Benchmark]: CDTParser took 0.31ms. Allocated memory is still 117.4MB. Free memory was 90.8MB in the beginning and 90.6MB in the end (delta: 155.4kB). There was no memory consumed. Max. memory is 16.1GB. [2023-11-26 10:49:07,262 INFO L158 Benchmark]: CACSL2BoogieTranslator took 652.60ms. Allocated memory was 117.4MB in the beginning and 153.1MB in the end (delta: 35.7MB). Free memory was 48.2MB in the beginning and 108.4MB in the end (delta: -60.2MB). Peak memory consumption was 12.2MB. Max. memory is 16.1GB. [2023-11-26 10:49:07,263 INFO L158 Benchmark]: Boogie Procedure Inliner took 67.54ms. Allocated memory is still 153.1MB. Free memory was 108.4MB in the beginning and 106.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-26 10:49:07,263 INFO L158 Benchmark]: Boogie Preprocessor took 105.46ms. Allocated memory is still 153.1MB. Free memory was 106.3MB in the beginning and 123.0MB in the end (delta: -16.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-26 10:49:07,264 INFO L158 Benchmark]: RCFGBuilder took 652.27ms. Allocated memory is still 153.1MB. Free memory was 122.8MB in the beginning and 104.9MB in the end (delta: 17.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2023-11-26 10:49:07,264 INFO L158 Benchmark]: TraceAbstraction took 23627.21ms. Allocated memory was 153.1MB in the beginning and 4.2GB in the end (delta: 4.0GB). Free memory was 104.1MB in the beginning and 1.5GB in the end (delta: -1.3GB). Peak memory consumption was 2.7GB. Max. memory is 16.1GB. [2023-11-26 10:49:07,265 INFO L158 Benchmark]: Witness Printer took 4.17ms. Allocated memory is still 4.2GB. Free memory was 1.5GB in the beginning and 1.5GB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2023-11-26 10:49:07,268 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.31ms. Allocated memory is still 117.4MB. Free memory was 90.8MB in the beginning and 90.6MB in the end (delta: 155.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 652.60ms. Allocated memory was 117.4MB in the beginning and 153.1MB in the end (delta: 35.7MB). Free memory was 48.2MB in the beginning and 108.4MB in the end (delta: -60.2MB). Peak memory consumption was 12.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 67.54ms. Allocated memory is still 153.1MB. Free memory was 108.4MB in the beginning and 106.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 105.46ms. Allocated memory is still 153.1MB. Free memory was 106.3MB in the beginning and 123.0MB in the end (delta: -16.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 652.27ms. Allocated memory is still 153.1MB. Free memory was 122.8MB in the beginning and 104.9MB in the end (delta: 17.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 23627.21ms. Allocated memory was 153.1MB in the beginning and 4.2GB in the end (delta: 4.0GB). Free memory was 104.1MB in the beginning and 1.5GB in the end (delta: -1.3GB). Peak memory consumption was 2.7GB. Max. memory is 16.1GB. * Witness Printer took 4.17ms. Allocated memory is still 4.2GB. Free memory was 1.5GB in the beginning and 1.5GB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~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-26 10:49:07,316 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated [2023-11-26 10:49:07,318 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated [2023-11-26 10:49:07,346 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated [2023-11-26 10:49:07,347 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.5s, OverallIterations: 5, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.5s, 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.3s 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: 2.6s, OverallIterations: 6, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 111 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 83 mSDsluCounter, 30 SdHoareTripleChecker+Invalid, 0.3s 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.1s SatisfiabilityAnalysisTime, 0.5s 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: 19.2s, OverallIterations: 8, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 18.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 210 SdHoareTripleChecker+Valid, 0.4s 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.1s SatisfiabilityAnalysisTime, 0.6s 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-26 10:49:07,388 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_09ea1619-d265-4dc3-a61e-09f20be41985/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE