/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 FINITE_AUTOMATA -i ../../../trunk/examples/svcomp/goblint-regression/13-privatized_29-multiple-protecting2-vesal_true.i -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.cfg-lbe-improvements-94356ea-m [2025-04-13 17:26:26,493 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-13 17:26:26,540 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 17:26:26,546 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-13 17:26:26,547 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-13 17:26:26,567 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-13 17:26:26,567 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-13 17:26:26,568 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-13 17:26:26,568 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-13 17:26:26,568 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-13 17:26:26,568 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-13 17:26:26,568 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-13 17:26:26,568 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-13 17:26:26,568 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-13 17:26:26,568 INFO L153 SettingsManager]: * Use SBE=true [2025-04-13 17:26:26,568 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-13 17:26:26,569 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-13 17:26:26,569 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-13 17:26:26,570 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-13 17:26:26,570 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-13 17:26:26,570 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-13 17:26:26,570 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-13 17:26:26,570 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-13 17:26:26,570 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-13 17:26:26,570 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-13 17:26:26,570 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-13 17:26:26,570 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-13 17:26:26,570 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-13 17:26:26,571 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-13 17:26:26,571 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 17:26:26,571 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 17:26:26,571 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 17:26:26,571 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 17:26:26,571 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-13 17:26:26,571 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 17:26:26,571 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 17:26:26,571 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 17:26:26,571 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 17:26:26,571 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-13 17:26:26,571 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-13 17:26:26,571 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-13 17:26:26,571 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-13 17:26:26,572 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-13 17:26:26,572 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-13 17:26:26,572 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-13 17:26:26,572 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-13 17:26:26,572 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-13 17:26:26,572 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 -> FINITE_AUTOMATA [2025-04-13 17:26:26,771 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-13 17:26:26,779 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-13 17:26:26,781 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-13 17:26:26,782 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-13 17:26:26,783 INFO L274 PluginConnector]: CDTParser initialized [2025-04-13 17:26:26,784 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/goblint-regression/13-privatized_29-multiple-protecting2-vesal_true.i [2025-04-13 17:26:28,082 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/754f565cc/a4bf37c5d5ea4d60b0ed1d38c7225c09/FLAGf9222dec4 [2025-04-13 17:26:28,338 INFO L389 CDTParser]: Found 1 translation units. [2025-04-13 17:26:28,338 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/13-privatized_29-multiple-protecting2-vesal_true.i [2025-04-13 17:26:28,354 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/754f565cc/a4bf37c5d5ea4d60b0ed1d38c7225c09/FLAGf9222dec4 [2025-04-13 17:26:29,132 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/754f565cc/a4bf37c5d5ea4d60b0ed1d38c7225c09 [2025-04-13 17:26:29,134 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-13 17:26:29,135 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-04-13 17:26:29,136 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-13 17:26:29,136 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-13 17:26:29,139 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-13 17:26:29,139 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 05:26:29" (1/1) ... [2025-04-13 17:26:29,140 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2e564fdb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 05:26:29, skipping insertion in model container [2025-04-13 17:26:29,140 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 05:26:29" (1/1) ... [2025-04-13 17:26:29,161 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-13 17:26:29,281 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_29-multiple-protecting2-vesal_true.i[1103,1116] [2025-04-13 17:26:29,378 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 17:26:29,392 INFO L200 MainTranslator]: Completed pre-run [2025-04-13 17:26:29,405 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_29-multiple-protecting2-vesal_true.i[1103,1116] [2025-04-13 17:26:29,448 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 17:26:29,482 INFO L204 MainTranslator]: Completed translation [2025-04-13 17:26:29,483 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 05:26:29 WrapperNode [2025-04-13 17:26:29,483 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-13 17:26:29,483 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-13 17:26:29,483 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-13 17:26:29,483 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-13 17:26:29,491 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 05:26:29" (1/1) ... [2025-04-13 17:26:29,501 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 05:26:29" (1/1) ... [2025-04-13 17:26:29,520 INFO L138 Inliner]: procedures = 162, calls = 42, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 82 [2025-04-13 17:26:29,520 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-13 17:26:29,521 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-13 17:26:29,521 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-13 17:26:29,521 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-13 17:26:29,527 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 05:26:29" (1/1) ... [2025-04-13 17:26:29,527 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 05:26:29" (1/1) ... [2025-04-13 17:26:29,531 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 05:26:29" (1/1) ... [2025-04-13 17:26:29,549 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-13 17:26:29,549 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 05:26:29" (1/1) ... [2025-04-13 17:26:29,549 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 05:26:29" (1/1) ... [2025-04-13 17:26:29,555 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 05:26:29" (1/1) ... [2025-04-13 17:26:29,555 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 05:26:29" (1/1) ... [2025-04-13 17:26:29,557 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 05:26:29" (1/1) ... [2025-04-13 17:26:29,559 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 05:26:29" (1/1) ... [2025-04-13 17:26:29,560 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 05:26:29" (1/1) ... [2025-04-13 17:26:29,562 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-13 17:26:29,565 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-13 17:26:29,566 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-13 17:26:29,566 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-13 17:26:29,566 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 05:26:29" (1/1) ... [2025-04-13 17:26:29,572 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 17:26:29,581 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 17:26:29,594 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 17:26:29,599 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 17:26:29,616 INFO L130 BoogieDeclarations]: Found specification of procedure t2_fun [2025-04-13 17:26:29,616 INFO L138 BoogieDeclarations]: Found implementation of procedure t2_fun [2025-04-13 17:26:29,616 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-04-13 17:26:29,616 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-13 17:26:29,617 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-04-13 17:26:29,617 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-04-13 17:26:29,617 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-04-13 17:26:29,617 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-04-13 17:26:29,617 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-04-13 17:26:29,617 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-13 17:26:29,617 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-13 17:26:29,618 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 17:26:29,719 INFO L234 CfgBuilder]: Building ICFG [2025-04-13 17:26:29,720 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-13 17:26:29,884 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-13 17:26:29,885 INFO L289 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-13 17:26:29,885 INFO L294 CfgBuilder]: Performing block encoding [2025-04-13 17:26:30,038 INFO L313 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-13 17:26:30,038 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.04 05:26:30 BoogieIcfgContainer [2025-04-13 17:26:30,038 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-13 17:26:30,040 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-13 17:26:30,040 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-13 17:26:30,044 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-13 17:26:30,045 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.04 05:26:29" (1/3) ... [2025-04-13 17:26:30,045 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@528313f3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 05:26:30, skipping insertion in model container [2025-04-13 17:26:30,045 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 05:26:29" (2/3) ... [2025-04-13 17:26:30,046 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@528313f3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 05:26:30, skipping insertion in model container [2025-04-13 17:26:30,046 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.04 05:26:30" (3/3) ... [2025-04-13 17:26:30,046 INFO L128 eAbstractionObserver]: Analyzing ICFG 13-privatized_29-multiple-protecting2-vesal_true.i [2025-04-13 17:26:30,057 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-13 17:26:30,058 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 13-privatized_29-multiple-protecting2-vesal_true.i that has 2 procedures, 39 locations, 37 edges, 1 initial locations, 0 loop locations, and 3 error locations. [2025-04-13 17:26:30,058 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-13 17:26:30,088 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2025-04-13 17:26:30,108 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 42 places, 38 transitions, 83 flow [2025-04-13 17:26:30,131 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 198 states, 195 states have (on average 1.876923076923077) internal successors, (366), 197 states have internal predecessors, (366), 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 17:26:30,153 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-13 17:26:30,161 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=FINITE_AUTOMATA, 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;@5be3f11c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-13 17:26:30,161 INFO L341 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-04-13 17:26:30,163 INFO L278 IsEmpty]: Start isEmpty. Operand has 198 states, 195 states have (on average 1.876923076923077) internal successors, (366), 197 states have internal predecessors, (366), 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 17:26:30,167 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-04-13 17:26:30,167 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:26:30,168 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:26:30,168 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-04-13 17:26:30,172 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:26:30,173 INFO L85 PathProgramCache]: Analyzing trace with hash 1118499768, now seen corresponding path program 1 times [2025-04-13 17:26:30,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:26:30,178 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [398873170] [2025-04-13 17:26:30,178 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 17:26:30,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:26:30,244 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-13 17:26:30,269 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-13 17:26:30,269 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 17:26:30,269 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:26:30,440 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 17:26:30,441 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:26:30,441 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [398873170] [2025-04-13 17:26:30,441 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [398873170] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 17:26:30,441 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 17:26:30,442 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-04-13 17:26:30,442 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [722458786] [2025-04-13 17:26:30,443 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 17:26:30,445 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 17:26:30,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:26:30,463 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 17:26:30,463 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 17:26:30,465 INFO L87 Difference]: Start difference. First operand has 198 states, 195 states have (on average 1.876923076923077) internal successors, (366), 197 states have internal predecessors, (366), 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) Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 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 17:26:30,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:26:30,533 INFO L93 Difference]: Finished difference Result 243 states and 432 transitions. [2025-04-13 17:26:30,534 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 17:26:30,535 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 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) Word has length 7 [2025-04-13 17:26:30,535 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:26:30,541 INFO L225 Difference]: With dead ends: 243 [2025-04-13 17:26:30,541 INFO L226 Difference]: Without dead ends: 229 [2025-04-13 17:26:30,544 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 17:26:30,545 INFO L437 NwaCegarLoop]: 8 mSDtfsCounter, 19 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-13 17:26:30,546 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 12 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-13 17:26:30,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2025-04-13 17:26:30,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 189. [2025-04-13 17:26:30,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 189 states, 186 states have (on average 1.8709677419354838) internal successors, (348), 188 states have internal predecessors, (348), 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 17:26:30,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 348 transitions. [2025-04-13 17:26:30,592 INFO L79 Accepts]: Start accepts. Automaton has 189 states and 348 transitions. Word has length 7 [2025-04-13 17:26:30,592 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:26:30,592 INFO L485 AbstractCegarLoop]: Abstraction has 189 states and 348 transitions. [2025-04-13 17:26:30,592 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 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 17:26:30,592 INFO L278 IsEmpty]: Start isEmpty. Operand 189 states and 348 transitions. [2025-04-13 17:26:30,593 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-04-13 17:26:30,593 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:26:30,593 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:26:30,593 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-13 17:26:30,593 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-04-13 17:26:30,593 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:26:30,593 INFO L85 PathProgramCache]: Analyzing trace with hash 1118499769, now seen corresponding path program 1 times [2025-04-13 17:26:30,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:26:30,594 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2091043588] [2025-04-13 17:26:30,594 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 17:26:30,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:26:30,608 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-13 17:26:30,612 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-13 17:26:30,612 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 17:26:30,612 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:26:30,707 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 17:26:30,708 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:26:30,708 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2091043588] [2025-04-13 17:26:30,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2091043588] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 17:26:30,708 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 17:26:30,708 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-04-13 17:26:30,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1157035941] [2025-04-13 17:26:30,708 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 17:26:30,709 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 17:26:30,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:26:30,709 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 17:26:30,709 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 17:26:30,709 INFO L87 Difference]: Start difference. First operand 189 states and 348 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 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 17:26:30,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:26:30,791 INFO L93 Difference]: Finished difference Result 261 states and 466 transitions. [2025-04-13 17:26:30,791 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 17:26:30,791 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 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) Word has length 7 [2025-04-13 17:26:30,791 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:26:30,793 INFO L225 Difference]: With dead ends: 261 [2025-04-13 17:26:30,793 INFO L226 Difference]: Without dead ends: 247 [2025-04-13 17:26:30,794 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 17:26:30,794 INFO L437 NwaCegarLoop]: 9 mSDtfsCounter, 18 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 17:26:30,794 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 14 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 17:26:30,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2025-04-13 17:26:30,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 184. [2025-04-13 17:26:30,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 184 states, 181 states have (on average 1.867403314917127) internal successors, (338), 183 states have internal predecessors, (338), 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 17:26:30,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 338 transitions. [2025-04-13 17:26:30,807 INFO L79 Accepts]: Start accepts. Automaton has 184 states and 338 transitions. Word has length 7 [2025-04-13 17:26:30,807 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:26:30,807 INFO L485 AbstractCegarLoop]: Abstraction has 184 states and 338 transitions. [2025-04-13 17:26:30,807 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 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 17:26:30,807 INFO L278 IsEmpty]: Start isEmpty. Operand 184 states and 338 transitions. [2025-04-13 17:26:30,808 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-04-13 17:26:30,808 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:26:30,808 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:26:30,808 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-13 17:26:30,808 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-04-13 17:26:30,809 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:26:30,809 INFO L85 PathProgramCache]: Analyzing trace with hash -937976152, now seen corresponding path program 1 times [2025-04-13 17:26:30,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:26:30,809 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [346347722] [2025-04-13 17:26:30,809 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 17:26:30,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:26:30,821 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-04-13 17:26:30,831 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-13 17:26:30,833 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 17:26:30,833 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:26:30,908 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 17:26:30,908 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:26:30,908 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [346347722] [2025-04-13 17:26:30,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [346347722] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 17:26:30,908 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 17:26:30,908 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-13 17:26:30,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1888759049] [2025-04-13 17:26:30,908 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 17:26:30,909 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 17:26:30,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:26:30,909 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 17:26:30,909 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-13 17:26:30,909 INFO L87 Difference]: Start difference. First operand 184 states and 338 transitions. Second operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 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 17:26:30,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:26:30,969 INFO L93 Difference]: Finished difference Result 193 states and 346 transitions. [2025-04-13 17:26:30,970 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-13 17:26:30,970 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 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) Word has length 12 [2025-04-13 17:26:30,970 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:26:30,971 INFO L225 Difference]: With dead ends: 193 [2025-04-13 17:26:30,971 INFO L226 Difference]: Without dead ends: 170 [2025-04-13 17:26:30,972 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-13 17:26:30,972 INFO L437 NwaCegarLoop]: 7 mSDtfsCounter, 31 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 17:26:30,972 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 12 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 17:26:30,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2025-04-13 17:26:30,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 170. [2025-04-13 17:26:30,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 168 states have (on average 1.8511904761904763) internal successors, (311), 169 states have internal predecessors, (311), 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 17:26:30,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 311 transitions. [2025-04-13 17:26:30,980 INFO L79 Accepts]: Start accepts. Automaton has 170 states and 311 transitions. Word has length 12 [2025-04-13 17:26:30,980 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:26:30,980 INFO L485 AbstractCegarLoop]: Abstraction has 170 states and 311 transitions. [2025-04-13 17:26:30,980 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 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 17:26:30,980 INFO L278 IsEmpty]: Start isEmpty. Operand 170 states and 311 transitions. [2025-04-13 17:26:30,981 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-04-13 17:26:30,981 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:26:30,981 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:26:30,981 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-13 17:26:30,981 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-04-13 17:26:30,982 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:26:30,982 INFO L85 PathProgramCache]: Analyzing trace with hash -408998407, now seen corresponding path program 1 times [2025-04-13 17:26:30,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:26:30,982 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1364010756] [2025-04-13 17:26:30,982 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 17:26:30,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:26:30,988 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-13 17:26:30,995 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-13 17:26:30,995 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 17:26:30,995 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:26:31,084 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 17:26:31,084 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:26:31,084 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1364010756] [2025-04-13 17:26:31,084 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1364010756] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 17:26:31,084 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 17:26:31,084 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 17:26:31,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1565690729] [2025-04-13 17:26:31,084 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 17:26:31,085 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 17:26:31,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:26:31,085 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 17:26:31,085 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-04-13 17:26:31,085 INFO L87 Difference]: Start difference. First operand 170 states and 311 transitions. Second operand has 5 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 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 17:26:31,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:26:31,148 INFO L93 Difference]: Finished difference Result 175 states and 315 transitions. [2025-04-13 17:26:31,148 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 17:26:31,148 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 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) Word has length 16 [2025-04-13 17:26:31,148 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:26:31,149 INFO L225 Difference]: With dead ends: 175 [2025-04-13 17:26:31,149 INFO L226 Difference]: Without dead ends: 170 [2025-04-13 17:26:31,149 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-04-13 17:26:31,150 INFO L437 NwaCegarLoop]: 11 mSDtfsCounter, 35 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 17:26:31,150 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 23 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 17:26:31,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2025-04-13 17:26:31,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 165. [2025-04-13 17:26:31,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 164 states have (on average 1.8414634146341464) internal successors, (302), 164 states have internal predecessors, (302), 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 17:26:31,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 302 transitions. [2025-04-13 17:26:31,158 INFO L79 Accepts]: Start accepts. Automaton has 165 states and 302 transitions. Word has length 16 [2025-04-13 17:26:31,162 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:26:31,162 INFO L485 AbstractCegarLoop]: Abstraction has 165 states and 302 transitions. [2025-04-13 17:26:31,163 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 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 17:26:31,163 INFO L278 IsEmpty]: Start isEmpty. Operand 165 states and 302 transitions. [2025-04-13 17:26:31,163 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-04-13 17:26:31,163 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:26:31,163 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:26:31,163 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-13 17:26:31,163 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-04-13 17:26:31,164 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:26:31,164 INFO L85 PathProgramCache]: Analyzing trace with hash 616529674, now seen corresponding path program 1 times [2025-04-13 17:26:31,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:26:31,164 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1862608188] [2025-04-13 17:26:31,164 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 17:26:31,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:26:31,173 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-04-13 17:26:31,181 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-04-13 17:26:31,181 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 17:26:31,181 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:26:31,281 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 17:26:31,282 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:26:31,282 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1862608188] [2025-04-13 17:26:31,282 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1862608188] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 17:26:31,282 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 17:26:31,282 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 17:26:31,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [345917934] [2025-04-13 17:26:31,282 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 17:26:31,282 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 17:26:31,282 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:26:31,282 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 17:26:31,283 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-04-13 17:26:31,283 INFO L87 Difference]: Start difference. First operand 165 states and 302 transitions. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:26:31,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:26:31,333 INFO L93 Difference]: Finished difference Result 237 states and 426 transitions. [2025-04-13 17:26:31,333 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-13 17:26:31,334 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2025-04-13 17:26:31,334 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:26:31,335 INFO L225 Difference]: With dead ends: 237 [2025-04-13 17:26:31,335 INFO L226 Difference]: Without dead ends: 154 [2025-04-13 17:26:31,336 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-04-13 17:26:31,337 INFO L437 NwaCegarLoop]: 14 mSDtfsCounter, 39 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-13 17:26:31,337 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 21 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-13 17:26:31,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2025-04-13 17:26:31,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 146. [2025-04-13 17:26:31,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 144 states have (on average 1.7638888888888888) internal successors, (254), 145 states have internal predecessors, (254), 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 17:26:31,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 254 transitions. [2025-04-13 17:26:31,347 INFO L79 Accepts]: Start accepts. Automaton has 146 states and 254 transitions. Word has length 18 [2025-04-13 17:26:31,347 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:26:31,347 INFO L485 AbstractCegarLoop]: Abstraction has 146 states and 254 transitions. [2025-04-13 17:26:31,348 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:26:31,348 INFO L278 IsEmpty]: Start isEmpty. Operand 146 states and 254 transitions. [2025-04-13 17:26:31,348 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-04-13 17:26:31,348 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:26:31,348 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:26:31,348 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-13 17:26:31,349 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-04-13 17:26:31,349 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:26:31,349 INFO L85 PathProgramCache]: Analyzing trace with hash 1321187830, now seen corresponding path program 1 times [2025-04-13 17:26:31,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:26:31,349 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1230666779] [2025-04-13 17:26:31,349 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 17:26:31,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:26:31,359 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-04-13 17:26:31,366 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 17:26:31,366 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 17:26:31,366 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:26:31,501 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 17:26:31,501 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:26:31,501 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1230666779] [2025-04-13 17:26:31,501 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1230666779] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 17:26:31,501 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 17:26:31,501 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-13 17:26:31,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [455237918] [2025-04-13 17:26:31,501 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 17:26:31,501 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-13 17:26:31,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:26:31,502 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-13 17:26:31,502 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-04-13 17:26:31,502 INFO L87 Difference]: Start difference. First operand 146 states and 254 transitions. Second operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 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 17:26:31,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:26:31,546 INFO L93 Difference]: Finished difference Result 154 states and 264 transitions. [2025-04-13 17:26:31,546 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-13 17:26:31,547 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 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) Word has length 19 [2025-04-13 17:26:31,547 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:26:31,547 INFO L225 Difference]: With dead ends: 154 [2025-04-13 17:26:31,547 INFO L226 Difference]: Without dead ends: 114 [2025-04-13 17:26:31,548 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-04-13 17:26:31,548 INFO L437 NwaCegarLoop]: 10 mSDtfsCounter, 27 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-13 17:26:31,548 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 16 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-13 17:26:31,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2025-04-13 17:26:31,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2025-04-13 17:26:31,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 113 states have (on average 1.6991150442477876) internal successors, (192), 113 states have internal predecessors, (192), 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 17:26:31,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 192 transitions. [2025-04-13 17:26:31,554 INFO L79 Accepts]: Start accepts. Automaton has 114 states and 192 transitions. Word has length 19 [2025-04-13 17:26:31,554 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:26:31,554 INFO L485 AbstractCegarLoop]: Abstraction has 114 states and 192 transitions. [2025-04-13 17:26:31,554 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 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 17:26:31,554 INFO L278 IsEmpty]: Start isEmpty. Operand 114 states and 192 transitions. [2025-04-13 17:26:31,555 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-13 17:26:31,555 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:26:31,556 INFO L218 NwaCegarLoop]: 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] [2025-04-13 17:26:31,556 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-04-13 17:26:31,556 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-04-13 17:26:31,556 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:26:31,556 INFO L85 PathProgramCache]: Analyzing trace with hash 1384879723, now seen corresponding path program 1 times [2025-04-13 17:26:31,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:26:31,556 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2087769345] [2025-04-13 17:26:31,556 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 17:26:31,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:26:31,567 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-04-13 17:26:31,576 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 17:26:31,576 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 17:26:31,576 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:26:31,687 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 17:26:31,687 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:26:31,687 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2087769345] [2025-04-13 17:26:31,687 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2087769345] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 17:26:31,687 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 17:26:31,687 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 17:26:31,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1668240291] [2025-04-13 17:26:31,687 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 17:26:31,687 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 17:26:31,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:26:31,688 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 17:26:31,688 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-13 17:26:31,688 INFO L87 Difference]: Start difference. First operand 114 states and 192 transitions. Second operand has 5 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 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 17:26:31,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:26:31,718 INFO L93 Difference]: Finished difference Result 114 states and 192 transitions. [2025-04-13 17:26:31,718 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-13 17:26:31,718 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 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) Word has length 25 [2025-04-13 17:26:31,718 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:26:31,719 INFO L225 Difference]: With dead ends: 114 [2025-04-13 17:26:31,719 INFO L226 Difference]: Without dead ends: 0 [2025-04-13 17:26:31,719 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-13 17:26:31,719 INFO L437 NwaCegarLoop]: 9 mSDtfsCounter, 13 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-13 17:26:31,720 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 18 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-13 17:26:31,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-04-13 17:26:31,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-04-13 17:26:31,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 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 17:26:31,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-04-13 17:26:31,720 INFO L79 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 25 [2025-04-13 17:26:31,720 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:26:31,720 INFO L485 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-13 17:26:31,720 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 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 17:26:31,720 INFO L278 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-04-13 17:26:31,721 INFO L284 IsEmpty]: Finished isEmpty. No accepting run. [2025-04-13 17:26:31,724 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2025-04-13 17:26:31,724 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (2 of 4 remaining) [2025-04-13 17:26:31,724 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (1 of 4 remaining) [2025-04-13 17:26:31,724 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining) [2025-04-13 17:26:31,724 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-04-13 17:26:31,728 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:26:31,730 INFO L242 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-04-13 17:26:31,730 INFO L171 ceAbstractionStarter]: Computing trace abstraction results [2025-04-13 17:26:31,732 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.04 05:26:31 BasicIcfg [2025-04-13 17:26:31,733 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-04-13 17:26:31,733 INFO L158 Benchmark]: Toolchain (without parser) took 2598.38ms. Allocated memory is still 125.8MB. Free memory was 85.5MB in the beginning and 62.6MB in the end (delta: 22.9MB). Peak memory consumption was 23.8MB. Max. memory is 8.0GB. [2025-04-13 17:26:31,733 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 155.2MB. Free memory is still 82.6MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-13 17:26:31,733 INFO L158 Benchmark]: CACSL2BoogieTranslator took 347.28ms. Allocated memory is still 125.8MB. Free memory was 84.8MB in the beginning and 62.5MB in the end (delta: 22.3MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. [2025-04-13 17:26:31,734 INFO L158 Benchmark]: Boogie Procedure Inliner took 37.11ms. Allocated memory is still 125.8MB. Free memory was 61.9MB in the beginning and 59.9MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-13 17:26:31,734 INFO L158 Benchmark]: Boogie Preprocessor took 41.25ms. Allocated memory is still 125.8MB. Free memory was 59.9MB in the beginning and 58.3MB in the end (delta: 1.5MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-13 17:26:31,734 INFO L158 Benchmark]: RCFGBuilder took 472.87ms. Allocated memory is still 125.8MB. Free memory was 58.3MB in the beginning and 82.3MB in the end (delta: -23.9MB). Peak memory consumption was 39.7MB. Max. memory is 8.0GB. [2025-04-13 17:26:31,735 INFO L158 Benchmark]: TraceAbstraction took 1692.97ms. Allocated memory is still 125.8MB. Free memory was 81.7MB in the beginning and 62.6MB in the end (delta: 19.0MB). Peak memory consumption was 17.6MB. Max. memory is 8.0GB. [2025-04-13 17:26:31,736 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.17ms. Allocated memory is still 155.2MB. Free memory is still 82.6MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 347.28ms. Allocated memory is still 125.8MB. Free memory was 84.8MB in the beginning and 62.5MB in the end (delta: 22.3MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 37.11ms. Allocated memory is still 125.8MB. Free memory was 61.9MB in the beginning and 59.9MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 41.25ms. Allocated memory is still 125.8MB. Free memory was 59.9MB in the beginning and 58.3MB in the end (delta: 1.5MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * RCFGBuilder took 472.87ms. Allocated memory is still 125.8MB. Free memory was 58.3MB in the beginning and 82.3MB in the end (delta: -23.9MB). Peak memory consumption was 39.7MB. Max. memory is 8.0GB. * TraceAbstraction took 1692.97ms. Allocated memory is still 125.8MB. Free memory was 81.7MB in the beginning and 62.6MB in the end (delta: 19.0MB). Peak memory consumption was 17.6MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - 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, 54 locations, 53 edges, 4 error locations. Started 1 CEGAR loops. OverallTime: 1.6s, OverallIterations: 7, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 182 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 182 mSDsluCounter, 116 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 48 mSDsCounter, 38 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 304 IncrementalHoareTripleChecker+Invalid, 342 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 38 mSolverCounterUnsat, 68 mSDtfsCounter, 304 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 23 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=198occurred in iteration=0, InterpolantAutomatonStates: 27, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 7 MinimizatonAttempts, 116 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 104 NumberOfCodeBlocks, 104 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 97 ConstructedInterpolants, 0 QuantifiedInterpolants, 448 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 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 3 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-04-13 17:26:31,750 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...