/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.xml -s ../benchexec/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --traceabstraction.automaton.type.used.in.concurrency.analysis PETRI_NET -i ../../../trunk/examples/svcomp/pthread/triangular-longer-2.i -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.cfg-lbe-improvements-94356ea-m [2025-04-13 19:15:01,201 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-13 19:15:01,252 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 19:15:01,259 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-13 19:15:01,259 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-13 19:15:01,282 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-13 19:15:01,283 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-13 19:15:01,283 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-13 19:15:01,283 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-13 19:15:01,283 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-13 19:15:01,283 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-13 19:15:01,283 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-13 19:15:01,283 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-13 19:15:01,283 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-13 19:15:01,283 INFO L153 SettingsManager]: * Use SBE=true [2025-04-13 19:15:01,284 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-13 19:15:01,284 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-13 19:15:01,284 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-13 19:15:01,285 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-13 19:15:01,285 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-13 19:15:01,285 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-13 19:15:01,285 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-13 19:15:01,285 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-13 19:15:01,285 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-13 19:15:01,285 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-13 19:15:01,286 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-13 19:15:01,286 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-13 19:15:01,286 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-13 19:15:01,286 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-13 19:15:01,286 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 19:15:01,286 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 19:15:01,286 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 19:15:01,286 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 19:15:01,286 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-13 19:15:01,286 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 19:15:01,286 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 19:15:01,286 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 19:15:01,286 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 19:15:01,287 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-13 19:15:01,287 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-13 19:15:01,287 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-13 19:15:01,287 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-13 19:15:01,287 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-13 19:15:01,287 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-13 19:15:01,287 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-13 19:15:01,287 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-13 19:15:01,287 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-13 19:15:01,287 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 [2025-04-13 19:15:01,491 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-13 19:15:01,499 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-13 19:15:01,500 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-13 19:15:01,501 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-13 19:15:01,501 INFO L274 PluginConnector]: CDTParser initialized [2025-04-13 19:15:01,503 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread/triangular-longer-2.i [2025-04-13 19:15:02,750 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d91ddd95b/214eefcec69f418ca617dffd8ae5b11f/FLAG5111908ef [2025-04-13 19:15:02,964 INFO L389 CDTParser]: Found 1 translation units. [2025-04-13 19:15:02,964 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread/triangular-longer-2.i [2025-04-13 19:15:02,973 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d91ddd95b/214eefcec69f418ca617dffd8ae5b11f/FLAG5111908ef [2025-04-13 19:15:03,800 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d91ddd95b/214eefcec69f418ca617dffd8ae5b11f [2025-04-13 19:15:03,802 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-13 19:15:03,803 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-04-13 19:15:03,804 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-13 19:15:03,804 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-13 19:15:03,807 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-13 19:15:03,807 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 07:15:03" (1/1) ... [2025-04-13 19:15:03,808 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4f2f312a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:15:03, skipping insertion in model container [2025-04-13 19:15:03,808 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 07:15:03" (1/1) ... [2025-04-13 19:15:03,834 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-13 19:15:04,143 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-longer-2.i[30963,30976] [2025-04-13 19:15:04,147 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 19:15:04,155 INFO L200 MainTranslator]: Completed pre-run [2025-04-13 19:15:04,194 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-longer-2.i[30963,30976] [2025-04-13 19:15:04,194 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 19:15:04,220 INFO L204 MainTranslator]: Completed translation [2025-04-13 19:15:04,220 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:15:04 WrapperNode [2025-04-13 19:15:04,220 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-13 19:15:04,221 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-13 19:15:04,221 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-13 19:15:04,221 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-13 19:15:04,225 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:15:04" (1/1) ... [2025-04-13 19:15:04,233 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:15:04" (1/1) ... [2025-04-13 19:15:04,245 INFO L138 Inliner]: procedures = 168, calls = 16, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 37 [2025-04-13 19:15:04,246 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-13 19:15:04,246 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-13 19:15:04,246 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-13 19:15:04,246 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-13 19:15:04,251 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:15:04" (1/1) ... [2025-04-13 19:15:04,252 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:15:04" (1/1) ... [2025-04-13 19:15:04,259 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:15:04" (1/1) ... [2025-04-13 19:15:04,271 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 19:15:04,271 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:15:04" (1/1) ... [2025-04-13 19:15:04,271 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:15:04" (1/1) ... [2025-04-13 19:15:04,274 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:15:04" (1/1) ... [2025-04-13 19:15:04,274 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:15:04" (1/1) ... [2025-04-13 19:15:04,276 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:15:04" (1/1) ... [2025-04-13 19:15:04,277 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:15:04" (1/1) ... [2025-04-13 19:15:04,277 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:15:04" (1/1) ... [2025-04-13 19:15:04,279 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-13 19:15:04,280 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-13 19:15:04,280 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-13 19:15:04,280 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-13 19:15:04,281 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:15:04" (1/1) ... [2025-04-13 19:15:04,284 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 19:15:04,293 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 19:15:04,308 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 19:15:04,311 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 19:15:04,325 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2025-04-13 19:15:04,326 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2025-04-13 19:15:04,326 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2025-04-13 19:15:04,326 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2025-04-13 19:15:04,326 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-04-13 19:15:04,326 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-13 19:15:04,326 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-04-13 19:15:04,326 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-04-13 19:15:04,326 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-13 19:15:04,326 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-13 19:15:04,327 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-13 19:15:04,422 INFO L234 CfgBuilder]: Building ICFG [2025-04-13 19:15:04,424 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-13 19:15:04,546 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-13 19:15:04,547 INFO L289 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-13 19:15:04,547 INFO L294 CfgBuilder]: Performing block encoding [2025-04-13 19:15:04,631 WARN L179 LargeBlockEncoding]: Complex 2:2 sequential composition. Such compositions can cause exponential blowup and should not occur in structured programs. [2025-04-13 19:15:04,634 WARN L179 LargeBlockEncoding]: Complex 2:2 sequential composition. Such compositions can cause exponential blowup and should not occur in structured programs. [2025-04-13 19:15:04,638 INFO L313 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-13 19:15:04,638 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.04 07:15:04 BoogieIcfgContainer [2025-04-13 19:15:04,638 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-13 19:15:04,640 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-13 19:15:04,640 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-13 19:15:04,644 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-13 19:15:04,645 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.04 07:15:03" (1/3) ... [2025-04-13 19:15:04,645 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7206e61b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 07:15:04, skipping insertion in model container [2025-04-13 19:15:04,645 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:15:04" (2/3) ... [2025-04-13 19:15:04,645 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7206e61b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 07:15:04, skipping insertion in model container [2025-04-13 19:15:04,645 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.04 07:15:04" (3/3) ... [2025-04-13 19:15:04,646 INFO L128 eAbstractionObserver]: Analyzing ICFG triangular-longer-2.i [2025-04-13 19:15:04,656 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-13 19:15:04,657 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG triangular-longer-2.i that has 3 procedures, 18 locations, 19 edges, 1 initial locations, 2 loop locations, and 1 error locations. [2025-04-13 19:15:04,657 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-13 19:15:04,689 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-04-13 19:15:04,712 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 24 places, 21 transitions, 50 flow [2025-04-13 19:15:04,728 INFO L116 PetriNetUnfolderBase]: 4/19 cut-off events. [2025-04-13 19:15:04,729 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-13 19:15:04,730 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 4. Compared 22 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 19:15:04,730 INFO L82 GeneralOperation]: Start removeDead. Operand has 24 places, 21 transitions, 50 flow [2025-04-13 19:15:04,732 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 22 places, 19 transitions, 44 flow [2025-04-13 19:15:04,738 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-13 19:15:04,751 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;@44a41512, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-13 19:15:04,751 INFO L341 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2025-04-13 19:15:04,756 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-13 19:15:04,756 INFO L116 PetriNetUnfolderBase]: 4/17 cut-off events. [2025-04-13 19:15:04,756 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-13 19:15:04,756 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:15:04,757 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:15:04,757 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 19:15:04,760 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:15:04,761 INFO L85 PathProgramCache]: Analyzing trace with hash -1193666932, now seen corresponding path program 1 times [2025-04-13 19:15:04,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:15:04,766 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [71082481] [2025-04-13 19:15:04,766 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:15:04,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:15:04,826 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-13 19:15:04,847 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-13 19:15:04,847 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:15:04,847 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:15:05,048 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 19:15:05,050 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:15:05,050 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [71082481] [2025-04-13 19:15:05,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [71082481] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:15:05,051 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:15:05,051 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 19:15:05,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1115164479] [2025-04-13 19:15:05,052 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:15:05,056 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 19:15:05,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:15:05,075 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 19:15:05,075 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-13 19:15:05,092 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 21 [2025-04-13 19:15:05,094 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 19:15:05,094 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:15:05,094 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 21 [2025-04-13 19:15:05,094 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:15:05,341 INFO L116 PetriNetUnfolderBase]: 260/405 cut-off events. [2025-04-13 19:15:05,341 INFO L117 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-04-13 19:15:05,342 INFO L83 FinitePrefix]: Finished finitePrefix Result has 826 conditions, 405 events. 260/405 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 1307 event pairs, 53 based on Foata normal form. 0/329 useless extension candidates. Maximal degree in co-relation 816. Up to 305 conditions per place. [2025-04-13 19:15:05,348 INFO L140 encePairwiseOnDemand]: 12/21 looper letters, 26 selfloop transitions, 7 changer transitions 22/55 dead transitions. [2025-04-13 19:15:05,348 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 29 places, 55 transitions, 229 flow [2025-04-13 19:15:05,349 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-13 19:15:05,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-04-13 19:15:05,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 85 transitions. [2025-04-13 19:15:05,359 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5059523809523809 [2025-04-13 19:15:05,360 INFO L175 Difference]: Start difference. First operand has 22 places, 19 transitions, 44 flow. Second operand 8 states and 85 transitions. [2025-04-13 19:15:05,360 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 29 places, 55 transitions, 229 flow [2025-04-13 19:15:05,365 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 27 places, 55 transitions, 226 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-13 19:15:05,367 INFO L231 Difference]: Finished difference. Result has 33 places, 22 transitions, 91 flow [2025-04-13 19:15:05,369 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=13, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=91, PETRI_PLACES=33, PETRI_TRANSITIONS=22} [2025-04-13 19:15:05,372 INFO L279 CegarLoopForPetriNet]: 22 programPoint places, 11 predicate places. [2025-04-13 19:15:05,372 INFO L485 AbstractCegarLoop]: Abstraction has has 33 places, 22 transitions, 91 flow [2025-04-13 19:15:05,372 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 19:15:05,372 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:15:05,374 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:15:05,374 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-13 19:15:05,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 19:15:05,375 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:15:05,375 INFO L85 PathProgramCache]: Analyzing trace with hash 1416918806, now seen corresponding path program 1 times [2025-04-13 19:15:05,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:15:05,375 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [514384072] [2025-04-13 19:15:05,375 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:15:05,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:15:05,383 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-13 19:15:05,392 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-13 19:15:05,392 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:15:05,392 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:15:05,530 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 19:15:05,531 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:15:05,531 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [514384072] [2025-04-13 19:15:05,531 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [514384072] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:15:05,531 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:15:05,531 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 19:15:05,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [229684082] [2025-04-13 19:15:05,531 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:15:05,535 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-13 19:15:05,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:15:05,536 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-13 19:15:05,536 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-04-13 19:15:05,559 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 21 [2025-04-13 19:15:05,560 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 22 transitions, 91 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 19:15:05,560 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:15:05,560 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 21 [2025-04-13 19:15:05,560 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:15:05,721 INFO L116 PetriNetUnfolderBase]: 196/318 cut-off events. [2025-04-13 19:15:05,721 INFO L117 PetriNetUnfolderBase]: For 316/316 co-relation queries the response was YES. [2025-04-13 19:15:05,724 INFO L83 FinitePrefix]: Finished finitePrefix Result has 915 conditions, 318 events. 196/318 cut-off events. For 316/316 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 972 event pairs, 41 based on Foata normal form. 15/280 useless extension candidates. Maximal degree in co-relation 899. Up to 187 conditions per place. [2025-04-13 19:15:05,725 INFO L140 encePairwiseOnDemand]: 16/21 looper letters, 27 selfloop transitions, 8 changer transitions 12/47 dead transitions. [2025-04-13 19:15:05,726 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 47 transitions, 273 flow [2025-04-13 19:15:05,727 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-13 19:15:05,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-13 19:15:05,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 55 transitions. [2025-04-13 19:15:05,728 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4365079365079365 [2025-04-13 19:15:05,728 INFO L175 Difference]: Start difference. First operand has 33 places, 22 transitions, 91 flow. Second operand 6 states and 55 transitions. [2025-04-13 19:15:05,728 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 47 transitions, 273 flow [2025-04-13 19:15:05,729 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 47 transitions, 269 flow, removed 2 selfloop flow, removed 2 redundant places. [2025-04-13 19:15:05,732 INFO L231 Difference]: Finished difference. Result has 36 places, 25 transitions, 135 flow [2025-04-13 19:15:05,732 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=87, PETRI_DIFFERENCE_MINUEND_PLACES=27, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=135, PETRI_PLACES=36, PETRI_TRANSITIONS=25} [2025-04-13 19:15:05,733 INFO L279 CegarLoopForPetriNet]: 22 programPoint places, 14 predicate places. [2025-04-13 19:15:05,733 INFO L485 AbstractCegarLoop]: Abstraction has has 36 places, 25 transitions, 135 flow [2025-04-13 19:15:05,733 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 19:15:05,733 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:15:05,733 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:15:05,733 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-13 19:15:05,733 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 19:15:05,733 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:15:05,734 INFO L85 PathProgramCache]: Analyzing trace with hash -344557750, now seen corresponding path program 1 times [2025-04-13 19:15:05,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:15:05,734 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [418332079] [2025-04-13 19:15:05,734 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:15:05,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:15:05,742 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-13 19:15:05,747 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-13 19:15:05,747 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:15:05,747 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:15:05,851 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 19:15:05,851 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:15:05,852 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [418332079] [2025-04-13 19:15:05,852 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [418332079] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:15:05,852 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:15:05,852 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 19:15:05,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1378379108] [2025-04-13 19:15:05,852 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:15:05,852 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-13 19:15:05,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:15:05,853 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-13 19:15:05,853 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-04-13 19:15:05,867 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 21 [2025-04-13 19:15:05,867 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 25 transitions, 135 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 19:15:05,868 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:15:05,868 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 21 [2025-04-13 19:15:05,868 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:15:06,060 INFO L116 PetriNetUnfolderBase]: 301/492 cut-off events. [2025-04-13 19:15:06,060 INFO L117 PetriNetUnfolderBase]: For 880/880 co-relation queries the response was YES. [2025-04-13 19:15:06,061 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1630 conditions, 492 events. 301/492 cut-off events. For 880/880 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1692 event pairs, 65 based on Foata normal form. 24/428 useless extension candidates. Maximal degree in co-relation 1610. Up to 231 conditions per place. [2025-04-13 19:15:06,064 INFO L140 encePairwiseOnDemand]: 15/21 looper letters, 44 selfloop transitions, 11 changer transitions 19/74 dead transitions. [2025-04-13 19:15:06,065 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 74 transitions, 493 flow [2025-04-13 19:15:06,065 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-13 19:15:06,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-04-13 19:15:06,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 86 transitions. [2025-04-13 19:15:06,067 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.455026455026455 [2025-04-13 19:15:06,067 INFO L175 Difference]: Start difference. First operand has 36 places, 25 transitions, 135 flow. Second operand 9 states and 86 transitions. [2025-04-13 19:15:06,067 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 74 transitions, 493 flow [2025-04-13 19:15:06,070 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 74 transitions, 451 flow, removed 20 selfloop flow, removed 3 redundant places. [2025-04-13 19:15:06,073 INFO L231 Difference]: Finished difference. Result has 46 places, 32 transitions, 231 flow [2025-04-13 19:15:06,073 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=125, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=231, PETRI_PLACES=46, PETRI_TRANSITIONS=32} [2025-04-13 19:15:06,074 INFO L279 CegarLoopForPetriNet]: 22 programPoint places, 24 predicate places. [2025-04-13 19:15:06,074 INFO L485 AbstractCegarLoop]: Abstraction has has 46 places, 32 transitions, 231 flow [2025-04-13 19:15:06,074 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 19:15:06,074 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:15:06,074 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:15:06,074 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-13 19:15:06,074 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 19:15:06,075 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:15:06,075 INFO L85 PathProgramCache]: Analyzing trace with hash -344096470, now seen corresponding path program 2 times [2025-04-13 19:15:06,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:15:06,075 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1665688280] [2025-04-13 19:15:06,076 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 19:15:06,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:15:06,084 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 10 statements into 1 equivalence classes. [2025-04-13 19:15:06,087 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-13 19:15:06,087 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 19:15:06,087 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:15:06,183 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 19:15:06,183 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:15:06,183 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1665688280] [2025-04-13 19:15:06,183 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1665688280] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:15:06,183 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:15:06,183 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 19:15:06,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1928193718] [2025-04-13 19:15:06,184 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:15:06,184 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-13 19:15:06,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:15:06,184 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-13 19:15:06,184 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-04-13 19:15:06,195 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 21 [2025-04-13 19:15:06,195 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 32 transitions, 231 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 19:15:06,195 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:15:06,195 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 21 [2025-04-13 19:15:06,195 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:15:06,344 INFO L116 PetriNetUnfolderBase]: 256/429 cut-off events. [2025-04-13 19:15:06,344 INFO L117 PetriNetUnfolderBase]: For 1460/1460 co-relation queries the response was YES. [2025-04-13 19:15:06,345 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1619 conditions, 429 events. 256/429 cut-off events. For 1460/1460 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1482 event pairs, 65 based on Foata normal form. 39/386 useless extension candidates. Maximal degree in co-relation 1593. Up to 208 conditions per place. [2025-04-13 19:15:06,347 INFO L140 encePairwiseOnDemand]: 15/21 looper letters, 38 selfloop transitions, 11 changer transitions 25/74 dead transitions. [2025-04-13 19:15:06,347 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 74 transitions, 591 flow [2025-04-13 19:15:06,347 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-13 19:15:06,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-04-13 19:15:06,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 76 transitions. [2025-04-13 19:15:06,348 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4523809523809524 [2025-04-13 19:15:06,348 INFO L175 Difference]: Start difference. First operand has 46 places, 32 transitions, 231 flow. Second operand 8 states and 76 transitions. [2025-04-13 19:15:06,348 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 74 transitions, 591 flow [2025-04-13 19:15:06,354 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 74 transitions, 547 flow, removed 22 selfloop flow, removed 2 redundant places. [2025-04-13 19:15:06,357 INFO L231 Difference]: Finished difference. Result has 53 places, 33 transitions, 262 flow [2025-04-13 19:15:06,357 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=205, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=262, PETRI_PLACES=53, PETRI_TRANSITIONS=33} [2025-04-13 19:15:06,358 INFO L279 CegarLoopForPetriNet]: 22 programPoint places, 31 predicate places. [2025-04-13 19:15:06,359 INFO L485 AbstractCegarLoop]: Abstraction has has 53 places, 33 transitions, 262 flow [2025-04-13 19:15:06,359 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 19:15:06,359 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:15:06,359 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:15:06,359 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-13 19:15:06,359 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 19:15:06,360 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:15:06,360 INFO L85 PathProgramCache]: Analyzing trace with hash 250552494, now seen corresponding path program 1 times [2025-04-13 19:15:06,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:15:06,360 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [840197328] [2025-04-13 19:15:06,360 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:15:06,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:15:06,365 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-04-13 19:15:06,374 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-13 19:15:06,374 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:15:06,374 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:15:06,474 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 19:15:06,474 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:15:06,474 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [840197328] [2025-04-13 19:15:06,474 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [840197328] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:15:06,474 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:15:06,474 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-13 19:15:06,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2095698991] [2025-04-13 19:15:06,474 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:15:06,474 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-13 19:15:06,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:15:06,475 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-13 19:15:06,475 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-04-13 19:15:06,482 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 21 [2025-04-13 19:15:06,483 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 33 transitions, 262 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 19:15:06,483 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:15:06,483 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 21 [2025-04-13 19:15:06,483 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:15:06,671 INFO L116 PetriNetUnfolderBase]: 400/660 cut-off events. [2025-04-13 19:15:06,671 INFO L117 PetriNetUnfolderBase]: For 3375/3375 co-relation queries the response was YES. [2025-04-13 19:15:06,672 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2743 conditions, 660 events. 400/660 cut-off events. For 3375/3375 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 2471 event pairs, 43 based on Foata normal form. 27/543 useless extension candidates. Maximal degree in co-relation 2712. Up to 181 conditions per place. [2025-04-13 19:15:06,675 INFO L140 encePairwiseOnDemand]: 15/21 looper letters, 54 selfloop transitions, 20 changer transitions 21/95 dead transitions. [2025-04-13 19:15:06,675 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 95 transitions, 804 flow [2025-04-13 19:15:06,675 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-04-13 19:15:06,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-04-13 19:15:06,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 106 transitions. [2025-04-13 19:15:06,676 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4588744588744589 [2025-04-13 19:15:06,676 INFO L175 Difference]: Start difference. First operand has 53 places, 33 transitions, 262 flow. Second operand 11 states and 106 transitions. [2025-04-13 19:15:06,676 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 95 transitions, 804 flow [2025-04-13 19:15:06,680 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 95 transitions, 709 flow, removed 38 selfloop flow, removed 7 redundant places. [2025-04-13 19:15:06,681 INFO L231 Difference]: Finished difference. Result has 60 places, 39 transitions, 372 flow [2025-04-13 19:15:06,681 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=225, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=372, PETRI_PLACES=60, PETRI_TRANSITIONS=39} [2025-04-13 19:15:06,681 INFO L279 CegarLoopForPetriNet]: 22 programPoint places, 38 predicate places. [2025-04-13 19:15:06,682 INFO L485 AbstractCegarLoop]: Abstraction has has 60 places, 39 transitions, 372 flow [2025-04-13 19:15:06,682 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 19:15:06,682 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:15:06,682 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:15:06,682 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-13 19:15:06,682 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 19:15:06,682 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:15:06,682 INFO L85 PathProgramCache]: Analyzing trace with hash -651136364, now seen corresponding path program 2 times [2025-04-13 19:15:06,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:15:06,682 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1479640185] [2025-04-13 19:15:06,683 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 19:15:06,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:15:06,691 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 12 statements into 1 equivalence classes. [2025-04-13 19:15:06,693 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-13 19:15:06,693 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 19:15:06,693 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:15:06,755 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 19:15:06,755 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:15:06,755 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1479640185] [2025-04-13 19:15:06,755 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1479640185] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:15:06,755 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:15:06,755 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-13 19:15:06,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1094779042] [2025-04-13 19:15:06,756 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:15:06,756 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-13 19:15:06,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:15:06,756 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-13 19:15:06,756 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-04-13 19:15:06,764 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 21 [2025-04-13 19:15:06,764 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 39 transitions, 372 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 19:15:06,765 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:15:06,765 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 21 [2025-04-13 19:15:06,765 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:15:06,928 INFO L116 PetriNetUnfolderBase]: 337/570 cut-off events. [2025-04-13 19:15:06,929 INFO L117 PetriNetUnfolderBase]: For 4312/4312 co-relation queries the response was YES. [2025-04-13 19:15:06,930 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2598 conditions, 570 events. 337/570 cut-off events. For 4312/4312 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 2119 event pairs, 43 based on Foata normal form. 45/489 useless extension candidates. Maximal degree in co-relation 2564. Up to 151 conditions per place. [2025-04-13 19:15:06,932 INFO L140 encePairwiseOnDemand]: 15/21 looper letters, 41 selfloop transitions, 20 changer transitions 29/90 dead transitions. [2025-04-13 19:15:06,932 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 90 transitions, 888 flow [2025-04-13 19:15:06,932 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-13 19:15:06,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-04-13 19:15:06,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 93 transitions. [2025-04-13 19:15:06,933 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.44285714285714284 [2025-04-13 19:15:06,933 INFO L175 Difference]: Start difference. First operand has 60 places, 39 transitions, 372 flow. Second operand 10 states and 93 transitions. [2025-04-13 19:15:06,933 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 90 transitions, 888 flow [2025-04-13 19:15:06,939 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 90 transitions, 779 flow, removed 45 selfloop flow, removed 6 redundant places. [2025-04-13 19:15:06,940 INFO L231 Difference]: Finished difference. Result has 65 places, 40 transitions, 392 flow [2025-04-13 19:15:06,940 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=307, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=392, PETRI_PLACES=65, PETRI_TRANSITIONS=40} [2025-04-13 19:15:06,941 INFO L279 CegarLoopForPetriNet]: 22 programPoint places, 43 predicate places. [2025-04-13 19:15:06,941 INFO L485 AbstractCegarLoop]: Abstraction has has 65 places, 40 transitions, 392 flow [2025-04-13 19:15:06,941 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 19:15:06,941 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:15:06,941 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:15:06,941 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-04-13 19:15:06,941 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 19:15:06,942 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:15:06,942 INFO L85 PathProgramCache]: Analyzing trace with hash 255482424, now seen corresponding path program 3 times [2025-04-13 19:15:06,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:15:06,942 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1743340115] [2025-04-13 19:15:06,942 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 19:15:06,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:15:06,946 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 12 statements into 1 equivalence classes. [2025-04-13 19:15:06,948 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-13 19:15:06,948 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 19:15:06,948 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:15:07,006 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 19:15:07,006 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:15:07,006 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1743340115] [2025-04-13 19:15:07,006 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1743340115] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:15:07,006 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:15:07,006 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-13 19:15:07,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1047241382] [2025-04-13 19:15:07,006 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:15:07,006 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-13 19:15:07,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:15:07,007 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-13 19:15:07,007 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-04-13 19:15:07,023 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 21 [2025-04-13 19:15:07,024 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 40 transitions, 392 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 19:15:07,024 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:15:07,024 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 21 [2025-04-13 19:15:07,024 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:15:07,172 INFO L116 PetriNetUnfolderBase]: 361/609 cut-off events. [2025-04-13 19:15:07,172 INFO L117 PetriNetUnfolderBase]: For 4299/4299 co-relation queries the response was YES. [2025-04-13 19:15:07,174 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2748 conditions, 609 events. 361/609 cut-off events. For 4299/4299 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 2435 event pairs, 105 based on Foata normal form. 18/493 useless extension candidates. Maximal degree in co-relation 2712. Up to 351 conditions per place. [2025-04-13 19:15:07,176 INFO L140 encePairwiseOnDemand]: 15/21 looper letters, 50 selfloop transitions, 16 changer transitions 17/83 dead transitions. [2025-04-13 19:15:07,176 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 83 transitions, 848 flow [2025-04-13 19:15:07,176 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-13 19:15:07,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-04-13 19:15:07,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 82 transitions. [2025-04-13 19:15:07,177 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.43386243386243384 [2025-04-13 19:15:07,177 INFO L175 Difference]: Start difference. First operand has 65 places, 40 transitions, 392 flow. Second operand 9 states and 82 transitions. [2025-04-13 19:15:07,178 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 83 transitions, 848 flow [2025-04-13 19:15:07,184 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 83 transitions, 762 flow, removed 26 selfloop flow, removed 8 redundant places. [2025-04-13 19:15:07,186 INFO L231 Difference]: Finished difference. Result has 66 places, 45 transitions, 455 flow [2025-04-13 19:15:07,187 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=334, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=455, PETRI_PLACES=66, PETRI_TRANSITIONS=45} [2025-04-13 19:15:07,187 INFO L279 CegarLoopForPetriNet]: 22 programPoint places, 44 predicate places. [2025-04-13 19:15:07,187 INFO L485 AbstractCegarLoop]: Abstraction has has 66 places, 45 transitions, 455 flow [2025-04-13 19:15:07,187 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 19:15:07,187 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:15:07,187 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:15:07,187 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-04-13 19:15:07,188 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 19:15:07,188 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:15:07,188 INFO L85 PathProgramCache]: Analyzing trace with hash 606806871, now seen corresponding path program 1 times [2025-04-13 19:15:07,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:15:07,188 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2134177113] [2025-04-13 19:15:07,188 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:15:07,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:15:07,194 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-13 19:15:07,197 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-13 19:15:07,197 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:15:07,197 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:15:07,286 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 19:15:07,286 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:15:07,286 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2134177113] [2025-04-13 19:15:07,286 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2134177113] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 19:15:07,286 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [960031599] [2025-04-13 19:15:07,286 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:15:07,286 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 19:15:07,286 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 19:15:07,288 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 19:15:07,290 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 19:15:07,320 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-13 19:15:07,329 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-13 19:15:07,329 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:15:07,329 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:15:07,334 INFO L256 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-04-13 19:15:07,336 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 19:15:07,428 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 19:15:07,429 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 19:15:07,510 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 19:15:07,511 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [960031599] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 19:15:07,511 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 19:15:07,511 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2025-04-13 19:15:07,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [144618788] [2025-04-13 19:15:07,511 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 19:15:07,511 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-04-13 19:15:07,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:15:07,511 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-04-13 19:15:07,511 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2025-04-13 19:15:07,522 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 21 [2025-04-13 19:15:07,522 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 45 transitions, 455 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 19:15:07,522 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:15:07,523 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 21 [2025-04-13 19:15:07,523 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:15:07,916 INFO L116 PetriNetUnfolderBase]: 595/978 cut-off events. [2025-04-13 19:15:07,916 INFO L117 PetriNetUnfolderBase]: For 8586/8586 co-relation queries the response was YES. [2025-04-13 19:15:07,919 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4621 conditions, 978 events. 595/978 cut-off events. For 8586/8586 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 3770 event pairs, 37 based on Foata normal form. 45/799 useless extension candidates. Maximal degree in co-relation 4584. Up to 201 conditions per place. [2025-04-13 19:15:07,922 INFO L140 encePairwiseOnDemand]: 15/21 looper letters, 66 selfloop transitions, 37 changer transitions 54/157 dead transitions. [2025-04-13 19:15:07,923 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 157 transitions, 1577 flow [2025-04-13 19:15:07,923 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-04-13 19:15:07,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2025-04-13 19:15:07,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 177 transitions. [2025-04-13 19:15:07,924 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.44360902255639095 [2025-04-13 19:15:07,924 INFO L175 Difference]: Start difference. First operand has 66 places, 45 transitions, 455 flow. Second operand 19 states and 177 transitions. [2025-04-13 19:15:07,924 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 157 transitions, 1577 flow [2025-04-13 19:15:07,933 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 157 transitions, 1512 flow, removed 26 selfloop flow, removed 4 redundant places. [2025-04-13 19:15:07,935 INFO L231 Difference]: Finished difference. Result has 88 places, 61 transitions, 822 flow [2025-04-13 19:15:07,936 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=420, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=822, PETRI_PLACES=88, PETRI_TRANSITIONS=61} [2025-04-13 19:15:07,938 INFO L279 CegarLoopForPetriNet]: 22 programPoint places, 66 predicate places. [2025-04-13 19:15:07,938 INFO L485 AbstractCegarLoop]: Abstraction has has 88 places, 61 transitions, 822 flow [2025-04-13 19:15:07,939 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 19:15:07,939 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:15:07,939 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:15:07,947 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-04-13 19:15:08,143 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 19:15:08,143 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 19:15:08,143 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:15:08,144 INFO L85 PathProgramCache]: Analyzing trace with hash -1664695908, now seen corresponding path program 1 times [2025-04-13 19:15:08,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:15:08,144 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [78618541] [2025-04-13 19:15:08,144 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:15:08,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:15:08,148 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-04-13 19:15:08,152 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-04-13 19:15:08,152 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:15:08,152 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:15:08,251 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 19:15:08,252 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:15:08,252 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [78618541] [2025-04-13 19:15:08,252 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [78618541] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 19:15:08,252 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1341115857] [2025-04-13 19:15:08,252 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:15:08,252 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 19:15:08,252 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 19:15:08,254 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 19:15:08,255 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 19:15:08,286 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-04-13 19:15:08,296 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-04-13 19:15:08,297 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:15:08,297 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:15:08,297 INFO L256 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-04-13 19:15:08,298 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 19:15:08,351 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 19:15:08,351 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 19:15:08,499 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 19:15:08,499 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1341115857] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 19:15:08,499 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 19:15:08,499 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 15 [2025-04-13 19:15:08,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1305924438] [2025-04-13 19:15:08,500 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 19:15:08,500 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-04-13 19:15:08,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:15:08,500 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-04-13 19:15:08,500 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=205, Unknown=0, NotChecked=0, Total=272 [2025-04-13 19:15:08,508 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 21 [2025-04-13 19:15:08,509 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 61 transitions, 822 flow. Second operand has 17 states, 17 states have (on average 4.294117647058823) internal successors, (73), 17 states have internal predecessors, (73), 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 19:15:08,509 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:15:08,509 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 21 [2025-04-13 19:15:08,509 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:15:08,975 INFO L116 PetriNetUnfolderBase]: 793/1338 cut-off events. [2025-04-13 19:15:08,975 INFO L117 PetriNetUnfolderBase]: For 21793/21793 co-relation queries the response was YES. [2025-04-13 19:15:08,978 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7406 conditions, 1338 events. 793/1338 cut-off events. For 21793/21793 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 5230 event pairs, 191 based on Foata normal form. 81/1087 useless extension candidates. Maximal degree in co-relation 7361. Up to 723 conditions per place. [2025-04-13 19:15:08,984 INFO L140 encePairwiseOnDemand]: 15/21 looper letters, 95 selfloop transitions, 27 changer transitions 86/208 dead transitions. [2025-04-13 19:15:08,984 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 208 transitions, 2598 flow [2025-04-13 19:15:08,984 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-04-13 19:15:08,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2025-04-13 19:15:08,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 223 transitions. [2025-04-13 19:15:08,986 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4247619047619048 [2025-04-13 19:15:08,986 INFO L175 Difference]: Start difference. First operand has 88 places, 61 transitions, 822 flow. Second operand 25 states and 223 transitions. [2025-04-13 19:15:08,986 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 107 places, 208 transitions, 2598 flow [2025-04-13 19:15:09,007 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 208 transitions, 2071 flow, removed 250 selfloop flow, removed 10 redundant places. [2025-04-13 19:15:09,009 INFO L231 Difference]: Finished difference. Result has 116 places, 75 transitions, 926 flow [2025-04-13 19:15:09,009 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=579, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=25, PETRI_FLOW=926, PETRI_PLACES=116, PETRI_TRANSITIONS=75} [2025-04-13 19:15:09,009 INFO L279 CegarLoopForPetriNet]: 22 programPoint places, 94 predicate places. [2025-04-13 19:15:09,009 INFO L485 AbstractCegarLoop]: Abstraction has has 116 places, 75 transitions, 926 flow [2025-04-13 19:15:09,010 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 4.294117647058823) internal successors, (73), 17 states have internal predecessors, (73), 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 19:15:09,010 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:15:09,010 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:15:09,017 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-04-13 19:15:09,210 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,SelfDestructingSolverStorable8 [2025-04-13 19:15:09,210 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 19:15:09,211 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:15:09,211 INFO L85 PathProgramCache]: Analyzing trace with hash 274783128, now seen corresponding path program 2 times [2025-04-13 19:15:09,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:15:09,211 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1856802442] [2025-04-13 19:15:09,211 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 19:15:09,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:15:09,215 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 20 statements into 2 equivalence classes. [2025-04-13 19:15:09,219 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 20 of 20 statements. [2025-04-13 19:15:09,219 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 19:15:09,219 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:15:09,303 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 19:15:09,303 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:15:09,303 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1856802442] [2025-04-13 19:15:09,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1856802442] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 19:15:09,303 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1594400136] [2025-04-13 19:15:09,303 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 19:15:09,303 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 19:15:09,304 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 19:15:09,305 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 19:15:09,307 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 19:15:09,333 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 20 statements into 2 equivalence classes. [2025-04-13 19:15:09,343 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 20 of 20 statements. [2025-04-13 19:15:09,344 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 19:15:09,344 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:15:09,344 INFO L256 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-04-13 19:15:09,345 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 19:15:09,388 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 19:15:09,388 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 19:15:09,507 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 19:15:09,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1594400136] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 19:15:09,507 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 19:15:09,507 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 15 [2025-04-13 19:15:09,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1853528850] [2025-04-13 19:15:09,507 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 19:15:09,507 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-04-13 19:15:09,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:15:09,508 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-04-13 19:15:09,508 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=214, Unknown=0, NotChecked=0, Total=272 [2025-04-13 19:15:09,516 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 21 [2025-04-13 19:15:09,517 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 116 places, 75 transitions, 926 flow. Second operand has 17 states, 17 states have (on average 4.352941176470588) internal successors, (74), 17 states have internal predecessors, (74), 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 19:15:09,517 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:15:09,517 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 21 [2025-04-13 19:15:09,517 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:15:10,323 INFO L116 PetriNetUnfolderBase]: 1387/2364 cut-off events. [2025-04-13 19:15:10,324 INFO L117 PetriNetUnfolderBase]: For 70230/70230 co-relation queries the response was YES. [2025-04-13 19:15:10,334 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14670 conditions, 2364 events. 1387/2364 cut-off events. For 70230/70230 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 11312 event pairs, 115 based on Foata normal form. 81/1825 useless extension candidates. Maximal degree in co-relation 14612. Up to 497 conditions per place. [2025-04-13 19:15:10,346 INFO L140 encePairwiseOnDemand]: 15/21 looper letters, 127 selfloop transitions, 82 changer transitions 85/294 dead transitions. [2025-04-13 19:15:10,346 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 138 places, 294 transitions, 4090 flow [2025-04-13 19:15:10,346 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2025-04-13 19:15:10,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2025-04-13 19:15:10,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 291 transitions. [2025-04-13 19:15:10,350 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4330357142857143 [2025-04-13 19:15:10,350 INFO L175 Difference]: Start difference. First operand has 116 places, 75 transitions, 926 flow. Second operand 32 states and 291 transitions. [2025-04-13 19:15:10,350 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 138 places, 294 transitions, 4090 flow [2025-04-13 19:15:10,405 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 125 places, 294 transitions, 3473 flow, removed 299 selfloop flow, removed 13 redundant places. [2025-04-13 19:15:10,409 INFO L231 Difference]: Finished difference. Result has 148 places, 118 transitions, 1759 flow [2025-04-13 19:15:10,410 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=759, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=47, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=32, PETRI_FLOW=1759, PETRI_PLACES=148, PETRI_TRANSITIONS=118} [2025-04-13 19:15:10,410 INFO L279 CegarLoopForPetriNet]: 22 programPoint places, 126 predicate places. [2025-04-13 19:15:10,410 INFO L485 AbstractCegarLoop]: Abstraction has has 148 places, 118 transitions, 1759 flow [2025-04-13 19:15:10,410 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 4.352941176470588) internal successors, (74), 17 states have internal predecessors, (74), 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 19:15:10,410 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:15:10,410 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:15:10,416 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-04-13 19:15:10,611 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 19:15:10,611 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 19:15:10,612 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:15:10,612 INFO L85 PathProgramCache]: Analyzing trace with hash -1996156246, now seen corresponding path program 3 times [2025-04-13 19:15:10,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:15:10,612 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1583713705] [2025-04-13 19:15:10,612 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 19:15:10,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:15:10,616 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 20 statements into 4 equivalence classes. [2025-04-13 19:15:10,627 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 20 of 20 statements. [2025-04-13 19:15:10,627 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-04-13 19:15:10,627 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:15:10,736 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 19:15:10,736 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:15:10,736 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1583713705] [2025-04-13 19:15:10,736 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1583713705] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 19:15:10,736 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [808387858] [2025-04-13 19:15:10,736 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 19:15:10,736 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 19:15:10,736 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 19:15:10,738 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 19:15:10,740 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 19:15:10,771 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 20 statements into 4 equivalence classes. [2025-04-13 19:15:10,781 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 20 of 20 statements. [2025-04-13 19:15:10,781 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-04-13 19:15:10,781 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:15:10,782 INFO L256 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-04-13 19:15:10,782 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 19:15:10,821 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 19:15:10,822 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 19:15:10,913 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 19:15:10,914 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [808387858] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 19:15:10,914 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 19:15:10,914 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 16 [2025-04-13 19:15:10,914 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1740757323] [2025-04-13 19:15:10,914 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 19:15:10,914 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-04-13 19:15:10,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:15:10,914 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-04-13 19:15:10,915 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=238, Unknown=0, NotChecked=0, Total=306 [2025-04-13 19:15:10,936 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 21 [2025-04-13 19:15:10,937 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 148 places, 118 transitions, 1759 flow. Second operand has 18 states, 18 states have (on average 4.277777777777778) internal successors, (77), 18 states have internal predecessors, (77), 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 19:15:10,937 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:15:10,937 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 21 [2025-04-13 19:15:10,937 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:15:11,797 INFO L116 PetriNetUnfolderBase]: 1774/3012 cut-off events. [2025-04-13 19:15:11,797 INFO L117 PetriNetUnfolderBase]: For 158062/158062 co-relation queries the response was YES. [2025-04-13 19:15:11,807 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21841 conditions, 3012 events. 1774/3012 cut-off events. For 158062/158062 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 15079 event pairs, 29 based on Foata normal form. 117/2335 useless extension candidates. Maximal degree in co-relation 21768. Up to 653 conditions per place. [2025-04-13 19:15:11,818 INFO L140 encePairwiseOnDemand]: 15/21 looper letters, 124 selfloop transitions, 123 changer transitions 109/356 dead transitions. [2025-04-13 19:15:11,818 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 174 places, 356 transitions, 6116 flow [2025-04-13 19:15:11,819 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2025-04-13 19:15:11,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2025-04-13 19:15:11,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 329 transitions. [2025-04-13 19:15:11,820 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4351851851851852 [2025-04-13 19:15:11,820 INFO L175 Difference]: Start difference. First operand has 148 places, 118 transitions, 1759 flow. Second operand 36 states and 329 transitions. [2025-04-13 19:15:11,820 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 174 places, 356 transitions, 6116 flow [2025-04-13 19:15:11,986 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 159 places, 356 transitions, 5206 flow, removed 440 selfloop flow, removed 15 redundant places. [2025-04-13 19:15:11,989 INFO L231 Difference]: Finished difference. Result has 182 places, 153 transitions, 2619 flow [2025-04-13 19:15:11,989 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=1399, PETRI_DIFFERENCE_MINUEND_PLACES=124, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=118, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=89, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=36, PETRI_FLOW=2619, PETRI_PLACES=182, PETRI_TRANSITIONS=153} [2025-04-13 19:15:11,990 INFO L279 CegarLoopForPetriNet]: 22 programPoint places, 160 predicate places. [2025-04-13 19:15:11,990 INFO L485 AbstractCegarLoop]: Abstraction has has 182 places, 153 transitions, 2619 flow [2025-04-13 19:15:11,990 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 4.277777777777778) internal successors, (77), 18 states have internal predecessors, (77), 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 19:15:11,990 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:15:11,990 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:15:11,996 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 19:15:12,194 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 19:15:12,194 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 19:15:12,194 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:15:12,194 INFO L85 PathProgramCache]: Analyzing trace with hash 2008155505, now seen corresponding path program 4 times [2025-04-13 19:15:12,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:15:12,195 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [490017737] [2025-04-13 19:15:12,195 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 19:15:12,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:15:12,198 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 26 statements into 2 equivalence classes. [2025-04-13 19:15:12,209 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-04-13 19:15:12,209 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 19:15:12,209 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:15:12,322 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:15:12,323 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:15:12,323 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [490017737] [2025-04-13 19:15:12,323 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [490017737] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 19:15:12,323 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [455148238] [2025-04-13 19:15:12,323 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 19:15:12,323 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 19:15:12,323 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 19:15:12,324 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 19:15:12,326 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 19:15:12,355 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 26 statements into 2 equivalence classes. [2025-04-13 19:15:12,365 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-04-13 19:15:12,365 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 19:15:12,365 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:15:12,365 INFO L256 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-04-13 19:15:12,366 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 19:15:12,416 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:15:12,416 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 19:15:12,564 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:15:12,564 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [455148238] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 19:15:12,564 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 19:15:12,564 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 24 [2025-04-13 19:15:12,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [951939529] [2025-04-13 19:15:12,564 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 19:15:12,564 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-04-13 19:15:12,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:15:12,565 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-04-13 19:15:12,565 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=152, Invalid=498, Unknown=0, NotChecked=0, Total=650 [2025-04-13 19:15:12,595 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 21 [2025-04-13 19:15:12,595 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 182 places, 153 transitions, 2619 flow. Second operand has 26 states, 26 states have (on average 4.038461538461538) internal successors, (105), 26 states have internal predecessors, (105), 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 19:15:12,595 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:15:12,595 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 21 [2025-04-13 19:15:12,595 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:15:13,921 INFO L116 PetriNetUnfolderBase]: 2584/4326 cut-off events. [2025-04-13 19:15:13,921 INFO L117 PetriNetUnfolderBase]: For 342221/342221 co-relation queries the response was YES. [2025-04-13 19:15:13,937 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37410 conditions, 4326 events. 2584/4326 cut-off events. For 342221/342221 co-relation queries the response was YES. Maximal size of possible extension queue 95. Compared 20666 event pairs, 67 based on Foata normal form. 99/3295 useless extension candidates. Maximal degree in co-relation 37324. Up to 971 conditions per place. [2025-04-13 19:15:13,952 INFO L140 encePairwiseOnDemand]: 15/21 looper letters, 164 selfloop transitions, 178 changer transitions 144/486 dead transitions. [2025-04-13 19:15:13,952 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 221 places, 486 transitions, 10298 flow [2025-04-13 19:15:13,953 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2025-04-13 19:15:13,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2025-04-13 19:15:13,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 453 transitions. [2025-04-13 19:15:13,954 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4402332361516035 [2025-04-13 19:15:13,954 INFO L175 Difference]: Start difference. First operand has 182 places, 153 transitions, 2619 flow. Second operand 49 states and 453 transitions. [2025-04-13 19:15:13,954 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 221 places, 486 transitions, 10298 flow [2025-04-13 19:15:14,319 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 201 places, 486 transitions, 8582 flow, removed 825 selfloop flow, removed 20 redundant places. [2025-04-13 19:15:14,324 INFO L231 Difference]: Finished difference. Result has 232 places, 214 transitions, 4201 flow [2025-04-13 19:15:14,324 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=2041, PETRI_DIFFERENCE_MINUEND_PLACES=153, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=153, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=120, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=49, PETRI_FLOW=4201, PETRI_PLACES=232, PETRI_TRANSITIONS=214} [2025-04-13 19:15:14,324 INFO L279 CegarLoopForPetriNet]: 22 programPoint places, 210 predicate places. [2025-04-13 19:15:14,324 INFO L485 AbstractCegarLoop]: Abstraction has has 232 places, 214 transitions, 4201 flow [2025-04-13 19:15:14,324 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 4.038461538461538) internal successors, (105), 26 states have internal predecessors, (105), 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 19:15:14,324 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:15:14,325 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 9, 8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:15:14,330 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 19:15:14,525 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,SelfDestructingSolverStorable11 [2025-04-13 19:15:14,525 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 19:15:14,526 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:15:14,526 INFO L85 PathProgramCache]: Analyzing trace with hash -2122151448, now seen corresponding path program 5 times [2025-04-13 19:15:14,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:15:14,527 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1513790197] [2025-04-13 19:15:14,527 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 19:15:14,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:15:14,531 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 44 statements into 16 equivalence classes. [2025-04-13 19:15:14,538 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 16 check-sat command(s) and asserted 44 of 44 statements. [2025-04-13 19:15:14,538 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 16 check-sat command(s) [2025-04-13 19:15:14,538 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:15:14,811 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 0 proven. 199 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 19:15:14,811 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:15:14,811 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1513790197] [2025-04-13 19:15:14,812 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1513790197] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 19:15:14,812 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [613295464] [2025-04-13 19:15:14,812 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 19:15:14,812 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 19:15:14,812 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 19:15:14,814 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 19:15:14,814 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 19:15:14,842 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 44 statements into 16 equivalence classes. [2025-04-13 19:15:14,858 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 16 check-sat command(s) and asserted 44 of 44 statements. [2025-04-13 19:15:14,858 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 16 check-sat command(s) [2025-04-13 19:15:14,858 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:15:14,859 INFO L256 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-04-13 19:15:14,862 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 19:15:14,997 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 0 proven. 199 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 19:15:14,997 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 19:15:15,373 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 0 proven. 199 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 19:15:15,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [613295464] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 19:15:15,374 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 19:15:15,374 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20, 20] total 39 [2025-04-13 19:15:15,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1196259136] [2025-04-13 19:15:15,374 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 19:15:15,374 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2025-04-13 19:15:15,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:15:15,375 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2025-04-13 19:15:15,376 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=391, Invalid=1249, Unknown=0, NotChecked=0, Total=1640 [2025-04-13 19:15:15,393 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 21 [2025-04-13 19:15:15,393 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 232 places, 214 transitions, 4201 flow. Second operand has 41 states, 41 states have (on average 4.121951219512195) internal successors, (169), 41 states have internal predecessors, (169), 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 19:15:15,393 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:15:15,393 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 21 [2025-04-13 19:15:15,394 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:15:16,574 INFO L116 PetriNetUnfolderBase]: 2656/4506 cut-off events. [2025-04-13 19:15:16,574 INFO L117 PetriNetUnfolderBase]: For 529203/529203 co-relation queries the response was YES. [2025-04-13 19:15:16,592 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43014 conditions, 4506 events. 2656/4506 cut-off events. For 529203/529203 co-relation queries the response was YES. Maximal size of possible extension queue 98. Compared 22406 event pairs, 1013 based on Foata normal form. 63/3367 useless extension candidates. Maximal degree in co-relation 42906. Up to 3585 conditions per place. [2025-04-13 19:15:16,603 INFO L140 encePairwiseOnDemand]: 15/21 looper letters, 261 selfloop transitions, 47 changer transitions 92/400 dead transitions. [2025-04-13 19:15:16,604 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 253 places, 400 transitions, 9659 flow [2025-04-13 19:15:16,604 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2025-04-13 19:15:16,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2025-04-13 19:15:16,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 283 transitions. [2025-04-13 19:15:16,605 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4083694083694084 [2025-04-13 19:15:16,605 INFO L175 Difference]: Start difference. First operand has 232 places, 214 transitions, 4201 flow. Second operand 33 states and 283 transitions. [2025-04-13 19:15:16,605 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 253 places, 400 transitions, 9659 flow [2025-04-13 19:15:17,280 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 236 places, 400 transitions, 7159 flow, removed 1227 selfloop flow, removed 17 redundant places. [2025-04-13 19:15:17,285 INFO L231 Difference]: Finished difference. Result has 251 places, 230 transitions, 3746 flow [2025-04-13 19:15:17,285 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=3087, PETRI_DIFFERENCE_MINUEND_PLACES=204, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=214, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=175, PETRI_DIFFERENCE_SUBTRAHEND_STATES=33, PETRI_FLOW=3746, PETRI_PLACES=251, PETRI_TRANSITIONS=230} [2025-04-13 19:15:17,285 INFO L279 CegarLoopForPetriNet]: 22 programPoint places, 229 predicate places. [2025-04-13 19:15:17,286 INFO L485 AbstractCegarLoop]: Abstraction has has 251 places, 230 transitions, 3746 flow [2025-04-13 19:15:17,286 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 41 states have (on average 4.121951219512195) internal successors, (169), 41 states have internal predecessors, (169), 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 19:15:17,286 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:15:17,286 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 9, 8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:15:17,291 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-04-13 19:15:17,486 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 19:15:17,487 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 19:15:17,487 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:15:17,487 INFO L85 PathProgramCache]: Analyzing trace with hash 506294244, now seen corresponding path program 6 times [2025-04-13 19:15:17,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:15:17,487 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1366625209] [2025-04-13 19:15:17,487 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 19:15:17,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:15:17,492 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 44 statements into 15 equivalence classes. [2025-04-13 19:15:17,500 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 15 check-sat command(s) and asserted 44 of 44 statements. [2025-04-13 19:15:17,500 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 15 check-sat command(s) [2025-04-13 19:15:17,500 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:15:17,800 INFO L134 CoverageAnalysis]: Checked inductivity of 157 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 19:15:17,800 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:15:17,800 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1366625209] [2025-04-13 19:15:17,801 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1366625209] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 19:15:17,801 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [435136230] [2025-04-13 19:15:17,801 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 19:15:17,801 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 19:15:17,801 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 19:15:17,802 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 19:15:17,804 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 19:15:17,836 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 44 statements into 15 equivalence classes. [2025-04-13 19:15:17,853 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 15 check-sat command(s) and asserted 44 of 44 statements. [2025-04-13 19:15:17,853 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 15 check-sat command(s) [2025-04-13 19:15:17,853 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:15:17,854 INFO L256 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-04-13 19:15:17,855 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 19:15:17,936 INFO L134 CoverageAnalysis]: Checked inductivity of 157 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 19:15:17,936 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 19:15:18,293 INFO L134 CoverageAnalysis]: Checked inductivity of 157 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 19:15:18,294 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [435136230] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 19:15:18,294 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 19:15:18,294 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20, 20] total 39 [2025-04-13 19:15:18,294 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [887530656] [2025-04-13 19:15:18,294 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 19:15:18,294 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2025-04-13 19:15:18,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:15:18,295 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2025-04-13 19:15:18,295 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=335, Invalid=1305, Unknown=0, NotChecked=0, Total=1640 [2025-04-13 19:15:18,302 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 21 [2025-04-13 19:15:18,302 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 251 places, 230 transitions, 3746 flow. Second operand has 41 states, 41 states have (on average 4.121951219512195) internal successors, (169), 41 states have internal predecessors, (169), 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 19:15:18,302 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:15:18,302 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 21 [2025-04-13 19:15:18,302 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:15:19,976 INFO L116 PetriNetUnfolderBase]: 3160/5514 cut-off events. [2025-04-13 19:15:19,976 INFO L117 PetriNetUnfolderBase]: For 509416/509416 co-relation queries the response was YES. [2025-04-13 19:15:20,000 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46895 conditions, 5514 events. 3160/5514 cut-off events. For 509416/509416 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 29123 event pairs, 587 based on Foata normal form. 63/4039 useless extension candidates. Maximal degree in co-relation 46782. Up to 2398 conditions per place. [2025-04-13 19:15:20,015 INFO L140 encePairwiseOnDemand]: 15/21 looper letters, 265 selfloop transitions, 167 changer transitions 129/561 dead transitions. [2025-04-13 19:15:20,015 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 296 places, 561 transitions, 10833 flow [2025-04-13 19:15:20,017 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2025-04-13 19:15:20,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2025-04-13 19:15:20,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 449 transitions. [2025-04-13 19:15:20,018 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.40341419586702604 [2025-04-13 19:15:20,018 INFO L175 Difference]: Start difference. First operand has 251 places, 230 transitions, 3746 flow. Second operand 53 states and 449 transitions. [2025-04-13 19:15:20,018 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 296 places, 561 transitions, 10833 flow [2025-04-13 19:15:20,854 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 275 places, 561 transitions, 10070 flow, removed 354 selfloop flow, removed 21 redundant places. [2025-04-13 19:15:20,860 INFO L231 Difference]: Finished difference. Result has 294 places, 286 transitions, 5028 flow [2025-04-13 19:15:20,861 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=3325, PETRI_DIFFERENCE_MINUEND_PLACES=223, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=230, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=119, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=94, PETRI_DIFFERENCE_SUBTRAHEND_STATES=53, PETRI_FLOW=5028, PETRI_PLACES=294, PETRI_TRANSITIONS=286} [2025-04-13 19:15:20,861 INFO L279 CegarLoopForPetriNet]: 22 programPoint places, 272 predicate places. [2025-04-13 19:15:20,861 INFO L485 AbstractCegarLoop]: Abstraction has has 294 places, 286 transitions, 5028 flow [2025-04-13 19:15:20,861 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 41 states have (on average 4.121951219512195) internal successors, (169), 41 states have internal predecessors, (169), 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 19:15:20,861 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:15:20,861 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 9, 8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:15:20,867 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 19:15:21,062 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 19:15:21,062 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 19:15:21,063 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:15:21,063 INFO L85 PathProgramCache]: Analyzing trace with hash 349263324, now seen corresponding path program 7 times [2025-04-13 19:15:21,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:15:21,063 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [973299999] [2025-04-13 19:15:21,063 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 19:15:21,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:15:21,067 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-04-13 19:15:21,071 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-04-13 19:15:21,072 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:15:21,072 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:15:21,307 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 0 proven. 106 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 19:15:21,307 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:15:21,308 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [973299999] [2025-04-13 19:15:21,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [973299999] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 19:15:21,308 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [973695277] [2025-04-13 19:15:21,308 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 19:15:21,308 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 19:15:21,308 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 19:15:21,310 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 19:15:21,311 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 19:15:21,345 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-04-13 19:15:21,357 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-04-13 19:15:21,357 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:15:21,357 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:15:21,359 INFO L256 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-04-13 19:15:21,360 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 19:15:21,427 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 0 proven. 106 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 19:15:21,427 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 19:15:21,720 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 0 proven. 106 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 19:15:21,721 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [973695277] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 19:15:21,721 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 19:15:21,721 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20, 20] total 39 [2025-04-13 19:15:21,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1753011554] [2025-04-13 19:15:21,721 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 19:15:21,721 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2025-04-13 19:15:21,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:15:21,722 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2025-04-13 19:15:21,722 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=265, Invalid=1375, Unknown=0, NotChecked=0, Total=1640 [2025-04-13 19:15:21,730 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 21 [2025-04-13 19:15:21,730 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 294 places, 286 transitions, 5028 flow. Second operand has 41 states, 41 states have (on average 4.121951219512195) internal successors, (169), 41 states have internal predecessors, (169), 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 19:15:21,730 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:15:21,730 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 21 [2025-04-13 19:15:21,730 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:15:23,908 INFO L116 PetriNetUnfolderBase]: 3988/7152 cut-off events. [2025-04-13 19:15:23,908 INFO L117 PetriNetUnfolderBase]: For 853661/853661 co-relation queries the response was YES. [2025-04-13 19:15:24,018 INFO L83 FinitePrefix]: Finished finitePrefix Result has 67589 conditions, 7152 events. 3988/7152 cut-off events. For 853661/853661 co-relation queries the response was YES. Maximal size of possible extension queue 114. Compared 40808 event pairs, 205 based on Foata normal form. 81/5155 useless extension candidates. Maximal degree in co-relation 67463. Up to 1901 conditions per place. [2025-04-13 19:15:24,041 INFO L140 encePairwiseOnDemand]: 15/21 looper letters, 229 selfloop transitions, 315 changer transitions 151/695 dead transitions. [2025-04-13 19:15:24,041 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 345 places, 695 transitions, 15025 flow [2025-04-13 19:15:24,042 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2025-04-13 19:15:24,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2025-04-13 19:15:24,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 513 transitions. [2025-04-13 19:15:24,045 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.41404358353510895 [2025-04-13 19:15:24,045 INFO L175 Difference]: Start difference. First operand has 294 places, 286 transitions, 5028 flow. Second operand 59 states and 513 transitions. [2025-04-13 19:15:24,045 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 345 places, 695 transitions, 15025 flow [2025-04-13 19:15:25,734 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 316 places, 695 transitions, 13544 flow, removed 640 selfloop flow, removed 29 redundant places. [2025-04-13 19:15:25,742 INFO L231 Difference]: Finished difference. Result has 339 places, 378 transitions, 7326 flow [2025-04-13 19:15:25,743 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=4263, PETRI_DIFFERENCE_MINUEND_PLACES=258, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=286, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=234, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=59, PETRI_FLOW=7326, PETRI_PLACES=339, PETRI_TRANSITIONS=378} [2025-04-13 19:15:25,743 INFO L279 CegarLoopForPetriNet]: 22 programPoint places, 317 predicate places. [2025-04-13 19:15:25,743 INFO L485 AbstractCegarLoop]: Abstraction has has 339 places, 378 transitions, 7326 flow [2025-04-13 19:15:25,743 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 41 states have (on average 4.121951219512195) internal successors, (169), 41 states have internal predecessors, (169), 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 19:15:25,744 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:15:25,744 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 9, 8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:15:25,749 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 19:15:25,946 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,SelfDestructingSolverStorable14 [2025-04-13 19:15:25,946 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 19:15:25,947 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:15:25,947 INFO L85 PathProgramCache]: Analyzing trace with hash -1638944112, now seen corresponding path program 8 times [2025-04-13 19:15:25,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:15:25,947 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1105224438] [2025-04-13 19:15:25,947 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 19:15:25,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:15:25,953 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 44 statements into 2 equivalence classes. [2025-04-13 19:15:25,958 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 44 of 44 statements. [2025-04-13 19:15:25,958 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 19:15:25,958 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:15:26,214 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 0 proven. 122 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 19:15:26,214 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:15:26,214 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1105224438] [2025-04-13 19:15:26,214 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1105224438] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 19:15:26,214 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1812017456] [2025-04-13 19:15:26,214 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 19:15:26,215 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 19:15:26,215 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 19:15:26,216 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 19:15:26,218 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 19:15:26,248 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 44 statements into 2 equivalence classes. [2025-04-13 19:15:26,265 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 44 of 44 statements. [2025-04-13 19:15:26,265 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 19:15:26,265 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:15:26,267 INFO L256 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-04-13 19:15:26,268 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 19:15:26,366 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 1 proven. 121 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 19:15:26,366 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 19:15:26,637 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 0 proven. 122 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 19:15:26,637 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1812017456] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 19:15:26,637 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 19:15:26,637 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20, 20] total 40 [2025-04-13 19:15:26,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [227533209] [2025-04-13 19:15:26,637 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 19:15:26,638 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2025-04-13 19:15:26,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:15:26,638 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2025-04-13 19:15:26,639 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=252, Invalid=1470, Unknown=0, NotChecked=0, Total=1722 [2025-04-13 19:15:26,652 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 21 [2025-04-13 19:15:26,652 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 339 places, 378 transitions, 7326 flow. Second operand has 42 states, 42 states have (on average 4.166666666666667) internal successors, (175), 42 states have internal predecessors, (175), 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 19:15:26,652 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:15:26,652 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 21 [2025-04-13 19:15:26,652 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:15:29,501 INFO L116 PetriNetUnfolderBase]: 5104/9114 cut-off events. [2025-04-13 19:15:29,502 INFO L117 PetriNetUnfolderBase]: For 1462400/1462400 co-relation queries the response was YES. [2025-04-13 19:15:29,563 INFO L83 FinitePrefix]: Finished finitePrefix Result has 95106 conditions, 9114 events. 5104/9114 cut-off events. For 1462400/1462400 co-relation queries the response was YES. Maximal size of possible extension queue 171. Compared 54918 event pairs, 91 based on Foata normal form. 81/6553 useless extension candidates. Maximal degree in co-relation 94963. Up to 2465 conditions per place. [2025-04-13 19:15:29,596 INFO L140 encePairwiseOnDemand]: 15/21 looper letters, 224 selfloop transitions, 422 changer transitions 149/795 dead transitions. [2025-04-13 19:15:29,596 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 388 places, 795 transitions, 18443 flow [2025-04-13 19:15:29,596 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2025-04-13 19:15:29,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2025-04-13 19:15:29,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 523 transitions. [2025-04-13 19:15:29,598 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.42211460855528654 [2025-04-13 19:15:29,598 INFO L175 Difference]: Start difference. First operand has 339 places, 378 transitions, 7326 flow. Second operand 59 states and 523 transitions. [2025-04-13 19:15:29,598 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 388 places, 795 transitions, 18443 flow [2025-04-13 19:15:33,080 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 355 places, 795 transitions, 15775 flow, removed 1166 selfloop flow, removed 33 redundant places. [2025-04-13 19:15:33,089 INFO L231 Difference]: Finished difference. Result has 382 places, 476 transitions, 9367 flow [2025-04-13 19:15:33,089 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=5852, PETRI_DIFFERENCE_MINUEND_PLACES=297, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=378, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=338, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=59, PETRI_FLOW=9367, PETRI_PLACES=382, PETRI_TRANSITIONS=476} [2025-04-13 19:15:33,090 INFO L279 CegarLoopForPetriNet]: 22 programPoint places, 360 predicate places. [2025-04-13 19:15:33,090 INFO L485 AbstractCegarLoop]: Abstraction has has 382 places, 476 transitions, 9367 flow [2025-04-13 19:15:33,090 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 42 states have (on average 4.166666666666667) internal successors, (175), 42 states have internal predecessors, (175), 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 19:15:33,090 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:15:33,090 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 9, 8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:15:33,096 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-04-13 19:15:33,291 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,SelfDestructingSolverStorable15 [2025-04-13 19:15:33,291 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 19:15:33,292 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:15:33,292 INFO L85 PathProgramCache]: Analyzing trace with hash -256268546, now seen corresponding path program 9 times [2025-04-13 19:15:33,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:15:33,292 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1146069357] [2025-04-13 19:15:33,292 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 19:15:33,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:15:33,298 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 44 statements into 16 equivalence classes. [2025-04-13 19:15:33,312 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) and asserted 44 of 44 statements. [2025-04-13 19:15:33,312 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2025-04-13 19:15:33,312 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:15:33,515 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 0 proven. 199 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 19:15:33,516 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:15:33,516 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1146069357] [2025-04-13 19:15:33,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1146069357] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 19:15:33,516 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [375742105] [2025-04-13 19:15:33,516 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 19:15:33,516 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 19:15:33,517 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 19:15:33,518 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 19:15:33,520 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 19:15:33,551 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 44 statements into 16 equivalence classes. [2025-04-13 19:15:33,569 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) and asserted 44 of 44 statements. [2025-04-13 19:15:33,569 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2025-04-13 19:15:33,569 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:15:33,570 INFO L256 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-04-13 19:15:33,571 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 19:15:33,620 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 0 proven. 199 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 19:15:33,621 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 19:15:33,851 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 0 proven. 199 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 19:15:33,851 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [375742105] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 19:15:33,851 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 19:15:33,851 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20, 20] total 39 [2025-04-13 19:15:33,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1486327164] [2025-04-13 19:15:33,851 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 19:15:33,852 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2025-04-13 19:15:33,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:15:33,852 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2025-04-13 19:15:33,853 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=361, Invalid=1279, Unknown=0, NotChecked=0, Total=1640 [2025-04-13 19:15:33,878 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 21 [2025-04-13 19:15:33,878 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 382 places, 476 transitions, 9367 flow. Second operand has 41 states, 41 states have (on average 4.121951219512195) internal successors, (169), 41 states have internal predecessors, (169), 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 19:15:33,878 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:15:33,878 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 21 [2025-04-13 19:15:33,878 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:15:37,184 INFO L116 PetriNetUnfolderBase]: 5797/10266 cut-off events. [2025-04-13 19:15:37,185 INFO L117 PetriNetUnfolderBase]: For 1947233/1947233 co-relation queries the response was YES. [2025-04-13 19:15:37,254 INFO L83 FinitePrefix]: Finished finitePrefix Result has 114799 conditions, 10266 events. 5797/10266 cut-off events. For 1947233/1947233 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 62503 event pairs, 35 based on Foata normal form. 81/7399 useless extension candidates. Maximal degree in co-relation 114637. Up to 2741 conditions per place. [2025-04-13 19:15:37,302 INFO L140 encePairwiseOnDemand]: 15/21 looper letters, 225 selfloop transitions, 482 changer transitions 143/850 dead transitions. [2025-04-13 19:15:37,302 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 431 places, 850 transitions, 20780 flow [2025-04-13 19:15:37,302 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2025-04-13 19:15:37,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2025-04-13 19:15:37,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 537 transitions. [2025-04-13 19:15:37,304 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.43341404358353514 [2025-04-13 19:15:37,304 INFO L175 Difference]: Start difference. First operand has 382 places, 476 transitions, 9367 flow. Second operand 59 states and 537 transitions. [2025-04-13 19:15:37,304 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 431 places, 850 transitions, 20780 flow [2025-04-13 19:15:41,738 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 397 places, 850 transitions, 18222 flow, removed 1101 selfloop flow, removed 34 redundant places. [2025-04-13 19:15:41,748 INFO L231 Difference]: Finished difference. Result has 420 places, 523 transitions, 10941 flow [2025-04-13 19:15:41,749 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=7747, PETRI_DIFFERENCE_MINUEND_PLACES=339, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=476, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=439, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=59, PETRI_FLOW=10941, PETRI_PLACES=420, PETRI_TRANSITIONS=523} [2025-04-13 19:15:41,749 INFO L279 CegarLoopForPetriNet]: 22 programPoint places, 398 predicate places. [2025-04-13 19:15:41,750 INFO L485 AbstractCegarLoop]: Abstraction has has 420 places, 523 transitions, 10941 flow [2025-04-13 19:15:41,750 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 41 states have (on average 4.121951219512195) internal successors, (169), 41 states have internal predecessors, (169), 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 19:15:41,750 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:15:41,750 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 9, 9, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:15:41,755 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 19:15:41,950 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,SelfDestructingSolverStorable16 [2025-04-13 19:15:41,950 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 19:15:41,951 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:15:41,951 INFO L85 PathProgramCache]: Analyzing trace with hash -445825539, now seen corresponding path program 10 times [2025-04-13 19:15:41,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:15:41,951 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [236700777] [2025-04-13 19:15:41,951 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 19:15:41,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:15:41,955 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 46 statements into 2 equivalence classes. [2025-04-13 19:15:41,959 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 46 of 46 statements. [2025-04-13 19:15:41,959 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 19:15:41,959 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:15:42,166 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 0 proven. 224 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 19:15:42,166 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:15:42,166 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [236700777] [2025-04-13 19:15:42,166 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [236700777] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 19:15:42,166 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [733817391] [2025-04-13 19:15:42,166 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 19:15:42,166 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 19:15:42,166 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 19:15:42,168 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 19:15:42,169 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-04-13 19:15:42,197 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 46 statements into 2 equivalence classes. [2025-04-13 19:15:42,211 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 46 of 46 statements. [2025-04-13 19:15:42,211 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 19:15:42,211 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:15:42,212 INFO L256 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-04-13 19:15:42,213 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 19:15:42,270 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 0 proven. 224 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 19:15:42,271 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 19:15:42,494 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 0 proven. 224 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 19:15:42,494 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [733817391] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 19:15:42,494 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 19:15:42,495 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 42 [2025-04-13 19:15:42,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [27783499] [2025-04-13 19:15:42,495 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 19:15:42,495 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2025-04-13 19:15:42,495 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:15:42,495 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2025-04-13 19:15:42,496 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=399, Invalid=1493, Unknown=0, NotChecked=0, Total=1892 [2025-04-13 19:15:42,538 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 21 [2025-04-13 19:15:42,538 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 420 places, 523 transitions, 10941 flow. Second operand has 44 states, 44 states have (on average 4.113636363636363) internal successors, (181), 44 states have internal predecessors, (181), 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 19:15:42,538 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:15:42,538 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 21 [2025-04-13 19:15:42,538 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:15:45,793 INFO L116 PetriNetUnfolderBase]: 6094/10806 cut-off events. [2025-04-13 19:15:45,793 INFO L117 PetriNetUnfolderBase]: For 2513285/2513285 co-relation queries the response was YES. [2025-04-13 19:15:45,884 INFO L83 FinitePrefix]: Finished finitePrefix Result has 128745 conditions, 10806 events. 6094/10806 cut-off events. For 2513285/2513285 co-relation queries the response was YES. Maximal size of possible extension queue 191. Compared 65986 event pairs, 235 based on Foata normal form. 63/7759 useless extension candidates. Maximal degree in co-relation 128569. Up to 2861 conditions per place. [2025-04-13 19:15:45,924 INFO L140 encePairwiseOnDemand]: 15/21 looper letters, 231 selfloop transitions, 476 changer transitions 109/816 dead transitions. [2025-04-13 19:15:45,925 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 459 places, 816 transitions, 20802 flow [2025-04-13 19:15:45,925 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2025-04-13 19:15:45,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2025-04-13 19:15:45,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 441 transitions. [2025-04-13 19:15:45,926 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.42857142857142855 [2025-04-13 19:15:45,926 INFO L175 Difference]: Start difference. First operand has 420 places, 523 transitions, 10941 flow. Second operand 49 states and 441 transitions. [2025-04-13 19:15:45,926 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 459 places, 816 transitions, 20802 flow [2025-04-13 19:15:52,899 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 415 places, 816 transitions, 16869 flow, removed 1633 selfloop flow, removed 44 redundant places. [2025-04-13 19:15:52,910 INFO L231 Difference]: Finished difference. Result has 426 places, 554 transitions, 11049 flow [2025-04-13 19:15:52,910 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=8888, PETRI_DIFFERENCE_MINUEND_PLACES=367, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=523, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=448, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=49, PETRI_FLOW=11049, PETRI_PLACES=426, PETRI_TRANSITIONS=554} [2025-04-13 19:15:52,911 INFO L279 CegarLoopForPetriNet]: 22 programPoint places, 404 predicate places. [2025-04-13 19:15:52,911 INFO L485 AbstractCegarLoop]: Abstraction has has 426 places, 554 transitions, 11049 flow [2025-04-13 19:15:52,911 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 44 states have (on average 4.113636363636363) internal successors, (181), 44 states have internal predecessors, (181), 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 19:15:52,911 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:15:52,911 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:15:52,919 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2025-04-13 19:15:53,116 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-04-13 19:15:53,116 INFO L403 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 19:15:53,117 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:15:53,117 INFO L85 PathProgramCache]: Analyzing trace with hash -2131805434, now seen corresponding path program 11 times [2025-04-13 19:15:53,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:15:53,117 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1691197081] [2025-04-13 19:15:53,117 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 19:15:53,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:15:53,121 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 48 statements into 18 equivalence classes. [2025-04-13 19:15:53,126 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 18 check-sat command(s) and asserted 48 of 48 statements. [2025-04-13 19:15:53,126 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 18 check-sat command(s) [2025-04-13 19:15:53,126 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-13 19:15:53,126 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-13 19:15:53,128 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-04-13 19:15:53,131 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-04-13 19:15:53,131 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:15:53,131 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-13 19:15:53,154 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-13 19:15:53,154 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-13 19:15:53,156 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2025-04-13 19:15:53,157 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 3 remaining) [2025-04-13 19:15:53,157 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2025-04-13 19:15:53,157 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-04-13 19:15:53,157 INFO L422 BasicCegarLoop]: Path program histogram: [11, 3, 2, 1, 1, 1] [2025-04-13 19:15:53,219 INFO L242 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-04-13 19:15:53,219 INFO L171 ceAbstractionStarter]: Computing trace abstraction results [2025-04-13 19:15:53,222 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.04 07:15:53 BasicIcfg [2025-04-13 19:15:53,222 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-04-13 19:15:53,223 INFO L158 Benchmark]: Toolchain (without parser) took 49420.09ms. Allocated memory was 155.2MB in the beginning and 1.3GB in the end (delta: 1.2GB). Free memory was 107.3MB in the beginning and 402.7MB in the end (delta: -295.3MB). Peak memory consumption was 891.0MB. Max. memory is 8.0GB. [2025-04-13 19:15:53,223 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 159.4MB. Free memory is still 85.8MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-13 19:15:53,224 INFO L158 Benchmark]: CACSL2BoogieTranslator took 416.96ms. Allocated memory is still 155.2MB. Free memory was 107.3MB in the beginning and 84.8MB in the end (delta: 22.5MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. [2025-04-13 19:15:53,224 INFO L158 Benchmark]: Boogie Procedure Inliner took 24.74ms. Allocated memory is still 155.2MB. Free memory was 84.8MB in the beginning and 83.1MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-13 19:15:53,224 INFO L158 Benchmark]: Boogie Preprocessor took 33.17ms. Allocated memory is still 155.2MB. Free memory was 83.1MB in the beginning and 81.5MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-13 19:15:53,225 INFO L158 Benchmark]: RCFGBuilder took 358.41ms. Allocated memory is still 155.2MB. Free memory was 81.5MB in the beginning and 61.2MB in the end (delta: 20.3MB). Peak memory consumption was 21.0MB. Max. memory is 8.0GB. [2025-04-13 19:15:53,225 INFO L158 Benchmark]: TraceAbstraction took 48582.83ms. Allocated memory was 155.2MB in the beginning and 1.3GB in the end (delta: 1.2GB). Free memory was 60.5MB in the beginning and 402.7MB in the end (delta: -342.1MB). Peak memory consumption was 844.9MB. Max. memory is 8.0GB. [2025-04-13 19:15:53,225 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.21ms. Allocated memory is still 159.4MB. Free memory is still 85.8MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 416.96ms. Allocated memory is still 155.2MB. Free memory was 107.3MB in the beginning and 84.8MB in the end (delta: 22.5MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 24.74ms. Allocated memory is still 155.2MB. Free memory was 84.8MB in the beginning and 83.1MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 33.17ms. Allocated memory is still 155.2MB. Free memory was 83.1MB in the beginning and 81.5MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 8.0GB. * RCFGBuilder took 358.41ms. Allocated memory is still 155.2MB. Free memory was 81.5MB in the beginning and 61.2MB in the end (delta: 20.3MB). Peak memory consumption was 21.0MB. Max. memory is 8.0GB. * TraceAbstraction took 48582.83ms. Allocated memory was 155.2MB in the beginning and 1.3GB in the end (delta: 1.2GB). Free memory was 60.5MB in the beginning and 402.7MB in the end (delta: -342.1MB). Peak memory consumption was 844.9MB. 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:50}, \at(argc, Pre)=51, argc=51, i=3, id1=-1, j=6] [L696] 1 int k = 0; [L696] COND TRUE 1 k < 10 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:50}, \at(argc, Pre)=51, arg={0:0}, argc=51, i=3, id1=-1, id2=0, j=6, k=0] [L704] 2 int k = 0; [L704] COND TRUE 2 k < 10 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, arg={0:0}, i=3, j=6, k=0, k=0] [L698] 1 i = j + 1 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 < 10 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 < 10 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 < 10 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 < 10 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 < 10 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 < 10 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 < 10 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 < 10 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 < 10 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 < 10 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 < 10 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 < 10 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 < 10 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 < 10 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 < 10 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 < 10 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 < 10 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 < 10 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] [L716] 0 int condI = i >= (2*10 +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=23, id1=-1, id2=0, 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] [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=9, k=9] [L719] 0 int condJ = j >= (2*10 +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=25, id1=-1, id2=0, j=26, k=9, k=9] [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=25, id1=-1, id2=0, j=26, k=9, k=9] - 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. - 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. - 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: 48.4s, OverallIterations: 19, TraceHistogramMax: 10, PathProgramHistogramMax: 11, EmptinessCheckTime: 0.0s, AutomataDifference: 39.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 6491 SdHoareTripleChecker+Valid, 4.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 6454 mSDsluCounter, 152 SdHoareTripleChecker+Invalid, 3.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 130 mSDsCounter, 348 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 7813 IncrementalHoareTripleChecker+Invalid, 8161 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 348 mSolverCounterUnsat, 22 mSDtfsCounter, 7813 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1343 GetRequests, 554 SyntacticMatches, 0 SemanticMatches, 789 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16354 ImplicationChecksByTransitivity, 7.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=11049occurred in iteration=18, InterpolantAutomatonStates: 534, 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.9s InterpolantComputationTime, 854 NumberOfCodeBlocks, 854 NumberOfCodeBlocksAsserted, 149 NumberOfCheckSat, 1132 ConstructedInterpolants, 0 QuantifiedInterpolants, 5205 SizeOfPredicates, 141 NumberOfNonLiveVariables, 1498 ConjunctsInSsa, 196 ConjunctsInUnsatCore, 40 InterpolantComputations, 7 PerfectInterpolantSequences, 28/3264 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 19:15:53,239 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...