/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/weaver/test-easy6.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.cfg-lbe-improvements-94356ea-m [2025-04-13 21:00:04,181 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-13 21:00:04,233 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 21:00:04,236 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-13 21:00:04,236 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-13 21:00:04,249 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-13 21:00:04,250 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-13 21:00:04,250 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-13 21:00:04,250 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-13 21:00:04,250 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-13 21:00:04,250 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-13 21:00:04,250 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-13 21:00:04,250 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-13 21:00:04,250 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-13 21:00:04,250 INFO L153 SettingsManager]: * Use SBE=true [2025-04-13 21:00:04,250 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-13 21:00:04,250 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-13 21:00:04,251 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-13 21:00:04,251 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-13 21:00:04,251 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-13 21:00:04,251 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-13 21:00:04,251 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-13 21:00:04,251 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-13 21:00:04,251 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-13 21:00:04,251 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-13 21:00:04,251 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-13 21:00:04,251 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-13 21:00:04,251 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-13 21:00:04,251 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-13 21:00:04,251 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 21:00:04,251 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 21:00:04,251 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 21:00:04,251 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 21:00:04,251 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-13 21:00:04,252 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 21:00:04,252 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 21:00:04,252 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 21:00:04,252 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 21:00:04,252 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-13 21:00:04,252 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-13 21:00:04,252 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-13 21:00:04,252 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-13 21:00:04,252 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-13 21:00:04,252 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-13 21:00:04,252 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-13 21:00:04,252 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-13 21:00:04,252 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-13 21:00:04,252 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 21:00:04,446 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-13 21:00:04,453 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-13 21:00:04,454 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-13 21:00:04,455 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-13 21:00:04,456 INFO L274 PluginConnector]: CDTParser initialized [2025-04-13 21:00:04,457 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/test-easy6.wvr.c [2025-04-13 21:00:05,739 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f8e2078a1/3b94adb47c15413288ce958b4921bf0e/FLAGe48424087 [2025-04-13 21:00:05,903 INFO L389 CDTParser]: Found 1 translation units. [2025-04-13 21:00:05,904 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/test-easy6.wvr.c [2025-04-13 21:00:05,910 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f8e2078a1/3b94adb47c15413288ce958b4921bf0e/FLAGe48424087 [2025-04-13 21:00:06,741 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f8e2078a1/3b94adb47c15413288ce958b4921bf0e [2025-04-13 21:00:06,744 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-13 21:00:06,745 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-04-13 21:00:06,746 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-13 21:00:06,746 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-13 21:00:06,749 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-13 21:00:06,749 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 09:00:06" (1/1) ... [2025-04-13 21:00:06,750 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2d126bc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:00:06, skipping insertion in model container [2025-04-13 21:00:06,750 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 09:00:06" (1/1) ... [2025-04-13 21:00:06,760 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-13 21:00:06,906 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/test-easy6.wvr.c[2032,2045] [2025-04-13 21:00:06,909 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 21:00:06,917 INFO L200 MainTranslator]: Completed pre-run [2025-04-13 21:00:06,948 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/test-easy6.wvr.c[2032,2045] [2025-04-13 21:00:06,948 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 21:00:06,966 INFO L204 MainTranslator]: Completed translation [2025-04-13 21:00:06,966 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:00:06 WrapperNode [2025-04-13 21:00:06,967 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-13 21:00:06,967 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-13 21:00:06,967 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-13 21:00:06,967 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-13 21:00:06,975 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:00:06" (1/1) ... [2025-04-13 21:00:06,981 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:00:06" (1/1) ... [2025-04-13 21:00:06,999 INFO L138 Inliner]: procedures = 18, calls = 13, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 92 [2025-04-13 21:00:06,999 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-13 21:00:07,000 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-13 21:00:07,000 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-13 21:00:07,000 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-13 21:00:07,006 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:00:06" (1/1) ... [2025-04-13 21:00:07,007 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:00:06" (1/1) ... [2025-04-13 21:00:07,013 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:00:06" (1/1) ... [2025-04-13 21:00:07,024 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 21:00:07,025 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:00:06" (1/1) ... [2025-04-13 21:00:07,025 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:00:06" (1/1) ... [2025-04-13 21:00:07,027 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:00:06" (1/1) ... [2025-04-13 21:00:07,032 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:00:06" (1/1) ... [2025-04-13 21:00:07,034 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:00:06" (1/1) ... [2025-04-13 21:00:07,034 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:00:06" (1/1) ... [2025-04-13 21:00:07,035 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:00:06" (1/1) ... [2025-04-13 21:00:07,039 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-13 21:00:07,039 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-13 21:00:07,039 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-13 21:00:07,039 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-13 21:00:07,042 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:00:06" (1/1) ... [2025-04-13 21:00:07,046 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 21:00:07,055 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 21:00:07,064 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 21:00:07,066 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 21:00:07,081 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-13 21:00:07,081 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-13 21:00:07,081 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-13 21:00:07,081 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-13 21:00:07,081 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-13 21:00:07,081 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-04-13 21:00:07,081 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-13 21:00:07,081 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-13 21:00:07,082 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 21:00:07,142 INFO L234 CfgBuilder]: Building ICFG [2025-04-13 21:00:07,143 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-13 21:00:07,255 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-13 21:00:07,256 INFO L289 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-13 21:00:07,256 INFO L294 CfgBuilder]: Performing block encoding [2025-04-13 21:00:07,353 INFO L313 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-13 21:00:07,353 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.04 09:00:07 BoogieIcfgContainer [2025-04-13 21:00:07,353 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-13 21:00:07,356 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-13 21:00:07,357 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-13 21:00:07,360 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-13 21:00:07,360 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.04 09:00:06" (1/3) ... [2025-04-13 21:00:07,362 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@43fd9a34 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 09:00:07, skipping insertion in model container [2025-04-13 21:00:07,362 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:00:06" (2/3) ... [2025-04-13 21:00:07,362 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@43fd9a34 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 09:00:07, skipping insertion in model container [2025-04-13 21:00:07,362 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.04 09:00:07" (3/3) ... [2025-04-13 21:00:07,363 INFO L128 eAbstractionObserver]: Analyzing ICFG test-easy6.wvr.c [2025-04-13 21:00:07,374 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-13 21:00:07,375 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG test-easy6.wvr.c that has 3 procedures, 32 locations, 29 edges, 1 initial locations, 0 loop locations, and 1 error locations. [2025-04-13 21:00:07,375 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-13 21:00:07,413 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-04-13 21:00:07,439 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 38 places, 31 transitions, 76 flow [2025-04-13 21:00:07,462 INFO L116 PetriNetUnfolderBase]: 0/29 cut-off events. [2025-04-13 21:00:07,463 INFO L117 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-04-13 21:00:07,465 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38 conditions, 29 events. 0/29 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 26 event pairs, 0 based on Foata normal form. 0/28 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2025-04-13 21:00:07,465 INFO L82 GeneralOperation]: Start removeDead. Operand has 38 places, 31 transitions, 76 flow [2025-04-13 21:00:07,469 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 35 places, 28 transitions, 68 flow [2025-04-13 21:00:07,475 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-13 21:00:07,484 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;@3e62b8f2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-13 21:00:07,484 INFO L341 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2025-04-13 21:00:07,497 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-13 21:00:07,497 INFO L116 PetriNetUnfolderBase]: 0/27 cut-off events. [2025-04-13 21:00:07,497 INFO L117 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-04-13 21:00:07,498 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 21:00:07,498 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:00:07,500 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 21:00:07,504 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:00:07,504 INFO L85 PathProgramCache]: Analyzing trace with hash -1621675096, now seen corresponding path program 1 times [2025-04-13 21:00:07,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:00:07,509 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1053626447] [2025-04-13 21:00:07,510 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 21:00:07,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:00:07,570 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-04-13 21:00:07,601 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-04-13 21:00:07,601 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 21:00:07,601 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:00:07,848 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 21:00:07,849 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:00:07,849 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1053626447] [2025-04-13 21:00:07,849 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1053626447] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:00:07,849 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:00:07,849 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-13 21:00:07,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [394951888] [2025-04-13 21:00:07,851 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:00:07,855 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-13 21:00:07,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:00:07,870 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-13 21:00:07,870 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-04-13 21:00:07,901 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 31 [2025-04-13 21:00:07,903 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 28 transitions, 68 flow. Second operand has 7 states, 7 states have (on average 16.285714285714285) internal successors, (114), 7 states have internal predecessors, (114), 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 21:00:07,903 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 21:00:07,903 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 31 [2025-04-13 21:00:07,904 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 21:00:08,093 INFO L116 PetriNetUnfolderBase]: 92/251 cut-off events. [2025-04-13 21:00:08,094 INFO L117 PetriNetUnfolderBase]: For 29/29 co-relation queries the response was YES. [2025-04-13 21:00:08,095 INFO L83 FinitePrefix]: Finished finitePrefix Result has 487 conditions, 251 events. 92/251 cut-off events. For 29/29 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1171 event pairs, 20 based on Foata normal form. 1/242 useless extension candidates. Maximal degree in co-relation 405. Up to 55 conditions per place. [2025-04-13 21:00:08,100 INFO L140 encePairwiseOnDemand]: 25/31 looper letters, 30 selfloop transitions, 6 changer transitions 10/58 dead transitions. [2025-04-13 21:00:08,100 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 58 transitions, 241 flow [2025-04-13 21:00:08,102 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-13 21:00:08,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-04-13 21:00:08,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 145 transitions. [2025-04-13 21:00:08,112 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6682027649769585 [2025-04-13 21:00:08,114 INFO L175 Difference]: Start difference. First operand has 35 places, 28 transitions, 68 flow. Second operand 7 states and 145 transitions. [2025-04-13 21:00:08,114 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 58 transitions, 241 flow [2025-04-13 21:00:08,119 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 58 transitions, 219 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-04-13 21:00:08,121 INFO L231 Difference]: Finished difference. Result has 40 places, 32 transitions, 95 flow [2025-04-13 21:00:08,123 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=60, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=95, PETRI_PLACES=40, PETRI_TRANSITIONS=32} [2025-04-13 21:00:08,126 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 5 predicate places. [2025-04-13 21:00:08,127 INFO L485 AbstractCegarLoop]: Abstraction has has 40 places, 32 transitions, 95 flow [2025-04-13 21:00:08,127 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 16.285714285714285) internal successors, (114), 7 states have internal predecessors, (114), 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 21:00:08,127 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 21:00:08,127 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:00:08,128 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-13 21:00:08,128 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 21:00:08,128 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:00:08,129 INFO L85 PathProgramCache]: Analyzing trace with hash -357764796, now seen corresponding path program 2 times [2025-04-13 21:00:08,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:00:08,129 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [82707174] [2025-04-13 21:00:08,129 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 21:00:08,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:00:08,135 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 28 statements into 1 equivalence classes. [2025-04-13 21:00:08,140 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-04-13 21:00:08,141 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 21:00:08,141 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:00:08,255 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 21:00:08,256 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:00:08,256 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [82707174] [2025-04-13 21:00:08,256 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [82707174] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:00:08,256 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:00:08,256 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-13 21:00:08,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1591140752] [2025-04-13 21:00:08,256 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:00:08,257 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-13 21:00:08,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:00:08,258 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-13 21:00:08,258 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-04-13 21:00:08,266 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 31 [2025-04-13 21:00:08,266 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 32 transitions, 95 flow. Second operand has 7 states, 7 states have (on average 14.571428571428571) internal successors, (102), 7 states have internal predecessors, (102), 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 21:00:08,267 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 21:00:08,267 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 31 [2025-04-13 21:00:08,267 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 21:00:08,458 INFO L116 PetriNetUnfolderBase]: 265/655 cut-off events. [2025-04-13 21:00:08,458 INFO L117 PetriNetUnfolderBase]: For 57/57 co-relation queries the response was YES. [2025-04-13 21:00:08,460 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1316 conditions, 655 events. 265/655 cut-off events. For 57/57 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 3782 event pairs, 60 based on Foata normal form. 4/642 useless extension candidates. Maximal degree in co-relation 1292. Up to 193 conditions per place. [2025-04-13 21:00:08,462 INFO L140 encePairwiseOnDemand]: 22/31 looper letters, 44 selfloop transitions, 16 changer transitions 2/76 dead transitions. [2025-04-13 21:00:08,462 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 76 transitions, 314 flow [2025-04-13 21:00:08,462 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-13 21:00:08,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-04-13 21:00:08,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 171 transitions. [2025-04-13 21:00:08,463 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6129032258064516 [2025-04-13 21:00:08,463 INFO L175 Difference]: Start difference. First operand has 40 places, 32 transitions, 95 flow. Second operand 9 states and 171 transitions. [2025-04-13 21:00:08,463 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 76 transitions, 314 flow [2025-04-13 21:00:08,466 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 76 transitions, 310 flow, removed 2 selfloop flow, removed 1 redundant places. [2025-04-13 21:00:08,466 INFO L231 Difference]: Finished difference. Result has 49 places, 48 transitions, 193 flow [2025-04-13 21:00:08,467 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=93, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=193, PETRI_PLACES=49, PETRI_TRANSITIONS=48} [2025-04-13 21:00:08,467 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 14 predicate places. [2025-04-13 21:00:08,467 INFO L485 AbstractCegarLoop]: Abstraction has has 49 places, 48 transitions, 193 flow [2025-04-13 21:00:08,467 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.571428571428571) internal successors, (102), 7 states have internal predecessors, (102), 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 21:00:08,467 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 21:00:08,467 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:00:08,467 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-13 21:00:08,468 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 21:00:08,468 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:00:08,468 INFO L85 PathProgramCache]: Analyzing trace with hash -347451490, now seen corresponding path program 3 times [2025-04-13 21:00:08,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:00:08,468 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1299936244] [2025-04-13 21:00:08,468 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 21:00:08,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:00:08,478 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 28 statements into 1 equivalence classes. [2025-04-13 21:00:08,485 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-04-13 21:00:08,486 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 21:00:08,486 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:00:08,544 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 21:00:08,545 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:00:08,545 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1299936244] [2025-04-13 21:00:08,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1299936244] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:00:08,545 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:00:08,545 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 21:00:08,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [936186527] [2025-04-13 21:00:08,545 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:00:08,545 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 21:00:08,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:00:08,546 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 21:00:08,546 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 21:00:08,548 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 31 [2025-04-13 21:00:08,548 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 48 transitions, 193 flow. Second operand has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:00:08,548 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 21:00:08,548 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 31 [2025-04-13 21:00:08,548 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 21:00:08,606 INFO L116 PetriNetUnfolderBase]: 132/448 cut-off events. [2025-04-13 21:00:08,606 INFO L117 PetriNetUnfolderBase]: For 111/112 co-relation queries the response was YES. [2025-04-13 21:00:08,608 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1002 conditions, 448 events. 132/448 cut-off events. For 111/112 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 2803 event pairs, 96 based on Foata normal form. 8/413 useless extension candidates. Maximal degree in co-relation 461. Up to 242 conditions per place. [2025-04-13 21:00:08,609 INFO L140 encePairwiseOnDemand]: 28/31 looper letters, 16 selfloop transitions, 2 changer transitions 0/50 dead transitions. [2025-04-13 21:00:08,609 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 50 transitions, 230 flow [2025-04-13 21:00:08,609 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 21:00:08,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-13 21:00:08,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 66 transitions. [2025-04-13 21:00:08,610 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.7096774193548387 [2025-04-13 21:00:08,610 INFO L175 Difference]: Start difference. First operand has 49 places, 48 transitions, 193 flow. Second operand 3 states and 66 transitions. [2025-04-13 21:00:08,610 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 50 transitions, 230 flow [2025-04-13 21:00:08,611 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 50 transitions, 230 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-04-13 21:00:08,611 INFO L231 Difference]: Finished difference. Result has 52 places, 47 transitions, 197 flow [2025-04-13 21:00:08,612 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=187, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=197, PETRI_PLACES=52, PETRI_TRANSITIONS=47} [2025-04-13 21:00:08,612 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 17 predicate places. [2025-04-13 21:00:08,612 INFO L485 AbstractCegarLoop]: Abstraction has has 52 places, 47 transitions, 197 flow [2025-04-13 21:00:08,612 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:00:08,612 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 21:00:08,612 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:00:08,612 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-13 21:00:08,613 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 21:00:08,613 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:00:08,613 INFO L85 PathProgramCache]: Analyzing trace with hash 638889840, now seen corresponding path program 4 times [2025-04-13 21:00:08,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:00:08,613 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [865790421] [2025-04-13 21:00:08,613 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 21:00:08,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:00:08,618 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 28 statements into 2 equivalence classes. [2025-04-13 21:00:08,622 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-04-13 21:00:08,622 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 21:00:08,622 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:00:08,754 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 21:00:08,754 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:00:08,755 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [865790421] [2025-04-13 21:00:08,755 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [865790421] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:00:08,755 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:00:08,755 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-04-13 21:00:08,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1490131311] [2025-04-13 21:00:08,755 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:00:08,755 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-13 21:00:08,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:00:08,757 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-13 21:00:08,757 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-04-13 21:00:08,774 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 31 [2025-04-13 21:00:08,774 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 47 transitions, 197 flow. Second operand has 9 states, 9 states have (on average 13.222222222222221) internal successors, (119), 9 states have internal predecessors, (119), 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 21:00:08,774 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 21:00:08,774 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 31 [2025-04-13 21:00:08,774 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 21:00:08,952 INFO L116 PetriNetUnfolderBase]: 290/677 cut-off events. [2025-04-13 21:00:08,952 INFO L117 PetriNetUnfolderBase]: For 368/368 co-relation queries the response was YES. [2025-04-13 21:00:08,953 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1784 conditions, 677 events. 290/677 cut-off events. For 368/368 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 3704 event pairs, 25 based on Foata normal form. 2/655 useless extension candidates. Maximal degree in co-relation 777. Up to 171 conditions per place. [2025-04-13 21:00:08,955 INFO L140 encePairwiseOnDemand]: 24/31 looper letters, 33 selfloop transitions, 10 changer transitions 33/89 dead transitions. [2025-04-13 21:00:08,955 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 89 transitions, 496 flow [2025-04-13 21:00:08,955 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-13 21:00:08,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-04-13 21:00:08,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 158 transitions. [2025-04-13 21:00:08,958 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5663082437275986 [2025-04-13 21:00:08,958 INFO L175 Difference]: Start difference. First operand has 52 places, 47 transitions, 197 flow. Second operand 9 states and 158 transitions. [2025-04-13 21:00:08,958 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 89 transitions, 496 flow [2025-04-13 21:00:08,960 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 89 transitions, 492 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-13 21:00:08,962 INFO L231 Difference]: Finished difference. Result has 59 places, 41 transitions, 186 flow [2025-04-13 21:00:08,962 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=193, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=186, PETRI_PLACES=59, PETRI_TRANSITIONS=41} [2025-04-13 21:00:08,964 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 24 predicate places. [2025-04-13 21:00:08,964 INFO L485 AbstractCegarLoop]: Abstraction has has 59 places, 41 transitions, 186 flow [2025-04-13 21:00:08,964 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 13.222222222222221) internal successors, (119), 9 states have internal predecessors, (119), 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 21:00:08,964 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 21:00:08,964 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:00:08,965 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-13 21:00:08,965 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 21:00:08,965 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:00:08,965 INFO L85 PathProgramCache]: Analyzing trace with hash -518179126, now seen corresponding path program 5 times [2025-04-13 21:00:08,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:00:08,966 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [419495906] [2025-04-13 21:00:08,966 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 21:00:08,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:00:08,973 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 28 statements into 1 equivalence classes. [2025-04-13 21:00:08,976 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-04-13 21:00:08,976 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 21:00:08,976 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:00:09,072 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 21:00:09,073 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:00:09,073 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [419495906] [2025-04-13 21:00:09,073 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [419495906] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:00:09,073 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:00:09,073 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-13 21:00:09,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2008708941] [2025-04-13 21:00:09,073 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:00:09,073 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-13 21:00:09,073 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:00:09,074 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-13 21:00:09,074 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-04-13 21:00:09,084 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 31 [2025-04-13 21:00:09,085 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 41 transitions, 186 flow. Second operand has 7 states, 7 states have (on average 14.571428571428571) internal successors, (102), 7 states have internal predecessors, (102), 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 21:00:09,085 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 21:00:09,085 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 31 [2025-04-13 21:00:09,085 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 21:00:09,264 INFO L116 PetriNetUnfolderBase]: 203/556 cut-off events. [2025-04-13 21:00:09,265 INFO L117 PetriNetUnfolderBase]: For 410/440 co-relation queries the response was YES. [2025-04-13 21:00:09,266 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1476 conditions, 556 events. 203/556 cut-off events. For 410/440 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 3097 event pairs, 29 based on Foata normal form. 12/555 useless extension candidates. Maximal degree in co-relation 1445. Up to 229 conditions per place. [2025-04-13 21:00:09,267 INFO L140 encePairwiseOnDemand]: 23/31 looper letters, 41 selfloop transitions, 14 changer transitions 9/78 dead transitions. [2025-04-13 21:00:09,267 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 78 transitions, 454 flow [2025-04-13 21:00:09,267 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-13 21:00:09,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-04-13 21:00:09,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 182 transitions. [2025-04-13 21:00:09,268 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5870967741935483 [2025-04-13 21:00:09,268 INFO L175 Difference]: Start difference. First operand has 59 places, 41 transitions, 186 flow. Second operand 10 states and 182 transitions. [2025-04-13 21:00:09,268 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 78 transitions, 454 flow [2025-04-13 21:00:09,270 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 78 transitions, 420 flow, removed 7 selfloop flow, removed 8 redundant places. [2025-04-13 21:00:09,271 INFO L231 Difference]: Finished difference. Result has 60 places, 48 transitions, 247 flow [2025-04-13 21:00:09,271 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=164, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=247, PETRI_PLACES=60, PETRI_TRANSITIONS=48} [2025-04-13 21:00:09,271 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 25 predicate places. [2025-04-13 21:00:09,272 INFO L485 AbstractCegarLoop]: Abstraction has has 60 places, 48 transitions, 247 flow [2025-04-13 21:00:09,272 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.571428571428571) internal successors, (102), 7 states have internal predecessors, (102), 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 21:00:09,272 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 21:00:09,272 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:00:09,272 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-13 21:00:09,272 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 21:00:09,272 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:00:09,272 INFO L85 PathProgramCache]: Analyzing trace with hash -578051314, now seen corresponding path program 6 times [2025-04-13 21:00:09,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:00:09,273 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [295128775] [2025-04-13 21:00:09,273 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 21:00:09,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:00:09,277 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 28 statements into 1 equivalence classes. [2025-04-13 21:00:09,280 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-04-13 21:00:09,280 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 21:00:09,280 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:00:09,321 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 21:00:09,321 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:00:09,321 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [295128775] [2025-04-13 21:00:09,321 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [295128775] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:00:09,321 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:00:09,321 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 21:00:09,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1637625155] [2025-04-13 21:00:09,322 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:00:09,322 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 21:00:09,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:00:09,322 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 21:00:09,322 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 21:00:09,323 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 31 [2025-04-13 21:00:09,323 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 48 transitions, 247 flow. Second operand has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:00:09,323 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 21:00:09,323 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 31 [2025-04-13 21:00:09,323 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 21:00:09,366 INFO L116 PetriNetUnfolderBase]: 112/420 cut-off events. [2025-04-13 21:00:09,366 INFO L117 PetriNetUnfolderBase]: For 245/254 co-relation queries the response was YES. [2025-04-13 21:00:09,367 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1076 conditions, 420 events. 112/420 cut-off events. For 245/254 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 2600 event pairs, 88 based on Foata normal form. 8/395 useless extension candidates. Maximal degree in co-relation 500. Up to 230 conditions per place. [2025-04-13 21:00:09,368 INFO L140 encePairwiseOnDemand]: 28/31 looper letters, 16 selfloop transitions, 2 changer transitions 1/52 dead transitions. [2025-04-13 21:00:09,369 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 52 transitions, 294 flow [2025-04-13 21:00:09,370 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 21:00:09,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-13 21:00:09,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 67 transitions. [2025-04-13 21:00:09,370 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.7204301075268817 [2025-04-13 21:00:09,370 INFO L175 Difference]: Start difference. First operand has 60 places, 48 transitions, 247 flow. Second operand 3 states and 67 transitions. [2025-04-13 21:00:09,370 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 52 transitions, 294 flow [2025-04-13 21:00:09,372 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 52 transitions, 276 flow, removed 3 selfloop flow, removed 4 redundant places. [2025-04-13 21:00:09,373 INFO L231 Difference]: Finished difference. Result has 58 places, 48 transitions, 237 flow [2025-04-13 21:00:09,373 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=229, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=237, PETRI_PLACES=58, PETRI_TRANSITIONS=48} [2025-04-13 21:00:09,373 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 23 predicate places. [2025-04-13 21:00:09,373 INFO L485 AbstractCegarLoop]: Abstraction has has 58 places, 48 transitions, 237 flow [2025-04-13 21:00:09,373 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:00:09,373 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 21:00:09,373 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:00:09,373 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-04-13 21:00:09,374 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 21:00:09,374 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:00:09,374 INFO L85 PathProgramCache]: Analyzing trace with hash -45892898, now seen corresponding path program 7 times [2025-04-13 21:00:09,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:00:09,374 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2094464173] [2025-04-13 21:00:09,374 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 21:00:09,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:00:09,378 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-04-13 21:00:09,380 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-04-13 21:00:09,380 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 21:00:09,380 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:00:09,473 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 21:00:09,473 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:00:09,473 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2094464173] [2025-04-13 21:00:09,473 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2094464173] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:00:09,473 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:00:09,473 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-13 21:00:09,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [478000403] [2025-04-13 21:00:09,473 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:00:09,474 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-13 21:00:09,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:00:09,474 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-13 21:00:09,474 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-04-13 21:00:09,484 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 31 [2025-04-13 21:00:09,484 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 48 transitions, 237 flow. Second operand has 7 states, 7 states have (on average 14.571428571428571) internal successors, (102), 7 states have internal predecessors, (102), 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 21:00:09,484 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 21:00:09,484 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 31 [2025-04-13 21:00:09,484 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 21:00:09,667 INFO L116 PetriNetUnfolderBase]: 192/535 cut-off events. [2025-04-13 21:00:09,667 INFO L117 PetriNetUnfolderBase]: For 470/520 co-relation queries the response was YES. [2025-04-13 21:00:09,668 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1449 conditions, 535 events. 192/535 cut-off events. For 470/520 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 2960 event pairs, 53 based on Foata normal form. 15/534 useless extension candidates. Maximal degree in co-relation 468. Up to 268 conditions per place. [2025-04-13 21:00:09,669 INFO L140 encePairwiseOnDemand]: 23/31 looper letters, 39 selfloop transitions, 11 changer transitions 10/74 dead transitions. [2025-04-13 21:00:09,670 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 74 transitions, 442 flow [2025-04-13 21:00:09,670 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-13 21:00:09,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-04-13 21:00:09,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 173 transitions. [2025-04-13 21:00:09,670 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5580645161290323 [2025-04-13 21:00:09,670 INFO L175 Difference]: Start difference. First operand has 58 places, 48 transitions, 237 flow. Second operand 10 states and 173 transitions. [2025-04-13 21:00:09,670 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 74 transitions, 442 flow [2025-04-13 21:00:09,672 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 74 transitions, 438 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-13 21:00:09,673 INFO L231 Difference]: Finished difference. Result has 68 places, 48 transitions, 263 flow [2025-04-13 21:00:09,673 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=233, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=263, PETRI_PLACES=68, PETRI_TRANSITIONS=48} [2025-04-13 21:00:09,673 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 33 predicate places. [2025-04-13 21:00:09,673 INFO L485 AbstractCegarLoop]: Abstraction has has 68 places, 48 transitions, 263 flow [2025-04-13 21:00:09,673 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.571428571428571) internal successors, (102), 7 states have internal predecessors, (102), 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 21:00:09,673 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 21:00:09,673 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:00:09,673 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-04-13 21:00:09,674 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 21:00:09,674 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:00:09,674 INFO L85 PathProgramCache]: Analyzing trace with hash -561169270, now seen corresponding path program 8 times [2025-04-13 21:00:09,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:00:09,674 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [220791514] [2025-04-13 21:00:09,674 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 21:00:09,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:00:09,678 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 28 statements into 1 equivalence classes. [2025-04-13 21:00:09,681 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-04-13 21:00:09,681 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 21:00:09,681 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:00:09,763 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 21:00:09,763 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:00:09,764 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [220791514] [2025-04-13 21:00:09,764 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [220791514] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:00:09,764 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:00:09,764 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-13 21:00:09,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1103594026] [2025-04-13 21:00:09,764 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:00:09,764 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-13 21:00:09,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:00:09,765 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-13 21:00:09,765 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-04-13 21:00:09,773 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 31 [2025-04-13 21:00:09,774 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 48 transitions, 263 flow. Second operand has 7 states, 7 states have (on average 14.571428571428571) internal successors, (102), 7 states have internal predecessors, (102), 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 21:00:09,774 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 21:00:09,774 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 31 [2025-04-13 21:00:09,774 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 21:00:09,903 INFO L116 PetriNetUnfolderBase]: 137/380 cut-off events. [2025-04-13 21:00:09,903 INFO L117 PetriNetUnfolderBase]: For 524/552 co-relation queries the response was YES. [2025-04-13 21:00:09,904 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1101 conditions, 380 events. 137/380 cut-off events. For 524/552 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1859 event pairs, 38 based on Foata normal form. 16/383 useless extension candidates. Maximal degree in co-relation 642. Up to 227 conditions per place. [2025-04-13 21:00:09,905 INFO L140 encePairwiseOnDemand]: 23/31 looper letters, 26 selfloop transitions, 8 changer transitions 12/60 dead transitions. [2025-04-13 21:00:09,905 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 60 transitions, 386 flow [2025-04-13 21:00:09,906 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-13 21:00:09,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-04-13 21:00:09,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 140 transitions. [2025-04-13 21:00:09,907 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5645161290322581 [2025-04-13 21:00:09,907 INFO L175 Difference]: Start difference. First operand has 68 places, 48 transitions, 263 flow. Second operand 8 states and 140 transitions. [2025-04-13 21:00:09,907 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 60 transitions, 386 flow [2025-04-13 21:00:09,908 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 60 transitions, 355 flow, removed 7 selfloop flow, removed 6 redundant places. [2025-04-13 21:00:09,909 INFO L231 Difference]: Finished difference. Result has 67 places, 41 transitions, 210 flow [2025-04-13 21:00:09,909 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=220, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=210, PETRI_PLACES=67, PETRI_TRANSITIONS=41} [2025-04-13 21:00:09,909 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 32 predicate places. [2025-04-13 21:00:09,909 INFO L485 AbstractCegarLoop]: Abstraction has has 67 places, 41 transitions, 210 flow [2025-04-13 21:00:09,909 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.571428571428571) internal successors, (102), 7 states have internal predecessors, (102), 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 21:00:09,909 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 21:00:09,911 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:00:09,911 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-04-13 21:00:09,911 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 21:00:09,911 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:00:09,912 INFO L85 PathProgramCache]: Analyzing trace with hash -588419930, now seen corresponding path program 9 times [2025-04-13 21:00:09,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:00:09,912 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [255552485] [2025-04-13 21:00:09,912 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 21:00:09,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:00:09,918 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 28 statements into 1 equivalence classes. [2025-04-13 21:00:09,922 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-04-13 21:00:09,922 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 21:00:09,922 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:00:09,986 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 21:00:09,986 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:00:09,986 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [255552485] [2025-04-13 21:00:09,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [255552485] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:00:09,986 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:00:09,986 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-13 21:00:09,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1758130396] [2025-04-13 21:00:09,986 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:00:09,986 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-13 21:00:09,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:00:09,987 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-13 21:00:09,987 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-04-13 21:00:09,993 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 31 [2025-04-13 21:00:09,994 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 41 transitions, 210 flow. Second operand has 7 states, 7 states have (on average 14.571428571428571) internal successors, (102), 7 states have internal predecessors, (102), 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 21:00:09,994 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 21:00:09,994 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 31 [2025-04-13 21:00:09,994 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 21:00:10,086 INFO L116 PetriNetUnfolderBase]: 72/213 cut-off events. [2025-04-13 21:00:10,086 INFO L117 PetriNetUnfolderBase]: For 357/373 co-relation queries the response was YES. [2025-04-13 21:00:10,086 INFO L83 FinitePrefix]: Finished finitePrefix Result has 644 conditions, 213 events. 72/213 cut-off events. For 357/373 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 845 event pairs, 27 based on Foata normal form. 8/218 useless extension candidates. Maximal degree in co-relation 249. Up to 101 conditions per place. [2025-04-13 21:00:10,087 INFO L140 encePairwiseOnDemand]: 23/31 looper letters, 19 selfloop transitions, 6 changer transitions 12/49 dead transitions. [2025-04-13 21:00:10,087 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 49 transitions, 313 flow [2025-04-13 21:00:10,087 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-13 21:00:10,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-04-13 21:00:10,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 119 transitions. [2025-04-13 21:00:10,088 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5483870967741935 [2025-04-13 21:00:10,088 INFO L175 Difference]: Start difference. First operand has 67 places, 41 transitions, 210 flow. Second operand 7 states and 119 transitions. [2025-04-13 21:00:10,088 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 49 transitions, 313 flow [2025-04-13 21:00:10,089 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 49 transitions, 277 flow, removed 4 selfloop flow, removed 9 redundant places. [2025-04-13 21:00:10,089 INFO L231 Difference]: Finished difference. Result has 61 places, 32 transitions, 150 flow [2025-04-13 21:00:10,089 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=167, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=150, PETRI_PLACES=61, PETRI_TRANSITIONS=32} [2025-04-13 21:00:10,090 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 26 predicate places. [2025-04-13 21:00:10,090 INFO L485 AbstractCegarLoop]: Abstraction has has 61 places, 32 transitions, 150 flow [2025-04-13 21:00:10,090 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.571428571428571) internal successors, (102), 7 states have internal predecessors, (102), 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 21:00:10,090 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 21:00:10,090 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:00:10,090 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-04-13 21:00:10,090 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 21:00:10,090 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:00:10,090 INFO L85 PathProgramCache]: Analyzing trace with hash -1053121950, now seen corresponding path program 10 times [2025-04-13 21:00:10,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:00:10,091 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1023236582] [2025-04-13 21:00:10,091 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 21:00:10,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:00:10,094 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 28 statements into 2 equivalence classes. [2025-04-13 21:00:10,097 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-04-13 21:00:10,097 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 21:00:10,097 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:00:10,163 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 21:00:10,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:00:10,163 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1023236582] [2025-04-13 21:00:10,163 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1023236582] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:00:10,163 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:00:10,163 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-13 21:00:10,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [523729425] [2025-04-13 21:00:10,164 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:00:10,164 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-13 21:00:10,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:00:10,164 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-13 21:00:10,164 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-04-13 21:00:10,184 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 31 [2025-04-13 21:00:10,184 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 32 transitions, 150 flow. Second operand has 7 states, 7 states have (on average 14.571428571428571) internal successors, (102), 7 states have internal predecessors, (102), 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 21:00:10,184 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 21:00:10,184 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 31 [2025-04-13 21:00:10,184 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 21:00:10,225 INFO L116 PetriNetUnfolderBase]: 5/32 cut-off events. [2025-04-13 21:00:10,225 INFO L117 PetriNetUnfolderBase]: For 35/35 co-relation queries the response was YES. [2025-04-13 21:00:10,226 INFO L83 FinitePrefix]: Finished finitePrefix Result has 101 conditions, 32 events. 5/32 cut-off events. For 35/35 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 34 event pairs, 2 based on Foata normal form. 4/35 useless extension candidates. Maximal degree in co-relation 87. Up to 11 conditions per place. [2025-04-13 21:00:10,226 INFO L140 encePairwiseOnDemand]: 27/31 looper letters, 0 selfloop transitions, 0 changer transitions 20/20 dead transitions. [2025-04-13 21:00:10,226 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 20 transitions, 106 flow [2025-04-13 21:00:10,226 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 21:00:10,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-13 21:00:10,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 73 transitions. [2025-04-13 21:00:10,226 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.47096774193548385 [2025-04-13 21:00:10,226 INFO L175 Difference]: Start difference. First operand has 61 places, 32 transitions, 150 flow. Second operand 5 states and 73 transitions. [2025-04-13 21:00:10,226 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 20 transitions, 106 flow [2025-04-13 21:00:10,227 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 20 transitions, 76 flow, removed 1 selfloop flow, removed 16 redundant places. [2025-04-13 21:00:10,227 INFO L231 Difference]: Finished difference. Result has 31 places, 0 transitions, 0 flow [2025-04-13 21:00:10,227 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=48, PETRI_DIFFERENCE_MINUEND_PLACES=27, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=18, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=0, PETRI_PLACES=31, PETRI_TRANSITIONS=0} [2025-04-13 21:00:10,227 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, -4 predicate places. [2025-04-13 21:00:10,227 INFO L485 AbstractCegarLoop]: Abstraction has has 31 places, 0 transitions, 0 flow [2025-04-13 21:00:10,228 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.571428571428571) internal successors, (102), 7 states have internal predecessors, (102), 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 21:00:10,229 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2025-04-13 21:00:10,230 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 3 remaining) [2025-04-13 21:00:10,230 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2025-04-13 21:00:10,230 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-04-13 21:00:10,230 INFO L422 BasicCegarLoop]: Path program histogram: [10] [2025-04-13 21:00:10,232 INFO L242 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-04-13 21:00:10,232 INFO L171 ceAbstractionStarter]: Computing trace abstraction results [2025-04-13 21:00:10,235 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.04 09:00:10 BasicIcfg [2025-04-13 21:00:10,235 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-04-13 21:00:10,236 INFO L158 Benchmark]: Toolchain (without parser) took 3490.72ms. Allocated memory is still 155.2MB. Free memory was 109.5MB in the beginning and 80.5MB in the end (delta: 29.0MB). Peak memory consumption was 30.9MB. Max. memory is 8.0GB. [2025-04-13 21:00:10,236 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 159.4MB. Free memory is still 87.9MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-13 21:00:10,236 INFO L158 Benchmark]: CACSL2BoogieTranslator took 220.93ms. Allocated memory is still 155.2MB. Free memory was 109.2MB in the beginning and 95.1MB in the end (delta: 14.1MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. [2025-04-13 21:00:10,236 INFO L158 Benchmark]: Boogie Procedure Inliner took 32.23ms. Allocated memory is still 155.2MB. Free memory was 95.1MB in the beginning and 93.3MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-13 21:00:10,236 INFO L158 Benchmark]: Boogie Preprocessor took 38.87ms. Allocated memory is still 155.2MB. Free memory was 93.3MB in the beginning and 91.7MB in the end (delta: 1.6MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-13 21:00:10,236 INFO L158 Benchmark]: RCFGBuilder took 314.21ms. Allocated memory is still 155.2MB. Free memory was 91.7MB in the beginning and 66.0MB in the end (delta: 25.7MB). Peak memory consumption was 21.0MB. Max. memory is 8.0GB. [2025-04-13 21:00:10,236 INFO L158 Benchmark]: TraceAbstraction took 2878.73ms. Allocated memory is still 155.2MB. Free memory was 65.5MB in the beginning and 80.5MB in the end (delta: -15.0MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-13 21:00:10,237 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19ms. Allocated memory is still 159.4MB. Free memory is still 87.9MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 220.93ms. Allocated memory is still 155.2MB. Free memory was 109.2MB in the beginning and 95.1MB in the end (delta: 14.1MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 32.23ms. Allocated memory is still 155.2MB. Free memory was 95.1MB in the beginning and 93.3MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 38.87ms. Allocated memory is still 155.2MB. Free memory was 93.3MB in the beginning and 91.7MB in the end (delta: 1.6MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * RCFGBuilder took 314.21ms. Allocated memory is still 155.2MB. Free memory was 91.7MB in the beginning and 66.0MB in the end (delta: 25.7MB). Peak memory consumption was 21.0MB. Max. memory is 8.0GB. * TraceAbstraction took 2878.73ms. Allocated memory is still 155.2MB. Free memory was 65.5MB in the beginning and 80.5MB in the end (delta: -15.0MB). There was no memory consumed. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 80]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 56 locations, 55 edges, 3 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 2.8s, OverallIterations: 10, TraceHistogramMax: 1, PathProgramHistogramMax: 10, EmptinessCheckTime: 0.0s, AutomataDifference: 1.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 470 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 443 mSDsluCounter, 167 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 116 mSDsCounter, 36 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1109 IncrementalHoareTripleChecker+Invalid, 1145 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 36 mSolverCounterUnsat, 51 mSDtfsCounter, 1109 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 95 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=263occurred in iteration=7, InterpolantAutomatonStates: 71, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 280 NumberOfCodeBlocks, 280 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 270 ConstructedInterpolants, 0 QuantifiedInterpolants, 898 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-04-13 21:00:10,253 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request...