/root/.sdkman/candidates/java/21.0.5-tem/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata ./data -tc ../benchexec/../../../trunk/examples/toolchains/AutomizerCInline_IcfgBuilder.xml -s ../benchexec/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --traceabstraction.automaton.type.used.in.concurrency.analysis PETRI_NET --preprocessor.replace.while.statements.and.if-then-else.statements false -i ../../../trunk/examples/svcomp/pthread/fib_safe-5.i -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.cfg-lbe-improvements-94356ea-m [2025-04-13 23:44:14,447 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-13 23:44:14,488 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../benchexec/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2025-04-13 23:44:14,494 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-13 23:44:14,494 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-13 23:44:14,508 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-13 23:44:14,508 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-13 23:44:14,508 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-13 23:44:14,509 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-13 23:44:14,509 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-13 23:44:14,509 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-13 23:44:14,509 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-13 23:44:14,509 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-13 23:44:14,509 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-13 23:44:14,509 INFO L153 SettingsManager]: * Use SBE=true [2025-04-13 23:44:14,509 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-13 23:44:14,509 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-13 23:44:14,509 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-13 23:44:14,509 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-13 23:44:14,510 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-13 23:44:14,510 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-13 23:44:14,510 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-13 23:44:14,510 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-13 23:44:14,510 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-13 23:44:14,510 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-13 23:44:14,510 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-13 23:44:14,510 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-13 23:44:14,510 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-13 23:44:14,510 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-13 23:44:14,510 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 23:44:14,510 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 23:44:14,510 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 23:44:14,510 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 23:44:14,510 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-13 23:44:14,510 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 23:44:14,511 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 23:44:14,511 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 23:44:14,511 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 23:44:14,511 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-13 23:44:14,511 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-13 23:44:14,511 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-13 23:44:14,511 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-13 23:44:14,511 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-13 23:44:14,511 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-13 23:44:14,511 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-13 23:44:14,511 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-13 23:44:14,511 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-13 23:44:14,511 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Automaton type used in concurrency analysis -> PETRI_NET Applying setting for plugin de.uni_freiburg.informatik.ultimate.boogie.preprocessor: Replace while statements and if-then-else statements -> false [2025-04-13 23:44:14,736 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-13 23:44:14,746 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-13 23:44:14,748 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-13 23:44:14,749 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-13 23:44:14,749 INFO L274 PluginConnector]: CDTParser initialized [2025-04-13 23:44:14,750 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread/fib_safe-5.i [2025-04-13 23:44:16,095 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4d570bfff/4a23de47289847e5abb4ca895cf6668d/FLAG635190dff [2025-04-13 23:44:16,375 INFO L389 CDTParser]: Found 1 translation units. [2025-04-13 23:44:16,375 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread/fib_safe-5.i [2025-04-13 23:44:16,389 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4d570bfff/4a23de47289847e5abb4ca895cf6668d/FLAG635190dff [2025-04-13 23:44:17,097 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4d570bfff/4a23de47289847e5abb4ca895cf6668d [2025-04-13 23:44:17,099 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-13 23:44:17,100 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-04-13 23:44:17,100 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-13 23:44:17,100 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-13 23:44:17,103 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-13 23:44:17,104 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 11:44:17" (1/1) ... [2025-04-13 23:44:17,104 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7561e344 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:44:17, skipping insertion in model container [2025-04-13 23:44:17,104 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 11:44:17" (1/1) ... [2025-04-13 23:44:17,130 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-13 23:44:17,444 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/fib_safe-5.i[30241,30254] [2025-04-13 23:44:17,464 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 23:44:17,474 INFO L200 MainTranslator]: Completed pre-run [2025-04-13 23:44:17,538 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/fib_safe-5.i[30241,30254] [2025-04-13 23:44:17,547 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 23:44:17,588 INFO L204 MainTranslator]: Completed translation [2025-04-13 23:44:17,590 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:44:17 WrapperNode [2025-04-13 23:44:17,590 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-13 23:44:17,591 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-13 23:44:17,591 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-13 23:44:17,591 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-13 23:44:17,596 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:44:17" (1/1) ... [2025-04-13 23:44:17,614 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:44:17" (1/1) ... [2025-04-13 23:44:17,637 INFO L138 Inliner]: procedures = 164, calls = 20, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 63 [2025-04-13 23:44:17,637 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-13 23:44:17,638 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-13 23:44:17,638 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-13 23:44:17,638 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-13 23:44:17,650 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:44:17" (1/1) ... [2025-04-13 23:44:17,650 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:44:17" (1/1) ... [2025-04-13 23:44:17,652 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:44:17" (1/1) ... [2025-04-13 23:44:17,668 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-04-13 23:44:17,668 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:44:17" (1/1) ... [2025-04-13 23:44:17,668 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:44:17" (1/1) ... [2025-04-13 23:44:17,671 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:44:17" (1/1) ... [2025-04-13 23:44:17,671 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:44:17" (1/1) ... [2025-04-13 23:44:17,672 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:44:17" (1/1) ... [2025-04-13 23:44:17,672 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:44:17" (1/1) ... [2025-04-13 23:44:17,675 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-13 23:44:17,675 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-04-13 23:44:17,676 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-04-13 23:44:17,676 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-04-13 23:44:17,676 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:44:17" (1/1) ... [2025-04-13 23:44:17,680 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 23:44:17,690 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:44:17,702 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-04-13 23:44:17,704 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-04-13 23:44:17,728 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2025-04-13 23:44:17,729 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2025-04-13 23:44:17,729 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2025-04-13 23:44:17,729 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2025-04-13 23:44:17,729 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-04-13 23:44:17,729 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-13 23:44:17,729 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-04-13 23:44:17,729 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-04-13 23:44:17,729 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-13 23:44:17,729 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-13 23:44:17,730 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-13 23:44:17,836 INFO L256 CfgBuilder]: Building ICFG [2025-04-13 23:44:17,838 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-13 23:44:17,967 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-13 23:44:17,968 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-13 23:44:17,968 INFO L318 CfgBuilder]: Performing block encoding [2025-04-13 23:44:18,076 WARN L179 LargeBlockEncoding]: Complex 2:2 sequential composition. Such compositions can cause exponential blowup and should not occur in structured programs. [2025-04-13 23:44:18,078 WARN L179 LargeBlockEncoding]: Complex 2:2 sequential composition. Such compositions can cause exponential blowup and should not occur in structured programs. [2025-04-13 23:44:18,081 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-13 23:44:18,082 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.04 11:44:18 BoogieIcfgContainer [2025-04-13 23:44:18,082 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-04-13 23:44:18,083 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-13 23:44:18,083 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-13 23:44:18,087 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-13 23:44:18,087 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.04 11:44:17" (1/3) ... [2025-04-13 23:44:18,087 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@10aa30a4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 11:44:18, skipping insertion in model container [2025-04-13 23:44:18,087 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:44:17" (2/3) ... [2025-04-13 23:44:18,088 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@10aa30a4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 11:44:18, skipping insertion in model container [2025-04-13 23:44:18,088 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.04 11:44:18" (3/3) ... [2025-04-13 23:44:18,089 INFO L128 eAbstractionObserver]: Analyzing ICFG fib_safe-5.i [2025-04-13 23:44:18,099 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-13 23:44:18,101 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG fib_safe-5.i that has 3 procedures, 21 locations, 23 edges, 1 initial locations, 3 loop locations, and 1 error locations. [2025-04-13 23:44:18,101 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-13 23:44:18,147 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-04-13 23:44:18,175 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 27 places, 25 transitions, 58 flow [2025-04-13 23:44:18,200 INFO L116 PetriNetUnfolderBase]: 5/23 cut-off events. [2025-04-13 23:44:18,203 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-13 23:44:18,205 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30 conditions, 23 events. 5/23 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 20 event pairs, 0 based on Foata normal form. 0/17 useless extension candidates. Maximal degree in co-relation 20. Up to 2 conditions per place. [2025-04-13 23:44:18,205 INFO L82 GeneralOperation]: Start removeDead. Operand has 27 places, 25 transitions, 58 flow [2025-04-13 23:44:18,208 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 25 places, 23 transitions, 52 flow [2025-04-13 23:44:18,215 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-13 23:44:18,226 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;@a825616, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-13 23:44:18,227 INFO L341 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2025-04-13 23:44:18,237 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-13 23:44:18,237 INFO L116 PetriNetUnfolderBase]: 5/21 cut-off events. [2025-04-13 23:44:18,237 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-13 23:44:18,237 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 23:44:18,238 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:44:18,238 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 23:44:18,243 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:44:18,244 INFO L85 PathProgramCache]: Analyzing trace with hash 1578653316, now seen corresponding path program 1 times [2025-04-13 23:44:18,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:44:18,249 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [771169298] [2025-04-13 23:44:18,249 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 23:44:18,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:44:18,324 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-13 23:44:18,337 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-13 23:44:18,338 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:44:18,338 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:44:18,441 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:44:18,441 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:44:18,442 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [771169298] [2025-04-13 23:44:18,442 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [771169298] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:44:18,442 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:44:18,442 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 23:44:18,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1079626672] [2025-04-13 23:44:18,444 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:44:18,449 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 23:44:18,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:44:18,468 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 23:44:18,469 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 23:44:18,470 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 25 [2025-04-13 23:44:18,471 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 25 places, 23 transitions, 52 flow. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:44:18,471 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 23:44:18,472 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 25 [2025-04-13 23:44:18,472 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 23:44:18,591 INFO L116 PetriNetUnfolderBase]: 233/357 cut-off events. [2025-04-13 23:44:18,591 INFO L117 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-04-13 23:44:18,592 INFO L83 FinitePrefix]: Finished finitePrefix Result has 728 conditions, 357 events. 233/357 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 986 event pairs, 39 based on Foata normal form. 0/267 useless extension candidates. Maximal degree in co-relation 712. Up to 257 conditions per place. [2025-04-13 23:44:18,598 INFO L140 encePairwiseOnDemand]: 20/25 looper letters, 27 selfloop transitions, 2 changer transitions 1/30 dead transitions. [2025-04-13 23:44:18,598 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 27 places, 30 transitions, 126 flow [2025-04-13 23:44:18,600 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 23:44:18,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-13 23:44:18,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 41 transitions. [2025-04-13 23:44:18,612 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5466666666666666 [2025-04-13 23:44:18,614 INFO L175 Difference]: Start difference. First operand has 25 places, 23 transitions, 52 flow. Second operand 3 states and 41 transitions. [2025-04-13 23:44:18,614 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 27 places, 30 transitions, 126 flow [2025-04-13 23:44:18,618 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 25 places, 30 transitions, 124 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-13 23:44:18,620 INFO L231 Difference]: Finished difference. Result has 26 places, 21 transitions, 56 flow [2025-04-13 23:44:18,622 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=46, PETRI_DIFFERENCE_MINUEND_PLACES=23, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=56, PETRI_PLACES=26, PETRI_TRANSITIONS=21} [2025-04-13 23:44:18,624 INFO L279 CegarLoopForPetriNet]: 25 programPoint places, 1 predicate places. [2025-04-13 23:44:18,625 INFO L485 AbstractCegarLoop]: Abstraction has has 26 places, 21 transitions, 56 flow [2025-04-13 23:44:18,625 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:44:18,625 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 23:44:18,625 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:44:18,625 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-13 23:44:18,625 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 23:44:18,626 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:44:18,626 INFO L85 PathProgramCache]: Analyzing trace with hash 1693576751, now seen corresponding path program 1 times [2025-04-13 23:44:18,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:44:18,626 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1360548438] [2025-04-13 23:44:18,626 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 23:44:18,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:44:18,638 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-04-13 23:44:18,652 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-13 23:44:18,653 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:44:18,653 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:44:18,733 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:44:18,733 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:44:18,733 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1360548438] [2025-04-13 23:44:18,733 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1360548438] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:44:18,733 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [522597903] [2025-04-13 23:44:18,733 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 23:44:18,733 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:44:18,733 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:44:18,739 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 23:44:18,740 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-04-13 23:44:18,782 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-04-13 23:44:18,798 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-13 23:44:18,798 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:44:18,798 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:44:18,800 INFO L256 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-04-13 23:44:18,802 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:44:18,829 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:44:18,829 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:44:18,848 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:44:18,849 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [522597903] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:44:18,849 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:44:18,849 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-04-13 23:44:18,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [689316804] [2025-04-13 23:44:18,849 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:44:18,850 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-13 23:44:18,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:44:18,850 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-13 23:44:18,850 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-04-13 23:44:18,851 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 25 [2025-04-13 23:44:18,851 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 26 places, 21 transitions, 56 flow. Second operand has 7 states, 7 states have (on average 4.428571428571429) internal successors, (31), 7 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:44:18,851 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 23:44:18,851 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 25 [2025-04-13 23:44:18,851 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 23:44:18,994 INFO L116 PetriNetUnfolderBase]: 297/453 cut-off events. [2025-04-13 23:44:18,994 INFO L117 PetriNetUnfolderBase]: For 12/12 co-relation queries the response was YES. [2025-04-13 23:44:18,996 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1033 conditions, 453 events. 297/453 cut-off events. For 12/12 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 1244 event pairs, 39 based on Foata normal form. 0/363 useless extension candidates. Maximal degree in co-relation 1016. Up to 209 conditions per place. [2025-04-13 23:44:18,998 INFO L140 encePairwiseOnDemand]: 22/25 looper letters, 51 selfloop transitions, 5 changer transitions 0/56 dead transitions. [2025-04-13 23:44:18,998 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 30 places, 56 transitions, 244 flow [2025-04-13 23:44:18,998 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-13 23:44:18,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-13 23:44:18,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 71 transitions. [2025-04-13 23:44:18,999 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.47333333333333333 [2025-04-13 23:44:18,999 INFO L175 Difference]: Start difference. First operand has 26 places, 21 transitions, 56 flow. Second operand 6 states and 71 transitions. [2025-04-13 23:44:18,999 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 30 places, 56 transitions, 244 flow [2025-04-13 23:44:19,000 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 56 transitions, 242 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-13 23:44:19,000 INFO L231 Difference]: Finished difference. Result has 32 places, 24 transitions, 90 flow [2025-04-13 23:44:19,001 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=24, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=90, PETRI_PLACES=32, PETRI_TRANSITIONS=24} [2025-04-13 23:44:19,001 INFO L279 CegarLoopForPetriNet]: 25 programPoint places, 7 predicate places. [2025-04-13 23:44:19,001 INFO L485 AbstractCegarLoop]: Abstraction has has 32 places, 24 transitions, 90 flow [2025-04-13 23:44:19,001 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.428571428571429) internal successors, (31), 7 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:44:19,001 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 23:44:19,001 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:44:19,010 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 23:44:19,206 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:44:19,206 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 23:44:19,209 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:44:19,209 INFO L85 PathProgramCache]: Analyzing trace with hash 328624452, now seen corresponding path program 2 times [2025-04-13 23:44:19,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:44:19,209 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [416976673] [2025-04-13 23:44:19,209 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 23:44:19,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:44:19,241 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 15 statements into 2 equivalence classes. [2025-04-13 23:44:19,254 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 15 of 15 statements. [2025-04-13 23:44:19,254 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 23:44:19,254 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:44:19,366 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:44:19,367 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:44:19,367 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [416976673] [2025-04-13 23:44:19,367 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [416976673] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:44:19,367 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1325002752] [2025-04-13 23:44:19,367 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 23:44:19,367 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:44:19,367 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:44:19,370 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 23:44:19,371 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-04-13 23:44:19,413 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 15 statements into 2 equivalence classes. [2025-04-13 23:44:19,432 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 15 of 15 statements. [2025-04-13 23:44:19,432 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 23:44:19,432 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:44:19,433 INFO L256 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-04-13 23:44:19,434 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:44:19,452 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:44:19,452 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:44:19,501 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:44:19,502 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1325002752] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:44:19,502 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:44:19,502 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2025-04-13 23:44:19,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [987623401] [2025-04-13 23:44:19,502 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:44:19,502 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-04-13 23:44:19,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:44:19,503 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-04-13 23:44:19,503 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-04-13 23:44:19,503 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 25 [2025-04-13 23:44:19,503 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 24 transitions, 90 flow. Second operand has 13 states, 13 states have (on average 3.769230769230769) internal successors, (49), 13 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:44:19,503 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 23:44:19,503 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 25 [2025-04-13 23:44:19,503 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 23:44:19,692 INFO L116 PetriNetUnfolderBase]: 489/741 cut-off events. [2025-04-13 23:44:19,692 INFO L117 PetriNetUnfolderBase]: For 388/388 co-relation queries the response was YES. [2025-04-13 23:44:19,695 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1965 conditions, 741 events. 489/741 cut-off events. For 388/388 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 2115 event pairs, 39 based on Foata normal form. 96/715 useless extension candidates. Maximal degree in co-relation 1944. Up to 209 conditions per place. [2025-04-13 23:44:19,698 INFO L140 encePairwiseOnDemand]: 22/25 looper letters, 99 selfloop transitions, 11 changer transitions 0/110 dead transitions. [2025-04-13 23:44:19,698 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 110 transitions, 506 flow [2025-04-13 23:44:19,698 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-13 23:44:19,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-04-13 23:44:19,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 140 transitions. [2025-04-13 23:44:19,699 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4666666666666667 [2025-04-13 23:44:19,700 INFO L175 Difference]: Start difference. First operand has 32 places, 24 transitions, 90 flow. Second operand 12 states and 140 transitions. [2025-04-13 23:44:19,700 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 110 transitions, 506 flow [2025-04-13 23:44:19,703 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 110 transitions, 492 flow, removed 6 selfloop flow, removed 1 redundant places. [2025-04-13 23:44:19,704 INFO L231 Difference]: Finished difference. Result has 48 places, 30 transitions, 160 flow [2025-04-13 23:44:19,704 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=76, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=160, PETRI_PLACES=48, PETRI_TRANSITIONS=30} [2025-04-13 23:44:19,705 INFO L279 CegarLoopForPetriNet]: 25 programPoint places, 23 predicate places. [2025-04-13 23:44:19,705 INFO L485 AbstractCegarLoop]: Abstraction has has 48 places, 30 transitions, 160 flow [2025-04-13 23:44:19,705 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.769230769230769) internal successors, (49), 13 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:44:19,705 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 23:44:19,705 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:44:19,713 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-04-13 23:44:19,912 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,SelfDestructingSolverStorable2 [2025-04-13 23:44:19,912 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 23:44:19,913 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:44:19,913 INFO L85 PathProgramCache]: Analyzing trace with hash -2090552988, now seen corresponding path program 3 times [2025-04-13 23:44:19,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:44:19,913 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1381083429] [2025-04-13 23:44:19,913 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 23:44:19,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:44:19,922 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 21 statements into 6 equivalence classes. [2025-04-13 23:44:19,957 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) and asserted 21 of 21 statements. [2025-04-13 23:44:19,957 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2025-04-13 23:44:19,957 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:44:20,154 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:44:20,155 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:44:20,155 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1381083429] [2025-04-13 23:44:20,155 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1381083429] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:44:20,155 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1531378570] [2025-04-13 23:44:20,155 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 23:44:20,155 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:44:20,155 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:44:20,157 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 23:44:20,158 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-04-13 23:44:20,199 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 21 statements into 6 equivalence classes. [2025-04-13 23:44:20,226 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) and asserted 21 of 21 statements. [2025-04-13 23:44:20,226 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2025-04-13 23:44:20,226 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:44:20,227 INFO L256 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-04-13 23:44:20,228 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:44:20,255 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:44:20,255 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:44:20,371 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:44:20,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1531378570] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:44:20,372 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:44:20,372 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 15 [2025-04-13 23:44:20,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2102878589] [2025-04-13 23:44:20,372 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:44:20,372 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-04-13 23:44:20,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:44:20,373 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-04-13 23:44:20,373 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2025-04-13 23:44:20,373 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 25 [2025-04-13 23:44:20,373 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 30 transitions, 160 flow. Second operand has 15 states, 15 states have (on average 3.7333333333333334) internal successors, (56), 15 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:44:20,373 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 23:44:20,373 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 25 [2025-04-13 23:44:20,374 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 23:44:20,624 INFO L116 PetriNetUnfolderBase]: 553/837 cut-off events. [2025-04-13 23:44:20,625 INFO L117 PetriNetUnfolderBase]: For 1732/1732 co-relation queries the response was YES. [2025-04-13 23:44:20,628 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2532 conditions, 837 events. 553/837 cut-off events. For 1732/1732 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 2394 event pairs, 39 based on Foata normal form. 32/731 useless extension candidates. Maximal degree in co-relation 2504. Up to 209 conditions per place. [2025-04-13 23:44:20,632 INFO L140 encePairwiseOnDemand]: 22/25 looper letters, 115 selfloop transitions, 13 changer transitions 0/128 dead transitions. [2025-04-13 23:44:20,633 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 128 transitions, 624 flow [2025-04-13 23:44:20,633 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-04-13 23:44:20,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2025-04-13 23:44:20,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 158 transitions. [2025-04-13 23:44:20,635 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4514285714285714 [2025-04-13 23:44:20,635 INFO L175 Difference]: Start difference. First operand has 48 places, 30 transitions, 160 flow. Second operand 14 states and 158 transitions. [2025-04-13 23:44:20,635 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 128 transitions, 624 flow [2025-04-13 23:44:20,651 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 128 transitions, 572 flow, removed 21 selfloop flow, removed 5 redundant places. [2025-04-13 23:44:20,652 INFO L231 Difference]: Finished difference. Result has 58 places, 32 transitions, 160 flow [2025-04-13 23:44:20,652 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=112, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=160, PETRI_PLACES=58, PETRI_TRANSITIONS=32} [2025-04-13 23:44:20,653 INFO L279 CegarLoopForPetriNet]: 25 programPoint places, 33 predicate places. [2025-04-13 23:44:20,653 INFO L485 AbstractCegarLoop]: Abstraction has has 58 places, 32 transitions, 160 flow [2025-04-13 23:44:20,653 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.7333333333333334) internal successors, (56), 15 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:44:20,653 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 23:44:20,653 INFO L206 CegarLoopForPetriNet]: trace histogram [12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:44:20,660 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 23:44:20,853 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:44:20,854 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 23:44:20,854 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:44:20,854 INFO L85 PathProgramCache]: Analyzing trace with hash 1022127812, now seen corresponding path program 4 times [2025-04-13 23:44:20,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:44:20,855 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1738313580] [2025-04-13 23:44:20,855 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 23:44:20,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:44:20,864 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 23 statements into 2 equivalence classes. [2025-04-13 23:44:20,882 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 23 of 23 statements. [2025-04-13 23:44:20,883 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 23:44:20,883 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:44:21,635 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:44:21,635 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:44:21,636 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1738313580] [2025-04-13 23:44:21,636 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1738313580] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:44:21,636 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [342280997] [2025-04-13 23:44:21,636 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 23:44:21,636 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:44:21,636 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:44:21,638 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 23:44:21,639 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-04-13 23:44:21,676 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 23 statements into 2 equivalence classes. [2025-04-13 23:44:21,696 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 23 of 23 statements. [2025-04-13 23:44:21,696 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 23:44:21,696 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:44:21,697 INFO L256 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 47 conjuncts are in the unsatisfiable core [2025-04-13 23:44:21,699 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:44:22,310 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 55 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:44:22,310 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:44:23,023 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:44:23,023 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [342280997] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:44:23,023 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:44:23,023 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 51 [2025-04-13 23:44:23,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2028257827] [2025-04-13 23:44:23,024 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:44:23,024 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 53 states [2025-04-13 23:44:23,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:44:23,025 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2025-04-13 23:44:23,026 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=393, Invalid=2363, Unknown=0, NotChecked=0, Total=2756 [2025-04-13 23:44:23,026 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 25 [2025-04-13 23:44:23,026 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 32 transitions, 160 flow. Second operand has 53 states, 53 states have (on average 3.30188679245283) internal successors, (175), 53 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 23:44:23,026 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 23:44:23,026 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 25 [2025-04-13 23:44:23,026 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 23:44:29,940 INFO L116 PetriNetUnfolderBase]: 8671/13135 cut-off events. [2025-04-13 23:44:29,940 INFO L117 PetriNetUnfolderBase]: For 25341/25341 co-relation queries the response was YES. [2025-04-13 23:44:29,968 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37519 conditions, 13135 events. 8671/13135 cut-off events. For 25341/25341 co-relation queries the response was YES. Maximal size of possible extension queue 242. Compared 69310 event pairs, 44 based on Foata normal form. 232/11144 useless extension candidates. Maximal degree in co-relation 37489. Up to 1895 conditions per place. [2025-04-13 23:44:30,013 INFO L140 encePairwiseOnDemand]: 17/25 looper letters, 424 selfloop transitions, 454 changer transitions 164/1042 dead transitions. [2025-04-13 23:44:30,013 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 156 places, 1042 transitions, 6739 flow [2025-04-13 23:44:30,014 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2025-04-13 23:44:30,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2025-04-13 23:44:30,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 955 transitions. [2025-04-13 23:44:30,021 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.38585858585858585 [2025-04-13 23:44:30,021 INFO L175 Difference]: Start difference. First operand has 58 places, 32 transitions, 160 flow. Second operand 99 states and 955 transitions. [2025-04-13 23:44:30,021 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 156 places, 1042 transitions, 6739 flow [2025-04-13 23:44:30,077 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 145 places, 1042 transitions, 5741 flow, removed 210 selfloop flow, removed 11 redundant places. [2025-04-13 23:44:30,085 INFO L231 Difference]: Finished difference. Result has 179 places, 534 transitions, 3174 flow [2025-04-13 23:44:30,086 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=124, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=99, PETRI_FLOW=3174, PETRI_PLACES=179, PETRI_TRANSITIONS=534} [2025-04-13 23:44:30,086 INFO L279 CegarLoopForPetriNet]: 25 programPoint places, 154 predicate places. [2025-04-13 23:44:30,086 INFO L485 AbstractCegarLoop]: Abstraction has has 179 places, 534 transitions, 3174 flow [2025-04-13 23:44:30,086 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 53 states, 53 states have (on average 3.30188679245283) internal successors, (175), 53 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 23:44:30,087 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 23:44:30,087 INFO L206 CegarLoopForPetriNet]: trace histogram [12, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:44:30,094 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-04-13 23:44:30,287 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:44:30,288 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 23:44:30,288 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:44:30,288 INFO L85 PathProgramCache]: Analyzing trace with hash 927339933, now seen corresponding path program 1 times [2025-04-13 23:44:30,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:44:30,288 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1239893834] [2025-04-13 23:44:30,288 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 23:44:30,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:44:30,295 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-04-13 23:44:30,328 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-04-13 23:44:30,328 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:44:30,328 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:44:30,952 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 0 proven. 92 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:44:30,952 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:44:30,952 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1239893834] [2025-04-13 23:44:30,952 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1239893834] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:44:30,952 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1644941254] [2025-04-13 23:44:30,952 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 23:44:30,953 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:44:30,953 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:44:30,954 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 23:44:30,956 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-04-13 23:44:30,988 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-04-13 23:44:31,007 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-04-13 23:44:31,007 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:44:31,007 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:44:31,008 INFO L256 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 49 conjuncts are in the unsatisfiable core [2025-04-13 23:44:31,009 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:44:31,561 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 55 proven. 37 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:44:31,561 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:44:32,244 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 0 proven. 92 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:44:32,244 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1644941254] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:44:32,244 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:44:32,244 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 56 [2025-04-13 23:44:32,244 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [240688277] [2025-04-13 23:44:32,244 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:44:32,245 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 58 states [2025-04-13 23:44:32,245 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:44:32,246 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2025-04-13 23:44:32,247 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=443, Invalid=2863, Unknown=0, NotChecked=0, Total=3306 [2025-04-13 23:44:32,247 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 25 [2025-04-13 23:44:32,247 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 179 places, 534 transitions, 3174 flow. Second operand has 58 states, 58 states have (on average 3.3793103448275863) internal successors, (196), 58 states have internal predecessors, (196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:44:32,247 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 23:44:32,247 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 25 [2025-04-13 23:44:32,247 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 23:45:08,588 INFO L116 PetriNetUnfolderBase]: 84647/128797 cut-off events. [2025-04-13 23:45:08,589 INFO L117 PetriNetUnfolderBase]: For 4122895/4122895 co-relation queries the response was YES. [2025-04-13 23:45:09,379 INFO L83 FinitePrefix]: Finished finitePrefix Result has 571191 conditions, 128797 events. 84647/128797 cut-off events. For 4122895/4122895 co-relation queries the response was YES. Maximal size of possible extension queue 2197. Compared 972140 event pairs, 5015 based on Foata normal form. 4110/111931 useless extension candidates. Maximal degree in co-relation 571126. Up to 19672 conditions per place. [2025-04-13 23:45:09,776 INFO L140 encePairwiseOnDemand]: 16/25 looper letters, 1331 selfloop transitions, 4863 changer transitions 1502/7696 dead transitions. [2025-04-13 23:45:09,776 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 419 places, 7696 transitions, 59985 flow [2025-04-13 23:45:09,777 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 269 states. [2025-04-13 23:45:09,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 269 states. [2025-04-13 23:45:09,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 2511 transitions. [2025-04-13 23:45:09,786 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3733828996282528 [2025-04-13 23:45:09,786 INFO L175 Difference]: Start difference. First operand has 179 places, 534 transitions, 3174 flow. Second operand 269 states and 2511 transitions. [2025-04-13 23:45:09,786 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 419 places, 7696 transitions, 59985 flow [2025-04-13 23:48:00,115 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 388 places, 7696 transitions, 55015 flow, removed 2460 selfloop flow, removed 31 redundant places. [2025-04-13 23:48:00,167 INFO L231 Difference]: Finished difference. Result has 540 places, 5326 transitions, 44223 flow [2025-04-13 23:48:00,167 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=3040, PETRI_DIFFERENCE_MINUEND_PLACES=120, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=534, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=479, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=269, PETRI_FLOW=44223, PETRI_PLACES=540, PETRI_TRANSITIONS=5326} [2025-04-13 23:48:00,168 INFO L279 CegarLoopForPetriNet]: 25 programPoint places, 515 predicate places. [2025-04-13 23:48:00,168 INFO L485 AbstractCegarLoop]: Abstraction has has 540 places, 5326 transitions, 44223 flow [2025-04-13 23:48:00,169 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 58 states, 58 states have (on average 3.3793103448275863) internal successors, (196), 58 states have internal predecessors, (196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:48:00,169 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 23:48:00,169 INFO L206 CegarLoopForPetriNet]: trace histogram [12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:48:00,176 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-04-13 23:48:00,369 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:48:00,369 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 23:48:00,370 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:48:00,370 INFO L85 PathProgramCache]: Analyzing trace with hash 895804028, now seen corresponding path program 1 times [2025-04-13 23:48:00,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:48:00,370 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [483828058] [2025-04-13 23:48:00,370 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 23:48:00,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:48:00,375 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-04-13 23:48:00,386 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-04-13 23:48:00,386 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:48:00,386 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:48:00,884 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 0 proven. 67 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:48:00,885 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:48:00,885 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [483828058] [2025-04-13 23:48:00,885 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [483828058] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:48:00,885 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [304543758] [2025-04-13 23:48:00,885 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 23:48:00,885 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:48:00,885 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:48:00,888 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 23:48:00,889 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-04-13 23:48:00,930 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-04-13 23:48:00,948 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-04-13 23:48:00,948 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:48:00,949 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:48:00,950 INFO L256 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 49 conjuncts are in the unsatisfiable core [2025-04-13 23:48:00,952 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:48:01,464 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 55 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:48:01,465 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:48:02,233 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 0 proven. 67 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:48:02,234 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [304543758] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:48:02,234 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:48:02,234 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 56 [2025-04-13 23:48:02,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [277498910] [2025-04-13 23:48:02,234 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:48:02,235 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 58 states [2025-04-13 23:48:02,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:48:02,238 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2025-04-13 23:48:02,239 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=443, Invalid=2863, Unknown=0, NotChecked=0, Total=3306 [2025-04-13 23:48:02,239 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 25 [2025-04-13 23:48:02,239 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 540 places, 5326 transitions, 44223 flow. Second operand has 58 states, 58 states have (on average 3.3793103448275863) internal successors, (196), 58 states have internal predecessors, (196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:48:02,239 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 23:48:02,239 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 25 [2025-04-13 23:48:02,239 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand