./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/recursive/Ackermann01-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/recursive/Ackermann01-2.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 93bcf8b6df587e0bc8cb137c6415932ffc9083999b1b09826c5b148989ca1a7b --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 05:42:04,809 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 05:42:04,861 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 05:42:04,867 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 05:42:04,867 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 05:42:04,889 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 05:42:04,890 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 05:42:04,890 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 05:42:04,890 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 05:42:04,890 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 05:42:04,890 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 05:42:04,890 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 05:42:04,891 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 05:42:04,891 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 05:42:04,891 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 05:42:04,891 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 05:42:04,892 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 05:42:04,892 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 05:42:04,892 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 05:42:04,892 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 05:42:04,893 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 05:42:04,893 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 05:42:04,893 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 05:42:04,893 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 05:42:04,893 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 05:42:04,893 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 05:42:04,893 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 05:42:04,893 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 05:42:04,893 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 05:42:04,893 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 05:42:04,893 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 05:42:04,893 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 05:42:04,893 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 05:42:04,893 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 05:42:04,893 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 05:42:04,893 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 05:42:04,893 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 05:42:04,893 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 05:42:04,894 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 05:42:04,894 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 05:42:04,894 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 05:42:04,894 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 05:42:04,894 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 05:42:04,894 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 93bcf8b6df587e0bc8cb137c6415932ffc9083999b1b09826c5b148989ca1a7b [2025-03-08 05:42:05,126 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 05:42:05,133 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 05:42:05,135 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 05:42:05,136 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 05:42:05,136 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 05:42:05,138 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/recursive/Ackermann01-2.c [2025-03-08 05:42:06,248 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c6a486bf5/ca1434e67682419392b8ba3e414632a5/FLAGa8f6f57c7 [2025-03-08 05:42:06,464 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 05:42:06,464 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive/Ackermann01-2.c [2025-03-08 05:42:06,470 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c6a486bf5/ca1434e67682419392b8ba3e414632a5/FLAGa8f6f57c7 [2025-03-08 05:42:06,481 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c6a486bf5/ca1434e67682419392b8ba3e414632a5 [2025-03-08 05:42:06,483 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 05:42:06,484 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 05:42:06,484 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 05:42:06,485 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 05:42:06,488 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 05:42:06,489 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 05:42:06" (1/1) ... [2025-03-08 05:42:06,489 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@36826a78 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:42:06, skipping insertion in model container [2025-03-08 05:42:06,489 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 05:42:06" (1/1) ... [2025-03-08 05:42:06,499 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 05:42:06,583 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive/Ackermann01-2.c[1234,1247] [2025-03-08 05:42:06,585 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 05:42:06,591 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 05:42:06,600 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive/Ackermann01-2.c[1234,1247] [2025-03-08 05:42:06,600 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 05:42:06,609 INFO L204 MainTranslator]: Completed translation [2025-03-08 05:42:06,609 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:42:06 WrapperNode [2025-03-08 05:42:06,609 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 05:42:06,610 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 05:42:06,610 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 05:42:06,610 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 05:42:06,614 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:42:06" (1/1) ... [2025-03-08 05:42:06,619 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:42:06" (1/1) ... [2025-03-08 05:42:06,628 INFO L138 Inliner]: procedures = 13, calls = 11, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 33 [2025-03-08 05:42:06,629 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 05:42:06,630 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 05:42:06,630 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 05:42:06,630 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 05:42:06,634 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:42:06" (1/1) ... [2025-03-08 05:42:06,635 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:42:06" (1/1) ... [2025-03-08 05:42:06,635 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:42:06" (1/1) ... [2025-03-08 05:42:06,644 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-08 05:42:06,646 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:42:06" (1/1) ... [2025-03-08 05:42:06,646 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:42:06" (1/1) ... [2025-03-08 05:42:06,648 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:42:06" (1/1) ... [2025-03-08 05:42:06,648 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:42:06" (1/1) ... [2025-03-08 05:42:06,648 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:42:06" (1/1) ... [2025-03-08 05:42:06,649 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:42:06" (1/1) ... [2025-03-08 05:42:06,652 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 05:42:06,653 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 05:42:06,653 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 05:42:06,653 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 05:42:06,654 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:42:06" (1/1) ... [2025-03-08 05:42:06,657 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 05:42:06,667 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:42:06,678 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-03-08 05:42:06,682 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-03-08 05:42:06,696 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 05:42:06,697 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 05:42:06,697 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 05:42:06,697 INFO L130 BoogieDeclarations]: Found specification of procedure ackermann [2025-03-08 05:42:06,697 INFO L138 BoogieDeclarations]: Found implementation of procedure ackermann [2025-03-08 05:42:06,697 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 05:42:06,738 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 05:42:06,739 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 05:42:06,818 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L24: havoc #t~ret5;havoc #t~ret6; [2025-03-08 05:42:06,819 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L22: havoc #t~ret4; [2025-03-08 05:42:06,829 INFO L? ?]: Removed 13 outVars from TransFormulas that were not future-live. [2025-03-08 05:42:06,829 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 05:42:06,835 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 05:42:06,836 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 05:42:06,836 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 05:42:06 BoogieIcfgContainer [2025-03-08 05:42:06,836 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 05:42:06,838 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 05:42:06,838 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 05:42:06,841 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 05:42:06,842 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 05:42:06" (1/3) ... [2025-03-08 05:42:06,842 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36aafe8e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 05:42:06, skipping insertion in model container [2025-03-08 05:42:06,843 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:42:06" (2/3) ... [2025-03-08 05:42:06,843 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36aafe8e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 05:42:06, skipping insertion in model container [2025-03-08 05:42:06,843 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 05:42:06" (3/3) ... [2025-03-08 05:42:06,844 INFO L128 eAbstractionObserver]: Analyzing ICFG Ackermann01-2.c [2025-03-08 05:42:06,854 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 05:42:06,856 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Ackermann01-2.c that has 2 procedures, 23 locations, 1 initial locations, 0 loop locations, and 1 error locations. [2025-03-08 05:42:06,895 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 05:42:06,903 INFO L333 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;@676707ff, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 05:42:06,904 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 05:42:06,907 INFO L276 IsEmpty]: Start isEmpty. Operand has 23 states, 16 states have (on average 1.375) internal successors, (22), 17 states have internal predecessors, (22), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-08 05:42:06,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-03-08 05:42:06,911 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:42:06,912 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:42:06,912 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:42:06,915 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:42:06,915 INFO L85 PathProgramCache]: Analyzing trace with hash -640999361, now seen corresponding path program 1 times [2025-03-08 05:42:06,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:42:06,920 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1638351000] [2025-03-08 05:42:06,921 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:42:06,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:42:06,963 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-08 05:42:06,980 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-08 05:42:06,981 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:42:06,981 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:42:07,159 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 05:42:07,159 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:42:07,159 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1638351000] [2025-03-08 05:42:07,160 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1638351000] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:42:07,160 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:42:07,160 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 05:42:07,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1713787014] [2025-03-08 05:42:07,161 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:42:07,164 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 05:42:07,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:42:07,176 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 05:42:07,176 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-08 05:42:07,178 INFO L87 Difference]: Start difference. First operand has 23 states, 16 states have (on average 1.375) internal successors, (22), 17 states have internal predecessors, (22), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 7 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 6 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-08 05:42:07,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:42:07,315 INFO L93 Difference]: Finished difference Result 34 states and 47 transitions. [2025-03-08 05:42:07,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 05:42:07,317 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 6 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2025-03-08 05:42:07,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:42:07,322 INFO L225 Difference]: With dead ends: 34 [2025-03-08 05:42:07,323 INFO L226 Difference]: Without dead ends: 24 [2025-03-08 05:42:07,325 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-03-08 05:42:07,328 INFO L435 NwaCegarLoop]: 20 mSDtfsCounter, 7 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 05:42:07,329 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 90 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 05:42:07,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2025-03-08 05:42:07,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 22. [2025-03-08 05:42:07,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 16 states have internal predecessors, (17), 4 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2025-03-08 05:42:07,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 28 transitions. [2025-03-08 05:42:07,359 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 28 transitions. Word has length 12 [2025-03-08 05:42:07,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:42:07,359 INFO L471 AbstractCegarLoop]: Abstraction has 22 states and 28 transitions. [2025-03-08 05:42:07,359 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 6 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-08 05:42:07,359 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 28 transitions. [2025-03-08 05:42:07,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-03-08 05:42:07,360 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:42:07,360 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:42:07,361 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 05:42:07,361 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:42:07,361 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:42:07,361 INFO L85 PathProgramCache]: Analyzing trace with hash -1861650847, now seen corresponding path program 1 times [2025-03-08 05:42:07,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:42:07,361 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [125722620] [2025-03-08 05:42:07,361 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:42:07,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:42:07,367 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-08 05:42:07,377 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-08 05:42:07,377 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:42:07,377 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:42:07,514 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-08 05:42:07,515 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:42:07,515 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [125722620] [2025-03-08 05:42:07,515 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [125722620] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:42:07,515 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:42:07,515 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 05:42:07,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1247924564] [2025-03-08 05:42:07,515 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:42:07,516 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 05:42:07,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:42:07,516 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 05:42:07,516 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-08 05:42:07,516 INFO L87 Difference]: Start difference. First operand 22 states and 28 transitions. Second operand has 8 states, 8 states have (on average 1.875) internal successors, (15), 6 states have internal predecessors, (15), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-08 05:42:07,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:42:07,620 INFO L93 Difference]: Finished difference Result 31 states and 42 transitions. [2025-03-08 05:42:07,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 05:42:07,628 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.875) internal successors, (15), 6 states have internal predecessors, (15), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 19 [2025-03-08 05:42:07,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:42:07,629 INFO L225 Difference]: With dead ends: 31 [2025-03-08 05:42:07,630 INFO L226 Difference]: Without dead ends: 27 [2025-03-08 05:42:07,630 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-03-08 05:42:07,630 INFO L435 NwaCegarLoop]: 21 mSDtfsCounter, 5 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 05:42:07,631 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 90 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 05:42:07,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2025-03-08 05:42:07,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 23. [2025-03-08 05:42:07,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 16 states have (on average 1.125) internal successors, (18), 16 states have internal predecessors, (18), 4 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (7), 5 states have call predecessors, (7), 4 states have call successors, (7) [2025-03-08 05:42:07,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 29 transitions. [2025-03-08 05:42:07,635 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 29 transitions. Word has length 19 [2025-03-08 05:42:07,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:42:07,636 INFO L471 AbstractCegarLoop]: Abstraction has 23 states and 29 transitions. [2025-03-08 05:42:07,636 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.875) internal successors, (15), 6 states have internal predecessors, (15), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-08 05:42:07,636 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 29 transitions. [2025-03-08 05:42:07,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-03-08 05:42:07,636 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:42:07,637 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:42:07,637 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 05:42:07,637 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:42:07,637 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:42:07,637 INFO L85 PathProgramCache]: Analyzing trace with hash 694869136, now seen corresponding path program 1 times [2025-03-08 05:42:07,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:42:07,637 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [863300306] [2025-03-08 05:42:07,637 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:42:07,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:42:07,644 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-08 05:42:07,655 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-08 05:42:07,658 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:42:07,658 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:42:07,745 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-08 05:42:07,746 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:42:07,746 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [863300306] [2025-03-08 05:42:07,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [863300306] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:42:07,746 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [536867496] [2025-03-08 05:42:07,746 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:42:07,746 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:42:07,746 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:42:07,748 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 05:42:07,749 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-08 05:42:07,774 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-08 05:42:07,790 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-08 05:42:07,790 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:42:07,790 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:42:07,791 INFO L256 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-08 05:42:07,797 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:42:07,827 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-08 05:42:07,827 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 05:42:07,967 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-08 05:42:07,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [536867496] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 05:42:07,967 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 05:42:07,967 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 9 [2025-03-08 05:42:07,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1662676422] [2025-03-08 05:42:07,967 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 05:42:07,968 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 05:42:07,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:42:07,968 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 05:42:07,968 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-03-08 05:42:07,968 INFO L87 Difference]: Start difference. First operand 23 states and 29 transitions. Second operand has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 2 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-08 05:42:08,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:42:08,060 INFO L93 Difference]: Finished difference Result 50 states and 78 transitions. [2025-03-08 05:42:08,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 05:42:08,061 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 2 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 25 [2025-03-08 05:42:08,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:42:08,062 INFO L225 Difference]: With dead ends: 50 [2025-03-08 05:42:08,062 INFO L226 Difference]: Without dead ends: 25 [2025-03-08 05:42:08,062 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 47 SyntacticMatches, 3 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2025-03-08 05:42:08,063 INFO L435 NwaCegarLoop]: 23 mSDtfsCounter, 28 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 05:42:08,063 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 85 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 05:42:08,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2025-03-08 05:42:08,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2025-03-08 05:42:08,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 17 states have (on average 1.1176470588235294) internal successors, (19), 18 states have internal predecessors, (19), 4 states have call successors, (4), 1 states have call predecessors, (4), 3 states have return successors, (9), 5 states have call predecessors, (9), 4 states have call successors, (9) [2025-03-08 05:42:08,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 32 transitions. [2025-03-08 05:42:08,072 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 32 transitions. Word has length 25 [2025-03-08 05:42:08,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:42:08,072 INFO L471 AbstractCegarLoop]: Abstraction has 25 states and 32 transitions. [2025-03-08 05:42:08,073 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 2 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-08 05:42:08,073 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 32 transitions. [2025-03-08 05:42:08,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2025-03-08 05:42:08,074 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:42:08,074 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:42:08,082 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-08 05:42:08,274 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:42:08,275 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:42:08,276 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:42:08,276 INFO L85 PathProgramCache]: Analyzing trace with hash -797381026, now seen corresponding path program 1 times [2025-03-08 05:42:08,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:42:08,276 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [954191865] [2025-03-08 05:42:08,276 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:42:08,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:42:08,283 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-03-08 05:42:08,294 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-03-08 05:42:08,294 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:42:08,294 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:42:08,473 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 12 proven. 5 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-08 05:42:08,474 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:42:08,474 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [954191865] [2025-03-08 05:42:08,475 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [954191865] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:42:08,475 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [290284314] [2025-03-08 05:42:08,475 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:42:08,475 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:42:08,475 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:42:08,477 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 05:42:08,478 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-08 05:42:08,501 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-03-08 05:42:08,513 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-03-08 05:42:08,513 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:42:08,513 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:42:08,514 INFO L256 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-08 05:42:08,515 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:42:08,580 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 6 proven. 8 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-03-08 05:42:08,581 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 05:42:09,049 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 15 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-08 05:42:09,049 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [290284314] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 05:42:09,049 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 05:42:09,049 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11, 13] total 24 [2025-03-08 05:42:09,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1349281635] [2025-03-08 05:42:09,050 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 05:42:09,050 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-03-08 05:42:09,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:42:09,051 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-03-08 05:42:09,051 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=478, Unknown=0, NotChecked=0, Total=552 [2025-03-08 05:42:09,051 INFO L87 Difference]: Start difference. First operand 25 states and 32 transitions. Second operand has 24 states, 24 states have (on average 1.4583333333333333) internal successors, (35), 18 states have internal predecessors, (35), 3 states have call successors, (5), 1 states have call predecessors, (5), 8 states have return successors, (9), 8 states have call predecessors, (9), 3 states have call successors, (9) [2025-03-08 05:42:09,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:42:09,910 INFO L93 Difference]: Finished difference Result 74 states and 144 transitions. [2025-03-08 05:42:09,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2025-03-08 05:42:09,910 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 1.4583333333333333) internal successors, (35), 18 states have internal predecessors, (35), 3 states have call successors, (5), 1 states have call predecessors, (5), 8 states have return successors, (9), 8 states have call predecessors, (9), 3 states have call successors, (9) Word has length 32 [2025-03-08 05:42:09,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:42:09,913 INFO L225 Difference]: With dead ends: 74 [2025-03-08 05:42:09,913 INFO L226 Difference]: Without dead ends: 68 [2025-03-08 05:42:09,914 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 380 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=385, Invalid=1967, Unknown=0, NotChecked=0, Total=2352 [2025-03-08 05:42:09,914 INFO L435 NwaCegarLoop]: 20 mSDtfsCounter, 37 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 691 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 190 SdHoareTripleChecker+Invalid, 763 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 691 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 05:42:09,915 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 190 Invalid, 763 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 691 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 05:42:09,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2025-03-08 05:42:09,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 38. [2025-03-08 05:42:09,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 25 states have (on average 1.08) internal successors, (27), 26 states have internal predecessors, (27), 6 states have call successors, (6), 1 states have call predecessors, (6), 6 states have return successors, (31), 10 states have call predecessors, (31), 6 states have call successors, (31) [2025-03-08 05:42:09,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 64 transitions. [2025-03-08 05:42:09,940 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 64 transitions. Word has length 32 [2025-03-08 05:42:09,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:42:09,940 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 64 transitions. [2025-03-08 05:42:09,940 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 1.4583333333333333) internal successors, (35), 18 states have internal predecessors, (35), 3 states have call successors, (5), 1 states have call predecessors, (5), 8 states have return successors, (9), 8 states have call predecessors, (9), 3 states have call successors, (9) [2025-03-08 05:42:09,941 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 64 transitions. [2025-03-08 05:42:09,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2025-03-08 05:42:09,943 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:42:09,943 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 4, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:42:09,950 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-08 05:42:10,144 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2025-03-08 05:42:10,144 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:42:10,144 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:42:10,144 INFO L85 PathProgramCache]: Analyzing trace with hash -183658884, now seen corresponding path program 2 times [2025-03-08 05:42:10,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:42:10,144 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1196387892] [2025-03-08 05:42:10,144 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 05:42:10,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:42:10,149 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 46 statements into 2 equivalence classes. [2025-03-08 05:42:10,159 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 46 of 46 statements. [2025-03-08 05:42:10,159 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 05:42:10,159 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:42:10,295 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 35 proven. 10 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-03-08 05:42:10,295 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:42:10,296 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1196387892] [2025-03-08 05:42:10,296 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1196387892] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:42:10,296 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1090101486] [2025-03-08 05:42:10,296 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 05:42:10,296 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:42:10,296 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:42:10,299 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 05:42:10,301 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-08 05:42:10,330 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 46 statements into 2 equivalence classes. [2025-03-08 05:42:10,345 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 46 of 46 statements. [2025-03-08 05:42:10,345 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 05:42:10,345 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:42:10,346 INFO L256 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-08 05:42:10,347 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:42:10,373 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 31 proven. 13 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-03-08 05:42:10,376 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 05:42:10,670 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 36 proven. 9 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-03-08 05:42:10,670 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1090101486] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 05:42:10,670 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 05:42:10,670 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 9] total 16 [2025-03-08 05:42:10,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [976201449] [2025-03-08 05:42:10,670 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 05:42:10,671 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-08 05:42:10,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:42:10,671 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-08 05:42:10,671 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=194, Unknown=0, NotChecked=0, Total=240 [2025-03-08 05:42:10,671 INFO L87 Difference]: Start difference. First operand 38 states and 64 transitions. Second operand has 16 states, 16 states have (on average 2.375) internal successors, (38), 14 states have internal predecessors, (38), 4 states have call successors, (6), 1 states have call predecessors, (6), 8 states have return successors, (10), 6 states have call predecessors, (10), 4 states have call successors, (10) [2025-03-08 05:42:10,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:42:10,933 INFO L93 Difference]: Finished difference Result 108 states and 312 transitions. [2025-03-08 05:42:10,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-08 05:42:10,934 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.375) internal successors, (38), 14 states have internal predecessors, (38), 4 states have call successors, (6), 1 states have call predecessors, (6), 8 states have return successors, (10), 6 states have call predecessors, (10), 4 states have call successors, (10) Word has length 46 [2025-03-08 05:42:10,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:42:10,936 INFO L225 Difference]: With dead ends: 108 [2025-03-08 05:42:10,936 INFO L226 Difference]: Without dead ends: 75 [2025-03-08 05:42:10,937 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 87 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=112, Invalid=394, Unknown=0, NotChecked=0, Total=506 [2025-03-08 05:42:10,939 INFO L435 NwaCegarLoop]: 24 mSDtfsCounter, 19 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 288 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 322 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 288 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 05:42:10,939 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 133 Invalid, 322 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 288 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 05:42:10,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2025-03-08 05:42:10,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 45. [2025-03-08 05:42:10,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 29 states have (on average 1.0689655172413792) internal successors, (31), 31 states have internal predecessors, (31), 7 states have call successors, (7), 1 states have call predecessors, (7), 8 states have return successors, (42), 12 states have call predecessors, (42), 7 states have call successors, (42) [2025-03-08 05:42:10,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 80 transitions. [2025-03-08 05:42:10,953 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 80 transitions. Word has length 46 [2025-03-08 05:42:10,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:42:10,953 INFO L471 AbstractCegarLoop]: Abstraction has 45 states and 80 transitions. [2025-03-08 05:42:10,953 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.375) internal successors, (38), 14 states have internal predecessors, (38), 4 states have call successors, (6), 1 states have call predecessors, (6), 8 states have return successors, (10), 6 states have call predecessors, (10), 4 states have call successors, (10) [2025-03-08 05:42:10,953 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 80 transitions. [2025-03-08 05:42:10,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2025-03-08 05:42:10,955 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:42:10,955 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 5, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:42:10,961 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-08 05:42:11,159 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:42:11,159 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:42:11,159 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:42:11,160 INFO L85 PathProgramCache]: Analyzing trace with hash 946798373, now seen corresponding path program 3 times [2025-03-08 05:42:11,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:42:11,160 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [36594713] [2025-03-08 05:42:11,160 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-08 05:42:11,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:42:11,171 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 59 statements into 6 equivalence classes. [2025-03-08 05:42:11,185 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 39 of 59 statements. [2025-03-08 05:42:11,185 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-03-08 05:42:11,185 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:42:11,329 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2025-03-08 05:42:11,330 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:42:11,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [36594713] [2025-03-08 05:42:11,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [36594713] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:42:11,330 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:42:11,330 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-08 05:42:11,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [914827865] [2025-03-08 05:42:11,330 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:42:11,331 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 05:42:11,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:42:11,331 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 05:42:11,332 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-03-08 05:42:11,332 INFO L87 Difference]: Start difference. First operand 45 states and 80 transitions. Second operand has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 6 states have internal predecessors, (22), 1 states have call successors, (4), 1 states have call predecessors, (4), 3 states have return successors, (7), 4 states have call predecessors, (7), 1 states have call successors, (7) [2025-03-08 05:42:11,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:42:11,445 INFO L93 Difference]: Finished difference Result 61 states and 114 transitions. [2025-03-08 05:42:11,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-08 05:42:11,445 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 6 states have internal predecessors, (22), 1 states have call successors, (4), 1 states have call predecessors, (4), 3 states have return successors, (7), 4 states have call predecessors, (7), 1 states have call successors, (7) Word has length 59 [2025-03-08 05:42:11,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:42:11,446 INFO L225 Difference]: With dead ends: 61 [2025-03-08 05:42:11,447 INFO L226 Difference]: Without dead ends: 57 [2025-03-08 05:42:11,447 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2025-03-08 05:42:11,447 INFO L435 NwaCegarLoop]: 21 mSDtfsCounter, 5 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 05:42:11,448 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 108 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 05:42:11,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2025-03-08 05:42:11,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2025-03-08 05:42:11,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 37 states have (on average 1.054054054054054) internal successors, (39), 39 states have internal predecessors, (39), 7 states have call successors, (7), 1 states have call predecessors, (7), 12 states have return successors, (62), 16 states have call predecessors, (62), 7 states have call successors, (62) [2025-03-08 05:42:11,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 108 transitions. [2025-03-08 05:42:11,464 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 108 transitions. Word has length 59 [2025-03-08 05:42:11,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:42:11,465 INFO L471 AbstractCegarLoop]: Abstraction has 57 states and 108 transitions. [2025-03-08 05:42:11,465 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 6 states have internal predecessors, (22), 1 states have call successors, (4), 1 states have call predecessors, (4), 3 states have return successors, (7), 4 states have call predecessors, (7), 1 states have call successors, (7) [2025-03-08 05:42:11,466 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 108 transitions. [2025-03-08 05:42:11,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-03-08 05:42:11,468 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:42:11,468 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 7, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:42:11,468 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 05:42:11,468 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:42:11,469 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:42:11,469 INFO L85 PathProgramCache]: Analyzing trace with hash -2134316058, now seen corresponding path program 4 times [2025-03-08 05:42:11,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:42:11,469 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [943193209] [2025-03-08 05:42:11,469 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-08 05:42:11,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:42:11,479 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 79 statements into 2 equivalence classes. [2025-03-08 05:42:11,486 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 64 of 79 statements. [2025-03-08 05:42:11,486 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-08 05:42:11,486 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:42:11,545 INFO L134 CoverageAnalysis]: Checked inductivity of 265 backedges. 60 proven. 63 refuted. 0 times theorem prover too weak. 142 trivial. 0 not checked. [2025-03-08 05:42:11,545 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:42:11,545 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [943193209] [2025-03-08 05:42:11,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [943193209] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:42:11,545 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1740827258] [2025-03-08 05:42:11,545 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-08 05:42:11,545 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:42:11,546 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:42:11,551 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 05:42:11,552 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-08 05:42:11,589 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 79 statements into 2 equivalence classes. [2025-03-08 05:42:11,605 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 64 of 79 statements. [2025-03-08 05:42:11,606 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-08 05:42:11,606 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:42:11,607 INFO L256 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-08 05:42:11,608 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:42:11,653 INFO L134 CoverageAnalysis]: Checked inductivity of 265 backedges. 60 proven. 63 refuted. 0 times theorem prover too weak. 142 trivial. 0 not checked. [2025-03-08 05:42:11,653 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 05:42:11,950 INFO L134 CoverageAnalysis]: Checked inductivity of 265 backedges. 60 proven. 70 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2025-03-08 05:42:11,951 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1740827258] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 05:42:11,951 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 05:42:11,951 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 8] total 9 [2025-03-08 05:42:11,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1439017897] [2025-03-08 05:42:11,951 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 05:42:11,951 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 05:42:11,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:42:11,952 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 05:42:11,952 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2025-03-08 05:42:11,952 INFO L87 Difference]: Start difference. First operand 57 states and 108 transitions. Second operand has 9 states, 9 states have (on average 4.333333333333333) internal successors, (39), 9 states have internal predecessors, (39), 7 states have call successors, (10), 1 states have call predecessors, (10), 5 states have return successors, (12), 5 states have call predecessors, (12), 7 states have call successors, (12) [2025-03-08 05:42:12,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:42:12,025 INFO L93 Difference]: Finished difference Result 155 states and 451 transitions. [2025-03-08 05:42:12,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 05:42:12,026 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.333333333333333) internal successors, (39), 9 states have internal predecessors, (39), 7 states have call successors, (10), 1 states have call predecessors, (10), 5 states have return successors, (12), 5 states have call predecessors, (12), 7 states have call successors, (12) Word has length 79 [2025-03-08 05:42:12,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:42:12,028 INFO L225 Difference]: With dead ends: 155 [2025-03-08 05:42:12,028 INFO L226 Difference]: Without dead ends: 84 [2025-03-08 05:42:12,029 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 154 SyntacticMatches, 3 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2025-03-08 05:42:12,029 INFO L435 NwaCegarLoop]: 29 mSDtfsCounter, 14 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 05:42:12,029 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 85 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 05:42:12,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2025-03-08 05:42:12,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2025-03-08 05:42:12,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 54 states have (on average 1.0555555555555556) internal successors, (57), 57 states have internal predecessors, (57), 11 states have call successors, (11), 2 states have call predecessors, (11), 18 states have return successors, (145), 24 states have call predecessors, (145), 11 states have call successors, (145) [2025-03-08 05:42:12,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 213 transitions. [2025-03-08 05:42:12,047 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 213 transitions. Word has length 79 [2025-03-08 05:42:12,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:42:12,047 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 213 transitions. [2025-03-08 05:42:12,048 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.333333333333333) internal successors, (39), 9 states have internal predecessors, (39), 7 states have call successors, (10), 1 states have call predecessors, (10), 5 states have return successors, (12), 5 states have call predecessors, (12), 7 states have call successors, (12) [2025-03-08 05:42:12,048 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 213 transitions. [2025-03-08 05:42:12,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2025-03-08 05:42:12,049 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:42:12,049 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 8, 5, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:42:12,055 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-08 05:42:12,250 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:42:12,250 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:42:12,250 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:42:12,250 INFO L85 PathProgramCache]: Analyzing trace with hash -1587964900, now seen corresponding path program 5 times [2025-03-08 05:42:12,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:42:12,250 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2078264041] [2025-03-08 05:42:12,250 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-08 05:42:12,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:42:12,260 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 86 statements into 10 equivalence classes. [2025-03-08 05:42:12,269 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) and asserted 48 of 86 statements. [2025-03-08 05:42:12,269 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2025-03-08 05:42:12,269 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:42:12,472 INFO L134 CoverageAnalysis]: Checked inductivity of 324 backedges. 90 proven. 102 refuted. 0 times theorem prover too weak. 132 trivial. 0 not checked. [2025-03-08 05:42:12,473 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:42:12,473 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2078264041] [2025-03-08 05:42:12,473 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2078264041] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:42:12,473 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [69478376] [2025-03-08 05:42:12,473 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-08 05:42:12,473 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:42:12,473 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:42:12,475 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 05:42:12,477 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-08 05:42:12,507 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 86 statements into 10 equivalence classes. [2025-03-08 05:42:12,520 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) and asserted 48 of 86 statements. [2025-03-08 05:42:12,520 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2025-03-08 05:42:12,520 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:42:12,521 INFO L256 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-03-08 05:42:12,523 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:42:12,580 INFO L134 CoverageAnalysis]: Checked inductivity of 324 backedges. 85 proven. 86 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2025-03-08 05:42:12,581 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 05:42:13,835 INFO L134 CoverageAnalysis]: Checked inductivity of 324 backedges. 101 proven. 75 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2025-03-08 05:42:13,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [69478376] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 05:42:13,835 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 05:42:13,835 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 12, 15] total 31 [2025-03-08 05:42:13,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [844670751] [2025-03-08 05:42:13,835 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 05:42:13,836 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2025-03-08 05:42:13,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:42:13,836 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2025-03-08 05:42:13,837 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=808, Unknown=0, NotChecked=0, Total=930 [2025-03-08 05:42:13,837 INFO L87 Difference]: Start difference. First operand 84 states and 213 transitions. Second operand has 31 states, 31 states have (on average 1.935483870967742) internal successors, (60), 24 states have internal predecessors, (60), 8 states have call successors, (11), 1 states have call predecessors, (11), 13 states have return successors, (23), 16 states have call predecessors, (23), 8 states have call successors, (23) [2025-03-08 05:42:14,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:42:14,203 INFO L93 Difference]: Finished difference Result 129 states and 415 transitions. [2025-03-08 05:42:14,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-03-08 05:42:14,203 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 1.935483870967742) internal successors, (60), 24 states have internal predecessors, (60), 8 states have call successors, (11), 1 states have call predecessors, (11), 13 states have return successors, (23), 16 states have call predecessors, (23), 8 states have call successors, (23) Word has length 86 [2025-03-08 05:42:14,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:42:14,204 INFO L225 Difference]: With dead ends: 129 [2025-03-08 05:42:14,204 INFO L226 Difference]: Without dead ends: 0 [2025-03-08 05:42:14,206 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 158 SyntacticMatches, 1 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 466 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=409, Invalid=1753, Unknown=0, NotChecked=0, Total=2162 [2025-03-08 05:42:14,207 INFO L435 NwaCegarLoop]: 19 mSDtfsCounter, 19 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 402 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 454 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 402 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 05:42:14,207 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 151 Invalid, 454 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 402 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 05:42:14,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-08 05:42:14,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-08 05:42:14,207 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-03-08 05:42:14,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-08 05:42:14,208 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 86 [2025-03-08 05:42:14,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:42:14,208 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-08 05:42:14,208 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 1.935483870967742) internal successors, (60), 24 states have internal predecessors, (60), 8 states have call successors, (11), 1 states have call predecessors, (11), 13 states have return successors, (23), 16 states have call predecessors, (23), 8 states have call successors, (23) [2025-03-08 05:42:14,208 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-08 05:42:14,208 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-08 05:42:14,210 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-08 05:42:14,217 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-08 05:42:14,416 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:42:14,418 INFO L422 BasicCegarLoop]: Path program histogram: [5, 1, 1, 1] [2025-03-08 05:42:14,420 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-03-08 05:42:15,291 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-08 05:42:15,295 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.03 05:42:15 BoogieIcfgContainer [2025-03-08 05:42:15,295 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-08 05:42:15,296 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-08 05:42:15,296 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-08 05:42:15,296 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-08 05:42:15,297 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 05:42:06" (3/4) ... [2025-03-08 05:42:15,298 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-08 05:42:15,302 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure ackermann [2025-03-08 05:42:15,306 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2025-03-08 05:42:15,306 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2025-03-08 05:42:15,306 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-08 05:42:15,307 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-08 05:42:15,361 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-08 05:42:15,361 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-08 05:42:15,361 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-08 05:42:15,362 INFO L158 Benchmark]: Toolchain (without parser) took 8878.32ms. Allocated memory was 142.6MB in the beginning and 327.2MB in the end (delta: 184.5MB). Free memory was 104.9MB in the beginning and 281.8MB in the end (delta: -176.9MB). Peak memory consumption was 5.1MB. Max. memory is 16.1GB. [2025-03-08 05:42:15,362 INFO L158 Benchmark]: CDTParser took 0.30ms. Allocated memory is still 201.3MB. Free memory is still 126.4MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 05:42:15,362 INFO L158 Benchmark]: CACSL2BoogieTranslator took 124.78ms. Allocated memory is still 142.6MB. Free memory was 104.9MB in the beginning and 94.2MB in the end (delta: 10.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 05:42:15,362 INFO L158 Benchmark]: Boogie Procedure Inliner took 19.38ms. Allocated memory is still 142.6MB. Free memory was 94.2MB in the beginning and 93.0MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 05:42:15,362 INFO L158 Benchmark]: Boogie Preprocessor took 22.54ms. Allocated memory is still 142.6MB. Free memory was 93.0MB in the beginning and 91.8MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 05:42:15,362 INFO L158 Benchmark]: IcfgBuilder took 183.40ms. Allocated memory is still 142.6MB. Free memory was 91.8MB in the beginning and 81.0MB in the end (delta: 10.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 05:42:15,363 INFO L158 Benchmark]: TraceAbstraction took 8457.48ms. Allocated memory was 142.6MB in the beginning and 327.2MB in the end (delta: 184.5MB). Free memory was 81.0MB in the beginning and 285.5MB in the end (delta: -204.5MB). Peak memory consumption was 164.9MB. Max. memory is 16.1GB. [2025-03-08 05:42:15,363 INFO L158 Benchmark]: Witness Printer took 65.53ms. Allocated memory is still 327.2MB. Free memory was 285.5MB in the beginning and 281.8MB in the end (delta: 3.7MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 05:42:15,364 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.30ms. Allocated memory is still 201.3MB. Free memory is still 126.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 124.78ms. Allocated memory is still 142.6MB. Free memory was 104.9MB in the beginning and 94.2MB in the end (delta: 10.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 19.38ms. Allocated memory is still 142.6MB. Free memory was 94.2MB in the beginning and 93.0MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 22.54ms. Allocated memory is still 142.6MB. Free memory was 93.0MB in the beginning and 91.8MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 183.40ms. Allocated memory is still 142.6MB. Free memory was 91.8MB in the beginning and 81.0MB in the end (delta: 10.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 8457.48ms. Allocated memory was 142.6MB in the beginning and 327.2MB in the end (delta: 184.5MB). Free memory was 81.0MB in the beginning and 285.5MB in the end (delta: -204.5MB). Peak memory consumption was 164.9MB. Max. memory is 16.1GB. * Witness Printer took 65.53ms. Allocated memory is still 327.2MB. Free memory was 285.5MB in the beginning and 281.8MB in the end (delta: 3.7MB). There was no memory consumed. Max. memory is 16.1GB. * 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: 46]: 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 CFG has 2 procedures, 23 locations, 34 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 7.5s, OverallIterations: 8, TraceHistogramMax: 12, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 2.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 160 SdHoareTripleChecker+Valid, 1.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 134 mSDsluCounter, 932 SdHoareTripleChecker+Invalid, 0.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 755 mSDsCounter, 192 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1864 IncrementalHoareTripleChecker+Invalid, 2056 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 192 mSolverCounterUnsat, 177 mSDtfsCounter, 1864 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 677 GetRequests, 511 SyntacticMatches, 8 SemanticMatches, 158 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 930 ImplicationChecksByTransitivity, 1.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=84occurred in iteration=7, InterpolantAutomatonStates: 108, 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, 8 MinimizatonAttempts, 66 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 3.8s InterpolantComputationTime, 626 NumberOfCodeBlocks, 500 NumberOfCodeBlocksAsserted, 28 NumberOfCheckSat, 876 ConstructedInterpolants, 0 QuantifiedInterpolants, 1733 SizeOfPredicates, 4 NumberOfNonLiveVariables, 682 ConjunctsInSsa, 53 ConjunctsInUnsatCore, 18 InterpolantComputations, 3 PerfectInterpolantSequences, 1715/2230 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-03-08 05:42:15,380 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE