./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/no-data-race.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-ext/14_spin2003.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version a046e57d Calling Ultimate with: /root/.sdkman/candidates/java/current/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 /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-ext/14_spin2003.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 f5ed9d077a05ec08544f0d3c902eb6b5aa6ad768c4ec69a1caaef2b54748a07e --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 09:30:16,199 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 09:30:16,286 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2024-10-13 09:30:16,292 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 09:30:16,294 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 09:30:16,324 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 09:30:16,325 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 09:30:16,326 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 09:30:16,326 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 09:30:16,327 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 09:30:16,327 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 09:30:16,328 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 09:30:16,328 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 09:30:16,329 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 09:30:16,329 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 09:30:16,329 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 09:30:16,330 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 09:30:16,330 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 09:30:16,330 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 09:30:16,331 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 09:30:16,331 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 09:30:16,336 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 09:30:16,336 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2024-10-13 09:30:16,337 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 09:30:16,337 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-13 09:30:16,337 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 09:30:16,337 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 09:30:16,337 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 09:30:16,338 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 09:30:16,338 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 09:30:16,338 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 09:30:16,338 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 09:30:16,339 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 09:30:16,339 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 09:30:16,339 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 09:30:16,339 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-13 09:30:16,340 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-13 09:30:16,340 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 09:30:16,340 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 09:30:16,340 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 09:30:16,340 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 09:30:16,342 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 -> f5ed9d077a05ec08544f0d3c902eb6b5aa6ad768c4ec69a1caaef2b54748a07e [2024-10-13 09:30:16,605 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 09:30:16,632 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 09:30:16,635 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 09:30:16,637 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 09:30:16,637 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 09:30:16,638 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-ext/14_spin2003.i [2024-10-13 09:30:18,146 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 09:30:18,407 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 09:30:18,408 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-ext/14_spin2003.i [2024-10-13 09:30:18,421 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c6e767cf5/d3bdc6b8228c42e1b2366577c47e1027/FLAGbcee5fc97 [2024-10-13 09:30:18,727 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c6e767cf5/d3bdc6b8228c42e1b2366577c47e1027 [2024-10-13 09:30:18,729 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 09:30:18,731 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 09:30:18,732 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 09:30:18,732 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 09:30:18,739 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 09:30:18,740 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 09:30:18" (1/1) ... [2024-10-13 09:30:18,743 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@77c01305 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:30:18, skipping insertion in model container [2024-10-13 09:30:18,743 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 09:30:18" (1/1) ... [2024-10-13 09:30:18,795 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 09:30:19,238 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 09:30:19,249 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 09:30:19,306 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 09:30:19,346 INFO L204 MainTranslator]: Completed translation [2024-10-13 09:30:19,346 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:30:19 WrapperNode [2024-10-13 09:30:19,347 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 09:30:19,348 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 09:30:19,348 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 09:30:19,348 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 09:30:19,356 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:30:19" (1/1) ... [2024-10-13 09:30:19,373 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:30:19" (1/1) ... [2024-10-13 09:30:19,392 INFO L138 Inliner]: procedures = 168, calls = 12, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 66 [2024-10-13 09:30:19,393 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 09:30:19,393 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 09:30:19,394 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 09:30:19,394 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 09:30:19,401 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:30:19" (1/1) ... [2024-10-13 09:30:19,401 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:30:19" (1/1) ... [2024-10-13 09:30:19,403 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:30:19" (1/1) ... [2024-10-13 09:30:19,403 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:30:19" (1/1) ... [2024-10-13 09:30:19,408 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:30:19" (1/1) ... [2024-10-13 09:30:19,411 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:30:19" (1/1) ... [2024-10-13 09:30:19,414 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:30:19" (1/1) ... [2024-10-13 09:30:19,415 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:30:19" (1/1) ... [2024-10-13 09:30:19,417 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 09:30:19,418 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 09:30:19,418 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 09:30:19,418 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 09:30:19,419 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:30:19" (1/1) ... [2024-10-13 09:30:19,426 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 09:30:19,441 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 09:30:19,463 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-10-13 09:30:19,466 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-10-13 09:30:19,514 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2024-10-13 09:30:19,514 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2024-10-13 09:30:19,514 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 09:30:19,514 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-10-13 09:30:19,514 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 09:30:19,514 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 09:30:19,516 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-10-13 09:30:19,629 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 09:30:19,631 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 09:30:19,768 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-10-13 09:30:19,769 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 09:30:19,829 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 09:30:19,830 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-13 09:30:19,833 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 09:30:19 BoogieIcfgContainer [2024-10-13 09:30:19,833 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 09:30:19,835 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 09:30:19,835 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 09:30:19,838 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 09:30:19,838 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 09:30:18" (1/3) ... [2024-10-13 09:30:19,839 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6bd5317f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 09:30:19, skipping insertion in model container [2024-10-13 09:30:19,839 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:30:19" (2/3) ... [2024-10-13 09:30:19,839 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6bd5317f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 09:30:19, skipping insertion in model container [2024-10-13 09:30:19,839 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 09:30:19" (3/3) ... [2024-10-13 09:30:19,841 INFO L112 eAbstractionObserver]: Analyzing ICFG 14_spin2003.i [2024-10-13 09:30:19,856 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 09:30:19,856 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 7 error locations. [2024-10-13 09:30:19,856 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-10-13 09:30:19,894 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-10-13 09:30:19,937 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 54 places, 54 transitions, 112 flow [2024-10-13 09:30:19,971 INFO L124 PetriNetUnfolderBase]: 4/63 cut-off events. [2024-10-13 09:30:19,972 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-13 09:30:19,977 INFO L83 FinitePrefix]: Finished finitePrefix Result has 67 conditions, 63 events. 4/63 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 69 event pairs, 0 based on Foata normal form. 0/50 useless extension candidates. Maximal degree in co-relation 41. Up to 4 conditions per place. [2024-10-13 09:30:19,977 INFO L82 GeneralOperation]: Start removeDead. Operand has 54 places, 54 transitions, 112 flow [2024-10-13 09:30:19,982 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 54 places, 54 transitions, 112 flow [2024-10-13 09:30:19,998 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 09:30:20,008 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;@5dd90ab0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 09:30:20,009 INFO L334 AbstractCegarLoop]: Starting to check reachability of 15 error locations. [2024-10-13 09:30:20,018 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-10-13 09:30:20,021 INFO L124 PetriNetUnfolderBase]: 2/25 cut-off events. [2024-10-13 09:30:20,021 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-13 09:30:20,021 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 09:30:20,022 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 09:30:20,024 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2024-10-13 09:30:20,029 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:30:20,030 INFO L85 PathProgramCache]: Analyzing trace with hash -882884515, now seen corresponding path program 1 times [2024-10-13 09:30:20,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:30:20,039 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [58279677] [2024-10-13 09:30:20,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:30:20,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:30:20,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:30:20,224 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 09:30:20,224 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:30:20,225 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [58279677] [2024-10-13 09:30:20,225 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [58279677] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:30:20,225 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:30:20,225 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-13 09:30:20,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [230049433] [2024-10-13 09:30:20,227 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:30:20,234 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-13 09:30:20,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:30:20,261 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-13 09:30:20,262 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 09:30:20,263 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 42 out of 54 [2024-10-13 09:30:20,265 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 54 transitions, 112 flow. Second operand has 2 states, 2 states have (on average 43.0) internal successors, (86), 2 states have internal predecessors, (86), 0 states have call successors, (0), 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-10-13 09:30:20,265 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 09:30:20,266 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 42 of 54 [2024-10-13 09:30:20,266 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 09:30:20,297 INFO L124 PetriNetUnfolderBase]: 0/45 cut-off events. [2024-10-13 09:30:20,297 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-10-13 09:30:20,297 INFO L83 FinitePrefix]: Finished finitePrefix Result has 53 conditions, 45 events. 0/45 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 2. Compared 18 event pairs, 0 based on Foata normal form. 6/47 useless extension candidates. Maximal degree in co-relation 0. Up to 4 conditions per place. [2024-10-13 09:30:20,299 INFO L140 encePairwiseOnDemand]: 46/54 looper letters, 3 selfloop transitions, 0 changer transitions 0/41 dead transitions. [2024-10-13 09:30:20,299 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 41 transitions, 92 flow [2024-10-13 09:30:20,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-13 09:30:20,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2024-10-13 09:30:20,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 95 transitions. [2024-10-13 09:30:20,309 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8796296296296297 [2024-10-13 09:30:20,310 INFO L175 Difference]: Start difference. First operand has 54 places, 54 transitions, 112 flow. Second operand 2 states and 95 transitions. [2024-10-13 09:30:20,311 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 41 transitions, 92 flow [2024-10-13 09:30:20,313 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 41 transitions, 92 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-13 09:30:20,315 INFO L231 Difference]: Finished difference. Result has 45 places, 41 transitions, 86 flow [2024-10-13 09:30:20,316 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=86, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=86, PETRI_PLACES=45, PETRI_TRANSITIONS=41} [2024-10-13 09:30:20,320 INFO L277 CegarLoopForPetriNet]: 54 programPoint places, -9 predicate places. [2024-10-13 09:30:20,321 INFO L471 AbstractCegarLoop]: Abstraction has has 45 places, 41 transitions, 86 flow [2024-10-13 09:30:20,321 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 43.0) internal successors, (86), 2 states have internal predecessors, (86), 0 states have call successors, (0), 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-10-13 09:30:20,321 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 09:30:20,321 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 09:30:20,322 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-13 09:30:20,322 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2024-10-13 09:30:20,322 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:30:20,323 INFO L85 PathProgramCache]: Analyzing trace with hash 334194688, now seen corresponding path program 1 times [2024-10-13 09:30:20,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:30:20,323 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1539061083] [2024-10-13 09:30:20,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:30:20,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:30:20,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 09:30:20,359 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 09:30:20,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 09:30:20,392 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 09:30:20,393 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-13 09:30:20,394 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (14 of 15 remaining) [2024-10-13 09:30:20,397 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (13 of 15 remaining) [2024-10-13 09:30:20,398 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (12 of 15 remaining) [2024-10-13 09:30:20,399 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (11 of 15 remaining) [2024-10-13 09:30:20,399 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (10 of 15 remaining) [2024-10-13 09:30:20,400 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4ASSERT_VIOLATIONDATA_RACE (9 of 15 remaining) [2024-10-13 09:30:20,400 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5ASSERT_VIOLATIONDATA_RACE (8 of 15 remaining) [2024-10-13 09:30:20,400 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err6ASSERT_VIOLATIONDATA_RACE (7 of 15 remaining) [2024-10-13 09:30:20,401 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (6 of 15 remaining) [2024-10-13 09:30:20,401 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (5 of 15 remaining) [2024-10-13 09:30:20,401 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (4 of 15 remaining) [2024-10-13 09:30:20,402 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (3 of 15 remaining) [2024-10-13 09:30:20,403 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4ASSERT_VIOLATIONDATA_RACE (2 of 15 remaining) [2024-10-13 09:30:20,403 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5ASSERT_VIOLATIONDATA_RACE (1 of 15 remaining) [2024-10-13 09:30:20,404 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err6ASSERT_VIOLATIONDATA_RACE (0 of 15 remaining) [2024-10-13 09:30:20,404 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-13 09:30:20,404 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1] [2024-10-13 09:30:20,409 WARN L239 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2024-10-13 09:30:20,409 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2024-10-13 09:30:20,438 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-10-13 09:30:20,443 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 87 places, 87 transitions, 184 flow [2024-10-13 09:30:20,466 INFO L124 PetriNetUnfolderBase]: 7/105 cut-off events. [2024-10-13 09:30:20,466 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-10-13 09:30:20,468 INFO L83 FinitePrefix]: Finished finitePrefix Result has 113 conditions, 105 events. 7/105 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 212 event pairs, 0 based on Foata normal form. 0/81 useless extension candidates. Maximal degree in co-relation 73. Up to 6 conditions per place. [2024-10-13 09:30:20,469 INFO L82 GeneralOperation]: Start removeDead. Operand has 87 places, 87 transitions, 184 flow [2024-10-13 09:30:20,470 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 87 places, 87 transitions, 184 flow [2024-10-13 09:30:20,472 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 09:30:20,473 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;@5dd90ab0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 09:30:20,473 INFO L334 AbstractCegarLoop]: Starting to check reachability of 22 error locations. [2024-10-13 09:30:20,479 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-10-13 09:30:20,479 INFO L124 PetriNetUnfolderBase]: 2/25 cut-off events. [2024-10-13 09:30:20,479 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-13 09:30:20,479 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 09:30:20,480 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 09:30:20,480 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE (and 18 more)] === [2024-10-13 09:30:20,483 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:30:20,483 INFO L85 PathProgramCache]: Analyzing trace with hash -2043330979, now seen corresponding path program 1 times [2024-10-13 09:30:20,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:30:20,484 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [498301207] [2024-10-13 09:30:20,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:30:20,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:30:20,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:30:20,537 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 09:30:20,538 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:30:20,538 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [498301207] [2024-10-13 09:30:20,538 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [498301207] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:30:20,538 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:30:20,538 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-13 09:30:20,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2120484997] [2024-10-13 09:30:20,539 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:30:20,539 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-13 09:30:20,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:30:20,540 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-13 09:30:20,542 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 09:30:20,543 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 65 out of 87 [2024-10-13 09:30:20,545 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 87 transitions, 184 flow. Second operand has 2 states, 2 states have (on average 66.0) internal successors, (132), 2 states have internal predecessors, (132), 0 states have call successors, (0), 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-10-13 09:30:20,545 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 09:30:20,546 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 65 of 87 [2024-10-13 09:30:20,546 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 09:30:20,606 INFO L124 PetriNetUnfolderBase]: 6/149 cut-off events. [2024-10-13 09:30:20,608 INFO L125 PetriNetUnfolderBase]: For 11/11 co-relation queries the response was YES. [2024-10-13 09:30:20,609 INFO L83 FinitePrefix]: Finished finitePrefix Result has 182 conditions, 149 events. 6/149 cut-off events. For 11/11 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 428 event pairs, 6 based on Foata normal form. 25/152 useless extension candidates. Maximal degree in co-relation 114. Up to 19 conditions per place. [2024-10-13 09:30:20,612 INFO L140 encePairwiseOnDemand]: 73/87 looper letters, 6 selfloop transitions, 0 changer transitions 0/66 dead transitions. [2024-10-13 09:30:20,612 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 66 transitions, 154 flow [2024-10-13 09:30:20,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-13 09:30:20,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2024-10-13 09:30:20,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 150 transitions. [2024-10-13 09:30:20,614 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8620689655172413 [2024-10-13 09:30:20,614 INFO L175 Difference]: Start difference. First operand has 87 places, 87 transitions, 184 flow. Second operand 2 states and 150 transitions. [2024-10-13 09:30:20,614 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 66 transitions, 154 flow [2024-10-13 09:30:20,615 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 66 transitions, 154 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-13 09:30:20,617 INFO L231 Difference]: Finished difference. Result has 72 places, 66 transitions, 142 flow [2024-10-13 09:30:20,618 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=87, PETRI_DIFFERENCE_MINUEND_FLOW=142, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=142, PETRI_PLACES=72, PETRI_TRANSITIONS=66} [2024-10-13 09:30:20,618 INFO L277 CegarLoopForPetriNet]: 87 programPoint places, -15 predicate places. [2024-10-13 09:30:20,619 INFO L471 AbstractCegarLoop]: Abstraction has has 72 places, 66 transitions, 142 flow [2024-10-13 09:30:20,619 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 66.0) internal successors, (132), 2 states have internal predecessors, (132), 0 states have call successors, (0), 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-10-13 09:30:20,619 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 09:30:20,620 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] [2024-10-13 09:30:20,620 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-13 09:30:20,620 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err2ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE (and 18 more)] === [2024-10-13 09:30:20,621 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:30:20,621 INFO L85 PathProgramCache]: Analyzing trace with hash -751135583, now seen corresponding path program 1 times [2024-10-13 09:30:20,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:30:20,621 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1650795892] [2024-10-13 09:30:20,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:30:20,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:30:20,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:30:20,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-10-13 09:30:20,703 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:30:20,703 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1650795892] [2024-10-13 09:30:20,704 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1650795892] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:30:20,704 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:30:20,704 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 09:30:20,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [73750515] [2024-10-13 09:30:20,704 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:30:20,704 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 09:30:20,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:30:20,705 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 09:30:20,705 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 09:30:20,746 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 55 out of 87 [2024-10-13 09:30:20,747 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 66 transitions, 142 flow. Second operand has 3 states, 3 states have (on average 56.666666666666664) internal successors, (170), 3 states have internal predecessors, (170), 0 states have call successors, (0), 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-10-13 09:30:20,747 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 09:30:20,747 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 55 of 87 [2024-10-13 09:30:20,748 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 09:30:20,847 INFO L124 PetriNetUnfolderBase]: 57/306 cut-off events. [2024-10-13 09:30:20,848 INFO L125 PetriNetUnfolderBase]: For 29/29 co-relation queries the response was YES. [2024-10-13 09:30:20,851 INFO L83 FinitePrefix]: Finished finitePrefix Result has 472 conditions, 306 events. 57/306 cut-off events. For 29/29 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 1542 event pairs, 37 based on Foata normal form. 0/260 useless extension candidates. Maximal degree in co-relation 467. Up to 109 conditions per place. [2024-10-13 09:30:20,853 INFO L140 encePairwiseOnDemand]: 80/87 looper letters, 18 selfloop transitions, 6 changer transitions 0/74 dead transitions. [2024-10-13 09:30:20,853 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 74 transitions, 211 flow [2024-10-13 09:30:20,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 09:30:20,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 09:30:20,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 190 transitions. [2024-10-13 09:30:20,858 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7279693486590039 [2024-10-13 09:30:20,858 INFO L175 Difference]: Start difference. First operand has 72 places, 66 transitions, 142 flow. Second operand 3 states and 190 transitions. [2024-10-13 09:30:20,858 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 74 transitions, 211 flow [2024-10-13 09:30:20,859 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 74 transitions, 211 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-13 09:30:20,863 INFO L231 Difference]: Finished difference. Result has 76 places, 71 transitions, 188 flow [2024-10-13 09:30:20,864 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=87, PETRI_DIFFERENCE_MINUEND_FLOW=142, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=188, PETRI_PLACES=76, PETRI_TRANSITIONS=71} [2024-10-13 09:30:20,866 INFO L277 CegarLoopForPetriNet]: 87 programPoint places, -11 predicate places. [2024-10-13 09:30:20,866 INFO L471 AbstractCegarLoop]: Abstraction has has 76 places, 71 transitions, 188 flow [2024-10-13 09:30:20,867 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 56.666666666666664) internal successors, (170), 3 states have internal predecessors, (170), 0 states have call successors, (0), 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-10-13 09:30:20,867 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 09:30:20,867 INFO L204 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 09:30:20,867 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-13 09:30:20,868 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE (and 18 more)] === [2024-10-13 09:30:20,868 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:30:20,868 INFO L85 PathProgramCache]: Analyzing trace with hash -1090289894, now seen corresponding path program 1 times [2024-10-13 09:30:20,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:30:20,869 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [859553969] [2024-10-13 09:30:20,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:30:20,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:30:20,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 09:30:20,893 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 09:30:20,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 09:30:20,918 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 09:30:20,920 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-13 09:30:20,921 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (21 of 22 remaining) [2024-10-13 09:30:20,921 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (20 of 22 remaining) [2024-10-13 09:30:20,922 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (19 of 22 remaining) [2024-10-13 09:30:20,923 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (18 of 22 remaining) [2024-10-13 09:30:20,923 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (17 of 22 remaining) [2024-10-13 09:30:20,924 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4ASSERT_VIOLATIONDATA_RACE (16 of 22 remaining) [2024-10-13 09:30:20,924 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5ASSERT_VIOLATIONDATA_RACE (15 of 22 remaining) [2024-10-13 09:30:20,924 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err6ASSERT_VIOLATIONDATA_RACE (14 of 22 remaining) [2024-10-13 09:30:20,924 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (13 of 22 remaining) [2024-10-13 09:30:20,925 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (12 of 22 remaining) [2024-10-13 09:30:20,925 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (11 of 22 remaining) [2024-10-13 09:30:20,925 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (10 of 22 remaining) [2024-10-13 09:30:20,925 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4ASSERT_VIOLATIONDATA_RACE (9 of 22 remaining) [2024-10-13 09:30:20,926 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5ASSERT_VIOLATIONDATA_RACE (8 of 22 remaining) [2024-10-13 09:30:20,926 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err6ASSERT_VIOLATIONDATA_RACE (7 of 22 remaining) [2024-10-13 09:30:20,926 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (6 of 22 remaining) [2024-10-13 09:30:20,926 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (5 of 22 remaining) [2024-10-13 09:30:20,927 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (4 of 22 remaining) [2024-10-13 09:30:20,927 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (3 of 22 remaining) [2024-10-13 09:30:20,927 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4ASSERT_VIOLATIONDATA_RACE (2 of 22 remaining) [2024-10-13 09:30:20,927 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5ASSERT_VIOLATIONDATA_RACE (1 of 22 remaining) [2024-10-13 09:30:20,927 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err6ASSERT_VIOLATIONDATA_RACE (0 of 22 remaining) [2024-10-13 09:30:20,928 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-13 09:30:20,928 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-10-13 09:30:20,929 WARN L239 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2024-10-13 09:30:20,930 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2024-10-13 09:30:20,967 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-10-13 09:30:20,972 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 120 places, 120 transitions, 258 flow [2024-10-13 09:30:20,995 INFO L124 PetriNetUnfolderBase]: 10/147 cut-off events. [2024-10-13 09:30:20,995 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2024-10-13 09:30:20,998 INFO L83 FinitePrefix]: Finished finitePrefix Result has 160 conditions, 147 events. 10/147 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 395 event pairs, 0 based on Foata normal form. 0/112 useless extension candidates. Maximal degree in co-relation 109. Up to 8 conditions per place. [2024-10-13 09:30:20,999 INFO L82 GeneralOperation]: Start removeDead. Operand has 120 places, 120 transitions, 258 flow [2024-10-13 09:30:21,001 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 120 places, 120 transitions, 258 flow [2024-10-13 09:30:21,003 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 09:30:21,004 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;@5dd90ab0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 09:30:21,004 INFO L334 AbstractCegarLoop]: Starting to check reachability of 29 error locations. [2024-10-13 09:30:21,007 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-10-13 09:30:21,007 INFO L124 PetriNetUnfolderBase]: 2/25 cut-off events. [2024-10-13 09:30:21,007 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-13 09:30:21,008 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 09:30:21,008 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 09:30:21,008 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE (and 25 more)] === [2024-10-13 09:30:21,009 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:30:21,009 INFO L85 PathProgramCache]: Analyzing trace with hash -1126220419, now seen corresponding path program 1 times [2024-10-13 09:30:21,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:30:21,009 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1156427986] [2024-10-13 09:30:21,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:30:21,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:30:21,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:30:21,049 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 09:30:21,049 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:30:21,050 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1156427986] [2024-10-13 09:30:21,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1156427986] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:30:21,050 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:30:21,050 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-13 09:30:21,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [529674501] [2024-10-13 09:30:21,051 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:30:21,051 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-13 09:30:21,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:30:21,052 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-13 09:30:21,052 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 09:30:21,053 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 120 [2024-10-13 09:30:21,053 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 120 places, 120 transitions, 258 flow. Second operand has 2 states, 2 states have (on average 89.0) internal successors, (178), 2 states have internal predecessors, (178), 0 states have call successors, (0), 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-10-13 09:30:21,053 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 09:30:21,054 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 120 [2024-10-13 09:30:21,054 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 09:30:21,150 INFO L124 PetriNetUnfolderBase]: 42/490 cut-off events. [2024-10-13 09:30:21,150 INFO L125 PetriNetUnfolderBase]: For 67/67 co-relation queries the response was YES. [2024-10-13 09:30:21,153 INFO L83 FinitePrefix]: Finished finitePrefix Result has 623 conditions, 490 events. 42/490 cut-off events. For 67/67 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 2828 event pairs, 42 based on Foata normal form. 94/502 useless extension candidates. Maximal degree in co-relation 388. Up to 82 conditions per place. [2024-10-13 09:30:21,156 INFO L140 encePairwiseOnDemand]: 100/120 looper letters, 9 selfloop transitions, 0 changer transitions 0/91 dead transitions. [2024-10-13 09:30:21,156 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 91 transitions, 218 flow [2024-10-13 09:30:21,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-13 09:30:21,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2024-10-13 09:30:21,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 205 transitions. [2024-10-13 09:30:21,159 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8541666666666666 [2024-10-13 09:30:21,159 INFO L175 Difference]: Start difference. First operand has 120 places, 120 transitions, 258 flow. Second operand 2 states and 205 transitions. [2024-10-13 09:30:21,159 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 91 transitions, 218 flow [2024-10-13 09:30:21,162 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 91 transitions, 216 flow, removed 1 selfloop flow, removed 0 redundant places. [2024-10-13 09:30:21,164 INFO L231 Difference]: Finished difference. Result has 99 places, 91 transitions, 198 flow [2024-10-13 09:30:21,165 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=120, PETRI_DIFFERENCE_MINUEND_FLOW=198, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=91, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=198, PETRI_PLACES=99, PETRI_TRANSITIONS=91} [2024-10-13 09:30:21,166 INFO L277 CegarLoopForPetriNet]: 120 programPoint places, -21 predicate places. [2024-10-13 09:30:21,167 INFO L471 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 198 flow [2024-10-13 09:30:21,167 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 89.0) internal successors, (178), 2 states have internal predecessors, (178), 0 states have call successors, (0), 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-10-13 09:30:21,167 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 09:30:21,167 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] [2024-10-13 09:30:21,168 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-13 09:30:21,168 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err2ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE (and 25 more)] === [2024-10-13 09:30:21,168 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:30:21,168 INFO L85 PathProgramCache]: Analyzing trace with hash -1731698239, now seen corresponding path program 1 times [2024-10-13 09:30:21,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:30:21,169 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1833673198] [2024-10-13 09:30:21,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:30:21,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:30:21,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:30:21,225 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 09:30:21,226 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:30:21,227 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1833673198] [2024-10-13 09:30:21,228 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1833673198] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:30:21,228 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:30:21,228 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 09:30:21,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1109870916] [2024-10-13 09:30:21,228 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:30:21,228 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 09:30:21,228 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:30:21,229 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 09:30:21,229 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 09:30:21,290 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 75 out of 120 [2024-10-13 09:30:21,291 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 198 flow. Second operand has 3 states, 3 states have (on average 76.66666666666667) internal successors, (230), 3 states have internal predecessors, (230), 0 states have call successors, (0), 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-10-13 09:30:21,291 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 09:30:21,291 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 75 of 120 [2024-10-13 09:30:21,291 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 09:30:21,638 INFO L124 PetriNetUnfolderBase]: 783/2555 cut-off events. [2024-10-13 09:30:21,638 INFO L125 PetriNetUnfolderBase]: For 229/229 co-relation queries the response was YES. [2024-10-13 09:30:21,647 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4066 conditions, 2555 events. 783/2555 cut-off events. For 229/229 co-relation queries the response was YES. Maximal size of possible extension queue 119. Compared 21991 event pairs, 556 based on Foata normal form. 0/2145 useless extension candidates. Maximal degree in co-relation 4060. Up to 1091 conditions per place. [2024-10-13 09:30:21,665 INFO L140 encePairwiseOnDemand]: 110/120 looper letters, 27 selfloop transitions, 9 changer transitions 0/105 dead transitions. [2024-10-13 09:30:21,666 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 105 transitions, 308 flow [2024-10-13 09:30:21,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 09:30:21,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 09:30:21,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 262 transitions. [2024-10-13 09:30:21,667 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7277777777777777 [2024-10-13 09:30:21,667 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 198 flow. Second operand 3 states and 262 transitions. [2024-10-13 09:30:21,668 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 105 transitions, 308 flow [2024-10-13 09:30:21,669 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 101 places, 105 transitions, 308 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-13 09:30:21,672 INFO L231 Difference]: Finished difference. Result has 103 places, 99 transitions, 268 flow [2024-10-13 09:30:21,673 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=120, PETRI_DIFFERENCE_MINUEND_FLOW=198, PETRI_DIFFERENCE_MINUEND_PLACES=99, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=82, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=268, PETRI_PLACES=103, PETRI_TRANSITIONS=99} [2024-10-13 09:30:21,675 INFO L277 CegarLoopForPetriNet]: 120 programPoint places, -17 predicate places. [2024-10-13 09:30:21,675 INFO L471 AbstractCegarLoop]: Abstraction has has 103 places, 99 transitions, 268 flow [2024-10-13 09:30:21,676 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 76.66666666666667) internal successors, (230), 3 states have internal predecessors, (230), 0 states have call successors, (0), 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-10-13 09:30:21,676 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 09:30:21,676 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 09:30:21,676 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-13 09:30:21,677 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err2ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE (and 25 more)] === [2024-10-13 09:30:21,677 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:30:21,677 INFO L85 PathProgramCache]: Analyzing trace with hash 635552502, now seen corresponding path program 1 times [2024-10-13 09:30:21,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:30:21,677 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [919856359] [2024-10-13 09:30:21,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:30:21,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:30:21,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:30:21,728 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-10-13 09:30:21,729 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:30:21,729 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [919856359] [2024-10-13 09:30:21,729 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [919856359] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:30:21,729 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:30:21,729 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 09:30:21,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [967252131] [2024-10-13 09:30:21,733 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:30:21,734 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 09:30:21,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:30:21,734 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 09:30:21,734 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 09:30:21,790 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 75 out of 120 [2024-10-13 09:30:21,791 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 99 transitions, 268 flow. Second operand has 3 states, 3 states have (on average 77.0) internal successors, (231), 3 states have internal predecessors, (231), 0 states have call successors, (0), 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-10-13 09:30:21,791 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 09:30:21,791 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 75 of 120 [2024-10-13 09:30:21,792 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 09:30:22,231 INFO L124 PetriNetUnfolderBase]: 1174/3429 cut-off events. [2024-10-13 09:30:22,232 INFO L125 PetriNetUnfolderBase]: For 1088/1125 co-relation queries the response was YES. [2024-10-13 09:30:22,246 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6705 conditions, 3429 events. 1174/3429 cut-off events. For 1088/1125 co-relation queries the response was YES. Maximal size of possible extension queue 168. Compared 30292 event pairs, 676 based on Foata normal form. 1/2915 useless extension candidates. Maximal degree in co-relation 6697. Up to 1505 conditions per place. [2024-10-13 09:30:22,270 INFO L140 encePairwiseOnDemand]: 110/120 looper letters, 31 selfloop transitions, 13 changer transitions 0/115 dead transitions. [2024-10-13 09:30:22,270 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 115 transitions, 415 flow [2024-10-13 09:30:22,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 09:30:22,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 09:30:22,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 261 transitions. [2024-10-13 09:30:22,272 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.725 [2024-10-13 09:30:22,272 INFO L175 Difference]: Start difference. First operand has 103 places, 99 transitions, 268 flow. Second operand 3 states and 261 transitions. [2024-10-13 09:30:22,272 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 105 places, 115 transitions, 415 flow [2024-10-13 09:30:22,280 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 103 places, 115 transitions, 389 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-13 09:30:22,283 INFO L231 Difference]: Finished difference. Result has 105 places, 110 transitions, 362 flow [2024-10-13 09:30:22,283 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=120, PETRI_DIFFERENCE_MINUEND_FLOW=250, PETRI_DIFFERENCE_MINUEND_PLACES=101, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=99, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=86, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=362, PETRI_PLACES=105, PETRI_TRANSITIONS=110} [2024-10-13 09:30:22,285 INFO L277 CegarLoopForPetriNet]: 120 programPoint places, -15 predicate places. [2024-10-13 09:30:22,285 INFO L471 AbstractCegarLoop]: Abstraction has has 105 places, 110 transitions, 362 flow [2024-10-13 09:30:22,286 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 77.0) internal successors, (231), 3 states have internal predecessors, (231), 0 states have call successors, (0), 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-10-13 09:30:22,286 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 09:30:22,286 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] [2024-10-13 09:30:22,289 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-13 09:30:22,289 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting thr1Err3ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE (and 25 more)] === [2024-10-13 09:30:22,289 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:30:22,289 INFO L85 PathProgramCache]: Analyzing trace with hash -1894861692, now seen corresponding path program 1 times [2024-10-13 09:30:22,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:30:22,290 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [248109630] [2024-10-13 09:30:22,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:30:22,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:30:22,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:30:22,314 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 09:30:22,314 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:30:22,314 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [248109630] [2024-10-13 09:30:22,314 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [248109630] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:30:22,314 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:30:22,314 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 09:30:22,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1150617178] [2024-10-13 09:30:22,314 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:30:22,315 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 09:30:22,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:30:22,315 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 09:30:22,315 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 09:30:22,359 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 75 out of 120 [2024-10-13 09:30:22,360 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 110 transitions, 362 flow. Second operand has 3 states, 3 states have (on average 77.0) internal successors, (231), 3 states have internal predecessors, (231), 0 states have call successors, (0), 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-10-13 09:30:22,360 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 09:30:22,360 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 75 of 120 [2024-10-13 09:30:22,360 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 09:30:22,831 INFO L124 PetriNetUnfolderBase]: 1510/4422 cut-off events. [2024-10-13 09:30:22,832 INFO L125 PetriNetUnfolderBase]: For 2893/3003 co-relation queries the response was YES. [2024-10-13 09:30:22,852 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9657 conditions, 4422 events. 1510/4422 cut-off events. For 2893/3003 co-relation queries the response was YES. Maximal size of possible extension queue 224. Compared 41435 event pairs, 767 based on Foata normal form. 3/3738 useless extension candidates. Maximal degree in co-relation 9648. Up to 1847 conditions per place. [2024-10-13 09:30:22,990 INFO L140 encePairwiseOnDemand]: 110/120 looper letters, 41 selfloop transitions, 13 changer transitions 0/127 dead transitions. [2024-10-13 09:30:22,990 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 127 transitions, 554 flow [2024-10-13 09:30:22,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 09:30:22,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 09:30:22,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 262 transitions. [2024-10-13 09:30:22,993 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7277777777777777 [2024-10-13 09:30:22,993 INFO L175 Difference]: Start difference. First operand has 105 places, 110 transitions, 362 flow. Second operand 3 states and 262 transitions. [2024-10-13 09:30:22,993 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 107 places, 127 transitions, 554 flow [2024-10-13 09:30:23,002 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 105 places, 127 transitions, 520 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-13 09:30:23,005 INFO L231 Difference]: Finished difference. Result has 107 places, 121 transitions, 466 flow [2024-10-13 09:30:23,006 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=120, PETRI_DIFFERENCE_MINUEND_FLOW=336, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=110, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=97, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=466, PETRI_PLACES=107, PETRI_TRANSITIONS=121} [2024-10-13 09:30:23,007 INFO L277 CegarLoopForPetriNet]: 120 programPoint places, -13 predicate places. [2024-10-13 09:30:23,007 INFO L471 AbstractCegarLoop]: Abstraction has has 107 places, 121 transitions, 466 flow [2024-10-13 09:30:23,007 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 77.0) internal successors, (231), 3 states have internal predecessors, (231), 0 states have call successors, (0), 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-10-13 09:30:23,008 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 09:30:23,008 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] [2024-10-13 09:30:23,008 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-13 09:30:23,008 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting thr1Err4ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE (and 25 more)] === [2024-10-13 09:30:23,009 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:30:23,009 INFO L85 PathProgramCache]: Analyzing trace with hash -1069010426, now seen corresponding path program 1 times [2024-10-13 09:30:23,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:30:23,009 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1391430317] [2024-10-13 09:30:23,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:30:23,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:30:23,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:30:23,044 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 09:30:23,044 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:30:23,044 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1391430317] [2024-10-13 09:30:23,044 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1391430317] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:30:23,044 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:30:23,045 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 09:30:23,045 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [977729464] [2024-10-13 09:30:23,045 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:30:23,045 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 09:30:23,045 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:30:23,046 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 09:30:23,046 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 09:30:23,089 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 73 out of 120 [2024-10-13 09:30:23,090 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 121 transitions, 466 flow. Second operand has 3 states, 3 states have (on average 75.0) internal successors, (225), 3 states have internal predecessors, (225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 09:30:23,090 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 09:30:23,090 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 73 of 120 [2024-10-13 09:30:23,090 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 09:30:24,057 INFO L124 PetriNetUnfolderBase]: 2600/7834 cut-off events. [2024-10-13 09:30:24,058 INFO L125 PetriNetUnfolderBase]: For 8899/9083 co-relation queries the response was YES. [2024-10-13 09:30:24,089 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18470 conditions, 7834 events. 2600/7834 cut-off events. For 8899/9083 co-relation queries the response was YES. Maximal size of possible extension queue 361. Compared 81156 event pairs, 570 based on Foata normal form. 6/6567 useless extension candidates. Maximal degree in co-relation 18460. Up to 1921 conditions per place. [2024-10-13 09:30:24,143 INFO L140 encePairwiseOnDemand]: 105/120 looper letters, 54 selfloop transitions, 32 changer transitions 0/159 dead transitions. [2024-10-13 09:30:24,143 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 159 transitions, 862 flow [2024-10-13 09:30:24,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 09:30:24,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 09:30:24,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 266 transitions. [2024-10-13 09:30:24,145 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7388888888888889 [2024-10-13 09:30:24,145 INFO L175 Difference]: Start difference. First operand has 107 places, 121 transitions, 466 flow. Second operand 3 states and 266 transitions. [2024-10-13 09:30:24,145 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 159 transitions, 862 flow [2024-10-13 09:30:24,166 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 159 transitions, 790 flow, removed 15 selfloop flow, removed 2 redundant places. [2024-10-13 09:30:24,169 INFO L231 Difference]: Finished difference. Result has 109 places, 151 transitions, 786 flow [2024-10-13 09:30:24,170 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=120, PETRI_DIFFERENCE_MINUEND_FLOW=422, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=121, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=89, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=786, PETRI_PLACES=109, PETRI_TRANSITIONS=151} [2024-10-13 09:30:24,172 INFO L277 CegarLoopForPetriNet]: 120 programPoint places, -11 predicate places. [2024-10-13 09:30:24,172 INFO L471 AbstractCegarLoop]: Abstraction has has 109 places, 151 transitions, 786 flow [2024-10-13 09:30:24,173 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 75.0) internal successors, (225), 3 states have internal predecessors, (225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 09:30:24,173 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 09:30:24,173 INFO L204 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 09:30:24,173 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-13 09:30:24,173 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE (and 25 more)] === [2024-10-13 09:30:24,174 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:30:24,174 INFO L85 PathProgramCache]: Analyzing trace with hash 1217575310, now seen corresponding path program 1 times [2024-10-13 09:30:24,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:30:24,174 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [193244390] [2024-10-13 09:30:24,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:30:24,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:30:24,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 09:30:24,193 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 09:30:24,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 09:30:24,211 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 09:30:24,211 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-13 09:30:24,212 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (28 of 29 remaining) [2024-10-13 09:30:24,212 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (27 of 29 remaining) [2024-10-13 09:30:24,212 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (26 of 29 remaining) [2024-10-13 09:30:24,212 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (25 of 29 remaining) [2024-10-13 09:30:24,212 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (24 of 29 remaining) [2024-10-13 09:30:24,212 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4ASSERT_VIOLATIONDATA_RACE (23 of 29 remaining) [2024-10-13 09:30:24,213 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5ASSERT_VIOLATIONDATA_RACE (22 of 29 remaining) [2024-10-13 09:30:24,213 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err6ASSERT_VIOLATIONDATA_RACE (21 of 29 remaining) [2024-10-13 09:30:24,213 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (20 of 29 remaining) [2024-10-13 09:30:24,213 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (19 of 29 remaining) [2024-10-13 09:30:24,215 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (18 of 29 remaining) [2024-10-13 09:30:24,215 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (17 of 29 remaining) [2024-10-13 09:30:24,216 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4ASSERT_VIOLATIONDATA_RACE (16 of 29 remaining) [2024-10-13 09:30:24,216 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5ASSERT_VIOLATIONDATA_RACE (15 of 29 remaining) [2024-10-13 09:30:24,216 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err6ASSERT_VIOLATIONDATA_RACE (14 of 29 remaining) [2024-10-13 09:30:24,216 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (13 of 29 remaining) [2024-10-13 09:30:24,216 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (12 of 29 remaining) [2024-10-13 09:30:24,217 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (11 of 29 remaining) [2024-10-13 09:30:24,217 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (10 of 29 remaining) [2024-10-13 09:30:24,217 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4ASSERT_VIOLATIONDATA_RACE (9 of 29 remaining) [2024-10-13 09:30:24,217 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5ASSERT_VIOLATIONDATA_RACE (8 of 29 remaining) [2024-10-13 09:30:24,217 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err6ASSERT_VIOLATIONDATA_RACE (7 of 29 remaining) [2024-10-13 09:30:24,218 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (6 of 29 remaining) [2024-10-13 09:30:24,218 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (5 of 29 remaining) [2024-10-13 09:30:24,218 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (4 of 29 remaining) [2024-10-13 09:30:24,219 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (3 of 29 remaining) [2024-10-13 09:30:24,219 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4ASSERT_VIOLATIONDATA_RACE (2 of 29 remaining) [2024-10-13 09:30:24,219 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5ASSERT_VIOLATIONDATA_RACE (1 of 29 remaining) [2024-10-13 09:30:24,219 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err6ASSERT_VIOLATIONDATA_RACE (0 of 29 remaining) [2024-10-13 09:30:24,219 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-13 09:30:24,220 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2024-10-13 09:30:24,220 WARN L239 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2024-10-13 09:30:24,221 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2024-10-13 09:30:24,260 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-10-13 09:30:24,263 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 153 places, 153 transitions, 334 flow [2024-10-13 09:30:24,286 INFO L124 PetriNetUnfolderBase]: 13/189 cut-off events. [2024-10-13 09:30:24,287 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2024-10-13 09:30:24,288 INFO L83 FinitePrefix]: Finished finitePrefix Result has 208 conditions, 189 events. 13/189 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 589 event pairs, 0 based on Foata normal form. 0/143 useless extension candidates. Maximal degree in co-relation 155. Up to 10 conditions per place. [2024-10-13 09:30:24,288 INFO L82 GeneralOperation]: Start removeDead. Operand has 153 places, 153 transitions, 334 flow [2024-10-13 09:30:24,291 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 153 places, 153 transitions, 334 flow [2024-10-13 09:30:24,293 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 09:30:24,294 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;@5dd90ab0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 09:30:24,295 INFO L334 AbstractCegarLoop]: Starting to check reachability of 36 error locations. [2024-10-13 09:30:24,298 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-10-13 09:30:24,298 INFO L124 PetriNetUnfolderBase]: 2/27 cut-off events. [2024-10-13 09:30:24,298 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-13 09:30:24,298 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 09:30:24,298 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 09:30:24,299 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE (and 32 more)] === [2024-10-13 09:30:24,299 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:30:24,299 INFO L85 PathProgramCache]: Analyzing trace with hash 1868449213, now seen corresponding path program 1 times [2024-10-13 09:30:24,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:30:24,299 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [203009375] [2024-10-13 09:30:24,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:30:24,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:30:24,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:30:24,320 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 09:30:24,320 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:30:24,320 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [203009375] [2024-10-13 09:30:24,321 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [203009375] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:30:24,321 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:30:24,321 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-13 09:30:24,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1686049767] [2024-10-13 09:30:24,321 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:30:24,321 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-13 09:30:24,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:30:24,322 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-13 09:30:24,322 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 09:30:24,325 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 153 [2024-10-13 09:30:24,325 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 153 places, 153 transitions, 334 flow. Second operand has 2 states, 2 states have (on average 112.0) internal successors, (224), 2 states have internal predecessors, (224), 0 states have call successors, (0), 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-10-13 09:30:24,326 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 09:30:24,326 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 153 [2024-10-13 09:30:24,326 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 09:30:24,589 INFO L124 PetriNetUnfolderBase]: 204/1578 cut-off events. [2024-10-13 09:30:24,589 INFO L125 PetriNetUnfolderBase]: For 340/340 co-relation queries the response was YES. [2024-10-13 09:30:24,598 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2090 conditions, 1578 events. 204/1578 cut-off events. For 340/340 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 13145 event pairs, 204 based on Foata normal form. 341/1649 useless extension candidates. Maximal degree in co-relation 1280. Up to 325 conditions per place. [2024-10-13 09:30:24,607 INFO L140 encePairwiseOnDemand]: 127/153 looper letters, 12 selfloop transitions, 0 changer transitions 0/116 dead transitions. [2024-10-13 09:30:24,609 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 126 places, 116 transitions, 284 flow [2024-10-13 09:30:24,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-13 09:30:24,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2024-10-13 09:30:24,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 260 transitions. [2024-10-13 09:30:24,611 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8496732026143791 [2024-10-13 09:30:24,611 INFO L175 Difference]: Start difference. First operand has 153 places, 153 transitions, 334 flow. Second operand 2 states and 260 transitions. [2024-10-13 09:30:24,611 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 126 places, 116 transitions, 284 flow [2024-10-13 09:30:24,612 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 126 places, 116 transitions, 278 flow, removed 3 selfloop flow, removed 0 redundant places. [2024-10-13 09:30:24,613 INFO L231 Difference]: Finished difference. Result has 126 places, 116 transitions, 254 flow [2024-10-13 09:30:24,614 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=153, PETRI_DIFFERENCE_MINUEND_FLOW=254, PETRI_DIFFERENCE_MINUEND_PLACES=125, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=116, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=116, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=254, PETRI_PLACES=126, PETRI_TRANSITIONS=116} [2024-10-13 09:30:24,614 INFO L277 CegarLoopForPetriNet]: 153 programPoint places, -27 predicate places. [2024-10-13 09:30:24,615 INFO L471 AbstractCegarLoop]: Abstraction has has 126 places, 116 transitions, 254 flow [2024-10-13 09:30:24,615 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 112.0) internal successors, (224), 2 states have internal predecessors, (224), 0 states have call successors, (0), 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-10-13 09:30:24,615 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 09:30:24,615 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] [2024-10-13 09:30:24,615 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-13 09:30:24,616 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err2ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE (and 32 more)] === [2024-10-13 09:30:24,616 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:30:24,616 INFO L85 PathProgramCache]: Analyzing trace with hash 1751134273, now seen corresponding path program 1 times [2024-10-13 09:30:24,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:30:24,616 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [496345298] [2024-10-13 09:30:24,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:30:24,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:30:24,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:30:24,643 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 09:30:24,644 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:30:24,644 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [496345298] [2024-10-13 09:30:24,644 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [496345298] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:30:24,644 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:30:24,644 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 09:30:24,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1080428971] [2024-10-13 09:30:24,645 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:30:24,645 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 09:30:24,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:30:24,646 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 09:30:24,646 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 09:30:24,698 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 95 out of 153 [2024-10-13 09:30:24,698 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 126 places, 116 transitions, 254 flow. Second operand has 3 states, 3 states have (on average 96.66666666666667) internal successors, (290), 3 states have internal predecessors, (290), 0 states have call successors, (0), 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-10-13 09:30:24,699 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 09:30:24,699 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 153 [2024-10-13 09:30:24,699 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 09:30:26,841 INFO L124 PetriNetUnfolderBase]: 7395/18654 cut-off events. [2024-10-13 09:30:26,841 INFO L125 PetriNetUnfolderBase]: For 1492/1492 co-relation queries the response was YES. [2024-10-13 09:30:26,912 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30606 conditions, 18654 events. 7395/18654 cut-off events. For 1492/1492 co-relation queries the response was YES. Maximal size of possible extension queue 635. Compared 202140 event pairs, 5488 based on Foata normal form. 0/15916 useless extension candidates. Maximal degree in co-relation 30599. Up to 9127 conditions per place. [2024-10-13 09:30:27,020 INFO L140 encePairwiseOnDemand]: 140/153 looper letters, 36 selfloop transitions, 12 changer transitions 0/136 dead transitions. [2024-10-13 09:30:27,021 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 128 places, 136 transitions, 405 flow [2024-10-13 09:30:27,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 09:30:27,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 09:30:27,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 334 transitions. [2024-10-13 09:30:27,022 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7276688453159041 [2024-10-13 09:30:27,022 INFO L175 Difference]: Start difference. First operand has 126 places, 116 transitions, 254 flow. Second operand 3 states and 334 transitions. [2024-10-13 09:30:27,022 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 128 places, 136 transitions, 405 flow [2024-10-13 09:30:27,024 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 128 places, 136 transitions, 405 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-13 09:30:27,027 INFO L231 Difference]: Finished difference. Result has 130 places, 127 transitions, 348 flow [2024-10-13 09:30:27,028 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=153, PETRI_DIFFERENCE_MINUEND_FLOW=254, PETRI_DIFFERENCE_MINUEND_PLACES=126, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=116, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=104, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=348, PETRI_PLACES=130, PETRI_TRANSITIONS=127} [2024-10-13 09:30:27,029 INFO L277 CegarLoopForPetriNet]: 153 programPoint places, -23 predicate places. [2024-10-13 09:30:27,029 INFO L471 AbstractCegarLoop]: Abstraction has has 130 places, 127 transitions, 348 flow [2024-10-13 09:30:27,029 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 96.66666666666667) internal successors, (290), 3 states have internal predecessors, (290), 0 states have call successors, (0), 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-10-13 09:30:27,029 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 09:30:27,029 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 09:30:27,030 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-13 09:30:27,030 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err2ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE (and 32 more)] === [2024-10-13 09:30:27,030 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:30:27,030 INFO L85 PathProgramCache]: Analyzing trace with hash 1031073519, now seen corresponding path program 1 times [2024-10-13 09:30:27,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:30:27,031 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [132055174] [2024-10-13 09:30:27,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:30:27,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:30:27,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:30:27,068 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-10-13 09:30:27,068 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:30:27,069 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [132055174] [2024-10-13 09:30:27,069 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [132055174] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:30:27,069 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:30:27,070 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 09:30:27,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1280239819] [2024-10-13 09:30:27,070 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:30:27,070 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 09:30:27,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:30:27,071 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 09:30:27,071 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 09:30:27,122 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 95 out of 153 [2024-10-13 09:30:27,123 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 130 places, 127 transitions, 348 flow. Second operand has 3 states, 3 states have (on average 97.0) internal successors, (291), 3 states have internal predecessors, (291), 0 states have call successors, (0), 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-10-13 09:30:27,123 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 09:30:27,123 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 153 [2024-10-13 09:30:27,123 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 09:30:30,066 INFO L124 PetriNetUnfolderBase]: 11945/28115 cut-off events. [2024-10-13 09:30:30,066 INFO L125 PetriNetUnfolderBase]: For 9821/10601 co-relation queries the response was YES. [2024-10-13 09:30:30,144 INFO L83 FinitePrefix]: Finished finitePrefix Result has 57136 conditions, 28115 events. 11945/28115 cut-off events. For 9821/10601 co-relation queries the response was YES. Maximal size of possible extension queue 974. Compared 310629 event pairs, 7302 based on Foata normal form. 23/23875 useless extension candidates. Maximal degree in co-relation 57127. Up to 13786 conditions per place. [2024-10-13 09:30:30,334 INFO L140 encePairwiseOnDemand]: 140/153 looper letters, 43 selfloop transitions, 19 changer transitions 0/152 dead transitions. [2024-10-13 09:30:30,334 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 132 places, 152 transitions, 572 flow [2024-10-13 09:30:30,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 09:30:30,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 09:30:30,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 333 transitions. [2024-10-13 09:30:30,336 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7254901960784313 [2024-10-13 09:30:30,336 INFO L175 Difference]: Start difference. First operand has 130 places, 127 transitions, 348 flow. Second operand 3 states and 333 transitions. [2024-10-13 09:30:30,336 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 132 places, 152 transitions, 572 flow [2024-10-13 09:30:30,404 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 130 places, 152 transitions, 534 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-13 09:30:30,407 INFO L231 Difference]: Finished difference. Result has 132 places, 144 transitions, 496 flow [2024-10-13 09:30:30,407 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=153, PETRI_DIFFERENCE_MINUEND_FLOW=324, PETRI_DIFFERENCE_MINUEND_PLACES=128, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=127, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=108, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=496, PETRI_PLACES=132, PETRI_TRANSITIONS=144} [2024-10-13 09:30:30,408 INFO L277 CegarLoopForPetriNet]: 153 programPoint places, -21 predicate places. [2024-10-13 09:30:30,408 INFO L471 AbstractCegarLoop]: Abstraction has has 132 places, 144 transitions, 496 flow [2024-10-13 09:30:30,408 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 97.0) internal successors, (291), 3 states have internal predecessors, (291), 0 states have call successors, (0), 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-10-13 09:30:30,408 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 09:30:30,409 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] [2024-10-13 09:30:30,409 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-13 09:30:30,409 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting thr1Err3ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE (and 32 more)] === [2024-10-13 09:30:30,409 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:30:30,409 INFO L85 PathProgramCache]: Analyzing trace with hash 1360648317, now seen corresponding path program 1 times [2024-10-13 09:30:30,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:30:30,409 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1543585642] [2024-10-13 09:30:30,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:30:30,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:30:30,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:30:30,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-10-13 09:30:30,443 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:30:30,443 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1543585642] [2024-10-13 09:30:30,443 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1543585642] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:30:30,443 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:30:30,443 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 09:30:30,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1371798064] [2024-10-13 09:30:30,443 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:30:30,443 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 09:30:30,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:30:30,444 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 09:30:30,444 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 09:30:30,494 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 95 out of 153 [2024-10-13 09:30:30,495 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 132 places, 144 transitions, 496 flow. Second operand has 3 states, 3 states have (on average 97.0) internal successors, (291), 3 states have internal predecessors, (291), 0 states have call successors, (0), 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-10-13 09:30:30,495 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 09:30:30,495 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 153 [2024-10-13 09:30:30,495 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 09:30:34,233 INFO L124 PetriNetUnfolderBase]: 15827/37111 cut-off events. [2024-10-13 09:30:34,233 INFO L125 PetriNetUnfolderBase]: For 28790/31099 co-relation queries the response was YES. [2024-10-13 09:30:34,392 INFO L83 FinitePrefix]: Finished finitePrefix Result has 86096 conditions, 37111 events. 15827/37111 cut-off events. For 28790/31099 co-relation queries the response was YES. Maximal size of possible extension queue 1315. Compared 426246 event pairs, 8820 based on Foata normal form. 45/30995 useless extension candidates. Maximal degree in co-relation 86086. Up to 17781 conditions per place. [2024-10-13 09:30:34,643 INFO L140 encePairwiseOnDemand]: 140/153 looper letters, 59 selfloop transitions, 19 changer transitions 0/170 dead transitions. [2024-10-13 09:30:34,644 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 134 places, 170 transitions, 789 flow [2024-10-13 09:30:34,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 09:30:34,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 09:30:34,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 334 transitions. [2024-10-13 09:30:34,645 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7276688453159041 [2024-10-13 09:30:34,645 INFO L175 Difference]: Start difference. First operand has 132 places, 144 transitions, 496 flow. Second operand 3 states and 334 transitions. [2024-10-13 09:30:34,645 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 134 places, 170 transitions, 789 flow [2024-10-13 09:30:34,762 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 132 places, 170 transitions, 737 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-13 09:30:34,764 INFO L231 Difference]: Finished difference. Result has 134 places, 161 transitions, 660 flow [2024-10-13 09:30:34,764 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=153, PETRI_DIFFERENCE_MINUEND_FLOW=458, PETRI_DIFFERENCE_MINUEND_PLACES=130, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=144, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=125, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=660, PETRI_PLACES=134, PETRI_TRANSITIONS=161} [2024-10-13 09:30:34,765 INFO L277 CegarLoopForPetriNet]: 153 programPoint places, -19 predicate places. [2024-10-13 09:30:34,765 INFO L471 AbstractCegarLoop]: Abstraction has has 134 places, 161 transitions, 660 flow [2024-10-13 09:30:34,766 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 97.0) internal successors, (291), 3 states have internal predecessors, (291), 0 states have call successors, (0), 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-10-13 09:30:34,766 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 09:30:34,766 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] [2024-10-13 09:30:34,766 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-13 09:30:34,766 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting thr1Err4ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE (and 32 more)] === [2024-10-13 09:30:34,766 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:30:34,767 INFO L85 PathProgramCache]: Analyzing trace with hash -826659578, now seen corresponding path program 1 times [2024-10-13 09:30:34,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:30:34,767 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [999572501] [2024-10-13 09:30:34,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:30:34,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:30:34,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:30:34,795 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 09:30:34,795 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:30:34,795 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [999572501] [2024-10-13 09:30:34,795 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [999572501] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:30:34,795 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:30:34,796 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 09:30:34,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1961732436] [2024-10-13 09:30:34,798 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:30:34,798 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 09:30:34,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:30:34,798 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 09:30:34,799 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 09:30:34,844 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 153 [2024-10-13 09:30:34,845 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 134 places, 161 transitions, 660 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-10-13 09:30:34,845 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 09:30:34,845 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 153 [2024-10-13 09:30:34,845 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 09:30:43,634 INFO L124 PetriNetUnfolderBase]: 41996/96013 cut-off events. [2024-10-13 09:30:43,635 INFO L125 PetriNetUnfolderBase]: For 136819/143150 co-relation queries the response was YES. [2024-10-13 09:30:44,203 INFO L83 FinitePrefix]: Finished finitePrefix Result has 246779 conditions, 96013 events. 41996/96013 cut-off events. For 136819/143150 co-relation queries the response was YES. Maximal size of possible extension queue 3431. Compared 1216549 event pairs, 10284 based on Foata normal form. 181/78863 useless extension candidates. Maximal degree in co-relation 246768. Up to 27447 conditions per place. [2024-10-13 09:30:44,785 INFO L140 encePairwiseOnDemand]: 133/153 looper letters, 82 selfloop transitions, 55 changer transitions 0/227 dead transitions. [2024-10-13 09:30:44,786 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 136 places, 227 transitions, 1363 flow [2024-10-13 09:30:44,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 09:30:44,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 09:30:44,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 336 transitions. [2024-10-13 09:30:44,788 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7320261437908496 [2024-10-13 09:30:44,788 INFO L175 Difference]: Start difference. First operand has 134 places, 161 transitions, 660 flow. Second operand 3 states and 336 transitions. [2024-10-13 09:30:44,789 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 136 places, 227 transitions, 1363 flow [2024-10-13 09:30:45,625 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 134 places, 227 transitions, 1231 flow, removed 30 selfloop flow, removed 2 redundant places. [2024-10-13 09:30:45,629 INFO L231 Difference]: Finished difference. Result has 136 places, 216 transitions, 1258 flow [2024-10-13 09:30:45,629 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=153, PETRI_DIFFERENCE_MINUEND_FLOW=592, PETRI_DIFFERENCE_MINUEND_PLACES=132, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=161, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=106, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1258, PETRI_PLACES=136, PETRI_TRANSITIONS=216} [2024-10-13 09:30:45,630 INFO L277 CegarLoopForPetriNet]: 153 programPoint places, -17 predicate places. [2024-10-13 09:30:45,630 INFO L471 AbstractCegarLoop]: Abstraction has has 136 places, 216 transitions, 1258 flow [2024-10-13 09:30:45,630 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-10-13 09:30:45,631 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 09:30:45,631 INFO L204 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 09:30:45,631 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-13 09:30:45,631 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting thr1Err2ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE (and 32 more)] === [2024-10-13 09:30:45,631 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:30:45,631 INFO L85 PathProgramCache]: Analyzing trace with hash -464072638, now seen corresponding path program 1 times [2024-10-13 09:30:45,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:30:45,632 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [868823671] [2024-10-13 09:30:45,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:30:45,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:30:45,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:30:45,661 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-10-13 09:30:45,662 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:30:45,662 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [868823671] [2024-10-13 09:30:45,662 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [868823671] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:30:45,662 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:30:45,662 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 09:30:45,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [784435707] [2024-10-13 09:30:45,663 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:30:45,663 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 09:30:45,663 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:30:45,664 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 09:30:45,664 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 09:30:45,713 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 95 out of 153 [2024-10-13 09:30:45,713 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 136 places, 216 transitions, 1258 flow. Second operand has 3 states, 3 states have (on average 97.33333333333333) internal successors, (292), 3 states have internal predecessors, (292), 0 states have call successors, (0), 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-10-13 09:30:45,714 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 09:30:45,714 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 153 [2024-10-13 09:30:45,714 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 09:30:50,663 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([576] L702-2-->L702-3: Formula: (= |v_thr1Thread3of4ForFork0_#t~nondet6#1_3| |v_#race~x~0_4|) InVars {thr1Thread3of4ForFork0_#t~nondet6#1=|v_thr1Thread3of4ForFork0_#t~nondet6#1_3|} OutVars{#race~x~0=|v_#race~x~0_4|, thr1Thread3of4ForFork0_#t~nondet6#1=|v_thr1Thread3of4ForFork0_#t~nondet6#1_3|} AuxVars[] AssignedVars[#race~x~0][268], [Black: 160#(= |thr1Thread1of4ForFork0_#t~nondet5#1| |#race~x~0|), 154#true, Black: 165#(= |#race~x~0| |thr1Thread2of4ForFork0_#t~nondet5#1|), 145#L701-3true, 137#L703-2true, 107#L710-6true, 148#true, Black: 170#(= |thr1Thread1of4ForFork0_#t~nondet6#1| |#race~x~0|), 173#true, 152#true, 150#true, Black: 175#(= |#race~x~0| 0), 17#L701-3true, 156#true, 31#L702-3true, 178#true]) [2024-10-13 09:30:50,663 INFO L294 olderBase$Statistics]: this new event has 67 ancestors and is cut-off event [2024-10-13 09:30:50,663 INFO L297 olderBase$Statistics]: existing Event has 67 ancestors and is cut-off event [2024-10-13 09:30:50,663 INFO L297 olderBase$Statistics]: existing Event has 67 ancestors and is cut-off event [2024-10-13 09:30:50,663 INFO L297 olderBase$Statistics]: existing Event has 67 ancestors and is cut-off event [2024-10-13 09:30:50,669 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([672] L702-2-->L702-3: Formula: (= |v_#race~x~0_4| |v_thr1Thread2of4ForFork0_#t~nondet6#1_3|) InVars {thr1Thread2of4ForFork0_#t~nondet6#1=|v_thr1Thread2of4ForFork0_#t~nondet6#1_3|} OutVars{thr1Thread2of4ForFork0_#t~nondet6#1=|v_thr1Thread2of4ForFork0_#t~nondet6#1_3|, #race~x~0=|v_#race~x~0_4|} AuxVars[] AssignedVars[#race~x~0][267], [130#L701-3true, Black: 160#(= |thr1Thread1of4ForFork0_#t~nondet5#1| |#race~x~0|), 154#true, Black: 165#(= |#race~x~0| |thr1Thread2of4ForFork0_#t~nondet5#1|), 145#L701-3true, 137#L703-2true, 107#L710-6true, 148#true, Black: 170#(= |thr1Thread1of4ForFork0_#t~nondet6#1| |#race~x~0|), 173#true, 152#true, 150#true, Black: 175#(= |#race~x~0| 0), 156#true, 67#L702-3true, 178#true]) [2024-10-13 09:30:50,670 INFO L294 olderBase$Statistics]: this new event has 67 ancestors and is cut-off event [2024-10-13 09:30:50,670 INFO L297 olderBase$Statistics]: existing Event has 67 ancestors and is cut-off event [2024-10-13 09:30:50,670 INFO L297 olderBase$Statistics]: existing Event has 67 ancestors and is cut-off event [2024-10-13 09:30:50,670 INFO L297 olderBase$Statistics]: existing Event has 67 ancestors and is cut-off event [2024-10-13 09:30:50,704 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([640] L702-2-->L702-3: Formula: (= |v_#race~x~0_4| |v_thr1Thread1of4ForFork0_#t~nondet6#1_3|) InVars {thr1Thread1of4ForFork0_#t~nondet6#1=|v_thr1Thread1of4ForFork0_#t~nondet6#1_3|} OutVars{#race~x~0=|v_#race~x~0_4|, thr1Thread1of4ForFork0_#t~nondet6#1=|v_thr1Thread1of4ForFork0_#t~nondet6#1_3|} AuxVars[] AssignedVars[#race~x~0][265], [130#L701-3true, Black: 160#(= |thr1Thread1of4ForFork0_#t~nondet5#1| |#race~x~0|), 154#true, 83#L702-3true, Black: 165#(= |#race~x~0| |thr1Thread2of4ForFork0_#t~nondet5#1|), 137#L703-2true, 107#L710-6true, 148#true, Black: 168#true, 152#true, 173#true, 150#true, Black: 175#(= |#race~x~0| 0), 17#L701-3true, 156#true, 178#true]) [2024-10-13 09:30:50,704 INFO L294 olderBase$Statistics]: this new event has 67 ancestors and is cut-off event [2024-10-13 09:30:50,704 INFO L297 olderBase$Statistics]: existing Event has 67 ancestors and is cut-off event [2024-10-13 09:30:50,704 INFO L297 olderBase$Statistics]: existing Event has 67 ancestors and is cut-off event [2024-10-13 09:30:50,704 INFO L297 olderBase$Statistics]: existing Event has 67 ancestors and is cut-off event [2024-10-13 09:30:53,177 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([644] L703-->L703-1: Formula: (= |v_#race~x~0_7| 0) InVars {} OutVars{#race~x~0=|v_#race~x~0_7|} AuxVars[] AssignedVars[#race~x~0][278], [130#L701-3true, Black: 160#(= |thr1Thread1of4ForFork0_#t~nondet5#1| |#race~x~0|), 154#true, Black: 165#(= |#race~x~0| |thr1Thread2of4ForFork0_#t~nondet5#1|), 137#L703-2true, 107#L710-6true, 148#true, Black: 170#(= |thr1Thread1of4ForFork0_#t~nondet6#1| |#race~x~0|), 152#true, 150#true, 17#L701-3true, Black: 173#true, 156#true, 175#(= |#race~x~0| 0), 92#L703-1true, 178#true]) [2024-10-13 09:30:53,177 INFO L294 olderBase$Statistics]: this new event has 70 ancestors and is cut-off event [2024-10-13 09:30:53,178 INFO L297 olderBase$Statistics]: existing Event has 70 ancestors and is cut-off event [2024-10-13 09:30:53,178 INFO L297 olderBase$Statistics]: existing Event has 70 ancestors and is cut-off event [2024-10-13 09:30:53,178 INFO L297 olderBase$Statistics]: existing Event has 70 ancestors and is cut-off event [2024-10-13 09:30:53,269 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([576] L702-2-->L702-3: Formula: (= |v_thr1Thread3of4ForFork0_#t~nondet6#1_3| |v_#race~x~0_4|) InVars {thr1Thread3of4ForFork0_#t~nondet6#1=|v_thr1Thread3of4ForFork0_#t~nondet6#1_3|} OutVars{#race~x~0=|v_#race~x~0_4|, thr1Thread3of4ForFork0_#t~nondet6#1=|v_thr1Thread3of4ForFork0_#t~nondet6#1_3|} AuxVars[] AssignedVars[#race~x~0][280], [Black: 160#(= |thr1Thread1of4ForFork0_#t~nondet5#1| |#race~x~0|), 154#true, Black: 165#(= |#race~x~0| |thr1Thread2of4ForFork0_#t~nondet5#1|), 137#L703-2true, 3#L702-4true, 107#L710-6true, 148#true, Black: 170#(= |thr1Thread1of4ForFork0_#t~nondet6#1| |#race~x~0|), 173#true, 152#true, 150#true, Black: 175#(= |#race~x~0| 0), 17#L701-3true, 156#true, 31#L702-3true, 178#true]) [2024-10-13 09:30:53,269 INFO L294 olderBase$Statistics]: this new event has 72 ancestors and is cut-off event [2024-10-13 09:30:53,269 INFO L297 olderBase$Statistics]: existing Event has 72 ancestors and is cut-off event [2024-10-13 09:30:53,269 INFO L297 olderBase$Statistics]: existing Event has 72 ancestors and is cut-off event [2024-10-13 09:30:53,269 INFO L297 olderBase$Statistics]: existing Event has 72 ancestors and is cut-off event [2024-10-13 09:30:53,317 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([672] L702-2-->L702-3: Formula: (= |v_#race~x~0_4| |v_thr1Thread2of4ForFork0_#t~nondet6#1_3|) InVars {thr1Thread2of4ForFork0_#t~nondet6#1=|v_thr1Thread2of4ForFork0_#t~nondet6#1_3|} OutVars{thr1Thread2of4ForFork0_#t~nondet6#1=|v_thr1Thread2of4ForFork0_#t~nondet6#1_3|, #race~x~0=|v_#race~x~0_4|} AuxVars[] AssignedVars[#race~x~0][279], [130#L701-3true, Black: 160#(= |thr1Thread1of4ForFork0_#t~nondet5#1| |#race~x~0|), 154#true, Black: 165#(= |#race~x~0| |thr1Thread2of4ForFork0_#t~nondet5#1|), 137#L703-2true, 3#L702-4true, 107#L710-6true, 148#true, Black: 170#(= |thr1Thread1of4ForFork0_#t~nondet6#1| |#race~x~0|), 173#true, 152#true, 150#true, Black: 175#(= |#race~x~0| 0), 156#true, 67#L702-3true, 178#true]) [2024-10-13 09:30:53,318 INFO L294 olderBase$Statistics]: this new event has 72 ancestors and is cut-off event [2024-10-13 09:30:53,318 INFO L297 olderBase$Statistics]: existing Event has 72 ancestors and is cut-off event [2024-10-13 09:30:53,318 INFO L297 olderBase$Statistics]: existing Event has 72 ancestors and is cut-off event [2024-10-13 09:30:53,318 INFO L297 olderBase$Statistics]: existing Event has 72 ancestors and is cut-off event [2024-10-13 09:30:55,747 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([672] L702-2-->L702-3: Formula: (= |v_#race~x~0_4| |v_thr1Thread2of4ForFork0_#t~nondet6#1_3|) InVars {thr1Thread2of4ForFork0_#t~nondet6#1=|v_thr1Thread2of4ForFork0_#t~nondet6#1_3|} OutVars{thr1Thread2of4ForFork0_#t~nondet6#1=|v_thr1Thread2of4ForFork0_#t~nondet6#1_3|, #race~x~0=|v_#race~x~0_4|} AuxVars[] AssignedVars[#race~x~0][145], [60#thr1Err3ASSERT_VIOLATIONDATA_RACEtrue, Black: 160#(= |thr1Thread1of4ForFork0_#t~nondet5#1| |#race~x~0|), 26#L704true, 154#true, Black: 165#(= |#race~x~0| |thr1Thread2of4ForFork0_#t~nondet5#1|), 41#thr1Err2ASSERT_VIOLATIONDATA_RACEtrue, 107#L710-6true, 148#true, Black: 170#(= |thr1Thread1of4ForFork0_#t~nondet6#1| |#race~x~0|), 173#true, 152#true, 150#true, Black: 175#(= |#race~x~0| 0), 156#true, 67#L702-3true, 178#true]) [2024-10-13 09:30:55,747 INFO L294 olderBase$Statistics]: this new event has 74 ancestors and is cut-off event [2024-10-13 09:30:55,747 INFO L297 olderBase$Statistics]: existing Event has 74 ancestors and is cut-off event [2024-10-13 09:30:55,747 INFO L297 olderBase$Statistics]: existing Event has 74 ancestors and is cut-off event [2024-10-13 09:30:55,747 INFO L297 olderBase$Statistics]: existing Event has 74 ancestors and is cut-off event [2024-10-13 09:30:56,370 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([672] L702-2-->L702-3: Formula: (= |v_#race~x~0_4| |v_thr1Thread2of4ForFork0_#t~nondet6#1_3|) InVars {thr1Thread2of4ForFork0_#t~nondet6#1=|v_thr1Thread2of4ForFork0_#t~nondet6#1_3|} OutVars{thr1Thread2of4ForFork0_#t~nondet6#1=|v_thr1Thread2of4ForFork0_#t~nondet6#1_3|, #race~x~0=|v_#race~x~0_4|} AuxVars[] AssignedVars[#race~x~0][145], [Black: 160#(= |thr1Thread1of4ForFork0_#t~nondet5#1| |#race~x~0|), 154#true, Black: 165#(= |#race~x~0| |thr1Thread2of4ForFork0_#t~nondet5#1|), 137#L703-2true, 41#thr1Err2ASSERT_VIOLATIONDATA_RACEtrue, 107#L710-6true, 148#true, Black: 170#(= |thr1Thread1of4ForFork0_#t~nondet6#1| |#race~x~0|), 173#true, 152#true, 150#true, Black: 175#(= |#race~x~0| 0), 57#L703-2true, 156#true, 67#L702-3true, 178#true]) [2024-10-13 09:30:56,370 INFO L294 olderBase$Statistics]: this new event has 75 ancestors and is cut-off event [2024-10-13 09:30:56,370 INFO L297 olderBase$Statistics]: existing Event has 75 ancestors and is cut-off event [2024-10-13 09:30:56,371 INFO L297 olderBase$Statistics]: existing Event has 75 ancestors and is cut-off event [2024-10-13 09:30:56,371 INFO L297 olderBase$Statistics]: existing Event has 75 ancestors and is cut-off event [2024-10-13 09:30:56,488 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([576] L702-2-->L702-3: Formula: (= |v_thr1Thread3of4ForFork0_#t~nondet6#1_3| |v_#race~x~0_4|) InVars {thr1Thread3of4ForFork0_#t~nondet6#1=|v_thr1Thread3of4ForFork0_#t~nondet6#1_3|} OutVars{#race~x~0=|v_#race~x~0_4|, thr1Thread3of4ForFork0_#t~nondet6#1=|v_thr1Thread3of4ForFork0_#t~nondet6#1_3|} AuxVars[] AssignedVars[#race~x~0][182], [Black: 160#(= |thr1Thread1of4ForFork0_#t~nondet5#1| |#race~x~0|), 154#true, Black: 165#(= |#race~x~0| |thr1Thread2of4ForFork0_#t~nondet5#1|), 137#L703-2true, 107#L710-6true, 148#true, Black: 170#(= |thr1Thread1of4ForFork0_#t~nondet6#1| |#race~x~0|), 173#true, 152#true, 150#true, Black: 175#(= |#race~x~0| 0), 57#L703-2true, 156#true, 31#L702-3true, 55#thr1Err2ASSERT_VIOLATIONDATA_RACEtrue, 178#true]) [2024-10-13 09:30:56,488 INFO L294 olderBase$Statistics]: this new event has 75 ancestors and is cut-off event [2024-10-13 09:30:56,488 INFO L297 olderBase$Statistics]: existing Event has 75 ancestors and is cut-off event [2024-10-13 09:30:56,488 INFO L297 olderBase$Statistics]: existing Event has 75 ancestors and is cut-off event [2024-10-13 09:30:56,488 INFO L297 olderBase$Statistics]: existing Event has 75 ancestors and is cut-off event [2024-10-13 09:30:56,532 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([640] L702-2-->L702-3: Formula: (= |v_#race~x~0_4| |v_thr1Thread1of4ForFork0_#t~nondet6#1_3|) InVars {thr1Thread1of4ForFork0_#t~nondet6#1=|v_thr1Thread1of4ForFork0_#t~nondet6#1_3|} OutVars{#race~x~0=|v_#race~x~0_4|, thr1Thread1of4ForFork0_#t~nondet6#1=|v_thr1Thread1of4ForFork0_#t~nondet6#1_3|} AuxVars[] AssignedVars[#race~x~0][147], [Black: 160#(= |thr1Thread1of4ForFork0_#t~nondet5#1| |#race~x~0|), 154#true, 83#L702-3true, Black: 165#(= |#race~x~0| |thr1Thread2of4ForFork0_#t~nondet5#1|), 41#thr1Err2ASSERT_VIOLATIONDATA_RACEtrue, 137#L703-2true, 107#L710-6true, 148#true, 173#true, Black: 168#true, 152#true, 150#true, Black: 175#(= |#race~x~0| 0), 156#true, 127#L703-2true, 178#true]) [2024-10-13 09:30:56,532 INFO L294 olderBase$Statistics]: this new event has 75 ancestors and is cut-off event [2024-10-13 09:30:56,532 INFO L297 olderBase$Statistics]: existing Event has 75 ancestors and is cut-off event [2024-10-13 09:30:56,532 INFO L297 olderBase$Statistics]: existing Event has 75 ancestors and is cut-off event [2024-10-13 09:30:56,532 INFO L297 olderBase$Statistics]: existing Event has 75 ancestors and is cut-off event [2024-10-13 09:30:57,179 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([644] L703-->L703-1: Formula: (= |v_#race~x~0_7| 0) InVars {} OutVars{#race~x~0=|v_#race~x~0_7|} AuxVars[] AssignedVars[#race~x~0][183], [Black: 160#(= |thr1Thread1of4ForFork0_#t~nondet5#1| |#race~x~0|), 154#true, Black: 165#(= |#race~x~0| |thr1Thread2of4ForFork0_#t~nondet5#1|), 137#L703-2true, 107#L710-6true, 41#thr1Err2ASSERT_VIOLATIONDATA_RACEtrue, 148#true, Black: 170#(= |thr1Thread1of4ForFork0_#t~nondet6#1| |#race~x~0|), 152#true, 150#true, Black: 173#true, 156#true, 175#(= |#race~x~0| 0), 127#L703-2true, 92#L703-1true, 178#true]) [2024-10-13 09:30:57,179 INFO L294 olderBase$Statistics]: this new event has 78 ancestors and is cut-off event [2024-10-13 09:30:57,179 INFO L297 olderBase$Statistics]: existing Event has 78 ancestors and is cut-off event [2024-10-13 09:30:57,179 INFO L297 olderBase$Statistics]: existing Event has 78 ancestors and is cut-off event [2024-10-13 09:30:57,180 INFO L297 olderBase$Statistics]: existing Event has 78 ancestors and is cut-off event [2024-10-13 09:30:59,267 INFO L124 PetriNetUnfolderBase]: 61239/136176 cut-off events. [2024-10-13 09:30:59,268 INFO L125 PetriNetUnfolderBase]: For 360700/374987 co-relation queries the response was YES. [2024-10-13 09:31:00,079 INFO L83 FinitePrefix]: Finished finitePrefix Result has 415796 conditions, 136176 events. 61239/136176 cut-off events. For 360700/374987 co-relation queries the response was YES. Maximal size of possible extension queue 4774. Compared 1763826 event pairs, 17774 based on Foata normal form. 213/112378 useless extension candidates. Maximal degree in co-relation 415784. Up to 63044 conditions per place. [2024-10-13 09:31:01,036 INFO L140 encePairwiseOnDemand]: 140/153 looper letters, 113 selfloop transitions, 74 changer transitions 0/285 dead transitions. [2024-10-13 09:31:01,036 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 138 places, 285 transitions, 2197 flow [2024-10-13 09:31:01,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 09:31:01,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 09:31:01,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 332 transitions. [2024-10-13 09:31:01,038 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7233115468409586 [2024-10-13 09:31:01,038 INFO L175 Difference]: Start difference. First operand has 136 places, 216 transitions, 1258 flow. Second operand 3 states and 332 transitions. [2024-10-13 09:31:01,038 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 138 places, 285 transitions, 2197 flow [2024-10-13 09:31:02,191 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 136 places, 285 transitions, 2029 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-13 09:31:02,194 INFO L231 Difference]: Finished difference. Result has 138 places, 278 transitions, 2058 flow [2024-10-13 09:31:02,195 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=153, PETRI_DIFFERENCE_MINUEND_FLOW=1148, PETRI_DIFFERENCE_MINUEND_PLACES=134, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=216, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=142, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2058, PETRI_PLACES=138, PETRI_TRANSITIONS=278} [2024-10-13 09:31:02,195 INFO L277 CegarLoopForPetriNet]: 153 programPoint places, -15 predicate places. [2024-10-13 09:31:02,195 INFO L471 AbstractCegarLoop]: Abstraction has has 138 places, 278 transitions, 2058 flow [2024-10-13 09:31:02,195 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 97.33333333333333) internal successors, (292), 3 states have internal predecessors, (292), 0 states have call successors, (0), 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-10-13 09:31:02,195 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 09:31:02,196 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 09:31:02,196 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-13 09:31:02,196 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting thr1Err2ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE (and 32 more)] === [2024-10-13 09:31:02,196 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:31:02,196 INFO L85 PathProgramCache]: Analyzing trace with hash -794939159, now seen corresponding path program 1 times [2024-10-13 09:31:02,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:31:02,196 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [171250741] [2024-10-13 09:31:02,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:31:02,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:31:02,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:31:02,237 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-10-13 09:31:02,238 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:31:02,238 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [171250741] [2024-10-13 09:31:02,238 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [171250741] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:31:02,238 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:31:02,238 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 09:31:02,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2014324482] [2024-10-13 09:31:02,239 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:31:02,239 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 09:31:02,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:31:02,240 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 09:31:02,240 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 09:31:02,242 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 153 [2024-10-13 09:31:02,242 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 138 places, 278 transitions, 2058 flow. Second operand has 3 states, 3 states have (on average 111.66666666666667) internal successors, (335), 3 states have internal predecessors, (335), 0 states have call successors, (0), 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-10-13 09:31:02,243 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 09:31:02,243 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 153 [2024-10-13 09:31:02,243 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 09:31:02,346 INFO L124 PetriNetUnfolderBase]: 51/1044 cut-off events. [2024-10-13 09:31:02,346 INFO L125 PetriNetUnfolderBase]: For 1197/1197 co-relation queries the response was YES. [2024-10-13 09:31:02,349 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2091 conditions, 1044 events. 51/1044 cut-off events. For 1197/1197 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 7055 event pairs, 18 based on Foata normal form. 62/1012 useless extension candidates. Maximal degree in co-relation 2078. Up to 124 conditions per place. [2024-10-13 09:31:02,351 INFO L140 encePairwiseOnDemand]: 145/153 looper letters, 8 selfloop transitions, 8 changer transitions 0/115 dead transitions. [2024-10-13 09:31:02,351 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 132 places, 115 transitions, 471 flow [2024-10-13 09:31:02,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 09:31:02,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 09:31:02,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 350 transitions. [2024-10-13 09:31:02,353 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7625272331154684 [2024-10-13 09:31:02,353 INFO L175 Difference]: Start difference. First operand has 138 places, 278 transitions, 2058 flow. Second operand 3 states and 350 transitions. [2024-10-13 09:31:02,353 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 132 places, 115 transitions, 471 flow [2024-10-13 09:31:02,357 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 122 places, 115 transitions, 323 flow, removed 60 selfloop flow, removed 10 redundant places. [2024-10-13 09:31:02,359 INFO L231 Difference]: Finished difference. Result has 122 places, 112 transitions, 286 flow [2024-10-13 09:31:02,360 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=153, PETRI_DIFFERENCE_MINUEND_FLOW=270, PETRI_DIFFERENCE_MINUEND_PLACES=120, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=112, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=104, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=286, PETRI_PLACES=122, PETRI_TRANSITIONS=112} [2024-10-13 09:31:02,361 INFO L277 CegarLoopForPetriNet]: 153 programPoint places, -31 predicate places. [2024-10-13 09:31:02,361 INFO L471 AbstractCegarLoop]: Abstraction has has 122 places, 112 transitions, 286 flow [2024-10-13 09:31:02,361 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 111.66666666666667) internal successors, (335), 3 states have internal predecessors, (335), 0 states have call successors, (0), 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-10-13 09:31:02,362 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 09:31:02,362 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 09:31:02,362 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-13 09:31:02,362 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting thr1Err3ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE (and 32 more)] === [2024-10-13 09:31:02,363 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:31:02,363 INFO L85 PathProgramCache]: Analyzing trace with hash -334950737, now seen corresponding path program 1 times [2024-10-13 09:31:02,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:31:02,363 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [544178202] [2024-10-13 09:31:02,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:31:02,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:31:02,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:31:02,386 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-10-13 09:31:02,386 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:31:02,386 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [544178202] [2024-10-13 09:31:02,386 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [544178202] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:31:02,387 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:31:02,387 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 09:31:02,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [897433962] [2024-10-13 09:31:02,387 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:31:02,387 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 09:31:02,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:31:02,388 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 09:31:02,388 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 09:31:02,445 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 95 out of 153 [2024-10-13 09:31:02,446 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 122 places, 112 transitions, 286 flow. Second operand has 3 states, 3 states have (on average 97.33333333333333) internal successors, (292), 3 states have internal predecessors, (292), 0 states have call successors, (0), 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-10-13 09:31:02,446 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 09:31:02,447 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 153 [2024-10-13 09:31:02,447 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 09:31:02,535 INFO L124 PetriNetUnfolderBase]: 120/1099 cut-off events. [2024-10-13 09:31:02,535 INFO L125 PetriNetUnfolderBase]: For 450/450 co-relation queries the response was YES. [2024-10-13 09:31:02,536 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1994 conditions, 1099 events. 120/1099 cut-off events. For 450/450 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 7740 event pairs, 92 based on Foata normal form. 0/1016 useless extension candidates. Maximal degree in co-relation 1985. Up to 349 conditions per place. [2024-10-13 09:31:02,538 INFO L140 encePairwiseOnDemand]: 150/153 looper letters, 31 selfloop transitions, 2 changer transitions 0/113 dead transitions. [2024-10-13 09:31:02,538 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 123 places, 113 transitions, 364 flow [2024-10-13 09:31:02,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 09:31:02,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 09:31:02,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 315 transitions. [2024-10-13 09:31:02,540 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6862745098039216 [2024-10-13 09:31:02,540 INFO L175 Difference]: Start difference. First operand has 122 places, 112 transitions, 286 flow. Second operand 3 states and 315 transitions. [2024-10-13 09:31:02,540 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 123 places, 113 transitions, 364 flow [2024-10-13 09:31:02,541 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 122 places, 113 transitions, 356 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-13 09:31:02,543 INFO L231 Difference]: Finished difference. Result has 122 places, 111 transitions, 280 flow [2024-10-13 09:31:02,543 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=153, PETRI_DIFFERENCE_MINUEND_FLOW=276, PETRI_DIFFERENCE_MINUEND_PLACES=120, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=111, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=109, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=280, PETRI_PLACES=122, PETRI_TRANSITIONS=111} [2024-10-13 09:31:02,543 INFO L277 CegarLoopForPetriNet]: 153 programPoint places, -31 predicate places. [2024-10-13 09:31:02,544 INFO L471 AbstractCegarLoop]: Abstraction has has 122 places, 111 transitions, 280 flow [2024-10-13 09:31:02,544 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 97.33333333333333) internal successors, (292), 3 states have internal predecessors, (292), 0 states have call successors, (0), 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-10-13 09:31:02,544 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 09:31:02,544 INFO L204 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 09:31:02,545 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-13 09:31:02,545 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE (and 32 more)] === [2024-10-13 09:31:02,545 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:31:02,545 INFO L85 PathProgramCache]: Analyzing trace with hash 2123244473, now seen corresponding path program 1 times [2024-10-13 09:31:02,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:31:02,545 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [486577404] [2024-10-13 09:31:02,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:31:02,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:31:02,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 09:31:02,560 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 09:31:02,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 09:31:02,574 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 09:31:02,574 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-13 09:31:02,575 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (35 of 36 remaining) [2024-10-13 09:31:02,575 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (34 of 36 remaining) [2024-10-13 09:31:02,575 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (33 of 36 remaining) [2024-10-13 09:31:02,575 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (32 of 36 remaining) [2024-10-13 09:31:02,575 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (31 of 36 remaining) [2024-10-13 09:31:02,575 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4ASSERT_VIOLATIONDATA_RACE (30 of 36 remaining) [2024-10-13 09:31:02,576 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5ASSERT_VIOLATIONDATA_RACE (29 of 36 remaining) [2024-10-13 09:31:02,576 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err6ASSERT_VIOLATIONDATA_RACE (28 of 36 remaining) [2024-10-13 09:31:02,576 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (27 of 36 remaining) [2024-10-13 09:31:02,576 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (26 of 36 remaining) [2024-10-13 09:31:02,576 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (25 of 36 remaining) [2024-10-13 09:31:02,576 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (24 of 36 remaining) [2024-10-13 09:31:02,577 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4ASSERT_VIOLATIONDATA_RACE (23 of 36 remaining) [2024-10-13 09:31:02,577 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5ASSERT_VIOLATIONDATA_RACE (22 of 36 remaining) [2024-10-13 09:31:02,577 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err6ASSERT_VIOLATIONDATA_RACE (21 of 36 remaining) [2024-10-13 09:31:02,577 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (20 of 36 remaining) [2024-10-13 09:31:02,577 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (19 of 36 remaining) [2024-10-13 09:31:02,577 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (18 of 36 remaining) [2024-10-13 09:31:02,578 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (17 of 36 remaining) [2024-10-13 09:31:02,578 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4ASSERT_VIOLATIONDATA_RACE (16 of 36 remaining) [2024-10-13 09:31:02,578 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5ASSERT_VIOLATIONDATA_RACE (15 of 36 remaining) [2024-10-13 09:31:02,578 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err6ASSERT_VIOLATIONDATA_RACE (14 of 36 remaining) [2024-10-13 09:31:02,578 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (13 of 36 remaining) [2024-10-13 09:31:02,578 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (12 of 36 remaining) [2024-10-13 09:31:02,579 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (11 of 36 remaining) [2024-10-13 09:31:02,579 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (10 of 36 remaining) [2024-10-13 09:31:02,579 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4ASSERT_VIOLATIONDATA_RACE (9 of 36 remaining) [2024-10-13 09:31:02,579 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5ASSERT_VIOLATIONDATA_RACE (8 of 36 remaining) [2024-10-13 09:31:02,579 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err6ASSERT_VIOLATIONDATA_RACE (7 of 36 remaining) [2024-10-13 09:31:02,579 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (6 of 36 remaining) [2024-10-13 09:31:02,579 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (5 of 36 remaining) [2024-10-13 09:31:02,580 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (4 of 36 remaining) [2024-10-13 09:31:02,580 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (3 of 36 remaining) [2024-10-13 09:31:02,580 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4ASSERT_VIOLATIONDATA_RACE (2 of 36 remaining) [2024-10-13 09:31:02,580 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5ASSERT_VIOLATIONDATA_RACE (1 of 36 remaining) [2024-10-13 09:31:02,580 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err6ASSERT_VIOLATIONDATA_RACE (0 of 36 remaining) [2024-10-13 09:31:02,580 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-13 09:31:02,580 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 09:31:02,581 WARN L239 ceAbstractionStarter]: 4 thread instances were not sufficient, I will increase this number and restart the analysis [2024-10-13 09:31:02,581 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 5 thread instances. [2024-10-13 09:31:02,613 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-10-13 09:31:02,615 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 186 places, 186 transitions, 412 flow [2024-10-13 09:31:02,636 INFO L124 PetriNetUnfolderBase]: 16/231 cut-off events. [2024-10-13 09:31:02,636 INFO L125 PetriNetUnfolderBase]: For 30/30 co-relation queries the response was YES. [2024-10-13 09:31:02,638 INFO L83 FinitePrefix]: Finished finitePrefix Result has 257 conditions, 231 events. 16/231 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 780 event pairs, 0 based on Foata normal form. 0/174 useless extension candidates. Maximal degree in co-relation 202. Up to 12 conditions per place. [2024-10-13 09:31:02,638 INFO L82 GeneralOperation]: Start removeDead. Operand has 186 places, 186 transitions, 412 flow [2024-10-13 09:31:02,640 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 186 places, 186 transitions, 412 flow [2024-10-13 09:31:02,641 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 09:31:02,641 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;@5dd90ab0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 09:31:02,641 INFO L334 AbstractCegarLoop]: Starting to check reachability of 43 error locations. [2024-10-13 09:31:02,643 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-10-13 09:31:02,643 INFO L124 PetriNetUnfolderBase]: 2/25 cut-off events. [2024-10-13 09:31:02,643 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-13 09:31:02,643 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 09:31:02,643 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 09:31:02,643 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE (and 39 more)] === [2024-10-13 09:31:02,644 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:31:02,644 INFO L85 PathProgramCache]: Analyzing trace with hash -1649259747, now seen corresponding path program 1 times [2024-10-13 09:31:02,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:31:02,645 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2018726393] [2024-10-13 09:31:02,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:31:02,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:31:02,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:31:02,655 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 09:31:02,655 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:31:02,655 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2018726393] [2024-10-13 09:31:02,655 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2018726393] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:31:02,656 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:31:02,656 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-13 09:31:02,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2134443886] [2024-10-13 09:31:02,656 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:31:02,656 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-13 09:31:02,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:31:02,657 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-13 09:31:02,658 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 09:31:02,659 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 134 out of 186 [2024-10-13 09:31:02,659 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 186 places, 186 transitions, 412 flow. Second operand has 2 states, 2 states have (on average 135.0) internal successors, (270), 2 states have internal predecessors, (270), 0 states have call successors, (0), 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-10-13 09:31:02,659 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 09:31:02,659 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 134 of 186 [2024-10-13 09:31:02,659 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 09:31:03,058 INFO L124 PetriNetUnfolderBase]: 852/5015 cut-off events. [2024-10-13 09:31:03,058 INFO L125 PetriNetUnfolderBase]: For 1559/1559 co-relation queries the response was YES. [2024-10-13 09:31:03,084 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6905 conditions, 5015 events. 852/5015 cut-off events. For 1559/1559 co-relation queries the response was YES. Maximal size of possible extension queue 208. Compared 53424 event pairs, 852 based on Foata normal form. 1214/5381 useless extension candidates. Maximal degree in co-relation 4170. Up to 1216 conditions per place. [2024-10-13 09:31:03,105 INFO L140 encePairwiseOnDemand]: 154/186 looper letters, 15 selfloop transitions, 0 changer transitions 0/141 dead transitions. [2024-10-13 09:31:03,105 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 153 places, 141 transitions, 352 flow [2024-10-13 09:31:03,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-13 09:31:03,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2024-10-13 09:31:03,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 315 transitions. [2024-10-13 09:31:03,107 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8467741935483871 [2024-10-13 09:31:03,107 INFO L175 Difference]: Start difference. First operand has 186 places, 186 transitions, 412 flow. Second operand 2 states and 315 transitions. [2024-10-13 09:31:03,107 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 153 places, 141 transitions, 352 flow [2024-10-13 09:31:03,109 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 153 places, 141 transitions, 340 flow, removed 6 selfloop flow, removed 0 redundant places. [2024-10-13 09:31:03,110 INFO L231 Difference]: Finished difference. Result has 153 places, 141 transitions, 310 flow [2024-10-13 09:31:03,111 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=186, PETRI_DIFFERENCE_MINUEND_FLOW=310, PETRI_DIFFERENCE_MINUEND_PLACES=152, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=141, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=141, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=310, PETRI_PLACES=153, PETRI_TRANSITIONS=141} [2024-10-13 09:31:03,111 INFO L277 CegarLoopForPetriNet]: 186 programPoint places, -33 predicate places. [2024-10-13 09:31:03,111 INFO L471 AbstractCegarLoop]: Abstraction has has 153 places, 141 transitions, 310 flow [2024-10-13 09:31:03,112 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 135.0) internal successors, (270), 2 states have internal predecessors, (270), 0 states have call successors, (0), 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-10-13 09:31:03,112 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 09:31:03,112 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] [2024-10-13 09:31:03,112 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-10-13 09:31:03,112 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err2ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE (and 39 more)] === [2024-10-13 09:31:03,112 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:31:03,113 INFO L85 PathProgramCache]: Analyzing trace with hash -1732584415, now seen corresponding path program 1 times [2024-10-13 09:31:03,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:31:03,113 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1124214474] [2024-10-13 09:31:03,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:31:03,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:31:03,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:31:03,131 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 09:31:03,132 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:31:03,132 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1124214474] [2024-10-13 09:31:03,132 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1124214474] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:31:03,132 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:31:03,132 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 09:31:03,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2077237232] [2024-10-13 09:31:03,132 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:31:03,133 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 09:31:03,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:31:03,133 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 09:31:03,133 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 09:31:03,194 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 186 [2024-10-13 09:31:03,195 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 153 places, 141 transitions, 310 flow. Second operand has 3 states, 3 states have (on average 116.66666666666667) internal successors, (350), 3 states have internal predecessors, (350), 0 states have call successors, (0), 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-10-13 09:31:03,195 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 09:31:03,195 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 186 [2024-10-13 09:31:03,195 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand