/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/fib_safe-11.i -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.cfg-lbe-improvements-94356ea-m [2025-04-13 19:10:59,226 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-13 19:10:59,268 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:10:59,271 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-13 19:10:59,271 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-13 19:10:59,291 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-13 19:10:59,291 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-13 19:10:59,291 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-13 19:10:59,292 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-13 19:10:59,292 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-13 19:10:59,292 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-13 19:10:59,292 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-13 19:10:59,293 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-13 19:10:59,293 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-13 19:10:59,293 INFO L153 SettingsManager]: * Use SBE=true [2025-04-13 19:10:59,293 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-13 19:10:59,294 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-13 19:10:59,294 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-13 19:10:59,294 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-13 19:10:59,294 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-13 19:10:59,294 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-13 19:10:59,294 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-13 19:10:59,294 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-13 19:10:59,294 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-13 19:10:59,294 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-13 19:10:59,294 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-13 19:10:59,294 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-13 19:10:59,294 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-13 19:10:59,294 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-13 19:10:59,294 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 19:10:59,294 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 19:10:59,294 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 19:10:59,295 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 19:10:59,295 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-13 19:10:59,295 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 19:10:59,295 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 19:10:59,295 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 19:10:59,295 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 19:10:59,295 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-13 19:10:59,295 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-13 19:10:59,295 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-13 19:10:59,295 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-13 19:10:59,295 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-13 19:10:59,295 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-13 19:10:59,295 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-13 19:10:59,295 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-13 19:10:59,295 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-13 19:10:59,296 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:10:59,495 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-13 19:10:59,501 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-13 19:10:59,504 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-13 19:10:59,505 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-13 19:10:59,505 INFO L274 PluginConnector]: CDTParser initialized [2025-04-13 19:10:59,506 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread/fib_safe-11.i [2025-04-13 19:11:00,822 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bd361665f/7caac3c7c0c4467997c9bf9e45022f81/FLAGfe630db41 [2025-04-13 19:11:01,056 INFO L389 CDTParser]: Found 1 translation units. [2025-04-13 19:11:01,056 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread/fib_safe-11.i [2025-04-13 19:11:01,070 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bd361665f/7caac3c7c0c4467997c9bf9e45022f81/FLAGfe630db41 [2025-04-13 19:11:01,973 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bd361665f/7caac3c7c0c4467997c9bf9e45022f81 [2025-04-13 19:11:01,975 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-13 19:11:01,976 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-04-13 19:11:01,977 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-13 19:11:01,977 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-13 19:11:01,980 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-13 19:11:01,981 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 07:11:01" (1/1) ... [2025-04-13 19:11:01,981 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3a50b920 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:11:01, skipping insertion in model container [2025-04-13 19:11:01,981 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 07:11:01" (1/1) ... [2025-04-13 19:11:02,005 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-13 19:11:02,304 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-11.i[30241,30254] [2025-04-13 19:11:02,325 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 19:11:02,341 INFO L200 MainTranslator]: Completed pre-run [2025-04-13 19:11:02,396 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-11.i[30241,30254] [2025-04-13 19:11:02,402 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 19:11:02,428 INFO L204 MainTranslator]: Completed translation [2025-04-13 19:11:02,430 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:11:02 WrapperNode [2025-04-13 19:11:02,430 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-13 19:11:02,431 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-13 19:11:02,431 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-13 19:11:02,431 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-13 19:11:02,436 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:11:02" (1/1) ... [2025-04-13 19:11:02,447 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:11:02" (1/1) ... [2025-04-13 19:11:02,462 INFO L138 Inliner]: procedures = 164, calls = 20, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 63 [2025-04-13 19:11:02,462 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-13 19:11:02,463 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-13 19:11:02,463 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-13 19:11:02,463 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-13 19:11:02,468 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:11:02" (1/1) ... [2025-04-13 19:11:02,469 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:11:02" (1/1) ... [2025-04-13 19:11:02,471 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:11:02" (1/1) ... [2025-04-13 19:11:02,481 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:11:02,481 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:11:02" (1/1) ... [2025-04-13 19:11:02,481 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:11:02" (1/1) ... [2025-04-13 19:11:02,489 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:11:02" (1/1) ... [2025-04-13 19:11:02,489 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:11:02" (1/1) ... [2025-04-13 19:11:02,491 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:11:02" (1/1) ... [2025-04-13 19:11:02,492 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:11:02" (1/1) ... [2025-04-13 19:11:02,495 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:11:02" (1/1) ... [2025-04-13 19:11:02,498 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-13 19:11:02,498 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-13 19:11:02,498 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-13 19:11:02,498 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-13 19:11:02,499 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:11:02" (1/1) ... [2025-04-13 19:11:02,502 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 19:11:02,511 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 19:11:02,523 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:11:02,526 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:11:02,543 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2025-04-13 19:11:02,543 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2025-04-13 19:11:02,543 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2025-04-13 19:11:02,543 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2025-04-13 19:11:02,543 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-04-13 19:11:02,543 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-13 19:11:02,543 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-04-13 19:11:02,543 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-04-13 19:11:02,543 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-13 19:11:02,543 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-13 19:11:02,544 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:11:02,626 INFO L234 CfgBuilder]: Building ICFG [2025-04-13 19:11:02,628 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-13 19:11:02,742 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-13 19:11:02,743 INFO L289 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-13 19:11:02,743 INFO L294 CfgBuilder]: Performing block encoding [2025-04-13 19:11:02,832 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:11:02,837 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:11:02,839 INFO L313 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-13 19:11:02,840 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.04 07:11:02 BoogieIcfgContainer [2025-04-13 19:11:02,840 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-13 19:11:02,841 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-13 19:11:02,841 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-13 19:11:02,846 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-13 19:11:02,846 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.04 07:11:01" (1/3) ... [2025-04-13 19:11:02,846 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7de6f2ea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 07:11:02, skipping insertion in model container [2025-04-13 19:11:02,846 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:11:02" (2/3) ... [2025-04-13 19:11:02,847 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7de6f2ea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 07:11:02, skipping insertion in model container [2025-04-13 19:11:02,847 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.04 07:11:02" (3/3) ... [2025-04-13 19:11:02,848 INFO L128 eAbstractionObserver]: Analyzing ICFG fib_safe-11.i [2025-04-13 19:11:02,858 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-13 19:11:02,859 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG fib_safe-11.i that has 3 procedures, 21 locations, 23 edges, 1 initial locations, 3 loop locations, and 1 error locations. [2025-04-13 19:11:02,859 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-13 19:11:02,890 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-04-13 19:11:02,915 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 27 places, 25 transitions, 58 flow [2025-04-13 19:11:02,932 INFO L116 PetriNetUnfolderBase]: 5/23 cut-off events. [2025-04-13 19:11:02,935 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-13 19:11:02,939 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 4. Compared 22 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 19:11:02,939 INFO L82 GeneralOperation]: Start removeDead. Operand has 27 places, 25 transitions, 58 flow [2025-04-13 19:11:02,941 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 25 places, 23 transitions, 52 flow [2025-04-13 19:11:02,950 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-13 19:11:02,959 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;@64af81a8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-13 19:11:02,959 INFO L341 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2025-04-13 19:11:02,968 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-13 19:11:02,968 INFO L116 PetriNetUnfolderBase]: 5/21 cut-off events. [2025-04-13 19:11:02,968 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-13 19:11:02,968 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:11:02,971 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:11:02,971 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:11:02,975 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:11:02,976 INFO L85 PathProgramCache]: Analyzing trace with hash -1561770242, now seen corresponding path program 1 times [2025-04-13 19:11:02,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:11:02,981 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [219209709] [2025-04-13 19:11:02,981 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:11:02,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:11:03,043 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-13 19:11:03,060 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-13 19:11:03,062 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:11:03,062 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:11:03,187 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:11:03,187 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:11:03,187 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [219209709] [2025-04-13 19:11:03,188 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [219209709] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:11:03,188 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:11:03,188 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 19:11:03,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [878462770] [2025-04-13 19:11:03,189 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:11:03,194 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 19:11:03,197 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:11:03,212 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 19:11:03,212 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 19:11:03,213 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 25 [2025-04-13 19:11:03,215 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 25 places, 23 transitions, 52 flow. Second operand has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 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:11:03,215 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:11:03,215 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 25 [2025-04-13 19:11:03,216 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:11:03,318 INFO L116 PetriNetUnfolderBase]: 115/193 cut-off events. [2025-04-13 19:11:03,319 INFO L117 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-04-13 19:11:03,319 INFO L83 FinitePrefix]: Finished finitePrefix Result has 382 conditions, 193 events. 115/193 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 564 event pairs, 20 based on Foata normal form. 0/133 useless extension candidates. Maximal degree in co-relation 368. Up to 118 conditions per place. [2025-04-13 19:11:03,321 INFO L140 encePairwiseOnDemand]: 20/25 looper letters, 20 selfloop transitions, 2 changer transitions 1/28 dead transitions. [2025-04-13 19:11:03,321 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 27 places, 28 transitions, 108 flow [2025-04-13 19:11:03,323 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 19:11:03,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-13 19:11:03,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 49 transitions. [2025-04-13 19:11:03,331 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6533333333333333 [2025-04-13 19:11:03,332 INFO L175 Difference]: Start difference. First operand has 25 places, 23 transitions, 52 flow. Second operand 3 states and 49 transitions. [2025-04-13 19:11:03,332 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 27 places, 28 transitions, 108 flow [2025-04-13 19:11:03,336 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 25 places, 28 transitions, 106 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-13 19:11:03,338 INFO L231 Difference]: Finished difference. Result has 26 places, 21 transitions, 56 flow [2025-04-13 19:11:03,339 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 19:11:03,341 INFO L279 CegarLoopForPetriNet]: 25 programPoint places, 1 predicate places. [2025-04-13 19:11:03,342 INFO L485 AbstractCegarLoop]: Abstraction has has 26 places, 21 transitions, 56 flow [2025-04-13 19:11:03,342 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 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:11:03,342 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:11:03,342 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:11:03,342 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-13 19:11:03,342 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:11:03,342 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:11:03,343 INFO L85 PathProgramCache]: Analyzing trace with hash -1170211856, now seen corresponding path program 1 times [2025-04-13 19:11:03,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:11:03,343 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [949768228] [2025-04-13 19:11:03,343 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:11:03,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:11:03,354 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-04-13 19:11:03,369 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-13 19:11:03,369 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:11:03,369 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:11:03,434 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:11:03,434 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:11:03,434 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [949768228] [2025-04-13 19:11:03,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [949768228] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 19:11:03,434 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1592568089] [2025-04-13 19:11:03,434 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:11:03,434 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 19:11:03,434 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 19:11:03,438 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:11:03,439 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:11:03,484 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-04-13 19:11:03,499 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-13 19:11:03,499 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:11:03,499 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:11:03,500 INFO L256 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-04-13 19:11:03,502 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 19:11:03,528 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:11:03,528 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 19:11:03,546 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:11:03,546 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1592568089] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 19:11:03,546 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 19:11:03,547 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-04-13 19:11:03,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [976412731] [2025-04-13 19:11:03,547 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 19:11:03,547 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-13 19:11:03,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:11:03,548 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-13 19:11:03,548 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-04-13 19:11:03,548 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 25 [2025-04-13 19:11:03,548 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 26 places, 21 transitions, 56 flow. Second operand has 7 states, 7 states have (on average 9.0) internal successors, (63), 7 states have internal predecessors, (63), 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:11:03,548 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:11:03,548 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 25 [2025-04-13 19:11:03,548 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:11:03,652 INFO L116 PetriNetUnfolderBase]: 151/247 cut-off events. [2025-04-13 19:11:03,652 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-13 19:11:03,653 INFO L83 FinitePrefix]: Finished finitePrefix Result has 554 conditions, 247 events. 151/247 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 714 event pairs, 20 based on Foata normal form. 0/184 useless extension candidates. Maximal degree in co-relation 539. Up to 91 conditions per place. [2025-04-13 19:11:03,654 INFO L140 encePairwiseOnDemand]: 22/25 looper letters, 38 selfloop transitions, 5 changer transitions 0/48 dead transitions. [2025-04-13 19:11:03,654 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 30 places, 48 transitions, 202 flow [2025-04-13 19:11:03,654 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-13 19:11:03,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-13 19:11:03,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 88 transitions. [2025-04-13 19:11:03,655 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5866666666666667 [2025-04-13 19:11:03,655 INFO L175 Difference]: Start difference. First operand has 26 places, 21 transitions, 56 flow. Second operand 6 states and 88 transitions. [2025-04-13 19:11:03,655 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 30 places, 48 transitions, 202 flow [2025-04-13 19:11:03,656 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 48 transitions, 200 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-13 19:11:03,656 INFO L231 Difference]: Finished difference. Result has 32 places, 24 transitions, 90 flow [2025-04-13 19:11:03,657 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 19:11:03,657 INFO L279 CegarLoopForPetriNet]: 25 programPoint places, 7 predicate places. [2025-04-13 19:11:03,657 INFO L485 AbstractCegarLoop]: Abstraction has has 32 places, 24 transitions, 90 flow [2025-04-13 19:11:03,657 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.0) internal successors, (63), 7 states have internal predecessors, (63), 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:11:03,657 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:11:03,657 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:11:03,664 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-04-13 19:11:03,862 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 19:11:03,862 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:11:03,863 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:11:03,863 INFO L85 PathProgramCache]: Analyzing trace with hash 493351806, now seen corresponding path program 2 times [2025-04-13 19:11:03,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:11:03,863 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [512431932] [2025-04-13 19:11:03,863 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 19:11:03,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:11:03,873 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 15 statements into 2 equivalence classes. [2025-04-13 19:11:03,891 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 15 of 15 statements. [2025-04-13 19:11:03,891 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 19:11:03,891 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:11:03,978 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 19:11:03,978 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:11:03,978 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [512431932] [2025-04-13 19:11:03,978 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [512431932] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 19:11:03,978 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1314711922] [2025-04-13 19:11:03,978 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 19:11:03,978 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 19:11:03,979 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 19:11:03,981 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:11:03,983 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:11:04,025 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 15 statements into 2 equivalence classes. [2025-04-13 19:11:04,045 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 15 of 15 statements. [2025-04-13 19:11:04,045 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 19:11:04,045 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:11:04,046 INFO L256 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-04-13 19:11:04,046 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 19:11:04,067 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 19:11:04,067 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 19:11:04,125 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 19:11:04,126 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1314711922] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 19:11:04,126 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 19:11:04,126 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2025-04-13 19:11:04,126 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2006241018] [2025-04-13 19:11:04,126 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 19:11:04,126 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-04-13 19:11:04,126 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:11:04,127 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-04-13 19:11:04,127 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-04-13 19:11:04,127 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 25 [2025-04-13 19:11:04,127 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 24 transitions, 90 flow. Second operand has 13 states, 13 states have (on average 8.538461538461538) internal successors, (111), 13 states have internal predecessors, (111), 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:11:04,127 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:11:04,127 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 25 [2025-04-13 19:11:04,127 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:11:04,281 INFO L116 PetriNetUnfolderBase]: 259/409 cut-off events. [2025-04-13 19:11:04,281 INFO L117 PetriNetUnfolderBase]: For 198/198 co-relation queries the response was YES. [2025-04-13 19:11:04,282 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1080 conditions, 409 events. 259/409 cut-off events. For 198/198 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 1224 event pairs, 20 based on Foata normal form. 54/373 useless extension candidates. Maximal degree in co-relation 1061. Up to 109 conditions per place. [2025-04-13 19:11:04,284 INFO L140 encePairwiseOnDemand]: 22/25 looper letters, 74 selfloop transitions, 11 changer transitions 0/90 dead transitions. [2025-04-13 19:11:04,284 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 90 transitions, 416 flow [2025-04-13 19:11:04,284 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-13 19:11:04,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-04-13 19:11:04,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 175 transitions. [2025-04-13 19:11:04,285 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5833333333333334 [2025-04-13 19:11:04,285 INFO L175 Difference]: Start difference. First operand has 32 places, 24 transitions, 90 flow. Second operand 12 states and 175 transitions. [2025-04-13 19:11:04,285 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 90 transitions, 416 flow [2025-04-13 19:11:04,287 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 90 transitions, 402 flow, removed 6 selfloop flow, removed 1 redundant places. [2025-04-13 19:11:04,287 INFO L231 Difference]: Finished difference. Result has 48 places, 30 transitions, 160 flow [2025-04-13 19:11:04,288 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 19:11:04,288 INFO L279 CegarLoopForPetriNet]: 25 programPoint places, 23 predicate places. [2025-04-13 19:11:04,288 INFO L485 AbstractCegarLoop]: Abstraction has has 48 places, 30 transitions, 160 flow [2025-04-13 19:11:04,288 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 8.538461538461538) internal successors, (111), 13 states have internal predecessors, (111), 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:11:04,288 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:11:04,288 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:11:04,294 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 19:11:04,493 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 19:11:04,493 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:11:04,493 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:11:04,493 INFO L85 PathProgramCache]: Analyzing trace with hash -1439646146, now seen corresponding path program 3 times [2025-04-13 19:11:04,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:11:04,494 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [225811037] [2025-04-13 19:11:04,494 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 19:11:04,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:11:04,500 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 21 statements into 6 equivalence classes. [2025-04-13 19:11:04,522 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) and asserted 21 of 21 statements. [2025-04-13 19:11:04,522 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2025-04-13 19:11:04,522 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:11:04,687 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 19:11:04,687 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:11:04,687 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [225811037] [2025-04-13 19:11:04,687 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [225811037] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 19:11:04,687 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1633981303] [2025-04-13 19:11:04,687 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 19:11:04,687 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 19:11:04,687 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 19:11:04,689 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:11:04,691 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:11:04,724 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 21 statements into 6 equivalence classes. [2025-04-13 19:11:04,743 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) and asserted 21 of 21 statements. [2025-04-13 19:11:04,743 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2025-04-13 19:11:04,743 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:11:04,744 INFO L256 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-04-13 19:11:04,745 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 19:11:04,778 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 19:11:04,778 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 19:11:04,967 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 19:11:04,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1633981303] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 19:11:04,967 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 19:11:04,967 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 25 [2025-04-13 19:11:04,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1629238622] [2025-04-13 19:11:04,968 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 19:11:04,968 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-04-13 19:11:04,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:11:04,968 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-04-13 19:11:04,969 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2025-04-13 19:11:04,969 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 25 [2025-04-13 19:11:04,969 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 30 transitions, 160 flow. Second operand has 25 states, 25 states have (on average 8.28) internal successors, (207), 25 states have internal predecessors, (207), 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:11:04,969 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:11:04,970 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 25 [2025-04-13 19:11:04,970 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:11:05,230 INFO L116 PetriNetUnfolderBase]: 475/733 cut-off events. [2025-04-13 19:11:05,230 INFO L117 PetriNetUnfolderBase]: For 4194/4194 co-relation queries the response was YES. [2025-04-13 19:11:05,233 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2212 conditions, 733 events. 475/733 cut-off events. For 4194/4194 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 2249 event pairs, 20 based on Foata normal form. 108/679 useless extension candidates. Maximal degree in co-relation 2186. Up to 190 conditions per place. [2025-04-13 19:11:05,235 INFO L140 encePairwiseOnDemand]: 22/25 looper letters, 146 selfloop transitions, 23 changer transitions 0/174 dead transitions. [2025-04-13 19:11:05,235 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 174 transitions, 858 flow [2025-04-13 19:11:05,235 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-04-13 19:11:05,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2025-04-13 19:11:05,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 349 transitions. [2025-04-13 19:11:05,237 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5816666666666667 [2025-04-13 19:11:05,237 INFO L175 Difference]: Start difference. First operand has 48 places, 30 transitions, 160 flow. Second operand 24 states and 349 transitions. [2025-04-13 19:11:05,237 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 174 transitions, 858 flow [2025-04-13 19:11:05,241 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 174 transitions, 786 flow, removed 31 selfloop flow, removed 5 redundant places. [2025-04-13 19:11:05,243 INFO L231 Difference]: Finished difference. Result has 78 places, 42 transitions, 280 flow [2025-04-13 19:11:05,243 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=24, PETRI_FLOW=280, PETRI_PLACES=78, PETRI_TRANSITIONS=42} [2025-04-13 19:11:05,243 INFO L279 CegarLoopForPetriNet]: 25 programPoint places, 53 predicate places. [2025-04-13 19:11:05,243 INFO L485 AbstractCegarLoop]: Abstraction has has 78 places, 42 transitions, 280 flow [2025-04-13 19:11:05,243 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 8.28) internal successors, (207), 25 states have internal predecessors, (207), 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:11:05,244 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:11:05,244 INFO L206 CegarLoopForPetriNet]: trace histogram [22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:11:05,250 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:11:05,444 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 19:11:05,444 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:11:05,445 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:11:05,445 INFO L85 PathProgramCache]: Analyzing trace with hash -1097522242, now seen corresponding path program 4 times [2025-04-13 19:11:05,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:11:05,445 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1984514577] [2025-04-13 19:11:05,445 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 19:11:05,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:11:05,454 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 33 statements into 2 equivalence classes. [2025-04-13 19:11:05,465 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 33 of 33 statements. [2025-04-13 19:11:05,465 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 19:11:05,465 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:11:05,866 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:11:05,866 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:11:05,866 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1984514577] [2025-04-13 19:11:05,866 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1984514577] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 19:11:05,866 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1589100625] [2025-04-13 19:11:05,866 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 19:11:05,867 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 19:11:05,867 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 19:11:05,870 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:11:05,871 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:11:05,908 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 33 statements into 2 equivalence classes. [2025-04-13 19:11:05,933 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 33 of 33 statements. [2025-04-13 19:11:05,933 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 19:11:05,933 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:11:05,934 INFO L256 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-04-13 19:11:05,936 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 19:11:05,983 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:11:05,984 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 19:11:06,248 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:11:06,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1589100625] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 19:11:06,248 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 19:11:06,248 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 26 [2025-04-13 19:11:06,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [346338565] [2025-04-13 19:11:06,248 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 19:11:06,248 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-04-13 19:11:06,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:11:06,249 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-04-13 19:11:06,249 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2025-04-13 19:11:06,250 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 25 [2025-04-13 19:11:06,250 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 42 transitions, 280 flow. Second operand has 26 states, 26 states have (on average 8.26923076923077) internal successors, (215), 26 states have internal predecessors, (215), 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:11:06,250 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:11:06,250 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 25 [2025-04-13 19:11:06,250 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:11:06,561 INFO L116 PetriNetUnfolderBase]: 511/787 cut-off events. [2025-04-13 19:11:06,561 INFO L117 PetriNetUnfolderBase]: For 5544/5544 co-relation queries the response was YES. [2025-04-13 19:11:06,563 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2494 conditions, 787 events. 511/787 cut-off events. For 5544/5544 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 2413 event pairs, 20 based on Foata normal form. 18/631 useless extension candidates. Maximal degree in co-relation 2456. Up to 172 conditions per place. [2025-04-13 19:11:06,565 INFO L140 encePairwiseOnDemand]: 22/25 looper letters, 158 selfloop transitions, 25 changer transitions 0/188 dead transitions. [2025-04-13 19:11:06,565 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 188 transitions, 950 flow [2025-04-13 19:11:06,566 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-04-13 19:11:06,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2025-04-13 19:11:06,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 367 transitions. [2025-04-13 19:11:06,568 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5646153846153846 [2025-04-13 19:11:06,568 INFO L175 Difference]: Start difference. First operand has 78 places, 42 transitions, 280 flow. Second operand 26 states and 367 transitions. [2025-04-13 19:11:06,568 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 103 places, 188 transitions, 950 flow [2025-04-13 19:11:06,581 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 188 transitions, 850 flow, removed 39 selfloop flow, removed 11 redundant places. [2025-04-13 19:11:06,583 INFO L231 Difference]: Finished difference. Result has 94 places, 44 transitions, 256 flow [2025-04-13 19:11:06,583 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=184, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=26, PETRI_FLOW=256, PETRI_PLACES=94, PETRI_TRANSITIONS=44} [2025-04-13 19:11:06,584 INFO L279 CegarLoopForPetriNet]: 25 programPoint places, 69 predicate places. [2025-04-13 19:11:06,584 INFO L485 AbstractCegarLoop]: Abstraction has has 94 places, 44 transitions, 256 flow [2025-04-13 19:11:06,584 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 8.26923076923077) internal successors, (215), 26 states have internal predecessors, (215), 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:11:06,584 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:11:06,584 INFO L206 CegarLoopForPetriNet]: trace histogram [24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:11:06,594 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-04-13 19:11:06,785 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 19:11:06,785 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:11:06,785 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:11:06,785 INFO L85 PathProgramCache]: Analyzing trace with hash 1843892734, now seen corresponding path program 5 times [2025-04-13 19:11:06,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:11:06,786 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1673110467] [2025-04-13 19:11:06,786 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 19:11:06,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:11:06,792 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 35 statements into 13 equivalence classes. [2025-04-13 19:11:06,865 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 13 check-sat command(s) and asserted 35 of 35 statements. [2025-04-13 19:11:06,865 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 13 check-sat command(s) [2025-04-13 19:11:06,865 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:11:08,317 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:11:08,317 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:11:08,317 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1673110467] [2025-04-13 19:11:08,317 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1673110467] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 19:11:08,317 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [300199681] [2025-04-13 19:11:08,317 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 19:11:08,318 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 19:11:08,318 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 19:11:08,319 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:11:08,321 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:11:08,357 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 35 statements into 13 equivalence classes. [2025-04-13 19:11:08,390 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 13 check-sat command(s) and asserted 35 of 35 statements. [2025-04-13 19:11:08,390 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 13 check-sat command(s) [2025-04-13 19:11:08,390 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:11:08,393 INFO L256 TraceCheckSpWp]: Trace formula consists of 308 conjuncts, 83 conjuncts are in the unsatisfiable core [2025-04-13 19:11:08,396 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 19:11:09,724 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 253 proven. 47 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:11:09,724 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 19:11:11,168 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:11:11,168 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [300199681] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 19:11:11,168 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 19:11:11,168 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29, 29] total 86 [2025-04-13 19:11:11,168 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [281381365] [2025-04-13 19:11:11,168 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 19:11:11,169 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 88 states [2025-04-13 19:11:11,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:11:11,170 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2025-04-13 19:11:11,172 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1160, Invalid=6496, Unknown=0, NotChecked=0, Total=7656 [2025-04-13 19:11:11,267 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 25 [2025-04-13 19:11:11,267 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 44 transitions, 256 flow. Second operand has 88 states, 88 states have (on average 3.1818181818181817) internal successors, (280), 88 states have internal predecessors, (280), 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:11:11,267 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:11:11,267 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 25 [2025-04-13 19:11:11,267 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:13:42,519 INFO L116 PetriNetUnfolderBase]: 93820/141733 cut-off events. [2025-04-13 19:13:42,519 INFO L117 PetriNetUnfolderBase]: For 752189/752189 co-relation queries the response was YES. [2025-04-13 19:13:43,111 INFO L83 FinitePrefix]: Finished finitePrefix Result has 426991 conditions, 141733 events. 93820/141733 cut-off events. For 752189/752189 co-relation queries the response was YES. Maximal size of possible extension queue 1036. Compared 969295 event pairs, 898 based on Foata normal form. 2077/125497 useless extension candidates. Maximal degree in co-relation 426949. Up to 22399 conditions per place. [2025-04-13 19:13:43,719 INFO L140 encePairwiseOnDemand]: 17/25 looper letters, 2375 selfloop transitions, 6586 changer transitions 1695/10656 dead transitions. [2025-04-13 19:13:43,720 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 820 places, 10656 transitions, 86081 flow [2025-04-13 19:13:43,723 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 727 states. [2025-04-13 19:13:43,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 727 states. [2025-04-13 19:13:43,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 727 states to 727 states and 6943 transitions. [2025-04-13 19:13:43,765 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3820082530949106 [2025-04-13 19:13:43,765 INFO L175 Difference]: Start difference. First operand has 94 places, 44 transitions, 256 flow. Second operand 727 states and 6943 transitions. [2025-04-13 19:13:43,765 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 820 places, 10656 transitions, 86081 flow [2025-04-13 19:13:47,312 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 797 places, 10656 transitions, 71587 flow, removed 2419 selfloop flow, removed 23 redundant places. [2025-04-13 19:13:47,398 INFO L231 Difference]: Finished difference. Result has 1173 places, 6704 transitions, 41977 flow [2025-04-13 19:13:47,399 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=196, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=727, PETRI_FLOW=41977, PETRI_PLACES=1173, PETRI_TRANSITIONS=6704} [2025-04-13 19:13:47,400 INFO L279 CegarLoopForPetriNet]: 25 programPoint places, 1148 predicate places. [2025-04-13 19:13:47,400 INFO L485 AbstractCegarLoop]: Abstraction has has 1173 places, 6704 transitions, 41977 flow [2025-04-13 19:13:47,401 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 88 states, 88 states have (on average 3.1818181818181817) internal successors, (280), 88 states have internal predecessors, (280), 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:13:47,401 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:13:47,401 INFO L206 CegarLoopForPetriNet]: trace histogram [24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:13:47,409 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:13:47,605 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 19:13:47,605 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:13:47,606 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:13:47,606 INFO L85 PathProgramCache]: Analyzing trace with hash -1863893976, now seen corresponding path program 1 times [2025-04-13 19:13:47,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:13:47,607 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1723410946] [2025-04-13 19:13:47,607 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:13:47,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:13:47,628 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-04-13 19:13:47,732 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-04-13 19:13:47,733 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:13:47,733 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:13:49,244 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:13:49,244 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:13:49,244 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1723410946] [2025-04-13 19:13:49,244 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1723410946] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 19:13:49,244 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1925804102] [2025-04-13 19:13:49,244 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:13:49,244 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 19:13:49,244 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 19:13:49,247 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:13:49,251 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:13:49,296 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-04-13 19:13:49,323 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-04-13 19:13:49,323 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:13:49,323 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:13:49,325 INFO L256 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 85 conjuncts are in the unsatisfiable core [2025-04-13 19:13:49,327 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 19:13:50,758 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 253 proven. 47 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:13:50,759 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 19:13:52,208 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:13:52,209 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1925804102] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 19:13:52,209 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 19:13:52,209 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31, 31] total 92 [2025-04-13 19:13:52,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [573425068] [2025-04-13 19:13:52,209 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 19:13:52,210 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 94 states [2025-04-13 19:13:52,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:13:52,212 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 94 interpolants. [2025-04-13 19:13:52,214 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1248, Invalid=7494, Unknown=0, NotChecked=0, Total=8742 [2025-04-13 19:13:52,465 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 25 [2025-04-13 19:13:52,466 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1173 places, 6704 transitions, 41977 flow. Second operand has 94 states, 94 states have (on average 3.24468085106383) internal successors, (305), 94 states have internal predecessors, (305), 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:13:52,466 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:13:52,466 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 25 [2025-04-13 19:13:52,466 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand