./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/recursive-simple/afterrec_2calls-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows 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-simple/afterrec_2calls-1.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-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 ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 8cf5a35873afe0e5012214bd680ff6c9f10002775e1599934b6c286bf71e0e3d --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-09 02:41:24,714 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-09 02:41:24,762 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-03-09 02:41:24,765 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-09 02:41:24,765 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-09 02:41:24,785 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-09 02:41:24,786 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-09 02:41:24,786 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-09 02:41:24,786 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-09 02:41:24,786 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-09 02:41:24,787 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-09 02:41:24,787 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-09 02:41:24,787 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-09 02:41:24,787 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-09 02:41:24,787 INFO L153 SettingsManager]: * Use SBE=true [2025-03-09 02:41:24,787 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-09 02:41:24,787 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-09 02:41:24,787 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-09 02:41:24,787 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-09 02:41:24,788 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-09 02:41:24,788 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-09 02:41:24,788 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-09 02:41:24,788 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-09 02:41:24,788 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-09 02:41:24,788 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-09 02:41:24,788 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-09 02:41:24,788 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-09 02:41:24,788 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-09 02:41:24,788 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-09 02:41:24,788 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-09 02:41:24,788 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-09 02:41:24,788 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-09 02:41:24,789 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-09 02:41:24,789 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-09 02:41:24,789 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 02:41:24,789 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-09 02:41:24,789 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-09 02:41:24,789 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-09 02:41:24,790 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-09 02:41:24,790 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-09 02:41:24,790 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-09 02:41:24,790 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-09 02:41:24,790 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-09 02:41:24,790 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-09 02:41:24,790 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-09 02:41:24,790 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 ! overflow) ) 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 -> 8cf5a35873afe0e5012214bd680ff6c9f10002775e1599934b6c286bf71e0e3d [2025-03-09 02:41:24,994 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-09 02:41:25,000 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-09 02:41:25,002 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-09 02:41:25,003 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-09 02:41:25,003 INFO L274 PluginConnector]: CDTParser initialized [2025-03-09 02:41:25,006 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/recursive-simple/afterrec_2calls-1.c [2025-03-09 02:41:26,078 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/99158571d/beb1c80d67a04a9cb7332818d82ddef4/FLAGb4f1bc02a [2025-03-09 02:41:26,299 INFO L384 CDTParser]: Found 1 translation units. [2025-03-09 02:41:26,300 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive-simple/afterrec_2calls-1.c [2025-03-09 02:41:26,305 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/99158571d/beb1c80d67a04a9cb7332818d82ddef4/FLAGb4f1bc02a [2025-03-09 02:41:26,642 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/99158571d/beb1c80d67a04a9cb7332818d82ddef4 [2025-03-09 02:41:26,644 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-09 02:41:26,645 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-09 02:41:26,645 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-09 02:41:26,645 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-09 02:41:26,649 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-09 02:41:26,650 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 02:41:26" (1/1) ... [2025-03-09 02:41:26,651 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@23eec47f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:41:26, skipping insertion in model container [2025-03-09 02:41:26,651 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 02:41:26" (1/1) ... [2025-03-09 02:41:26,661 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-09 02:41:26,753 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 02:41:26,762 INFO L200 MainTranslator]: Completed pre-run [2025-03-09 02:41:26,770 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 02:41:26,781 INFO L204 MainTranslator]: Completed translation [2025-03-09 02:41:26,782 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:41:26 WrapperNode [2025-03-09 02:41:26,782 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-09 02:41:26,782 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-09 02:41:26,783 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-09 02:41:26,783 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-09 02:41:26,788 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:41:26" (1/1) ... [2025-03-09 02:41:26,792 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:41:26" (1/1) ... [2025-03-09 02:41:26,802 INFO L138 Inliner]: procedures = 13, calls = 12, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 10 [2025-03-09 02:41:26,802 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-09 02:41:26,803 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-09 02:41:26,803 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-09 02:41:26,803 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-09 02:41:26,809 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:41:26" (1/1) ... [2025-03-09 02:41:26,809 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:41:26" (1/1) ... [2025-03-09 02:41:26,810 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:41:26" (1/1) ... [2025-03-09 02:41:26,818 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-09 02:41:26,819 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:41:26" (1/1) ... [2025-03-09 02:41:26,819 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:41:26" (1/1) ... [2025-03-09 02:41:26,823 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:41:26" (1/1) ... [2025-03-09 02:41:26,824 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:41:26" (1/1) ... [2025-03-09 02:41:26,824 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:41:26" (1/1) ... [2025-03-09 02:41:26,825 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:41:26" (1/1) ... [2025-03-09 02:41:26,826 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-09 02:41:26,827 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-09 02:41:26,827 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-09 02:41:26,828 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-09 02:41:26,829 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:41:26" (1/1) ... [2025-03-09 02:41:26,840 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 02:41:26,849 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:41:26,863 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-09 02:41:26,869 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-09 02:41:26,884 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2025-03-09 02:41:26,884 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2025-03-09 02:41:26,884 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-09 02:41:26,884 INFO L130 BoogieDeclarations]: Found specification of procedure f [2025-03-09 02:41:26,884 INFO L138 BoogieDeclarations]: Found implementation of procedure f [2025-03-09 02:41:26,884 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-09 02:41:26,884 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-09 02:41:26,884 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-09 02:41:26,884 INFO L130 BoogieDeclarations]: Found specification of procedure f2 [2025-03-09 02:41:26,884 INFO L138 BoogieDeclarations]: Found implementation of procedure f2 [2025-03-09 02:41:26,920 INFO L256 CfgBuilder]: Building ICFG [2025-03-09 02:41:26,922 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-09 02:41:26,994 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2025-03-09 02:41:26,994 INFO L307 CfgBuilder]: Performing block encoding [2025-03-09 02:41:26,999 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-09 02:41:26,999 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-09 02:41:26,999 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 02:41:26 BoogieIcfgContainer [2025-03-09 02:41:27,000 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-09 02:41:27,001 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-09 02:41:27,001 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-09 02:41:27,004 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-09 02:41:27,004 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.03 02:41:26" (1/3) ... [2025-03-09 02:41:27,005 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a56611a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 02:41:27, skipping insertion in model container [2025-03-09 02:41:27,005 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:41:26" (2/3) ... [2025-03-09 02:41:27,006 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a56611a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 02:41:27, skipping insertion in model container [2025-03-09 02:41:27,006 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 02:41:26" (3/3) ... [2025-03-09 02:41:27,007 INFO L128 eAbstractionObserver]: Analyzing ICFG afterrec_2calls-1.c [2025-03-09 02:41:27,018 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-09 02:41:27,019 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG afterrec_2calls-1.c that has 4 procedures, 31 locations, 1 initial locations, 0 loop locations, and 4 error locations. [2025-03-09 02:41:27,062 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-09 02:41:27,071 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;@6c912ca7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-09 02:41:27,071 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-03-09 02:41:27,074 INFO L276 IsEmpty]: Start isEmpty. Operand has 31 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 22 states have internal predecessors, (24), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-09 02:41:27,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-03-09 02:41:27,079 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:41:27,079 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-09 02:41:27,080 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting fErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [fErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, f2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, f2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2025-03-09 02:41:27,083 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:41:27,084 INFO L85 PathProgramCache]: Analyzing trace with hash 1419643396, now seen corresponding path program 1 times [2025-03-09 02:41:27,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:41:27,090 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [829600931] [2025-03-09 02:41:27,090 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:41:27,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:41:27,132 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-09 02:41:27,142 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-09 02:41:27,142 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:41:27,142 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:41:27,210 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-09 02:41:27,211 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:41:27,211 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [829600931] [2025-03-09 02:41:27,213 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [829600931] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:41:27,213 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:41:27,213 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 02:41:27,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1627625427] [2025-03-09 02:41:27,215 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:41:27,217 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 02:41:27,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:41:27,234 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 02:41:27,234 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 02:41:27,236 INFO L87 Difference]: Start difference. First operand has 31 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 22 states have internal predecessors, (24), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 02:41:27,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:41:27,262 INFO L93 Difference]: Finished difference Result 41 states and 46 transitions. [2025-03-09 02:41:27,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 02:41:27,266 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2025-03-09 02:41:27,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:41:27,271 INFO L225 Difference]: With dead ends: 41 [2025-03-09 02:41:27,272 INFO L226 Difference]: Without dead ends: 16 [2025-03-09 02:41:27,274 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 02:41:27,277 INFO L435 NwaCegarLoop]: 24 mSDtfsCounter, 1 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 02:41:27,279 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 47 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 02:41:27,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2025-03-09 02:41:27,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2025-03-09 02:41:27,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 10 states have (on average 1.3) internal successors, (13), 13 states have internal predecessors, (13), 3 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 02:41:27,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2025-03-09 02:41:27,307 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 6 [2025-03-09 02:41:27,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:41:27,307 INFO L471 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2025-03-09 02:41:27,308 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 02:41:27,308 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2025-03-09 02:41:27,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-03-09 02:41:27,308 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:41:27,308 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:41:27,309 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-09 02:41:27,309 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting fErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [fErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, f2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, f2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2025-03-09 02:41:27,310 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:41:27,310 INFO L85 PathProgramCache]: Analyzing trace with hash 1059272291, now seen corresponding path program 1 times [2025-03-09 02:41:27,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:41:27,311 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [626732135] [2025-03-09 02:41:27,311 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:41:27,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:41:27,316 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-09 02:41:27,324 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-09 02:41:27,324 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:41:27,324 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:41:27,386 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-09 02:41:27,389 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:41:27,390 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [626732135] [2025-03-09 02:41:27,390 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [626732135] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:41:27,390 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:41:27,390 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-09 02:41:27,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1811600106] [2025-03-09 02:41:27,390 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:41:27,391 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 02:41:27,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:41:27,391 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 02:41:27,391 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-09 02:41:27,391 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand has 5 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 02:41:27,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:41:27,442 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2025-03-09 02:41:27,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 02:41:27,443 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2025-03-09 02:41:27,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:41:27,443 INFO L225 Difference]: With dead ends: 22 [2025-03-09 02:41:27,443 INFO L226 Difference]: Without dead ends: 21 [2025-03-09 02:41:27,444 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-09 02:41:27,444 INFO L435 NwaCegarLoop]: 12 mSDtfsCounter, 4 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 02:41:27,444 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 48 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 02:41:27,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2025-03-09 02:41:27,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 20. [2025-03-09 02:41:27,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 16 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 02:41:27,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 20 transitions. [2025-03-09 02:41:27,447 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 20 transitions. Word has length 7 [2025-03-09 02:41:27,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:41:27,447 INFO L471 AbstractCegarLoop]: Abstraction has 20 states and 20 transitions. [2025-03-09 02:41:27,447 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 02:41:27,447 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2025-03-09 02:41:27,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-03-09 02:41:27,447 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:41:27,448 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:41:27,448 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-09 02:41:27,448 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting f2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [fErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, f2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, f2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2025-03-09 02:41:27,448 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:41:27,448 INFO L85 PathProgramCache]: Analyzing trace with hash -200436102, now seen corresponding path program 1 times [2025-03-09 02:41:27,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:41:27,448 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [747231300] [2025-03-09 02:41:27,448 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:41:27,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:41:27,454 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-09 02:41:27,461 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-09 02:41:27,461 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:41:27,461 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:41:27,489 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-09 02:41:27,489 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:41:27,489 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [747231300] [2025-03-09 02:41:27,489 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [747231300] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:41:27,489 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:41:27,489 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 02:41:27,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [172567177] [2025-03-09 02:41:27,490 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:41:27,490 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 02:41:27,490 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:41:27,490 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 02:41:27,490 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 02:41:27,490 INFO L87 Difference]: Start difference. First operand 20 states and 20 transitions. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 02:41:27,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:41:27,498 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2025-03-09 02:41:27,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 02:41:27,498 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2025-03-09 02:41:27,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:41:27,498 INFO L225 Difference]: With dead ends: 20 [2025-03-09 02:41:27,498 INFO L226 Difference]: Without dead ends: 19 [2025-03-09 02:41:27,499 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 02:41:27,499 INFO L435 NwaCegarLoop]: 12 mSDtfsCounter, 1 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 02:41:27,499 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 23 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 02:41:27,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2025-03-09 02:41:27,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2025-03-09 02:41:27,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 15 states have internal predecessors, (16), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 02:41:27,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2025-03-09 02:41:27,501 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 11 [2025-03-09 02:41:27,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:41:27,502 INFO L471 AbstractCegarLoop]: Abstraction has 19 states and 19 transitions. [2025-03-09 02:41:27,502 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 02:41:27,502 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2025-03-09 02:41:27,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-03-09 02:41:27,502 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:41:27,502 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:41:27,502 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-09 02:41:27,502 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting f2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [fErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, f2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, f2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2025-03-09 02:41:27,503 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:41:27,503 INFO L85 PathProgramCache]: Analyzing trace with hash -1918551873, now seen corresponding path program 1 times [2025-03-09 02:41:27,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:41:27,503 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1027218658] [2025-03-09 02:41:27,503 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:41:27,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:41:27,507 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-09 02:41:27,511 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-09 02:41:27,512 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:41:27,513 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:41:27,640 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-09 02:41:27,640 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:41:27,640 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1027218658] [2025-03-09 02:41:27,641 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1027218658] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:41:27,641 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:41:27,641 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-09 02:41:27,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [426342386] [2025-03-09 02:41:27,641 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:41:27,641 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-09 02:41:27,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:41:27,642 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-09 02:41:27,642 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-03-09 02:41:27,642 INFO L87 Difference]: Start difference. First operand 19 states and 19 transitions. Second operand has 9 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 7 states have internal predecessors, (10), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 02:41:27,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:41:27,723 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2025-03-09 02:41:27,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-09 02:41:27,724 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 7 states have internal predecessors, (10), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2025-03-09 02:41:27,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:41:27,724 INFO L225 Difference]: With dead ends: 19 [2025-03-09 02:41:27,724 INFO L226 Difference]: Without dead ends: 0 [2025-03-09 02:41:27,724 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2025-03-09 02:41:27,725 INFO L435 NwaCegarLoop]: 5 mSDtfsCounter, 8 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 02:41:27,725 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 37 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 02:41:27,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-09 02:41:27,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-09 02:41:27,726 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-09 02:41:27,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-09 02:41:27,726 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 12 [2025-03-09 02:41:27,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:41:27,726 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-09 02:41:27,726 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 7 states have internal predecessors, (10), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 02:41:27,726 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-09 02:41:27,726 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-09 02:41:27,728 INFO L782 garLoopResultBuilder]: Registering result SAFE for location fErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 4 remaining) [2025-03-09 02:41:27,728 INFO L782 garLoopResultBuilder]: Registering result SAFE for location fErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 4 remaining) [2025-03-09 02:41:27,728 INFO L782 garLoopResultBuilder]: Registering result SAFE for location f2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 4 remaining) [2025-03-09 02:41:27,728 INFO L782 garLoopResultBuilder]: Registering result SAFE for location f2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 4 remaining) [2025-03-09 02:41:27,729 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-09 02:41:27,731 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-03-09 02:41:27,732 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-03-09 02:41:27,780 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-09 02:41:27,786 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.03 02:41:27 BoogieIcfgContainer [2025-03-09 02:41:27,789 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-09 02:41:27,790 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-09 02:41:27,790 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-09 02:41:27,791 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-09 02:41:27,794 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 02:41:26" (3/4) ... [2025-03-09 02:41:27,796 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-09 02:41:27,798 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure reach_error [2025-03-09 02:41:27,799 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure f [2025-03-09 02:41:27,799 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure f2 [2025-03-09 02:41:27,801 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2025-03-09 02:41:27,801 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-03-09 02:41:27,801 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2025-03-09 02:41:27,801 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-09 02:41:27,900 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-09 02:41:27,914 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-09 02:41:27,914 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-09 02:41:27,915 INFO L158 Benchmark]: Toolchain (without parser) took 1269.81ms. Allocated memory is still 142.6MB. Free memory was 109.3MB in the beginning and 109.2MB in the end (delta: 110.1kB). Peak memory consumption was 79.7MB. Max. memory is 16.1GB. [2025-03-09 02:41:27,915 INFO L158 Benchmark]: CDTParser took 0.23ms. Allocated memory is still 201.3MB. Free memory is still 126.0MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-09 02:41:27,915 INFO L158 Benchmark]: CACSL2BoogieTranslator took 136.70ms. Allocated memory is still 142.6MB. Free memory was 109.3MB in the beginning and 98.6MB in the end (delta: 10.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-09 02:41:27,915 INFO L158 Benchmark]: Boogie Procedure Inliner took 20.01ms. Allocated memory is still 142.6MB. Free memory was 98.6MB in the beginning and 97.6MB in the end (delta: 958.6kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-09 02:41:27,915 INFO L158 Benchmark]: Boogie Preprocessor took 22.97ms. Allocated memory is still 142.6MB. Free memory was 97.6MB in the beginning and 96.6MB in the end (delta: 1.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-09 02:41:27,915 INFO L158 Benchmark]: IcfgBuilder took 172.63ms. Allocated memory is still 142.6MB. Free memory was 96.6MB in the beginning and 87.1MB in the end (delta: 9.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-09 02:41:27,916 INFO L158 Benchmark]: TraceAbstraction took 788.56ms. Allocated memory is still 142.6MB. Free memory was 86.1MB in the beginning and 43.9MB in the end (delta: 42.2MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. [2025-03-09 02:41:27,916 INFO L158 Benchmark]: Witness Printer took 123.43ms. Allocated memory is still 142.6MB. Free memory was 43.9MB in the beginning and 109.2MB in the end (delta: -65.3MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2025-03-09 02:41:27,917 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.23ms. Allocated memory is still 201.3MB. Free memory is still 126.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 136.70ms. Allocated memory is still 142.6MB. Free memory was 109.3MB in the beginning and 98.6MB in the end (delta: 10.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 20.01ms. Allocated memory is still 142.6MB. Free memory was 98.6MB in the beginning and 97.6MB in the end (delta: 958.6kB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 22.97ms. Allocated memory is still 142.6MB. Free memory was 97.6MB in the beginning and 96.6MB in the end (delta: 1.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 172.63ms. Allocated memory is still 142.6MB. Free memory was 96.6MB in the beginning and 87.1MB in the end (delta: 9.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 788.56ms. Allocated memory is still 142.6MB. Free memory was 86.1MB in the beginning and 43.9MB in the end (delta: 42.2MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. * Witness Printer took 123.43ms. Allocated memory is still 142.6MB. Free memory was 43.9MB in the beginning and 109.2MB in the end (delta: -65.3MB). Peak memory consumption was 12.6MB. 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: 10]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 10]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 17]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 17]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 31 locations, 39 edges, 4 error locations. Started 1 CEGAR loops. OverallTime: 0.7s, OverallIterations: 4, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 14 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 14 mSDsluCounter, 155 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 102 mSDsCounter, 4 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 72 IncrementalHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 4 mSolverCounterUnsat, 53 mSDtfsCounter, 72 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 23 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=31occurred in iteration=0, InterpolantAutomatonStates: 20, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 1 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 36 NumberOfCodeBlocks, 36 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 32 ConstructedInterpolants, 0 QuantifiedInterpolants, 62 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 4 InterpolantComputations, 4 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 4 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-03-09 02:41:27,935 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE