./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/pthread-divine/condvar.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/pthread-divine/condvar.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 08550a9d023a2de1ac334a3445fa7327c26092d061f764efe50453540d837a7a --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 21:20:23,555 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 21:20:23,597 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-01-09 21:20:23,604 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 21:20:23,606 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 21:20:23,629 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 21:20:23,630 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 21:20:23,630 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 21:20:23,630 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 21:20:23,630 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 21:20:23,631 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 21:20:23,631 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 21:20:23,631 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 21:20:23,631 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 21:20:23,632 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 21:20:23,632 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 21:20:23,632 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 21:20:23,632 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 21:20:23,632 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 21:20:23,632 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 21:20:23,632 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 21:20:23,632 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 21:20:23,633 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-01-09 21:20:23,633 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-09 21:20:23,633 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 21:20:23,633 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 21:20:23,633 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 21:20:23,633 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 21:20:23,633 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 21:20:23,633 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 21:20:23,633 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 21:20:23,633 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:20:23,633 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 21:20:23,633 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 21:20:23,633 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 21:20:23,634 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:20:23,634 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 21:20:23,634 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 21:20:23,634 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 21:20:23,634 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 21:20:23,634 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 21:20:23,634 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 21:20:23,635 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 21:20:23,635 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 21:20:23,635 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 21:20:23,635 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 21:20:23,635 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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-jdk21/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 -> 08550a9d023a2de1ac334a3445fa7327c26092d061f764efe50453540d837a7a [2025-01-09 21:20:23,875 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 21:20:23,884 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 21:20:23,886 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 21:20:23,887 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 21:20:23,888 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 21:20:23,889 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-divine/condvar.i [2025-01-09 21:20:25,132 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b5a08c155/d8be36c8d4f54c91aec12bd6c4ca2a91/FLAG9b496158b [2025-01-09 21:20:25,546 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 21:20:25,547 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/pthread-divine/condvar.i [2025-01-09 21:20:25,566 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b5a08c155/d8be36c8d4f54c91aec12bd6c4ca2a91/FLAG9b496158b [2025-01-09 21:20:25,717 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b5a08c155/d8be36c8d4f54c91aec12bd6c4ca2a91 [2025-01-09 21:20:25,719 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 21:20:25,721 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 21:20:25,722 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 21:20:25,722 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 21:20:25,725 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 21:20:25,726 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 09:20:25" (1/1) ... [2025-01-09 21:20:25,727 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2140d6ac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:20:25, skipping insertion in model container [2025-01-09 21:20:25,727 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 09:20:25" (1/1) ... [2025-01-09 21:20:25,749 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 21:20:25,948 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 21:20:25,966 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 21:20:26,009 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 21:20:26,039 INFO L204 MainTranslator]: Completed translation [2025-01-09 21:20:26,040 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:20:26 WrapperNode [2025-01-09 21:20:26,041 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 21:20:26,042 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 21:20:26,042 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 21:20:26,042 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 21:20:26,046 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:20:26" (1/1) ... [2025-01-09 21:20:26,055 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:20:26" (1/1) ... [2025-01-09 21:20:26,072 INFO L138 Inliner]: procedures = 168, calls = 24, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 176 [2025-01-09 21:20:26,073 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 21:20:26,073 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 21:20:26,073 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 21:20:26,074 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 21:20:26,078 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:20:26" (1/1) ... [2025-01-09 21:20:26,079 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:20:26" (1/1) ... [2025-01-09 21:20:26,082 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:20:26" (1/1) ... [2025-01-09 21:20:26,085 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:20:26" (1/1) ... [2025-01-09 21:20:26,095 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:20:26" (1/1) ... [2025-01-09 21:20:26,096 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:20:26" (1/1) ... [2025-01-09 21:20:26,102 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:20:26" (1/1) ... [2025-01-09 21:20:26,103 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:20:26" (1/1) ... [2025-01-09 21:20:26,104 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:20:26" (1/1) ... [2025-01-09 21:20:26,108 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 21:20:26,109 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 21:20:26,109 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 21:20:26,109 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 21:20:26,110 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:20:26" (1/1) ... [2025-01-09 21:20:26,118 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:20:26,128 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 21:20:26,141 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 21:20:26,149 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 21:20:26,162 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-01-09 21:20:26,162 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 21:20:26,162 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-01-09 21:20:26,162 INFO L130 BoogieDeclarations]: Found specification of procedure thread [2025-01-09 21:20:26,162 INFO L138 BoogieDeclarations]: Found implementation of procedure thread [2025-01-09 21:20:26,162 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-01-09 21:20:26,162 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 21:20:26,162 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 21:20:26,163 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-01-09 21:20:26,254 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 21:20:26,255 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 21:20:26,455 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-09 21:20:26,456 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 21:20:26,477 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 21:20:26,477 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 21:20:26,478 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:20:26 BoogieIcfgContainer [2025-01-09 21:20:26,478 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 21:20:26,480 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 21:20:26,480 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 21:20:26,489 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 21:20:26,490 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 09:20:25" (1/3) ... [2025-01-09 21:20:26,490 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@383a722f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 09:20:26, skipping insertion in model container [2025-01-09 21:20:26,490 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:20:26" (2/3) ... [2025-01-09 21:20:26,491 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@383a722f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 09:20:26, skipping insertion in model container [2025-01-09 21:20:26,491 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:20:26" (3/3) ... [2025-01-09 21:20:26,492 INFO L128 eAbstractionObserver]: Analyzing ICFG condvar.i [2025-01-09 21:20:26,504 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 21:20:26,505 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG condvar.i that has 2 procedures, 182 locations, 1 initial locations, 2 loop locations, and 4 error locations. [2025-01-09 21:20:26,506 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-09 21:20:26,545 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2025-01-09 21:20:26,577 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 185 places, 186 transitions, 379 flow [2025-01-09 21:20:26,628 INFO L124 PetriNetUnfolderBase]: 5/185 cut-off events. [2025-01-09 21:20:26,630 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-01-09 21:20:26,633 INFO L83 FinitePrefix]: Finished finitePrefix Result has 190 conditions, 185 events. 5/185 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 126 event pairs, 0 based on Foata normal form. 0/176 useless extension candidates. Maximal degree in co-relation 45. Up to 2 conditions per place. [2025-01-09 21:20:26,633 INFO L82 GeneralOperation]: Start removeDead. Operand has 185 places, 186 transitions, 379 flow [2025-01-09 21:20:26,637 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 180 places, 181 transitions, 365 flow [2025-01-09 21:20:26,642 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 21:20:26,650 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;@44295bac, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 21:20:26,650 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2025-01-09 21:20:26,674 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-09 21:20:26,674 INFO L124 PetriNetUnfolderBase]: 0/149 cut-off events. [2025-01-09 21:20:26,675 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 21:20:26,675 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:20:26,675 INFO L206 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:20:26,676 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-01-09 21:20:26,680 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:20:26,680 INFO L85 PathProgramCache]: Analyzing trace with hash 1658888780, now seen corresponding path program 1 times [2025-01-09 21:20:26,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:20:26,686 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [506386721] [2025-01-09 21:20:26,686 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:20:26,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:20:26,788 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes. [2025-01-09 21:20:26,835 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements. [2025-01-09 21:20:26,836 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:20:26,836 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:20:27,041 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:20:27,041 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:20:27,042 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [506386721] [2025-01-09 21:20:27,043 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [506386721] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:20:27,043 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:20:27,043 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:20:27,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1051032304] [2025-01-09 21:20:27,045 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:20:27,049 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:20:27,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:20:27,073 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:20:27,074 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:20:27,089 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 173 out of 186 [2025-01-09 21:20:27,091 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 180 places, 181 transitions, 365 flow. Second operand has 3 states, 3 states have (on average 174.33333333333334) internal successors, (523), 3 states have internal predecessors, (523), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:20:27,093 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:20:27,094 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 173 of 186 [2025-01-09 21:20:27,094 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:20:27,176 INFO L124 PetriNetUnfolderBase]: 9/220 cut-off events. [2025-01-09 21:20:27,178 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-01-09 21:20:27,180 INFO L83 FinitePrefix]: Finished finitePrefix Result has 252 conditions, 220 events. 9/220 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 300 event pairs, 1 based on Foata normal form. 6/209 useless extension candidates. Maximal degree in co-relation 110. Up to 15 conditions per place. [2025-01-09 21:20:27,181 INFO L140 encePairwiseOnDemand]: 179/186 looper letters, 12 selfloop transitions, 3 changer transitions 0/183 dead transitions. [2025-01-09 21:20:27,182 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 181 places, 183 transitions, 399 flow [2025-01-09 21:20:27,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:20:27,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:20:27,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 541 transitions. [2025-01-09 21:20:27,195 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9695340501792115 [2025-01-09 21:20:27,196 INFO L175 Difference]: Start difference. First operand has 180 places, 181 transitions, 365 flow. Second operand 3 states and 541 transitions. [2025-01-09 21:20:27,198 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 181 places, 183 transitions, 399 flow [2025-01-09 21:20:27,201 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 180 places, 183 transitions, 398 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:20:27,207 INFO L231 Difference]: Finished difference. Result has 182 places, 180 transitions, 382 flow [2025-01-09 21:20:27,210 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=186, PETRI_DIFFERENCE_MINUEND_FLOW=356, PETRI_DIFFERENCE_MINUEND_PLACES=178, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=177, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=174, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=382, PETRI_PLACES=182, PETRI_TRANSITIONS=180} [2025-01-09 21:20:27,214 INFO L279 CegarLoopForPetriNet]: 180 programPoint places, 2 predicate places. [2025-01-09 21:20:27,214 INFO L471 AbstractCegarLoop]: Abstraction has has 182 places, 180 transitions, 382 flow [2025-01-09 21:20:27,214 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 174.33333333333334) internal successors, (523), 3 states have internal predecessors, (523), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:20:27,214 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:20:27,215 INFO L206 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:20:27,216 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 21:20:27,216 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting threadErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-01-09 21:20:27,217 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:20:27,218 INFO L85 PathProgramCache]: Analyzing trace with hash 2062383866, now seen corresponding path program 1 times [2025-01-09 21:20:27,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:20:27,218 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [517520122] [2025-01-09 21:20:27,218 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:20:27,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:20:27,248 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-01-09 21:20:27,259 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-01-09 21:20:27,259 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:20:27,259 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:20:27,340 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:20:27,340 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:20:27,340 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [517520122] [2025-01-09 21:20:27,340 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [517520122] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:20:27,340 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:20:27,340 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:20:27,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1789109023] [2025-01-09 21:20:27,341 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:20:27,341 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:20:27,346 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:20:27,346 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:20:27,346 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:20:27,357 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 173 out of 186 [2025-01-09 21:20:27,358 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 182 places, 180 transitions, 382 flow. Second operand has 3 states, 3 states have (on average 174.33333333333334) internal successors, (523), 3 states have internal predecessors, (523), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:20:27,358 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:20:27,358 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 173 of 186 [2025-01-09 21:20:27,359 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:20:27,413 INFO L124 PetriNetUnfolderBase]: 15/284 cut-off events. [2025-01-09 21:20:27,413 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2025-01-09 21:20:27,414 INFO L83 FinitePrefix]: Finished finitePrefix Result has 350 conditions, 284 events. 15/284 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 620 event pairs, 3 based on Foata normal form. 0/260 useless extension candidates. Maximal degree in co-relation 207. Up to 23 conditions per place. [2025-01-09 21:20:27,415 INFO L140 encePairwiseOnDemand]: 182/186 looper letters, 9 selfloop transitions, 3 changer transitions 0/183 dead transitions. [2025-01-09 21:20:27,415 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 184 places, 183 transitions, 412 flow [2025-01-09 21:20:27,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:20:27,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:20:27,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 532 transitions. [2025-01-09 21:20:27,417 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.953405017921147 [2025-01-09 21:20:27,417 INFO L175 Difference]: Start difference. First operand has 182 places, 180 transitions, 382 flow. Second operand 3 states and 532 transitions. [2025-01-09 21:20:27,417 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 184 places, 183 transitions, 412 flow [2025-01-09 21:20:27,418 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 182 places, 183 transitions, 406 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:20:27,420 INFO L231 Difference]: Finished difference. Result has 184 places, 182 transitions, 398 flow [2025-01-09 21:20:27,421 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=186, PETRI_DIFFERENCE_MINUEND_FLOW=376, PETRI_DIFFERENCE_MINUEND_PLACES=180, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=180, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=177, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=398, PETRI_PLACES=184, PETRI_TRANSITIONS=182} [2025-01-09 21:20:27,421 INFO L279 CegarLoopForPetriNet]: 180 programPoint places, 4 predicate places. [2025-01-09 21:20:27,421 INFO L471 AbstractCegarLoop]: Abstraction has has 184 places, 182 transitions, 398 flow [2025-01-09 21:20:27,422 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 174.33333333333334) internal successors, (523), 3 states have internal predecessors, (523), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:20:27,422 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:20:27,422 INFO L206 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:20:27,422 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 21:20:27,422 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-01-09 21:20:27,423 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:20:27,423 INFO L85 PathProgramCache]: Analyzing trace with hash 1571972618, now seen corresponding path program 1 times [2025-01-09 21:20:27,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:20:27,423 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [3288627] [2025-01-09 21:20:27,423 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:20:27,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:20:27,441 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-01-09 21:20:27,450 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-01-09 21:20:27,451 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:20:27,451 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:20:27,526 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:20:27,527 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:20:27,527 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [3288627] [2025-01-09 21:20:27,527 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [3288627] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:20:27,527 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:20:27,527 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:20:27,528 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [760554235] [2025-01-09 21:20:27,528 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:20:27,528 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:20:27,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:20:27,529 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:20:27,529 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:20:27,540 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 170 out of 186 [2025-01-09 21:20:27,541 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 184 places, 182 transitions, 398 flow. Second operand has 3 states, 3 states have (on average 171.66666666666666) internal successors, (515), 3 states have internal predecessors, (515), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:20:27,541 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:20:27,541 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 170 of 186 [2025-01-09 21:20:27,542 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:20:27,605 INFO L124 PetriNetUnfolderBase]: 41/436 cut-off events. [2025-01-09 21:20:27,606 INFO L125 PetriNetUnfolderBase]: For 28/31 co-relation queries the response was YES. [2025-01-09 21:20:27,607 INFO L83 FinitePrefix]: Finished finitePrefix Result has 589 conditions, 436 events. 41/436 cut-off events. For 28/31 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1788 event pairs, 8 based on Foata normal form. 0/390 useless extension candidates. Maximal degree in co-relation 444. Up to 44 conditions per place. [2025-01-09 21:20:27,608 INFO L140 encePairwiseOnDemand]: 181/186 looper letters, 14 selfloop transitions, 5 changer transitions 0/189 dead transitions. [2025-01-09 21:20:27,608 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 186 places, 189 transitions, 454 flow [2025-01-09 21:20:27,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:20:27,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:20:27,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 529 transitions. [2025-01-09 21:20:27,610 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9480286738351255 [2025-01-09 21:20:27,610 INFO L175 Difference]: Start difference. First operand has 184 places, 182 transitions, 398 flow. Second operand 3 states and 529 transitions. [2025-01-09 21:20:27,610 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 186 places, 189 transitions, 454 flow [2025-01-09 21:20:27,611 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 184 places, 189 transitions, 446 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:20:27,613 INFO L231 Difference]: Finished difference. Result has 186 places, 185 transitions, 428 flow [2025-01-09 21:20:27,614 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=186, PETRI_DIFFERENCE_MINUEND_FLOW=392, PETRI_DIFFERENCE_MINUEND_PLACES=182, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=182, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=177, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=428, PETRI_PLACES=186, PETRI_TRANSITIONS=185} [2025-01-09 21:20:27,614 INFO L279 CegarLoopForPetriNet]: 180 programPoint places, 6 predicate places. [2025-01-09 21:20:27,614 INFO L471 AbstractCegarLoop]: Abstraction has has 186 places, 185 transitions, 428 flow [2025-01-09 21:20:27,615 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 171.66666666666666) internal successors, (515), 3 states have internal predecessors, (515), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:20:27,615 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:20:27,615 INFO L206 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:20:27,615 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 21:20:27,615 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-01-09 21:20:27,616 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:20:27,616 INFO L85 PathProgramCache]: Analyzing trace with hash 1532154041, now seen corresponding path program 1 times [2025-01-09 21:20:27,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:20:27,616 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [620236030] [2025-01-09 21:20:27,616 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:20:27,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:20:27,632 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-01-09 21:20:27,639 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-01-09 21:20:27,639 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:20:27,640 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:20:27,693 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:20:27,694 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:20:27,694 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [620236030] [2025-01-09 21:20:27,694 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [620236030] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:20:27,694 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:20:27,694 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 21:20:27,694 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1148396904] [2025-01-09 21:20:27,694 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:20:27,695 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:20:27,695 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:20:27,695 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:20:27,695 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:20:27,704 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 171 out of 186 [2025-01-09 21:20:27,705 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 186 places, 185 transitions, 428 flow. Second operand has 3 states, 3 states have (on average 172.66666666666666) internal successors, (518), 3 states have internal predecessors, (518), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:20:27,705 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:20:27,705 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 171 of 186 [2025-01-09 21:20:27,705 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:20:27,776 INFO L124 PetriNetUnfolderBase]: 58/501 cut-off events. [2025-01-09 21:20:27,776 INFO L125 PetriNetUnfolderBase]: For 43/52 co-relation queries the response was YES. [2025-01-09 21:20:27,777 INFO L83 FinitePrefix]: Finished finitePrefix Result has 754 conditions, 501 events. 58/501 cut-off events. For 43/52 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 2311 event pairs, 6 based on Foata normal form. 5/459 useless extension candidates. Maximal degree in co-relation 608. Up to 76 conditions per place. [2025-01-09 21:20:27,779 INFO L140 encePairwiseOnDemand]: 183/186 looper letters, 13 selfloop transitions, 2 changer transitions 0/190 dead transitions. [2025-01-09 21:20:27,779 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 188 places, 190 transitions, 468 flow [2025-01-09 21:20:27,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:20:27,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:20:27,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 529 transitions. [2025-01-09 21:20:27,780 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9480286738351255 [2025-01-09 21:20:27,780 INFO L175 Difference]: Start difference. First operand has 186 places, 185 transitions, 428 flow. Second operand 3 states and 529 transitions. [2025-01-09 21:20:27,780 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 188 places, 190 transitions, 468 flow [2025-01-09 21:20:27,782 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 186 places, 190 transitions, 458 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:20:27,784 INFO L231 Difference]: Finished difference. Result has 187 places, 186 transitions, 430 flow [2025-01-09 21:20:27,784 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=186, PETRI_DIFFERENCE_MINUEND_FLOW=418, PETRI_DIFFERENCE_MINUEND_PLACES=184, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=185, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=183, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=430, PETRI_PLACES=187, PETRI_TRANSITIONS=186} [2025-01-09 21:20:27,785 INFO L279 CegarLoopForPetriNet]: 180 programPoint places, 7 predicate places. [2025-01-09 21:20:27,785 INFO L471 AbstractCegarLoop]: Abstraction has has 187 places, 186 transitions, 430 flow [2025-01-09 21:20:27,785 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 172.66666666666666) internal successors, (518), 3 states have internal predecessors, (518), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:20:27,785 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:20:27,785 INFO L206 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:20:27,786 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 21:20:27,786 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting threadErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-01-09 21:20:27,786 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:20:27,787 INFO L85 PathProgramCache]: Analyzing trace with hash -1022841890, now seen corresponding path program 1 times [2025-01-09 21:20:27,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:20:27,787 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [352661007] [2025-01-09 21:20:27,787 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:20:27,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:20:27,808 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-01-09 21:20:27,837 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-01-09 21:20:27,837 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:20:27,837 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:20:27,958 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:20:27,959 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:20:27,959 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [352661007] [2025-01-09 21:20:27,959 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [352661007] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:20:27,959 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:20:27,959 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 21:20:27,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1611483741] [2025-01-09 21:20:27,959 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:20:27,959 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:20:27,960 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:20:27,960 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:20:27,960 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:20:27,966 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 174 out of 186 [2025-01-09 21:20:27,967 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 187 places, 186 transitions, 430 flow. Second operand has 3 states, 3 states have (on average 175.33333333333334) internal successors, (526), 3 states have internal predecessors, (526), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:20:27,967 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:20:27,967 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 174 of 186 [2025-01-09 21:20:27,967 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:20:28,003 INFO L124 PetriNetUnfolderBase]: 8/231 cut-off events. [2025-01-09 21:20:28,003 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-01-09 21:20:28,003 INFO L83 FinitePrefix]: Finished finitePrefix Result has 292 conditions, 231 events. 8/231 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 303 event pairs, 0 based on Foata normal form. 1/219 useless extension candidates. Maximal degree in co-relation 185. Up to 14 conditions per place. [2025-01-09 21:20:28,004 INFO L140 encePairwiseOnDemand]: 183/186 looper letters, 9 selfloop transitions, 2 changer transitions 0/183 dead transitions. [2025-01-09 21:20:28,004 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 187 places, 183 transitions, 430 flow [2025-01-09 21:20:28,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:20:28,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:20:28,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 534 transitions. [2025-01-09 21:20:28,006 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.956989247311828 [2025-01-09 21:20:28,006 INFO L175 Difference]: Start difference. First operand has 187 places, 186 transitions, 430 flow. Second operand 3 states and 534 transitions. [2025-01-09 21:20:28,006 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 187 places, 183 transitions, 430 flow [2025-01-09 21:20:28,008 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 184 places, 183 transitions, 420 flow, removed 3 selfloop flow, removed 3 redundant places. [2025-01-09 21:20:28,010 INFO L231 Difference]: Finished difference. Result has 185 places, 180 transitions, 400 flow [2025-01-09 21:20:28,010 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=186, PETRI_DIFFERENCE_MINUEND_FLOW=392, PETRI_DIFFERENCE_MINUEND_PLACES=182, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=180, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=178, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=400, PETRI_PLACES=185, PETRI_TRANSITIONS=180} [2025-01-09 21:20:28,010 INFO L279 CegarLoopForPetriNet]: 180 programPoint places, 5 predicate places. [2025-01-09 21:20:28,011 INFO L471 AbstractCegarLoop]: Abstraction has has 185 places, 180 transitions, 400 flow [2025-01-09 21:20:28,011 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 175.33333333333334) internal successors, (526), 3 states have internal predecessors, (526), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:20:28,011 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:20:28,011 INFO L206 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:20:28,012 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 21:20:28,012 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-01-09 21:20:28,013 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:20:28,013 INFO L85 PathProgramCache]: Analyzing trace with hash 898090249, now seen corresponding path program 1 times [2025-01-09 21:20:28,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:20:28,013 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1133657729] [2025-01-09 21:20:28,013 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:20:28,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:20:28,034 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-01-09 21:20:28,042 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-01-09 21:20:28,043 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:20:28,043 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:20:28,167 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:20:28,167 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:20:28,167 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1133657729] [2025-01-09 21:20:28,167 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1133657729] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 21:20:28,168 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1147400753] [2025-01-09 21:20:28,168 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:20:28,168 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 21:20:28,168 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 21:20:28,174 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 21:20:28,175 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-09 21:20:28,280 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-01-09 21:20:28,326 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-01-09 21:20:28,327 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:20:28,327 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:20:28,330 INFO L256 TraceCheckSpWp]: Trace formula consists of 312 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-09 21:20:28,337 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 21:20:28,369 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 21:20:28,370 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 21:20:28,370 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1147400753] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:20:28,370 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 21:20:28,370 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2025-01-09 21:20:28,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [297935021] [2025-01-09 21:20:28,370 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:20:28,370 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:20:28,370 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:20:28,371 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:20:28,371 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 21:20:28,389 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 169 out of 186 [2025-01-09 21:20:28,390 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 185 places, 180 transitions, 400 flow. Second operand has 3 states, 3 states have (on average 170.66666666666666) internal successors, (512), 3 states have internal predecessors, (512), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:20:28,390 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:20:28,390 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 169 of 186 [2025-01-09 21:20:28,390 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:20:28,465 INFO L124 PetriNetUnfolderBase]: 50/337 cut-off events. [2025-01-09 21:20:28,466 INFO L125 PetriNetUnfolderBase]: For 13/13 co-relation queries the response was YES. [2025-01-09 21:20:28,466 INFO L83 FinitePrefix]: Finished finitePrefix Result has 505 conditions, 337 events. 50/337 cut-off events. For 13/13 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 915 event pairs, 15 based on Foata normal form. 0/316 useless extension candidates. Maximal degree in co-relation 357. Up to 70 conditions per place. [2025-01-09 21:20:28,467 INFO L140 encePairwiseOnDemand]: 181/186 looper letters, 14 selfloop transitions, 5 changer transitions 3/188 dead transitions. [2025-01-09 21:20:28,468 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 187 places, 188 transitions, 464 flow [2025-01-09 21:20:28,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:20:28,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:20:28,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 527 transitions. [2025-01-09 21:20:28,469 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9444444444444444 [2025-01-09 21:20:28,469 INFO L175 Difference]: Start difference. First operand has 185 places, 180 transitions, 400 flow. Second operand 3 states and 527 transitions. [2025-01-09 21:20:28,469 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 187 places, 188 transitions, 464 flow [2025-01-09 21:20:28,470 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 185 places, 188 transitions, 460 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:20:28,472 INFO L231 Difference]: Finished difference. Result has 187 places, 182 transitions, 432 flow [2025-01-09 21:20:28,472 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=186, PETRI_DIFFERENCE_MINUEND_FLOW=396, PETRI_DIFFERENCE_MINUEND_PLACES=183, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=180, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=175, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=432, PETRI_PLACES=187, PETRI_TRANSITIONS=182} [2025-01-09 21:20:28,475 INFO L279 CegarLoopForPetriNet]: 180 programPoint places, 7 predicate places. [2025-01-09 21:20:28,475 INFO L471 AbstractCegarLoop]: Abstraction has has 187 places, 182 transitions, 432 flow [2025-01-09 21:20:28,475 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 170.66666666666666) internal successors, (512), 3 states have internal predecessors, (512), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:20:28,476 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:20:28,476 INFO L206 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:20:28,482 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-09 21:20:28,676 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 21:20:28,677 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-01-09 21:20:28,678 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:20:28,678 INFO L85 PathProgramCache]: Analyzing trace with hash 643506795, now seen corresponding path program 1 times [2025-01-09 21:20:28,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:20:28,678 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [50301179] [2025-01-09 21:20:28,678 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:20:28,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:20:28,699 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 157 statements into 1 equivalence classes. [2025-01-09 21:20:28,707 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 157 of 157 statements. [2025-01-09 21:20:28,707 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:20:28,707 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:20:28,805 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:20:28,805 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:20:28,805 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [50301179] [2025-01-09 21:20:28,805 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [50301179] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 21:20:28,805 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [545701428] [2025-01-09 21:20:28,805 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:20:28,805 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 21:20:28,806 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 21:20:28,807 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 21:20:28,809 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-09 21:20:28,896 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 157 statements into 1 equivalence classes. [2025-01-09 21:20:28,936 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 157 of 157 statements. [2025-01-09 21:20:28,936 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:20:28,936 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:20:28,938 INFO L256 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-09 21:20:28,941 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 21:20:29,003 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:20:29,004 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 21:20:29,050 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:20:29,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [545701428] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 21:20:29,051 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 21:20:29,051 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2025-01-09 21:20:29,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2054311947] [2025-01-09 21:20:29,051 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 21:20:29,051 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 21:20:29,052 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:20:29,052 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 21:20:29,052 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-01-09 21:20:29,082 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 168 out of 186 [2025-01-09 21:20:29,084 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 187 places, 182 transitions, 432 flow. Second operand has 10 states, 10 states have (on average 170.0) internal successors, (1700), 10 states have internal predecessors, (1700), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:20:29,084 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:20:29,084 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 168 of 186 [2025-01-09 21:20:29,084 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:20:29,259 INFO L124 PetriNetUnfolderBase]: 72/434 cut-off events. [2025-01-09 21:20:29,259 INFO L125 PetriNetUnfolderBase]: For 47/50 co-relation queries the response was YES. [2025-01-09 21:20:29,260 INFO L83 FinitePrefix]: Finished finitePrefix Result has 728 conditions, 434 events. 72/434 cut-off events. For 47/50 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1199 event pairs, 9 based on Foata normal form. 8/427 useless extension candidates. Maximal degree in co-relation 580. Up to 47 conditions per place. [2025-01-09 21:20:29,262 INFO L140 encePairwiseOnDemand]: 180/186 looper letters, 34 selfloop transitions, 9 changer transitions 0/211 dead transitions. [2025-01-09 21:20:29,262 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 195 places, 211 transitions, 578 flow [2025-01-09 21:20:29,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 21:20:29,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-01-09 21:20:29,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1557 transitions. [2025-01-09 21:20:29,266 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9301075268817204 [2025-01-09 21:20:29,266 INFO L175 Difference]: Start difference. First operand has 187 places, 182 transitions, 432 flow. Second operand 9 states and 1557 transitions. [2025-01-09 21:20:29,266 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 195 places, 211 transitions, 578 flow [2025-01-09 21:20:29,271 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 193 places, 211 transitions, 568 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:20:29,273 INFO L231 Difference]: Finished difference. Result has 196 places, 188 transitions, 472 flow [2025-01-09 21:20:29,274 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=186, PETRI_DIFFERENCE_MINUEND_FLOW=422, PETRI_DIFFERENCE_MINUEND_PLACES=185, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=182, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=176, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=472, PETRI_PLACES=196, PETRI_TRANSITIONS=188} [2025-01-09 21:20:29,274 INFO L279 CegarLoopForPetriNet]: 180 programPoint places, 16 predicate places. [2025-01-09 21:20:29,275 INFO L471 AbstractCegarLoop]: Abstraction has has 196 places, 188 transitions, 472 flow [2025-01-09 21:20:29,276 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 170.0) internal successors, (1700), 10 states have internal predecessors, (1700), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:20:29,276 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:20:29,276 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:20:29,283 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-01-09 21:20:29,481 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 21:20:29,482 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-01-09 21:20:29,482 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:20:29,483 INFO L85 PathProgramCache]: Analyzing trace with hash 1250171135, now seen corresponding path program 2 times [2025-01-09 21:20:29,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:20:29,483 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1634328048] [2025-01-09 21:20:29,483 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 21:20:29,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:20:29,524 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 173 statements into 2 equivalence classes. [2025-01-09 21:20:29,537 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 173 of 173 statements. [2025-01-09 21:20:29,539 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 21:20:29,539 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:20:29,689 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:20:29,689 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:20:29,689 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1634328048] [2025-01-09 21:20:29,689 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1634328048] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 21:20:29,689 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1394531130] [2025-01-09 21:20:29,689 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 21:20:29,689 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 21:20:29,689 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 21:20:29,693 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 21:20:29,695 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-01-09 21:20:29,780 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 173 statements into 2 equivalence classes. [2025-01-09 21:20:29,829 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 173 of 173 statements. [2025-01-09 21:20:29,829 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 21:20:29,829 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:20:29,831 INFO L256 TraceCheckSpWp]: Trace formula consists of 353 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-01-09 21:20:29,834 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 21:20:29,902 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:20:29,903 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 21:20:29,999 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:20:29,999 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1394531130] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 21:20:29,999 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 21:20:29,999 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 18 [2025-01-09 21:20:29,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1111236102] [2025-01-09 21:20:29,999 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 21:20:30,003 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-01-09 21:20:30,004 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:20:30,004 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-01-09 21:20:30,004 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2025-01-09 21:20:30,032 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 168 out of 186 [2025-01-09 21:20:30,034 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 196 places, 188 transitions, 472 flow. Second operand has 18 states, 18 states have (on average 170.05555555555554) internal successors, (3061), 18 states have internal predecessors, (3061), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:20:30,034 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:20:30,035 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 168 of 186 [2025-01-09 21:20:30,035 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:20:30,326 INFO L124 PetriNetUnfolderBase]: 109/597 cut-off events. [2025-01-09 21:20:30,326 INFO L125 PetriNetUnfolderBase]: For 144/147 co-relation queries the response was YES. [2025-01-09 21:20:30,328 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1196 conditions, 597 events. 109/597 cut-off events. For 144/147 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1853 event pairs, 12 based on Foata normal form. 16/599 useless extension candidates. Maximal degree in co-relation 1046. Up to 47 conditions per place. [2025-01-09 21:20:30,329 INFO L140 encePairwiseOnDemand]: 180/186 looper letters, 74 selfloop transitions, 21 changer transitions 0/263 dead transitions. [2025-01-09 21:20:30,330 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 216 places, 263 transitions, 872 flow [2025-01-09 21:20:30,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-01-09 21:20:30,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2025-01-09 21:20:30,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 3627 transitions. [2025-01-09 21:20:30,336 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9285714285714286 [2025-01-09 21:20:30,336 INFO L175 Difference]: Start difference. First operand has 196 places, 188 transitions, 472 flow. Second operand 21 states and 3627 transitions. [2025-01-09 21:20:30,336 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 216 places, 263 transitions, 872 flow [2025-01-09 21:20:30,340 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 215 places, 263 transitions, 858 flow, removed 6 selfloop flow, removed 1 redundant places. [2025-01-09 21:20:30,342 INFO L231 Difference]: Finished difference. Result has 220 places, 201 transitions, 596 flow [2025-01-09 21:20:30,343 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=186, PETRI_DIFFERENCE_MINUEND_FLOW=466, PETRI_DIFFERENCE_MINUEND_PLACES=195, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=188, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=177, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=596, PETRI_PLACES=220, PETRI_TRANSITIONS=201} [2025-01-09 21:20:30,343 INFO L279 CegarLoopForPetriNet]: 180 programPoint places, 40 predicate places. [2025-01-09 21:20:30,344 INFO L471 AbstractCegarLoop]: Abstraction has has 220 places, 201 transitions, 596 flow [2025-01-09 21:20:30,346 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 170.05555555555554) internal successors, (3061), 18 states have internal predecessors, (3061), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:20:30,346 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:20:30,346 INFO L206 CegarLoopForPetriNet]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:20:30,353 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-01-09 21:20:30,546 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 21:20:30,547 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-01-09 21:20:30,548 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:20:30,548 INFO L85 PathProgramCache]: Analyzing trace with hash -925664987, now seen corresponding path program 3 times [2025-01-09 21:20:30,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:20:30,548 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [320589186] [2025-01-09 21:20:30,548 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-09 21:20:30,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:20:30,566 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 205 statements into 7 equivalence classes. [2025-01-09 21:20:30,600 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) and asserted 205 of 205 statements. [2025-01-09 21:20:30,601 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2025-01-09 21:20:30,601 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:20:30,965 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 0 proven. 168 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:20:30,965 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:20:30,966 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [320589186] [2025-01-09 21:20:30,966 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [320589186] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 21:20:30,966 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [489668305] [2025-01-09 21:20:30,966 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-09 21:20:30,966 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 21:20:30,966 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 21:20:30,968 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 21:20:30,969 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-01-09 21:20:31,051 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 205 statements into 7 equivalence classes. [2025-01-09 21:20:31,154 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) and asserted 205 of 205 statements. [2025-01-09 21:20:31,154 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2025-01-09 21:20:31,154 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:20:31,156 INFO L256 TraceCheckSpWp]: Trace formula consists of 405 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-01-09 21:20:31,158 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 21:20:31,248 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 0 proven. 168 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:20:31,248 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 21:20:31,551 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 0 proven. 168 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:20:31,551 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [489668305] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 21:20:31,551 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 21:20:31,551 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 34 [2025-01-09 21:20:31,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [727485933] [2025-01-09 21:20:31,552 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 21:20:31,554 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2025-01-09 21:20:31,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:20:31,555 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2025-01-09 21:20:31,556 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=306, Invalid=816, Unknown=0, NotChecked=0, Total=1122 [2025-01-09 21:20:31,616 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 168 out of 186 [2025-01-09 21:20:31,621 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 220 places, 201 transitions, 596 flow. Second operand has 34 states, 34 states have (on average 170.02941176470588) internal successors, (5781), 34 states have internal predecessors, (5781), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:20:31,621 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:20:31,621 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 168 of 186 [2025-01-09 21:20:31,621 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:20:32,857 INFO L124 PetriNetUnfolderBase]: 264/1010 cut-off events. [2025-01-09 21:20:32,857 INFO L125 PetriNetUnfolderBase]: For 1079/1082 co-relation queries the response was YES. [2025-01-09 21:20:32,864 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2469 conditions, 1010 events. 264/1010 cut-off events. For 1079/1082 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 3201 event pairs, 9 based on Foata normal form. 32/1027 useless extension candidates. Maximal degree in co-relation 2314. Up to 127 conditions per place. [2025-01-09 21:20:32,868 INFO L140 encePairwiseOnDemand]: 180/186 looper letters, 154 selfloop transitions, 45 changer transitions 0/367 dead transitions. [2025-01-09 21:20:32,868 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 264 places, 367 transitions, 1540 flow [2025-01-09 21:20:32,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2025-01-09 21:20:32,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2025-01-09 21:20:32,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 7767 transitions. [2025-01-09 21:20:32,891 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9279569892473118 [2025-01-09 21:20:32,891 INFO L175 Difference]: Start difference. First operand has 220 places, 201 transitions, 596 flow. Second operand 45 states and 7767 transitions. [2025-01-09 21:20:32,891 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 264 places, 367 transitions, 1540 flow [2025-01-09 21:20:32,899 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 258 places, 367 transitions, 1500 flow, removed 14 selfloop flow, removed 6 redundant places. [2025-01-09 21:20:32,904 INFO L231 Difference]: Finished difference. Result has 267 places, 226 transitions, 874 flow [2025-01-09 21:20:32,904 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=186, PETRI_DIFFERENCE_MINUEND_FLOW=572, PETRI_DIFFERENCE_MINUEND_PLACES=214, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=201, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=178, PETRI_DIFFERENCE_SUBTRAHEND_STATES=45, PETRI_FLOW=874, PETRI_PLACES=267, PETRI_TRANSITIONS=226} [2025-01-09 21:20:32,906 INFO L279 CegarLoopForPetriNet]: 180 programPoint places, 87 predicate places. [2025-01-09 21:20:32,906 INFO L471 AbstractCegarLoop]: Abstraction has has 267 places, 226 transitions, 874 flow [2025-01-09 21:20:32,908 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 170.02941176470588) internal successors, (5781), 34 states have internal predecessors, (5781), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:20:32,908 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:20:32,908 INFO L206 CegarLoopForPetriNet]: trace histogram [15, 15, 15, 15, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:20:32,921 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-01-09 21:20:33,113 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2025-01-09 21:20:33,113 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-01-09 21:20:33,114 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:20:33,114 INFO L85 PathProgramCache]: Analyzing trace with hash -929588315, now seen corresponding path program 4 times [2025-01-09 21:20:33,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:20:33,114 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1079222416] [2025-01-09 21:20:33,114 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-09 21:20:33,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:20:33,138 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 269 statements into 2 equivalence classes. [2025-01-09 21:20:33,163 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 269 of 269 statements. [2025-01-09 21:20:33,163 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-01-09 21:20:33,163 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:20:34,260 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 840 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:20:34,263 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:20:34,264 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1079222416] [2025-01-09 21:20:34,264 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1079222416] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 21:20:34,264 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1152189728] [2025-01-09 21:20:34,264 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-09 21:20:34,264 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 21:20:34,264 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 21:20:34,266 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 21:20:34,272 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-01-09 21:20:34,348 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 269 statements into 2 equivalence classes. [2025-01-09 21:20:34,386 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 269 of 269 statements. [2025-01-09 21:20:34,387 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-01-09 21:20:34,387 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:20:34,389 INFO L256 TraceCheckSpWp]: Trace formula consists of 509 conjuncts, 32 conjuncts are in the unsatisfiable core [2025-01-09 21:20:34,392 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 21:20:34,539 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 840 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:20:34,540 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 21:20:35,387 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 840 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:20:35,388 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1152189728] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 21:20:35,388 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 21:20:35,388 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33, 33] total 66 [2025-01-09 21:20:35,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [144723098] [2025-01-09 21:20:35,388 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 21:20:35,389 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 66 states [2025-01-09 21:20:35,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:20:35,390 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2025-01-09 21:20:35,391 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1122, Invalid=3168, Unknown=0, NotChecked=0, Total=4290 [2025-01-09 21:20:35,455 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 168 out of 186 [2025-01-09 21:20:35,461 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 267 places, 226 transitions, 874 flow. Second operand has 66 states, 66 states have (on average 170.0151515151515) internal successors, (11221), 66 states have internal predecessors, (11221), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:20:35,462 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:20:35,462 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 168 of 186 [2025-01-09 21:20:35,462 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:20:37,580 INFO L124 PetriNetUnfolderBase]: 520/1778 cut-off events. [2025-01-09 21:20:37,580 INFO L125 PetriNetUnfolderBase]: For 8807/8810 co-relation queries the response was YES. [2025-01-09 21:20:37,586 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5186 conditions, 1778 events. 520/1778 cut-off events. For 8807/8810 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 5870 event pairs, 9 based on Foata normal form. 64/1827 useless extension candidates. Maximal degree in co-relation 5022. Up to 255 conditions per place. [2025-01-09 21:20:37,592 INFO L140 encePairwiseOnDemand]: 180/186 looper letters, 314 selfloop transitions, 93 changer transitions 0/575 dead transitions. [2025-01-09 21:20:37,592 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 359 places, 575 transitions, 3022 flow [2025-01-09 21:20:37,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2025-01-09 21:20:37,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2025-01-09 21:20:37,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 16047 transitions. [2025-01-09 21:20:37,648 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9276795005202914 [2025-01-09 21:20:37,648 INFO L175 Difference]: Start difference. First operand has 267 places, 226 transitions, 874 flow. Second operand 93 states and 16047 transitions. [2025-01-09 21:20:37,648 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 359 places, 575 transitions, 3022 flow [2025-01-09 21:20:37,659 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 341 places, 575 transitions, 2934 flow, removed 26 selfloop flow, removed 18 redundant places. [2025-01-09 21:20:37,663 INFO L231 Difference]: Finished difference. Result has 358 places, 275 transitions, 1508 flow [2025-01-09 21:20:37,663 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=186, PETRI_DIFFERENCE_MINUEND_FLOW=818, PETRI_DIFFERENCE_MINUEND_PLACES=249, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=226, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=46, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=179, PETRI_DIFFERENCE_SUBTRAHEND_STATES=93, PETRI_FLOW=1508, PETRI_PLACES=358, PETRI_TRANSITIONS=275} [2025-01-09 21:20:37,664 INFO L279 CegarLoopForPetriNet]: 180 programPoint places, 178 predicate places. [2025-01-09 21:20:37,664 INFO L471 AbstractCegarLoop]: Abstraction has has 358 places, 275 transitions, 1508 flow [2025-01-09 21:20:37,667 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 66 states, 66 states have (on average 170.0151515151515) internal successors, (11221), 66 states have internal predecessors, (11221), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:20:37,668 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:20:37,668 INFO L206 CegarLoopForPetriNet]: trace histogram [31, 31, 31, 31, 31, 31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:20:37,675 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-01-09 21:20:37,872 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-01-09 21:20:37,872 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-01-09 21:20:37,874 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:20:37,874 INFO L85 PathProgramCache]: Analyzing trace with hash -882781509, now seen corresponding path program 5 times [2025-01-09 21:20:37,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:20:37,874 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [725387449] [2025-01-09 21:20:37,874 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-01-09 21:20:37,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:20:37,889 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 397 statements into 31 equivalence classes. [2025-01-09 21:20:37,936 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 31 check-sat command(s) and asserted 397 of 397 statements. [2025-01-09 21:20:37,936 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 31 check-sat command(s) [2025-01-09 21:20:37,936 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:20:39,822 INFO L134 CoverageAnalysis]: Checked inductivity of 3720 backedges. 0 proven. 3720 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:20:39,822 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:20:39,822 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [725387449] [2025-01-09 21:20:39,822 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [725387449] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 21:20:39,822 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1493774850] [2025-01-09 21:20:39,822 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-01-09 21:20:39,823 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 21:20:39,823 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 21:20:39,825 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 21:20:39,828 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-01-09 21:20:39,936 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 397 statements into 31 equivalence classes. [2025-01-09 21:20:40,041 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 31 check-sat command(s) and asserted 397 of 397 statements. [2025-01-09 21:20:40,042 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 31 check-sat command(s) [2025-01-09 21:20:40,042 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:20:40,048 INFO L256 TraceCheckSpWp]: Trace formula consists of 717 conjuncts, 64 conjuncts are in the unsatisfiable core [2025-01-09 21:20:40,057 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 21:20:40,410 INFO L134 CoverageAnalysis]: Checked inductivity of 3720 backedges. 0 proven. 3720 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:20:40,412 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 21:20:42,610 INFO L134 CoverageAnalysis]: Checked inductivity of 3720 backedges. 0 proven. 3720 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:20:42,611 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1493774850] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 21:20:42,611 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 21:20:42,611 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [65, 65, 65] total 87 [2025-01-09 21:20:42,611 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [302417476] [2025-01-09 21:20:42,611 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 21:20:42,612 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 87 states [2025-01-09 21:20:42,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:20:42,614 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 87 interpolants. [2025-01-09 21:20:42,615 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1935, Invalid=5547, Unknown=0, NotChecked=0, Total=7482 [2025-01-09 21:20:42,686 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 168 out of 186 [2025-01-09 21:20:42,693 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 358 places, 275 transitions, 1508 flow. Second operand has 87 states, 87 states have (on average 170.0344827586207) internal successors, (14793), 87 states have internal predecessors, (14793), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:20:42,694 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:20:42,694 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 168 of 186 [2025-01-09 21:20:42,694 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:20:46,535 INFO L124 PetriNetUnfolderBase]: 712/2354 cut-off events. [2025-01-09 21:20:46,536 INFO L125 PetriNetUnfolderBase]: For 28499/28502 co-relation queries the response was YES. [2025-01-09 21:20:46,544 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7719 conditions, 2354 events. 712/2354 cut-off events. For 28499/28502 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 7799 event pairs, 9 based on Foata normal form. 48/2387 useless extension candidates. Maximal degree in co-relation 7538. Up to 351 conditions per place. [2025-01-09 21:20:46,551 INFO L140 encePairwiseOnDemand]: 180/186 looper letters, 434 selfloop transitions, 129 changer transitions 0/731 dead transitions. [2025-01-09 21:20:46,551 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 486 places, 731 transitions, 4376 flow [2025-01-09 21:20:46,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 129 states. [2025-01-09 21:20:46,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2025-01-09 21:20:46,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 22247 transitions. [2025-01-09 21:20:46,565 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9271901308660498 [2025-01-09 21:20:46,565 INFO L175 Difference]: Start difference. First operand has 358 places, 275 transitions, 1508 flow. Second operand 129 states and 22247 transitions. [2025-01-09 21:20:46,565 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 486 places, 731 transitions, 4376 flow [2025-01-09 21:20:46,591 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 444 places, 731 transitions, 4232 flow, removed 30 selfloop flow, removed 42 redundant places. [2025-01-09 21:20:46,597 INFO L231 Difference]: Finished difference. Result has 457 places, 312 transitions, 2106 flow [2025-01-09 21:20:46,598 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=186, PETRI_DIFFERENCE_MINUEND_FLOW=1388, PETRI_DIFFERENCE_MINUEND_PLACES=316, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=275, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=94, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=180, PETRI_DIFFERENCE_SUBTRAHEND_STATES=129, PETRI_FLOW=2106, PETRI_PLACES=457, PETRI_TRANSITIONS=312} [2025-01-09 21:20:46,598 INFO L279 CegarLoopForPetriNet]: 180 programPoint places, 277 predicate places. [2025-01-09 21:20:46,598 INFO L471 AbstractCegarLoop]: Abstraction has has 457 places, 312 transitions, 2106 flow [2025-01-09 21:20:46,601 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 87 states, 87 states have (on average 170.0344827586207) internal successors, (14793), 87 states have internal predecessors, (14793), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:20:46,602 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:20:46,602 INFO L206 CegarLoopForPetriNet]: trace histogram [43, 43, 43, 43, 43, 43, 43, 43, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:20:46,615 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-01-09 21:20:46,806 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-01-09 21:20:46,806 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-01-09 21:20:46,807 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:20:46,808 INFO L85 PathProgramCache]: Analyzing trace with hash -1372964101, now seen corresponding path program 6 times [2025-01-09 21:20:46,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:20:46,808 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [58305128] [2025-01-09 21:20:46,808 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-01-09 21:20:46,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:20:46,828 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 493 statements into 43 equivalence classes. [2025-01-09 21:20:46,926 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 43 check-sat command(s) and asserted 493 of 493 statements. [2025-01-09 21:20:46,927 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 43 check-sat command(s) [2025-01-09 21:20:46,927 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 21:20:46,927 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 21:20:46,932 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 493 statements into 1 equivalence classes. [2025-01-09 21:20:46,953 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 493 of 493 statements. [2025-01-09 21:20:46,953 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:20:46,953 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 21:20:47,165 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 21:20:47,165 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 21:20:47,166 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location threadErr0ASSERT_VIOLATIONDATA_RACE (6 of 7 remaining) [2025-01-09 21:20:47,170 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (5 of 7 remaining) [2025-01-09 21:20:47,170 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (4 of 7 remaining) [2025-01-09 21:20:47,170 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2025-01-09 21:20:47,170 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (2 of 7 remaining) [2025-01-09 21:20:47,170 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (1 of 7 remaining) [2025-01-09 21:20:47,172 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (0 of 7 remaining) [2025-01-09 21:20:47,172 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 21:20:47,172 INFO L422 BasicCegarLoop]: Path program histogram: [6, 1, 1, 1, 1, 1, 1] [2025-01-09 21:20:47,340 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-01-09 21:20:47,340 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-09 21:20:47,346 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.01 09:20:47 BasicIcfg [2025-01-09 21:20:47,346 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-09 21:20:47,346 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-09 21:20:47,346 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-09 21:20:47,346 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-09 21:20:47,347 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:20:26" (3/4) ... [2025-01-09 21:20:47,347 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2025-01-09 21:20:47,480 INFO L127 tionWitnessGenerator]: Generated YAML witness of length 45. [2025-01-09 21:20:47,544 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-01-09 21:20:47,544 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-01-09 21:20:47,544 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-09 21:20:47,545 INFO L158 Benchmark]: Toolchain (without parser) took 21824.55ms. Allocated memory was 167.8MB in the beginning and 578.8MB in the end (delta: 411.0MB). Free memory was 121.9MB in the beginning and 235.7MB in the end (delta: -113.7MB). Peak memory consumption was 297.7MB. Max. memory is 16.1GB. [2025-01-09 21:20:47,546 INFO L158 Benchmark]: CDTParser took 0.73ms. Allocated memory is still 201.3MB. Free memory is still 116.8MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 21:20:47,546 INFO L158 Benchmark]: CACSL2BoogieTranslator took 319.45ms. Allocated memory is still 167.8MB. Free memory was 121.2MB in the beginning and 101.3MB in the end (delta: 19.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-09 21:20:47,546 INFO L158 Benchmark]: Boogie Procedure Inliner took 31.12ms. Allocated memory is still 167.8MB. Free memory was 101.3MB in the beginning and 99.2MB in the end (delta: 2.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 21:20:47,546 INFO L158 Benchmark]: Boogie Preprocessor took 35.13ms. Allocated memory is still 167.8MB. Free memory was 99.2MB in the beginning and 97.2MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 21:20:47,547 INFO L158 Benchmark]: RCFGBuilder took 369.12ms. Allocated memory is still 167.8MB. Free memory was 97.2MB in the beginning and 79.5MB in the end (delta: 17.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-09 21:20:47,547 INFO L158 Benchmark]: TraceAbstraction took 20865.56ms. Allocated memory was 167.8MB in the beginning and 578.8MB in the end (delta: 411.0MB). Free memory was 78.8MB in the beginning and 290.2MB in the end (delta: -211.3MB). Peak memory consumption was 197.0MB. Max. memory is 16.1GB. [2025-01-09 21:20:47,547 INFO L158 Benchmark]: Witness Printer took 198.35ms. Allocated memory is still 578.8MB. Free memory was 290.2MB in the beginning and 235.7MB in the end (delta: 54.5MB). Peak memory consumption was 58.7MB. Max. memory is 16.1GB. [2025-01-09 21:20:47,549 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.73ms. Allocated memory is still 201.3MB. Free memory is still 116.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 319.45ms. Allocated memory is still 167.8MB. Free memory was 121.2MB in the beginning and 101.3MB in the end (delta: 19.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 31.12ms. Allocated memory is still 167.8MB. Free memory was 101.3MB in the beginning and 99.2MB in the end (delta: 2.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 35.13ms. Allocated memory is still 167.8MB. Free memory was 99.2MB in the beginning and 97.2MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 369.12ms. Allocated memory is still 167.8MB. Free memory was 97.2MB in the beginning and 79.5MB in the end (delta: 17.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 20865.56ms. Allocated memory was 167.8MB in the beginning and 578.8MB in the end (delta: 411.0MB). Free memory was 78.8MB in the beginning and 290.2MB in the end (delta: -211.3MB). Peak memory consumption was 197.0MB. Max. memory is 16.1GB. * Witness Printer took 198.35ms. Allocated memory is still 578.8MB. Free memory was 290.2MB in the beginning and 235.7MB in the end (delta: 54.5MB). Peak memory consumption was 58.7MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - DataRaceFoundResult [Line: 704]: Data race detected Data race detected The following path leads to a data race: [L697] 0 pthread_mutex_t lock; VAL [lock={3:0}] [L698] 0 pthread_cond_t cond; VAL [lock={3:0}] [L699] 0 int x; VAL [lock={3:0}, x=0] [L700] 0 _Bool x_set = 0; VAL [lock={3:0}, x=0, x_set=0] [L711] 0 pthread_t t; VAL [lock={3:0}, x=0, x_set=0] [L712] FCALL, FORK 0 pthread_create( &t, ((void *)0), thread, ((void *)0) ) VAL [lock={3:0}, t=-1, x=0, x_set=0] [L713] 0 int i = 0; VAL [i=0, lock={3:0}, t=-1, x=0, x_set=0] [L713] COND TRUE 0 i <= 42 VAL [i=0, lock={3:0}, t=-1, x=0, x_set=0] [L714] 0 x = i VAL [i=0, lock={3:0}, t=-1, x=0, x_set=0] [L713] 0 i++ VAL [i=1, lock={3:0}, t=-1, x=0, x_set=0] [L713] COND TRUE 0 i <= 42 VAL [i=1, lock={3:0}, t=-1, x=0, x_set=0] [L714] 0 x = i VAL [i=1, lock={3:0}, t=-1, x=1, x_set=0] [L713] 0 i++ VAL [i=2, lock={3:0}, t=-1, x=1, x_set=0] [L713] COND TRUE 0 i <= 42 VAL [i=2, lock={3:0}, t=-1, x=1, x_set=0] [L714] 0 x = i VAL [i=2, lock={3:0}, t=-1, x=2, x_set=0] [L713] 0 i++ VAL [i=3, lock={3:0}, t=-1, x=2, x_set=0] [L713] COND TRUE 0 i <= 42 VAL [i=3, lock={3:0}, t=-1, x=2, x_set=0] [L714] 0 x = i VAL [i=3, lock={3:0}, t=-1, x=3, x_set=0] [L713] 0 i++ VAL [i=4, lock={3:0}, t=-1, x=3, x_set=0] [L713] COND TRUE 0 i <= 42 VAL [i=4, lock={3:0}, t=-1, x=3, x_set=0] [L714] 0 x = i VAL [i=4, lock={3:0}, t=-1, x=4, x_set=0] [L713] 0 i++ VAL [i=5, lock={3:0}, t=-1, x=4, x_set=0] [L713] COND TRUE 0 i <= 42 VAL [i=5, lock={3:0}, t=-1, x=4, x_set=0] [L714] 0 x = i VAL [i=5, lock={3:0}, t=-1, x=5, x_set=0] [L713] 0 i++ VAL [i=6, lock={3:0}, t=-1, x=5, x_set=0] [L713] COND TRUE 0 i <= 42 VAL [i=6, lock={3:0}, t=-1, x=5, x_set=0] [L714] 0 x = i VAL [i=6, lock={3:0}, t=-1, x=6, x_set=0] [L713] 0 i++ VAL [i=7, lock={3:0}, t=-1, x=6, x_set=0] [L713] COND TRUE 0 i <= 42 VAL [i=7, lock={3:0}, t=-1, x=6, x_set=0] [L714] 0 x = i VAL [i=7, lock={3:0}, t=-1, x=7, x_set=0] [L713] 0 i++ VAL [i=8, lock={3:0}, t=-1, x=7, x_set=0] [L713] COND TRUE 0 i <= 42 VAL [i=8, lock={3:0}, t=-1, x=7, x_set=0] [L714] 0 x = i VAL [i=8, lock={3:0}, t=-1, x=8, x_set=0] [L713] 0 i++ VAL [i=9, lock={3:0}, t=-1, x=8, x_set=0] [L713] COND TRUE 0 i <= 42 VAL [i=9, lock={3:0}, t=-1, x=8, x_set=0] [L714] 0 x = i VAL [i=9, lock={3:0}, t=-1, x=9, x_set=0] [L713] 0 i++ VAL [i=10, lock={3:0}, t=-1, x=9, x_set=0] [L713] COND TRUE 0 i <= 42 VAL [i=10, lock={3:0}, t=-1, x=9, x_set=0] [L714] 0 x = i VAL [i=10, lock={3:0}, t=-1, x=10, x_set=0] [L713] 0 i++ VAL [i=11, lock={3:0}, t=-1, x=10, x_set=0] [L713] COND TRUE 0 i <= 42 VAL [i=11, lock={3:0}, t=-1, x=10, x_set=0] [L714] 0 x = i VAL [i=11, lock={3:0}, t=-1, x=11, x_set=0] [L713] 0 i++ VAL [i=12, lock={3:0}, t=-1, x=11, x_set=0] [L713] COND TRUE 0 i <= 42 VAL [i=12, lock={3:0}, t=-1, x=11, x_set=0] [L714] 0 x = i VAL [i=12, lock={3:0}, t=-1, x=12, x_set=0] [L713] 0 i++ VAL [i=13, lock={3:0}, t=-1, x=12, x_set=0] [L713] COND TRUE 0 i <= 42 VAL [i=13, lock={3:0}, t=-1, x=12, x_set=0] [L714] 0 x = i VAL [i=13, lock={3:0}, t=-1, x=13, x_set=0] [L713] 0 i++ VAL [i=14, lock={3:0}, t=-1, x=13, x_set=0] [L713] COND TRUE 0 i <= 42 VAL [i=14, lock={3:0}, t=-1, x=13, x_set=0] [L714] 0 x = i VAL [i=14, lock={3:0}, t=-1, x=14, x_set=0] [L713] 0 i++ VAL [i=15, lock={3:0}, t=-1, x=14, x_set=0] [L713] COND TRUE 0 i <= 42 VAL [i=15, lock={3:0}, t=-1, x=14, x_set=0] [L714] 0 x = i VAL [i=15, lock={3:0}, t=-1, x=15, x_set=0] [L713] 0 i++ VAL [i=16, lock={3:0}, t=-1, x=15, x_set=0] [L713] COND TRUE 0 i <= 42 VAL [i=16, lock={3:0}, t=-1, x=15, x_set=0] [L714] 0 x = i VAL [i=16, lock={3:0}, t=-1, x=16, x_set=0] [L713] 0 i++ VAL [i=17, lock={3:0}, t=-1, x=16, x_set=0] [L713] COND TRUE 0 i <= 42 VAL [i=17, lock={3:0}, t=-1, x=16, x_set=0] [L714] 0 x = i VAL [i=17, lock={3:0}, t=-1, x=17, x_set=0] [L713] 0 i++ VAL [i=18, lock={3:0}, t=-1, x=17, x_set=0] [L713] COND TRUE 0 i <= 42 VAL [i=18, lock={3:0}, t=-1, x=17, x_set=0] [L714] 0 x = i VAL [i=18, lock={3:0}, t=-1, x=18, x_set=0] [L713] 0 i++ VAL [i=19, lock={3:0}, t=-1, x=18, x_set=0] [L713] COND TRUE 0 i <= 42 VAL [i=19, lock={3:0}, t=-1, x=18, x_set=0] [L714] 0 x = i VAL [i=19, lock={3:0}, t=-1, x=19, x_set=0] [L713] 0 i++ VAL [i=20, lock={3:0}, t=-1, x=19, x_set=0] [L713] COND TRUE 0 i <= 42 VAL [i=20, lock={3:0}, t=-1, x=19, x_set=0] [L714] 0 x = i VAL [i=20, lock={3:0}, t=-1, x=20, x_set=0] [L713] 0 i++ VAL [i=21, lock={3:0}, t=-1, x=20, x_set=0] [L713] COND TRUE 0 i <= 42 VAL [i=21, lock={3:0}, t=-1, x=20, x_set=0] [L714] 0 x = i VAL [i=21, lock={3:0}, t=-1, x=21, x_set=0] [L713] 0 i++ VAL [i=22, lock={3:0}, t=-1, x=21, x_set=0] [L713] COND TRUE 0 i <= 42 VAL [i=22, lock={3:0}, t=-1, x=21, x_set=0] [L714] 0 x = i VAL [i=22, lock={3:0}, t=-1, x=22, x_set=0] [L713] 0 i++ VAL [i=23, lock={3:0}, t=-1, x=22, x_set=0] [L713] COND TRUE 0 i <= 42 VAL [i=23, lock={3:0}, t=-1, x=22, x_set=0] [L714] 0 x = i VAL [i=23, lock={3:0}, t=-1, x=23, x_set=0] [L713] 0 i++ VAL [i=24, lock={3:0}, t=-1, x=23, x_set=0] [L713] COND TRUE 0 i <= 42 VAL [i=24, lock={3:0}, t=-1, x=23, x_set=0] [L714] 0 x = i VAL [i=24, lock={3:0}, t=-1, x=24, x_set=0] [L713] 0 i++ VAL [i=25, lock={3:0}, t=-1, x=24, x_set=0] [L713] COND TRUE 0 i <= 42 VAL [i=25, lock={3:0}, t=-1, x=24, x_set=0] [L714] 0 x = i VAL [i=25, lock={3:0}, t=-1, x=25, x_set=0] [L713] 0 i++ VAL [i=26, lock={3:0}, t=-1, x=25, x_set=0] [L713] COND TRUE 0 i <= 42 VAL [i=26, lock={3:0}, t=-1, x=25, x_set=0] [L714] 0 x = i VAL [i=26, lock={3:0}, t=-1, x=26, x_set=0] [L713] 0 i++ VAL [i=27, lock={3:0}, t=-1, x=26, x_set=0] [L713] COND TRUE 0 i <= 42 VAL [i=27, lock={3:0}, t=-1, x=26, x_set=0] [L714] 0 x = i VAL [i=27, lock={3:0}, t=-1, x=27, x_set=0] [L713] 0 i++ VAL [i=28, lock={3:0}, t=-1, x=27, x_set=0] [L713] COND TRUE 0 i <= 42 VAL [i=28, lock={3:0}, t=-1, x=27, x_set=0] [L714] 0 x = i VAL [i=28, lock={3:0}, t=-1, x=28, x_set=0] [L713] 0 i++ VAL [i=29, lock={3:0}, t=-1, x=28, x_set=0] [L713] COND TRUE 0 i <= 42 VAL [i=29, lock={3:0}, t=-1, x=28, x_set=0] [L714] 0 x = i VAL [i=29, lock={3:0}, t=-1, x=29, x_set=0] [L713] 0 i++ VAL [i=30, lock={3:0}, t=-1, x=29, x_set=0] [L713] COND TRUE 0 i <= 42 VAL [i=30, lock={3:0}, t=-1, x=29, x_set=0] [L714] 0 x = i VAL [i=30, lock={3:0}, t=-1, x=30, x_set=0] [L713] 0 i++ VAL [i=31, lock={3:0}, t=-1, x=30, x_set=0] [L713] COND TRUE 0 i <= 42 VAL [i=31, lock={3:0}, t=-1, x=30, x_set=0] [L714] 0 x = i VAL [i=31, lock={3:0}, t=-1, x=31, x_set=0] [L713] 0 i++ VAL [i=32, lock={3:0}, t=-1, x=31, x_set=0] [L713] COND TRUE 0 i <= 42 VAL [i=32, lock={3:0}, t=-1, x=31, x_set=0] [L714] 0 x = i VAL [i=32, lock={3:0}, t=-1, x=32, x_set=0] [L713] 0 i++ VAL [i=33, lock={3:0}, t=-1, x=32, x_set=0] [L713] COND TRUE 0 i <= 42 VAL [i=33, lock={3:0}, t=-1, x=32, x_set=0] [L714] 0 x = i VAL [i=33, lock={3:0}, t=-1, x=33, x_set=0] [L713] 0 i++ VAL [i=34, lock={3:0}, t=-1, x=33, x_set=0] [L713] COND TRUE 0 i <= 42 VAL [i=34, lock={3:0}, t=-1, x=33, x_set=0] [L714] 0 x = i VAL [i=34, lock={3:0}, t=-1, x=34, x_set=0] [L713] 0 i++ VAL [i=35, lock={3:0}, t=-1, x=34, x_set=0] [L713] COND TRUE 0 i <= 42 VAL [i=35, lock={3:0}, t=-1, x=34, x_set=0] [L714] 0 x = i VAL [i=35, lock={3:0}, t=-1, x=35, x_set=0] [L713] 0 i++ VAL [i=36, lock={3:0}, t=-1, x=35, x_set=0] [L713] COND TRUE 0 i <= 42 VAL [i=36, lock={3:0}, t=-1, x=35, x_set=0] [L714] 0 x = i VAL [i=36, lock={3:0}, t=-1, x=36, x_set=0] [L713] 0 i++ VAL [i=37, lock={3:0}, t=-1, x=36, x_set=0] [L713] COND TRUE 0 i <= 42 VAL [i=37, lock={3:0}, t=-1, x=36, x_set=0] [L714] 0 x = i VAL [i=37, lock={3:0}, t=-1, x=37, x_set=0] [L713] 0 i++ VAL [i=38, lock={3:0}, t=-1, x=37, x_set=0] [L713] COND TRUE 0 i <= 42 VAL [i=38, lock={3:0}, t=-1, x=37, x_set=0] [L714] 0 x = i VAL [i=38, lock={3:0}, t=-1, x=38, x_set=0] [L713] 0 i++ VAL [i=39, lock={3:0}, t=-1, x=38, x_set=0] [L713] COND TRUE 0 i <= 42 VAL [i=39, lock={3:0}, t=-1, x=38, x_set=0] [L714] 0 x = i VAL [i=39, lock={3:0}, t=-1, x=39, x_set=0] [L713] 0 i++ VAL [i=40, lock={3:0}, t=-1, x=39, x_set=0] [L713] COND TRUE 0 i <= 42 VAL [i=40, lock={3:0}, t=-1, x=39, x_set=0] [L714] 0 x = i VAL [i=40, lock={3:0}, t=-1, x=40, x_set=0] [L713] 0 i++ VAL [i=41, lock={3:0}, t=-1, x=40, x_set=0] [L713] COND TRUE 0 i <= 42 VAL [i=41, lock={3:0}, t=-1, x=40, x_set=0] [L714] 0 x = i VAL [i=41, lock={3:0}, t=-1, x=41, x_set=0] [L713] 0 i++ VAL [i=42, lock={3:0}, t=-1, x=41, x_set=0] [L713] COND TRUE 0 i <= 42 VAL [i=42, lock={3:0}, t=-1, x=41, x_set=0] [L714] 0 x = i VAL [i=42, lock={3:0}, t=-1, x=42, x_set=0] [L713] 0 i++ VAL [i=43, lock={3:0}, t=-1, x=42, x_set=0] [L704] 1 !x_set VAL [\old(arg)={0:0}, arg={0:0}, lock={3:0}, x=42, x_set=0] [L713] COND FALSE 0 !(i <= 42) VAL [i=43, lock={3:0}, t=-1, x=42, x_set=0] [L715] 0 x_set = 1 VAL [lock={3:0}, t=-1, x=42, x_set=1] [L704] 1 !x_set VAL [\old(arg)={0:0}, arg={0:0}, lock={3:0}, x=42, x_set=1] Now there is a data race on ~x_set~0 between C: x_set = 1 [715] and C: !x_set [704] - UnprovableResult [Line: 714]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 715]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 712]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 706]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 3 procedures, 205 locations, 7 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 20.6s, OverallIterations: 12, TraceHistogramMax: 43, PathProgramHistogramMax: 6, EmptinessCheckTime: 0.0s, AutomataDifference: 8.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3857 SdHoareTripleChecker+Valid, 1.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3799 mSDsluCounter, 398 SdHoareTripleChecker+Invalid, 1.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 370 mSDsCounter, 14 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2016 IncrementalHoareTripleChecker+Invalid, 2030 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 14 mSolverCounterUnsat, 28 mSDtfsCounter, 2016 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2878 GetRequests, 2435 SyntacticMatches, 41 SemanticMatches, 402 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12630 ImplicationChecksByTransitivity, 9.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2106occurred in iteration=11, InterpolantAutomatonStates: 315, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 8.5s InterpolantComputationTime, 3926 NumberOfCodeBlocks, 3926 NumberOfCodeBlocksAsserted, 136 NumberOfCheckSat, 4612 ConstructedInterpolants, 0 QuantifiedInterpolants, 7506 SizeOfPredicates, 114 NumberOfNonLiveVariables, 2623 ConjunctsInSsa, 127 ConjunctsInUnsatCore, 22 InterpolantComputations, 6 PerfectInterpolantSequences, 1/14261 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2025-01-09 21:20:47,564 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(DATA-RACE)