./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/pthread-race-challenges/thread-join-array-dynamic.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 3061b6dc Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/pthread-race-challenges/thread-join-array-dynamic.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --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 e281184c6e6629633efbcea3a2283a3a54dcfd040e15fa389b71c86937ccbf2b --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-19 06:04:39,933 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 06:04:39,990 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2024-11-19 06:04:39,996 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 06:04:39,997 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 06:04:40,013 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 06:04:40,013 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 06:04:40,014 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 06:04:40,014 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 06:04:40,014 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 06:04:40,015 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 06:04:40,015 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 06:04:40,016 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 06:04:40,016 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 06:04:40,016 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-19 06:04:40,016 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 06:04:40,017 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 06:04:40,017 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 06:04:40,017 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 06:04:40,018 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-19 06:04:40,018 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 06:04:40,022 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-19 06:04:40,022 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2024-11-19 06:04:40,022 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 06:04:40,022 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-19 06:04:40,023 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 06:04:40,023 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-19 06:04:40,023 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 06:04:40,023 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 06:04:40,023 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 06:04:40,023 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 06:04:40,024 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 06:04:40,024 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 06:04:40,024 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 06:04:40,024 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-19 06:04:40,024 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-19 06:04:40,025 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-19 06:04:40,025 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 06:04:40,025 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 06:04:40,027 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 06:04:40,027 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 06:04:40,027 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:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux 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 -> e281184c6e6629633efbcea3a2283a3a54dcfd040e15fa389b71c86937ccbf2b [2024-11-19 06:04:40,234 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 06:04:40,259 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 06:04:40,262 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 06:04:40,263 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 06:04:40,263 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 06:04:40,264 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-race-challenges/thread-join-array-dynamic.i [2024-11-19 06:04:41,711 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 06:04:41,949 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 06:04:41,949 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-race-challenges/thread-join-array-dynamic.i [2024-11-19 06:04:41,973 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c059d1e8d/64d913e1d36347c098457ac1480cd4e7/FLAGc8da56de5 [2024-11-19 06:04:41,990 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c059d1e8d/64d913e1d36347c098457ac1480cd4e7 [2024-11-19 06:04:41,994 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 06:04:41,996 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 06:04:41,997 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 06:04:41,999 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 06:04:42,005 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 06:04:42,006 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 06:04:41" (1/1) ... [2024-11-19 06:04:42,006 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6f5c2623 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:04:42, skipping insertion in model container [2024-11-19 06:04:42,007 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 06:04:41" (1/1) ... [2024-11-19 06:04:42,051 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 06:04:42,415 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 06:04:42,429 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 06:04:42,513 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 06:04:42,565 INFO L204 MainTranslator]: Completed translation [2024-11-19 06:04:42,566 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:04:42 WrapperNode [2024-11-19 06:04:42,566 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 06:04:42,567 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 06:04:42,567 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 06:04:42,567 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 06:04:42,573 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:04:42" (1/1) ... [2024-11-19 06:04:42,592 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:04:42" (1/1) ... [2024-11-19 06:04:42,631 INFO L138 Inliner]: procedures = 265, calls = 16, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 67 [2024-11-19 06:04:42,631 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 06:04:42,632 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 06:04:42,632 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 06:04:42,632 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 06:04:42,640 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:04:42" (1/1) ... [2024-11-19 06:04:42,641 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:04:42" (1/1) ... [2024-11-19 06:04:42,646 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:04:42" (1/1) ... [2024-11-19 06:04:42,649 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:04:42" (1/1) ... [2024-11-19 06:04:42,658 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:04:42" (1/1) ... [2024-11-19 06:04:42,666 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:04:42" (1/1) ... [2024-11-19 06:04:42,668 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:04:42" (1/1) ... [2024-11-19 06:04:42,669 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:04:42" (1/1) ... [2024-11-19 06:04:42,671 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 06:04:42,672 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 06:04:42,672 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 06:04:42,672 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 06:04:42,677 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:04:42" (1/1) ... [2024-11-19 06:04:42,689 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 06:04:42,699 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 06:04:42,719 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-19 06:04:42,721 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-19 06:04:42,763 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-19 06:04:42,763 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-11-19 06:04:42,764 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-19 06:04:42,764 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-19 06:04:42,764 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-11-19 06:04:42,764 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-19 06:04:42,764 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 06:04:42,764 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-19 06:04:42,764 INFO L130 BoogieDeclarations]: Found specification of procedure thread [2024-11-19 06:04:42,764 INFO L138 BoogieDeclarations]: Found implementation of procedure thread [2024-11-19 06:04:42,764 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 06:04:42,764 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 06:04:42,771 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-19 06:04:42,949 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 06:04:42,952 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 06:04:43,111 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-19 06:04:43,111 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 06:04:43,128 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 06:04:43,129 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-19 06:04:43,129 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 06:04:43 BoogieIcfgContainer [2024-11-19 06:04:43,129 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 06:04:43,130 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 06:04:43,131 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 06:04:43,133 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 06:04:43,133 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 06:04:41" (1/3) ... [2024-11-19 06:04:43,134 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d9388b6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 06:04:43, skipping insertion in model container [2024-11-19 06:04:43,134 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:04:42" (2/3) ... [2024-11-19 06:04:43,134 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d9388b6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 06:04:43, skipping insertion in model container [2024-11-19 06:04:43,134 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 06:04:43" (3/3) ... [2024-11-19 06:04:43,135 INFO L112 eAbstractionObserver]: Analyzing ICFG thread-join-array-dynamic.i [2024-11-19 06:04:43,148 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 06:04:43,148 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2024-11-19 06:04:43,148 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-19 06:04:43,202 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2024-11-19 06:04:43,239 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 90 places, 91 transitions, 189 flow [2024-11-19 06:04:43,293 INFO L124 PetriNetUnfolderBase]: 6/125 cut-off events. [2024-11-19 06:04:43,294 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-11-19 06:04:43,298 INFO L83 FinitePrefix]: Finished finitePrefix Result has 130 conditions, 125 events. 6/125 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 209 event pairs, 0 based on Foata normal form. 0/109 useless extension candidates. Maximal degree in co-relation 62. Up to 4 conditions per place. [2024-11-19 06:04:43,298 INFO L82 GeneralOperation]: Start removeDead. Operand has 90 places, 91 transitions, 189 flow [2024-11-19 06:04:43,303 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 90 places, 91 transitions, 189 flow [2024-11-19 06:04:43,313 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 06:04:43,320 INFO L333 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, 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;@ece4844, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 06:04:43,320 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2024-11-19 06:04:43,330 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-19 06:04:43,330 INFO L124 PetriNetUnfolderBase]: 3/50 cut-off events. [2024-11-19 06:04:43,330 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-19 06:04:43,330 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 06:04:43,331 INFO L204 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] [2024-11-19 06:04:43,332 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 3 more)] === [2024-11-19 06:04:43,336 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:04:43,337 INFO L85 PathProgramCache]: Analyzing trace with hash 637167217, now seen corresponding path program 1 times [2024-11-19 06:04:43,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:04:43,347 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1873742805] [2024-11-19 06:04:43,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:04:43,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:04:43,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:04:43,716 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:04:43,716 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:04:43,717 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1873742805] [2024-11-19 06:04:43,717 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1873742805] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:04:43,717 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:04:43,718 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 06:04:43,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1613251598] [2024-11-19 06:04:43,720 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:04:43,728 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 06:04:43,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:04:43,755 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 06:04:43,756 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 06:04:43,768 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 80 out of 91 [2024-11-19 06:04:43,771 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 91 transitions, 189 flow. Second operand has 3 states, 3 states have (on average 80.66666666666667) internal successors, (242), 3 states have internal predecessors, (242), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:04:43,772 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 06:04:43,772 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 80 of 91 [2024-11-19 06:04:43,773 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 06:04:43,835 INFO L124 PetriNetUnfolderBase]: 8/163 cut-off events. [2024-11-19 06:04:43,835 INFO L125 PetriNetUnfolderBase]: For 4/7 co-relation queries the response was YES. [2024-11-19 06:04:43,836 INFO L83 FinitePrefix]: Finished finitePrefix Result has 197 conditions, 163 events. 8/163 cut-off events. For 4/7 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 414 event pairs, 1 based on Foata normal form. 8/154 useless extension candidates. Maximal degree in co-relation 122. Up to 16 conditions per place. [2024-11-19 06:04:43,837 INFO L140 encePairwiseOnDemand]: 84/91 looper letters, 8 selfloop transitions, 3 changer transitions 2/92 dead transitions. [2024-11-19 06:04:43,837 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 92 transitions, 215 flow [2024-11-19 06:04:43,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 06:04:43,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 06:04:43,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 256 transitions. [2024-11-19 06:04:43,852 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9377289377289377 [2024-11-19 06:04:43,855 INFO L175 Difference]: Start difference. First operand has 90 places, 91 transitions, 189 flow. Second operand 3 states and 256 transitions. [2024-11-19 06:04:43,856 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 92 transitions, 215 flow [2024-11-19 06:04:43,858 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 92 transitions, 215 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-19 06:04:43,863 INFO L231 Difference]: Finished difference. Result has 94 places, 89 transitions, 203 flow [2024-11-19 06:04:43,865 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=91, PETRI_DIFFERENCE_MINUEND_FLOW=183, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=85, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=203, PETRI_PLACES=94, PETRI_TRANSITIONS=89} [2024-11-19 06:04:43,868 INFO L277 CegarLoopForPetriNet]: 90 programPoint places, 4 predicate places. [2024-11-19 06:04:43,871 INFO L471 AbstractCegarLoop]: Abstraction has has 94 places, 89 transitions, 203 flow [2024-11-19 06:04:43,871 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 80.66666666666667) internal successors, (242), 3 states have internal predecessors, (242), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:04:43,871 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 06:04:43,871 INFO L204 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] [2024-11-19 06:04:43,871 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-19 06:04:43,872 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 3 more)] === [2024-11-19 06:04:43,872 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:04:43,872 INFO L85 PathProgramCache]: Analyzing trace with hash -1740217746, now seen corresponding path program 1 times [2024-11-19 06:04:43,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:04:43,873 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2052677176] [2024-11-19 06:04:43,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:04:43,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:04:43,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:04:44,362 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:04:44,363 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:04:44,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2052677176] [2024-11-19 06:04:44,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2052677176] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:04:44,364 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:04:44,364 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 06:04:44,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1930164737] [2024-11-19 06:04:44,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:04:44,366 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 06:04:44,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:04:44,367 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 06:04:44,367 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-19 06:04:44,487 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 66 out of 91 [2024-11-19 06:04:44,488 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 89 transitions, 203 flow. Second operand has 6 states, 6 states have (on average 67.5) internal successors, (405), 6 states have internal predecessors, (405), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:04:44,488 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 06:04:44,489 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 66 of 91 [2024-11-19 06:04:44,489 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 06:04:44,596 INFO L124 PetriNetUnfolderBase]: 31/245 cut-off events. [2024-11-19 06:04:44,597 INFO L125 PetriNetUnfolderBase]: For 9/9 co-relation queries the response was YES. [2024-11-19 06:04:44,598 INFO L83 FinitePrefix]: Finished finitePrefix Result has 370 conditions, 245 events. 31/245 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1068 event pairs, 11 based on Foata normal form. 0/226 useless extension candidates. Maximal degree in co-relation 277. Up to 62 conditions per place. [2024-11-19 06:04:44,599 INFO L140 encePairwiseOnDemand]: 85/91 looper letters, 24 selfloop transitions, 5 changer transitions 0/96 dead transitions. [2024-11-19 06:04:44,600 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 96 transitions, 275 flow [2024-11-19 06:04:44,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 06:04:44,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-19 06:04:44,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 426 transitions. [2024-11-19 06:04:44,605 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7802197802197802 [2024-11-19 06:04:44,606 INFO L175 Difference]: Start difference. First operand has 94 places, 89 transitions, 203 flow. Second operand 6 states and 426 transitions. [2024-11-19 06:04:44,607 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 96 transitions, 275 flow [2024-11-19 06:04:44,608 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 96 transitions, 269 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 06:04:44,609 INFO L231 Difference]: Finished difference. Result has 95 places, 88 transitions, 205 flow [2024-11-19 06:04:44,609 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=91, PETRI_DIFFERENCE_MINUEND_FLOW=195, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=83, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=205, PETRI_PLACES=95, PETRI_TRANSITIONS=88} [2024-11-19 06:04:44,610 INFO L277 CegarLoopForPetriNet]: 90 programPoint places, 5 predicate places. [2024-11-19 06:04:44,610 INFO L471 AbstractCegarLoop]: Abstraction has has 95 places, 88 transitions, 205 flow [2024-11-19 06:04:44,613 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 67.5) internal successors, (405), 6 states have internal predecessors, (405), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:04:44,613 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 06:04:44,613 INFO L204 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] [2024-11-19 06:04:44,613 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-19 06:04:44,614 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 3 more)] === [2024-11-19 06:04:44,614 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:04:44,615 INFO L85 PathProgramCache]: Analyzing trace with hash -2045412567, now seen corresponding path program 1 times [2024-11-19 06:04:44,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:04:44,615 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [594308955] [2024-11-19 06:04:44,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:04:44,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:04:44,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:04:44,702 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:04:44,703 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:04:44,703 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [594308955] [2024-11-19 06:04:44,703 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [594308955] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:04:44,703 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:04:44,703 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 06:04:44,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1357120416] [2024-11-19 06:04:44,704 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:04:44,705 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 06:04:44,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:04:44,706 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 06:04:44,706 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-19 06:04:44,774 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 73 out of 91 [2024-11-19 06:04:44,775 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 88 transitions, 205 flow. Second operand has 5 states, 5 states have (on average 74.4) internal successors, (372), 5 states have internal predecessors, (372), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:04:44,776 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 06:04:44,776 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 73 of 91 [2024-11-19 06:04:44,776 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 06:04:44,822 INFO L124 PetriNetUnfolderBase]: 17/232 cut-off events. [2024-11-19 06:04:44,823 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-11-19 06:04:44,824 INFO L83 FinitePrefix]: Finished finitePrefix Result has 330 conditions, 232 events. 17/232 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 805 event pairs, 1 based on Foata normal form. 1/219 useless extension candidates. Maximal degree in co-relation 227. Up to 49 conditions per place. [2024-11-19 06:04:44,825 INFO L140 encePairwiseOnDemand]: 83/91 looper letters, 15 selfloop transitions, 2 changer transitions 5/95 dead transitions. [2024-11-19 06:04:44,825 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 95 transitions, 263 flow [2024-11-19 06:04:44,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 06:04:44,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-19 06:04:44,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 461 transitions. [2024-11-19 06:04:44,828 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8443223443223443 [2024-11-19 06:04:44,829 INFO L175 Difference]: Start difference. First operand has 95 places, 88 transitions, 205 flow. Second operand 6 states and 461 transitions. [2024-11-19 06:04:44,829 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 95 transitions, 263 flow [2024-11-19 06:04:44,830 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 95 transitions, 253 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-11-19 06:04:44,831 INFO L231 Difference]: Finished difference. Result has 99 places, 88 transitions, 213 flow [2024-11-19 06:04:44,832 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=91, PETRI_DIFFERENCE_MINUEND_FLOW=195, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=86, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=213, PETRI_PLACES=99, PETRI_TRANSITIONS=88} [2024-11-19 06:04:44,833 INFO L277 CegarLoopForPetriNet]: 90 programPoint places, 9 predicate places. [2024-11-19 06:04:44,833 INFO L471 AbstractCegarLoop]: Abstraction has has 99 places, 88 transitions, 213 flow [2024-11-19 06:04:44,834 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 74.4) internal successors, (372), 5 states have internal predecessors, (372), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:04:44,834 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 06:04:44,834 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:04:44,834 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-19 06:04:44,835 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 3 more)] === [2024-11-19 06:04:44,835 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:04:44,835 INFO L85 PathProgramCache]: Analyzing trace with hash 79107010, now seen corresponding path program 1 times [2024-11-19 06:04:44,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:04:44,836 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [621376700] [2024-11-19 06:04:44,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:04:44,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:04:44,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:04:44,884 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:04:44,885 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:04:44,885 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [621376700] [2024-11-19 06:04:44,885 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [621376700] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:04:44,885 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:04:44,885 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 06:04:44,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [698973974] [2024-11-19 06:04:44,885 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:04:44,886 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 06:04:44,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:04:44,886 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 06:04:44,886 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 06:04:44,895 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 78 out of 91 [2024-11-19 06:04:44,896 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 88 transitions, 213 flow. Second operand has 3 states, 3 states have (on average 79.66666666666667) internal successors, (239), 3 states have internal predecessors, (239), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:04:44,896 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 06:04:44,896 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 78 of 91 [2024-11-19 06:04:44,896 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 06:04:44,921 INFO L124 PetriNetUnfolderBase]: 5/169 cut-off events. [2024-11-19 06:04:44,921 INFO L125 PetriNetUnfolderBase]: For 19/32 co-relation queries the response was YES. [2024-11-19 06:04:44,922 INFO L83 FinitePrefix]: Finished finitePrefix Result has 246 conditions, 169 events. 5/169 cut-off events. For 19/32 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 475 event pairs, 3 based on Foata normal form. 1/160 useless extension candidates. Maximal degree in co-relation 189. Up to 25 conditions per place. [2024-11-19 06:04:44,923 INFO L140 encePairwiseOnDemand]: 86/91 looper letters, 8 selfloop transitions, 4 changer transitions 3/91 dead transitions. [2024-11-19 06:04:44,923 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 91 transitions, 249 flow [2024-11-19 06:04:44,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 06:04:44,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 06:04:44,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 248 transitions. [2024-11-19 06:04:44,924 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9084249084249084 [2024-11-19 06:04:44,925 INFO L175 Difference]: Start difference. First operand has 99 places, 88 transitions, 213 flow. Second operand 3 states and 248 transitions. [2024-11-19 06:04:44,925 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 91 transitions, 249 flow [2024-11-19 06:04:44,926 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 91 transitions, 235 flow, removed 5 selfloop flow, removed 5 redundant places. [2024-11-19 06:04:44,928 INFO L231 Difference]: Finished difference. Result has 95 places, 88 transitions, 221 flow [2024-11-19 06:04:44,928 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=91, PETRI_DIFFERENCE_MINUEND_FLOW=199, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=221, PETRI_PLACES=95, PETRI_TRANSITIONS=88} [2024-11-19 06:04:44,930 INFO L277 CegarLoopForPetriNet]: 90 programPoint places, 5 predicate places. [2024-11-19 06:04:44,930 INFO L471 AbstractCegarLoop]: Abstraction has has 95 places, 88 transitions, 221 flow [2024-11-19 06:04:44,930 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 79.66666666666667) internal successors, (239), 3 states have internal predecessors, (239), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:04:44,930 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 06:04:44,931 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:04:44,931 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-19 06:04:44,932 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 3 more)] === [2024-11-19 06:04:44,932 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:04:44,932 INFO L85 PathProgramCache]: Analyzing trace with hash 42510031, now seen corresponding path program 1 times [2024-11-19 06:04:44,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:04:44,932 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [60877798] [2024-11-19 06:04:44,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:04:44,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:04:44,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:04:45,235 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-19 06:04:45,235 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:04:45,235 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [60877798] [2024-11-19 06:04:45,235 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [60877798] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:04:45,236 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:04:45,236 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 06:04:45,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1774239960] [2024-11-19 06:04:45,236 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:04:45,236 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 06:04:45,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:04:45,238 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 06:04:45,239 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-19 06:04:45,357 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 68 out of 91 [2024-11-19 06:04:45,358 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 88 transitions, 221 flow. Second operand has 6 states, 6 states have (on average 70.16666666666667) internal successors, (421), 6 states have internal predecessors, (421), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:04:45,358 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 06:04:45,358 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 68 of 91 [2024-11-19 06:04:45,358 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 06:04:45,419 INFO L124 PetriNetUnfolderBase]: 25/282 cut-off events. [2024-11-19 06:04:45,420 INFO L125 PetriNetUnfolderBase]: For 48/51 co-relation queries the response was YES. [2024-11-19 06:04:45,422 INFO L83 FinitePrefix]: Finished finitePrefix Result has 458 conditions, 282 events. 25/282 cut-off events. For 48/51 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 1231 event pairs, 15 based on Foata normal form. 0/273 useless extension candidates. Maximal degree in co-relation 370. Up to 55 conditions per place. [2024-11-19 06:04:45,423 INFO L140 encePairwiseOnDemand]: 85/91 looper letters, 12 selfloop transitions, 0 changer transitions 20/95 dead transitions. [2024-11-19 06:04:45,423 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 95 transitions, 289 flow [2024-11-19 06:04:45,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 06:04:45,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-19 06:04:45,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 436 transitions. [2024-11-19 06:04:45,425 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7985347985347986 [2024-11-19 06:04:45,425 INFO L175 Difference]: Start difference. First operand has 95 places, 88 transitions, 221 flow. Second operand 6 states and 436 transitions. [2024-11-19 06:04:45,425 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 95 transitions, 289 flow [2024-11-19 06:04:45,428 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 95 transitions, 281 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 06:04:45,430 INFO L231 Difference]: Finished difference. Result has 97 places, 75 transitions, 184 flow [2024-11-19 06:04:45,430 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=91, PETRI_DIFFERENCE_MINUEND_FLOW=211, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=87, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=184, PETRI_PLACES=97, PETRI_TRANSITIONS=75} [2024-11-19 06:04:45,433 INFO L277 CegarLoopForPetriNet]: 90 programPoint places, 7 predicate places. [2024-11-19 06:04:45,433 INFO L471 AbstractCegarLoop]: Abstraction has has 97 places, 75 transitions, 184 flow [2024-11-19 06:04:45,433 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 70.16666666666667) internal successors, (421), 6 states have internal predecessors, (421), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:04:45,434 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 06:04:45,435 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:04:45,435 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-19 06:04:45,435 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 3 more)] === [2024-11-19 06:04:45,436 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:04:45,437 INFO L85 PathProgramCache]: Analyzing trace with hash -2106051217, now seen corresponding path program 1 times [2024-11-19 06:04:45,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:04:45,437 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [884343795] [2024-11-19 06:04:45,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:04:45,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:04:45,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 06:04:45,466 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 06:04:45,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 06:04:45,508 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 06:04:45,509 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-19 06:04:45,510 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (5 of 6 remaining) [2024-11-19 06:04:45,512 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (4 of 6 remaining) [2024-11-19 06:04:45,512 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (3 of 6 remaining) [2024-11-19 06:04:45,512 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (2 of 6 remaining) [2024-11-19 06:04:45,512 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (1 of 6 remaining) [2024-11-19 06:04:45,515 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (0 of 6 remaining) [2024-11-19 06:04:45,515 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-19 06:04:45,516 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2024-11-19 06:04:45,518 WARN L244 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-19 06:04:45,518 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2024-11-19 06:04:45,536 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-11-19 06:04:45,542 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 109 places, 109 transitions, 234 flow [2024-11-19 06:04:45,564 INFO L124 PetriNetUnfolderBase]: 11/212 cut-off events. [2024-11-19 06:04:45,564 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2024-11-19 06:04:45,565 INFO L83 FinitePrefix]: Finished finitePrefix Result has 224 conditions, 212 events. 11/212 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 446 event pairs, 0 based on Foata normal form. 0/184 useless extension candidates. Maximal degree in co-relation 127. Up to 8 conditions per place. [2024-11-19 06:04:45,565 INFO L82 GeneralOperation]: Start removeDead. Operand has 109 places, 109 transitions, 234 flow [2024-11-19 06:04:45,566 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 109 places, 109 transitions, 234 flow [2024-11-19 06:04:45,567 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 06:04:45,569 INFO L333 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, 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;@ece4844, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 06:04:45,572 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2024-11-19 06:04:45,575 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-19 06:04:45,575 INFO L124 PetriNetUnfolderBase]: 3/50 cut-off events. [2024-11-19 06:04:45,575 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-19 06:04:45,576 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 06:04:45,576 INFO L204 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] [2024-11-19 06:04:45,576 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 4 more)] === [2024-11-19 06:04:45,576 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:04:45,576 INFO L85 PathProgramCache]: Analyzing trace with hash -1540354543, now seen corresponding path program 1 times [2024-11-19 06:04:45,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:04:45,576 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1293720242] [2024-11-19 06:04:45,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:04:45,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:04:45,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:04:45,608 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:04:45,609 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:04:45,609 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1293720242] [2024-11-19 06:04:45,609 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1293720242] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:04:45,609 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:04:45,612 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 06:04:45,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2037121901] [2024-11-19 06:04:45,613 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:04:45,613 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 06:04:45,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:04:45,614 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 06:04:45,614 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 06:04:45,627 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 109 [2024-11-19 06:04:45,627 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 109 places, 109 transitions, 234 flow. Second operand has 3 states, 3 states have (on average 93.66666666666667) internal successors, (281), 3 states have internal predecessors, (281), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:04:45,627 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 06:04:45,627 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 109 [2024-11-19 06:04:45,628 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 06:04:45,751 INFO L124 PetriNetUnfolderBase]: 119/731 cut-off events. [2024-11-19 06:04:45,752 INFO L125 PetriNetUnfolderBase]: For 54/78 co-relation queries the response was YES. [2024-11-19 06:04:45,753 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1003 conditions, 731 events. 119/731 cut-off events. For 54/78 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 4271 event pairs, 50 based on Foata normal form. 36/682 useless extension candidates. Maximal degree in co-relation 749. Up to 139 conditions per place. [2024-11-19 06:04:45,755 INFO L140 encePairwiseOnDemand]: 101/109 looper letters, 16 selfloop transitions, 4 changer transitions 1/113 dead transitions. [2024-11-19 06:04:45,756 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 113 transitions, 282 flow [2024-11-19 06:04:45,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 06:04:45,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 06:04:45,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 303 transitions. [2024-11-19 06:04:45,757 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.926605504587156 [2024-11-19 06:04:45,757 INFO L175 Difference]: Start difference. First operand has 109 places, 109 transitions, 234 flow. Second operand 3 states and 303 transitions. [2024-11-19 06:04:45,757 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 113 transitions, 282 flow [2024-11-19 06:04:45,758 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 113 transitions, 282 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-19 06:04:45,759 INFO L231 Difference]: Finished difference. Result has 113 places, 108 transitions, 256 flow [2024-11-19 06:04:45,759 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=109, PETRI_DIFFERENCE_MINUEND_FLOW=228, PETRI_DIFFERENCE_MINUEND_PLACES=109, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=106, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=102, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=256, PETRI_PLACES=113, PETRI_TRANSITIONS=108} [2024-11-19 06:04:45,760 INFO L277 CegarLoopForPetriNet]: 109 programPoint places, 4 predicate places. [2024-11-19 06:04:45,760 INFO L471 AbstractCegarLoop]: Abstraction has has 113 places, 108 transitions, 256 flow [2024-11-19 06:04:45,760 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 93.66666666666667) internal successors, (281), 3 states have internal predecessors, (281), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:04:45,760 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 06:04:45,761 INFO L204 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] [2024-11-19 06:04:45,761 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-19 06:04:45,761 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 4 more)] === [2024-11-19 06:04:45,761 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:04:45,761 INFO L85 PathProgramCache]: Analyzing trace with hash 1300220009, now seen corresponding path program 1 times [2024-11-19 06:04:45,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:04:45,762 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1152446130] [2024-11-19 06:04:45,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:04:45,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:04:45,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:04:45,807 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:04:45,808 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:04:45,808 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1152446130] [2024-11-19 06:04:45,808 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1152446130] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:04:45,808 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:04:45,808 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 06:04:45,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1403627730] [2024-11-19 06:04:45,809 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:04:45,809 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 06:04:45,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:04:45,809 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 06:04:45,810 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-19 06:04:45,881 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 109 [2024-11-19 06:04:45,882 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 108 transitions, 256 flow. Second operand has 5 states, 5 states have (on average 88.4) internal successors, (442), 5 states have internal predecessors, (442), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:04:45,882 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 06:04:45,882 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 109 [2024-11-19 06:04:45,882 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 06:04:46,003 INFO L124 PetriNetUnfolderBase]: 189/1195 cut-off events. [2024-11-19 06:04:46,003 INFO L125 PetriNetUnfolderBase]: For 71/71 co-relation queries the response was YES. [2024-11-19 06:04:46,007 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1695 conditions, 1195 events. 189/1195 cut-off events. For 71/71 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 8575 event pairs, 131 based on Foata normal form. 1/1096 useless extension candidates. Maximal degree in co-relation 1094. Up to 314 conditions per place. [2024-11-19 06:04:46,011 INFO L140 encePairwiseOnDemand]: 101/109 looper letters, 20 selfloop transitions, 2 changer transitions 5/116 dead transitions. [2024-11-19 06:04:46,011 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 116 transitions, 326 flow [2024-11-19 06:04:46,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 06:04:46,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-19 06:04:46,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 550 transitions. [2024-11-19 06:04:46,013 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8409785932721713 [2024-11-19 06:04:46,013 INFO L175 Difference]: Start difference. First operand has 113 places, 108 transitions, 256 flow. Second operand 6 states and 550 transitions. [2024-11-19 06:04:46,013 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 117 places, 116 transitions, 326 flow [2024-11-19 06:04:46,015 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 115 places, 116 transitions, 318 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 06:04:46,016 INFO L231 Difference]: Finished difference. Result has 119 places, 109 transitions, 270 flow [2024-11-19 06:04:46,016 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=109, PETRI_DIFFERENCE_MINUEND_FLOW=248, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=108, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=106, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=270, PETRI_PLACES=119, PETRI_TRANSITIONS=109} [2024-11-19 06:04:46,018 INFO L277 CegarLoopForPetriNet]: 109 programPoint places, 10 predicate places. [2024-11-19 06:04:46,018 INFO L471 AbstractCegarLoop]: Abstraction has has 119 places, 109 transitions, 270 flow [2024-11-19 06:04:46,018 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 88.4) internal successors, (442), 5 states have internal predecessors, (442), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:04:46,018 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 06:04:46,019 INFO L204 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] [2024-11-19 06:04:46,019 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-19 06:04:46,019 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 4 more)] === [2024-11-19 06:04:46,019 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:04:46,019 INFO L85 PathProgramCache]: Analyzing trace with hash 1605414830, now seen corresponding path program 1 times [2024-11-19 06:04:46,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:04:46,020 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [910131022] [2024-11-19 06:04:46,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:04:46,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:04:46,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:04:46,230 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:04:46,231 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:04:46,231 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [910131022] [2024-11-19 06:04:46,231 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [910131022] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:04:46,231 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:04:46,232 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 06:04:46,232 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [362111191] [2024-11-19 06:04:46,232 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:04:46,232 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 06:04:46,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:04:46,233 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 06:04:46,233 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-19 06:04:46,313 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 80 out of 109 [2024-11-19 06:04:46,314 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 109 transitions, 270 flow. Second operand has 6 states, 6 states have (on average 81.5) internal successors, (489), 6 states have internal predecessors, (489), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:04:46,314 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 06:04:46,314 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 80 of 109 [2024-11-19 06:04:46,314 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 06:04:46,456 INFO L124 PetriNetUnfolderBase]: 298/1282 cut-off events. [2024-11-19 06:04:46,456 INFO L125 PetriNetUnfolderBase]: For 97/97 co-relation queries the response was YES. [2024-11-19 06:04:46,460 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2084 conditions, 1282 events. 298/1282 cut-off events. For 97/97 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 9634 event pairs, 130 based on Foata normal form. 0/1183 useless extension candidates. Maximal degree in co-relation 959. Up to 371 conditions per place. [2024-11-19 06:04:46,464 INFO L140 encePairwiseOnDemand]: 103/109 looper letters, 37 selfloop transitions, 5 changer transitions 0/124 dead transitions. [2024-11-19 06:04:46,464 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 124 transitions, 384 flow [2024-11-19 06:04:46,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 06:04:46,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-19 06:04:46,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 522 transitions. [2024-11-19 06:04:46,466 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7981651376146789 [2024-11-19 06:04:46,466 INFO L175 Difference]: Start difference. First operand has 119 places, 109 transitions, 270 flow. Second operand 6 states and 522 transitions. [2024-11-19 06:04:46,466 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 124 transitions, 384 flow [2024-11-19 06:04:46,468 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 116 places, 124 transitions, 372 flow, removed 5 selfloop flow, removed 4 redundant places. [2024-11-19 06:04:46,469 INFO L231 Difference]: Finished difference. Result has 116 places, 108 transitions, 266 flow [2024-11-19 06:04:46,469 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=109, PETRI_DIFFERENCE_MINUEND_FLOW=256, PETRI_DIFFERENCE_MINUEND_PLACES=111, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=108, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=103, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=266, PETRI_PLACES=116, PETRI_TRANSITIONS=108} [2024-11-19 06:04:46,470 INFO L277 CegarLoopForPetriNet]: 109 programPoint places, 7 predicate places. [2024-11-19 06:04:46,470 INFO L471 AbstractCegarLoop]: Abstraction has has 116 places, 108 transitions, 266 flow [2024-11-19 06:04:46,470 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 81.5) internal successors, (489), 6 states have internal predecessors, (489), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:04:46,471 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 06:04:46,471 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:04:46,471 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-19 06:04:46,471 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 4 more)] === [2024-11-19 06:04:46,471 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:04:46,471 INFO L85 PathProgramCache]: Analyzing trace with hash -55830766, now seen corresponding path program 1 times [2024-11-19 06:04:46,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:04:46,471 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1290274059] [2024-11-19 06:04:46,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:04:46,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:04:46,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:04:46,502 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:04:46,502 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:04:46,502 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1290274059] [2024-11-19 06:04:46,503 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1290274059] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:04:46,503 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:04:46,503 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 06:04:46,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [500882906] [2024-11-19 06:04:46,503 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:04:46,503 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 06:04:46,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:04:46,504 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 06:04:46,504 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 06:04:46,522 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 109 [2024-11-19 06:04:46,522 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 116 places, 108 transitions, 266 flow. Second operand has 3 states, 3 states have (on average 92.66666666666667) internal successors, (278), 3 states have internal predecessors, (278), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:04:46,523 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 06:04:46,523 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 109 [2024-11-19 06:04:46,523 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 06:04:46,639 INFO L124 PetriNetUnfolderBase]: 170/1036 cut-off events. [2024-11-19 06:04:46,639 INFO L125 PetriNetUnfolderBase]: For 196/323 co-relation queries the response was YES. [2024-11-19 06:04:46,676 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1612 conditions, 1036 events. 170/1036 cut-off events. For 196/323 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 7374 event pairs, 74 based on Foata normal form. 4/903 useless extension candidates. Maximal degree in co-relation 670. Up to 268 conditions per place. [2024-11-19 06:04:46,680 INFO L140 encePairwiseOnDemand]: 103/109 looper letters, 19 selfloop transitions, 7 changer transitions 0/117 dead transitions. [2024-11-19 06:04:46,681 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 117 transitions, 350 flow [2024-11-19 06:04:46,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 06:04:46,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 06:04:46,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 297 transitions. [2024-11-19 06:04:46,682 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.908256880733945 [2024-11-19 06:04:46,682 INFO L175 Difference]: Start difference. First operand has 116 places, 108 transitions, 266 flow. Second operand 3 states and 297 transitions. [2024-11-19 06:04:46,682 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 118 places, 117 transitions, 350 flow [2024-11-19 06:04:46,684 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 113 places, 117 transitions, 340 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-11-19 06:04:46,686 INFO L231 Difference]: Finished difference. Result has 115 places, 113 transitions, 312 flow [2024-11-19 06:04:46,686 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=109, PETRI_DIFFERENCE_MINUEND_FLOW=256, PETRI_DIFFERENCE_MINUEND_PLACES=111, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=108, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=101, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=312, PETRI_PLACES=115, PETRI_TRANSITIONS=113} [2024-11-19 06:04:46,686 INFO L277 CegarLoopForPetriNet]: 109 programPoint places, 6 predicate places. [2024-11-19 06:04:46,687 INFO L471 AbstractCegarLoop]: Abstraction has has 115 places, 113 transitions, 312 flow [2024-11-19 06:04:46,688 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 92.66666666666667) internal successors, (278), 3 states have internal predecessors, (278), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:04:46,688 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 06:04:46,688 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:04:46,688 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-19 06:04:46,688 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 4 more)] === [2024-11-19 06:04:46,688 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:04:46,689 INFO L85 PathProgramCache]: Analyzing trace with hash 2098394380, now seen corresponding path program 1 times [2024-11-19 06:04:46,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:04:46,689 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [868970551] [2024-11-19 06:04:46,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:04:46,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:04:46,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:04:46,914 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-19 06:04:46,915 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:04:46,915 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [868970551] [2024-11-19 06:04:46,915 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [868970551] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:04:46,915 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:04:46,916 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 06:04:46,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [494754261] [2024-11-19 06:04:46,916 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:04:46,916 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 06:04:46,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:04:46,917 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 06:04:46,917 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-19 06:04:47,012 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 109 [2024-11-19 06:04:47,013 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 113 transitions, 312 flow. Second operand has 6 states, 6 states have (on average 84.16666666666667) internal successors, (505), 6 states have internal predecessors, (505), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:04:47,013 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 06:04:47,014 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 109 [2024-11-19 06:04:47,014 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 06:04:47,269 INFO L124 PetriNetUnfolderBase]: 358/1837 cut-off events. [2024-11-19 06:04:47,269 INFO L125 PetriNetUnfolderBase]: For 312/360 co-relation queries the response was YES. [2024-11-19 06:04:47,275 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3016 conditions, 1837 events. 358/1837 cut-off events. For 312/360 co-relation queries the response was YES. Maximal size of possible extension queue 114. Compared 15485 event pairs, 179 based on Foata normal form. 4/1681 useless extension candidates. Maximal degree in co-relation 2430. Up to 362 conditions per place. [2024-11-19 06:04:47,280 INFO L140 encePairwiseOnDemand]: 103/109 looper letters, 34 selfloop transitions, 5 changer transitions 0/128 dead transitions. [2024-11-19 06:04:47,280 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 128 transitions, 420 flow [2024-11-19 06:04:47,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 06:04:47,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-19 06:04:47,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 532 transitions. [2024-11-19 06:04:47,283 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8134556574923547 [2024-11-19 06:04:47,283 INFO L175 Difference]: Start difference. First operand has 115 places, 113 transitions, 312 flow. Second operand 6 states and 532 transitions. [2024-11-19 06:04:47,283 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 128 transitions, 420 flow [2024-11-19 06:04:47,285 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 128 transitions, 406 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 06:04:47,287 INFO L231 Difference]: Finished difference. Result has 117 places, 112 transitions, 306 flow [2024-11-19 06:04:47,287 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=109, PETRI_DIFFERENCE_MINUEND_FLOW=296, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=112, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=107, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=306, PETRI_PLACES=117, PETRI_TRANSITIONS=112} [2024-11-19 06:04:47,288 INFO L277 CegarLoopForPetriNet]: 109 programPoint places, 8 predicate places. [2024-11-19 06:04:47,288 INFO L471 AbstractCegarLoop]: Abstraction has has 117 places, 112 transitions, 306 flow [2024-11-19 06:04:47,288 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 84.16666666666667) internal successors, (505), 6 states have internal predecessors, (505), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:04:47,289 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 06:04:47,289 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:04:47,289 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-19 06:04:47,289 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 4 more)] === [2024-11-19 06:04:47,290 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:04:47,290 INFO L85 PathProgramCache]: Analyzing trace with hash -605015293, now seen corresponding path program 1 times [2024-11-19 06:04:47,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:04:47,290 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1324454667] [2024-11-19 06:04:47,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:04:47,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:04:47,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:04:47,371 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:04:47,371 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:04:47,372 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1324454667] [2024-11-19 06:04:47,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1324454667] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 06:04:47,372 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [144013428] [2024-11-19 06:04:47,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:04:47,372 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 06:04:47,372 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 06:04:47,376 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 06:04:47,377 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-19 06:04:47,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:04:47,465 INFO L255 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-19 06:04:47,467 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:04:47,538 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:04:47,538 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 06:04:47,591 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:04:47,592 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [144013428] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 06:04:47,592 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 06:04:47,592 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 9 [2024-11-19 06:04:47,592 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1838291182] [2024-11-19 06:04:47,592 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 06:04:47,593 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-19 06:04:47,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:04:47,593 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-19 06:04:47,594 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-11-19 06:04:47,776 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 109 [2024-11-19 06:04:47,778 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 112 transitions, 306 flow. Second operand has 9 states, 9 states have (on average 87.22222222222223) internal successors, (785), 9 states have internal predecessors, (785), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:04:47,778 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 06:04:47,778 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 109 [2024-11-19 06:04:47,778 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 06:04:47,947 INFO L124 PetriNetUnfolderBase]: 159/1005 cut-off events. [2024-11-19 06:04:47,947 INFO L125 PetriNetUnfolderBase]: For 133/156 co-relation queries the response was YES. [2024-11-19 06:04:47,951 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1632 conditions, 1005 events. 159/1005 cut-off events. For 133/156 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 6713 event pairs, 37 based on Foata normal form. 0/937 useless extension candidates. Maximal degree in co-relation 950. Up to 159 conditions per place. [2024-11-19 06:04:47,954 INFO L140 encePairwiseOnDemand]: 99/109 looper letters, 27 selfloop transitions, 9 changer transitions 9/134 dead transitions. [2024-11-19 06:04:47,955 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 124 places, 134 transitions, 444 flow [2024-11-19 06:04:47,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-19 06:04:47,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-11-19 06:04:47,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 726 transitions. [2024-11-19 06:04:47,957 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8325688073394495 [2024-11-19 06:04:47,957 INFO L175 Difference]: Start difference. First operand has 117 places, 112 transitions, 306 flow. Second operand 8 states and 726 transitions. [2024-11-19 06:04:47,957 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 124 places, 134 transitions, 444 flow [2024-11-19 06:04:47,959 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 119 places, 134 transitions, 432 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-11-19 06:04:47,961 INFO L231 Difference]: Finished difference. Result has 122 places, 113 transitions, 329 flow [2024-11-19 06:04:47,961 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=109, PETRI_DIFFERENCE_MINUEND_FLOW=290, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=111, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=102, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=329, PETRI_PLACES=122, PETRI_TRANSITIONS=113} [2024-11-19 06:04:47,961 INFO L277 CegarLoopForPetriNet]: 109 programPoint places, 13 predicate places. [2024-11-19 06:04:47,962 INFO L471 AbstractCegarLoop]: Abstraction has has 122 places, 113 transitions, 329 flow [2024-11-19 06:04:47,962 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 87.22222222222223) internal successors, (785), 9 states have internal predecessors, (785), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:04:47,962 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 06:04:47,963 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:04:47,986 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-19 06:04:48,163 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2024-11-19 06:04:48,164 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 4 more)] === [2024-11-19 06:04:48,165 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:04:48,165 INFO L85 PathProgramCache]: Analyzing trace with hash 1309900068, now seen corresponding path program 1 times [2024-11-19 06:04:48,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:04:48,166 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [554599019] [2024-11-19 06:04:48,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:04:48,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:04:48,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:04:48,217 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-19 06:04:48,218 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:04:48,218 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [554599019] [2024-11-19 06:04:48,218 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [554599019] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:04:48,218 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:04:48,218 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 06:04:48,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1870560739] [2024-11-19 06:04:48,218 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:04:48,219 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 06:04:48,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:04:48,219 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 06:04:48,219 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 06:04:48,231 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 109 [2024-11-19 06:04:48,232 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 122 places, 113 transitions, 329 flow. Second operand has 3 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) [2024-11-19 06:04:48,232 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 06:04:48,232 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 109 [2024-11-19 06:04:48,232 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 06:04:48,334 INFO L124 PetriNetUnfolderBase]: 56/628 cut-off events. [2024-11-19 06:04:48,334 INFO L125 PetriNetUnfolderBase]: For 230/295 co-relation queries the response was YES. [2024-11-19 06:04:48,336 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1063 conditions, 628 events. 56/628 cut-off events. For 230/295 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 3800 event pairs, 30 based on Foata normal form. 3/608 useless extension candidates. Maximal degree in co-relation 935. Up to 119 conditions per place. [2024-11-19 06:04:48,338 INFO L140 encePairwiseOnDemand]: 103/109 looper letters, 19 selfloop transitions, 7 changer transitions 1/120 dead transitions. [2024-11-19 06:04:48,338 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 124 places, 120 transitions, 406 flow [2024-11-19 06:04:48,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 06:04:48,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 06:04:48,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 296 transitions. [2024-11-19 06:04:48,340 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9051987767584098 [2024-11-19 06:04:48,340 INFO L175 Difference]: Start difference. First operand has 122 places, 113 transitions, 329 flow. Second operand 3 states and 296 transitions. [2024-11-19 06:04:48,340 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 124 places, 120 transitions, 406 flow [2024-11-19 06:04:48,341 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 121 places, 120 transitions, 400 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-11-19 06:04:48,343 INFO L231 Difference]: Finished difference. Result has 123 places, 116 transitions, 373 flow [2024-11-19 06:04:48,343 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=109, PETRI_DIFFERENCE_MINUEND_FLOW=323, PETRI_DIFFERENCE_MINUEND_PLACES=119, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=113, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=106, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=373, PETRI_PLACES=123, PETRI_TRANSITIONS=116} [2024-11-19 06:04:48,344 INFO L277 CegarLoopForPetriNet]: 109 programPoint places, 14 predicate places. [2024-11-19 06:04:48,344 INFO L471 AbstractCegarLoop]: Abstraction has has 123 places, 116 transitions, 373 flow [2024-11-19 06:04:48,344 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 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) [2024-11-19 06:04:48,344 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 06:04:48,345 INFO L204 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:04:48,345 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-19 06:04:48,345 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 4 more)] === [2024-11-19 06:04:48,345 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:04:48,345 INFO L85 PathProgramCache]: Analyzing trace with hash -354026671, now seen corresponding path program 1 times [2024-11-19 06:04:48,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:04:48,346 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [223273399] [2024-11-19 06:04:48,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:04:48,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:04:48,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 06:04:48,368 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 06:04:48,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 06:04:48,386 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 06:04:48,386 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-19 06:04:48,387 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (6 of 7 remaining) [2024-11-19 06:04:48,387 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (5 of 7 remaining) [2024-11-19 06:04:48,387 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (4 of 7 remaining) [2024-11-19 06:04:48,387 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (3 of 7 remaining) [2024-11-19 06:04:48,387 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (2 of 7 remaining) [2024-11-19 06:04:48,387 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (1 of 7 remaining) [2024-11-19 06:04:48,387 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (0 of 7 remaining) [2024-11-19 06:04:48,387 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-19 06:04:48,387 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:04:48,388 WARN L244 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-19 06:04:48,388 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2024-11-19 06:04:48,415 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2024-11-19 06:04:48,417 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 128 places, 127 transitions, 281 flow [2024-11-19 06:04:48,472 INFO L124 PetriNetUnfolderBase]: 21/350 cut-off events. [2024-11-19 06:04:48,476 INFO L125 PetriNetUnfolderBase]: For 19/19 co-relation queries the response was YES. [2024-11-19 06:04:48,477 INFO L83 FinitePrefix]: Finished finitePrefix Result has 375 conditions, 350 events. 21/350 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 958 event pairs, 1 based on Foata normal form. 0/302 useless extension candidates. Maximal degree in co-relation 220. Up to 16 conditions per place. [2024-11-19 06:04:48,477 INFO L82 GeneralOperation]: Start removeDead. Operand has 128 places, 127 transitions, 281 flow [2024-11-19 06:04:48,479 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 128 places, 127 transitions, 281 flow [2024-11-19 06:04:48,484 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 06:04:48,484 INFO L333 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, 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;@ece4844, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 06:04:48,484 INFO L334 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2024-11-19 06:04:48,487 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-19 06:04:48,491 INFO L124 PetriNetUnfolderBase]: 3/50 cut-off events. [2024-11-19 06:04:48,491 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-19 06:04:48,491 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 06:04:48,491 INFO L204 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] [2024-11-19 06:04:48,492 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2024-11-19 06:04:48,492 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:04:48,492 INFO L85 PathProgramCache]: Analyzing trace with hash -964600847, now seen corresponding path program 1 times [2024-11-19 06:04:48,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:04:48,492 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [169187664] [2024-11-19 06:04:48,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:04:48,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:04:48,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:04:48,523 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:04:48,524 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:04:48,524 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [169187664] [2024-11-19 06:04:48,524 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [169187664] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:04:48,524 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:04:48,524 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 06:04:48,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1406554623] [2024-11-19 06:04:48,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:04:48,525 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 06:04:48,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:04:48,525 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 06:04:48,525 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 06:04:48,545 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 127 [2024-11-19 06:04:48,546 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 128 places, 127 transitions, 281 flow. Second operand has 3 states, 3 states have (on average 106.66666666666667) internal successors, (320), 3 states have internal predecessors, (320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:04:48,546 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 06:04:48,546 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 127 [2024-11-19 06:04:48,546 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 06:04:49,023 INFO L124 PetriNetUnfolderBase]: 1071/4022 cut-off events. [2024-11-19 06:04:49,024 INFO L125 PetriNetUnfolderBase]: For 404/509 co-relation queries the response was YES. [2024-11-19 06:04:49,034 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5937 conditions, 4022 events. 1071/4022 cut-off events. For 404/509 co-relation queries the response was YES. Maximal size of possible extension queue 174. Compared 36243 event pairs, 542 based on Foata normal form. 180/3761 useless extension candidates. Maximal degree in co-relation 4652. Up to 1110 conditions per place. [2024-11-19 06:04:49,052 INFO L140 encePairwiseOnDemand]: 118/127 looper letters, 23 selfloop transitions, 5 changer transitions 1/134 dead transitions. [2024-11-19 06:04:49,052 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 130 places, 134 transitions, 351 flow [2024-11-19 06:04:49,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 06:04:49,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 06:04:49,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 350 transitions. [2024-11-19 06:04:49,057 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9186351706036745 [2024-11-19 06:04:49,057 INFO L175 Difference]: Start difference. First operand has 128 places, 127 transitions, 281 flow. Second operand 3 states and 350 transitions. [2024-11-19 06:04:49,057 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 130 places, 134 transitions, 351 flow [2024-11-19 06:04:49,058 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 130 places, 134 transitions, 351 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-19 06:04:49,060 INFO L231 Difference]: Finished difference. Result has 132 places, 127 transitions, 311 flow [2024-11-19 06:04:49,061 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=127, PETRI_DIFFERENCE_MINUEND_FLOW=275, PETRI_DIFFERENCE_MINUEND_PLACES=128, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=124, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=119, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=311, PETRI_PLACES=132, PETRI_TRANSITIONS=127} [2024-11-19 06:04:49,061 INFO L277 CegarLoopForPetriNet]: 128 programPoint places, 4 predicate places. [2024-11-19 06:04:49,062 INFO L471 AbstractCegarLoop]: Abstraction has has 132 places, 127 transitions, 311 flow [2024-11-19 06:04:49,062 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 106.66666666666667) internal successors, (320), 3 states have internal predecessors, (320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:04:49,062 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 06:04:49,062 INFO L204 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] [2024-11-19 06:04:49,063 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-19 06:04:49,063 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2024-11-19 06:04:49,063 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:04:49,063 INFO L85 PathProgramCache]: Analyzing trace with hash 853939566, now seen corresponding path program 1 times [2024-11-19 06:04:49,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:04:49,064 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2145153810] [2024-11-19 06:04:49,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:04:49,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:04:49,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:04:49,256 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:04:49,256 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:04:49,256 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2145153810] [2024-11-19 06:04:49,257 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2145153810] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:04:49,257 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:04:49,257 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 06:04:49,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1276873774] [2024-11-19 06:04:49,257 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:04:49,258 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 06:04:49,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:04:49,259 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 06:04:49,259 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-19 06:04:49,352 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 127 [2024-11-19 06:04:49,353 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 132 places, 127 transitions, 311 flow. Second operand has 6 states, 6 states have (on average 95.5) internal successors, (573), 6 states have internal predecessors, (573), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:04:49,353 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 06:04:49,353 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 127 [2024-11-19 06:04:49,353 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 06:04:50,065 INFO L124 PetriNetUnfolderBase]: 1992/6696 cut-off events. [2024-11-19 06:04:50,065 INFO L125 PetriNetUnfolderBase]: For 492/492 co-relation queries the response was YES. [2024-11-19 06:04:50,086 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10664 conditions, 6696 events. 1992/6696 cut-off events. For 492/492 co-relation queries the response was YES. Maximal size of possible extension queue 328. Compared 66948 event pairs, 898 based on Foata normal form. 0/6018 useless extension candidates. Maximal degree in co-relation 6902. Up to 2168 conditions per place. [2024-11-19 06:04:50,120 INFO L140 encePairwiseOnDemand]: 121/127 looper letters, 48 selfloop transitions, 5 changer transitions 0/150 dead transitions. [2024-11-19 06:04:50,121 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 135 places, 150 transitions, 463 flow [2024-11-19 06:04:50,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 06:04:50,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-19 06:04:50,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 618 transitions. [2024-11-19 06:04:50,123 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8110236220472441 [2024-11-19 06:04:50,123 INFO L175 Difference]: Start difference. First operand has 132 places, 127 transitions, 311 flow. Second operand 6 states and 618 transitions. [2024-11-19 06:04:50,123 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 135 places, 150 transitions, 463 flow [2024-11-19 06:04:50,129 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 133 places, 150 transitions, 453 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 06:04:50,130 INFO L231 Difference]: Finished difference. Result has 133 places, 126 transitions, 309 flow [2024-11-19 06:04:50,131 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=127, PETRI_DIFFERENCE_MINUEND_FLOW=299, PETRI_DIFFERENCE_MINUEND_PLACES=128, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=126, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=121, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=309, PETRI_PLACES=133, PETRI_TRANSITIONS=126} [2024-11-19 06:04:50,132 INFO L277 CegarLoopForPetriNet]: 128 programPoint places, 5 predicate places. [2024-11-19 06:04:50,132 INFO L471 AbstractCegarLoop]: Abstraction has has 133 places, 126 transitions, 309 flow [2024-11-19 06:04:50,133 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 95.5) internal successors, (573), 6 states have internal predecessors, (573), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:04:50,133 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 06:04:50,133 INFO L204 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] [2024-11-19 06:04:50,133 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-19 06:04:50,133 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2024-11-19 06:04:50,133 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:04:50,133 INFO L85 PathProgramCache]: Analyzing trace with hash 548744745, now seen corresponding path program 1 times [2024-11-19 06:04:50,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:04:50,134 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1433269840] [2024-11-19 06:04:50,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:04:50,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:04:50,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:04:50,245 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:04:50,245 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:04:50,245 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1433269840] [2024-11-19 06:04:50,245 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1433269840] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:04:50,245 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:04:50,246 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 06:04:50,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1713955122] [2024-11-19 06:04:50,246 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:04:50,246 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 06:04:50,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:04:50,246 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 06:04:50,247 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-19 06:04:50,311 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 127 [2024-11-19 06:04:50,312 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 133 places, 126 transitions, 309 flow. Second operand has 5 states, 5 states have (on average 102.4) internal successors, (512), 5 states have internal predecessors, (512), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:04:50,312 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 06:04:50,313 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 127 [2024-11-19 06:04:50,313 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 06:04:51,058 INFO L124 PetriNetUnfolderBase]: 1326/6241 cut-off events. [2024-11-19 06:04:51,058 INFO L125 PetriNetUnfolderBase]: For 229/229 co-relation queries the response was YES. [2024-11-19 06:04:51,078 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8873 conditions, 6241 events. 1326/6241 cut-off events. For 229/229 co-relation queries the response was YES. Maximal size of possible extension queue 203. Compared 63418 event pairs, 760 based on Foata normal form. 1/5483 useless extension candidates. Maximal degree in co-relation 3021. Up to 1720 conditions per place. [2024-11-19 06:04:51,098 INFO L140 encePairwiseOnDemand]: 119/127 looper letters, 24 selfloop transitions, 2 changer transitions 5/134 dead transitions. [2024-11-19 06:04:51,098 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 138 places, 134 transitions, 387 flow [2024-11-19 06:04:51,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 06:04:51,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-19 06:04:51,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 638 transitions. [2024-11-19 06:04:51,101 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8372703412073491 [2024-11-19 06:04:51,101 INFO L175 Difference]: Start difference. First operand has 133 places, 126 transitions, 309 flow. Second operand 6 states and 638 transitions. [2024-11-19 06:04:51,101 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 138 places, 134 transitions, 387 flow [2024-11-19 06:04:51,103 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 133 places, 134 transitions, 377 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-11-19 06:04:51,104 INFO L231 Difference]: Finished difference. Result has 137 places, 127 transitions, 321 flow [2024-11-19 06:04:51,105 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=127, PETRI_DIFFERENCE_MINUEND_FLOW=299, PETRI_DIFFERENCE_MINUEND_PLACES=128, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=126, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=124, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=321, PETRI_PLACES=137, PETRI_TRANSITIONS=127} [2024-11-19 06:04:51,105 INFO L277 CegarLoopForPetriNet]: 128 programPoint places, 9 predicate places. [2024-11-19 06:04:51,105 INFO L471 AbstractCegarLoop]: Abstraction has has 137 places, 127 transitions, 321 flow [2024-11-19 06:04:51,106 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 102.4) internal successors, (512), 5 states have internal predecessors, (512), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:04:51,106 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 06:04:51,106 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:04:51,106 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-19 06:04:51,107 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2024-11-19 06:04:51,107 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:04:51,107 INFO L85 PathProgramCache]: Analyzing trace with hash -76812734, now seen corresponding path program 1 times [2024-11-19 06:04:51,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:04:51,108 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [809693310] [2024-11-19 06:04:51,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:04:51,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:04:51,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:04:51,269 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:04:51,270 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:04:51,270 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [809693310] [2024-11-19 06:04:51,270 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [809693310] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:04:51,270 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:04:51,270 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 06:04:51,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1511471997] [2024-11-19 06:04:51,270 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:04:51,271 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 06:04:51,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:04:51,271 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 06:04:51,271 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 06:04:51,292 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 127 [2024-11-19 06:04:51,292 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 137 places, 127 transitions, 321 flow. Second operand has 3 states, 3 states have (on average 105.66666666666667) internal successors, (317), 3 states have internal predecessors, (317), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:04:51,292 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 06:04:51,292 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 127 [2024-11-19 06:04:51,292 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 06:04:52,055 INFO L124 PetriNetUnfolderBase]: 1740/6603 cut-off events. [2024-11-19 06:04:52,055 INFO L125 PetriNetUnfolderBase]: For 1550/2155 co-relation queries the response was YES. [2024-11-19 06:04:52,070 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11194 conditions, 6603 events. 1740/6603 cut-off events. For 1550/2155 co-relation queries the response was YES. Maximal size of possible extension queue 319. Compared 68778 event pairs, 967 based on Foata normal form. 10/5862 useless extension candidates. Maximal degree in co-relation 11135. Up to 2240 conditions per place. [2024-11-19 06:04:52,215 INFO L140 encePairwiseOnDemand]: 120/127 looper letters, 29 selfloop transitions, 9 changer transitions 0/142 dead transitions. [2024-11-19 06:04:52,216 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 136 places, 142 transitions, 455 flow [2024-11-19 06:04:52,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 06:04:52,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 06:04:52,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 346 transitions. [2024-11-19 06:04:52,217 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9081364829396326 [2024-11-19 06:04:52,217 INFO L175 Difference]: Start difference. First operand has 137 places, 127 transitions, 321 flow. Second operand 3 states and 346 transitions. [2024-11-19 06:04:52,218 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 136 places, 142 transitions, 455 flow [2024-11-19 06:04:52,228 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 132 places, 142 transitions, 443 flow, removed 5 selfloop flow, removed 4 redundant places. [2024-11-19 06:04:52,230 INFO L231 Difference]: Finished difference. Result has 134 places, 134 transitions, 385 flow [2024-11-19 06:04:52,230 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=127, PETRI_DIFFERENCE_MINUEND_FLOW=309, PETRI_DIFFERENCE_MINUEND_PLACES=130, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=127, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=118, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=385, PETRI_PLACES=134, PETRI_TRANSITIONS=134} [2024-11-19 06:04:52,231 INFO L277 CegarLoopForPetriNet]: 128 programPoint places, 6 predicate places. [2024-11-19 06:04:52,231 INFO L471 AbstractCegarLoop]: Abstraction has has 134 places, 134 transitions, 385 flow [2024-11-19 06:04:52,231 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 105.66666666666667) internal successors, (317), 3 states have internal predecessors, (317), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:04:52,231 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 06:04:52,231 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:04:52,232 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-19 06:04:52,232 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2024-11-19 06:04:52,232 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:04:52,232 INFO L85 PathProgramCache]: Analyzing trace with hash -736876325, now seen corresponding path program 1 times [2024-11-19 06:04:52,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:04:52,233 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [181791143] [2024-11-19 06:04:52,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:04:52,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:04:52,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:04:52,446 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-19 06:04:52,447 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:04:52,447 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [181791143] [2024-11-19 06:04:52,447 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [181791143] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:04:52,447 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:04:52,447 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 06:04:52,448 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1574613545] [2024-11-19 06:04:52,448 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:04:52,448 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 06:04:52,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:04:52,449 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 06:04:52,449 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-19 06:04:52,533 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 127 [2024-11-19 06:04:52,534 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 134 places, 134 transitions, 385 flow. Second operand has 6 states, 6 states have (on average 98.16666666666667) internal successors, (589), 6 states have internal predecessors, (589), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:04:52,534 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 06:04:52,534 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 127 [2024-11-19 06:04:52,534 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 06:04:53,817 INFO L124 PetriNetUnfolderBase]: 2874/10393 cut-off events. [2024-11-19 06:04:53,817 INFO L125 PetriNetUnfolderBase]: For 1726/2295 co-relation queries the response was YES. [2024-11-19 06:04:53,855 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17543 conditions, 10393 events. 2874/10393 cut-off events. For 1726/2295 co-relation queries the response was YES. Maximal size of possible extension queue 463. Compared 114908 event pairs, 1408 based on Foata normal form. 27/9250 useless extension candidates. Maximal degree in co-relation 13956. Up to 2157 conditions per place. [2024-11-19 06:04:53,892 INFO L140 encePairwiseOnDemand]: 121/127 looper letters, 46 selfloop transitions, 5 changer transitions 0/157 dead transitions. [2024-11-19 06:04:53,893 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 138 places, 157 transitions, 533 flow [2024-11-19 06:04:53,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 06:04:53,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-19 06:04:53,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 628 transitions. [2024-11-19 06:04:53,896 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8241469816272966 [2024-11-19 06:04:53,896 INFO L175 Difference]: Start difference. First operand has 134 places, 134 transitions, 385 flow. Second operand 6 states and 628 transitions. [2024-11-19 06:04:53,897 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 138 places, 157 transitions, 533 flow [2024-11-19 06:04:53,907 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 136 places, 157 transitions, 515 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 06:04:53,909 INFO L231 Difference]: Finished difference. Result has 136 places, 133 transitions, 375 flow [2024-11-19 06:04:53,909 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=127, PETRI_DIFFERENCE_MINUEND_FLOW=365, PETRI_DIFFERENCE_MINUEND_PLACES=131, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=133, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=128, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=375, PETRI_PLACES=136, PETRI_TRANSITIONS=133} [2024-11-19 06:04:53,910 INFO L277 CegarLoopForPetriNet]: 128 programPoint places, 8 predicate places. [2024-11-19 06:04:53,910 INFO L471 AbstractCegarLoop]: Abstraction has has 136 places, 133 transitions, 375 flow [2024-11-19 06:04:53,911 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 98.16666666666667) internal successors, (589), 6 states have internal predecessors, (589), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:04:53,911 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 06:04:53,911 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:04:53,911 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-19 06:04:53,911 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2024-11-19 06:04:53,913 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:04:53,913 INFO L85 PathProgramCache]: Analyzing trace with hash -571759414, now seen corresponding path program 1 times [2024-11-19 06:04:53,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:04:53,914 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1919896426] [2024-11-19 06:04:53,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:04:53,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:04:53,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:04:54,004 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:04:54,004 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:04:54,004 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1919896426] [2024-11-19 06:04:54,004 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1919896426] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 06:04:54,004 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2047462633] [2024-11-19 06:04:54,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:04:54,005 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 06:04:54,005 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 06:04:54,009 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 06:04:54,010 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-19 06:04:54,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:04:54,090 INFO L255 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-19 06:04:54,091 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:04:54,126 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:04:54,127 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 06:04:54,167 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:04:54,167 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2047462633] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 06:04:54,167 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 06:04:54,167 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 9 [2024-11-19 06:04:54,168 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1677275253] [2024-11-19 06:04:54,168 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 06:04:54,168 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-19 06:04:54,168 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:04:54,168 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-19 06:04:54,168 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-11-19 06:04:54,290 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 127 [2024-11-19 06:04:54,291 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 136 places, 133 transitions, 375 flow. Second operand has 9 states, 9 states have (on average 101.22222222222223) internal successors, (911), 9 states have internal predecessors, (911), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:04:54,291 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 06:04:54,291 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 127 [2024-11-19 06:04:54,292 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 06:04:55,039 INFO L124 PetriNetUnfolderBase]: 1466/6315 cut-off events. [2024-11-19 06:04:55,040 INFO L125 PetriNetUnfolderBase]: For 963/1188 co-relation queries the response was YES. [2024-11-19 06:04:55,056 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10653 conditions, 6315 events. 1466/6315 cut-off events. For 963/1188 co-relation queries the response was YES. Maximal size of possible extension queue 189. Compared 64144 event pairs, 542 based on Foata normal form. 1/5719 useless extension candidates. Maximal degree in co-relation 5875. Up to 1078 conditions per place. [2024-11-19 06:04:55,073 INFO L140 encePairwiseOnDemand]: 117/127 looper letters, 48 selfloop transitions, 10 changer transitions 0/165 dead transitions. [2024-11-19 06:04:55,074 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 143 places, 165 transitions, 566 flow [2024-11-19 06:04:55,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-19 06:04:55,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-11-19 06:04:55,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 851 transitions. [2024-11-19 06:04:55,076 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8375984251968503 [2024-11-19 06:04:55,076 INFO L175 Difference]: Start difference. First operand has 136 places, 133 transitions, 375 flow. Second operand 8 states and 851 transitions. [2024-11-19 06:04:55,076 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 143 places, 165 transitions, 566 flow [2024-11-19 06:04:55,080 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 138 places, 165 transitions, 554 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-11-19 06:04:55,081 INFO L231 Difference]: Finished difference. Result has 141 places, 136 transitions, 409 flow [2024-11-19 06:04:55,082 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=127, PETRI_DIFFERENCE_MINUEND_FLOW=365, PETRI_DIFFERENCE_MINUEND_PLACES=131, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=133, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=124, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=409, PETRI_PLACES=141, PETRI_TRANSITIONS=136} [2024-11-19 06:04:55,082 INFO L277 CegarLoopForPetriNet]: 128 programPoint places, 13 predicate places. [2024-11-19 06:04:55,082 INFO L471 AbstractCegarLoop]: Abstraction has has 141 places, 136 transitions, 409 flow [2024-11-19 06:04:55,083 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 101.22222222222223) internal successors, (911), 9 states have internal predecessors, (911), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:04:55,083 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 06:04:55,083 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:04:55,109 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-19 06:04:55,284 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable19 [2024-11-19 06:04:55,284 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2024-11-19 06:04:55,285 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:04:55,285 INFO L85 PathProgramCache]: Analyzing trace with hash 909388675, now seen corresponding path program 1 times [2024-11-19 06:04:55,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:04:55,285 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1676896054] [2024-11-19 06:04:55,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:04:55,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:04:55,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:04:55,324 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-19 06:04:55,324 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:04:55,324 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1676896054] [2024-11-19 06:04:55,324 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1676896054] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:04:55,325 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:04:55,325 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 06:04:55,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1375317960] [2024-11-19 06:04:55,325 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:04:55,325 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 06:04:55,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:04:55,326 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 06:04:55,326 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 06:04:55,347 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 127 [2024-11-19 06:04:55,348 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 141 places, 136 transitions, 409 flow. Second operand has 3 states, 3 states have (on average 106.0) internal successors, (318), 3 states have internal predecessors, (318), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:04:55,348 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 06:04:55,348 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 127 [2024-11-19 06:04:55,348 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 06:04:56,082 INFO L124 PetriNetUnfolderBase]: 1088/4910 cut-off events. [2024-11-19 06:04:56,082 INFO L125 PetriNetUnfolderBase]: For 2489/2728 co-relation queries the response was YES. [2024-11-19 06:04:56,097 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9302 conditions, 4910 events. 1088/4910 cut-off events. For 2489/2728 co-relation queries the response was YES. Maximal size of possible extension queue 215. Compared 51446 event pairs, 589 based on Foata normal form. 8/4547 useless extension candidates. Maximal degree in co-relation 8493. Up to 1450 conditions per place. [2024-11-19 06:04:56,112 INFO L140 encePairwiseOnDemand]: 120/127 looper letters, 31 selfloop transitions, 13 changer transitions 0/152 dead transitions. [2024-11-19 06:04:56,112 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 143 places, 152 transitions, 570 flow [2024-11-19 06:04:56,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 06:04:56,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 06:04:56,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 345 transitions. [2024-11-19 06:04:56,114 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.905511811023622 [2024-11-19 06:04:56,114 INFO L175 Difference]: Start difference. First operand has 141 places, 136 transitions, 409 flow. Second operand 3 states and 345 transitions. [2024-11-19 06:04:56,114 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 143 places, 152 transitions, 570 flow [2024-11-19 06:04:56,118 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 140 places, 152 transitions, 564 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-11-19 06:04:56,120 INFO L231 Difference]: Finished difference. Result has 142 places, 145 transitions, 521 flow [2024-11-19 06:04:56,120 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=127, PETRI_DIFFERENCE_MINUEND_FLOW=403, PETRI_DIFFERENCE_MINUEND_PLACES=138, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=136, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=123, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=521, PETRI_PLACES=142, PETRI_TRANSITIONS=145} [2024-11-19 06:04:56,120 INFO L277 CegarLoopForPetriNet]: 128 programPoint places, 14 predicate places. [2024-11-19 06:04:56,121 INFO L471 AbstractCegarLoop]: Abstraction has has 142 places, 145 transitions, 521 flow [2024-11-19 06:04:56,121 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 106.0) internal successors, (318), 3 states have internal predecessors, (318), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:04:56,121 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 06:04:56,121 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:04:56,121 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-19 06:04:56,122 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2024-11-19 06:04:56,122 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:04:56,122 INFO L85 PathProgramCache]: Analyzing trace with hash 744566551, now seen corresponding path program 1 times [2024-11-19 06:04:56,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:04:56,122 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [623250199] [2024-11-19 06:04:56,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:04:56,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:04:56,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:04:56,180 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-19 06:04:56,181 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:04:56,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [623250199] [2024-11-19 06:04:56,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [623250199] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:04:56,181 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:04:56,181 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 06:04:56,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1994046498] [2024-11-19 06:04:56,181 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:04:56,182 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 06:04:56,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:04:56,183 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 06:04:56,183 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 06:04:56,192 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 127 [2024-11-19 06:04:56,193 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 142 places, 145 transitions, 521 flow. Second operand has 3 states, 3 states have (on average 112.66666666666667) internal successors, (338), 3 states have internal predecessors, (338), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:04:56,193 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 06:04:56,193 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 127 [2024-11-19 06:04:56,193 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 06:04:56,355 INFO L124 PetriNetUnfolderBase]: 117/1565 cut-off events. [2024-11-19 06:04:56,355 INFO L125 PetriNetUnfolderBase]: For 701/743 co-relation queries the response was YES. [2024-11-19 06:04:56,360 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2692 conditions, 1565 events. 117/1565 cut-off events. For 701/743 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 12762 event pairs, 43 based on Foata normal form. 21/1532 useless extension candidates. Maximal degree in co-relation 2169. Up to 144 conditions per place. [2024-11-19 06:04:56,364 INFO L140 encePairwiseOnDemand]: 121/127 looper letters, 12 selfloop transitions, 6 changer transitions 0/140 dead transitions. [2024-11-19 06:04:56,365 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 144 places, 140 transitions, 494 flow [2024-11-19 06:04:56,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 06:04:56,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 06:04:56,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 354 transitions. [2024-11-19 06:04:56,366 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9291338582677166 [2024-11-19 06:04:56,366 INFO L175 Difference]: Start difference. First operand has 142 places, 145 transitions, 521 flow. Second operand 3 states and 354 transitions. [2024-11-19 06:04:56,367 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 144 places, 140 transitions, 494 flow [2024-11-19 06:04:56,372 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 142 places, 140 transitions, 480 flow, removed 2 selfloop flow, removed 2 redundant places. [2024-11-19 06:04:56,377 INFO L231 Difference]: Finished difference. Result has 142 places, 135 transitions, 425 flow [2024-11-19 06:04:56,377 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=127, PETRI_DIFFERENCE_MINUEND_FLOW=413, PETRI_DIFFERENCE_MINUEND_PLACES=140, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=135, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=129, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=425, PETRI_PLACES=142, PETRI_TRANSITIONS=135} [2024-11-19 06:04:56,377 INFO L277 CegarLoopForPetriNet]: 128 programPoint places, 14 predicate places. [2024-11-19 06:04:56,377 INFO L471 AbstractCegarLoop]: Abstraction has has 142 places, 135 transitions, 425 flow [2024-11-19 06:04:56,378 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 112.66666666666667) internal successors, (338), 3 states have internal predecessors, (338), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:04:56,378 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 06:04:56,378 INFO L204 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:04:56,378 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-19 06:04:56,378 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2024-11-19 06:04:56,378 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:04:56,378 INFO L85 PathProgramCache]: Analyzing trace with hash -347694239, now seen corresponding path program 1 times [2024-11-19 06:04:56,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:04:56,379 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [390747427] [2024-11-19 06:04:56,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:04:56,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:04:56,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:04:56,415 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2024-11-19 06:04:56,416 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:04:56,416 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [390747427] [2024-11-19 06:04:56,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [390747427] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:04:56,416 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:04:56,416 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 06:04:56,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [891730084] [2024-11-19 06:04:56,416 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:04:56,417 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 06:04:56,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:04:56,417 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 06:04:56,418 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 06:04:56,435 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 127 [2024-11-19 06:04:56,436 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 142 places, 135 transitions, 425 flow. Second operand has 3 states, 3 states have (on average 106.33333333333333) internal successors, (319), 3 states have internal predecessors, (319), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:04:56,436 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 06:04:56,436 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 127 [2024-11-19 06:04:56,436 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 06:04:56,698 INFO L124 PetriNetUnfolderBase]: 203/1858 cut-off events. [2024-11-19 06:04:56,699 INFO L125 PetriNetUnfolderBase]: For 1333/1398 co-relation queries the response was YES. [2024-11-19 06:04:56,704 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3569 conditions, 1858 events. 203/1858 cut-off events. For 1333/1398 co-relation queries the response was YES. Maximal size of possible extension queue 93. Compared 16383 event pairs, 134 based on Foata normal form. 3/1769 useless extension candidates. Maximal degree in co-relation 2979. Up to 435 conditions per place. [2024-11-19 06:04:56,707 INFO L140 encePairwiseOnDemand]: 122/127 looper letters, 25 selfloop transitions, 5 changer transitions 0/140 dead transitions. [2024-11-19 06:04:56,707 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 144 places, 140 transitions, 507 flow [2024-11-19 06:04:56,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 06:04:56,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 06:04:56,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 338 transitions. [2024-11-19 06:04:56,709 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8871391076115486 [2024-11-19 06:04:56,709 INFO L175 Difference]: Start difference. First operand has 142 places, 135 transitions, 425 flow. Second operand 3 states and 338 transitions. [2024-11-19 06:04:56,709 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 144 places, 140 transitions, 507 flow [2024-11-19 06:04:56,712 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 143 places, 140 transitions, 501 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-19 06:04:56,713 INFO L231 Difference]: Finished difference. Result has 145 places, 138 transitions, 459 flow [2024-11-19 06:04:56,714 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=127, PETRI_DIFFERENCE_MINUEND_FLOW=419, PETRI_DIFFERENCE_MINUEND_PLACES=141, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=135, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=130, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=459, PETRI_PLACES=145, PETRI_TRANSITIONS=138} [2024-11-19 06:04:56,714 INFO L277 CegarLoopForPetriNet]: 128 programPoint places, 17 predicate places. [2024-11-19 06:04:56,714 INFO L471 AbstractCegarLoop]: Abstraction has has 145 places, 138 transitions, 459 flow [2024-11-19 06:04:56,714 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 106.33333333333333) internal successors, (319), 3 states have internal predecessors, (319), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:04:56,714 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 06:04:56,715 INFO L204 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:04:56,715 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-19 06:04:56,715 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2024-11-19 06:04:56,715 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:04:56,716 INFO L85 PathProgramCache]: Analyzing trace with hash -1089870802, now seen corresponding path program 1 times [2024-11-19 06:04:56,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:04:56,716 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [470564572] [2024-11-19 06:04:56,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:04:56,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:04:56,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 06:04:56,743 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 06:04:56,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 06:04:56,777 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 06:04:56,779 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-19 06:04:56,779 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (7 of 8 remaining) [2024-11-19 06:04:56,780 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (6 of 8 remaining) [2024-11-19 06:04:56,780 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (5 of 8 remaining) [2024-11-19 06:04:56,780 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (4 of 8 remaining) [2024-11-19 06:04:56,780 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (3 of 8 remaining) [2024-11-19 06:04:56,780 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (2 of 8 remaining) [2024-11-19 06:04:56,781 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (1 of 8 remaining) [2024-11-19 06:04:56,781 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (0 of 8 remaining) [2024-11-19 06:04:56,781 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-11-19 06:04:56,781 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:04:56,783 WARN L244 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-19 06:04:56,783 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2024-11-19 06:04:56,804 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2024-11-19 06:04:56,807 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 147 places, 145 transitions, 330 flow [2024-11-19 06:04:56,859 INFO L124 PetriNetUnfolderBase]: 43/592 cut-off events. [2024-11-19 06:04:56,860 INFO L125 PetriNetUnfolderBase]: For 48/48 co-relation queries the response was YES. [2024-11-19 06:04:56,862 INFO L83 FinitePrefix]: Finished finitePrefix Result has 643 conditions, 592 events. 43/592 cut-off events. For 48/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 2112 event pairs, 6 based on Foata normal form. 0/508 useless extension candidates. Maximal degree in co-relation 370. Up to 32 conditions per place. [2024-11-19 06:04:56,862 INFO L82 GeneralOperation]: Start removeDead. Operand has 147 places, 145 transitions, 330 flow [2024-11-19 06:04:56,867 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 147 places, 145 transitions, 330 flow [2024-11-19 06:04:56,868 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 06:04:56,869 INFO L333 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, 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;@ece4844, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 06:04:56,869 INFO L334 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2024-11-19 06:04:56,873 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-19 06:04:56,873 INFO L124 PetriNetUnfolderBase]: 3/50 cut-off events. [2024-11-19 06:04:56,873 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-19 06:04:56,873 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 06:04:56,873 INFO L204 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] [2024-11-19 06:04:56,873 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2024-11-19 06:04:56,874 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:04:56,874 INFO L85 PathProgramCache]: Analyzing trace with hash -1930538991, now seen corresponding path program 1 times [2024-11-19 06:04:56,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:04:56,874 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1194298220] [2024-11-19 06:04:56,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:04:56,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:04:56,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:04:56,890 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:04:56,890 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:04:56,890 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1194298220] [2024-11-19 06:04:56,891 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1194298220] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:04:56,891 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:04:56,891 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 06:04:56,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1833880807] [2024-11-19 06:04:56,891 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:04:56,892 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 06:04:56,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:04:56,892 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 06:04:56,892 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 06:04:56,909 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 145 [2024-11-19 06:04:56,909 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 147 places, 145 transitions, 330 flow. Second operand has 3 states, 3 states have (on average 119.66666666666667) internal successors, (359), 3 states have internal predecessors, (359), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:04:56,909 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 06:04:56,910 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 145 [2024-11-19 06:04:56,910 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 06:04:59,939 INFO L124 PetriNetUnfolderBase]: 7859/23535 cut-off events. [2024-11-19 06:04:59,939 INFO L125 PetriNetUnfolderBase]: For 2315/2666 co-relation queries the response was YES. [2024-11-19 06:05:00,066 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35885 conditions, 23535 events. 7859/23535 cut-off events. For 2315/2666 co-relation queries the response was YES. Maximal size of possible extension queue 779. Compared 271409 event pairs, 4292 based on Foata normal form. 871/22186 useless extension candidates. Maximal degree in co-relation 28583. Up to 7653 conditions per place. [2024-11-19 06:05:00,194 INFO L140 encePairwiseOnDemand]: 135/145 looper letters, 30 selfloop transitions, 6 changer transitions 1/155 dead transitions. [2024-11-19 06:05:00,194 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 149 places, 155 transitions, 422 flow [2024-11-19 06:05:00,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 06:05:00,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 06:05:00,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 397 transitions. [2024-11-19 06:05:00,196 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9126436781609195 [2024-11-19 06:05:00,196 INFO L175 Difference]: Start difference. First operand has 147 places, 145 transitions, 330 flow. Second operand 3 states and 397 transitions. [2024-11-19 06:05:00,196 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 149 places, 155 transitions, 422 flow [2024-11-19 06:05:00,199 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 149 places, 155 transitions, 422 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-19 06:05:00,201 INFO L231 Difference]: Finished difference. Result has 151 places, 146 transitions, 368 flow [2024-11-19 06:05:00,201 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=145, PETRI_DIFFERENCE_MINUEND_FLOW=324, PETRI_DIFFERENCE_MINUEND_PLACES=147, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=142, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=136, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=368, PETRI_PLACES=151, PETRI_TRANSITIONS=146} [2024-11-19 06:05:00,202 INFO L277 CegarLoopForPetriNet]: 147 programPoint places, 4 predicate places. [2024-11-19 06:05:00,202 INFO L471 AbstractCegarLoop]: Abstraction has has 151 places, 146 transitions, 368 flow [2024-11-19 06:05:00,202 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 119.66666666666667) internal successors, (359), 3 states have internal predecessors, (359), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:05:00,202 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 06:05:00,202 INFO L204 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] [2024-11-19 06:05:00,203 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-11-19 06:05:00,203 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2024-11-19 06:05:00,203 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:05:00,203 INFO L85 PathProgramCache]: Analyzing trace with hash 300323758, now seen corresponding path program 1 times [2024-11-19 06:05:00,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:05:00,204 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [50275090] [2024-11-19 06:05:00,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:05:00,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:05:00,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:05:00,404 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:05:00,405 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:05:00,405 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [50275090] [2024-11-19 06:05:00,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [50275090] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:05:00,405 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:05:00,405 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 06:05:00,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [773972235] [2024-11-19 06:05:00,405 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:05:00,406 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 06:05:00,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:05:00,407 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 06:05:00,407 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-19 06:05:00,502 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 145 [2024-11-19 06:05:00,503 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 151 places, 146 transitions, 368 flow. Second operand has 6 states, 6 states have (on average 109.5) internal successors, (657), 6 states have internal predecessors, (657), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:05:00,503 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 06:05:00,504 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 145 [2024-11-19 06:05:00,504 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 06:05:04,929 INFO L124 PetriNetUnfolderBase]: 13638/36400 cut-off events. [2024-11-19 06:05:04,929 INFO L125 PetriNetUnfolderBase]: For 3211/3211 co-relation queries the response was YES. [2024-11-19 06:05:05,181 INFO L83 FinitePrefix]: Finished finitePrefix Result has 60528 conditions, 36400 events. 13638/36400 cut-off events. For 3211/3211 co-relation queries the response was YES. Maximal size of possible extension queue 1438. Compared 435337 event pairs, 2826 based on Foata normal form. 0/31775 useless extension candidates. Maximal degree in co-relation 35745. Up to 13302 conditions per place. [2024-11-19 06:05:05,289 INFO L140 encePairwiseOnDemand]: 139/145 looper letters, 60 selfloop transitions, 5 changer transitions 0/177 dead transitions. [2024-11-19 06:05:05,289 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 154 places, 177 transitions, 560 flow [2024-11-19 06:05:05,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 06:05:05,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-19 06:05:05,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 714 transitions. [2024-11-19 06:05:05,295 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8206896551724138 [2024-11-19 06:05:05,295 INFO L175 Difference]: Start difference. First operand has 151 places, 146 transitions, 368 flow. Second operand 6 states and 714 transitions. [2024-11-19 06:05:05,295 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 154 places, 177 transitions, 560 flow [2024-11-19 06:05:05,389 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 152 places, 177 transitions, 548 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 06:05:05,390 INFO L231 Difference]: Finished difference. Result has 152 places, 145 transitions, 364 flow [2024-11-19 06:05:05,390 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=145, PETRI_DIFFERENCE_MINUEND_FLOW=354, PETRI_DIFFERENCE_MINUEND_PLACES=147, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=145, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=140, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=364, PETRI_PLACES=152, PETRI_TRANSITIONS=145} [2024-11-19 06:05:05,391 INFO L277 CegarLoopForPetriNet]: 147 programPoint places, 5 predicate places. [2024-11-19 06:05:05,391 INFO L471 AbstractCegarLoop]: Abstraction has has 152 places, 145 transitions, 364 flow [2024-11-19 06:05:05,391 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 109.5) internal successors, (657), 6 states have internal predecessors, (657), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:05:05,391 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 06:05:05,391 INFO L204 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] [2024-11-19 06:05:05,392 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-11-19 06:05:05,392 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2024-11-19 06:05:05,392 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:05:05,392 INFO L85 PathProgramCache]: Analyzing trace with hash -4871063, now seen corresponding path program 1 times [2024-11-19 06:05:05,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:05:05,392 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1800042022] [2024-11-19 06:05:05,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:05:05,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:05:05,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:05:05,442 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:05:05,443 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:05:05,443 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1800042022] [2024-11-19 06:05:05,443 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1800042022] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:05:05,443 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:05:05,443 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 06:05:05,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2101963062] [2024-11-19 06:05:05,443 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:05:05,443 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 06:05:05,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:05:05,444 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 06:05:05,444 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-19 06:05:05,528 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 145 [2024-11-19 06:05:05,529 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 152 places, 145 transitions, 364 flow. Second operand has 5 states, 5 states have (on average 116.4) internal successors, (582), 5 states have internal predecessors, (582), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:05:05,529 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 06:05:05,529 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 145 [2024-11-19 06:05:05,529 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 06:05:09,948 INFO L124 PetriNetUnfolderBase]: 9343/33719 cut-off events. [2024-11-19 06:05:09,948 INFO L125 PetriNetUnfolderBase]: For 1637/1637 co-relation queries the response was YES. [2024-11-19 06:05:10,084 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49426 conditions, 33719 events. 9343/33719 cut-off events. For 1637/1637 co-relation queries the response was YES. Maximal size of possible extension queue 907. Compared 429793 event pairs, 7523 based on Foata normal form. 1/29645 useless extension candidates. Maximal degree in co-relation 31640. Up to 10778 conditions per place. [2024-11-19 06:05:10,191 INFO L140 encePairwiseOnDemand]: 137/145 looper letters, 28 selfloop transitions, 2 changer transitions 5/153 dead transitions. [2024-11-19 06:05:10,191 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 157 places, 153 transitions, 450 flow [2024-11-19 06:05:10,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 06:05:10,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-19 06:05:10,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 726 transitions. [2024-11-19 06:05:10,193 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8344827586206897 [2024-11-19 06:05:10,193 INFO L175 Difference]: Start difference. First operand has 152 places, 145 transitions, 364 flow. Second operand 6 states and 726 transitions. [2024-11-19 06:05:10,193 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 157 places, 153 transitions, 450 flow [2024-11-19 06:05:10,196 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 152 places, 153 transitions, 440 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-11-19 06:05:10,197 INFO L231 Difference]: Finished difference. Result has 156 places, 146 transitions, 376 flow [2024-11-19 06:05:10,197 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=145, PETRI_DIFFERENCE_MINUEND_FLOW=354, PETRI_DIFFERENCE_MINUEND_PLACES=147, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=145, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=143, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=376, PETRI_PLACES=156, PETRI_TRANSITIONS=146} [2024-11-19 06:05:10,198 INFO L277 CegarLoopForPetriNet]: 147 programPoint places, 9 predicate places. [2024-11-19 06:05:10,198 INFO L471 AbstractCegarLoop]: Abstraction has has 156 places, 146 transitions, 376 flow [2024-11-19 06:05:10,198 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 116.4) internal successors, (582), 5 states have internal predecessors, (582), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:05:10,198 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 06:05:10,198 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:05:10,198 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-11-19 06:05:10,198 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2024-11-19 06:05:10,198 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:05:10,198 INFO L85 PathProgramCache]: Analyzing trace with hash 540197122, now seen corresponding path program 1 times [2024-11-19 06:05:10,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:05:10,199 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [38159160] [2024-11-19 06:05:10,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:05:10,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:05:10,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:05:10,217 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:05:10,218 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:05:10,218 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [38159160] [2024-11-19 06:05:10,218 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [38159160] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:05:10,218 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:05:10,218 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 06:05:10,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1883679528] [2024-11-19 06:05:10,218 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:05:10,219 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 06:05:10,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:05:10,219 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 06:05:10,219 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 06:05:10,235 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 145 [2024-11-19 06:05:10,236 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 156 places, 146 transitions, 376 flow. Second operand has 3 states, 3 states have (on average 118.66666666666667) internal successors, (356), 3 states have internal predecessors, (356), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:05:10,236 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 06:05:10,236 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 145 [2024-11-19 06:05:10,236 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 06:05:15,992 INFO L124 PetriNetUnfolderBase]: 13629/41376 cut-off events. [2024-11-19 06:05:15,993 INFO L125 PetriNetUnfolderBase]: For 10673/13732 co-relation queries the response was YES. [2024-11-19 06:05:16,215 INFO L83 FinitePrefix]: Finished finitePrefix Result has 72233 conditions, 41376 events. 13629/41376 cut-off events. For 10673/13732 co-relation queries the response was YES. Maximal size of possible extension queue 1513. Compared 530347 event pairs, 7860 based on Foata normal form. 36/36839 useless extension candidates. Maximal degree in co-relation 72173. Up to 15880 conditions per place. [2024-11-19 06:05:16,408 INFO L140 encePairwiseOnDemand]: 137/145 looper letters, 39 selfloop transitions, 11 changer transitions 0/167 dead transitions. [2024-11-19 06:05:16,410 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 155 places, 167 transitions, 562 flow [2024-11-19 06:05:16,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 06:05:16,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 06:05:16,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 395 transitions. [2024-11-19 06:05:16,411 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9080459770114943 [2024-11-19 06:05:16,411 INFO L175 Difference]: Start difference. First operand has 156 places, 146 transitions, 376 flow. Second operand 3 states and 395 transitions. [2024-11-19 06:05:16,411 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 155 places, 167 transitions, 562 flow [2024-11-19 06:05:16,626 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 151 places, 167 transitions, 550 flow, removed 5 selfloop flow, removed 4 redundant places. [2024-11-19 06:05:16,628 INFO L231 Difference]: Finished difference. Result has 153 places, 155 transitions, 460 flow [2024-11-19 06:05:16,631 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=145, PETRI_DIFFERENCE_MINUEND_FLOW=364, PETRI_DIFFERENCE_MINUEND_PLACES=149, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=146, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=135, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=460, PETRI_PLACES=153, PETRI_TRANSITIONS=155} [2024-11-19 06:05:16,632 INFO L277 CegarLoopForPetriNet]: 147 programPoint places, 6 predicate places. [2024-11-19 06:05:16,632 INFO L471 AbstractCegarLoop]: Abstraction has has 153 places, 155 transitions, 460 flow [2024-11-19 06:05:16,632 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 118.66666666666667) internal successors, (356), 3 states have internal predecessors, (356), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:05:16,632 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 06:05:16,632 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:05:16,632 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-11-19 06:05:16,633 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2024-11-19 06:05:16,633 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:05:16,633 INFO L85 PathProgramCache]: Analyzing trace with hash 126632508, now seen corresponding path program 1 times [2024-11-19 06:05:16,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:05:16,633 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1233442880] [2024-11-19 06:05:16,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:05:16,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:05:16,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:05:16,966 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-19 06:05:16,967 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:05:16,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1233442880] [2024-11-19 06:05:16,968 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1233442880] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:05:16,968 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:05:16,968 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 06:05:16,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1816110183] [2024-11-19 06:05:16,968 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:05:16,968 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 06:05:16,969 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:05:16,969 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 06:05:16,969 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-19 06:05:17,073 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 145 [2024-11-19 06:05:17,075 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 153 places, 155 transitions, 460 flow. Second operand has 6 states, 6 states have (on average 112.16666666666667) internal successors, (673), 6 states have internal predecessors, (673), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:05:17,075 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 06:05:17,075 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 145 [2024-11-19 06:05:17,075 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 06:05:22,743 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([600] L1023-4-->L1023-5: Formula: (= |v_#race~data~0_4| |v_threadThread3of4ForFork0_#t~nondet5_3|) InVars {threadThread3of4ForFork0_#t~nondet5=|v_threadThread3of4ForFork0_#t~nondet5_3|} OutVars{#race~data~0=|v_#race~data~0_4|, threadThread3of4ForFork0_#t~nondet5=|v_threadThread3of4ForFork0_#t~nondet5_3|} AuxVars[] AssignedVars[#race~data~0][152], [120#L1038-1true, 132#L1024true, 172#true, Black: 163#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 174#(= |#race~data~0| |threadThread1of4ForFork0_#t~nondet5|), 146#true, 177#true, 147#true, Black: 152#(= |#race~data~0| 0), 46#L1022-3true, 58#L1023-5true, 144#true, 142#true]) [2024-11-19 06:05:22,747 INFO L294 olderBase$Statistics]: this new event has 150 ancestors and is cut-off event [2024-11-19 06:05:22,747 INFO L297 olderBase$Statistics]: existing Event has 106 ancestors and is cut-off event [2024-11-19 06:05:22,747 INFO L297 olderBase$Statistics]: existing Event has 150 ancestors and is cut-off event [2024-11-19 06:05:22,747 INFO L297 olderBase$Statistics]: existing Event has 106 ancestors and is cut-off event [2024-11-19 06:05:22,926 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([648] L1023-4-->L1023-5: Formula: (= |v_threadThread4of4ForFork0_#t~nondet5_3| |v_#race~data~0_4|) InVars {threadThread4of4ForFork0_#t~nondet5=|v_threadThread4of4ForFork0_#t~nondet5_3|} OutVars{threadThread4of4ForFork0_#t~nondet5=|v_threadThread4of4ForFork0_#t~nondet5_3|, #race~data~0=|v_#race~data~0_4|} AuxVars[] AssignedVars[#race~data~0][184], [120#L1038-1true, 24#L1023-5true, 172#true, 148#true, 100#L1023-6true, Black: 163#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 174#(= |#race~data~0| |threadThread1of4ForFork0_#t~nondet5|), 146#true, 177#true, 143#true, Black: 152#(= |#race~data~0| 0), 58#L1023-5true, 142#true]) [2024-11-19 06:05:22,926 INFO L294 olderBase$Statistics]: this new event has 154 ancestors and is cut-off event [2024-11-19 06:05:22,926 INFO L297 olderBase$Statistics]: existing Event has 154 ancestors and is cut-off event [2024-11-19 06:05:22,926 INFO L297 olderBase$Statistics]: existing Event has 154 ancestors and is cut-off event [2024-11-19 06:05:22,927 INFO L297 olderBase$Statistics]: existing Event has 154 ancestors and is cut-off event [2024-11-19 06:05:22,998 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([600] L1023-4-->L1023-5: Formula: (= |v_#race~data~0_4| |v_threadThread3of4ForFork0_#t~nondet5_3|) InVars {threadThread3of4ForFork0_#t~nondet5=|v_threadThread3of4ForFork0_#t~nondet5_3|} OutVars{#race~data~0=|v_#race~data~0_4|, threadThread3of4ForFork0_#t~nondet5=|v_threadThread3of4ForFork0_#t~nondet5_3|} AuxVars[] AssignedVars[#race~data~0][152], [120#L1038-1true, 114#L1023-5true, 172#true, Black: 163#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 174#(= |#race~data~0| |threadThread1of4ForFork0_#t~nondet5|), 146#true, 177#true, 147#true, 21#threadErr0ASSERT_VIOLATIONDATA_RACEtrue, Black: 152#(= |#race~data~0| 0), 58#L1023-5true, 144#true, 142#true]) [2024-11-19 06:05:22,999 INFO L294 olderBase$Statistics]: this new event has 154 ancestors and is cut-off event [2024-11-19 06:05:22,999 INFO L297 olderBase$Statistics]: existing Event has 110 ancestors and is cut-off event [2024-11-19 06:05:22,999 INFO L297 olderBase$Statistics]: existing Event has 110 ancestors and is cut-off event [2024-11-19 06:05:22,999 INFO L297 olderBase$Statistics]: existing Event has 154 ancestors and is cut-off event [2024-11-19 06:05:23,625 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([648] L1023-4-->L1023-5: Formula: (= |v_threadThread4of4ForFork0_#t~nondet5_3| |v_#race~data~0_4|) InVars {threadThread4of4ForFork0_#t~nondet5=|v_threadThread4of4ForFork0_#t~nondet5_3|} OutVars{threadThread4of4ForFork0_#t~nondet5=|v_threadThread4of4ForFork0_#t~nondet5_3|, #race~data~0=|v_#race~data~0_4|} AuxVars[] AssignedVars[#race~data~0][179], [120#L1038-1true, 24#L1023-5true, 132#L1024true, 172#true, 148#true, Black: 163#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 174#(= |#race~data~0| |threadThread1of4ForFork0_#t~nondet5|), 146#true, 177#true, 143#true, Black: 152#(= |#race~data~0| 0), 58#L1023-5true, 142#true]) [2024-11-19 06:05:23,625 INFO L294 olderBase$Statistics]: this new event has 156 ancestors and is not cut-off event [2024-11-19 06:05:23,625 INFO L297 olderBase$Statistics]: existing Event has 156 ancestors and is not cut-off event [2024-11-19 06:05:23,626 INFO L297 olderBase$Statistics]: existing Event has 156 ancestors and is not cut-off event [2024-11-19 06:05:23,626 INFO L297 olderBase$Statistics]: existing Event has 156 ancestors and is not cut-off event [2024-11-19 06:05:24,323 INFO L124 PetriNetUnfolderBase]: 19999/58031 cut-off events. [2024-11-19 06:05:24,323 INFO L125 PetriNetUnfolderBase]: For 9636/13605 co-relation queries the response was YES. [2024-11-19 06:05:24,620 INFO L83 FinitePrefix]: Finished finitePrefix Result has 100957 conditions, 58031 events. 19999/58031 cut-off events. For 9636/13605 co-relation queries the response was YES. Maximal size of possible extension queue 1947. Compared 761259 event pairs, 9797 based on Foata normal form. 80/50818 useless extension candidates. Maximal degree in co-relation 79535. Up to 12713 conditions per place. [2024-11-19 06:05:24,879 INFO L140 encePairwiseOnDemand]: 139/145 looper letters, 58 selfloop transitions, 5 changer transitions 0/186 dead transitions. [2024-11-19 06:05:24,880 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 157 places, 186 transitions, 648 flow [2024-11-19 06:05:24,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 06:05:24,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-19 06:05:24,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 724 transitions. [2024-11-19 06:05:24,881 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.832183908045977 [2024-11-19 06:05:24,881 INFO L175 Difference]: Start difference. First operand has 153 places, 155 transitions, 460 flow. Second operand 6 states and 724 transitions. [2024-11-19 06:05:24,882 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 157 places, 186 transitions, 648 flow [2024-11-19 06:05:24,970 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 155 places, 186 transitions, 626 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 06:05:24,972 INFO L231 Difference]: Finished difference. Result has 155 places, 154 transitions, 446 flow [2024-11-19 06:05:24,972 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=145, PETRI_DIFFERENCE_MINUEND_FLOW=436, PETRI_DIFFERENCE_MINUEND_PLACES=150, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=154, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=149, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=446, PETRI_PLACES=155, PETRI_TRANSITIONS=154} [2024-11-19 06:05:24,973 INFO L277 CegarLoopForPetriNet]: 147 programPoint places, 8 predicate places. [2024-11-19 06:05:24,973 INFO L471 AbstractCegarLoop]: Abstraction has has 155 places, 154 transitions, 446 flow [2024-11-19 06:05:24,973 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 112.16666666666667) internal successors, (673), 6 states have internal predecessors, (673), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:05:24,973 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 06:05:24,974 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:05:24,974 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-11-19 06:05:24,974 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2024-11-19 06:05:24,974 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:05:24,974 INFO L85 PathProgramCache]: Analyzing trace with hash 1581356987, now seen corresponding path program 1 times [2024-11-19 06:05:24,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:05:24,975 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2118681840] [2024-11-19 06:05:24,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:05:24,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:05:24,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:05:25,037 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:05:25,038 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:05:25,038 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2118681840] [2024-11-19 06:05:25,038 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2118681840] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 06:05:25,038 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1616291643] [2024-11-19 06:05:25,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:05:25,039 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 06:05:25,039 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 06:05:25,040 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 06:05:25,044 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-19 06:05:25,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:05:25,129 INFO L255 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-19 06:05:25,131 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:05:25,165 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:05:25,165 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 06:05:25,220 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:05:25,222 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1616291643] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 06:05:25,223 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 06:05:25,223 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 9 [2024-11-19 06:05:25,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [342973908] [2024-11-19 06:05:25,223 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 06:05:25,223 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-19 06:05:25,224 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:05:25,224 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-19 06:05:25,224 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-11-19 06:05:25,363 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 145 [2024-11-19 06:05:25,364 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 155 places, 154 transitions, 446 flow. Second operand has 9 states, 9 states have (on average 115.22222222222223) internal successors, (1037), 9 states have internal predecessors, (1037), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:05:25,364 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 06:05:25,364 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 145 [2024-11-19 06:05:25,365 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 06:05:28,619 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([648] L1023-4-->L1023-5: Formula: (= |v_threadThread4of4ForFork0_#t~nondet5_3| |v_#race~data~0_4|) InVars {threadThread4of4ForFork0_#t~nondet5=|v_threadThread4of4ForFork0_#t~nondet5_3|} OutVars{threadThread4of4ForFork0_#t~nondet5=|v_threadThread4of4ForFork0_#t~nondet5_3|, #race~data~0=|v_#race~data~0_4|} AuxVars[] AssignedVars[#race~data~0][192], [120#L1038-1true, 24#L1023-5true, 100#L1023-6true, Black: 163#(= |ULTIMATE.start_main_~i~0#1| 0), 148#true, 187#(<= 1 |ULTIMATE.start_main_~threads_total~0#1|), Black: 174#(= |#race~data~0| |threadThread1of4ForFork0_#t~nondet5|), 146#true, 177#true, 143#true, Black: 152#(= |#race~data~0| 0), 58#L1023-5true, 142#true]) [2024-11-19 06:05:28,620 INFO L294 olderBase$Statistics]: this new event has 154 ancestors and is cut-off event [2024-11-19 06:05:28,620 INFO L297 olderBase$Statistics]: existing Event has 154 ancestors and is cut-off event [2024-11-19 06:05:28,620 INFO L297 olderBase$Statistics]: existing Event has 154 ancestors and is cut-off event [2024-11-19 06:05:28,620 INFO L297 olderBase$Statistics]: existing Event has 154 ancestors and is cut-off event [2024-11-19 06:05:29,510 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([648] L1023-4-->L1023-5: Formula: (= |v_threadThread4of4ForFork0_#t~nondet5_3| |v_#race~data~0_4|) InVars {threadThread4of4ForFork0_#t~nondet5=|v_threadThread4of4ForFork0_#t~nondet5_3|} OutVars{threadThread4of4ForFork0_#t~nondet5=|v_threadThread4of4ForFork0_#t~nondet5_3|, #race~data~0=|v_#race~data~0_4|} AuxVars[] AssignedVars[#race~data~0][190], [120#L1038-1true, 24#L1023-5true, 132#L1024true, Black: 163#(= |ULTIMATE.start_main_~i~0#1| 0), 148#true, 187#(<= 1 |ULTIMATE.start_main_~threads_total~0#1|), Black: 174#(= |#race~data~0| |threadThread1of4ForFork0_#t~nondet5|), 146#true, 177#true, 143#true, Black: 152#(= |#race~data~0| 0), 58#L1023-5true, 142#true]) [2024-11-19 06:05:29,510 INFO L294 olderBase$Statistics]: this new event has 156 ancestors and is not cut-off event [2024-11-19 06:05:29,510 INFO L297 olderBase$Statistics]: existing Event has 156 ancestors and is not cut-off event [2024-11-19 06:05:29,510 INFO L297 olderBase$Statistics]: existing Event has 156 ancestors and is not cut-off event [2024-11-19 06:05:29,510 INFO L297 olderBase$Statistics]: existing Event has 156 ancestors and is not cut-off event [2024-11-19 06:05:29,882 INFO L124 PetriNetUnfolderBase]: 11192/37624 cut-off events. [2024-11-19 06:05:29,882 INFO L125 PetriNetUnfolderBase]: For 6000/7803 co-relation queries the response was YES. [2024-11-19 06:05:30,032 INFO L83 FinitePrefix]: Finished finitePrefix Result has 64698 conditions, 37624 events. 11192/37624 cut-off events. For 6000/7803 co-relation queries the response was YES. Maximal size of possible extension queue 1092. Compared 482348 event pairs, 3970 based on Foata normal form. 15/33084 useless extension candidates. Maximal degree in co-relation 32683. Up to 6542 conditions per place. [2024-11-19 06:05:30,154 INFO L140 encePairwiseOnDemand]: 135/145 looper letters, 61 selfloop transitions, 10 changer transitions 0/195 dead transitions. [2024-11-19 06:05:30,155 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 162 places, 195 transitions, 684 flow [2024-11-19 06:05:30,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-19 06:05:30,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-11-19 06:05:30,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 976 transitions. [2024-11-19 06:05:30,156 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8413793103448276 [2024-11-19 06:05:30,156 INFO L175 Difference]: Start difference. First operand has 155 places, 154 transitions, 446 flow. Second operand 8 states and 976 transitions. [2024-11-19 06:05:30,156 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 162 places, 195 transitions, 684 flow [2024-11-19 06:05:30,177 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 157 places, 195 transitions, 672 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-11-19 06:05:30,179 INFO L231 Difference]: Finished difference. Result has 160 places, 157 transitions, 480 flow [2024-11-19 06:05:30,179 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=145, PETRI_DIFFERENCE_MINUEND_FLOW=436, PETRI_DIFFERENCE_MINUEND_PLACES=150, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=154, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=145, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=480, PETRI_PLACES=160, PETRI_TRANSITIONS=157} [2024-11-19 06:05:30,180 INFO L277 CegarLoopForPetriNet]: 147 programPoint places, 13 predicate places. [2024-11-19 06:05:30,180 INFO L471 AbstractCegarLoop]: Abstraction has has 160 places, 157 transitions, 480 flow [2024-11-19 06:05:30,180 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 115.22222222222223) internal successors, (1037), 9 states have internal predecessors, (1037), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:05:30,180 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 06:05:30,181 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:05:30,194 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-19 06:05:30,381 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 06:05:30,381 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2024-11-19 06:05:30,382 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:05:30,382 INFO L85 PathProgramCache]: Analyzing trace with hash -900737980, now seen corresponding path program 1 times [2024-11-19 06:05:30,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:05:30,382 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [559634206] [2024-11-19 06:05:30,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:05:30,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:05:30,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:05:30,405 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-19 06:05:30,405 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:05:30,405 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [559634206] [2024-11-19 06:05:30,406 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [559634206] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:05:30,406 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:05:30,406 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 06:05:30,406 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1406967460] [2024-11-19 06:05:30,406 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:05:30,406 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 06:05:30,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:05:30,407 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 06:05:30,407 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 06:05:30,423 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 145 [2024-11-19 06:05:30,423 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 160 places, 157 transitions, 480 flow. Second operand has 3 states, 3 states have (on average 119.0) internal successors, (357), 3 states have internal predecessors, (357), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:05:30,423 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 06:05:30,423 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 145 [2024-11-19 06:05:30,423 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 06:05:35,751 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([550] L1037-1-->L1038: Formula: (= |v_#race~data~0_1| 0) InVars {} OutVars{#race~data~0=|v_#race~data~0_1|} AuxVars[] AssignedVars[#race~data~0][161], [Black: 185#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 188#(and (= |ULTIMATE.start_main_~i~1#1| 0) (<= 1 |ULTIMATE.start_main_~threads_total~0#1|)), 145#true, Black: 163#(= |ULTIMATE.start_main_~i~0#1| 0), 100#L1023-6true, 71#L1038true, 187#(<= 1 |ULTIMATE.start_main_~threads_total~0#1|), Black: 174#(= |#race~data~0| |threadThread1of4ForFork0_#t~nondet5|), 34#L1024true, 147#true, Black: 150#true, 547#true, 144#true, 142#true]) [2024-11-19 06:05:35,752 INFO L294 olderBase$Statistics]: this new event has 175 ancestors and is cut-off event [2024-11-19 06:05:35,752 INFO L297 olderBase$Statistics]: existing Event has 131 ancestors and is cut-off event [2024-11-19 06:05:35,752 INFO L297 olderBase$Statistics]: existing Event has 175 ancestors and is cut-off event [2024-11-19 06:05:35,752 INFO L297 olderBase$Statistics]: existing Event has 131 ancestors and is cut-off event [2024-11-19 06:05:35,762 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([550] L1037-1-->L1038: Formula: (= |v_#race~data~0_1| 0) InVars {} OutVars{#race~data~0=|v_#race~data~0_1|} AuxVars[] AssignedVars[#race~data~0][161], [Black: 185#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 188#(and (= |ULTIMATE.start_main_~i~1#1| 0) (<= 1 |ULTIMATE.start_main_~threads_total~0#1|)), 145#true, Black: 163#(= |ULTIMATE.start_main_~i~0#1| 0), 100#L1023-6true, 187#(<= 1 |ULTIMATE.start_main_~threads_total~0#1|), 71#L1038true, 119#L1024-3true, Black: 174#(= |#race~data~0| |threadThread1of4ForFork0_#t~nondet5|), 147#true, Black: 150#true, 547#true, 144#true, 142#true]) [2024-11-19 06:05:35,762 INFO L294 olderBase$Statistics]: this new event has 176 ancestors and is cut-off event [2024-11-19 06:05:35,762 INFO L297 olderBase$Statistics]: existing Event has 132 ancestors and is cut-off event [2024-11-19 06:05:35,762 INFO L297 olderBase$Statistics]: existing Event has 176 ancestors and is cut-off event [2024-11-19 06:05:35,762 INFO L297 olderBase$Statistics]: existing Event has 132 ancestors and is cut-off event [2024-11-19 06:05:35,816 INFO L124 PetriNetUnfolderBase]: 11771/39207 cut-off events. [2024-11-19 06:05:35,817 INFO L125 PetriNetUnfolderBase]: For 22855/25072 co-relation queries the response was YES. [2024-11-19 06:05:35,981 INFO L83 FinitePrefix]: Finished finitePrefix Result has 77047 conditions, 39207 events. 11771/39207 cut-off events. For 22855/25072 co-relation queries the response was YES. Maximal size of possible extension queue 1521. Compared 529642 event pairs, 6498 based on Foata normal form. 35/35580 useless extension candidates. Maximal degree in co-relation 69546. Up to 13618 conditions per place. [2024-11-19 06:05:36,120 INFO L140 encePairwiseOnDemand]: 137/145 looper letters, 43 selfloop transitions, 18 changer transitions 0/182 dead transitions. [2024-11-19 06:05:36,120 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 162 places, 182 transitions, 725 flow [2024-11-19 06:05:36,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 06:05:36,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 06:05:36,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 394 transitions. [2024-11-19 06:05:36,121 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9057471264367816 [2024-11-19 06:05:36,122 INFO L175 Difference]: Start difference. First operand has 160 places, 157 transitions, 480 flow. Second operand 3 states and 394 transitions. [2024-11-19 06:05:36,122 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 162 places, 182 transitions, 725 flow [2024-11-19 06:05:36,150 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 159 places, 182 transitions, 719 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-11-19 06:05:36,152 INFO L231 Difference]: Finished difference. Result has 161 places, 171 transitions, 652 flow [2024-11-19 06:05:36,152 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=145, PETRI_DIFFERENCE_MINUEND_FLOW=474, PETRI_DIFFERENCE_MINUEND_PLACES=157, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=157, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=139, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=652, PETRI_PLACES=161, PETRI_TRANSITIONS=171} [2024-11-19 06:05:36,153 INFO L277 CegarLoopForPetriNet]: 147 programPoint places, 14 predicate places. [2024-11-19 06:05:36,153 INFO L471 AbstractCegarLoop]: Abstraction has has 161 places, 171 transitions, 652 flow [2024-11-19 06:05:36,153 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 119.0) internal successors, (357), 3 states have internal predecessors, (357), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:05:36,153 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 06:05:36,153 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:05:36,153 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-11-19 06:05:36,154 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2024-11-19 06:05:36,154 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:05:36,154 INFO L85 PathProgramCache]: Analyzing trace with hash 1714902840, now seen corresponding path program 1 times [2024-11-19 06:05:36,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:05:36,154 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [573635414] [2024-11-19 06:05:36,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:05:36,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:05:36,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:05:36,196 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-19 06:05:36,196 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:05:36,197 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [573635414] [2024-11-19 06:05:36,197 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [573635414] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:05:36,197 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:05:36,197 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 06:05:36,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [586559605] [2024-11-19 06:05:36,197 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:05:36,197 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 06:05:36,197 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:05:36,198 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 06:05:36,198 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 06:05:36,205 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 145 [2024-11-19 06:05:36,205 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 161 places, 171 transitions, 652 flow. Second operand has 3 states, 3 states have (on average 126.66666666666667) internal successors, (380), 3 states have internal predecessors, (380), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:05:36,205 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 06:05:36,205 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 145 [2024-11-19 06:05:36,205 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 06:05:36,736 INFO L124 PetriNetUnfolderBase]: 660/6386 cut-off events. [2024-11-19 06:05:36,736 INFO L125 PetriNetUnfolderBase]: For 3202/3390 co-relation queries the response was YES. [2024-11-19 06:05:36,760 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11149 conditions, 6386 events. 660/6386 cut-off events. For 3202/3390 co-relation queries the response was YES. Maximal size of possible extension queue 261. Compared 73150 event pairs, 237 based on Foata normal form. 177/6223 useless extension candidates. Maximal degree in co-relation 8698. Up to 678 conditions per place. [2024-11-19 06:05:36,773 INFO L140 encePairwiseOnDemand]: 137/145 looper letters, 16 selfloop transitions, 8 changer transitions 0/161 dead transitions. [2024-11-19 06:05:36,773 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 163 places, 161 transitions, 585 flow [2024-11-19 06:05:36,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 06:05:36,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 06:05:36,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 403 transitions. [2024-11-19 06:05:36,774 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9264367816091954 [2024-11-19 06:05:36,774 INFO L175 Difference]: Start difference. First operand has 161 places, 171 transitions, 652 flow. Second operand 3 states and 403 transitions. [2024-11-19 06:05:36,775 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 163 places, 161 transitions, 585 flow [2024-11-19 06:05:36,784 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 161 places, 161 transitions, 571 flow, removed 2 selfloop flow, removed 2 redundant places. [2024-11-19 06:05:36,786 INFO L231 Difference]: Finished difference. Result has 161 places, 154 transitions, 492 flow [2024-11-19 06:05:36,786 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=145, PETRI_DIFFERENCE_MINUEND_FLOW=476, PETRI_DIFFERENCE_MINUEND_PLACES=159, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=154, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=146, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=492, PETRI_PLACES=161, PETRI_TRANSITIONS=154} [2024-11-19 06:05:36,787 INFO L277 CegarLoopForPetriNet]: 147 programPoint places, 14 predicate places. [2024-11-19 06:05:36,787 INFO L471 AbstractCegarLoop]: Abstraction has has 161 places, 154 transitions, 492 flow [2024-11-19 06:05:36,787 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 126.66666666666667) internal successors, (380), 3 states have internal predecessors, (380), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:05:36,787 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 06:05:36,788 INFO L204 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:05:36,788 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-11-19 06:05:36,788 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2024-11-19 06:05:36,788 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:05:36,788 INFO L85 PathProgramCache]: Analyzing trace with hash -2046835631, now seen corresponding path program 1 times [2024-11-19 06:05:36,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:05:36,788 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1367874590] [2024-11-19 06:05:36,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:05:36,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:05:36,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:05:36,818 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2024-11-19 06:05:36,818 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:05:36,818 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1367874590] [2024-11-19 06:05:36,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1367874590] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:05:36,819 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:05:36,819 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 06:05:36,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [426282331] [2024-11-19 06:05:36,819 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:05:36,819 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 06:05:36,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:05:36,820 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 06:05:36,820 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 06:05:36,836 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 145 [2024-11-19 06:05:36,837 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 161 places, 154 transitions, 492 flow. Second operand has 3 states, 3 states have (on average 119.33333333333333) internal successors, (358), 3 states have internal predecessors, (358), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:05:36,837 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 06:05:36,837 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 145 [2024-11-19 06:05:36,837 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 06:05:38,111 INFO L124 PetriNetUnfolderBase]: 1114/7737 cut-off events. [2024-11-19 06:05:38,112 INFO L125 PetriNetUnfolderBase]: For 6587/6748 co-relation queries the response was YES. [2024-11-19 06:05:38,141 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15370 conditions, 7737 events. 1114/7737 cut-off events. For 6587/6748 co-relation queries the response was YES. Maximal size of possible extension queue 337. Compared 92194 event pairs, 714 based on Foata normal form. 7/7220 useless extension candidates. Maximal degree in co-relation 12078. Up to 2065 conditions per place. [2024-11-19 06:05:38,159 INFO L140 encePairwiseOnDemand]: 140/145 looper letters, 33 selfloop transitions, 5 changer transitions 0/161 dead transitions. [2024-11-19 06:05:38,159 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 163 places, 161 transitions, 606 flow [2024-11-19 06:05:38,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 06:05:38,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 06:05:38,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 384 transitions. [2024-11-19 06:05:38,160 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8827586206896552 [2024-11-19 06:05:38,161 INFO L175 Difference]: Start difference. First operand has 161 places, 154 transitions, 492 flow. Second operand 3 states and 384 transitions. [2024-11-19 06:05:38,161 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 163 places, 161 transitions, 606 flow [2024-11-19 06:05:38,168 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 162 places, 161 transitions, 598 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-19 06:05:38,170 INFO L231 Difference]: Finished difference. Result has 164 places, 157 transitions, 524 flow [2024-11-19 06:05:38,170 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=145, PETRI_DIFFERENCE_MINUEND_FLOW=484, PETRI_DIFFERENCE_MINUEND_PLACES=160, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=154, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=149, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=524, PETRI_PLACES=164, PETRI_TRANSITIONS=157} [2024-11-19 06:05:38,170 INFO L277 CegarLoopForPetriNet]: 147 programPoint places, 17 predicate places. [2024-11-19 06:05:38,170 INFO L471 AbstractCegarLoop]: Abstraction has has 164 places, 157 transitions, 524 flow [2024-11-19 06:05:38,171 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 119.33333333333333) internal successors, (358), 3 states have internal predecessors, (358), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:05:38,171 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 06:05:38,171 INFO L204 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:05:38,171 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-11-19 06:05:38,171 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2024-11-19 06:05:38,172 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:05:38,172 INFO L85 PathProgramCache]: Analyzing trace with hash 535690515, now seen corresponding path program 1 times [2024-11-19 06:05:38,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:05:38,172 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1122924932] [2024-11-19 06:05:38,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:05:38,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:05:38,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:05:38,218 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-11-19 06:05:38,218 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:05:38,218 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1122924932] [2024-11-19 06:05:38,218 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1122924932] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:05:38,218 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:05:38,218 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 06:05:38,219 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [572150776] [2024-11-19 06:05:38,219 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:05:38,219 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 06:05:38,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:05:38,219 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 06:05:38,219 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 06:05:38,237 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 145 [2024-11-19 06:05:38,238 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 164 places, 157 transitions, 524 flow. Second operand has 3 states, 3 states have (on average 119.66666666666667) internal successors, (359), 3 states have internal predecessors, (359), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:05:38,238 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 06:05:38,238 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 145 [2024-11-19 06:05:38,238 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 06:05:39,065 INFO L124 PetriNetUnfolderBase]: 1121/8023 cut-off events. [2024-11-19 06:05:39,065 INFO L125 PetriNetUnfolderBase]: For 8757/8909 co-relation queries the response was YES. [2024-11-19 06:05:39,085 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16443 conditions, 8023 events. 1121/8023 cut-off events. For 8757/8909 co-relation queries the response was YES. Maximal size of possible extension queue 355. Compared 96497 event pairs, 707 based on Foata normal form. 4/7570 useless extension candidates. Maximal degree in co-relation 13158. Up to 2095 conditions per place. [2024-11-19 06:05:39,098 INFO L140 encePairwiseOnDemand]: 140/145 looper letters, 33 selfloop transitions, 5 changer transitions 0/163 dead transitions. [2024-11-19 06:05:39,099 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 166 places, 163 transitions, 629 flow [2024-11-19 06:05:39,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 06:05:39,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 06:05:39,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 383 transitions. [2024-11-19 06:05:39,100 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8804597701149425 [2024-11-19 06:05:39,100 INFO L175 Difference]: Start difference. First operand has 164 places, 157 transitions, 524 flow. Second operand 3 states and 383 transitions. [2024-11-19 06:05:39,100 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 166 places, 163 transitions, 629 flow [2024-11-19 06:05:39,109 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 164 places, 163 transitions, 615 flow, removed 2 selfloop flow, removed 2 redundant places. [2024-11-19 06:05:39,111 INFO L231 Difference]: Finished difference. Result has 166 places, 160 transitions, 552 flow [2024-11-19 06:05:39,111 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=145, PETRI_DIFFERENCE_MINUEND_FLOW=510, PETRI_DIFFERENCE_MINUEND_PLACES=162, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=157, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=152, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=552, PETRI_PLACES=166, PETRI_TRANSITIONS=160} [2024-11-19 06:05:39,111 INFO L277 CegarLoopForPetriNet]: 147 programPoint places, 19 predicate places. [2024-11-19 06:05:39,111 INFO L471 AbstractCegarLoop]: Abstraction has has 166 places, 160 transitions, 552 flow [2024-11-19 06:05:39,112 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 119.66666666666667) internal successors, (359), 3 states have internal predecessors, (359), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:05:39,112 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 06:05:39,112 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:05:39,112 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-11-19 06:05:39,112 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2024-11-19 06:05:39,112 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:05:39,113 INFO L85 PathProgramCache]: Analyzing trace with hash -1938862278, now seen corresponding path program 1 times [2024-11-19 06:05:39,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:05:39,113 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [804389943] [2024-11-19 06:05:39,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:05:39,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:05:39,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:05:39,264 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:05:39,264 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:05:39,264 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [804389943] [2024-11-19 06:05:39,264 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [804389943] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 06:05:39,265 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [151870128] [2024-11-19 06:05:39,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:05:39,265 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 06:05:39,265 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 06:05:39,270 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 06:05:39,271 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-19 06:05:39,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:05:39,372 INFO L255 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-19 06:05:39,373 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:05:39,525 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 1 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:05:39,526 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 06:05:39,643 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 1 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:05:39,644 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [151870128] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 06:05:39,645 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 06:05:39,645 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 16 [2024-11-19 06:05:39,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [133229229] [2024-11-19 06:05:39,645 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 06:05:39,645 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-19 06:05:39,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:05:39,646 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-19 06:05:39,646 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=191, Unknown=0, NotChecked=0, Total=240 [2024-11-19 06:05:39,906 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 145 [2024-11-19 06:05:39,908 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 166 places, 160 transitions, 552 flow. Second operand has 16 states, 16 states have (on average 111.8125) internal successors, (1789), 16 states have internal predecessors, (1789), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:05:39,908 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 06:05:39,908 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 145 [2024-11-19 06:05:39,908 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 06:05:41,345 INFO L124 PetriNetUnfolderBase]: 2232/9384 cut-off events. [2024-11-19 06:05:41,345 INFO L125 PetriNetUnfolderBase]: For 5324/5534 co-relation queries the response was YES. [2024-11-19 06:05:41,380 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18833 conditions, 9384 events. 2232/9384 cut-off events. For 5324/5534 co-relation queries the response was YES. Maximal size of possible extension queue 237. Compared 97035 event pairs, 170 based on Foata normal form. 110/9234 useless extension candidates. Maximal degree in co-relation 9495. Up to 1097 conditions per place. [2024-11-19 06:05:41,400 INFO L140 encePairwiseOnDemand]: 132/145 looper letters, 101 selfloop transitions, 16 changer transitions 22/262 dead transitions. [2024-11-19 06:05:41,400 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 180 places, 262 transitions, 1166 flow [2024-11-19 06:05:41,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-19 06:05:41,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2024-11-19 06:05:41,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 1774 transitions. [2024-11-19 06:05:41,403 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8156321839080459 [2024-11-19 06:05:41,403 INFO L175 Difference]: Start difference. First operand has 166 places, 160 transitions, 552 flow. Second operand 15 states and 1774 transitions. [2024-11-19 06:05:41,403 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 180 places, 262 transitions, 1166 flow [2024-11-19 06:05:41,416 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 178 places, 262 transitions, 1150 flow, removed 3 selfloop flow, removed 2 redundant places. [2024-11-19 06:05:41,418 INFO L231 Difference]: Finished difference. Result has 184 places, 167 transitions, 620 flow [2024-11-19 06:05:41,419 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=145, PETRI_DIFFERENCE_MINUEND_FLOW=536, PETRI_DIFFERENCE_MINUEND_PLACES=164, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=160, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=147, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=620, PETRI_PLACES=184, PETRI_TRANSITIONS=167} [2024-11-19 06:05:41,419 INFO L277 CegarLoopForPetriNet]: 147 programPoint places, 37 predicate places. [2024-11-19 06:05:41,419 INFO L471 AbstractCegarLoop]: Abstraction has has 184 places, 167 transitions, 620 flow [2024-11-19 06:05:41,420 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 111.8125) internal successors, (1789), 16 states have internal predecessors, (1789), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:05:41,420 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 06:05:41,420 INFO L204 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:05:41,437 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-19 06:05:41,621 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 06:05:41,621 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2024-11-19 06:05:41,622 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:05:41,622 INFO L85 PathProgramCache]: Analyzing trace with hash -508767168, now seen corresponding path program 1 times [2024-11-19 06:05:41,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:05:41,622 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1793022019] [2024-11-19 06:05:41,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:05:41,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:05:41,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 06:05:41,644 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 06:05:41,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 06:05:41,670 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 06:05:41,671 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-19 06:05:41,671 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (8 of 9 remaining) [2024-11-19 06:05:41,671 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (7 of 9 remaining) [2024-11-19 06:05:41,672 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (6 of 9 remaining) [2024-11-19 06:05:41,672 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (5 of 9 remaining) [2024-11-19 06:05:41,672 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (4 of 9 remaining) [2024-11-19 06:05:41,672 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (3 of 9 remaining) [2024-11-19 06:05:41,672 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (2 of 9 remaining) [2024-11-19 06:05:41,672 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (1 of 9 remaining) [2024-11-19 06:05:41,672 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (0 of 9 remaining) [2024-11-19 06:05:41,672 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2024-11-19 06:05:41,672 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:05:41,673 WARN L244 ceAbstractionStarter]: 4 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-19 06:05:41,673 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 5 thread instances. [2024-11-19 06:05:41,693 INFO L143 ThreadInstanceAdder]: Constructed 5 joinOtherThreadTransitions. [2024-11-19 06:05:41,696 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 166 places, 163 transitions, 381 flow [2024-11-19 06:05:41,781 INFO L124 PetriNetUnfolderBase]: 93/1046 cut-off events. [2024-11-19 06:05:41,781 INFO L125 PetriNetUnfolderBase]: For 110/110 co-relation queries the response was YES. [2024-11-19 06:05:41,785 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1152 conditions, 1046 events. 93/1046 cut-off events. For 110/110 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 4924 event pairs, 23 based on Foata normal form. 0/894 useless extension candidates. Maximal degree in co-relation 637. Up to 80 conditions per place. [2024-11-19 06:05:41,785 INFO L82 GeneralOperation]: Start removeDead. Operand has 166 places, 163 transitions, 381 flow [2024-11-19 06:05:41,788 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 166 places, 163 transitions, 381 flow [2024-11-19 06:05:41,789 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 06:05:41,790 INFO L333 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, 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;@ece4844, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 06:05:41,790 INFO L334 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2024-11-19 06:05:41,792 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-19 06:05:41,792 INFO L124 PetriNetUnfolderBase]: 3/50 cut-off events. [2024-11-19 06:05:41,792 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-19 06:05:41,792 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 06:05:41,792 INFO L204 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] [2024-11-19 06:05:41,792 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 7 more)] === [2024-11-19 06:05:41,792 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:05:41,793 INFO L85 PathProgramCache]: Analyzing trace with hash -143201679, now seen corresponding path program 1 times [2024-11-19 06:05:41,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:05:41,793 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1298202899] [2024-11-19 06:05:41,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:05:41,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:05:41,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:05:41,805 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:05:41,805 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:05:41,805 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1298202899] [2024-11-19 06:05:41,805 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1298202899] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:05:41,805 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:05:41,805 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 06:05:41,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1089082686] [2024-11-19 06:05:41,805 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:05:41,806 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 06:05:41,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:05:41,806 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 06:05:41,806 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 06:05:41,822 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 132 out of 163 [2024-11-19 06:05:41,823 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 166 places, 163 transitions, 381 flow. Second operand has 3 states, 3 states have (on average 132.66666666666666) internal successors, (398), 3 states have internal predecessors, (398), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:05:41,823 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 06:05:41,823 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 132 of 163 [2024-11-19 06:05:41,823 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand