/root/.sdkman/candidates/java/21.0.5-tem/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata ./data -tc ../benchexec/../../../trunk/examples/toolchains/AutomizerCInline_IcfgBuilder.xml -s ../benchexec/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --traceabstraction.automaton.type.used.in.concurrency.analysis PETRI_NET --preprocessor.replace.while.statements.and.if-then-else.statements false -i ../../../trunk/examples/svcomp/goblint-regression/13-privatized_24-multiple-protecting_true.i -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.cfg-lbe-improvements-94356ea-m [2025-04-14 00:13:19,038 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-14 00:13:19,090 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-14 00:13:19,095 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-14 00:13:19,095 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-14 00:13:19,119 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-14 00:13:19,120 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-14 00:13:19,120 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-14 00:13:19,120 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-14 00:13:19,121 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-14 00:13:19,121 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-14 00:13:19,121 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-14 00:13:19,122 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-14 00:13:19,122 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-14 00:13:19,122 INFO L153 SettingsManager]: * Use SBE=true [2025-04-14 00:13:19,122 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-14 00:13:19,122 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-14 00:13:19,122 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-14 00:13:19,122 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-14 00:13:19,122 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-14 00:13:19,123 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-14 00:13:19,123 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-14 00:13:19,123 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-14 00:13:19,123 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-14 00:13:19,123 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-14 00:13:19,123 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-14 00:13:19,123 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-14 00:13:19,123 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-14 00:13:19,123 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-14 00:13:19,123 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-14 00:13:19,123 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-14 00:13:19,123 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-14 00:13:19,123 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-14 00:13:19,123 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-14 00:13:19,124 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-14 00:13:19,124 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-14 00:13:19,124 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-14 00:13:19,124 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-14 00:13:19,124 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-14 00:13:19,124 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-14 00:13:19,124 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-14 00:13:19,124 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-14 00:13:19,124 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-14 00:13:19,124 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-14 00:13:19,124 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-14 00:13:19,124 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-14 00:13:19,124 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-14 00:13:19,124 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Automaton type used in concurrency analysis -> PETRI_NET Applying setting for plugin de.uni_freiburg.informatik.ultimate.boogie.preprocessor: Replace while statements and if-then-else statements -> false [2025-04-14 00:13:19,335 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-14 00:13:19,343 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-14 00:13:19,345 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-14 00:13:19,346 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-14 00:13:19,348 INFO L274 PluginConnector]: CDTParser initialized [2025-04-14 00:13:19,349 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/goblint-regression/13-privatized_24-multiple-protecting_true.i [2025-04-14 00:13:20,637 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/520a4c704/e3afcd430c7143c0bd7680d06eba728a/FLAG0198d307c [2025-04-14 00:13:20,847 INFO L389 CDTParser]: Found 1 translation units. [2025-04-14 00:13:20,848 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/13-privatized_24-multiple-protecting_true.i [2025-04-14 00:13:20,856 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/520a4c704/e3afcd430c7143c0bd7680d06eba728a/FLAG0198d307c [2025-04-14 00:13:21,837 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/520a4c704/e3afcd430c7143c0bd7680d06eba728a [2025-04-14 00:13:21,839 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-14 00:13:21,840 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-04-14 00:13:21,841 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-14 00:13:21,841 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-14 00:13:21,844 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-14 00:13:21,847 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.04 12:13:21" (1/1) ... [2025-04-14 00:13:21,847 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@92b0487 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:13:21, skipping insertion in model container [2025-04-14 00:13:21,847 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.04 12:13:21" (1/1) ... [2025-04-14 00:13:21,867 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-14 00:13:22,085 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/13-privatized_24-multiple-protecting_true.i[1096,1109] [2025-04-14 00:13:22,171 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-14 00:13:22,185 INFO L200 MainTranslator]: Completed pre-run [2025-04-14 00:13:22,203 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/13-privatized_24-multiple-protecting_true.i[1096,1109] [2025-04-14 00:13:22,231 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-14 00:13:22,264 INFO L204 MainTranslator]: Completed translation [2025-04-14 00:13:22,266 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:13:22 WrapperNode [2025-04-14 00:13:22,266 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-14 00:13:22,267 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-14 00:13:22,267 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-14 00:13:22,267 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-14 00:13:22,272 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:13:22" (1/1) ... [2025-04-14 00:13:22,283 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:13:22" (1/1) ... [2025-04-14 00:13:22,296 INFO L138 Inliner]: procedures = 162, calls = 53, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 101 [2025-04-14 00:13:22,296 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-14 00:13:22,297 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-14 00:13:22,297 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-14 00:13:22,297 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-14 00:13:22,302 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:13:22" (1/1) ... [2025-04-14 00:13:22,302 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:13:22" (1/1) ... [2025-04-14 00:13:22,304 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:13:22" (1/1) ... [2025-04-14 00:13:22,325 INFO L175 MemorySlicer]: Split 17 memory accesses to 4 slices as follows [2, 5, 5, 5]. 29 percent of accesses are in the largest equivalence class. The 17 initializations are split as follows [2, 5, 5, 5]. The 0 writes are split as follows [0, 0, 0, 0]. [2025-04-14 00:13:22,325 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:13:22" (1/1) ... [2025-04-14 00:13:22,325 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:13:22" (1/1) ... [2025-04-14 00:13:22,330 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:13:22" (1/1) ... [2025-04-14 00:13:22,334 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:13:22" (1/1) ... [2025-04-14 00:13:22,335 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:13:22" (1/1) ... [2025-04-14 00:13:22,335 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:13:22" (1/1) ... [2025-04-14 00:13:22,338 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-14 00:13:22,343 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-04-14 00:13:22,343 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-04-14 00:13:22,343 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-04-14 00:13:22,344 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:13:22" (1/1) ... [2025-04-14 00:13:22,351 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-14 00:13:22,362 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 00:13:22,373 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-14 00:13:22,377 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-14 00:13:22,394 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-04-14 00:13:22,395 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-14 00:13:22,395 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2025-04-14 00:13:22,395 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2025-04-14 00:13:22,395 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-04-14 00:13:22,395 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-04-14 00:13:22,395 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-04-14 00:13:22,395 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-04-14 00:13:22,395 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-04-14 00:13:22,395 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-14 00:13:22,395 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-14 00:13:22,396 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-14 00:13:22,495 INFO L256 CfgBuilder]: Building ICFG [2025-04-14 00:13:22,496 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-14 00:13:22,682 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-14 00:13:22,683 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-14 00:13:22,683 INFO L318 CfgBuilder]: Performing block encoding [2025-04-14 00:13:22,876 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-14 00:13:22,876 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.04 12:13:22 BoogieIcfgContainer [2025-04-14 00:13:22,876 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-04-14 00:13:22,877 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-14 00:13:22,877 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-14 00:13:22,881 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-14 00:13:22,881 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.04 12:13:21" (1/3) ... [2025-04-14 00:13:22,882 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37f865b6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.04 12:13:22, skipping insertion in model container [2025-04-14 00:13:22,882 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:13:22" (2/3) ... [2025-04-14 00:13:22,882 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37f865b6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.04 12:13:22, skipping insertion in model container [2025-04-14 00:13:22,882 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.04 12:13:22" (3/3) ... [2025-04-14 00:13:22,884 INFO L128 eAbstractionObserver]: Analyzing ICFG 13-privatized_24-multiple-protecting_true.i [2025-04-14 00:13:22,893 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-14 00:13:22,894 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 13-privatized_24-multiple-protecting_true.i that has 2 procedures, 60 locations, 58 edges, 1 initial locations, 0 loop locations, and 4 error locations. [2025-04-14 00:13:22,894 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-14 00:13:22,956 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2025-04-14 00:13:22,982 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 63 places, 59 transitions, 125 flow [2025-04-14 00:13:23,012 INFO L116 PetriNetUnfolderBase]: 0/58 cut-off events. [2025-04-14 00:13:23,013 INFO L117 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-04-14 00:13:23,015 INFO L83 FinitePrefix]: Finished finitePrefix Result has 63 conditions, 58 events. 0/58 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 61 event pairs, 0 based on Foata normal form. 0/54 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2025-04-14 00:13:23,015 INFO L82 GeneralOperation]: Start removeDead. Operand has 63 places, 59 transitions, 125 flow [2025-04-14 00:13:23,019 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 55 places, 51 transitions, 105 flow [2025-04-14 00:13:23,023 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-14 00:13:23,036 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;@f03f8c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-14 00:13:23,036 INFO L341 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2025-04-14 00:13:23,041 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-14 00:13:23,041 INFO L116 PetriNetUnfolderBase]: 0/10 cut-off events. [2025-04-14 00:13:23,041 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-14 00:13:23,041 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:13:23,041 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:13:23,041 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-04-14 00:13:23,046 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:13:23,046 INFO L85 PathProgramCache]: Analyzing trace with hash -757226027, now seen corresponding path program 1 times [2025-04-14 00:13:23,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:13:23,053 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [608272211] [2025-04-14 00:13:23,054 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 00:13:23,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:13:23,119 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-14 00:13:23,141 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-14 00:13:23,141 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:13:23,141 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:13:23,308 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-14 00:13:23,308 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:13:23,308 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [608272211] [2025-04-14 00:13:23,309 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [608272211] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:13:23,309 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:13:23,309 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-04-14 00:13:23,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1075618711] [2025-04-14 00:13:23,310 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:13:23,315 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-14 00:13:23,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:13:23,332 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-14 00:13:23,333 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-14 00:13:23,334 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 59 [2025-04-14 00:13:23,336 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 51 transitions, 105 flow. Second operand has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 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-14 00:13:23,336 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:13:23,336 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 59 [2025-04-14 00:13:23,336 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:13:23,598 INFO L116 PetriNetUnfolderBase]: 450/1162 cut-off events. [2025-04-14 00:13:23,598 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-14 00:13:23,602 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2131 conditions, 1162 events. 450/1162 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 7031 event pairs, 72 based on Foata normal form. 18/1116 useless extension candidates. Maximal degree in co-relation 2122. Up to 535 conditions per place. [2025-04-14 00:13:23,608 INFO L140 encePairwiseOnDemand]: 51/59 looper letters, 61 selfloop transitions, 5 changer transitions 0/80 dead transitions. [2025-04-14 00:13:23,608 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 80 transitions, 295 flow [2025-04-14 00:13:23,609 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-14 00:13:23,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-14 00:13:23,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 120 transitions. [2025-04-14 00:13:23,618 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6779661016949152 [2025-04-14 00:13:23,618 INFO L175 Difference]: Start difference. First operand has 55 places, 51 transitions, 105 flow. Second operand 3 states and 120 transitions. [2025-04-14 00:13:23,619 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 80 transitions, 295 flow [2025-04-14 00:13:23,621 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 80 transitions, 294 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-14 00:13:23,623 INFO L231 Difference]: Finished difference. Result has 58 places, 54 transitions, 142 flow [2025-04-14 00:13:23,626 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=104, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=142, PETRI_PLACES=58, PETRI_TRANSITIONS=54} [2025-04-14 00:13:23,629 INFO L279 CegarLoopForPetriNet]: 55 programPoint places, 3 predicate places. [2025-04-14 00:13:23,629 INFO L485 AbstractCegarLoop]: Abstraction has has 58 places, 54 transitions, 142 flow [2025-04-14 00:13:23,629 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 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-14 00:13:23,630 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:13:23,630 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:13:23,630 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-14 00:13:23,630 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-04-14 00:13:23,631 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:13:23,631 INFO L85 PathProgramCache]: Analyzing trace with hash 480693275, now seen corresponding path program 1 times [2025-04-14 00:13:23,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:13:23,631 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1127122676] [2025-04-14 00:13:23,631 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 00:13:23,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:13:23,651 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-04-14 00:13:23,662 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-14 00:13:23,662 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:13:23,662 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:13:23,813 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-14 00:13:23,813 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:13:23,813 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1127122676] [2025-04-14 00:13:23,813 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1127122676] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:13:23,813 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:13:23,813 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-14 00:13:23,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1317368191] [2025-04-14 00:13:23,813 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:13:23,814 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-14 00:13:23,814 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:13:23,814 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-14 00:13:23,814 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-14 00:13:23,815 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 59 [2025-04-14 00:13:23,815 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 54 transitions, 142 flow. Second operand has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:13:23,815 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:13:23,815 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 59 [2025-04-14 00:13:23,815 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:13:23,948 INFO L116 PetriNetUnfolderBase]: 196/566 cut-off events. [2025-04-14 00:13:23,948 INFO L117 PetriNetUnfolderBase]: For 37/37 co-relation queries the response was YES. [2025-04-14 00:13:23,950 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1124 conditions, 566 events. 196/566 cut-off events. For 37/37 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 2863 event pairs, 42 based on Foata normal form. 19/569 useless extension candidates. Maximal degree in co-relation 1112. Up to 297 conditions per place. [2025-04-14 00:13:23,951 INFO L140 encePairwiseOnDemand]: 53/59 looper letters, 53 selfloop transitions, 6 changer transitions 3/76 dead transitions. [2025-04-14 00:13:23,951 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 76 transitions, 310 flow [2025-04-14 00:13:23,952 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 00:13:23,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-04-14 00:13:23,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 131 transitions. [2025-04-14 00:13:23,953 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5550847457627118 [2025-04-14 00:13:23,953 INFO L175 Difference]: Start difference. First operand has 58 places, 54 transitions, 142 flow. Second operand 4 states and 131 transitions. [2025-04-14 00:13:23,953 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 76 transitions, 310 flow [2025-04-14 00:13:23,954 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 76 transitions, 298 flow, removed 2 selfloop flow, removed 2 redundant places. [2025-04-14 00:13:23,957 INFO L231 Difference]: Finished difference. Result has 59 places, 52 transitions, 139 flow [2025-04-14 00:13:23,957 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=118, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=139, PETRI_PLACES=59, PETRI_TRANSITIONS=52} [2025-04-14 00:13:23,957 INFO L279 CegarLoopForPetriNet]: 55 programPoint places, 4 predicate places. [2025-04-14 00:13:23,958 INFO L485 AbstractCegarLoop]: Abstraction has has 59 places, 52 transitions, 139 flow [2025-04-14 00:13:23,958 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:13:23,958 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:13:23,958 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:13:23,958 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-14 00:13:23,959 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-04-14 00:13:23,959 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:13:23,959 INFO L85 PathProgramCache]: Analyzing trace with hash -945574670, now seen corresponding path program 1 times [2025-04-14 00:13:23,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:13:23,959 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [20832490] [2025-04-14 00:13:23,959 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 00:13:23,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:13:23,971 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-04-14 00:13:23,976 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-04-14 00:13:23,976 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:13:23,976 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:13:24,049 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-14 00:13:24,049 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:13:24,049 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [20832490] [2025-04-14 00:13:24,049 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [20832490] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:13:24,049 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:13:24,049 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-04-14 00:13:24,049 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [873903897] [2025-04-14 00:13:24,049 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:13:24,050 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-14 00:13:24,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:13:24,050 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-14 00:13:24,050 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-14 00:13:24,050 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 59 [2025-04-14 00:13:24,050 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 52 transitions, 139 flow. Second operand has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 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-14 00:13:24,050 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:13:24,050 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 59 [2025-04-14 00:13:24,050 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:13:24,163 INFO L116 PetriNetUnfolderBase]: 206/607 cut-off events. [2025-04-14 00:13:24,163 INFO L117 PetriNetUnfolderBase]: For 101/101 co-relation queries the response was YES. [2025-04-14 00:13:24,164 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1267 conditions, 607 events. 206/607 cut-off events. For 101/101 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 3113 event pairs, 74 based on Foata normal form. 0/583 useless extension candidates. Maximal degree in co-relation 1254. Up to 292 conditions per place. [2025-04-14 00:13:24,166 INFO L140 encePairwiseOnDemand]: 54/59 looper letters, 49 selfloop transitions, 2 changer transitions 10/75 dead transitions. [2025-04-14 00:13:24,166 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 75 transitions, 324 flow [2025-04-14 00:13:24,166 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-14 00:13:24,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-14 00:13:24,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 110 transitions. [2025-04-14 00:13:24,167 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6214689265536724 [2025-04-14 00:13:24,167 INFO L175 Difference]: Start difference. First operand has 59 places, 52 transitions, 139 flow. Second operand 3 states and 110 transitions. [2025-04-14 00:13:24,167 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 75 transitions, 324 flow [2025-04-14 00:13:24,168 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 75 transitions, 323 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-14 00:13:24,169 INFO L231 Difference]: Finished difference. Result has 62 places, 52 transitions, 152 flow [2025-04-14 00:13:24,169 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=138, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=152, PETRI_PLACES=62, PETRI_TRANSITIONS=52} [2025-04-14 00:13:24,169 INFO L279 CegarLoopForPetriNet]: 55 programPoint places, 7 predicate places. [2025-04-14 00:13:24,169 INFO L485 AbstractCegarLoop]: Abstraction has has 62 places, 52 transitions, 152 flow [2025-04-14 00:13:24,169 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 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-14 00:13:24,169 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:13:24,169 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:13:24,170 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-14 00:13:24,170 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-04-14 00:13:24,170 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:13:24,170 INFO L85 PathProgramCache]: Analyzing trace with hash -519395945, now seen corresponding path program 1 times [2025-04-14 00:13:24,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:13:24,170 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1097714059] [2025-04-14 00:13:24,170 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 00:13:24,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:13:24,179 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-04-14 00:13:24,188 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-14 00:13:24,189 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:13:24,189 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:13:24,283 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-14 00:13:24,283 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:13:24,283 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1097714059] [2025-04-14 00:13:24,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1097714059] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:13:24,283 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:13:24,284 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-14 00:13:24,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [468898916] [2025-04-14 00:13:24,284 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:13:24,284 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-14 00:13:24,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:13:24,284 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-14 00:13:24,284 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-14 00:13:24,284 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 59 [2025-04-14 00:13:24,285 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 52 transitions, 152 flow. Second operand has 4 states, 4 states have (on average 20.5) internal successors, (82), 4 states have internal predecessors, (82), 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-14 00:13:24,285 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:13:24,285 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 59 [2025-04-14 00:13:24,285 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:13:24,371 INFO L116 PetriNetUnfolderBase]: 158/501 cut-off events. [2025-04-14 00:13:24,371 INFO L117 PetriNetUnfolderBase]: For 138/138 co-relation queries the response was YES. [2025-04-14 00:13:24,373 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1094 conditions, 501 events. 158/501 cut-off events. For 138/138 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 2454 event pairs, 152 based on Foata normal form. 12/508 useless extension candidates. Maximal degree in co-relation 1078. Up to 391 conditions per place. [2025-04-14 00:13:24,374 INFO L140 encePairwiseOnDemand]: 54/59 looper letters, 36 selfloop transitions, 3 changer transitions 0/53 dead transitions. [2025-04-14 00:13:24,374 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 53 transitions, 230 flow [2025-04-14 00:13:24,374 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 00:13:24,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-04-14 00:13:24,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 107 transitions. [2025-04-14 00:13:24,377 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4533898305084746 [2025-04-14 00:13:24,377 INFO L175 Difference]: Start difference. First operand has 62 places, 52 transitions, 152 flow. Second operand 4 states and 107 transitions. [2025-04-14 00:13:24,377 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 53 transitions, 230 flow [2025-04-14 00:13:24,378 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 53 transitions, 226 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-14 00:13:24,378 INFO L231 Difference]: Finished difference. Result has 63 places, 51 transitions, 155 flow [2025-04-14 00:13:24,379 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=155, PETRI_PLACES=63, PETRI_TRANSITIONS=51} [2025-04-14 00:13:24,379 INFO L279 CegarLoopForPetriNet]: 55 programPoint places, 8 predicate places. [2025-04-14 00:13:24,379 INFO L485 AbstractCegarLoop]: Abstraction has has 63 places, 51 transitions, 155 flow [2025-04-14 00:13:24,379 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.5) internal successors, (82), 4 states have internal predecessors, (82), 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-14 00:13:24,379 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:13:24,379 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-14 00:13:24,379 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-14 00:13:24,379 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-04-14 00:13:24,380 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:13:24,380 INFO L85 PathProgramCache]: Analyzing trace with hash 1043736551, now seen corresponding path program 1 times [2025-04-14 00:13:24,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:13:24,380 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1907953391] [2025-04-14 00:13:24,380 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 00:13:24,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:13:24,390 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-04-14 00:13:24,399 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-04-14 00:13:24,399 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:13:24,399 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:13:24,494 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-14 00:13:24,495 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:13:24,495 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1907953391] [2025-04-14 00:13:24,495 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1907953391] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:13:24,495 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:13:24,495 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-14 00:13:24,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1417989902] [2025-04-14 00:13:24,495 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:13:24,495 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-14 00:13:24,495 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:13:24,496 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-14 00:13:24,496 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-04-14 00:13:24,496 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 59 [2025-04-14 00:13:24,496 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 51 transitions, 155 flow. Second operand has 5 states, 5 states have (on average 21.0) internal successors, (105), 5 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:13:24,496 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:13:24,496 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 59 [2025-04-14 00:13:24,496 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:13:24,601 INFO L116 PetriNetUnfolderBase]: 93/373 cut-off events. [2025-04-14 00:13:24,601 INFO L117 PetriNetUnfolderBase]: For 81/81 co-relation queries the response was YES. [2025-04-14 00:13:24,602 INFO L83 FinitePrefix]: Finished finitePrefix Result has 835 conditions, 373 events. 93/373 cut-off events. For 81/81 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 1683 event pairs, 38 based on Foata normal form. 43/409 useless extension candidates. Maximal degree in co-relation 818. Up to 166 conditions per place. [2025-04-14 00:13:24,602 INFO L140 encePairwiseOnDemand]: 41/59 looper letters, 31 selfloop transitions, 17 changer transitions 8/70 dead transitions. [2025-04-14 00:13:24,603 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 70 transitions, 330 flow [2025-04-14 00:13:24,603 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 00:13:24,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-04-14 00:13:24,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 129 transitions. [2025-04-14 00:13:24,603 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5466101694915254 [2025-04-14 00:13:24,603 INFO L175 Difference]: Start difference. First operand has 63 places, 51 transitions, 155 flow. Second operand 4 states and 129 transitions. [2025-04-14 00:13:24,603 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 70 transitions, 330 flow [2025-04-14 00:13:24,604 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 70 transitions, 316 flow, removed 4 selfloop flow, removed 3 redundant places. [2025-04-14 00:13:24,605 INFO L231 Difference]: Finished difference. Result has 64 places, 54 transitions, 212 flow [2025-04-14 00:13:24,605 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=143, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=212, PETRI_PLACES=64, PETRI_TRANSITIONS=54} [2025-04-14 00:13:24,606 INFO L279 CegarLoopForPetriNet]: 55 programPoint places, 9 predicate places. [2025-04-14 00:13:24,606 INFO L485 AbstractCegarLoop]: Abstraction has has 64 places, 54 transitions, 212 flow [2025-04-14 00:13:24,606 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.0) internal successors, (105), 5 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:13:24,606 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:13:24,606 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, 1] [2025-04-14 00:13:24,606 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-14 00:13:24,606 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-04-14 00:13:24,606 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:13:24,608 INFO L85 PathProgramCache]: Analyzing trace with hash 1016351944, now seen corresponding path program 1 times [2025-04-14 00:13:24,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:13:24,609 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [902355263] [2025-04-14 00:13:24,609 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 00:13:24,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:13:24,617 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-04-14 00:13:24,621 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-04-14 00:13:24,622 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:13:24,622 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:13:24,791 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-14 00:13:24,791 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:13:24,791 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [902355263] [2025-04-14 00:13:24,791 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [902355263] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:13:24,791 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:13:24,791 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-14 00:13:24,791 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1856040741] [2025-04-14 00:13:24,791 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:13:24,792 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-14 00:13:24,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:13:24,792 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-14 00:13:24,792 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-04-14 00:13:24,792 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 59 [2025-04-14 00:13:24,792 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 54 transitions, 212 flow. Second operand has 5 states, 5 states have (on average 21.2) internal successors, (106), 5 states have internal predecessors, (106), 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-14 00:13:24,793 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:13:24,793 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 59 [2025-04-14 00:13:24,793 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:13:24,880 INFO L116 PetriNetUnfolderBase]: 81/320 cut-off events. [2025-04-14 00:13:24,880 INFO L117 PetriNetUnfolderBase]: For 224/226 co-relation queries the response was YES. [2025-04-14 00:13:24,881 INFO L83 FinitePrefix]: Finished finitePrefix Result has 850 conditions, 320 events. 81/320 cut-off events. For 224/226 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 1353 event pairs, 35 based on Foata normal form. 4/322 useless extension candidates. Maximal degree in co-relation 832. Up to 232 conditions per place. [2025-04-14 00:13:24,882 INFO L140 encePairwiseOnDemand]: 55/59 looper letters, 39 selfloop transitions, 4 changer transitions 8/63 dead transitions. [2025-04-14 00:13:24,882 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 63 transitions, 344 flow [2025-04-14 00:13:24,882 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 00:13:24,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-04-14 00:13:24,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 113 transitions. [2025-04-14 00:13:24,883 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4788135593220339 [2025-04-14 00:13:24,883 INFO L175 Difference]: Start difference. First operand has 64 places, 54 transitions, 212 flow. Second operand 4 states and 113 transitions. [2025-04-14 00:13:24,883 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 63 transitions, 344 flow [2025-04-14 00:13:24,885 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 63 transitions, 340 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-14 00:13:24,901 INFO L231 Difference]: Finished difference. Result has 64 places, 46 transitions, 183 flow [2025-04-14 00:13:24,902 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=204, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=183, PETRI_PLACES=64, PETRI_TRANSITIONS=46} [2025-04-14 00:13:24,902 INFO L279 CegarLoopForPetriNet]: 55 programPoint places, 9 predicate places. [2025-04-14 00:13:24,902 INFO L485 AbstractCegarLoop]: Abstraction has has 64 places, 46 transitions, 183 flow [2025-04-14 00:13:24,903 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.2) internal successors, (106), 5 states have internal predecessors, (106), 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-14 00:13:24,903 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:13:24,903 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, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:13:24,903 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-04-14 00:13:24,903 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-04-14 00:13:24,903 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:13:24,903 INFO L85 PathProgramCache]: Analyzing trace with hash 140377003, now seen corresponding path program 1 times [2025-04-14 00:13:24,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:13:24,903 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [105584533] [2025-04-14 00:13:24,903 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 00:13:24,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:13:24,914 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-04-14 00:13:24,921 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-04-14 00:13:24,921 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:13:24,921 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:13:25,095 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-14 00:13:25,095 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:13:25,095 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [105584533] [2025-04-14 00:13:25,095 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [105584533] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:13:25,095 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:13:25,096 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-14 00:13:25,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1077022991] [2025-04-14 00:13:25,096 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:13:25,096 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-14 00:13:25,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:13:25,096 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-14 00:13:25,096 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-04-14 00:13:25,097 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 59 [2025-04-14 00:13:25,097 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 46 transitions, 183 flow. Second operand has 6 states, 6 states have (on average 21.166666666666668) internal successors, (127), 6 states have internal predecessors, (127), 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-14 00:13:25,097 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:13:25,097 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 59 [2025-04-14 00:13:25,097 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:13:25,163 INFO L116 PetriNetUnfolderBase]: 53/202 cut-off events. [2025-04-14 00:13:25,163 INFO L117 PetriNetUnfolderBase]: For 183/183 co-relation queries the response was YES. [2025-04-14 00:13:25,163 INFO L83 FinitePrefix]: Finished finitePrefix Result has 534 conditions, 202 events. 53/202 cut-off events. For 183/183 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 571 event pairs, 19 based on Foata normal form. 12/212 useless extension candidates. Maximal degree in co-relation 516. Up to 94 conditions per place. [2025-04-14 00:13:25,164 INFO L140 encePairwiseOnDemand]: 55/59 looper letters, 33 selfloop transitions, 6 changer transitions 0/51 dead transitions. [2025-04-14 00:13:25,164 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 51 transitions, 282 flow [2025-04-14 00:13:25,164 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 00:13:25,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-04-14 00:13:25,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 106 transitions. [2025-04-14 00:13:25,165 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4491525423728814 [2025-04-14 00:13:25,165 INFO L175 Difference]: Start difference. First operand has 64 places, 46 transitions, 183 flow. Second operand 4 states and 106 transitions. [2025-04-14 00:13:25,165 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 51 transitions, 282 flow [2025-04-14 00:13:25,166 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 51 transitions, 264 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-04-14 00:13:25,167 INFO L231 Difference]: Finished difference. Result has 56 places, 45 transitions, 176 flow [2025-04-14 00:13:25,167 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=164, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=56, PETRI_TRANSITIONS=45} [2025-04-14 00:13:25,167 INFO L279 CegarLoopForPetriNet]: 55 programPoint places, 1 predicate places. [2025-04-14 00:13:25,168 INFO L485 AbstractCegarLoop]: Abstraction has has 56 places, 45 transitions, 176 flow [2025-04-14 00:13:25,168 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 21.166666666666668) internal successors, (127), 6 states have internal predecessors, (127), 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-14 00:13:25,168 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:13:25,168 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:13:25,168 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-04-14 00:13:25,168 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-04-14 00:13:25,168 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:13:25,168 INFO L85 PathProgramCache]: Analyzing trace with hash -86581574, now seen corresponding path program 1 times [2025-04-14 00:13:25,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:13:25,170 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [124014362] [2025-04-14 00:13:25,170 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 00:13:25,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:13:25,179 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-04-14 00:13:25,191 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-04-14 00:13:25,192 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:13:25,192 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:13:25,294 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-14 00:13:25,294 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:13:25,294 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [124014362] [2025-04-14 00:13:25,294 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [124014362] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:13:25,294 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:13:25,294 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-14 00:13:25,294 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2126801643] [2025-04-14 00:13:25,295 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:13:25,295 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-14 00:13:25,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:13:25,295 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-14 00:13:25,295 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-14 00:13:25,295 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 59 [2025-04-14 00:13:25,296 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 45 transitions, 176 flow. Second operand has 4 states, 4 states have (on average 24.25) internal successors, (97), 4 states have internal predecessors, (97), 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-14 00:13:25,296 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:13:25,296 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 59 [2025-04-14 00:13:25,296 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:13:25,357 INFO L116 PetriNetUnfolderBase]: 51/192 cut-off events. [2025-04-14 00:13:25,357 INFO L117 PetriNetUnfolderBase]: For 168/168 co-relation queries the response was YES. [2025-04-14 00:13:25,358 INFO L83 FinitePrefix]: Finished finitePrefix Result has 500 conditions, 192 events. 51/192 cut-off events. For 168/168 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 567 event pairs, 42 based on Foata normal form. 4/193 useless extension candidates. Maximal degree in co-relation 484. Up to 138 conditions per place. [2025-04-14 00:13:25,358 INFO L140 encePairwiseOnDemand]: 55/59 looper letters, 0 selfloop transitions, 0 changer transitions 49/49 dead transitions. [2025-04-14 00:13:25,358 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 49 transitions, 266 flow [2025-04-14 00:13:25,358 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 00:13:25,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-04-14 00:13:25,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 103 transitions. [2025-04-14 00:13:25,359 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4364406779661017 [2025-04-14 00:13:25,359 INFO L175 Difference]: Start difference. First operand has 56 places, 45 transitions, 176 flow. Second operand 4 states and 103 transitions. [2025-04-14 00:13:25,359 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 49 transitions, 266 flow [2025-04-14 00:13:25,360 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 49 transitions, 258 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-04-14 00:13:25,360 INFO L231 Difference]: Finished difference. Result has 55 places, 0 transitions, 0 flow [2025-04-14 00:13:25,360 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=164, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=0, PETRI_PLACES=55, PETRI_TRANSITIONS=0} [2025-04-14 00:13:25,362 INFO L279 CegarLoopForPetriNet]: 55 programPoint places, 0 predicate places. [2025-04-14 00:13:25,362 INFO L485 AbstractCegarLoop]: Abstraction has has 55 places, 0 transitions, 0 flow [2025-04-14 00:13:25,362 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.25) internal successors, (97), 4 states have internal predecessors, (97), 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-14 00:13:25,364 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2025-04-14 00:13:25,364 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining) [2025-04-14 00:13:25,364 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (2 of 5 remaining) [2025-04-14 00:13:25,364 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 5 remaining) [2025-04-14 00:13:25,364 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 5 remaining) [2025-04-14 00:13:25,364 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-04-14 00:13:25,364 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:13:25,370 INFO L242 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-04-14 00:13:25,370 INFO L171 ceAbstractionStarter]: Computing trace abstraction results [2025-04-14 00:13:25,374 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.04 12:13:25 BasicIcfg [2025-04-14 00:13:25,374 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-04-14 00:13:25,375 INFO L158 Benchmark]: Toolchain (without parser) took 3534.74ms. Allocated memory was 155.2MB in the beginning and 364.9MB in the end (delta: 209.7MB). Free memory was 107.9MB in the beginning and 290.1MB in the end (delta: -182.3MB). Peak memory consumption was 27.0MB. Max. memory is 8.0GB. [2025-04-14 00:13:25,375 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 159.4MB. Free memory is still 86.3MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-14 00:13:25,376 INFO L158 Benchmark]: CACSL2BoogieTranslator took 425.58ms. Allocated memory is still 155.2MB. Free memory was 107.9MB in the beginning and 84.8MB in the end (delta: 23.1MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. [2025-04-14 00:13:25,376 INFO L158 Benchmark]: Boogie Procedure Inliner took 29.52ms. Allocated memory is still 155.2MB. Free memory was 84.8MB in the beginning and 82.2MB in the end (delta: 2.5MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-14 00:13:25,376 INFO L158 Benchmark]: Boogie Preprocessor took 41.19ms. Allocated memory is still 155.2MB. Free memory was 82.2MB in the beginning and 80.6MB in the end (delta: 1.7MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-14 00:13:25,376 INFO L158 Benchmark]: IcfgBuilder took 533.41ms. Allocated memory is still 155.2MB. Free memory was 80.6MB in the beginning and 31.9MB in the end (delta: 48.7MB). Peak memory consumption was 46.1MB. Max. memory is 8.0GB. [2025-04-14 00:13:25,376 INFO L158 Benchmark]: TraceAbstraction took 2496.96ms. Allocated memory was 155.2MB in the beginning and 364.9MB in the end (delta: 209.7MB). Free memory was 31.1MB in the beginning and 290.1MB in the end (delta: -259.1MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-14 00:13:25,377 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.18ms. Allocated memory is still 159.4MB. Free memory is still 86.3MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 425.58ms. Allocated memory is still 155.2MB. Free memory was 107.9MB in the beginning and 84.8MB in the end (delta: 23.1MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 29.52ms. Allocated memory is still 155.2MB. Free memory was 84.8MB in the beginning and 82.2MB in the end (delta: 2.5MB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 41.19ms. Allocated memory is still 155.2MB. Free memory was 82.2MB in the beginning and 80.6MB in the end (delta: 1.7MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * IcfgBuilder took 533.41ms. Allocated memory is still 155.2MB. Free memory was 80.6MB in the beginning and 31.9MB in the end (delta: 48.7MB). Peak memory consumption was 46.1MB. Max. memory is 8.0GB. * TraceAbstraction took 2496.96ms. Allocated memory was 155.2MB in the beginning and 364.9MB in the end (delta: 209.7MB). Free memory was 31.1MB in the beginning and 290.1MB in the end (delta: -259.1MB). There was no memory consumed. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 19]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 19]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 19]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 19]: 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 3 procedures, 87 locations, 86 edges, 5 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.4s, OverallIterations: 8, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 211 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 211 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 96 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 563 IncrementalHoareTripleChecker+Invalid, 659 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 96 mSolverCounterUnsat, 0 mSDtfsCounter, 563 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 35 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=212occurred in iteration=5, InterpolantAutomatonStates: 30, 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, 188 NumberOfCodeBlocks, 188 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 180 ConstructedInterpolants, 0 QuantifiedInterpolants, 1026 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 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 4 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-04-14 00:13:25,392 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...