/root/.sdkman/candidates/java/21.0.5-tem/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata ./data -tc ../benchexec/../../../trunk/examples/toolchains/AutomizerCInline_IcfgBuilder.xml -s ../benchexec/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --traceabstraction.automaton.type.used.in.concurrency.analysis PETRI_NET --preprocessor.replace.while.statements.and.if-then-else.statements false -i ../../../trunk/examples/svcomp/pthread/triangular-longest-2.i -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.cfg-lbe-improvements-94356ea-m [2025-04-13 23:48:40,976 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-13 23:48:41,034 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../benchexec/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2025-04-13 23:48:41,037 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-13 23:48:41,038 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-13 23:48:41,059 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-13 23:48:41,059 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-13 23:48:41,060 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-13 23:48:41,060 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-13 23:48:41,061 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-13 23:48:41,061 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-13 23:48:41,061 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-13 23:48:41,062 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-13 23:48:41,062 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-13 23:48:41,062 INFO L153 SettingsManager]: * Use SBE=true [2025-04-13 23:48:41,062 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-13 23:48:41,062 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-13 23:48:41,062 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-13 23:48:41,062 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-13 23:48:41,062 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-13 23:48:41,062 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-13 23:48:41,062 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-13 23:48:41,062 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-13 23:48:41,063 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-13 23:48:41,063 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-13 23:48:41,063 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-13 23:48:41,063 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-13 23:48:41,063 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-13 23:48:41,063 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-13 23:48:41,063 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 23:48:41,063 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 23:48:41,063 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 23:48:41,063 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 23:48:41,063 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-13 23:48:41,063 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 23:48:41,063 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 23:48:41,063 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 23:48:41,063 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 23:48:41,064 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-13 23:48:41,064 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-13 23:48:41,064 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-13 23:48:41,064 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-13 23:48:41,064 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-13 23:48:41,064 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-13 23:48:41,064 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-13 23:48:41,064 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-13 23:48:41,064 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-13 23:48:41,064 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Automaton type used in concurrency analysis -> PETRI_NET Applying setting for plugin de.uni_freiburg.informatik.ultimate.boogie.preprocessor: Replace while statements and if-then-else statements -> false [2025-04-13 23:48:41,316 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-13 23:48:41,327 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-13 23:48:41,330 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-13 23:48:41,331 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-13 23:48:41,334 INFO L274 PluginConnector]: CDTParser initialized [2025-04-13 23:48:41,335 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread/triangular-longest-2.i [2025-04-13 23:48:42,708 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aa04e56b1/f9f6083f1f1044c68266f281eba8fa34/FLAG0ba293a00 [2025-04-13 23:48:42,982 INFO L389 CDTParser]: Found 1 translation units. [2025-04-13 23:48:42,982 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread/triangular-longest-2.i [2025-04-13 23:48:42,995 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aa04e56b1/f9f6083f1f1044c68266f281eba8fa34/FLAG0ba293a00 [2025-04-13 23:48:43,758 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aa04e56b1/f9f6083f1f1044c68266f281eba8fa34 [2025-04-13 23:48:43,761 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-13 23:48:43,762 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-04-13 23:48:43,764 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-13 23:48:43,764 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-13 23:48:43,772 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-13 23:48:43,773 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 11:48:43" (1/1) ... [2025-04-13 23:48:43,773 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4c63c4b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:48:43, skipping insertion in model container [2025-04-13 23:48:43,774 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 11:48:43" (1/1) ... [2025-04-13 23:48:43,794 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-13 23:48:44,065 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/triangular-longest-2.i[30964,30977] [2025-04-13 23:48:44,069 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 23:48:44,080 INFO L200 MainTranslator]: Completed pre-run [2025-04-13 23:48:44,132 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/triangular-longest-2.i[30964,30977] [2025-04-13 23:48:44,132 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 23:48:44,163 INFO L204 MainTranslator]: Completed translation [2025-04-13 23:48:44,163 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:48:44 WrapperNode [2025-04-13 23:48:44,164 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-13 23:48:44,164 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-13 23:48:44,165 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-13 23:48:44,165 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-13 23:48:44,169 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:48:44" (1/1) ... [2025-04-13 23:48:44,180 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:48:44" (1/1) ... [2025-04-13 23:48:44,195 INFO L138 Inliner]: procedures = 168, calls = 16, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 37 [2025-04-13 23:48:44,195 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-13 23:48:44,196 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-13 23:48:44,196 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-13 23:48:44,196 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-13 23:48:44,201 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:48:44" (1/1) ... [2025-04-13 23:48:44,202 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:48:44" (1/1) ... [2025-04-13 23:48:44,204 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:48:44" (1/1) ... [2025-04-13 23:48:44,215 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-04-13 23:48:44,215 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:48:44" (1/1) ... [2025-04-13 23:48:44,215 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:48:44" (1/1) ... [2025-04-13 23:48:44,217 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:48:44" (1/1) ... [2025-04-13 23:48:44,218 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:48:44" (1/1) ... [2025-04-13 23:48:44,219 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:48:44" (1/1) ... [2025-04-13 23:48:44,219 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:48:44" (1/1) ... [2025-04-13 23:48:44,221 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-13 23:48:44,222 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-04-13 23:48:44,222 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-04-13 23:48:44,222 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-04-13 23:48:44,223 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:48:44" (1/1) ... [2025-04-13 23:48:44,228 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 23:48:44,237 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:48:44,250 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-04-13 23:48:44,255 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-04-13 23:48:44,271 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2025-04-13 23:48:44,271 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2025-04-13 23:48:44,272 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2025-04-13 23:48:44,272 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2025-04-13 23:48:44,272 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-04-13 23:48:44,272 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-13 23:48:44,272 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-04-13 23:48:44,272 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-04-13 23:48:44,272 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-13 23:48:44,272 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-13 23:48:44,273 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-13 23:48:44,367 INFO L256 CfgBuilder]: Building ICFG [2025-04-13 23:48:44,368 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-13 23:48:44,479 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-13 23:48:44,479 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-13 23:48:44,480 INFO L318 CfgBuilder]: Performing block encoding [2025-04-13 23:48:44,582 WARN L179 LargeBlockEncoding]: Complex 2:2 sequential composition. Such compositions can cause exponential blowup and should not occur in structured programs. [2025-04-13 23:48:44,589 WARN L179 LargeBlockEncoding]: Complex 2:2 sequential composition. Such compositions can cause exponential blowup and should not occur in structured programs. [2025-04-13 23:48:44,595 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-13 23:48:44,595 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.04 11:48:44 BoogieIcfgContainer [2025-04-13 23:48:44,595 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-04-13 23:48:44,596 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-13 23:48:44,596 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-13 23:48:44,600 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-13 23:48:44,601 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.04 11:48:43" (1/3) ... [2025-04-13 23:48:44,602 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70aaa49d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 11:48:44, skipping insertion in model container [2025-04-13 23:48:44,602 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:48:44" (2/3) ... [2025-04-13 23:48:44,602 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70aaa49d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 11:48:44, skipping insertion in model container [2025-04-13 23:48:44,602 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.04 11:48:44" (3/3) ... [2025-04-13 23:48:44,603 INFO L128 eAbstractionObserver]: Analyzing ICFG triangular-longest-2.i [2025-04-13 23:48:44,612 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-13 23:48:44,614 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG triangular-longest-2.i that has 3 procedures, 18 locations, 19 edges, 1 initial locations, 2 loop locations, and 1 error locations. [2025-04-13 23:48:44,614 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-13 23:48:44,653 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-04-13 23:48:44,680 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 24 places, 21 transitions, 50 flow [2025-04-13 23:48:44,699 INFO L116 PetriNetUnfolderBase]: 4/19 cut-off events. [2025-04-13 23:48:44,700 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-13 23:48:44,705 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26 conditions, 19 events. 4/19 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 18 event pairs, 0 based on Foata normal form. 0/14 useless extension candidates. Maximal degree in co-relation 19. Up to 2 conditions per place. [2025-04-13 23:48:44,705 INFO L82 GeneralOperation]: Start removeDead. Operand has 24 places, 21 transitions, 50 flow [2025-04-13 23:48:44,707 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 22 places, 19 transitions, 44 flow [2025-04-13 23:48:44,712 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-13 23:48:44,720 INFO L340 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;@6c125fe6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-13 23:48:44,720 INFO L341 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2025-04-13 23:48:44,725 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-13 23:48:44,725 INFO L116 PetriNetUnfolderBase]: 4/17 cut-off events. [2025-04-13 23:48:44,725 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-13 23:48:44,725 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 23:48:44,726 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:48:44,726 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 23:48:44,729 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:48:44,730 INFO L85 PathProgramCache]: Analyzing trace with hash -272227646, now seen corresponding path program 1 times [2025-04-13 23:48:44,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:48:44,736 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1471117958] [2025-04-13 23:48:44,737 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 23:48:44,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:48:44,810 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-13 23:48:44,834 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-13 23:48:44,834 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:48:44,834 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:48:45,108 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:48:45,110 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:48:45,110 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1471117958] [2025-04-13 23:48:45,112 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1471117958] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:48:45,112 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:48:45,112 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 23:48:45,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [12727559] [2025-04-13 23:48:45,114 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:48:45,119 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 23:48:45,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:48:45,141 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 23:48:45,141 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-13 23:48:45,142 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 21 [2025-04-13 23:48:45,145 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 22 places, 19 transitions, 44 flow. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 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-04-13 23:48:45,145 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 23:48:45,145 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 21 [2025-04-13 23:48:45,145 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 23:48:45,345 INFO L116 PetriNetUnfolderBase]: 237/370 cut-off events. [2025-04-13 23:48:45,345 INFO L117 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-04-13 23:48:45,346 INFO L83 FinitePrefix]: Finished finitePrefix Result has 754 conditions, 370 events. 237/370 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1122 event pairs, 45 based on Foata normal form. 0/297 useless extension candidates. Maximal degree in co-relation 744. Up to 233 conditions per place. [2025-04-13 23:48:45,348 INFO L140 encePairwiseOnDemand]: 13/21 looper letters, 25 selfloop transitions, 4 changer transitions 17/46 dead transitions. [2025-04-13 23:48:45,349 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 27 places, 46 transitions, 190 flow [2025-04-13 23:48:45,350 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-13 23:48:45,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-13 23:48:45,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 68 transitions. [2025-04-13 23:48:45,362 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5396825396825397 [2025-04-13 23:48:45,363 INFO L175 Difference]: Start difference. First operand has 22 places, 19 transitions, 44 flow. Second operand 6 states and 68 transitions. [2025-04-13 23:48:45,364 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 27 places, 46 transitions, 190 flow [2025-04-13 23:48:45,367 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 25 places, 46 transitions, 188 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-13 23:48:45,369 INFO L231 Difference]: Finished difference. Result has 29 places, 19 transitions, 65 flow [2025-04-13 23:48:45,370 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=38, PETRI_DIFFERENCE_MINUEND_PLACES=20, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=17, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=65, PETRI_PLACES=29, PETRI_TRANSITIONS=19} [2025-04-13 23:48:45,373 INFO L279 CegarLoopForPetriNet]: 22 programPoint places, 7 predicate places. [2025-04-13 23:48:45,374 INFO L485 AbstractCegarLoop]: Abstraction has has 29 places, 19 transitions, 65 flow [2025-04-13 23:48:45,374 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 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-04-13 23:48:45,374 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 23:48:45,374 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:48:45,374 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-13 23:48:45,374 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 23:48:45,375 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:48:45,375 INFO L85 PathProgramCache]: Analyzing trace with hash 396254466, now seen corresponding path program 1 times [2025-04-13 23:48:45,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:48:45,375 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1272905471] [2025-04-13 23:48:45,375 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 23:48:45,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:48:45,387 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-13 23:48:45,397 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-13 23:48:45,397 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:48:45,397 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:48:45,536 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:48:45,537 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:48:45,537 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1272905471] [2025-04-13 23:48:45,537 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1272905471] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:48:45,537 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:48:45,537 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 23:48:45,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [790362622] [2025-04-13 23:48:45,537 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:48:45,538 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-13 23:48:45,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:48:45,538 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-13 23:48:45,538 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-04-13 23:48:45,538 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 21 [2025-04-13 23:48:45,538 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 19 transitions, 65 flow. Second operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 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-04-13 23:48:45,538 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 23:48:45,538 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 21 [2025-04-13 23:48:45,538 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 23:48:45,722 INFO L116 PetriNetUnfolderBase]: 295/480 cut-off events. [2025-04-13 23:48:45,723 INFO L117 PetriNetUnfolderBase]: For 213/213 co-relation queries the response was YES. [2025-04-13 23:48:45,724 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1183 conditions, 480 events. 295/480 cut-off events. For 213/213 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1650 event pairs, 41 based on Foata normal form. 24/418 useless extension candidates. Maximal degree in co-relation 1169. Up to 219 conditions per place. [2025-04-13 23:48:45,726 INFO L140 encePairwiseOnDemand]: 15/21 looper letters, 43 selfloop transitions, 9 changer transitions 19/71 dead transitions. [2025-04-13 23:48:45,726 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 71 transitions, 357 flow [2025-04-13 23:48:45,726 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-13 23:48:45,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-04-13 23:48:45,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 86 transitions. [2025-04-13 23:48:45,727 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.455026455026455 [2025-04-13 23:48:45,727 INFO L175 Difference]: Start difference. First operand has 29 places, 19 transitions, 65 flow. Second operand 9 states and 86 transitions. [2025-04-13 23:48:45,727 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 71 transitions, 357 flow [2025-04-13 23:48:45,732 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 71 transitions, 341 flow, removed 8 selfloop flow, removed 2 redundant places. [2025-04-13 23:48:45,733 INFO L231 Difference]: Finished difference. Result has 39 places, 28 transitions, 150 flow [2025-04-13 23:48:45,733 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=61, PETRI_DIFFERENCE_MINUEND_PLACES=24, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=13, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=150, PETRI_PLACES=39, PETRI_TRANSITIONS=28} [2025-04-13 23:48:45,735 INFO L279 CegarLoopForPetriNet]: 22 programPoint places, 17 predicate places. [2025-04-13 23:48:45,735 INFO L485 AbstractCegarLoop]: Abstraction has has 39 places, 28 transitions, 150 flow [2025-04-13 23:48:45,735 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 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-04-13 23:48:45,735 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 23:48:45,735 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:48:45,735 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-13 23:48:45,735 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 23:48:45,736 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:48:45,736 INFO L85 PathProgramCache]: Analyzing trace with hash 396744576, now seen corresponding path program 2 times [2025-04-13 23:48:45,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:48:45,736 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1752911178] [2025-04-13 23:48:45,736 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 23:48:45,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:48:45,743 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 10 statements into 1 equivalence classes. [2025-04-13 23:48:45,747 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-13 23:48:45,747 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 23:48:45,747 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:48:45,874 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:48:45,875 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:48:45,875 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1752911178] [2025-04-13 23:48:45,875 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1752911178] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:48:45,875 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:48:45,875 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 23:48:45,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1904284931] [2025-04-13 23:48:45,875 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:48:45,876 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-13 23:48:45,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:48:45,878 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-13 23:48:45,878 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-04-13 23:48:45,878 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 21 [2025-04-13 23:48:45,879 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 28 transitions, 150 flow. Second operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 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-04-13 23:48:45,879 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 23:48:45,879 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 21 [2025-04-13 23:48:45,879 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 23:48:46,059 INFO L116 PetriNetUnfolderBase]: 256/429 cut-off events. [2025-04-13 23:48:46,059 INFO L117 PetriNetUnfolderBase]: For 743/743 co-relation queries the response was YES. [2025-04-13 23:48:46,062 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1350 conditions, 429 events. 256/429 cut-off events. For 743/743 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1515 event pairs, 41 based on Foata normal form. 39/386 useless extension candidates. Maximal degree in co-relation 1329. Up to 208 conditions per place. [2025-04-13 23:48:46,063 INFO L140 encePairwiseOnDemand]: 15/21 looper letters, 38 selfloop transitions, 9 changer transitions 25/72 dead transitions. [2025-04-13 23:48:46,063 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 72 transitions, 478 flow [2025-04-13 23:48:46,065 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-13 23:48:46,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-04-13 23:48:46,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 76 transitions. [2025-04-13 23:48:46,065 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4523809523809524 [2025-04-13 23:48:46,066 INFO L175 Difference]: Start difference. First operand has 39 places, 28 transitions, 150 flow. Second operand 8 states and 76 transitions. [2025-04-13 23:48:46,066 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 72 transitions, 478 flow [2025-04-13 23:48:46,069 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 72 transitions, 470 flow, removed 4 selfloop flow, removed 2 redundant places. [2025-04-13 23:48:46,070 INFO L231 Difference]: Finished difference. Result has 46 places, 30 transitions, 204 flow [2025-04-13 23:48:46,070 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=204, PETRI_PLACES=46, PETRI_TRANSITIONS=30} [2025-04-13 23:48:46,071 INFO L279 CegarLoopForPetriNet]: 22 programPoint places, 24 predicate places. [2025-04-13 23:48:46,071 INFO L485 AbstractCegarLoop]: Abstraction has has 46 places, 30 transitions, 204 flow [2025-04-13 23:48:46,071 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 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-04-13 23:48:46,071 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 23:48:46,071 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:48:46,072 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-13 23:48:46,073 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 23:48:46,073 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:48:46,073 INFO L85 PathProgramCache]: Analyzing trace with hash 1129004876, now seen corresponding path program 1 times [2025-04-13 23:48:46,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:48:46,073 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [424526953] [2025-04-13 23:48:46,073 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 23:48:46,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:48:46,080 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-04-13 23:48:46,085 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-13 23:48:46,085 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:48:46,085 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:48:46,173 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:48:46,173 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:48:46,174 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [424526953] [2025-04-13 23:48:46,174 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [424526953] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:48:46,174 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:48:46,174 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-13 23:48:46,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1747086841] [2025-04-13 23:48:46,174 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:48:46,174 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-13 23:48:46,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:48:46,174 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-13 23:48:46,175 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-04-13 23:48:46,175 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 21 [2025-04-13 23:48:46,175 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 30 transitions, 204 flow. Second operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 7 states have internal predecessors, (26), 0 states have call successors, (0), 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-04-13 23:48:46,175 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 23:48:46,175 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 21 [2025-04-13 23:48:46,175 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 23:48:46,378 INFO L116 PetriNetUnfolderBase]: 274/453 cut-off events. [2025-04-13 23:48:46,379 INFO L117 PetriNetUnfolderBase]: For 1315/1315 co-relation queries the response was YES. [2025-04-13 23:48:46,380 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1583 conditions, 453 events. 274/453 cut-off events. For 1315/1315 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 1584 event pairs, 53 based on Foata normal form. 18/381 useless extension candidates. Maximal degree in co-relation 1557. Up to 211 conditions per place. [2025-04-13 23:48:46,382 INFO L140 encePairwiseOnDemand]: 15/21 looper letters, 46 selfloop transitions, 16 changer transitions 17/79 dead transitions. [2025-04-13 23:48:46,382 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 79 transitions, 573 flow [2025-04-13 23:48:46,383 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-04-13 23:48:46,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-04-13 23:48:46,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 95 transitions. [2025-04-13 23:48:46,385 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.41125541125541126 [2025-04-13 23:48:46,385 INFO L175 Difference]: Start difference. First operand has 46 places, 30 transitions, 204 flow. Second operand 11 states and 95 transitions. [2025-04-13 23:48:46,385 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 79 transitions, 573 flow [2025-04-13 23:48:46,389 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 79 transitions, 506 flow, removed 24 selfloop flow, removed 7 redundant places. [2025-04-13 23:48:46,390 INFO L231 Difference]: Finished difference. Result has 51 places, 36 transitions, 273 flow [2025-04-13 23:48:46,390 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=168, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=273, PETRI_PLACES=51, PETRI_TRANSITIONS=36} [2025-04-13 23:48:46,390 INFO L279 CegarLoopForPetriNet]: 22 programPoint places, 29 predicate places. [2025-04-13 23:48:46,390 INFO L485 AbstractCegarLoop]: Abstraction has has 51 places, 36 transitions, 273 flow [2025-04-13 23:48:46,390 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 7 states have internal predecessors, (26), 0 states have call successors, (0), 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-04-13 23:48:46,390 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 23:48:46,390 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:48:46,391 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-13 23:48:46,391 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 23:48:46,391 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:48:46,391 INFO L85 PathProgramCache]: Analyzing trace with hash 1124046116, now seen corresponding path program 2 times [2025-04-13 23:48:46,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:48:46,391 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [411027680] [2025-04-13 23:48:46,391 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 23:48:46,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:48:46,395 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 12 statements into 1 equivalence classes. [2025-04-13 23:48:46,399 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-13 23:48:46,399 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 23:48:46,399 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:48:46,482 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:48:46,482 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:48:46,482 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [411027680] [2025-04-13 23:48:46,483 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [411027680] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:48:46,483 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:48:46,483 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-13 23:48:46,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [340314219] [2025-04-13 23:48:46,483 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:48:46,483 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-13 23:48:46,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:48:46,483 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-13 23:48:46,483 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-04-13 23:48:46,484 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 21 [2025-04-13 23:48:46,484 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 36 transitions, 273 flow. Second operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 7 states have internal predecessors, (26), 0 states have call successors, (0), 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-04-13 23:48:46,484 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 23:48:46,484 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 21 [2025-04-13 23:48:46,484 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 23:48:46,644 INFO L116 PetriNetUnfolderBase]: 445/732 cut-off events. [2025-04-13 23:48:46,644 INFO L117 PetriNetUnfolderBase]: For 2713/2713 co-relation queries the response was YES. [2025-04-13 23:48:46,646 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2665 conditions, 732 events. 445/732 cut-off events. For 2713/2713 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 2894 event pairs, 31 based on Foata normal form. 27/597 useless extension candidates. Maximal degree in co-relation 2638. Up to 253 conditions per place. [2025-04-13 23:48:46,648 INFO L140 encePairwiseOnDemand]: 15/21 looper letters, 57 selfloop transitions, 20 changer transitions 21/98 dead transitions. [2025-04-13 23:48:46,648 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 98 transitions, 757 flow [2025-04-13 23:48:46,648 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-04-13 23:48:46,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-04-13 23:48:46,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 106 transitions. [2025-04-13 23:48:46,649 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4588744588744589 [2025-04-13 23:48:46,649 INFO L175 Difference]: Start difference. First operand has 51 places, 36 transitions, 273 flow. Second operand 11 states and 106 transitions. [2025-04-13 23:48:46,649 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 98 transitions, 757 flow [2025-04-13 23:48:46,653 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 98 transitions, 691 flow, removed 27 selfloop flow, removed 4 redundant places. [2025-04-13 23:48:46,656 INFO L231 Difference]: Finished difference. Result has 62 places, 42 transitions, 370 flow [2025-04-13 23:48:46,656 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=233, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=370, PETRI_PLACES=62, PETRI_TRANSITIONS=42} [2025-04-13 23:48:46,656 INFO L279 CegarLoopForPetriNet]: 22 programPoint places, 40 predicate places. [2025-04-13 23:48:46,656 INFO L485 AbstractCegarLoop]: Abstraction has has 62 places, 42 transitions, 370 flow [2025-04-13 23:48:46,656 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 7 states have internal predecessors, (26), 0 states have call successors, (0), 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-04-13 23:48:46,656 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 23:48:46,656 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:48:46,657 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-13 23:48:46,657 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 23:48:46,657 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:48:46,657 INFO L85 PathProgramCache]: Analyzing trace with hash 1898509928, now seen corresponding path program 3 times [2025-04-13 23:48:46,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:48:46,657 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1268257296] [2025-04-13 23:48:46,657 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 23:48:46,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:48:46,665 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 12 statements into 1 equivalence classes. [2025-04-13 23:48:46,667 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-13 23:48:46,667 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 23:48:46,667 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:48:46,759 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:48:46,760 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:48:46,760 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1268257296] [2025-04-13 23:48:46,760 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1268257296] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:48:46,760 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:48:46,760 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-13 23:48:46,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1696301339] [2025-04-13 23:48:46,760 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:48:46,760 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-13 23:48:46,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:48:46,761 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-13 23:48:46,761 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-04-13 23:48:46,761 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 21 [2025-04-13 23:48:46,761 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 42 transitions, 370 flow. Second operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 7 states have internal predecessors, (26), 0 states have call successors, (0), 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-04-13 23:48:46,761 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 23:48:46,761 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 21 [2025-04-13 23:48:46,761 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 23:48:46,949 INFO L116 PetriNetUnfolderBase]: 418/696 cut-off events. [2025-04-13 23:48:46,949 INFO L117 PetriNetUnfolderBase]: For 4269/4269 co-relation queries the response was YES. [2025-04-13 23:48:46,950 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2949 conditions, 696 events. 418/696 cut-off events. For 4269/4269 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2723 event pairs, 37 based on Foata normal form. 45/585 useless extension candidates. Maximal degree in co-relation 2917. Up to 154 conditions per place. [2025-04-13 23:48:46,952 INFO L140 encePairwiseOnDemand]: 15/21 looper letters, 45 selfloop transitions, 25 changer transitions 31/101 dead transitions. [2025-04-13 23:48:46,952 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 101 transitions, 950 flow [2025-04-13 23:48:46,952 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-04-13 23:48:46,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-04-13 23:48:46,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 103 transitions. [2025-04-13 23:48:46,953 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4458874458874459 [2025-04-13 23:48:46,953 INFO L175 Difference]: Start difference. First operand has 62 places, 42 transitions, 370 flow. Second operand 11 states and 103 transitions. [2025-04-13 23:48:46,953 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 101 transitions, 950 flow [2025-04-13 23:48:46,958 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 101 transitions, 879 flow, removed 26 selfloop flow, removed 5 redundant places. [2025-04-13 23:48:46,959 INFO L231 Difference]: Finished difference. Result has 70 places, 45 transitions, 469 flow [2025-04-13 23:48:46,959 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=329, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=469, PETRI_PLACES=70, PETRI_TRANSITIONS=45} [2025-04-13 23:48:46,959 INFO L279 CegarLoopForPetriNet]: 22 programPoint places, 48 predicate places. [2025-04-13 23:48:46,960 INFO L485 AbstractCegarLoop]: Abstraction has has 70 places, 45 transitions, 469 flow [2025-04-13 23:48:46,960 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 7 states have internal predecessors, (26), 0 states have call successors, (0), 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-04-13 23:48:46,960 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 23:48:46,960 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:48:46,960 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-04-13 23:48:46,960 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 23:48:46,960 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:48:46,960 INFO L85 PathProgramCache]: Analyzing trace with hash 599557581, now seen corresponding path program 1 times [2025-04-13 23:48:46,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:48:46,960 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1057609459] [2025-04-13 23:48:46,960 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 23:48:46,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:48:46,964 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-13 23:48:46,966 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-13 23:48:46,966 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:48:46,967 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:48:47,049 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:48:47,049 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:48:47,049 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1057609459] [2025-04-13 23:48:47,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1057609459] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:48:47,050 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1658208915] [2025-04-13 23:48:47,050 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 23:48:47,050 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:48:47,050 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:48:47,054 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 23:48:47,055 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-04-13 23:48:47,088 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-13 23:48:47,098 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-13 23:48:47,098 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:48:47,098 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:48:47,099 INFO L256 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-04-13 23:48:47,101 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:48:47,162 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:48:47,162 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:48:47,262 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:48:47,263 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1658208915] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:48:47,263 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:48:47,263 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2025-04-13 23:48:47,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2130465041] [2025-04-13 23:48:47,263 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:48:47,263 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-04-13 23:48:47,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:48:47,264 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-04-13 23:48:47,264 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2025-04-13 23:48:47,264 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 21 [2025-04-13 23:48:47,264 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 45 transitions, 469 flow. Second operand has 13 states, 13 states have (on average 4.153846153846154) internal successors, (54), 13 states have internal predecessors, (54), 0 states have call successors, (0), 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-04-13 23:48:47,264 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 23:48:47,264 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 21 [2025-04-13 23:48:47,264 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 23:48:47,612 INFO L116 PetriNetUnfolderBase]: 526/876 cut-off events. [2025-04-13 23:48:47,612 INFO L117 PetriNetUnfolderBase]: For 9194/9194 co-relation queries the response was YES. [2025-04-13 23:48:47,614 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4259 conditions, 876 events. 526/876 cut-off events. For 9194/9194 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 3223 event pairs, 125 based on Foata normal form. 63/735 useless extension candidates. Maximal degree in co-relation 4223. Up to 489 conditions per place. [2025-04-13 23:48:47,617 INFO L140 encePairwiseOnDemand]: 15/21 looper letters, 67 selfloop transitions, 17 changer transitions 64/148 dead transitions. [2025-04-13 23:48:47,617 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 148 transitions, 1529 flow [2025-04-13 23:48:47,617 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-04-13 23:48:47,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2025-04-13 23:48:47,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 171 transitions. [2025-04-13 23:48:47,618 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.42857142857142855 [2025-04-13 23:48:47,618 INFO L175 Difference]: Start difference. First operand has 70 places, 45 transitions, 469 flow. Second operand 19 states and 171 transitions. [2025-04-13 23:48:47,618 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 148 transitions, 1529 flow [2025-04-13 23:48:47,627 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 148 transitions, 1430 flow, removed 33 selfloop flow, removed 8 redundant places. [2025-04-13 23:48:47,629 INFO L231 Difference]: Finished difference. Result has 90 places, 51 transitions, 598 flow [2025-04-13 23:48:47,629 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=400, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=598, PETRI_PLACES=90, PETRI_TRANSITIONS=51} [2025-04-13 23:48:47,630 INFO L279 CegarLoopForPetriNet]: 22 programPoint places, 68 predicate places. [2025-04-13 23:48:47,630 INFO L485 AbstractCegarLoop]: Abstraction has has 90 places, 51 transitions, 598 flow [2025-04-13 23:48:47,630 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.153846153846154) internal successors, (54), 13 states have internal predecessors, (54), 0 states have call successors, (0), 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-04-13 23:48:47,630 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 23:48:47,630 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:48:47,636 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-04-13 23:48:47,830 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:48:47,831 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 23:48:47,831 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:48:47,831 INFO L85 PathProgramCache]: Analyzing trace with hash -1470018493, now seen corresponding path program 2 times [2025-04-13 23:48:47,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:48:47,831 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [851599128] [2025-04-13 23:48:47,831 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 23:48:47,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:48:47,836 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 14 statements into 2 equivalence classes. [2025-04-13 23:48:47,839 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 14 of 14 statements. [2025-04-13 23:48:47,839 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 23:48:47,839 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:48:47,911 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:48:47,911 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:48:47,911 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [851599128] [2025-04-13 23:48:47,911 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [851599128] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:48:47,911 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1288893764] [2025-04-13 23:48:47,911 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 23:48:47,911 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:48:47,911 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:48:47,914 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 23:48:47,916 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-04-13 23:48:47,946 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 14 statements into 2 equivalence classes. [2025-04-13 23:48:47,955 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 14 of 14 statements. [2025-04-13 23:48:47,956 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 23:48:47,956 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:48:47,956 INFO L256 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-04-13 23:48:47,957 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:48:47,988 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:48:47,989 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:48:48,069 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:48:48,070 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1288893764] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:48:48,070 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:48:48,070 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2025-04-13 23:48:48,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [229210251] [2025-04-13 23:48:48,070 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:48:48,070 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-04-13 23:48:48,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:48:48,071 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-04-13 23:48:48,071 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2025-04-13 23:48:48,071 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 21 [2025-04-13 23:48:48,071 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 51 transitions, 598 flow. Second operand has 13 states, 13 states have (on average 4.076923076923077) internal successors, (53), 13 states have internal predecessors, (53), 0 states have call successors, (0), 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-04-13 23:48:48,071 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 23:48:48,071 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 21 [2025-04-13 23:48:48,071 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 23:48:48,597 INFO L116 PetriNetUnfolderBase]: 814/1353 cut-off events. [2025-04-13 23:48:48,598 INFO L117 PetriNetUnfolderBase]: For 33785/33785 co-relation queries the response was YES. [2025-04-13 23:48:48,602 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8664 conditions, 1353 events. 814/1353 cut-off events. For 33785/33785 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 5685 event pairs, 51 based on Foata normal form. 72/1095 useless extension candidates. Maximal degree in co-relation 8618. Up to 304 conditions per place. [2025-04-13 23:48:48,607 INFO L140 encePairwiseOnDemand]: 15/21 looper letters, 88 selfloop transitions, 47 changer transitions 74/209 dead transitions. [2025-04-13 23:48:48,607 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 209 transitions, 2776 flow [2025-04-13 23:48:48,607 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2025-04-13 23:48:48,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2025-04-13 23:48:48,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 247 transitions. [2025-04-13 23:48:48,608 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.43562610229276894 [2025-04-13 23:48:48,608 INFO L175 Difference]: Start difference. First operand has 90 places, 51 transitions, 598 flow. Second operand 27 states and 247 transitions. [2025-04-13 23:48:48,608 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 209 transitions, 2776 flow [2025-04-13 23:48:48,628 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 209 transitions, 2232 flow, removed 261 selfloop flow, removed 12 redundant places. [2025-04-13 23:48:48,631 INFO L231 Difference]: Finished difference. Result has 116 places, 67 transitions, 1001 flow [2025-04-13 23:48:48,631 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=464, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=27, PETRI_FLOW=1001, PETRI_PLACES=116, PETRI_TRANSITIONS=67} [2025-04-13 23:48:48,634 INFO L279 CegarLoopForPetriNet]: 22 programPoint places, 94 predicate places. [2025-04-13 23:48:48,634 INFO L485 AbstractCegarLoop]: Abstraction has has 116 places, 67 transitions, 1001 flow [2025-04-13 23:48:48,634 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.076923076923077) internal successors, (53), 13 states have internal predecessors, (53), 0 states have call successors, (0), 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-04-13 23:48:48,634 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 23:48:48,634 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:48:48,640 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-04-13 23:48:48,834 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2025-04-13 23:48:48,835 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 23:48:48,835 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:48:48,835 INFO L85 PathProgramCache]: Analyzing trace with hash -892279348, now seen corresponding path program 1 times [2025-04-13 23:48:48,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:48:48,835 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1919809553] [2025-04-13 23:48:48,835 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 23:48:48,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:48:48,841 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-13 23:48:48,844 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-13 23:48:48,844 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:48:48,844 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:48:48,922 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:48:48,922 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:48:48,922 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1919809553] [2025-04-13 23:48:48,922 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1919809553] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:48:48,922 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [104228650] [2025-04-13 23:48:48,922 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 23:48:48,922 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:48:48,922 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:48:48,925 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 23:48:48,926 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-04-13 23:48:48,954 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-13 23:48:48,962 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-13 23:48:48,962 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:48:48,962 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:48:48,963 INFO L256 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-04-13 23:48:48,964 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:48:48,987 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:48:48,987 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:48:49,095 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:48:49,095 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [104228650] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:48:49,095 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:48:49,095 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2025-04-13 23:48:49,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1547036680] [2025-04-13 23:48:49,095 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:48:49,095 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-04-13 23:48:49,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:48:49,096 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-04-13 23:48:49,096 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=163, Unknown=0, NotChecked=0, Total=210 [2025-04-13 23:48:49,096 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 21 [2025-04-13 23:48:49,096 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 116 places, 67 transitions, 1001 flow. Second operand has 15 states, 15 states have (on average 4.066666666666666) internal successors, (61), 15 states have internal predecessors, (61), 0 states have call successors, (0), 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-04-13 23:48:49,096 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 23:48:49,096 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 21 [2025-04-13 23:48:49,096 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 23:48:49,695 INFO L116 PetriNetUnfolderBase]: 1048/1758 cut-off events. [2025-04-13 23:48:49,695 INFO L117 PetriNetUnfolderBase]: For 80896/80896 co-relation queries the response was YES. [2025-04-13 23:48:49,702 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13918 conditions, 1758 events. 1048/1758 cut-off events. For 80896/80896 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 7962 event pairs, 131 based on Foata normal form. 63/1377 useless extension candidates. Maximal degree in co-relation 13860. Up to 490 conditions per place. [2025-04-13 23:48:49,712 INFO L140 encePairwiseOnDemand]: 15/21 looper letters, 99 selfloop transitions, 51 changer transitions 65/215 dead transitions. [2025-04-13 23:48:49,712 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 132 places, 215 transitions, 3605 flow [2025-04-13 23:48:49,713 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-04-13 23:48:49,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2025-04-13 23:48:49,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 232 transitions. [2025-04-13 23:48:49,714 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4419047619047619 [2025-04-13 23:48:49,714 INFO L175 Difference]: Start difference. First operand has 116 places, 67 transitions, 1001 flow. Second operand 25 states and 232 transitions. [2025-04-13 23:48:49,714 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 132 places, 215 transitions, 3605 flow [2025-04-13 23:48:49,773 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 215 transitions, 3025 flow, removed 274 selfloop flow, removed 15 redundant places. [2025-04-13 23:48:49,776 INFO L231 Difference]: Finished difference. Result has 132 places, 78 transitions, 1287 flow [2025-04-13 23:48:49,776 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=731, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=40, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=25, PETRI_FLOW=1287, PETRI_PLACES=132, PETRI_TRANSITIONS=78} [2025-04-13 23:48:49,776 INFO L279 CegarLoopForPetriNet]: 22 programPoint places, 110 predicate places. [2025-04-13 23:48:49,776 INFO L485 AbstractCegarLoop]: Abstraction has has 132 places, 78 transitions, 1287 flow [2025-04-13 23:48:49,776 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 4.066666666666666) internal successors, (61), 15 states have internal predecessors, (61), 0 states have call successors, (0), 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-04-13 23:48:49,777 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 23:48:49,777 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:48:49,782 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-04-13 23:48:49,981 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:48:49,981 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 23:48:49,981 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:48:49,982 INFO L85 PathProgramCache]: Analyzing trace with hash 958544518, now seen corresponding path program 2 times [2025-04-13 23:48:49,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:48:49,982 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1493233397] [2025-04-13 23:48:49,982 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 23:48:49,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:48:49,986 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 16 statements into 2 equivalence classes. [2025-04-13 23:48:49,989 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 16 of 16 statements. [2025-04-13 23:48:49,990 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 23:48:49,990 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:48:50,081 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:48:50,081 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:48:50,081 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1493233397] [2025-04-13 23:48:50,081 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1493233397] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:48:50,081 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1664136227] [2025-04-13 23:48:50,081 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 23:48:50,081 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:48:50,081 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:48:50,083 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 23:48:50,084 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-04-13 23:48:50,116 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 16 statements into 2 equivalence classes. [2025-04-13 23:48:50,125 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 16 of 16 statements. [2025-04-13 23:48:50,125 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 23:48:50,125 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:48:50,126 INFO L256 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-04-13 23:48:50,127 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:48:50,171 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:48:50,171 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:48:50,247 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:48:50,247 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1664136227] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:48:50,247 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:48:50,247 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2025-04-13 23:48:50,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1936194758] [2025-04-13 23:48:50,247 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:48:50,248 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-04-13 23:48:50,248 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:48:50,248 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-04-13 23:48:50,248 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=162, Unknown=0, NotChecked=0, Total=210 [2025-04-13 23:48:50,248 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 21 [2025-04-13 23:48:50,248 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 132 places, 78 transitions, 1287 flow. Second operand has 15 states, 15 states have (on average 4.133333333333334) internal successors, (62), 15 states have internal predecessors, (62), 0 states have call successors, (0), 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-04-13 23:48:50,248 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 23:48:50,249 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 21 [2025-04-13 23:48:50,249 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 23:48:50,918 INFO L116 PetriNetUnfolderBase]: 1165/1992 cut-off events. [2025-04-13 23:48:50,919 INFO L117 PetriNetUnfolderBase]: For 130170/130170 co-relation queries the response was YES. [2025-04-13 23:48:50,925 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16911 conditions, 1992 events. 1165/1992 cut-off events. For 130170/130170 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 9285 event pairs, 43 based on Foata normal form. 135/1605 useless extension candidates. Maximal degree in co-relation 16846. Up to 490 conditions per place. [2025-04-13 23:48:50,937 INFO L140 encePairwiseOnDemand]: 15/21 looper letters, 89 selfloop transitions, 76 changer transitions 96/261 dead transitions. [2025-04-13 23:48:50,938 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 152 places, 261 transitions, 5143 flow [2025-04-13 23:48:50,938 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2025-04-13 23:48:50,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2025-04-13 23:48:50,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 259 transitions. [2025-04-13 23:48:50,939 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.44047619047619047 [2025-04-13 23:48:50,939 INFO L175 Difference]: Start difference. First operand has 132 places, 78 transitions, 1287 flow. Second operand 28 states and 259 transitions. [2025-04-13 23:48:50,939 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 152 places, 261 transitions, 5143 flow [2025-04-13 23:48:51,030 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 134 places, 261 transitions, 4380 flow, removed 348 selfloop flow, removed 18 redundant places. [2025-04-13 23:48:51,035 INFO L231 Difference]: Finished difference. Result has 153 places, 99 transitions, 1922 flow [2025-04-13 23:48:51,035 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=991, PETRI_DIFFERENCE_MINUEND_PLACES=107, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=56, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=28, PETRI_FLOW=1922, PETRI_PLACES=153, PETRI_TRANSITIONS=99} [2025-04-13 23:48:51,035 INFO L279 CegarLoopForPetriNet]: 22 programPoint places, 131 predicate places. [2025-04-13 23:48:51,035 INFO L485 AbstractCegarLoop]: Abstraction has has 153 places, 99 transitions, 1922 flow [2025-04-13 23:48:51,036 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 4.133333333333334) internal successors, (62), 15 states have internal predecessors, (62), 0 states have call successors, (0), 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-04-13 23:48:51,036 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 23:48:51,036 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:48:51,043 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-04-13 23:48:51,240 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:48:51,240 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 23:48:51,240 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:48:51,240 INFO L85 PathProgramCache]: Analyzing trace with hash 13680550, now seen corresponding path program 3 times [2025-04-13 23:48:51,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:48:51,241 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1538973304] [2025-04-13 23:48:51,241 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 23:48:51,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:48:51,245 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 24 statements into 6 equivalence classes. [2025-04-13 23:48:51,253 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) and asserted 24 of 24 statements. [2025-04-13 23:48:51,253 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2025-04-13 23:48:51,253 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:48:51,394 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:48:51,394 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:48:51,394 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1538973304] [2025-04-13 23:48:51,394 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1538973304] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:48:51,394 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1766093049] [2025-04-13 23:48:51,394 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 23:48:51,394 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:48:51,394 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:48:51,396 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 23:48:51,398 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-04-13 23:48:51,429 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 24 statements into 6 equivalence classes. [2025-04-13 23:48:51,440 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) and asserted 24 of 24 statements. [2025-04-13 23:48:51,440 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2025-04-13 23:48:51,440 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:48:51,441 INFO L256 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-04-13 23:48:51,442 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:48:51,492 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:48:51,492 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:48:51,611 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:48:51,611 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1766093049] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:48:51,611 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:48:51,611 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 21 [2025-04-13 23:48:51,611 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1173126198] [2025-04-13 23:48:51,611 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:48:51,612 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-04-13 23:48:51,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:48:51,612 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-04-13 23:48:51,612 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=391, Unknown=0, NotChecked=0, Total=506 [2025-04-13 23:48:51,613 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 21 [2025-04-13 23:48:51,613 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 153 places, 99 transitions, 1922 flow. Second operand has 23 states, 23 states have (on average 4.086956521739131) internal successors, (94), 23 states have internal predecessors, (94), 0 states have call successors, (0), 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-04-13 23:48:51,613 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 23:48:51,613 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 21 [2025-04-13 23:48:51,613 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 23:48:52,744 INFO L116 PetriNetUnfolderBase]: 1633/2721 cut-off events. [2025-04-13 23:48:52,745 INFO L117 PetriNetUnfolderBase]: For 247277/247277 co-relation queries the response was YES. [2025-04-13 23:48:52,756 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26495 conditions, 2721 events. 1633/2721 cut-off events. For 247277/247277 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 12049 event pairs, 19 based on Foata normal form. 90/2115 useless extension candidates. Maximal degree in co-relation 26420. Up to 668 conditions per place. [2025-04-13 23:48:52,766 INFO L140 encePairwiseOnDemand]: 15/21 looper letters, 142 selfloop transitions, 112 changer transitions 129/383 dead transitions. [2025-04-13 23:48:52,766 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 190 places, 383 transitions, 8344 flow [2025-04-13 23:48:52,766 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2025-04-13 23:48:52,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2025-04-13 23:48:52,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 421 transitions. [2025-04-13 23:48:52,768 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4358178053830228 [2025-04-13 23:48:52,768 INFO L175 Difference]: Start difference. First operand has 153 places, 99 transitions, 1922 flow. Second operand 46 states and 421 transitions. [2025-04-13 23:48:52,768 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 190 places, 383 transitions, 8344 flow [2025-04-13 23:48:52,923 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 172 places, 383 transitions, 7039 flow, removed 626 selfloop flow, removed 18 redundant places. [2025-04-13 23:48:52,929 INFO L231 Difference]: Finished difference. Result has 200 places, 133 transitions, 3023 flow [2025-04-13 23:48:52,929 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=1423, PETRI_DIFFERENCE_MINUEND_PLACES=127, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=99, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=79, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=46, PETRI_FLOW=3023, PETRI_PLACES=200, PETRI_TRANSITIONS=133} [2025-04-13 23:48:52,929 INFO L279 CegarLoopForPetriNet]: 22 programPoint places, 178 predicate places. [2025-04-13 23:48:52,929 INFO L485 AbstractCegarLoop]: Abstraction has has 200 places, 133 transitions, 3023 flow [2025-04-13 23:48:52,930 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 4.086956521739131) internal successors, (94), 23 states have internal predecessors, (94), 0 states have call successors, (0), 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-04-13 23:48:52,930 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 23:48:52,930 INFO L206 CegarLoopForPetriNet]: trace histogram [7, 7, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:48:52,938 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-04-13 23:48:53,130 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-04-13 23:48:53,130 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 23:48:53,131 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:48:53,131 INFO L85 PathProgramCache]: Analyzing trace with hash -1073483274, now seen corresponding path program 4 times [2025-04-13 23:48:53,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:48:53,131 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1601337294] [2025-04-13 23:48:53,131 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 23:48:53,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:48:53,136 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 36 statements into 2 equivalence classes. [2025-04-13 23:48:53,145 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 36 of 36 statements. [2025-04-13 23:48:53,145 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 23:48:53,145 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:48:53,429 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 0 proven. 97 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:48:53,429 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:48:53,429 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1601337294] [2025-04-13 23:48:53,430 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1601337294] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:48:53,430 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1434096360] [2025-04-13 23:48:53,430 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 23:48:53,430 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:48:53,430 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:48:53,432 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 23:48:53,434 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-04-13 23:48:53,463 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 36 statements into 2 equivalence classes. [2025-04-13 23:48:53,476 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 36 of 36 statements. [2025-04-13 23:48:53,476 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 23:48:53,476 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:48:53,477 INFO L256 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-04-13 23:48:53,478 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:48:53,554 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 0 proven. 97 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:48:53,554 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:48:53,925 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 0 proven. 97 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:48:53,926 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1434096360] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:48:53,926 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:48:53,926 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 33 [2025-04-13 23:48:53,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [938937019] [2025-04-13 23:48:53,926 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:48:53,926 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2025-04-13 23:48:53,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:48:53,927 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2025-04-13 23:48:53,927 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=267, Invalid=923, Unknown=0, NotChecked=0, Total=1190 [2025-04-13 23:48:53,927 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 21 [2025-04-13 23:48:53,928 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 200 places, 133 transitions, 3023 flow. Second operand has 35 states, 35 states have (on average 4.0285714285714285) internal successors, (141), 35 states have internal predecessors, (141), 0 states have call successors, (0), 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-04-13 23:48:53,928 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 23:48:53,928 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 21 [2025-04-13 23:48:53,928 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 23:48:55,470 INFO L116 PetriNetUnfolderBase]: 2137/3666 cut-off events. [2025-04-13 23:48:55,470 INFO L117 PetriNetUnfolderBase]: For 566326/566326 co-relation queries the response was YES. [2025-04-13 23:48:55,487 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44566 conditions, 3666 events. 2137/3666 cut-off events. For 566326/566326 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 16678 event pairs, 399 based on Foata normal form. 153/2829 useless extension candidates. Maximal degree in co-relation 44473. Up to 1483 conditions per place. [2025-04-13 23:48:55,501 INFO L140 encePairwiseOnDemand]: 15/21 looper letters, 190 selfloop transitions, 99 changer transitions 187/476 dead transitions. [2025-04-13 23:48:55,501 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 244 places, 476 transitions, 13766 flow [2025-04-13 23:48:55,502 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2025-04-13 23:48:55,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2025-04-13 23:48:55,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 486 transitions. [2025-04-13 23:48:55,504 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.42077922077922075 [2025-04-13 23:48:55,504 INFO L175 Difference]: Start difference. First operand has 200 places, 133 transitions, 3023 flow. Second operand 55 states and 486 transitions. [2025-04-13 23:48:55,504 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 244 places, 476 transitions, 13766 flow [2025-04-13 23:48:56,012 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 215 places, 476 transitions, 10061 flow, removed 1813 selfloop flow, removed 29 redundant places. [2025-04-13 23:48:56,016 INFO L231 Difference]: Finished difference. Result has 248 places, 175 transitions, 3922 flow [2025-04-13 23:48:56,016 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=2042, PETRI_DIFFERENCE_MINUEND_PLACES=161, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=133, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=65, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=55, PETRI_FLOW=3922, PETRI_PLACES=248, PETRI_TRANSITIONS=175} [2025-04-13 23:48:56,017 INFO L279 CegarLoopForPetriNet]: 22 programPoint places, 226 predicate places. [2025-04-13 23:48:56,017 INFO L485 AbstractCegarLoop]: Abstraction has has 248 places, 175 transitions, 3922 flow [2025-04-13 23:48:56,017 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 4.0285714285714285) internal successors, (141), 35 states have internal predecessors, (141), 0 states have call successors, (0), 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-04-13 23:48:56,017 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 23:48:56,017 INFO L206 CegarLoopForPetriNet]: trace histogram [7, 7, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:48:56,023 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-04-13 23:48:56,217 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:48:56,218 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 23:48:56,218 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:48:56,218 INFO L85 PathProgramCache]: Analyzing trace with hash -44731370, now seen corresponding path program 5 times [2025-04-13 23:48:56,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:48:56,219 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [40496343] [2025-04-13 23:48:56,219 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 23:48:56,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:48:56,223 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 36 statements into 8 equivalence classes. [2025-04-13 23:48:56,232 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) and asserted 36 of 36 statements. [2025-04-13 23:48:56,232 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2025-04-13 23:48:56,232 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:48:56,485 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:48:56,485 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:48:56,485 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [40496343] [2025-04-13 23:48:56,485 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [40496343] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:48:56,485 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [487256429] [2025-04-13 23:48:56,485 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 23:48:56,485 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:48:56,485 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:48:56,487 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 23:48:56,489 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-04-13 23:48:56,519 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 36 statements into 8 equivalence classes. [2025-04-13 23:48:56,532 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) and asserted 36 of 36 statements. [2025-04-13 23:48:56,532 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2025-04-13 23:48:56,533 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:48:56,533 INFO L256 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-04-13 23:48:56,535 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:48:56,633 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 1 proven. 59 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:48:56,633 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:48:56,968 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:48:56,968 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [487256429] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:48:56,968 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:48:56,969 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 34 [2025-04-13 23:48:56,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1185487612] [2025-04-13 23:48:56,969 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:48:56,969 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2025-04-13 23:48:56,969 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:48:56,970 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2025-04-13 23:48:56,970 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=224, Invalid=1036, Unknown=0, NotChecked=0, Total=1260 [2025-04-13 23:48:56,970 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 21 [2025-04-13 23:48:56,970 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 248 places, 175 transitions, 3922 flow. Second operand has 36 states, 36 states have (on average 4.083333333333333) internal successors, (147), 36 states have internal predecessors, (147), 0 states have call successors, (0), 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-04-13 23:48:56,970 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 23:48:56,970 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 21 [2025-04-13 23:48:56,970 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 23:48:58,809 INFO L116 PetriNetUnfolderBase]: 2686/4746 cut-off events. [2025-04-13 23:48:58,809 INFO L117 PetriNetUnfolderBase]: For 948135/948135 co-relation queries the response was YES. [2025-04-13 23:48:58,833 INFO L83 FinitePrefix]: Finished finitePrefix Result has 59996 conditions, 4746 events. 2686/4746 cut-off events. For 948135/948135 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 23503 event pairs, 181 based on Foata normal form. 153/3555 useless extension candidates. Maximal degree in co-relation 59888. Up to 1370 conditions per place. [2025-04-13 23:48:58,850 INFO L140 encePairwiseOnDemand]: 15/21 looper letters, 180 selfloop transitions, 191 changer transitions 195/566 dead transitions. [2025-04-13 23:48:58,851 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 291 places, 566 transitions, 16484 flow [2025-04-13 23:48:58,852 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2025-04-13 23:48:58,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2025-04-13 23:48:58,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 541 transitions. [2025-04-13 23:48:58,853 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.42232630757220924 [2025-04-13 23:48:58,853 INFO L175 Difference]: Start difference. First operand has 248 places, 175 transitions, 3922 flow. Second operand 61 states and 541 transitions. [2025-04-13 23:48:58,853 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 291 places, 566 transitions, 16484 flow [2025-04-13 23:48:59,983 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 260 places, 566 transitions, 13958 flow, removed 1228 selfloop flow, removed 31 redundant places. [2025-04-13 23:48:59,989 INFO L231 Difference]: Finished difference. Result has 296 places, 236 transitions, 5947 flow [2025-04-13 23:48:59,989 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=3024, PETRI_DIFFERENCE_MINUEND_PLACES=200, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=175, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=138, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=61, PETRI_FLOW=5947, PETRI_PLACES=296, PETRI_TRANSITIONS=236} [2025-04-13 23:48:59,990 INFO L279 CegarLoopForPetriNet]: 22 programPoint places, 274 predicate places. [2025-04-13 23:48:59,990 INFO L485 AbstractCegarLoop]: Abstraction has has 296 places, 236 transitions, 5947 flow [2025-04-13 23:48:59,990 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 4.083333333333333) internal successors, (147), 36 states have internal predecessors, (147), 0 states have call successors, (0), 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-04-13 23:48:59,990 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 23:48:59,990 INFO L206 CegarLoopForPetriNet]: trace histogram [7, 7, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:48:59,996 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-04-13 23:49:00,193 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:49:00,193 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 23:49:00,193 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:49:00,194 INFO L85 PathProgramCache]: Analyzing trace with hash -510179354, now seen corresponding path program 6 times [2025-04-13 23:49:00,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:49:00,194 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [63071377] [2025-04-13 23:49:00,194 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 23:49:00,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:49:00,200 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 36 statements into 10 equivalence classes. [2025-04-13 23:49:00,210 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 10 check-sat command(s) and asserted 36 of 36 statements. [2025-04-13 23:49:00,210 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 10 check-sat command(s) [2025-04-13 23:49:00,210 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:49:00,463 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 0 proven. 69 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:49:00,464 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:49:00,464 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [63071377] [2025-04-13 23:49:00,464 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [63071377] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:49:00,464 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [421299483] [2025-04-13 23:49:00,464 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 23:49:00,464 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:49:00,464 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:49:00,466 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 23:49:00,467 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-04-13 23:49:00,498 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 36 statements into 10 equivalence classes. [2025-04-13 23:49:00,517 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 10 check-sat command(s) and asserted 36 of 36 statements. [2025-04-13 23:49:00,518 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 10 check-sat command(s) [2025-04-13 23:49:00,518 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:49:00,519 INFO L256 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-04-13 23:49:00,520 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:49:00,589 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 0 proven. 69 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:49:00,589 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:49:00,866 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 0 proven. 69 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:49:00,866 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [421299483] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:49:00,866 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:49:00,866 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 33 [2025-04-13 23:49:00,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1330347708] [2025-04-13 23:49:00,867 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:49:00,867 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2025-04-13 23:49:00,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:49:00,867 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2025-04-13 23:49:00,868 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=219, Invalid=971, Unknown=0, NotChecked=0, Total=1190 [2025-04-13 23:49:00,868 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 21 [2025-04-13 23:49:00,868 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 296 places, 236 transitions, 5947 flow. Second operand has 35 states, 35 states have (on average 4.057142857142857) internal successors, (142), 35 states have internal predecessors, (142), 0 states have call successors, (0), 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-04-13 23:49:00,868 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 23:49:00,868 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 21 [2025-04-13 23:49:00,868 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 23:49:03,305 INFO L116 PetriNetUnfolderBase]: 3613/6330 cut-off events. [2025-04-13 23:49:03,305 INFO L117 PetriNetUnfolderBase]: For 1883468/1883468 co-relation queries the response was YES. [2025-04-13 23:49:03,340 INFO L83 FinitePrefix]: Finished finitePrefix Result has 93873 conditions, 6330 events. 3613/6330 cut-off events. For 1883468/1883468 co-relation queries the response was YES. Maximal size of possible extension queue 91. Compared 32186 event pairs, 61 based on Foata normal form. 153/4701 useless extension candidates. Maximal degree in co-relation 93747. Up to 1817 conditions per place. [2025-04-13 23:49:03,434 INFO L140 encePairwiseOnDemand]: 15/21 looper letters, 226 selfloop transitions, 272 changer transitions 203/701 dead transitions. [2025-04-13 23:49:03,434 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 349 places, 701 transitions, 23591 flow [2025-04-13 23:49:03,435 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2025-04-13 23:49:03,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2025-04-13 23:49:03,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 653 transitions. [2025-04-13 23:49:03,439 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4379610999329309 [2025-04-13 23:49:03,439 INFO L175 Difference]: Start difference. First operand has 296 places, 236 transitions, 5947 flow. Second operand 71 states and 653 transitions. [2025-04-13 23:49:03,439 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 349 places, 701 transitions, 23591 flow [2025-04-13 23:49:05,352 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 318 places, 701 transitions, 19737 flow, removed 1881 selfloop flow, removed 31 redundant places. [2025-04-13 23:49:05,363 INFO L231 Difference]: Finished difference. Result has 360 places, 297 transitions, 8461 flow [2025-04-13 23:49:05,364 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=4489, PETRI_DIFFERENCE_MINUEND_PLACES=248, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=236, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=212, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=71, PETRI_FLOW=8461, PETRI_PLACES=360, PETRI_TRANSITIONS=297} [2025-04-13 23:49:05,364 INFO L279 CegarLoopForPetriNet]: 22 programPoint places, 338 predicate places. [2025-04-13 23:49:05,365 INFO L485 AbstractCegarLoop]: Abstraction has has 360 places, 297 transitions, 8461 flow [2025-04-13 23:49:05,365 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 4.057142857142857) internal successors, (142), 35 states have internal predecessors, (142), 0 states have call successors, (0), 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-04-13 23:49:05,365 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 23:49:05,365 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 9, 9, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:49:05,372 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-04-13 23:49:05,566 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2025-04-13 23:49:05,566 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 23:49:05,567 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:49:05,567 INFO L85 PathProgramCache]: Analyzing trace with hash 1436311473, now seen corresponding path program 7 times [2025-04-13 23:49:05,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:49:05,567 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [865629462] [2025-04-13 23:49:05,567 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 23:49:05,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:49:05,573 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-04-13 23:49:05,582 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-04-13 23:49:05,582 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:49:05,582 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:49:05,862 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 0 proven. 225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:49:05,862 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:49:05,862 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [865629462] [2025-04-13 23:49:05,862 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [865629462] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:49:05,862 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1374103776] [2025-04-13 23:49:05,862 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 23:49:05,862 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:49:05,863 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:49:05,864 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 23:49:05,865 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-04-13 23:49:05,896 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-04-13 23:49:05,909 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-04-13 23:49:05,909 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:49:05,909 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:49:05,911 INFO L256 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-04-13 23:49:05,912 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:49:05,974 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 0 proven. 225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:49:05,974 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:49:06,304 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 0 proven. 225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:49:06,305 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1374103776] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:49:06,305 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:49:06,305 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22, 22] total 44 [2025-04-13 23:49:06,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [613941363] [2025-04-13 23:49:06,305 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:49:06,305 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2025-04-13 23:49:06,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:49:06,306 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2025-04-13 23:49:06,306 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=474, Invalid=1596, Unknown=0, NotChecked=0, Total=2070 [2025-04-13 23:49:06,306 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 21 [2025-04-13 23:49:06,307 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 360 places, 297 transitions, 8461 flow. Second operand has 46 states, 46 states have (on average 4.021739130434782) internal successors, (185), 46 states have internal predecessors, (185), 0 states have call successors, (0), 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-04-13 23:49:06,307 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 23:49:06,307 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 21 [2025-04-13 23:49:06,307 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 23:49:10,768 INFO L116 PetriNetUnfolderBase]: 5089/8877 cut-off events. [2025-04-13 23:49:10,768 INFO L117 PetriNetUnfolderBase]: For 4105979/4105979 co-relation queries the response was YES. [2025-04-13 23:49:10,823 INFO L83 FinitePrefix]: Finished finitePrefix Result has 157753 conditions, 8877 events. 5089/8877 cut-off events. For 4105979/4105979 co-relation queries the response was YES. Maximal size of possible extension queue 84. Compared 45253 event pairs, 29 based on Foata normal form. 324/6705 useless extension candidates. Maximal degree in co-relation 157602. Up to 2564 conditions per place. [2025-04-13 23:49:10,858 INFO L140 encePairwiseOnDemand]: 15/21 looper letters, 314 selfloop transitions, 386 changer transitions 329/1029 dead transitions. [2025-04-13 23:49:10,859 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 448 places, 1029 transitions, 42715 flow [2025-04-13 23:49:10,859 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 106 states. [2025-04-13 23:49:10,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2025-04-13 23:49:10,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 973 transitions. [2025-04-13 23:49:10,865 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4371069182389937 [2025-04-13 23:49:10,865 INFO L175 Difference]: Start difference. First operand has 360 places, 297 transitions, 8461 flow. Second operand 106 states and 973 transitions. [2025-04-13 23:49:10,865 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 448 places, 1029 transitions, 42715 flow [2025-04-13 23:49:15,535 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 412 places, 1029 transitions, 34099 flow, removed 4215 selfloop flow, removed 36 redundant places. [2025-04-13 23:49:15,546 INFO L231 Difference]: Finished difference. Result has 477 places, 411 transitions, 13627 flow [2025-04-13 23:49:15,546 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=6061, PETRI_DIFFERENCE_MINUEND_PLACES=307, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=297, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=273, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=106, PETRI_FLOW=13627, PETRI_PLACES=477, PETRI_TRANSITIONS=411} [2025-04-13 23:49:15,547 INFO L279 CegarLoopForPetriNet]: 22 programPoint places, 455 predicate places. [2025-04-13 23:49:15,547 INFO L485 AbstractCegarLoop]: Abstraction has has 477 places, 411 transitions, 13627 flow [2025-04-13 23:49:15,547 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 46 states have (on average 4.021739130434782) internal successors, (185), 46 states have internal predecessors, (185), 0 states have call successors, (0), 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-04-13 23:49:15,547 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 23:49:15,547 INFO L206 CegarLoopForPetriNet]: trace histogram [19, 18, 18, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:49:15,553 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-04-13 23:49:15,747 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-04-13 23:49:15,748 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 23:49:15,749 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:49:15,749 INFO L85 PathProgramCache]: Analyzing trace with hash 1550015625, now seen corresponding path program 8 times [2025-04-13 23:49:15,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:49:15,749 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1324850749] [2025-04-13 23:49:15,749 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 23:49:15,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:49:15,754 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 82 statements into 2 equivalence classes. [2025-04-13 23:49:15,769 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 82 of 82 statements. [2025-04-13 23:49:15,769 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 23:49:15,769 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:49:16,409 INFO L134 CoverageAnalysis]: Checked inductivity of 936 backedges. 0 proven. 936 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:49:16,409 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:49:16,409 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1324850749] [2025-04-13 23:49:16,409 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1324850749] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:49:16,409 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [728633749] [2025-04-13 23:49:16,409 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 23:49:16,409 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:49:16,409 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:49:16,412 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 23:49:16,413 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-04-13 23:49:16,444 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 82 statements into 2 equivalence classes. [2025-04-13 23:49:16,463 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 82 of 82 statements. [2025-04-13 23:49:16,463 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 23:49:16,464 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:49:16,465 INFO L256 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 43 conjuncts are in the unsatisfiable core [2025-04-13 23:49:16,466 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:49:16,578 INFO L134 CoverageAnalysis]: Checked inductivity of 936 backedges. 0 proven. 936 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:49:16,578 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:49:16,981 INFO L134 CoverageAnalysis]: Checked inductivity of 936 backedges. 0 proven. 936 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:49:16,981 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [728633749] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:49:16,981 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:49:16,981 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40, 40] total 44 [2025-04-13 23:49:16,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1324291139] [2025-04-13 23:49:16,981 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:49:16,981 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2025-04-13 23:49:16,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:49:16,982 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2025-04-13 23:49:16,982 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=457, Invalid=1613, Unknown=0, NotChecked=0, Total=2070 [2025-04-13 23:49:16,982 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 21 [2025-04-13 23:49:16,983 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 477 places, 411 transitions, 13627 flow. Second operand has 46 states, 46 states have (on average 4.108695652173913) internal successors, (189), 46 states have internal predecessors, (189), 0 states have call successors, (0), 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-04-13 23:49:16,983 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 23:49:16,983 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 21 [2025-04-13 23:49:16,983 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 23:49:22,386 INFO L116 PetriNetUnfolderBase]: 5611/9759 cut-off events. [2025-04-13 23:49:22,386 INFO L117 PetriNetUnfolderBase]: For 6208180/6208180 co-relation queries the response was YES. [2025-04-13 23:49:22,464 INFO L83 FinitePrefix]: Finished finitePrefix Result has 183803 conditions, 9759 events. 5611/9759 cut-off events. For 6208180/6208180 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 49309 event pairs, 43 based on Foata normal form. 36/7059 useless extension candidates. Maximal degree in co-relation 183605. Up to 2650 conditions per place. [2025-04-13 23:49:22,510 INFO L140 encePairwiseOnDemand]: 15/21 looper letters, 308 selfloop transitions, 452 changer transitions 179/939 dead transitions. [2025-04-13 23:49:22,510 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 537 places, 939 transitions, 38198 flow [2025-04-13 23:49:22,510 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2025-04-13 23:49:22,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2025-04-13 23:49:22,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 761 transitions. [2025-04-13 23:49:22,512 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.43140589569161 [2025-04-13 23:49:22,512 INFO L175 Difference]: Start difference. First operand has 477 places, 411 transitions, 13627 flow. Second operand 84 states and 761 transitions. [2025-04-13 23:49:22,512 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 537 places, 939 transitions, 38198 flow [2025-04-13 23:49:37,061 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 485 places, 939 transitions, 27874 flow, removed 5029 selfloop flow, removed 52 redundant places. [2025-04-13 23:49:37,072 INFO L231 Difference]: Finished difference. Result has 497 places, 483 transitions, 11900 flow [2025-04-13 23:49:37,073 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=8731, PETRI_DIFFERENCE_MINUEND_PLACES=402, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=411, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=381, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=84, PETRI_FLOW=11900, PETRI_PLACES=497, PETRI_TRANSITIONS=483} [2025-04-13 23:49:37,073 INFO L279 CegarLoopForPetriNet]: 22 programPoint places, 475 predicate places. [2025-04-13 23:49:37,074 INFO L485 AbstractCegarLoop]: Abstraction has has 497 places, 483 transitions, 11900 flow [2025-04-13 23:49:37,074 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 46 states have (on average 4.108695652173913) internal successors, (189), 46 states have internal predecessors, (189), 0 states have call successors, (0), 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-04-13 23:49:37,074 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 23:49:37,074 INFO L206 CegarLoopForPetriNet]: trace histogram [20, 20, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:49:37,082 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2025-04-13 23:49:37,275 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-04-13 23:49:37,275 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 23:49:37,276 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:49:37,277 INFO L85 PathProgramCache]: Analyzing trace with hash 1759399820, now seen corresponding path program 9 times [2025-04-13 23:49:37,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:49:37,277 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [43407966] [2025-04-13 23:49:37,277 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 23:49:37,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:49:37,283 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 88 statements into 37 equivalence classes. [2025-04-13 23:49:37,310 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 37 check-sat command(s) and asserted 88 of 88 statements. [2025-04-13 23:49:37,310 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 37 check-sat command(s) [2025-04-13 23:49:37,310 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-13 23:49:37,310 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-13 23:49:37,312 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-04-13 23:49:37,323 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-04-13 23:49:37,323 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:49:37,323 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-13 23:49:37,350 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-13 23:49:37,350 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-13 23:49:37,351 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2025-04-13 23:49:37,352 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 3 remaining) [2025-04-13 23:49:37,352 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2025-04-13 23:49:37,352 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-04-13 23:49:37,352 INFO L422 BasicCegarLoop]: Path program histogram: [9, 3, 2, 2, 1] [2025-04-13 23:49:37,449 INFO L242 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-04-13 23:49:37,450 INFO L171 ceAbstractionStarter]: Computing trace abstraction results [2025-04-13 23:49:37,454 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.04 11:49:37 BasicIcfg [2025-04-13 23:49:37,454 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-04-13 23:49:37,455 INFO L158 Benchmark]: Toolchain (without parser) took 53692.64ms. Allocated memory was 142.6MB in the beginning and 1.3GB in the end (delta: 1.2GB). Free memory was 98.7MB in the beginning and 667.1MB in the end (delta: -568.3MB). Peak memory consumption was 583.6MB. Max. memory is 8.0GB. [2025-04-13 23:49:37,455 INFO L158 Benchmark]: CDTParser took 0.35ms. Allocated memory is still 155.2MB. Free memory is still 84.3MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-13 23:49:37,455 INFO L158 Benchmark]: CACSL2BoogieTranslator took 400.27ms. Allocated memory is still 142.6MB. Free memory was 98.7MB in the beginning and 76.3MB in the end (delta: 22.4MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. [2025-04-13 23:49:37,455 INFO L158 Benchmark]: Boogie Procedure Inliner took 30.88ms. Allocated memory is still 142.6MB. Free memory was 76.3MB in the beginning and 74.5MB in the end (delta: 1.8MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-13 23:49:37,456 INFO L158 Benchmark]: Boogie Preprocessor took 25.32ms. Allocated memory is still 142.6MB. Free memory was 74.5MB in the beginning and 72.8MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-13 23:49:37,456 INFO L158 Benchmark]: IcfgBuilder took 373.17ms. Allocated memory is still 142.6MB. Free memory was 72.8MB in the beginning and 52.0MB in the end (delta: 20.9MB). Peak memory consumption was 21.0MB. Max. memory is 8.0GB. [2025-04-13 23:49:37,456 INFO L158 Benchmark]: TraceAbstraction took 52857.91ms. Allocated memory was 142.6MB in the beginning and 1.3GB in the end (delta: 1.2GB). Free memory was 52.0MB in the beginning and 667.1MB in the end (delta: -615.1MB). Peak memory consumption was 541.7MB. Max. memory is 8.0GB. [2025-04-13 23:49:37,459 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.35ms. Allocated memory is still 155.2MB. Free memory is still 84.3MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 400.27ms. Allocated memory is still 142.6MB. Free memory was 98.7MB in the beginning and 76.3MB in the end (delta: 22.4MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 30.88ms. Allocated memory is still 142.6MB. Free memory was 76.3MB in the beginning and 74.5MB in the end (delta: 1.8MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 25.32ms. Allocated memory is still 142.6MB. Free memory was 74.5MB in the beginning and 72.8MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 8.0GB. * IcfgBuilder took 373.17ms. Allocated memory is still 142.6MB. Free memory was 72.8MB in the beginning and 52.0MB in the end (delta: 20.9MB). Peak memory consumption was 21.0MB. Max. memory is 8.0GB. * TraceAbstraction took 52857.91ms. Allocated memory was 142.6MB in the beginning and 1.3GB in the end (delta: 1.2GB). Free memory was 52.0MB in the beginning and 667.1MB in the end (delta: -615.1MB). Peak memory consumption was 541.7MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 722]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L694] 0 int i = 3, j = 6; [L712] 0 pthread_t id1, id2; [L713] FCALL, FORK 0 pthread_create(&id1, ((void *)0), t1, ((void *)0)) VAL [\at(arg, Pre)={0:0}, \at(argc, Pre)=51, \at(argv, Pre)={49:50}, argc=51, i=3, id1=-1, j=6] [L696] 1 int k = 0; [L696] COND TRUE 1 k < 20 VAL [\at(arg, Pre)={0:0}, arg={0:0}, i=3, j=6, k=0] [L714] FCALL, FORK 0 pthread_create(&id2, ((void *)0), t2, ((void *)0)) VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \at(argc, Pre)=51, \at(argv, Pre)={49:50}, arg={0:0}, argc=51, i=3, id1=-1, id2=0, j=6, k=0] [L698] 1 i = j + 1 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, i=7, j=6, k=0] [L704] 2 int k = 0; [L704] COND TRUE 2 k < 20 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, arg={0:0}, i=7, j=6, k=0, k=0] [L696] 1 k++ [L696] COND TRUE 1 k < 20 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, arg={0:0}, i=7, j=6, k=0, k=1] [L706] 2 j = i + 1 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, arg={0:0}, i=7, j=8, k=0, k=1] [L704] 2 k++ [L704] COND TRUE 2 k < 20 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, arg={0:0}, i=7, j=8, k=1, k=1] [L698] 1 i = j + 1 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, arg={0:0}, i=9, j=8, k=1, k=1] [L696] 1 k++ [L696] COND TRUE 1 k < 20 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, arg={0:0}, i=9, j=8, k=1, k=2] [L706] 2 j = i + 1 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, arg={0:0}, i=9, j=10, k=1, k=2] [L704] 2 k++ [L704] COND TRUE 2 k < 20 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, arg={0:0}, i=9, j=10, k=2, k=2] [L698] 1 i = j + 1 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, arg={0:0}, i=11, j=10, k=2, k=2] [L696] 1 k++ [L696] COND TRUE 1 k < 20 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, arg={0:0}, i=11, j=10, k=2, k=3] [L706] 2 j = i + 1 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, arg={0:0}, i=11, j=12, k=2, k=3] [L704] 2 k++ [L704] COND TRUE 2 k < 20 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, arg={0:0}, i=11, j=12, k=3, k=3] [L698] 1 i = j + 1 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, arg={0:0}, i=13, j=12, k=3, k=3] [L696] 1 k++ [L696] COND TRUE 1 k < 20 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, arg={0:0}, i=13, j=12, k=3, k=4] [L706] 2 j = i + 1 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, arg={0:0}, i=13, j=14, k=3, k=4] [L704] 2 k++ [L704] COND TRUE 2 k < 20 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, arg={0:0}, i=13, j=14, k=4, k=4] [L698] 1 i = j + 1 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, arg={0:0}, i=15, j=14, k=4, k=4] [L696] 1 k++ [L696] COND TRUE 1 k < 20 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, arg={0:0}, i=15, j=14, k=4, k=5] [L706] 2 j = i + 1 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, arg={0:0}, i=15, j=16, k=4, k=5] [L704] 2 k++ [L704] COND TRUE 2 k < 20 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, arg={0:0}, i=15, j=16, k=5, k=5] [L698] 1 i = j + 1 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, arg={0:0}, i=17, j=16, k=5, k=5] [L696] 1 k++ [L696] COND TRUE 1 k < 20 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, arg={0:0}, i=17, j=16, k=5, k=6] [L706] 2 j = i + 1 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, arg={0:0}, i=17, j=18, k=5, k=6] [L704] 2 k++ [L704] COND TRUE 2 k < 20 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, arg={0:0}, i=17, j=18, k=6, k=6] [L698] 1 i = j + 1 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, arg={0:0}, i=19, j=18, k=6, k=6] [L696] 1 k++ [L696] COND TRUE 1 k < 20 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, arg={0:0}, i=19, j=18, k=6, k=7] [L706] 2 j = i + 1 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, arg={0:0}, i=19, j=20, k=6, k=7] [L704] 2 k++ [L704] COND TRUE 2 k < 20 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, arg={0:0}, i=19, j=20, k=7, k=7] [L698] 1 i = j + 1 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, arg={0:0}, i=21, j=20, k=7, k=7] [L696] 1 k++ [L696] COND TRUE 1 k < 20 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, arg={0:0}, i=21, j=20, k=7, k=8] [L706] 2 j = i + 1 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, arg={0:0}, i=21, j=22, k=7, k=8] [L704] 2 k++ [L704] COND TRUE 2 k < 20 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, arg={0:0}, i=21, j=22, k=8, k=8] [L698] 1 i = j + 1 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, arg={0:0}, i=23, j=22, k=8, k=8] [L696] 1 k++ [L696] COND TRUE 1 k < 20 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, arg={0:0}, i=23, j=22, k=8, k=9] [L706] 2 j = i + 1 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, arg={0:0}, i=23, j=24, k=8, k=9] [L704] 2 k++ [L704] COND TRUE 2 k < 20 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, arg={0:0}, i=23, j=24, k=9, k=9] [L698] 1 i = j + 1 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, arg={0:0}, i=25, j=24, k=9, k=9] [L696] 1 k++ [L696] COND TRUE 1 k < 20 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, arg={0:0}, i=25, j=24, k=10, k=9] [L706] 2 j = i + 1 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, arg={0:0}, i=25, j=26, k=10, k=9] [L704] 2 k++ [L704] COND TRUE 2 k < 20 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, arg={0:0}, i=25, j=26, k=10, k=10] [L698] 1 i = j + 1 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, arg={0:0}, i=27, j=26, k=10, k=10] [L696] 1 k++ [L696] COND TRUE 1 k < 20 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, arg={0:0}, i=27, j=26, k=10, k=11] [L706] 2 j = i + 1 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, arg={0:0}, i=27, j=28, k=10, k=11] [L704] 2 k++ [L704] COND TRUE 2 k < 20 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, arg={0:0}, i=27, j=28, k=11, k=11] [L698] 1 i = j + 1 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, arg={0:0}, i=29, j=28, k=11, k=11] [L696] 1 k++ [L696] COND TRUE 1 k < 20 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, arg={0:0}, i=29, j=28, k=11, k=12] [L706] 2 j = i + 1 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, arg={0:0}, i=29, j=30, k=11, k=12] [L704] 2 k++ [L704] COND TRUE 2 k < 20 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, arg={0:0}, i=29, j=30, k=12, k=12] [L698] 1 i = j + 1 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, arg={0:0}, i=31, j=30, k=12, k=12] [L696] 1 k++ [L696] COND TRUE 1 k < 20 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, arg={0:0}, i=31, j=30, k=12, k=13] [L706] 2 j = i + 1 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, arg={0:0}, i=31, j=32, k=12, k=13] [L704] 2 k++ [L704] COND TRUE 2 k < 20 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, arg={0:0}, i=31, j=32, k=13, k=13] [L698] 1 i = j + 1 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, arg={0:0}, i=33, j=32, k=13, k=13] [L696] 1 k++ [L696] COND TRUE 1 k < 20 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, arg={0:0}, i=33, j=32, k=13, k=14] [L706] 2 j = i + 1 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, arg={0:0}, i=33, j=34, k=13, k=14] [L704] 2 k++ [L704] COND TRUE 2 k < 20 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, arg={0:0}, i=33, j=34, k=14, k=14] [L698] 1 i = j + 1 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, arg={0:0}, i=35, j=34, k=14, k=14] [L696] 1 k++ [L696] COND TRUE 1 k < 20 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, arg={0:0}, i=35, j=34, k=14, k=15] [L706] 2 j = i + 1 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, arg={0:0}, i=35, j=36, k=14, k=15] [L704] 2 k++ [L704] COND TRUE 2 k < 20 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, arg={0:0}, i=35, j=36, k=15, k=15] [L698] 1 i = j + 1 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, arg={0:0}, i=37, j=36, k=15, k=15] [L696] 1 k++ [L696] COND TRUE 1 k < 20 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, arg={0:0}, i=37, j=36, k=15, k=16] [L706] 2 j = i + 1 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, arg={0:0}, i=37, j=38, k=15, k=16] [L704] 2 k++ [L704] COND TRUE 2 k < 20 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, arg={0:0}, i=37, j=38, k=16, k=16] [L698] 1 i = j + 1 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, arg={0:0}, i=39, j=38, k=16, k=16] [L696] 1 k++ [L696] COND TRUE 1 k < 20 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, arg={0:0}, i=39, j=38, k=16, k=17] [L706] 2 j = i + 1 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, arg={0:0}, i=39, j=40, k=16, k=17] [L704] 2 k++ [L704] COND TRUE 2 k < 20 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, arg={0:0}, i=39, j=40, k=17, k=17] [L698] 1 i = j + 1 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, arg={0:0}, i=41, j=40, k=17, k=17] [L696] 1 k++ [L696] COND TRUE 1 k < 20 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, arg={0:0}, i=41, j=40, k=17, k=18] [L706] 2 j = i + 1 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, arg={0:0}, i=41, j=42, k=17, k=18] [L704] 2 k++ [L704] COND TRUE 2 k < 20 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, arg={0:0}, i=41, j=42, k=18, k=18] [L698] 1 i = j + 1 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, arg={0:0}, i=43, j=42, k=18, k=18] [L696] 1 k++ [L696] COND TRUE 1 k < 20 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, arg={0:0}, i=43, j=42, k=18, k=19] [L706] 2 j = i + 1 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, arg={0:0}, i=43, j=44, k=18, k=19] [L704] 2 k++ [L704] COND TRUE 2 k < 20 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, arg={0:0}, i=43, j=44, k=19, k=19] [L716] 0 int condI = i >= (2*20 +6); VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \at(argc, Pre)=51, \at(argv, Pre)={49:50}, arg={0:0}, arg={0:0}, argc=51, condI=0, i=43, id1=-1, id2=0, j=44, k=19, k=19] [L698] 1 i = j + 1 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, arg={0:0}, i=45, j=44, k=19, k=19] [L706] 2 j = i + 1 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, arg={0:0}, i=45, j=46, k=19, k=19] [L719] 0 int condJ = j >= (2*20 +6); VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \at(argc, Pre)=51, \at(argv, Pre)={49:50}, arg={0:0}, arg={0:0}, argc=51, condI=0, condJ=1, i=45, id1=-1, id2=0, j=46, k=19, k=19] [L721] COND TRUE 0 condI || condJ [L722] 0 reach_error() VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \at(argc, Pre)=51, \at(argv, Pre)={49:50}, arg={0:0}, arg={0:0}, argc=51, condI=0, condJ=1, i=45, id1=-1, id2=0, j=46, k=19, k=19] - UnprovableResult [Line: 714]: 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: 713]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 28 locations, 33 edges, 3 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: 52.7s, OverallIterations: 17, TraceHistogramMax: 20, PathProgramHistogramMax: 9, EmptinessCheckTime: 0.0s, AutomataDifference: 43.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 8734 SdHoareTripleChecker+Valid, 4.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 8734 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 3.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 477 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 6568 IncrementalHoareTripleChecker+Invalid, 7045 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 477 mSolverCounterUnsat, 0 mSDtfsCounter, 6568 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1292 GetRequests, 478 SyntacticMatches, 35 SemanticMatches, 779 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22295 ImplicationChecksByTransitivity, 8.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=13627occurred in iteration=15, InterpolantAutomatonStates: 578, 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.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 5.8s InterpolantComputationTime, 792 NumberOfCodeBlocks, 792 NumberOfCodeBlocksAsserted, 113 NumberOfCheckSat, 988 ConstructedInterpolants, 0 QuantifiedInterpolants, 4089 SizeOfPredicates, 130 NumberOfNonLiveVariables, 1330 ConjunctsInSsa, 182 ConjunctsInUnsatCore, 36 InterpolantComputations, 6 PerfectInterpolantSequences, 1/4269 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-04-13 23:49:37,470 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...