./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-race-challenges/thread-join-array-dynamic-race-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-race-challenges/thread-join-array-dynamic-race-2.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 9b6f5676df76ead7ff47af365c70465c7b9cb0ddd7acfe90754727af80919440 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 17:21:11,708 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 17:21:11,775 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2024-10-11 17:21:11,781 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 17:21:11,784 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 17:21:11,801 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 17:21:11,802 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 17:21:11,802 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 17:21:11,802 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 17:21:11,803 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 17:21:11,803 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 17:21:11,803 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 17:21:11,804 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 17:21:11,804 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 17:21:11,804 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 17:21:11,805 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 17:21:11,805 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 17:21:11,805 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 17:21:11,806 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 17:21:11,806 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 17:21:11,806 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 17:21:11,807 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 17:21:11,807 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2024-10-11 17:21:11,807 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 17:21:11,807 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-11 17:21:11,808 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 17:21:11,808 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 17:21:11,808 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 17:21:11,809 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 17:21:11,809 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 17:21:11,809 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 17:21:11,809 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 17:21:11,810 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 17:21:11,810 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 17:21:11,810 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 17:21:11,810 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 17:21:11,811 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 17:21:11,811 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 17:21:11,811 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 17:21:11,811 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 17:21:11,812 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 17:21:11,813 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-clean/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-clean/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 -> 9b6f5676df76ead7ff47af365c70465c7b9cb0ddd7acfe90754727af80919440 [2024-10-11 17:21:12,009 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 17:21:12,026 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 17:21:12,028 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 17:21:12,029 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 17:21:12,030 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 17:21:12,031 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-race-challenges/thread-join-array-dynamic-race-2.i [2024-10-11 17:21:13,332 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 17:21:13,576 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 17:21:13,577 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-race-challenges/thread-join-array-dynamic-race-2.i [2024-10-11 17:21:13,594 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/54459dbe6/791b84a8fb5141dc90265d344f521904/FLAG6d7fd81fb [2024-10-11 17:21:13,954 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/54459dbe6/791b84a8fb5141dc90265d344f521904 [2024-10-11 17:21:13,956 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 17:21:13,957 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 17:21:13,958 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 17:21:13,959 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 17:21:13,963 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 17:21:13,963 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 05:21:13" (1/1) ... [2024-10-11 17:21:13,964 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@12099763 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:21:13, skipping insertion in model container [2024-10-11 17:21:13,964 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 05:21:13" (1/1) ... [2024-10-11 17:21:14,001 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 17:21:14,358 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 17:21:14,367 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 17:21:14,402 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 17:21:14,445 INFO L204 MainTranslator]: Completed translation [2024-10-11 17:21:14,446 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:21:14 WrapperNode [2024-10-11 17:21:14,446 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 17:21:14,447 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 17:21:14,447 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 17:21:14,447 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 17:21:14,452 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:21:14" (1/1) ... [2024-10-11 17:21:14,466 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:21:14" (1/1) ... [2024-10-11 17:21:14,488 INFO L138 Inliner]: procedures = 265, calls = 16, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 65 [2024-10-11 17:21:14,489 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 17:21:14,490 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 17:21:14,490 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 17:21:14,490 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 17:21:14,498 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:21:14" (1/1) ... [2024-10-11 17:21:14,499 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:21:14" (1/1) ... [2024-10-11 17:21:14,506 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:21:14" (1/1) ... [2024-10-11 17:21:14,506 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:21:14" (1/1) ... [2024-10-11 17:21:14,511 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:21:14" (1/1) ... [2024-10-11 17:21:14,514 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:21:14" (1/1) ... [2024-10-11 17:21:14,515 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:21:14" (1/1) ... [2024-10-11 17:21:14,516 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:21:14" (1/1) ... [2024-10-11 17:21:14,518 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 17:21:14,519 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 17:21:14,519 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 17:21:14,519 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 17:21:14,520 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:21:14" (1/1) ... [2024-10-11 17:21:14,524 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 17:21:14,536 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 17:21:14,595 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 17:21:14,599 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 17:21:14,633 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-11 17:21:14,633 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-10-11 17:21:14,633 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-10-11 17:21:14,633 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-10-11 17:21:14,633 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-10-11 17:21:14,651 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-11 17:21:14,651 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 17:21:14,651 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-10-11 17:21:14,651 INFO L130 BoogieDeclarations]: Found specification of procedure thread [2024-10-11 17:21:14,652 INFO L138 BoogieDeclarations]: Found implementation of procedure thread [2024-10-11 17:21:14,652 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 17:21:14,652 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 17:21:14,653 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-10-11 17:21:14,744 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 17:21:14,746 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 17:21:14,896 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-10-11 17:21:14,896 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 17:21:14,921 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 17:21:14,923 INFO L314 CfgBuilder]: Removed 2 assume(true) statements. [2024-10-11 17:21:14,923 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 05:21:14 BoogieIcfgContainer [2024-10-11 17:21:14,923 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 17:21:14,925 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 17:21:14,926 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 17:21:14,928 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 17:21:14,929 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 05:21:13" (1/3) ... [2024-10-11 17:21:14,929 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5378b165 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 05:21:14, skipping insertion in model container [2024-10-11 17:21:14,930 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:21:14" (2/3) ... [2024-10-11 17:21:14,930 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5378b165 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 05:21:14, skipping insertion in model container [2024-10-11 17:21:14,930 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 05:21:14" (3/3) ... [2024-10-11 17:21:14,931 INFO L112 eAbstractionObserver]: Analyzing ICFG thread-join-array-dynamic-race-2.i [2024-10-11 17:21:14,945 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 17:21:14,946 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2024-10-11 17:21:14,946 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-10-11 17:21:15,009 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2024-10-11 17:21:15,038 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 88 places, 89 transitions, 185 flow [2024-10-11 17:21:15,099 INFO L124 PetriNetUnfolderBase]: 6/123 cut-off events. [2024-10-11 17:21:15,100 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-10-11 17:21:15,105 INFO L83 FinitePrefix]: Finished finitePrefix Result has 128 conditions, 123 events. 6/123 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 209 event pairs, 0 based on Foata normal form. 0/107 useless extension candidates. Maximal degree in co-relation 62. Up to 4 conditions per place. [2024-10-11 17:21:15,106 INFO L82 GeneralOperation]: Start removeDead. Operand has 88 places, 89 transitions, 185 flow [2024-10-11 17:21:15,109 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 88 places, 89 transitions, 185 flow [2024-10-11 17:21:15,118 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 17:21:15,126 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;@1e01b77a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 17:21:15,126 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2024-10-11 17:21:15,141 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-10-11 17:21:15,142 INFO L124 PetriNetUnfolderBase]: 3/50 cut-off events. [2024-10-11 17:21:15,142 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-11 17:21:15,142 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:21:15,143 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:21:15,143 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 3 more)] === [2024-10-11 17:21:15,147 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:21:15,148 INFO L85 PathProgramCache]: Analyzing trace with hash -1930866065, now seen corresponding path program 1 times [2024-10-11 17:21:15,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:21:15,155 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [744310327] [2024-10-11 17:21:15,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:21:15,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:21:15,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:21:15,382 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-11 17:21:15,382 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:21:15,383 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [744310327] [2024-10-11 17:21:15,383 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [744310327] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:21:15,383 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:21:15,384 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:21:15,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [173216281] [2024-10-11 17:21:15,385 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:21:15,392 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:21:15,396 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:21:15,414 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:21:15,415 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:21:15,425 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 78 out of 89 [2024-10-11 17:21:15,428 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 89 transitions, 185 flow. Second operand has 3 states, 3 states have (on average 78.66666666666667) internal successors, (236), 3 states have internal predecessors, (236), 0 states have call successors, (0), 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-11 17:21:15,429 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:21:15,429 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 78 of 89 [2024-10-11 17:21:15,430 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:21:15,469 INFO L124 PetriNetUnfolderBase]: 8/161 cut-off events. [2024-10-11 17:21:15,470 INFO L125 PetriNetUnfolderBase]: For 7/10 co-relation queries the response was YES. [2024-10-11 17:21:15,470 INFO L83 FinitePrefix]: Finished finitePrefix Result has 195 conditions, 161 events. 8/161 cut-off events. For 7/10 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 410 event pairs, 1 based on Foata normal form. 8/152 useless extension candidates. Maximal degree in co-relation 122. Up to 16 conditions per place. [2024-10-11 17:21:15,471 INFO L140 encePairwiseOnDemand]: 82/89 looper letters, 8 selfloop transitions, 3 changer transitions 2/90 dead transitions. [2024-10-11 17:21:15,472 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 90 transitions, 211 flow [2024-10-11 17:21:15,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:21:15,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:21:15,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 250 transitions. [2024-10-11 17:21:15,482 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9363295880149812 [2024-10-11 17:21:15,484 INFO L175 Difference]: Start difference. First operand has 88 places, 89 transitions, 185 flow. Second operand 3 states and 250 transitions. [2024-10-11 17:21:15,485 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 90 transitions, 211 flow [2024-10-11 17:21:15,487 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 90 transitions, 211 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-11 17:21:15,492 INFO L231 Difference]: Finished difference. Result has 92 places, 87 transitions, 199 flow [2024-10-11 17:21:15,495 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=89, PETRI_DIFFERENCE_MINUEND_FLOW=179, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=83, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=199, PETRI_PLACES=92, PETRI_TRANSITIONS=87} [2024-10-11 17:21:15,501 INFO L277 CegarLoopForPetriNet]: 88 programPoint places, 4 predicate places. [2024-10-11 17:21:15,501 INFO L471 AbstractCegarLoop]: Abstraction has has 92 places, 87 transitions, 199 flow [2024-10-11 17:21:15,501 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 78.66666666666667) internal successors, (236), 3 states have internal predecessors, (236), 0 states have call successors, (0), 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-11 17:21:15,501 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:21:15,502 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:21:15,502 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 17:21:15,502 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 3 more)] === [2024-10-11 17:21:15,502 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:21:15,502 INFO L85 PathProgramCache]: Analyzing trace with hash 894653936, now seen corresponding path program 1 times [2024-10-11 17:21:15,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:21:15,503 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [904557763] [2024-10-11 17:21:15,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:21:15,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:21:15,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:21:15,996 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-11 17:21:15,997 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:21:15,997 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [904557763] [2024-10-11 17:21:15,998 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [904557763] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:21:15,998 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:21:15,998 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 17:21:15,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [949241543] [2024-10-11 17:21:15,998 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:21:15,999 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 17:21:16,000 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:21:16,001 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 17:21:16,001 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-11 17:21:16,141 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 64 out of 89 [2024-10-11 17:21:16,142 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 87 transitions, 199 flow. Second operand has 6 states, 6 states have (on average 65.5) internal successors, (393), 6 states have internal predecessors, (393), 0 states have call successors, (0), 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-11 17:21:16,143 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:21:16,143 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 64 of 89 [2024-10-11 17:21:16,143 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:21:16,237 INFO L124 PetriNetUnfolderBase]: 31/242 cut-off events. [2024-10-11 17:21:16,237 INFO L125 PetriNetUnfolderBase]: For 9/9 co-relation queries the response was YES. [2024-10-11 17:21:16,238 INFO L83 FinitePrefix]: Finished finitePrefix Result has 367 conditions, 242 events. 31/242 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1057 event pairs, 5 based on Foata normal form. 0/223 useless extension candidates. Maximal degree in co-relation 276. Up to 62 conditions per place. [2024-10-11 17:21:16,239 INFO L140 encePairwiseOnDemand]: 83/89 looper letters, 24 selfloop transitions, 5 changer transitions 0/94 dead transitions. [2024-10-11 17:21:16,240 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 94 transitions, 271 flow [2024-10-11 17:21:16,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 17:21:16,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-11 17:21:16,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 414 transitions. [2024-10-11 17:21:16,245 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7752808988764045 [2024-10-11 17:21:16,245 INFO L175 Difference]: Start difference. First operand has 92 places, 87 transitions, 199 flow. Second operand 6 states and 414 transitions. [2024-10-11 17:21:16,245 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 94 transitions, 271 flow [2024-10-11 17:21:16,246 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 94 transitions, 265 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 17:21:16,249 INFO L231 Difference]: Finished difference. Result has 93 places, 86 transitions, 201 flow [2024-10-11 17:21:16,249 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=89, PETRI_DIFFERENCE_MINUEND_FLOW=191, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=81, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=201, PETRI_PLACES=93, PETRI_TRANSITIONS=86} [2024-10-11 17:21:16,250 INFO L277 CegarLoopForPetriNet]: 88 programPoint places, 5 predicate places. [2024-10-11 17:21:16,250 INFO L471 AbstractCegarLoop]: Abstraction has has 93 places, 86 transitions, 201 flow [2024-10-11 17:21:16,251 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 65.5) internal successors, (393), 6 states have internal predecessors, (393), 0 states have call successors, (0), 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-11 17:21:16,251 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:21:16,251 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:21:16,251 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 17:21:16,252 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 3 more)] === [2024-10-11 17:21:16,252 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:21:16,253 INFO L85 PathProgramCache]: Analyzing trace with hash -2009182366, now seen corresponding path program 1 times [2024-10-11 17:21:16,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:21:16,253 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1288001400] [2024-10-11 17:21:16,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:21:16,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:21:16,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:21:16,350 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-11 17:21:16,351 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:21:16,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1288001400] [2024-10-11 17:21:16,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1288001400] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:21:16,352 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:21:16,352 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 17:21:16,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1472636330] [2024-10-11 17:21:16,353 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:21:16,353 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 17:21:16,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:21:16,354 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 17:21:16,354 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 17:21:16,422 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 71 out of 89 [2024-10-11 17:21:16,423 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 86 transitions, 201 flow. Second operand has 5 states, 5 states have (on average 72.4) internal successors, (362), 5 states have internal predecessors, (362), 0 states have call successors, (0), 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-11 17:21:16,423 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:21:16,423 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 71 of 89 [2024-10-11 17:21:16,423 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:21:16,473 INFO L124 PetriNetUnfolderBase]: 17/230 cut-off events. [2024-10-11 17:21:16,473 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-10-11 17:21:16,474 INFO L83 FinitePrefix]: Finished finitePrefix Result has 328 conditions, 230 events. 17/230 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 814 event pairs, 1 based on Foata normal form. 1/217 useless extension candidates. Maximal degree in co-relation 227. Up to 49 conditions per place. [2024-10-11 17:21:16,477 INFO L140 encePairwiseOnDemand]: 81/89 looper letters, 15 selfloop transitions, 2 changer transitions 5/93 dead transitions. [2024-10-11 17:21:16,477 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 93 transitions, 259 flow [2024-10-11 17:21:16,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 17:21:16,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-11 17:21:16,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 449 transitions. [2024-10-11 17:21:16,480 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8408239700374532 [2024-10-11 17:21:16,480 INFO L175 Difference]: Start difference. First operand has 93 places, 86 transitions, 201 flow. Second operand 6 states and 449 transitions. [2024-10-11 17:21:16,480 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 93 transitions, 259 flow [2024-10-11 17:21:16,481 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 93 transitions, 249 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-10-11 17:21:16,483 INFO L231 Difference]: Finished difference. Result has 97 places, 86 transitions, 209 flow [2024-10-11 17:21:16,484 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=89, PETRI_DIFFERENCE_MINUEND_FLOW=191, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=209, PETRI_PLACES=97, PETRI_TRANSITIONS=86} [2024-10-11 17:21:16,485 INFO L277 CegarLoopForPetriNet]: 88 programPoint places, 9 predicate places. [2024-10-11 17:21:16,485 INFO L471 AbstractCegarLoop]: Abstraction has has 97 places, 86 transitions, 209 flow [2024-10-11 17:21:16,486 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 72.4) internal successors, (362), 5 states have internal predecessors, (362), 0 states have call successors, (0), 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-11 17:21:16,486 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:21:16,486 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:21:16,486 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 17:21:16,487 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 3 more)] === [2024-10-11 17:21:16,487 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:21:16,487 INFO L85 PathProgramCache]: Analyzing trace with hash -667923900, now seen corresponding path program 1 times [2024-10-11 17:21:16,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:21:16,488 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [910086295] [2024-10-11 17:21:16,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:21:16,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:21:16,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:21:16,526 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-11 17:21:16,527 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:21:16,527 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [910086295] [2024-10-11 17:21:16,527 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [910086295] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:21:16,527 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:21:16,527 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:21:16,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2099384806] [2024-10-11 17:21:16,527 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:21:16,527 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:21:16,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:21:16,528 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:21:16,528 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:21:16,538 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 76 out of 89 [2024-10-11 17:21:16,539 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 86 transitions, 209 flow. Second operand has 3 states, 3 states have (on average 77.66666666666667) internal successors, (233), 3 states have internal predecessors, (233), 0 states have call successors, (0), 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-11 17:21:16,539 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:21:16,539 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 76 of 89 [2024-10-11 17:21:16,539 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:21:16,560 INFO L124 PetriNetUnfolderBase]: 5/167 cut-off events. [2024-10-11 17:21:16,561 INFO L125 PetriNetUnfolderBase]: For 19/32 co-relation queries the response was YES. [2024-10-11 17:21:16,563 INFO L83 FinitePrefix]: Finished finitePrefix Result has 244 conditions, 167 events. 5/167 cut-off events. For 19/32 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 475 event pairs, 3 based on Foata normal form. 1/158 useless extension candidates. Maximal degree in co-relation 187. Up to 25 conditions per place. [2024-10-11 17:21:16,564 INFO L140 encePairwiseOnDemand]: 84/89 looper letters, 8 selfloop transitions, 4 changer transitions 3/89 dead transitions. [2024-10-11 17:21:16,564 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 89 transitions, 245 flow [2024-10-11 17:21:16,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:21:16,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:21:16,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 242 transitions. [2024-10-11 17:21:16,566 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9063670411985019 [2024-10-11 17:21:16,566 INFO L175 Difference]: Start difference. First operand has 97 places, 86 transitions, 209 flow. Second operand 3 states and 242 transitions. [2024-10-11 17:21:16,566 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 89 transitions, 245 flow [2024-10-11 17:21:16,568 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 89 transitions, 231 flow, removed 5 selfloop flow, removed 5 redundant places. [2024-10-11 17:21:16,569 INFO L231 Difference]: Finished difference. Result has 93 places, 86 transitions, 217 flow [2024-10-11 17:21:16,571 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=89, PETRI_DIFFERENCE_MINUEND_FLOW=195, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=82, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=217, PETRI_PLACES=93, PETRI_TRANSITIONS=86} [2024-10-11 17:21:16,571 INFO L277 CegarLoopForPetriNet]: 88 programPoint places, 5 predicate places. [2024-10-11 17:21:16,571 INFO L471 AbstractCegarLoop]: Abstraction has has 93 places, 86 transitions, 217 flow [2024-10-11 17:21:16,572 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 77.66666666666667) internal successors, (233), 3 states have internal predecessors, (233), 0 states have call successors, (0), 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-11 17:21:16,572 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:21:16,572 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:21:16,573 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 17:21:16,573 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 3 more)] === [2024-10-11 17:21:16,573 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:21:16,574 INFO L85 PathProgramCache]: Analyzing trace with hash 1285259620, now seen corresponding path program 1 times [2024-10-11 17:21:16,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:21:16,575 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [954192753] [2024-10-11 17:21:16,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:21:16,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:21:16,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:21:16,850 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 17:21:16,850 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:21:16,850 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [954192753] [2024-10-11 17:21:16,850 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [954192753] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:21:16,851 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:21:16,851 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 17:21:16,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [712985346] [2024-10-11 17:21:16,851 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:21:16,851 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 17:21:16,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:21:16,852 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 17:21:16,852 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-11 17:21:16,926 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 66 out of 89 [2024-10-11 17:21:16,927 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 86 transitions, 217 flow. Second operand has 6 states, 6 states have (on average 68.16666666666667) internal successors, (409), 6 states have internal predecessors, (409), 0 states have call successors, (0), 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-11 17:21:16,927 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:21:16,927 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 66 of 89 [2024-10-11 17:21:16,927 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:21:16,978 INFO L124 PetriNetUnfolderBase]: 25/280 cut-off events. [2024-10-11 17:21:16,978 INFO L125 PetriNetUnfolderBase]: For 48/51 co-relation queries the response was YES. [2024-10-11 17:21:16,978 INFO L83 FinitePrefix]: Finished finitePrefix Result has 456 conditions, 280 events. 25/280 cut-off events. For 48/51 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 1222 event pairs, 15 based on Foata normal form. 0/271 useless extension candidates. Maximal degree in co-relation 370. Up to 55 conditions per place. [2024-10-11 17:21:16,979 INFO L140 encePairwiseOnDemand]: 83/89 looper letters, 12 selfloop transitions, 0 changer transitions 18/93 dead transitions. [2024-10-11 17:21:16,979 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 93 transitions, 285 flow [2024-10-11 17:21:16,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 17:21:16,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-11 17:21:16,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 424 transitions. [2024-10-11 17:21:16,981 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7940074906367042 [2024-10-11 17:21:16,981 INFO L175 Difference]: Start difference. First operand has 93 places, 86 transitions, 217 flow. Second operand 6 states and 424 transitions. [2024-10-11 17:21:16,981 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 93 transitions, 285 flow [2024-10-11 17:21:16,983 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 93 transitions, 277 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 17:21:16,984 INFO L231 Difference]: Finished difference. Result has 95 places, 75 transitions, 184 flow [2024-10-11 17:21:16,984 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=89, PETRI_DIFFERENCE_MINUEND_FLOW=207, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=85, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=184, PETRI_PLACES=95, PETRI_TRANSITIONS=75} [2024-10-11 17:21:16,986 INFO L277 CegarLoopForPetriNet]: 88 programPoint places, 7 predicate places. [2024-10-11 17:21:16,986 INFO L471 AbstractCegarLoop]: Abstraction has has 95 places, 75 transitions, 184 flow [2024-10-11 17:21:16,987 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 68.16666666666667) internal successors, (409), 6 states have internal predecessors, (409), 0 states have call successors, (0), 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-11 17:21:16,987 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:21:16,987 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:21:16,988 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 17:21:16,988 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 3 more)] === [2024-10-11 17:21:16,988 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:21:16,989 INFO L85 PathProgramCache]: Analyzing trace with hash 1012954957, now seen corresponding path program 1 times [2024-10-11 17:21:16,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:21:16,989 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1349275672] [2024-10-11 17:21:16,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:21:16,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:21:17,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 17:21:17,008 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-11 17:21:17,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 17:21:17,056 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-11 17:21:17,056 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-11 17:21:17,057 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (5 of 6 remaining) [2024-10-11 17:21:17,066 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (4 of 6 remaining) [2024-10-11 17:21:17,066 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (3 of 6 remaining) [2024-10-11 17:21:17,066 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (2 of 6 remaining) [2024-10-11 17:21:17,066 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (1 of 6 remaining) [2024-10-11 17:21:17,066 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (0 of 6 remaining) [2024-10-11 17:21:17,067 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 17:21:17,067 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2024-10-11 17:21:17,072 WARN L239 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2024-10-11 17:21:17,073 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2024-10-11 17:21:17,104 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-10-11 17:21:17,106 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 107 places, 107 transitions, 230 flow [2024-10-11 17:21:17,130 INFO L124 PetriNetUnfolderBase]: 11/206 cut-off events. [2024-10-11 17:21:17,134 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2024-10-11 17:21:17,135 INFO L83 FinitePrefix]: Finished finitePrefix Result has 218 conditions, 206 events. 11/206 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 446 event pairs, 0 based on Foata normal form. 0/178 useless extension candidates. Maximal degree in co-relation 125. Up to 8 conditions per place. [2024-10-11 17:21:17,135 INFO L82 GeneralOperation]: Start removeDead. Operand has 107 places, 107 transitions, 230 flow [2024-10-11 17:21:17,136 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 107 places, 107 transitions, 230 flow [2024-10-11 17:21:17,141 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 17:21:17,142 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;@1e01b77a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 17:21:17,142 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2024-10-11 17:21:17,145 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-10-11 17:21:17,148 INFO L124 PetriNetUnfolderBase]: 3/50 cut-off events. [2024-10-11 17:21:17,148 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-11 17:21:17,148 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:21:17,148 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:21:17,149 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 4 more)] === [2024-10-11 17:21:17,149 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:21:17,149 INFO L85 PathProgramCache]: Analyzing trace with hash -1073777201, now seen corresponding path program 1 times [2024-10-11 17:21:17,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:21:17,149 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1244762124] [2024-10-11 17:21:17,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:21:17,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:21:17,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:21:17,191 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-11 17:21:17,192 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:21:17,192 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1244762124] [2024-10-11 17:21:17,192 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1244762124] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:21:17,192 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:21:17,192 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:21:17,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1063433638] [2024-10-11 17:21:17,193 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:21:17,195 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:21:17,195 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:21:17,196 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:21:17,196 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:21:17,207 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 107 [2024-10-11 17:21:17,207 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 107 transitions, 230 flow. Second operand has 3 states, 3 states have (on average 91.66666666666667) internal successors, (275), 3 states have internal predecessors, (275), 0 states have call successors, (0), 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-11 17:21:17,207 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:21:17,207 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 107 [2024-10-11 17:21:17,208 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:21:17,278 INFO L124 PetriNetUnfolderBase]: 119/719 cut-off events. [2024-10-11 17:21:17,278 INFO L125 PetriNetUnfolderBase]: For 44/68 co-relation queries the response was YES. [2024-10-11 17:21:17,280 INFO L83 FinitePrefix]: Finished finitePrefix Result has 991 conditions, 719 events. 119/719 cut-off events. For 44/68 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 4242 event pairs, 50 based on Foata normal form. 36/670 useless extension candidates. Maximal degree in co-relation 741. Up to 139 conditions per place. [2024-10-11 17:21:17,281 INFO L140 encePairwiseOnDemand]: 99/107 looper letters, 16 selfloop transitions, 4 changer transitions 1/111 dead transitions. [2024-10-11 17:21:17,282 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 111 transitions, 278 flow [2024-10-11 17:21:17,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:21:17,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:21:17,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 297 transitions. [2024-10-11 17:21:17,283 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9252336448598131 [2024-10-11 17:21:17,283 INFO L175 Difference]: Start difference. First operand has 107 places, 107 transitions, 230 flow. Second operand 3 states and 297 transitions. [2024-10-11 17:21:17,283 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 111 transitions, 278 flow [2024-10-11 17:21:17,284 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 111 transitions, 278 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-11 17:21:17,285 INFO L231 Difference]: Finished difference. Result has 111 places, 106 transitions, 252 flow [2024-10-11 17:21:17,285 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=107, PETRI_DIFFERENCE_MINUEND_FLOW=224, PETRI_DIFFERENCE_MINUEND_PLACES=107, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=104, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=100, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=252, PETRI_PLACES=111, PETRI_TRANSITIONS=106} [2024-10-11 17:21:17,286 INFO L277 CegarLoopForPetriNet]: 107 programPoint places, 4 predicate places. [2024-10-11 17:21:17,286 INFO L471 AbstractCegarLoop]: Abstraction has has 111 places, 106 transitions, 252 flow [2024-10-11 17:21:17,286 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 91.66666666666667) internal successors, (275), 3 states have internal predecessors, (275), 0 states have call successors, (0), 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-11 17:21:17,286 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:21:17,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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:21:17,286 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 17:21:17,287 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 4 more)] === [2024-10-11 17:21:17,287 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:21:17,287 INFO L85 PathProgramCache]: Analyzing trace with hash -76665168, now seen corresponding path program 1 times [2024-10-11 17:21:17,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:21:17,287 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [776637240] [2024-10-11 17:21:17,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:21:17,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:21:17,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:21:17,504 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-11 17:21:17,504 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:21:17,504 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [776637240] [2024-10-11 17:21:17,504 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [776637240] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:21:17,505 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:21:17,505 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 17:21:17,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1729576952] [2024-10-11 17:21:17,508 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:21:17,508 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 17:21:17,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:21:17,509 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 17:21:17,509 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-11 17:21:17,593 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 78 out of 107 [2024-10-11 17:21:17,593 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 106 transitions, 252 flow. Second operand has 6 states, 6 states have (on average 79.5) internal successors, (477), 6 states have internal predecessors, (477), 0 states have call successors, (0), 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-11 17:21:17,594 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:21:17,594 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 78 of 107 [2024-10-11 17:21:17,594 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:21:17,730 INFO L124 PetriNetUnfolderBase]: 299/1306 cut-off events. [2024-10-11 17:21:17,730 INFO L125 PetriNetUnfolderBase]: For 75/75 co-relation queries the response was YES. [2024-10-11 17:21:17,734 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2039 conditions, 1306 events. 299/1306 cut-off events. For 75/75 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 9787 event pairs, 58 based on Foata normal form. 0/1174 useless extension candidates. Maximal degree in co-relation 1408. Up to 372 conditions per place. [2024-10-11 17:21:17,739 INFO L140 encePairwiseOnDemand]: 101/107 looper letters, 36 selfloop transitions, 5 changer transitions 0/121 dead transitions. [2024-10-11 17:21:17,739 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 121 transitions, 364 flow [2024-10-11 17:21:17,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 17:21:17,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-11 17:21:17,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 510 transitions. [2024-10-11 17:21:17,740 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.794392523364486 [2024-10-11 17:21:17,740 INFO L175 Difference]: Start difference. First operand has 111 places, 106 transitions, 252 flow. Second operand 6 states and 510 transitions. [2024-10-11 17:21:17,740 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 114 places, 121 transitions, 364 flow [2024-10-11 17:21:17,742 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 112 places, 121 transitions, 356 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 17:21:17,743 INFO L231 Difference]: Finished difference. Result has 112 places, 105 transitions, 252 flow [2024-10-11 17:21:17,744 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=107, PETRI_DIFFERENCE_MINUEND_FLOW=242, PETRI_DIFFERENCE_MINUEND_PLACES=107, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=105, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=100, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=252, PETRI_PLACES=112, PETRI_TRANSITIONS=105} [2024-10-11 17:21:17,744 INFO L277 CegarLoopForPetriNet]: 107 programPoint places, 5 predicate places. [2024-10-11 17:21:17,744 INFO L471 AbstractCegarLoop]: Abstraction has has 112 places, 105 transitions, 252 flow [2024-10-11 17:21:17,745 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 79.5) internal successors, (477), 6 states have internal predecessors, (477), 0 states have call successors, (0), 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-11 17:21:17,745 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:21:17,745 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:21:17,745 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-11 17:21:17,745 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 4 more)] === [2024-10-11 17:21:17,746 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:21:17,746 INFO L85 PathProgramCache]: Analyzing trace with hash 1314465826, now seen corresponding path program 1 times [2024-10-11 17:21:17,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:21:17,746 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1037602121] [2024-10-11 17:21:17,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:21:17,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:21:17,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:21:17,817 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-11 17:21:17,819 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:21:17,820 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1037602121] [2024-10-11 17:21:17,820 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1037602121] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:21:17,820 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:21:17,820 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 17:21:17,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1693871664] [2024-10-11 17:21:17,820 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:21:17,820 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 17:21:17,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:21:17,821 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 17:21:17,821 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 17:21:17,879 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 107 [2024-10-11 17:21:17,880 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 112 places, 105 transitions, 252 flow. Second operand has 5 states, 5 states have (on average 86.4) internal successors, (432), 5 states have internal predecessors, (432), 0 states have call successors, (0), 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-11 17:21:17,881 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:21:17,881 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 107 [2024-10-11 17:21:17,881 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:21:18,001 INFO L124 PetriNetUnfolderBase]: 179/1195 cut-off events. [2024-10-11 17:21:18,001 INFO L125 PetriNetUnfolderBase]: For 37/37 co-relation queries the response was YES. [2024-10-11 17:21:18,003 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1678 conditions, 1195 events. 179/1195 cut-off events. For 37/37 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 8712 event pairs, 75 based on Foata normal form. 1/1082 useless extension candidates. Maximal degree in co-relation 560. Up to 300 conditions per place. [2024-10-11 17:21:18,006 INFO L140 encePairwiseOnDemand]: 99/107 looper letters, 20 selfloop transitions, 2 changer transitions 5/113 dead transitions. [2024-10-11 17:21:18,006 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 113 transitions, 322 flow [2024-10-11 17:21:18,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 17:21:18,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-11 17:21:18,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 538 transitions. [2024-10-11 17:21:18,007 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.838006230529595 [2024-10-11 17:21:18,008 INFO L175 Difference]: Start difference. First operand has 112 places, 105 transitions, 252 flow. Second operand 6 states and 538 transitions. [2024-10-11 17:21:18,008 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 117 places, 113 transitions, 322 flow [2024-10-11 17:21:18,009 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 112 places, 113 transitions, 312 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-10-11 17:21:18,010 INFO L231 Difference]: Finished difference. Result has 116 places, 106 transitions, 264 flow [2024-10-11 17:21:18,010 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=107, PETRI_DIFFERENCE_MINUEND_FLOW=242, PETRI_DIFFERENCE_MINUEND_PLACES=107, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=105, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=103, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=264, PETRI_PLACES=116, PETRI_TRANSITIONS=106} [2024-10-11 17:21:18,010 INFO L277 CegarLoopForPetriNet]: 107 programPoint places, 9 predicate places. [2024-10-11 17:21:18,011 INFO L471 AbstractCegarLoop]: Abstraction has has 116 places, 106 transitions, 264 flow [2024-10-11 17:21:18,011 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 86.4) internal successors, (432), 5 states have internal predecessors, (432), 0 states have call successors, (0), 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-11 17:21:18,011 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:21:18,011 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:21:18,011 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-11 17:21:18,011 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 4 more)] === [2024-10-11 17:21:18,012 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:21:18,012 INFO L85 PathProgramCache]: Analyzing trace with hash -2079582252, now seen corresponding path program 1 times [2024-10-11 17:21:18,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:21:18,012 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [395141796] [2024-10-11 17:21:18,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:21:18,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:21:18,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:21:18,034 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-11 17:21:18,034 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:21:18,035 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [395141796] [2024-10-11 17:21:18,035 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [395141796] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:21:18,035 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:21:18,035 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:21:18,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [481145103] [2024-10-11 17:21:18,035 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:21:18,035 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:21:18,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:21:18,036 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:21:18,036 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:21:18,047 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 107 [2024-10-11 17:21:18,047 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 116 places, 106 transitions, 264 flow. Second operand has 3 states, 3 states have (on average 90.66666666666667) internal successors, (272), 3 states have internal predecessors, (272), 0 states have call successors, (0), 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-11 17:21:18,047 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:21:18,048 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 107 [2024-10-11 17:21:18,048 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:21:18,134 INFO L124 PetriNetUnfolderBase]: 165/981 cut-off events. [2024-10-11 17:21:18,135 INFO L125 PetriNetUnfolderBase]: For 182/299 co-relation queries the response was YES. [2024-10-11 17:21:18,137 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1597 conditions, 981 events. 165/981 cut-off events. For 182/299 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 7175 event pairs, 88 based on Foata normal form. 3/880 useless extension candidates. Maximal degree in co-relation 1539. Up to 269 conditions per place. [2024-10-11 17:21:18,140 INFO L140 encePairwiseOnDemand]: 101/107 looper letters, 19 selfloop transitions, 7 changer transitions 0/115 dead transitions. [2024-10-11 17:21:18,140 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 115 transitions, 348 flow [2024-10-11 17:21:18,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:21:18,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:21:18,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 291 transitions. [2024-10-11 17:21:18,141 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9065420560747663 [2024-10-11 17:21:18,141 INFO L175 Difference]: Start difference. First operand has 116 places, 106 transitions, 264 flow. Second operand 3 states and 291 transitions. [2024-10-11 17:21:18,141 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 115 transitions, 348 flow [2024-10-11 17:21:18,143 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 115 transitions, 336 flow, removed 5 selfloop flow, removed 4 redundant places. [2024-10-11 17:21:18,144 INFO L231 Difference]: Finished difference. Result has 113 places, 111 transitions, 308 flow [2024-10-11 17:21:18,144 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=107, PETRI_DIFFERENCE_MINUEND_FLOW=252, PETRI_DIFFERENCE_MINUEND_PLACES=109, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=106, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=99, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=308, PETRI_PLACES=113, PETRI_TRANSITIONS=111} [2024-10-11 17:21:18,145 INFO L277 CegarLoopForPetriNet]: 107 programPoint places, 6 predicate places. [2024-10-11 17:21:18,145 INFO L471 AbstractCegarLoop]: Abstraction has has 113 places, 111 transitions, 308 flow [2024-10-11 17:21:18,145 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 90.66666666666667) internal successors, (272), 3 states have internal predecessors, (272), 0 states have call successors, (0), 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-11 17:21:18,145 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:21:18,145 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:21:18,146 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-11 17:21:18,146 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 4 more)] === [2024-10-11 17:21:18,146 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:21:18,146 INFO L85 PathProgramCache]: Analyzing trace with hash 1021294111, now seen corresponding path program 1 times [2024-10-11 17:21:18,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:21:18,146 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1948615950] [2024-10-11 17:21:18,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:21:18,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:21:18,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:21:18,345 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 17:21:18,345 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:21:18,345 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1948615950] [2024-10-11 17:21:18,345 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1948615950] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:21:18,345 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:21:18,345 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 17:21:18,346 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [430302702] [2024-10-11 17:21:18,346 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:21:18,346 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 17:21:18,346 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:21:18,346 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 17:21:18,347 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-11 17:21:18,407 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 80 out of 107 [2024-10-11 17:21:18,407 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 111 transitions, 308 flow. Second operand has 6 states, 6 states have (on average 82.16666666666667) internal successors, (493), 6 states have internal predecessors, (493), 0 states have call successors, (0), 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-11 17:21:18,407 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:21:18,407 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 80 of 107 [2024-10-11 17:21:18,408 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:21:18,548 INFO L124 PetriNetUnfolderBase]: 356/1815 cut-off events. [2024-10-11 17:21:18,548 INFO L125 PetriNetUnfolderBase]: For 306/352 co-relation queries the response was YES. [2024-10-11 17:21:18,552 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2992 conditions, 1815 events. 356/1815 cut-off events. For 306/352 co-relation queries the response was YES. Maximal size of possible extension queue 113. Compared 15341 event pairs, 177 based on Foata normal form. 3/1659 useless extension candidates. Maximal degree in co-relation 2422. Up to 360 conditions per place. [2024-10-11 17:21:18,557 INFO L140 encePairwiseOnDemand]: 101/107 looper letters, 34 selfloop transitions, 5 changer transitions 0/126 dead transitions. [2024-10-11 17:21:18,557 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 126 transitions, 416 flow [2024-10-11 17:21:18,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 17:21:18,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-11 17:21:18,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 520 transitions. [2024-10-11 17:21:18,558 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8099688473520249 [2024-10-11 17:21:18,558 INFO L175 Difference]: Start difference. First operand has 113 places, 111 transitions, 308 flow. Second operand 6 states and 520 transitions. [2024-10-11 17:21:18,559 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 117 places, 126 transitions, 416 flow [2024-10-11 17:21:18,560 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 115 places, 126 transitions, 402 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 17:21:18,561 INFO L231 Difference]: Finished difference. Result has 115 places, 110 transitions, 302 flow [2024-10-11 17:21:18,562 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=107, PETRI_DIFFERENCE_MINUEND_FLOW=292, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=110, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=105, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=302, PETRI_PLACES=115, PETRI_TRANSITIONS=110} [2024-10-11 17:21:18,562 INFO L277 CegarLoopForPetriNet]: 107 programPoint places, 8 predicate places. [2024-10-11 17:21:18,562 INFO L471 AbstractCegarLoop]: Abstraction has has 115 places, 110 transitions, 302 flow [2024-10-11 17:21:18,563 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 82.16666666666667) internal successors, (493), 6 states have internal predecessors, (493), 0 states have call successors, (0), 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-11 17:21:18,563 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:21:18,563 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:21:18,563 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-11 17:21:18,563 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 4 more)] === [2024-10-11 17:21:18,563 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:21:18,563 INFO L85 PathProgramCache]: Analyzing trace with hash 179882135, now seen corresponding path program 1 times [2024-10-11 17:21:18,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:21:18,564 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1746543446] [2024-10-11 17:21:18,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:21:18,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:21:18,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:21:18,636 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:21:18,636 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:21:18,636 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1746543446] [2024-10-11 17:21:18,636 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1746543446] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 17:21:18,636 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [263016079] [2024-10-11 17:21:18,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:21:18,636 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 17:21:18,636 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 17:21:18,638 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 17:21:18,639 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-11 17:21:18,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:21:18,721 INFO L255 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-11 17:21:18,723 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 17:21:18,790 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:21:18,791 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 17:21:18,836 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:21:18,837 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [263016079] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 17:21:18,837 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 17:21:18,837 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 9 [2024-10-11 17:21:18,837 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1936162056] [2024-10-11 17:21:18,837 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 17:21:18,837 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 17:21:18,838 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:21:18,838 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 17:21:18,838 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-10-11 17:21:18,969 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 83 out of 107 [2024-10-11 17:21:18,970 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 110 transitions, 302 flow. Second operand has 9 states, 9 states have (on average 85.22222222222223) internal successors, (767), 9 states have internal predecessors, (767), 0 states have call successors, (0), 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-11 17:21:18,970 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:21:18,970 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 107 [2024-10-11 17:21:18,970 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:21:19,115 INFO L124 PetriNetUnfolderBase]: 161/977 cut-off events. [2024-10-11 17:21:19,115 INFO L125 PetriNetUnfolderBase]: For 131/153 co-relation queries the response was YES. [2024-10-11 17:21:19,117 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1598 conditions, 977 events. 161/977 cut-off events. For 131/153 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 6598 event pairs, 35 based on Foata normal form. 0/906 useless extension candidates. Maximal degree in co-relation 952. Up to 157 conditions per place. [2024-10-11 17:21:19,120 INFO L140 encePairwiseOnDemand]: 97/107 looper letters, 27 selfloop transitions, 9 changer transitions 9/132 dead transitions. [2024-10-11 17:21:19,120 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 132 transitions, 440 flow [2024-10-11 17:21:19,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 17:21:19,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-10-11 17:21:19,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 710 transitions. [2024-10-11 17:21:19,122 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8294392523364486 [2024-10-11 17:21:19,122 INFO L175 Difference]: Start difference. First operand has 115 places, 110 transitions, 302 flow. Second operand 8 states and 710 transitions. [2024-10-11 17:21:19,122 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 122 places, 132 transitions, 440 flow [2024-10-11 17:21:19,123 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 132 transitions, 428 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-10-11 17:21:19,124 INFO L231 Difference]: Finished difference. Result has 120 places, 111 transitions, 325 flow [2024-10-11 17:21:19,124 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=107, PETRI_DIFFERENCE_MINUEND_FLOW=286, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=109, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=100, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=325, PETRI_PLACES=120, PETRI_TRANSITIONS=111} [2024-10-11 17:21:19,125 INFO L277 CegarLoopForPetriNet]: 107 programPoint places, 13 predicate places. [2024-10-11 17:21:19,125 INFO L471 AbstractCegarLoop]: Abstraction has has 120 places, 111 transitions, 325 flow [2024-10-11 17:21:19,126 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 85.22222222222223) internal successors, (767), 9 states have internal predecessors, (767), 0 states have call successors, (0), 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-11 17:21:19,126 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:21:19,126 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:21:19,143 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-11 17:21:19,329 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2024-10-11 17:21:19,330 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 4 more)] === [2024-10-11 17:21:19,330 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:21:19,330 INFO L85 PathProgramCache]: Analyzing trace with hash -1060604224, now seen corresponding path program 1 times [2024-10-11 17:21:19,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:21:19,331 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1460482955] [2024-10-11 17:21:19,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:21:19,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:21:19,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:21:19,388 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-10-11 17:21:19,388 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:21:19,388 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1460482955] [2024-10-11 17:21:19,388 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1460482955] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:21:19,388 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:21:19,391 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:21:19,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1103789308] [2024-10-11 17:21:19,391 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:21:19,391 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:21:19,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:21:19,392 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:21:19,392 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:21:19,411 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 107 [2024-10-11 17:21:19,411 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 120 places, 111 transitions, 325 flow. Second operand has 3 states, 3 states have (on average 91.0) internal successors, (273), 3 states have internal predecessors, (273), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:21:19,412 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:21:19,412 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 107 [2024-10-11 17:21:19,412 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:21:19,504 INFO L124 PetriNetUnfolderBase]: 56/601 cut-off events. [2024-10-11 17:21:19,504 INFO L125 PetriNetUnfolderBase]: For 229/290 co-relation queries the response was YES. [2024-10-11 17:21:19,509 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1036 conditions, 601 events. 56/601 cut-off events. For 229/290 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 3609 event pairs, 30 based on Foata normal form. 3/581 useless extension candidates. Maximal degree in co-relation 910. Up to 119 conditions per place. [2024-10-11 17:21:19,510 INFO L140 encePairwiseOnDemand]: 101/107 looper letters, 19 selfloop transitions, 7 changer transitions 1/118 dead transitions. [2024-10-11 17:21:19,510 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 118 transitions, 402 flow [2024-10-11 17:21:19,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:21:19,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:21:19,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 290 transitions. [2024-10-11 17:21:19,515 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9034267912772586 [2024-10-11 17:21:19,515 INFO L175 Difference]: Start difference. First operand has 120 places, 111 transitions, 325 flow. Second operand 3 states and 290 transitions. [2024-10-11 17:21:19,515 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 122 places, 118 transitions, 402 flow [2024-10-11 17:21:19,516 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 119 places, 118 transitions, 396 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-10-11 17:21:19,521 INFO L231 Difference]: Finished difference. Result has 121 places, 114 transitions, 369 flow [2024-10-11 17:21:19,521 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=107, PETRI_DIFFERENCE_MINUEND_FLOW=319, PETRI_DIFFERENCE_MINUEND_PLACES=117, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=111, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=104, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=369, PETRI_PLACES=121, PETRI_TRANSITIONS=114} [2024-10-11 17:21:19,522 INFO L277 CegarLoopForPetriNet]: 107 programPoint places, 14 predicate places. [2024-10-11 17:21:19,522 INFO L471 AbstractCegarLoop]: Abstraction has has 121 places, 114 transitions, 369 flow [2024-10-11 17:21:19,522 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 91.0) internal successors, (273), 3 states have internal predecessors, (273), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:21:19,522 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:21:19,522 INFO L204 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:21:19,522 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-11 17:21:19,523 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 4 more)] === [2024-10-11 17:21:19,523 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:21:19,523 INFO L85 PathProgramCache]: Analyzing trace with hash -881547959, now seen corresponding path program 1 times [2024-10-11 17:21:19,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:21:19,523 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [677411953] [2024-10-11 17:21:19,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:21:19,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:21:19,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 17:21:19,551 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-11 17:21:19,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 17:21:19,564 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-11 17:21:19,565 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-11 17:21:19,565 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (6 of 7 remaining) [2024-10-11 17:21:19,565 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (5 of 7 remaining) [2024-10-11 17:21:19,565 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (4 of 7 remaining) [2024-10-11 17:21:19,565 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (3 of 7 remaining) [2024-10-11 17:21:19,565 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (2 of 7 remaining) [2024-10-11 17:21:19,565 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (1 of 7 remaining) [2024-10-11 17:21:19,566 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (0 of 7 remaining) [2024-10-11 17:21:19,566 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-11 17:21:19,566 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:21:19,566 WARN L239 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2024-10-11 17:21:19,566 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2024-10-11 17:21:19,578 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2024-10-11 17:21:19,580 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 126 places, 125 transitions, 277 flow [2024-10-11 17:21:19,596 INFO L124 PetriNetUnfolderBase]: 21/336 cut-off events. [2024-10-11 17:21:19,596 INFO L125 PetriNetUnfolderBase]: For 19/19 co-relation queries the response was YES. [2024-10-11 17:21:19,597 INFO L83 FinitePrefix]: Finished finitePrefix Result has 361 conditions, 336 events. 21/336 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 902 event pairs, 1 based on Foata normal form. 0/288 useless extension candidates. Maximal degree in co-relation 214. Up to 16 conditions per place. [2024-10-11 17:21:19,597 INFO L82 GeneralOperation]: Start removeDead. Operand has 126 places, 125 transitions, 277 flow [2024-10-11 17:21:19,598 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 126 places, 125 transitions, 277 flow [2024-10-11 17:21:19,599 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 17:21:19,599 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;@1e01b77a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 17:21:19,599 INFO L334 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2024-10-11 17:21:19,601 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-10-11 17:21:19,601 INFO L124 PetriNetUnfolderBase]: 3/50 cut-off events. [2024-10-11 17:21:19,601 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-11 17:21:19,601 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:21:19,602 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:21:19,602 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2024-10-11 17:21:19,602 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:21:19,602 INFO L85 PathProgramCache]: Analyzing trace with hash -1758380177, now seen corresponding path program 1 times [2024-10-11 17:21:19,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:21:19,602 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1934615846] [2024-10-11 17:21:19,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:21:19,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:21:19,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:21:19,633 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-11 17:21:19,633 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:21:19,633 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1934615846] [2024-10-11 17:21:19,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1934615846] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:21:19,633 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:21:19,634 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:21:19,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [689427154] [2024-10-11 17:21:19,634 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:21:19,634 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:21:19,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:21:19,634 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:21:19,635 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:21:19,645 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 125 [2024-10-11 17:21:19,645 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 126 places, 125 transitions, 277 flow. Second operand has 3 states, 3 states have (on average 104.66666666666667) internal successors, (314), 3 states have internal predecessors, (314), 0 states have call successors, (0), 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-11 17:21:19,645 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:21:19,646 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 125 [2024-10-11 17:21:19,646 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:21:19,984 INFO L124 PetriNetUnfolderBase]: 1071/3960 cut-off events. [2024-10-11 17:21:19,984 INFO L125 PetriNetUnfolderBase]: For 378/483 co-relation queries the response was YES. [2024-10-11 17:21:19,991 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5875 conditions, 3960 events. 1071/3960 cut-off events. For 378/483 co-relation queries the response was YES. Maximal size of possible extension queue 177. Compared 35581 event pairs, 542 based on Foata normal form. 179/3698 useless extension candidates. Maximal degree in co-relation 4604. Up to 1110 conditions per place. [2024-10-11 17:21:20,003 INFO L140 encePairwiseOnDemand]: 116/125 looper letters, 23 selfloop transitions, 5 changer transitions 1/132 dead transitions. [2024-10-11 17:21:20,003 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 128 places, 132 transitions, 347 flow [2024-10-11 17:21:20,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:21:20,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:21:20,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 344 transitions. [2024-10-11 17:21:20,005 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9173333333333333 [2024-10-11 17:21:20,005 INFO L175 Difference]: Start difference. First operand has 126 places, 125 transitions, 277 flow. Second operand 3 states and 344 transitions. [2024-10-11 17:21:20,005 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 128 places, 132 transitions, 347 flow [2024-10-11 17:21:20,006 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 128 places, 132 transitions, 347 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-11 17:21:20,008 INFO L231 Difference]: Finished difference. Result has 130 places, 125 transitions, 307 flow [2024-10-11 17:21:20,008 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=125, PETRI_DIFFERENCE_MINUEND_FLOW=271, PETRI_DIFFERENCE_MINUEND_PLACES=126, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=122, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=117, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=307, PETRI_PLACES=130, PETRI_TRANSITIONS=125} [2024-10-11 17:21:20,008 INFO L277 CegarLoopForPetriNet]: 126 programPoint places, 4 predicate places. [2024-10-11 17:21:20,008 INFO L471 AbstractCegarLoop]: Abstraction has has 130 places, 125 transitions, 307 flow [2024-10-11 17:21:20,009 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 104.66666666666667) internal successors, (314), 3 states have internal predecessors, (314), 0 states have call successors, (0), 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-11 17:21:20,009 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:21:20,009 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:21:20,009 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-11 17:21:20,009 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2024-10-11 17:21:20,010 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:21:20,010 INFO L85 PathProgramCache]: Analyzing trace with hash -850124816, now seen corresponding path program 1 times [2024-10-11 17:21:20,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:21:20,010 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [787997723] [2024-10-11 17:21:20,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:21:20,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:21:20,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:21:20,171 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-11 17:21:20,172 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:21:20,172 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [787997723] [2024-10-11 17:21:20,172 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [787997723] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:21:20,172 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:21:20,172 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 17:21:20,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1629346414] [2024-10-11 17:21:20,172 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:21:20,173 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 17:21:20,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:21:20,173 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 17:21:20,174 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-11 17:21:20,246 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 125 [2024-10-11 17:21:20,246 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 130 places, 125 transitions, 307 flow. Second operand has 6 states, 6 states have (on average 93.5) internal successors, (561), 6 states have internal predecessors, (561), 0 states have call successors, (0), 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-11 17:21:20,246 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:21:20,246 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 125 [2024-10-11 17:21:20,247 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:21:20,935 INFO L124 PetriNetUnfolderBase]: 2135/6741 cut-off events. [2024-10-11 17:21:20,935 INFO L125 PetriNetUnfolderBase]: For 509/509 co-relation queries the response was YES. [2024-10-11 17:21:20,950 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10971 conditions, 6741 events. 2135/6741 cut-off events. For 509/509 co-relation queries the response was YES. Maximal size of possible extension queue 331. Compared 67071 event pairs, 440 based on Foata normal form. 0/5959 useless extension candidates. Maximal degree in co-relation 6909. Up to 2247 conditions per place. [2024-10-11 17:21:20,974 INFO L140 encePairwiseOnDemand]: 119/125 looper letters, 48 selfloop transitions, 5 changer transitions 0/148 dead transitions. [2024-10-11 17:21:20,974 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 133 places, 148 transitions, 459 flow [2024-10-11 17:21:20,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 17:21:20,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-11 17:21:20,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 606 transitions. [2024-10-11 17:21:20,976 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.808 [2024-10-11 17:21:20,976 INFO L175 Difference]: Start difference. First operand has 130 places, 125 transitions, 307 flow. Second operand 6 states and 606 transitions. [2024-10-11 17:21:20,976 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 133 places, 148 transitions, 459 flow [2024-10-11 17:21:20,981 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 131 places, 148 transitions, 449 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 17:21:20,983 INFO L231 Difference]: Finished difference. Result has 131 places, 124 transitions, 305 flow [2024-10-11 17:21:20,983 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=125, PETRI_DIFFERENCE_MINUEND_FLOW=295, PETRI_DIFFERENCE_MINUEND_PLACES=126, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=124, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=119, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=305, PETRI_PLACES=131, PETRI_TRANSITIONS=124} [2024-10-11 17:21:20,983 INFO L277 CegarLoopForPetriNet]: 126 programPoint places, 5 predicate places. [2024-10-11 17:21:20,984 INFO L471 AbstractCegarLoop]: Abstraction has has 131 places, 124 transitions, 305 flow [2024-10-11 17:21:20,984 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 93.5) internal successors, (561), 6 states have internal predecessors, (561), 0 states have call successors, (0), 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-11 17:21:20,984 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:21:20,984 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:21:20,984 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-11 17:21:20,985 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2024-10-11 17:21:20,985 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:21:20,985 INFO L85 PathProgramCache]: Analyzing trace with hash 541006178, now seen corresponding path program 1 times [2024-10-11 17:21:20,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:21:20,985 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [600659195] [2024-10-11 17:21:20,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:21:20,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:21:20,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:21:21,031 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-11 17:21:21,032 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:21:21,032 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [600659195] [2024-10-11 17:21:21,032 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [600659195] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:21:21,032 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:21:21,032 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 17:21:21,032 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1866592528] [2024-10-11 17:21:21,032 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:21:21,032 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 17:21:21,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:21:21,033 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 17:21:21,033 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 17:21:21,099 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 125 [2024-10-11 17:21:21,100 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 131 places, 124 transitions, 305 flow. Second operand has 5 states, 5 states have (on average 100.4) internal successors, (502), 5 states have internal predecessors, (502), 0 states have call successors, (0), 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-11 17:21:21,100 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:21:21,100 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 125 [2024-10-11 17:21:21,100 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:21:21,733 INFO L124 PetriNetUnfolderBase]: 1392/6275 cut-off events. [2024-10-11 17:21:21,733 INFO L125 PetriNetUnfolderBase]: For 268/268 co-relation queries the response was YES. [2024-10-11 17:21:21,816 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8980 conditions, 6275 events. 1392/6275 cut-off events. For 268/268 co-relation queries the response was YES. Maximal size of possible extension queue 201. Compared 63462 event pairs, 1074 based on Foata normal form. 1/5612 useless extension candidates. Maximal degree in co-relation 5639. Up to 1837 conditions per place. [2024-10-11 17:21:21,832 INFO L140 encePairwiseOnDemand]: 117/125 looper letters, 24 selfloop transitions, 2 changer transitions 5/132 dead transitions. [2024-10-11 17:21:21,833 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 136 places, 132 transitions, 383 flow [2024-10-11 17:21:21,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 17:21:21,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-11 17:21:21,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 626 transitions. [2024-10-11 17:21:21,834 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8346666666666667 [2024-10-11 17:21:21,835 INFO L175 Difference]: Start difference. First operand has 131 places, 124 transitions, 305 flow. Second operand 6 states and 626 transitions. [2024-10-11 17:21:21,835 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 136 places, 132 transitions, 383 flow [2024-10-11 17:21:21,836 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 131 places, 132 transitions, 373 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-10-11 17:21:21,837 INFO L231 Difference]: Finished difference. Result has 135 places, 125 transitions, 317 flow [2024-10-11 17:21:21,837 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=125, PETRI_DIFFERENCE_MINUEND_FLOW=295, PETRI_DIFFERENCE_MINUEND_PLACES=126, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=124, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=122, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=317, PETRI_PLACES=135, PETRI_TRANSITIONS=125} [2024-10-11 17:21:21,838 INFO L277 CegarLoopForPetriNet]: 126 programPoint places, 9 predicate places. [2024-10-11 17:21:21,838 INFO L471 AbstractCegarLoop]: Abstraction has has 135 places, 125 transitions, 317 flow [2024-10-11 17:21:21,838 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 100.4) internal successors, (502), 5 states have internal predecessors, (502), 0 states have call successors, (0), 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-11 17:21:21,838 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:21:21,838 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:21:21,838 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-11 17:21:21,839 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2024-10-11 17:21:21,839 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:21:21,839 INFO L85 PathProgramCache]: Analyzing trace with hash 917682500, now seen corresponding path program 1 times [2024-10-11 17:21:21,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:21:21,839 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1299540092] [2024-10-11 17:21:21,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:21:21,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:21:21,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:21:21,861 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-11 17:21:21,861 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:21:21,861 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1299540092] [2024-10-11 17:21:21,861 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1299540092] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:21:21,861 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:21:21,861 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:21:21,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1816136854] [2024-10-11 17:21:21,861 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:21:21,861 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:21:21,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:21:21,862 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:21:21,862 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:21:21,877 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 125 [2024-10-11 17:21:21,878 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 135 places, 125 transitions, 317 flow. Second operand has 3 states, 3 states have (on average 103.66666666666667) internal successors, (311), 3 states have internal predecessors, (311), 0 states have call successors, (0), 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-11 17:21:21,878 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:21:21,878 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 125 [2024-10-11 17:21:21,878 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:21:22,568 INFO L124 PetriNetUnfolderBase]: 1740/6509 cut-off events. [2024-10-11 17:21:22,569 INFO L125 PetriNetUnfolderBase]: For 1635/2354 co-relation queries the response was YES. [2024-10-11 17:21:22,586 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11100 conditions, 6509 events. 1740/6509 cut-off events. For 1635/2354 co-relation queries the response was YES. Maximal size of possible extension queue 320. Compared 67622 event pairs, 967 based on Foata normal form. 10/5761 useless extension candidates. Maximal degree in co-relation 11041. Up to 2240 conditions per place. [2024-10-11 17:21:22,604 INFO L140 encePairwiseOnDemand]: 118/125 looper letters, 29 selfloop transitions, 9 changer transitions 0/140 dead transitions. [2024-10-11 17:21:22,604 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 134 places, 140 transitions, 451 flow [2024-10-11 17:21:22,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:21:22,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:21:22,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 340 transitions. [2024-10-11 17:21:22,605 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9066666666666666 [2024-10-11 17:21:22,605 INFO L175 Difference]: Start difference. First operand has 135 places, 125 transitions, 317 flow. Second operand 3 states and 340 transitions. [2024-10-11 17:21:22,605 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 134 places, 140 transitions, 451 flow [2024-10-11 17:21:22,612 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 130 places, 140 transitions, 439 flow, removed 5 selfloop flow, removed 4 redundant places. [2024-10-11 17:21:22,613 INFO L231 Difference]: Finished difference. Result has 132 places, 132 transitions, 381 flow [2024-10-11 17:21:22,613 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=125, PETRI_DIFFERENCE_MINUEND_FLOW=305, PETRI_DIFFERENCE_MINUEND_PLACES=128, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=125, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=116, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=381, PETRI_PLACES=132, PETRI_TRANSITIONS=132} [2024-10-11 17:21:22,614 INFO L277 CegarLoopForPetriNet]: 126 programPoint places, 6 predicate places. [2024-10-11 17:21:22,614 INFO L471 AbstractCegarLoop]: Abstraction has has 132 places, 132 transitions, 381 flow [2024-10-11 17:21:22,614 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 103.66666666666667) internal successors, (311), 3 states have internal predecessors, (311), 0 states have call successors, (0), 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-11 17:21:22,614 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:21:22,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, 1, 1, 1, 1, 1, 1, 1, 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-11 17:21:22,615 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-11 17:21:22,615 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2024-10-11 17:21:22,615 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:21:22,615 INFO L85 PathProgramCache]: Analyzing trace with hash 161140844, now seen corresponding path program 1 times [2024-10-11 17:21:22,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:21:22,615 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2070192998] [2024-10-11 17:21:22,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:21:22,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:21:22,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:21:22,907 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 17:21:22,908 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:21:22,908 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2070192998] [2024-10-11 17:21:22,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2070192998] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:21:22,908 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:21:22,908 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 17:21:22,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2106828760] [2024-10-11 17:21:22,908 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:21:22,908 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 17:21:22,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:21:22,909 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 17:21:22,909 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-11 17:21:23,000 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 125 [2024-10-11 17:21:23,001 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 132 places, 132 transitions, 381 flow. Second operand has 6 states, 6 states have (on average 96.16666666666667) internal successors, (577), 6 states have internal predecessors, (577), 0 states have call successors, (0), 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-11 17:21:23,001 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:21:23,001 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 125 [2024-10-11 17:21:23,001 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:21:24,134 INFO L124 PetriNetUnfolderBase]: 2856/10331 cut-off events. [2024-10-11 17:21:24,135 INFO L125 PetriNetUnfolderBase]: For 1730/2294 co-relation queries the response was YES. [2024-10-11 17:21:24,161 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17463 conditions, 10331 events. 2856/10331 cut-off events. For 1730/2294 co-relation queries the response was YES. Maximal size of possible extension queue 465. Compared 114378 event pairs, 1400 based on Foata normal form. 17/9184 useless extension candidates. Maximal degree in co-relation 13963. Up to 2139 conditions per place. [2024-10-11 17:21:24,192 INFO L140 encePairwiseOnDemand]: 119/125 looper letters, 46 selfloop transitions, 5 changer transitions 0/155 dead transitions. [2024-10-11 17:21:24,192 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 136 places, 155 transitions, 529 flow [2024-10-11 17:21:24,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 17:21:24,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-11 17:21:24,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 616 transitions. [2024-10-11 17:21:24,194 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8213333333333334 [2024-10-11 17:21:24,194 INFO L175 Difference]: Start difference. First operand has 132 places, 132 transitions, 381 flow. Second operand 6 states and 616 transitions. [2024-10-11 17:21:24,194 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 136 places, 155 transitions, 529 flow [2024-10-11 17:21:24,201 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 134 places, 155 transitions, 511 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 17:21:24,203 INFO L231 Difference]: Finished difference. Result has 134 places, 131 transitions, 371 flow [2024-10-11 17:21:24,203 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=125, PETRI_DIFFERENCE_MINUEND_FLOW=361, PETRI_DIFFERENCE_MINUEND_PLACES=129, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=131, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=126, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=371, PETRI_PLACES=134, PETRI_TRANSITIONS=131} [2024-10-11 17:21:24,204 INFO L277 CegarLoopForPetriNet]: 126 programPoint places, 8 predicate places. [2024-10-11 17:21:24,204 INFO L471 AbstractCegarLoop]: Abstraction has has 134 places, 131 transitions, 371 flow [2024-10-11 17:21:24,204 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 96.16666666666667) internal successors, (577), 6 states have internal predecessors, (577), 0 states have call successors, (0), 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-11 17:21:24,204 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:21:24,204 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:21:24,204 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-11 17:21:24,204 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2024-10-11 17:21:24,205 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:21:24,205 INFO L85 PathProgramCache]: Analyzing trace with hash 694988840, now seen corresponding path program 1 times [2024-10-11 17:21:24,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:21:24,205 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [601250282] [2024-10-11 17:21:24,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:21:24,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:21:24,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:21:24,263 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:21:24,264 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:21:24,264 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [601250282] [2024-10-11 17:21:24,264 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [601250282] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 17:21:24,264 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [750063587] [2024-10-11 17:21:24,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:21:24,265 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 17:21:24,265 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 17:21:24,266 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 17:21:24,270 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-11 17:21:24,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:21:24,346 INFO L255 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-11 17:21:24,347 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 17:21:24,385 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:21:24,386 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 17:21:24,427 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:21:24,428 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [750063587] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 17:21:24,429 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 17:21:24,429 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 9 [2024-10-11 17:21:24,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1979639247] [2024-10-11 17:21:24,429 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 17:21:24,429 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 17:21:24,429 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:21:24,430 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 17:21:24,430 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-10-11 17:21:24,632 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 97 out of 125 [2024-10-11 17:21:24,633 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 134 places, 131 transitions, 371 flow. Second operand has 9 states, 9 states have (on average 99.22222222222223) internal successors, (893), 9 states have internal predecessors, (893), 0 states have call successors, (0), 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-11 17:21:24,634 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:21:24,634 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 125 [2024-10-11 17:21:24,634 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:21:25,235 INFO L124 PetriNetUnfolderBase]: 1459/6147 cut-off events. [2024-10-11 17:21:25,235 INFO L125 PetriNetUnfolderBase]: For 935/1162 co-relation queries the response was YES. [2024-10-11 17:21:25,248 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10404 conditions, 6147 events. 1459/6147 cut-off events. For 935/1162 co-relation queries the response was YES. Maximal size of possible extension queue 184. Compared 62125 event pairs, 454 based on Foata normal form. 1/5513 useless extension candidates. Maximal degree in co-relation 5059. Up to 1044 conditions per place. [2024-10-11 17:21:25,261 INFO L140 encePairwiseOnDemand]: 115/125 looper letters, 48 selfloop transitions, 10 changer transitions 0/163 dead transitions. [2024-10-11 17:21:25,261 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 141 places, 163 transitions, 562 flow [2024-10-11 17:21:25,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 17:21:25,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-10-11 17:21:25,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 835 transitions. [2024-10-11 17:21:25,263 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.835 [2024-10-11 17:21:25,263 INFO L175 Difference]: Start difference. First operand has 134 places, 131 transitions, 371 flow. Second operand 8 states and 835 transitions. [2024-10-11 17:21:25,263 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 141 places, 163 transitions, 562 flow [2024-10-11 17:21:25,267 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 136 places, 163 transitions, 550 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-10-11 17:21:25,269 INFO L231 Difference]: Finished difference. Result has 139 places, 134 transitions, 405 flow [2024-10-11 17:21:25,269 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=125, PETRI_DIFFERENCE_MINUEND_FLOW=361, PETRI_DIFFERENCE_MINUEND_PLACES=129, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=131, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=122, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=405, PETRI_PLACES=139, PETRI_TRANSITIONS=134} [2024-10-11 17:21:25,269 INFO L277 CegarLoopForPetriNet]: 126 programPoint places, 13 predicate places. [2024-10-11 17:21:25,269 INFO L471 AbstractCegarLoop]: Abstraction has has 139 places, 134 transitions, 405 flow [2024-10-11 17:21:25,270 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 99.22222222222223) internal successors, (893), 9 states have internal predecessors, (893), 0 states have call successors, (0), 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-11 17:21:25,270 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:21:25,270 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:21:25,287 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-10-11 17:21:25,474 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 17:21:25,475 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2024-10-11 17:21:25,475 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:21:25,476 INFO L85 PathProgramCache]: Analyzing trace with hash 2119836893, now seen corresponding path program 1 times [2024-10-11 17:21:25,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:21:25,476 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2030402825] [2024-10-11 17:21:25,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:21:25,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:21:25,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:21:25,503 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-10-11 17:21:25,503 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:21:25,503 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2030402825] [2024-10-11 17:21:25,503 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2030402825] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:21:25,504 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:21:25,504 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:21:25,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [728835517] [2024-10-11 17:21:25,504 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:21:25,504 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:21:25,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:21:25,504 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:21:25,504 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:21:25,520 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 125 [2024-10-11 17:21:25,520 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 139 places, 134 transitions, 405 flow. Second operand has 3 states, 3 states have (on average 104.0) internal successors, (312), 3 states have internal predecessors, (312), 0 states have call successors, (0), 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-11 17:21:25,520 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:21:25,521 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 125 [2024-10-11 17:21:25,521 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:21:26,031 INFO L124 PetriNetUnfolderBase]: 1088/4747 cut-off events. [2024-10-11 17:21:26,032 INFO L125 PetriNetUnfolderBase]: For 2578/2820 co-relation queries the response was YES. [2024-10-11 17:21:26,043 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9139 conditions, 4747 events. 1088/4747 cut-off events. For 2578/2820 co-relation queries the response was YES. Maximal size of possible extension queue 226. Compared 49421 event pairs, 589 based on Foata normal form. 7/4392 useless extension candidates. Maximal degree in co-relation 8357. Up to 1450 conditions per place. [2024-10-11 17:21:26,056 INFO L140 encePairwiseOnDemand]: 118/125 looper letters, 31 selfloop transitions, 13 changer transitions 0/150 dead transitions. [2024-10-11 17:21:26,056 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 141 places, 150 transitions, 566 flow [2024-10-11 17:21:26,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:21:26,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:21:26,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 339 transitions. [2024-10-11 17:21:26,058 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.904 [2024-10-11 17:21:26,058 INFO L175 Difference]: Start difference. First operand has 139 places, 134 transitions, 405 flow. Second operand 3 states and 339 transitions. [2024-10-11 17:21:26,058 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 141 places, 150 transitions, 566 flow [2024-10-11 17:21:26,062 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 138 places, 150 transitions, 560 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-10-11 17:21:26,063 INFO L231 Difference]: Finished difference. Result has 140 places, 143 transitions, 517 flow [2024-10-11 17:21:26,064 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=125, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=136, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=134, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=121, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=517, PETRI_PLACES=140, PETRI_TRANSITIONS=143} [2024-10-11 17:21:26,064 INFO L277 CegarLoopForPetriNet]: 126 programPoint places, 14 predicate places. [2024-10-11 17:21:26,064 INFO L471 AbstractCegarLoop]: Abstraction has has 140 places, 143 transitions, 517 flow [2024-10-11 17:21:26,065 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 104.0) internal successors, (312), 3 states have internal predecessors, (312), 0 states have call successors, (0), 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-11 17:21:26,065 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:21:26,065 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:21:26,065 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-10-11 17:21:26,065 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2024-10-11 17:21:26,065 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:21:26,066 INFO L85 PathProgramCache]: Analyzing trace with hash -1392824919, now seen corresponding path program 1 times [2024-10-11 17:21:26,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:21:26,066 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [576005428] [2024-10-11 17:21:26,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:21:26,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:21:26,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:21:26,128 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-10-11 17:21:26,128 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:21:26,128 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [576005428] [2024-10-11 17:21:26,128 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [576005428] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:21:26,128 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:21:26,128 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 17:21:26,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1675538740] [2024-10-11 17:21:26,128 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:21:26,129 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:21:26,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:21:26,129 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:21:26,129 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:21:26,138 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 125 [2024-10-11 17:21:26,138 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 140 places, 143 transitions, 517 flow. Second operand has 3 states, 3 states have (on average 110.66666666666667) internal successors, (332), 3 states have internal predecessors, (332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:21:26,138 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:21:26,139 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 125 [2024-10-11 17:21:26,139 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:21:26,309 INFO L124 PetriNetUnfolderBase]: 124/1629 cut-off events. [2024-10-11 17:21:26,309 INFO L125 PetriNetUnfolderBase]: For 736/839 co-relation queries the response was YES. [2024-10-11 17:21:26,314 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2799 conditions, 1629 events. 124/1629 cut-off events. For 736/839 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 13490 event pairs, 20 based on Foata normal form. 21/1580 useless extension candidates. Maximal degree in co-relation 1118. Up to 142 conditions per place. [2024-10-11 17:21:26,316 INFO L140 encePairwiseOnDemand]: 119/125 looper letters, 12 selfloop transitions, 6 changer transitions 0/138 dead transitions. [2024-10-11 17:21:26,316 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 142 places, 138 transitions, 490 flow [2024-10-11 17:21:26,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:21:26,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:21:26,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 348 transitions. [2024-10-11 17:21:26,318 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.928 [2024-10-11 17:21:26,318 INFO L175 Difference]: Start difference. First operand has 140 places, 143 transitions, 517 flow. Second operand 3 states and 348 transitions. [2024-10-11 17:21:26,318 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 142 places, 138 transitions, 490 flow [2024-10-11 17:21:26,321 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 140 places, 138 transitions, 476 flow, removed 2 selfloop flow, removed 2 redundant places. [2024-10-11 17:21:26,322 INFO L231 Difference]: Finished difference. Result has 140 places, 133 transitions, 421 flow [2024-10-11 17:21:26,323 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=125, PETRI_DIFFERENCE_MINUEND_FLOW=409, PETRI_DIFFERENCE_MINUEND_PLACES=138, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=133, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=127, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=421, PETRI_PLACES=140, PETRI_TRANSITIONS=133} [2024-10-11 17:21:26,323 INFO L277 CegarLoopForPetriNet]: 126 programPoint places, 14 predicate places. [2024-10-11 17:21:26,323 INFO L471 AbstractCegarLoop]: Abstraction has has 140 places, 133 transitions, 421 flow [2024-10-11 17:21:26,324 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 110.66666666666667) internal successors, (332), 3 states have internal predecessors, (332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:21:26,324 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:21:26,325 INFO L204 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:21:26,325 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-10-11 17:21:26,325 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2024-10-11 17:21:26,325 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:21:26,325 INFO L85 PathProgramCache]: Analyzing trace with hash 1765073251, now seen corresponding path program 1 times [2024-10-11 17:21:26,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:21:26,326 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [207989615] [2024-10-11 17:21:26,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:21:26,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:21:26,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:21:26,371 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2024-10-11 17:21:26,371 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:21:26,371 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [207989615] [2024-10-11 17:21:26,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [207989615] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:21:26,372 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:21:26,372 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:21:26,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1756285896] [2024-10-11 17:21:26,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:21:26,372 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:21:26,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:21:26,373 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:21:26,373 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:21:26,389 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 125 [2024-10-11 17:21:26,390 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 140 places, 133 transitions, 421 flow. Second operand has 3 states, 3 states have (on average 104.33333333333333) internal successors, (313), 3 states have internal predecessors, (313), 0 states have call successors, (0), 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-11 17:21:26,390 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:21:26,390 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 125 [2024-10-11 17:21:26,390 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:21:26,593 INFO L124 PetriNetUnfolderBase]: 203/1827 cut-off events. [2024-10-11 17:21:26,593 INFO L125 PetriNetUnfolderBase]: For 1356/1421 co-relation queries the response was YES. [2024-10-11 17:21:26,598 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3538 conditions, 1827 events. 203/1827 cut-off events. For 1356/1421 co-relation queries the response was YES. Maximal size of possible extension queue 91. Compared 15943 event pairs, 134 based on Foata normal form. 3/1739 useless extension candidates. Maximal degree in co-relation 2957. Up to 435 conditions per place. [2024-10-11 17:21:26,601 INFO L140 encePairwiseOnDemand]: 120/125 looper letters, 25 selfloop transitions, 5 changer transitions 0/138 dead transitions. [2024-10-11 17:21:26,601 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 142 places, 138 transitions, 503 flow [2024-10-11 17:21:26,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:21:26,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:21:26,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 332 transitions. [2024-10-11 17:21:26,603 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8853333333333333 [2024-10-11 17:21:26,603 INFO L175 Difference]: Start difference. First operand has 140 places, 133 transitions, 421 flow. Second operand 3 states and 332 transitions. [2024-10-11 17:21:26,603 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 142 places, 138 transitions, 503 flow [2024-10-11 17:21:26,608 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 141 places, 138 transitions, 497 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-11 17:21:26,609 INFO L231 Difference]: Finished difference. Result has 143 places, 136 transitions, 455 flow [2024-10-11 17:21:26,609 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=125, PETRI_DIFFERENCE_MINUEND_FLOW=415, PETRI_DIFFERENCE_MINUEND_PLACES=139, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=133, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=128, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=455, PETRI_PLACES=143, PETRI_TRANSITIONS=136} [2024-10-11 17:21:26,610 INFO L277 CegarLoopForPetriNet]: 126 programPoint places, 17 predicate places. [2024-10-11 17:21:26,610 INFO L471 AbstractCegarLoop]: Abstraction has has 143 places, 136 transitions, 455 flow [2024-10-11 17:21:26,610 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 104.33333333333333) internal successors, (313), 3 states have internal predecessors, (313), 0 states have call successors, (0), 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-11 17:21:26,610 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:21:26,611 INFO L204 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:21:26,611 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-10-11 17:21:26,611 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2024-10-11 17:21:26,612 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:21:26,612 INFO L85 PathProgramCache]: Analyzing trace with hash -1997245556, now seen corresponding path program 1 times [2024-10-11 17:21:26,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:21:26,612 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2146271066] [2024-10-11 17:21:26,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:21:26,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:21:26,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 17:21:26,636 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-11 17:21:26,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 17:21:26,662 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-11 17:21:26,663 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-11 17:21:26,663 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (7 of 8 remaining) [2024-10-11 17:21:26,663 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (6 of 8 remaining) [2024-10-11 17:21:26,663 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (5 of 8 remaining) [2024-10-11 17:21:26,663 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (4 of 8 remaining) [2024-10-11 17:21:26,663 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (3 of 8 remaining) [2024-10-11 17:21:26,663 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (2 of 8 remaining) [2024-10-11 17:21:26,663 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (1 of 8 remaining) [2024-10-11 17:21:26,663 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (0 of 8 remaining) [2024-10-11 17:21:26,664 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-10-11 17:21:26,664 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:21:26,664 WARN L239 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2024-10-11 17:21:26,664 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2024-10-11 17:21:26,685 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2024-10-11 17:21:26,688 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 145 places, 143 transitions, 326 flow [2024-10-11 17:21:26,742 INFO L124 PetriNetUnfolderBase]: 43/562 cut-off events. [2024-10-11 17:21:26,742 INFO L125 PetriNetUnfolderBase]: For 48/48 co-relation queries the response was YES. [2024-10-11 17:21:26,745 INFO L83 FinitePrefix]: Finished finitePrefix Result has 613 conditions, 562 events. 43/562 cut-off events. For 48/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 1997 event pairs, 6 based on Foata normal form. 0/478 useless extension candidates. Maximal degree in co-relation 356. Up to 32 conditions per place. [2024-10-11 17:21:26,745 INFO L82 GeneralOperation]: Start removeDead. Operand has 145 places, 143 transitions, 326 flow [2024-10-11 17:21:26,748 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 145 places, 143 transitions, 326 flow [2024-10-11 17:21:26,749 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 17:21:26,749 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;@1e01b77a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 17:21:26,750 INFO L334 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2024-10-11 17:21:26,752 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-10-11 17:21:26,753 INFO L124 PetriNetUnfolderBase]: 3/50 cut-off events. [2024-10-11 17:21:26,753 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-11 17:21:26,753 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:21:26,753 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:21:26,753 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2024-10-11 17:21:26,753 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:21:26,754 INFO L85 PathProgramCache]: Analyzing trace with hash 310292303, now seen corresponding path program 1 times [2024-10-11 17:21:26,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:21:26,754 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1642937908] [2024-10-11 17:21:26,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:21:26,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:21:26,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:21:26,772 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-11 17:21:26,772 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:21:26,772 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1642937908] [2024-10-11 17:21:26,772 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1642937908] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:21:26,773 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:21:26,773 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:21:26,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [517303580] [2024-10-11 17:21:26,773 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:21:26,773 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:21:26,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:21:26,774 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:21:26,774 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:21:26,791 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 143 [2024-10-11 17:21:26,791 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 145 places, 143 transitions, 326 flow. Second operand has 3 states, 3 states have (on average 117.66666666666667) internal successors, (353), 3 states have internal predecessors, (353), 0 states have call successors, (0), 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-11 17:21:26,792 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:21:26,792 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 143 [2024-10-11 17:21:26,792 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:21:29,274 INFO L124 PetriNetUnfolderBase]: 7859/23223 cut-off events. [2024-10-11 17:21:29,274 INFO L125 PetriNetUnfolderBase]: For 2506/2857 co-relation queries the response was YES. [2024-10-11 17:21:29,380 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35573 conditions, 23223 events. 7859/23223 cut-off events. For 2506/2857 co-relation queries the response was YES. Maximal size of possible extension queue 783. Compared 267152 event pairs, 4292 based on Foata normal form. 903/21908 useless extension candidates. Maximal degree in co-relation 28335. Up to 7653 conditions per place. [2024-10-11 17:21:29,499 INFO L140 encePairwiseOnDemand]: 133/143 looper letters, 30 selfloop transitions, 6 changer transitions 1/153 dead transitions. [2024-10-11 17:21:29,499 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 147 places, 153 transitions, 418 flow [2024-10-11 17:21:29,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:21:29,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:21:29,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 391 transitions. [2024-10-11 17:21:29,502 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9114219114219114 [2024-10-11 17:21:29,502 INFO L175 Difference]: Start difference. First operand has 145 places, 143 transitions, 326 flow. Second operand 3 states and 391 transitions. [2024-10-11 17:21:29,502 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 147 places, 153 transitions, 418 flow [2024-10-11 17:21:29,505 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 147 places, 153 transitions, 418 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-11 17:21:29,506 INFO L231 Difference]: Finished difference. Result has 149 places, 144 transitions, 364 flow [2024-10-11 17:21:29,507 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=143, PETRI_DIFFERENCE_MINUEND_FLOW=320, PETRI_DIFFERENCE_MINUEND_PLACES=145, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=140, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=134, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=364, PETRI_PLACES=149, PETRI_TRANSITIONS=144} [2024-10-11 17:21:29,507 INFO L277 CegarLoopForPetriNet]: 145 programPoint places, 4 predicate places. [2024-10-11 17:21:29,507 INFO L471 AbstractCegarLoop]: Abstraction has has 149 places, 144 transitions, 364 flow [2024-10-11 17:21:29,507 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 117.66666666666667) internal successors, (353), 3 states have internal predecessors, (353), 0 states have call successors, (0), 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-11 17:21:29,508 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:21:29,508 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:21:29,508 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-10-11 17:21:29,508 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2024-10-11 17:21:29,508 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:21:29,508 INFO L85 PathProgramCache]: Analyzing trace with hash -1425725008, now seen corresponding path program 1 times [2024-10-11 17:21:29,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:21:29,509 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [576491107] [2024-10-11 17:21:29,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:21:29,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:21:29,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:21:29,703 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-11 17:21:29,704 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:21:29,704 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [576491107] [2024-10-11 17:21:29,704 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [576491107] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:21:29,704 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:21:29,704 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 17:21:29,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [80981582] [2024-10-11 17:21:29,704 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:21:29,705 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 17:21:29,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:21:29,706 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 17:21:29,706 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-11 17:21:29,869 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 143 [2024-10-11 17:21:29,870 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 149 places, 144 transitions, 364 flow. Second operand has 6 states, 6 states have (on average 107.5) internal successors, (645), 6 states have internal predecessors, (645), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:21:29,870 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:21:29,870 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 143 [2024-10-11 17:21:29,870 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:21:34,500 INFO L124 PetriNetUnfolderBase]: 12676/35344 cut-off events. [2024-10-11 17:21:34,500 INFO L125 PetriNetUnfolderBase]: For 3145/3145 co-relation queries the response was YES. [2024-10-11 17:21:34,626 INFO L83 FinitePrefix]: Finished finitePrefix Result has 57702 conditions, 35344 events. 12676/35344 cut-off events. For 3145/3145 co-relation queries the response was YES. Maximal size of possible extension queue 1436. Compared 432859 event pairs, 5965 based on Foata normal form. 0/31767 useless extension candidates. Maximal degree in co-relation 35470. Up to 13083 conditions per place. [2024-10-11 17:21:34,747 INFO L140 encePairwiseOnDemand]: 137/143 looper letters, 60 selfloop transitions, 5 changer transitions 0/175 dead transitions. [2024-10-11 17:21:34,747 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 152 places, 175 transitions, 556 flow [2024-10-11 17:21:34,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 17:21:34,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-11 17:21:34,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 702 transitions. [2024-10-11 17:21:34,749 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8181818181818182 [2024-10-11 17:21:34,749 INFO L175 Difference]: Start difference. First operand has 149 places, 144 transitions, 364 flow. Second operand 6 states and 702 transitions. [2024-10-11 17:21:34,749 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 152 places, 175 transitions, 556 flow [2024-10-11 17:21:34,802 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 150 places, 175 transitions, 544 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 17:21:34,803 INFO L231 Difference]: Finished difference. Result has 150 places, 143 transitions, 360 flow [2024-10-11 17:21:34,804 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=143, PETRI_DIFFERENCE_MINUEND_FLOW=350, PETRI_DIFFERENCE_MINUEND_PLACES=145, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=143, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=138, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=360, PETRI_PLACES=150, PETRI_TRANSITIONS=143} [2024-10-11 17:21:34,804 INFO L277 CegarLoopForPetriNet]: 145 programPoint places, 5 predicate places. [2024-10-11 17:21:34,804 INFO L471 AbstractCegarLoop]: Abstraction has has 150 places, 143 transitions, 360 flow [2024-10-11 17:21:34,805 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 107.5) internal successors, (645), 6 states have internal predecessors, (645), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:21:34,805 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:21:34,805 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:21:34,805 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-10-11 17:21:34,805 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2024-10-11 17:21:34,805 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:21:34,805 INFO L85 PathProgramCache]: Analyzing trace with hash -34594014, now seen corresponding path program 1 times [2024-10-11 17:21:34,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:21:34,806 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1539848069] [2024-10-11 17:21:34,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:21:34,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:21:34,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:21:34,861 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-11 17:21:34,861 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:21:34,862 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1539848069] [2024-10-11 17:21:34,862 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1539848069] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:21:34,862 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:21:34,862 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 17:21:34,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1379253255] [2024-10-11 17:21:34,862 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:21:34,862 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 17:21:34,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:21:34,863 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 17:21:34,863 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 17:21:34,932 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 143 [2024-10-11 17:21:34,932 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 150 places, 143 transitions, 360 flow. Second operand has 5 states, 5 states have (on average 114.4) internal successors, (572), 5 states have internal predecessors, (572), 0 states have call successors, (0), 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-11 17:21:34,932 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:21:34,933 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 143 [2024-10-11 17:21:34,933 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:21:38,888 INFO L124 PetriNetUnfolderBase]: 8788/32683 cut-off events. [2024-10-11 17:21:38,889 INFO L125 PetriNetUnfolderBase]: For 1398/1398 co-relation queries the response was YES. [2024-10-11 17:21:38,979 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47760 conditions, 32683 events. 8788/32683 cut-off events. For 1398/1398 co-relation queries the response was YES. Maximal size of possible extension queue 874. Compared 418503 event pairs, 5700 based on Foata normal form. 1/28182 useless extension candidates. Maximal degree in co-relation 16955. Up to 9905 conditions per place. [2024-10-11 17:21:39,065 INFO L140 encePairwiseOnDemand]: 135/143 looper letters, 28 selfloop transitions, 2 changer transitions 5/151 dead transitions. [2024-10-11 17:21:39,066 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 155 places, 151 transitions, 446 flow [2024-10-11 17:21:39,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 17:21:39,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-11 17:21:39,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 714 transitions. [2024-10-11 17:21:39,068 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8321678321678322 [2024-10-11 17:21:39,069 INFO L175 Difference]: Start difference. First operand has 150 places, 143 transitions, 360 flow. Second operand 6 states and 714 transitions. [2024-10-11 17:21:39,069 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 155 places, 151 transitions, 446 flow [2024-10-11 17:21:39,071 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 150 places, 151 transitions, 436 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-10-11 17:21:39,072 INFO L231 Difference]: Finished difference. Result has 154 places, 144 transitions, 372 flow [2024-10-11 17:21:39,072 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=143, PETRI_DIFFERENCE_MINUEND_FLOW=350, PETRI_DIFFERENCE_MINUEND_PLACES=145, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=143, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=141, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=372, PETRI_PLACES=154, PETRI_TRANSITIONS=144} [2024-10-11 17:21:39,073 INFO L277 CegarLoopForPetriNet]: 145 programPoint places, 9 predicate places. [2024-10-11 17:21:39,073 INFO L471 AbstractCegarLoop]: Abstraction has has 154 places, 144 transitions, 372 flow [2024-10-11 17:21:39,073 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 114.4) internal successors, (572), 5 states have internal predecessors, (572), 0 states have call successors, (0), 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-11 17:21:39,074 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:21:39,074 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:21:39,074 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-10-11 17:21:39,074 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2024-10-11 17:21:39,078 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:21:39,078 INFO L85 PathProgramCache]: Analyzing trace with hash 257971780, now seen corresponding path program 1 times [2024-10-11 17:21:39,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:21:39,078 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1363426341] [2024-10-11 17:21:39,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:21:39,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:21:39,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:21:39,104 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-11 17:21:39,104 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:21:39,104 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1363426341] [2024-10-11 17:21:39,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1363426341] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:21:39,104 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:21:39,105 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:21:39,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1316111151] [2024-10-11 17:21:39,105 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:21:39,105 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:21:39,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:21:39,109 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:21:39,109 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:21:39,132 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 143 [2024-10-11 17:21:39,132 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 154 places, 144 transitions, 372 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-11 17:21:39,132 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:21:39,133 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 143 [2024-10-11 17:21:39,133 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:21:43,825 INFO L124 PetriNetUnfolderBase]: 13629/40864 cut-off events. [2024-10-11 17:21:43,826 INFO L125 PetriNetUnfolderBase]: For 10648/13092 co-relation queries the response was YES. [2024-10-11 17:21:43,976 INFO L83 FinitePrefix]: Finished finitePrefix Result has 71721 conditions, 40864 events. 13629/40864 cut-off events. For 10648/13092 co-relation queries the response was YES. Maximal size of possible extension queue 1513. Compared 523312 event pairs, 7860 based on Foata normal form. 36/36352 useless extension candidates. Maximal degree in co-relation 71661. Up to 15880 conditions per place. [2024-10-11 17:21:44,136 INFO L140 encePairwiseOnDemand]: 135/143 looper letters, 39 selfloop transitions, 11 changer transitions 0/165 dead transitions. [2024-10-11 17:21:44,137 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 153 places, 165 transitions, 558 flow [2024-10-11 17:21:44,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:21:44,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:21:44,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 389 transitions. [2024-10-11 17:21:44,140 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9067599067599068 [2024-10-11 17:21:44,140 INFO L175 Difference]: Start difference. First operand has 154 places, 144 transitions, 372 flow. Second operand 3 states and 389 transitions. [2024-10-11 17:21:44,140 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 153 places, 165 transitions, 558 flow [2024-10-11 17:21:44,287 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 149 places, 165 transitions, 546 flow, removed 5 selfloop flow, removed 4 redundant places. [2024-10-11 17:21:44,289 INFO L231 Difference]: Finished difference. Result has 151 places, 153 transitions, 456 flow [2024-10-11 17:21:44,289 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=143, PETRI_DIFFERENCE_MINUEND_FLOW=360, PETRI_DIFFERENCE_MINUEND_PLACES=147, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=144, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=133, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=456, PETRI_PLACES=151, PETRI_TRANSITIONS=153} [2024-10-11 17:21:44,291 INFO L277 CegarLoopForPetriNet]: 145 programPoint places, 6 predicate places. [2024-10-11 17:21:44,291 INFO L471 AbstractCegarLoop]: Abstraction has has 151 places, 153 transitions, 456 flow [2024-10-11 17:21:44,291 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has 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-11 17:21:44,291 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:21:44,291 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:21:44,291 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-10-11 17:21:44,292 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2024-10-11 17:21:44,292 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:21:44,292 INFO L85 PathProgramCache]: Analyzing trace with hash -1295200181, now seen corresponding path program 1 times [2024-10-11 17:21:44,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:21:44,292 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [173124391] [2024-10-11 17:21:44,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:21:44,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:21:44,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:21:44,650 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 17:21:44,653 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:21:44,653 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [173124391] [2024-10-11 17:21:44,653 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [173124391] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:21:44,653 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:21:44,653 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 17:21:44,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1157706385] [2024-10-11 17:21:44,654 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:21:44,654 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 17:21:44,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:21:44,655 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 17:21:44,655 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-11 17:21:44,756 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 143 [2024-10-11 17:21:44,757 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 151 places, 153 transitions, 456 flow. Second operand has 6 states, 6 states have (on average 110.16666666666667) internal successors, (661), 6 states have internal predecessors, (661), 0 states have call successors, (0), 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-11 17:21:44,757 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:21:44,757 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 143 [2024-10-11 17:21:44,757 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:21:50,056 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([590] L1023-4-->L1023-5: Formula: (= |v_#race~data~0_4| |v_threadThread3of4ForFork0_#t~nondet5_3|) InVars {threadThread3of4ForFork0_#t~nondet5=|v_threadThread3of4ForFork0_#t~nondet5_3|} OutVars{#race~data~0=|v_#race~data~0_4|, threadThread3of4ForFork0_#t~nondet5=|v_threadThread3of4ForFork0_#t~nondet5_3|} AuxVars[] AssignedVars[#race~data~0][150], [130#L1024true, 170#true, Black: 161#(= |ULTIMATE.start_main_~i~0#1| 0), 145#true, 118#L1038-1true, Black: 172#(= |#race~data~0| |threadThread1of4ForFork0_#t~nondet5|), 57#L1023-5true, 140#true, Black: 150#(= |#race~data~0| 0), 175#true, 45#L1022-3true, 144#true, 142#true]) [2024-10-11 17:21:50,056 INFO L294 olderBase$Statistics]: this new event has 148 ancestors and is cut-off event [2024-10-11 17:21:50,056 INFO L297 olderBase$Statistics]: existing Event has 148 ancestors and is cut-off event [2024-10-11 17:21:50,056 INFO L297 olderBase$Statistics]: existing Event has 106 ancestors and is cut-off event [2024-10-11 17:21:50,056 INFO L297 olderBase$Statistics]: existing Event has 106 ancestors and is cut-off event [2024-10-11 17:21:50,172 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([638] L1023-4-->L1023-5: Formula: (= |v_threadThread4of4ForFork0_#t~nondet5_3| |v_#race~data~0_4|) InVars {threadThread4of4ForFork0_#t~nondet5=|v_threadThread4of4ForFork0_#t~nondet5_3|} OutVars{threadThread4of4ForFork0_#t~nondet5=|v_threadThread4of4ForFork0_#t~nondet5_3|, #race~data~0=|v_#race~data~0_4|} AuxVars[] AssignedVars[#race~data~0][182], [170#true, Black: 161#(= |ULTIMATE.start_main_~i~0#1| 0), 118#L1038-1true, Black: 172#(= |#race~data~0| |threadThread1of4ForFork0_#t~nondet5|), 57#L1023-5true, 146#true, 140#true, 141#true, 175#true, Black: 150#(= |#race~data~0| 0), 98#L1023-6true, 144#true, 23#L1023-5true]) [2024-10-11 17:21:50,173 INFO L294 olderBase$Statistics]: this new event has 152 ancestors and is cut-off event [2024-10-11 17:21:50,173 INFO L297 olderBase$Statistics]: existing Event has 152 ancestors and is cut-off event [2024-10-11 17:21:50,173 INFO L297 olderBase$Statistics]: existing Event has 152 ancestors and is cut-off event [2024-10-11 17:21:50,173 INFO L297 olderBase$Statistics]: existing Event has 152 ancestors and is cut-off event [2024-10-11 17:21:50,229 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([590] L1023-4-->L1023-5: Formula: (= |v_#race~data~0_4| |v_threadThread3of4ForFork0_#t~nondet5_3|) InVars {threadThread3of4ForFork0_#t~nondet5=|v_threadThread3of4ForFork0_#t~nondet5_3|} OutVars{#race~data~0=|v_#race~data~0_4|, threadThread3of4ForFork0_#t~nondet5=|v_threadThread3of4ForFork0_#t~nondet5_3|} AuxVars[] AssignedVars[#race~data~0][150], [170#true, 20#threadErr0ASSERT_VIOLATIONDATA_RACEtrue, Black: 161#(= |ULTIMATE.start_main_~i~0#1| 0), 145#true, 118#L1038-1true, Black: 172#(= |#race~data~0| |threadThread1of4ForFork0_#t~nondet5|), 57#L1023-5true, 112#L1023-5true, 140#true, Black: 150#(= |#race~data~0| 0), 175#true, 144#true, 142#true]) [2024-10-11 17:21:50,229 INFO L294 olderBase$Statistics]: this new event has 152 ancestors and is cut-off event [2024-10-11 17:21:50,229 INFO L297 olderBase$Statistics]: existing Event has 152 ancestors and is cut-off event [2024-10-11 17:21:50,229 INFO L297 olderBase$Statistics]: existing Event has 110 ancestors and is cut-off event [2024-10-11 17:21:50,229 INFO L297 olderBase$Statistics]: existing Event has 110 ancestors and is cut-off event [2024-10-11 17:21:50,655 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([638] L1023-4-->L1023-5: Formula: (= |v_threadThread4of4ForFork0_#t~nondet5_3| |v_#race~data~0_4|) InVars {threadThread4of4ForFork0_#t~nondet5=|v_threadThread4of4ForFork0_#t~nondet5_3|} OutVars{threadThread4of4ForFork0_#t~nondet5=|v_threadThread4of4ForFork0_#t~nondet5_3|, #race~data~0=|v_#race~data~0_4|} AuxVars[] AssignedVars[#race~data~0][177], [130#L1024true, 170#true, Black: 161#(= |ULTIMATE.start_main_~i~0#1| 0), 118#L1038-1true, Black: 172#(= |#race~data~0| |threadThread1of4ForFork0_#t~nondet5|), 57#L1023-5true, 146#true, 140#true, 141#true, Black: 150#(= |#race~data~0| 0), 175#true, 144#true, 23#L1023-5true]) [2024-10-11 17:21:50,656 INFO L294 olderBase$Statistics]: this new event has 154 ancestors and is not cut-off event [2024-10-11 17:21:50,656 INFO L297 olderBase$Statistics]: existing Event has 154 ancestors and is not cut-off event [2024-10-11 17:21:50,656 INFO L297 olderBase$Statistics]: existing Event has 154 ancestors and is not cut-off event [2024-10-11 17:21:50,656 INFO L297 olderBase$Statistics]: existing Event has 154 ancestors and is not cut-off event [2024-10-11 17:21:51,261 INFO L124 PetriNetUnfolderBase]: 19866/57035 cut-off events. [2024-10-11 17:21:51,261 INFO L125 PetriNetUnfolderBase]: For 9377/13250 co-relation queries the response was YES. [2024-10-11 17:21:51,490 INFO L83 FinitePrefix]: Finished finitePrefix Result has 99820 conditions, 57035 events. 19866/57035 cut-off events. For 9377/13250 co-relation queries the response was YES. Maximal size of possible extension queue 1935. Compared 746315 event pairs, 9571 based on Foata normal form. 80/49862 useless extension candidates. Maximal degree in co-relation 78994. Up to 12589 conditions per place. [2024-10-11 17:21:51,692 INFO L140 encePairwiseOnDemand]: 137/143 looper letters, 58 selfloop transitions, 5 changer transitions 0/184 dead transitions. [2024-10-11 17:21:51,693 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 155 places, 184 transitions, 644 flow [2024-10-11 17:21:51,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 17:21:51,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-11 17:21:51,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 712 transitions. [2024-10-11 17:21:51,697 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8298368298368298 [2024-10-11 17:21:51,697 INFO L175 Difference]: Start difference. First operand has 151 places, 153 transitions, 456 flow. Second operand 6 states and 712 transitions. [2024-10-11 17:21:51,697 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 155 places, 184 transitions, 644 flow [2024-10-11 17:21:51,821 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 153 places, 184 transitions, 622 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 17:21:51,823 INFO L231 Difference]: Finished difference. Result has 153 places, 152 transitions, 442 flow [2024-10-11 17:21:51,823 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=143, PETRI_DIFFERENCE_MINUEND_FLOW=432, PETRI_DIFFERENCE_MINUEND_PLACES=148, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=152, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=147, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=442, PETRI_PLACES=153, PETRI_TRANSITIONS=152} [2024-10-11 17:21:51,824 INFO L277 CegarLoopForPetriNet]: 145 programPoint places, 8 predicate places. [2024-10-11 17:21:51,824 INFO L471 AbstractCegarLoop]: Abstraction has has 153 places, 152 transitions, 442 flow [2024-10-11 17:21:51,824 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 110.16666666666667) internal successors, (661), 6 states have internal predecessors, (661), 0 states have call successors, (0), 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-11 17:21:51,824 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:21:51,824 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:21:51,825 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-10-11 17:21:51,825 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2024-10-11 17:21:51,825 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:21:51,825 INFO L85 PathProgramCache]: Analyzing trace with hash 1577931351, now seen corresponding path program 1 times [2024-10-11 17:21:51,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:21:51,825 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [992444594] [2024-10-11 17:21:51,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:21:51,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:21:51,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:21:51,871 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:21:51,871 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:21:51,871 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [992444594] [2024-10-11 17:21:51,871 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [992444594] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 17:21:51,871 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [353913889] [2024-10-11 17:21:51,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:21:51,871 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 17:21:51,872 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 17:21:51,873 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 17:21:51,874 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-11 17:21:51,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:21:51,954 INFO L255 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-11 17:21:51,955 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 17:21:51,996 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:21:51,996 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 17:21:52,031 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:21:52,032 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [353913889] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 17:21:52,032 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 17:21:52,032 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 9 [2024-10-11 17:21:52,032 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1848217738] [2024-10-11 17:21:52,032 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 17:21:52,032 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 17:21:52,033 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:21:52,033 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 17:21:52,033 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-10-11 17:21:52,177 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 143 [2024-10-11 17:21:52,178 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 153 places, 152 transitions, 442 flow. Second operand has 9 states, 9 states have (on average 113.22222222222223) internal successors, (1019), 9 states have internal predecessors, (1019), 0 states have call successors, (0), 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-11 17:21:52,179 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:21:52,179 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 143 [2024-10-11 17:21:52,179 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:21:55,304 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([638] L1023-4-->L1023-5: Formula: (= |v_threadThread4of4ForFork0_#t~nondet5_3| |v_#race~data~0_4|) InVars {threadThread4of4ForFork0_#t~nondet5=|v_threadThread4of4ForFork0_#t~nondet5_3|} OutVars{threadThread4of4ForFork0_#t~nondet5=|v_threadThread4of4ForFork0_#t~nondet5_3|, #race~data~0=|v_#race~data~0_4|} AuxVars[] AssignedVars[#race~data~0][190], [Black: 161#(= |ULTIMATE.start_main_~i~0#1| 0), 118#L1038-1true, Black: 172#(= |#race~data~0| |threadThread1of4ForFork0_#t~nondet5|), 146#true, 57#L1023-5true, 140#true, 185#(<= 1 |ULTIMATE.start_main_~threads_total~0#1|), 141#true, Black: 150#(= |#race~data~0| 0), 175#true, 98#L1023-6true, 144#true, 23#L1023-5true]) [2024-10-11 17:21:55,305 INFO L294 olderBase$Statistics]: this new event has 152 ancestors and is cut-off event [2024-10-11 17:21:55,305 INFO L297 olderBase$Statistics]: existing Event has 152 ancestors and is cut-off event [2024-10-11 17:21:55,305 INFO L297 olderBase$Statistics]: existing Event has 152 ancestors and is cut-off event [2024-10-11 17:21:55,305 INFO L297 olderBase$Statistics]: existing Event has 152 ancestors and is cut-off event [2024-10-11 17:21:56,226 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([638] L1023-4-->L1023-5: Formula: (= |v_threadThread4of4ForFork0_#t~nondet5_3| |v_#race~data~0_4|) InVars {threadThread4of4ForFork0_#t~nondet5=|v_threadThread4of4ForFork0_#t~nondet5_3|} OutVars{threadThread4of4ForFork0_#t~nondet5=|v_threadThread4of4ForFork0_#t~nondet5_3|, #race~data~0=|v_#race~data~0_4|} AuxVars[] AssignedVars[#race~data~0][188], [130#L1024true, Black: 161#(= |ULTIMATE.start_main_~i~0#1| 0), 118#L1038-1true, Black: 172#(= |#race~data~0| |threadThread1of4ForFork0_#t~nondet5|), 146#true, 57#L1023-5true, 140#true, 185#(<= 1 |ULTIMATE.start_main_~threads_total~0#1|), 141#true, Black: 150#(= |#race~data~0| 0), 175#true, 144#true, 23#L1023-5true]) [2024-10-11 17:21:56,227 INFO L294 olderBase$Statistics]: this new event has 154 ancestors and is not cut-off event [2024-10-11 17:21:56,227 INFO L297 olderBase$Statistics]: existing Event has 154 ancestors and is not cut-off event [2024-10-11 17:21:56,227 INFO L297 olderBase$Statistics]: existing Event has 154 ancestors and is not cut-off event [2024-10-11 17:21:56,227 INFO L297 olderBase$Statistics]: existing Event has 154 ancestors and is not cut-off event [2024-10-11 17:21:56,635 INFO L124 PetriNetUnfolderBase]: 11178/36923 cut-off events. [2024-10-11 17:21:56,635 INFO L125 PetriNetUnfolderBase]: For 5999/7801 co-relation queries the response was YES. [2024-10-11 17:21:56,819 INFO L83 FinitePrefix]: Finished finitePrefix Result has 63969 conditions, 36923 events. 11178/36923 cut-off events. For 5999/7801 co-relation queries the response was YES. Maximal size of possible extension queue 1098. Compared 472404 event pairs, 4636 based on Foata normal form. 15/32381 useless extension candidates. Maximal degree in co-relation 32374. Up to 6529 conditions per place. [2024-10-11 17:21:56,976 INFO L140 encePairwiseOnDemand]: 133/143 looper letters, 61 selfloop transitions, 10 changer transitions 0/193 dead transitions. [2024-10-11 17:21:56,976 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 160 places, 193 transitions, 680 flow [2024-10-11 17:21:56,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 17:21:56,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-10-11 17:21:56,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 960 transitions. [2024-10-11 17:21:56,979 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8391608391608392 [2024-10-11 17:21:56,979 INFO L175 Difference]: Start difference. First operand has 153 places, 152 transitions, 442 flow. Second operand 8 states and 960 transitions. [2024-10-11 17:21:56,979 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 160 places, 193 transitions, 680 flow [2024-10-11 17:21:57,003 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 155 places, 193 transitions, 668 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-10-11 17:21:57,005 INFO L231 Difference]: Finished difference. Result has 158 places, 155 transitions, 476 flow [2024-10-11 17:21:57,006 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=143, PETRI_DIFFERENCE_MINUEND_FLOW=432, PETRI_DIFFERENCE_MINUEND_PLACES=148, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=152, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=143, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=476, PETRI_PLACES=158, PETRI_TRANSITIONS=155} [2024-10-11 17:21:57,006 INFO L277 CegarLoopForPetriNet]: 145 programPoint places, 13 predicate places. [2024-10-11 17:21:57,006 INFO L471 AbstractCegarLoop]: Abstraction has has 158 places, 155 transitions, 476 flow [2024-10-11 17:21:57,007 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 113.22222222222223) internal successors, (1019), 9 states have internal predecessors, (1019), 0 states have call successors, (0), 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-11 17:21:57,007 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:21:57,007 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:21:57,024 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-11 17:21:57,214 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 17:21:57,217 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2024-10-11 17:21:57,218 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:21:57,218 INFO L85 PathProgramCache]: Analyzing trace with hash -404304548, now seen corresponding path program 1 times [2024-10-11 17:21:57,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:21:57,218 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2076352944] [2024-10-11 17:21:57,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:21:57,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:21:57,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:21:57,266 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-10-11 17:21:57,266 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:21:57,266 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2076352944] [2024-10-11 17:21:57,266 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2076352944] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:21:57,266 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:21:57,266 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:21:57,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [920366386] [2024-10-11 17:21:57,266 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:21:57,266 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:21:57,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:21:57,267 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:21:57,267 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:21:57,290 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 143 [2024-10-11 17:21:57,291 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 158 places, 155 transitions, 476 flow. Second operand has 3 states, 3 states have (on average 117.0) internal successors, (351), 3 states have internal predecessors, (351), 0 states have call successors, (0), 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-11 17:21:57,291 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:21:57,291 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 143 [2024-10-11 17:21:57,291 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand