./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_rand_add_18_good.i --full-output --architecture 64bit -------------------------------------------------------------------------------- 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/Juliet_Test/CWE190_Integer_Overflow__int_rand_add_18_good.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-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 64bit --witnessprinter.graph.data.programhash 00d97b32796b54e240f5e1c9f04d2ff3241d4d6d6eef881ae1770375ee5062f5 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-09 04:40:17,822 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-09 04:40:17,865 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2025-03-09 04:40:17,868 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-09 04:40:17,868 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-09 04:40:17,883 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-09 04:40:17,883 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-09 04:40:17,884 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-09 04:40:17,884 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-09 04:40:17,884 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-09 04:40:17,884 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-09 04:40:17,884 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-09 04:40:17,884 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-09 04:40:17,885 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-09 04:40:17,885 INFO L153 SettingsManager]: * Use SBE=true [2025-03-09 04:40:17,885 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-09 04:40:17,885 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-09 04:40:17,886 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-09 04:40:17,886 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-09 04:40:17,886 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-09 04:40:17,886 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-09 04:40:17,886 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-09 04:40:17,886 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-09 04:40:17,887 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-09 04:40:17,887 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-09 04:40:17,887 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-09 04:40:17,887 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-09 04:40:17,887 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-09 04:40:17,887 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-09 04:40:17,887 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-09 04:40:17,887 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-09 04:40:17,887 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 04:40:17,887 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-09 04:40:17,888 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-09 04:40:17,888 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-09 04:40:17,888 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-09 04:40:17,888 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-09 04:40:17,888 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-09 04:40:17,888 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-09 04:40:17,888 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-09 04:40:17,888 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-09 04:40:17,888 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-09 04:40:17,888 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 00d97b32796b54e240f5e1c9f04d2ff3241d4d6d6eef881ae1770375ee5062f5 [2025-03-09 04:40:18,109 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-09 04:40:18,114 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-09 04:40:18,116 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-09 04:40:18,117 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-09 04:40:18,117 INFO L274 PluginConnector]: CDTParser initialized [2025-03-09 04:40:18,118 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_rand_add_18_good.i [2025-03-09 04:40:19,255 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8235e3e00/0f03463c4a94465281d6aac03b79dbd4/FLAG45249636b [2025-03-09 04:40:19,631 INFO L384 CDTParser]: Found 1 translation units. [2025-03-09 04:40:19,631 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_rand_add_18_good.i [2025-03-09 04:40:19,657 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8235e3e00/0f03463c4a94465281d6aac03b79dbd4/FLAG45249636b [2025-03-09 04:40:19,824 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8235e3e00/0f03463c4a94465281d6aac03b79dbd4 [2025-03-09 04:40:19,826 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-09 04:40:19,827 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-09 04:40:19,828 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-09 04:40:19,828 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-09 04:40:19,831 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-09 04:40:19,831 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 04:40:19" (1/1) ... [2025-03-09 04:40:19,832 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@73d0155c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 04:40:19, skipping insertion in model container [2025-03-09 04:40:19,832 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 04:40:19" (1/1) ... [2025-03-09 04:40:19,870 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-09 04:40:20,406 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 04:40:20,412 INFO L200 MainTranslator]: Completed pre-run [2025-03-09 04:40:20,476 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 04:40:20,553 INFO L204 MainTranslator]: Completed translation [2025-03-09 04:40:20,554 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 04:40:20 WrapperNode [2025-03-09 04:40:20,554 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-09 04:40:20,555 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-09 04:40:20,555 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-09 04:40:20,556 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-09 04:40:20,560 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 04:40:20" (1/1) ... [2025-03-09 04:40:20,572 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 04:40:20" (1/1) ... [2025-03-09 04:40:20,591 INFO L138 Inliner]: procedures = 499, calls = 28, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 98 [2025-03-09 04:40:20,591 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-09 04:40:20,592 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-09 04:40:20,592 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-09 04:40:20,592 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-09 04:40:20,598 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 04:40:20" (1/1) ... [2025-03-09 04:40:20,599 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 04:40:20" (1/1) ... [2025-03-09 04:40:20,603 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 04:40:20" (1/1) ... [2025-03-09 04:40:20,613 INFO L175 MemorySlicer]: No memory access in input program. [2025-03-09 04:40:20,613 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 04:40:20" (1/1) ... [2025-03-09 04:40:20,613 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 04:40:20" (1/1) ... [2025-03-09 04:40:20,618 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 04:40:20" (1/1) ... [2025-03-09 04:40:20,619 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 04:40:20" (1/1) ... [2025-03-09 04:40:20,619 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 04:40:20" (1/1) ... [2025-03-09 04:40:20,620 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 04:40:20" (1/1) ... [2025-03-09 04:40:20,621 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-09 04:40:20,622 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-09 04:40:20,622 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-09 04:40:20,622 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-09 04:40:20,623 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 04:40:20" (1/1) ... [2025-03-09 04:40:20,627 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 04:40:20,635 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 04:40:20,647 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 04:40:20,649 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 04:40:20,665 INFO L130 BoogieDeclarations]: Found specification of procedure printIntLine [2025-03-09 04:40:20,665 INFO L138 BoogieDeclarations]: Found implementation of procedure printIntLine [2025-03-09 04:40:20,665 INFO L130 BoogieDeclarations]: Found specification of procedure printLine [2025-03-09 04:40:20,665 INFO L138 BoogieDeclarations]: Found implementation of procedure printLine [2025-03-09 04:40:20,665 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-09 04:40:20,665 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-09 04:40:20,665 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-09 04:40:20,775 INFO L256 CfgBuilder]: Building ICFG [2025-03-09 04:40:20,776 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-09 04:40:20,922 INFO L? ?]: Removed 60 outVars from TransFormulas that were not future-live. [2025-03-09 04:40:20,923 INFO L307 CfgBuilder]: Performing block encoding [2025-03-09 04:40:20,940 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-09 04:40:20,942 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-09 04:40:20,942 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 04:40:20 BoogieIcfgContainer [2025-03-09 04:40:20,942 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-09 04:40:20,944 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-09 04:40:20,944 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-09 04:40:20,947 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-09 04:40:20,947 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.03 04:40:19" (1/3) ... [2025-03-09 04:40:20,947 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@739f1715 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 04:40:20, skipping insertion in model container [2025-03-09 04:40:20,947 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 04:40:20" (2/3) ... [2025-03-09 04:40:20,947 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@739f1715 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 04:40:20, skipping insertion in model container [2025-03-09 04:40:20,948 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 04:40:20" (3/3) ... [2025-03-09 04:40:20,949 INFO L128 eAbstractionObserver]: Analyzing ICFG CWE190_Integer_Overflow__int_rand_add_18_good.i [2025-03-09 04:40:20,958 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-09 04:40:20,959 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG CWE190_Integer_Overflow__int_rand_add_18_good.i that has 3 procedures, 57 locations, 1 initial locations, 0 loop locations, and 4 error locations. [2025-03-09 04:40:21,007 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-09 04:40:21,016 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;@7a7ef863, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-09 04:40:21,016 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-03-09 04:40:21,019 INFO L276 IsEmpty]: Start isEmpty. Operand has 57 states, 45 states have (on average 1.4222222222222223) internal successors, (64), 50 states have internal predecessors, (64), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-09 04:40:21,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-03-09 04:40:21,024 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 04:40:21,025 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 04:40:21,025 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-03-09 04:40:21,029 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 04:40:21,030 INFO L85 PathProgramCache]: Analyzing trace with hash 386454579, now seen corresponding path program 1 times [2025-03-09 04:40:21,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 04:40:21,035 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [93820730] [2025-03-09 04:40:21,035 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 04:40:21,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 04:40:21,112 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-09 04:40:21,140 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-09 04:40:21,141 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 04:40:21,141 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 04:40:21,397 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 04:40:21,398 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 04:40:21,398 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [93820730] [2025-03-09 04:40:21,398 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [93820730] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 04:40:21,398 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 04:40:21,399 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-09 04:40:21,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [832349838] [2025-03-09 04:40:21,400 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 04:40:21,403 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-09 04:40:21,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 04:40:21,415 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-09 04:40:21,416 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-09 04:40:21,418 INFO L87 Difference]: Start difference. First operand has 57 states, 45 states have (on average 1.4222222222222223) internal successors, (64), 50 states have internal predecessors, (64), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand has 6 states, 5 states have (on average 3.0) internal successors, (15), 6 states have internal predecessors, (15), 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-09 04:40:21,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 04:40:21,505 INFO L93 Difference]: Finished difference Result 63 states and 82 transitions. [2025-03-09 04:40:21,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 04:40:21,507 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 6 states have internal predecessors, (15), 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 17 [2025-03-09 04:40:21,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 04:40:21,511 INFO L225 Difference]: With dead ends: 63 [2025-03-09 04:40:21,511 INFO L226 Difference]: Without dead ends: 53 [2025-03-09 04:40:21,515 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-09 04:40:21,517 INFO L435 NwaCegarLoop]: 58 mSDtfsCounter, 4 mSDsluCounter, 221 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 279 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 04:40:21,519 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 279 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 04:40:21,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2025-03-09 04:40:21,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 52. [2025-03-09 04:40:21,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 43 states have (on average 1.441860465116279) internal successors, (62), 47 states have internal predecessors, (62), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-09 04:40:21,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 68 transitions. [2025-03-09 04:40:21,544 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 68 transitions. Word has length 17 [2025-03-09 04:40:21,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 04:40:21,545 INFO L471 AbstractCegarLoop]: Abstraction has 52 states and 68 transitions. [2025-03-09 04:40:21,545 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 6 states have internal predecessors, (15), 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-09 04:40:21,546 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 68 transitions. [2025-03-09 04:40:21,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-03-09 04:40:21,546 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 04:40:21,546 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 04:40:21,547 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-09 04:40:21,547 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-03-09 04:40:21,547 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 04:40:21,548 INFO L85 PathProgramCache]: Analyzing trace with hash -615119872, now seen corresponding path program 1 times [2025-03-09 04:40:21,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 04:40:21,549 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2053654096] [2025-03-09 04:40:21,549 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 04:40:21,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 04:40:21,565 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-09 04:40:21,573 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-09 04:40:21,573 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 04:40:21,573 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 04:40:21,657 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 04:40:21,657 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 04:40:21,657 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2053654096] [2025-03-09 04:40:21,661 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2053654096] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 04:40:21,661 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 04:40:21,661 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 04:40:21,661 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [113958525] [2025-03-09 04:40:21,661 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 04:40:21,662 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 04:40:21,662 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 04:40:21,663 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 04:40:21,663 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 04:40:21,663 INFO L87 Difference]: Start difference. First operand 52 states and 68 transitions. Second operand has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 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-09 04:40:21,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 04:40:21,686 INFO L93 Difference]: Finished difference Result 52 states and 68 transitions. [2025-03-09 04:40:21,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 04:40:21,689 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 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 17 [2025-03-09 04:40:21,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 04:40:21,690 INFO L225 Difference]: With dead ends: 52 [2025-03-09 04:40:21,690 INFO L226 Difference]: Without dead ends: 51 [2025-03-09 04:40:21,690 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 04:40:21,691 INFO L435 NwaCegarLoop]: 53 mSDtfsCounter, 1 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 04:40:21,691 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 104 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 04:40:21,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2025-03-09 04:40:21,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 47. [2025-03-09 04:40:21,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 39 states have (on average 1.435897435897436) internal successors, (56), 42 states have internal predecessors, (56), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-09 04:40:21,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 62 transitions. [2025-03-09 04:40:21,697 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 62 transitions. Word has length 17 [2025-03-09 04:40:21,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 04:40:21,697 INFO L471 AbstractCegarLoop]: Abstraction has 47 states and 62 transitions. [2025-03-09 04:40:21,697 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 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-09 04:40:21,698 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 62 transitions. [2025-03-09 04:40:21,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-03-09 04:40:21,698 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 04:40:21,698 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 04:40:21,698 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-09 04:40:21,698 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-03-09 04:40:21,699 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 04:40:21,700 INFO L85 PathProgramCache]: Analyzing trace with hash -904809945, now seen corresponding path program 1 times [2025-03-09 04:40:21,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 04:40:21,700 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [847943967] [2025-03-09 04:40:21,700 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 04:40:21,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 04:40:21,707 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-09 04:40:21,713 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-09 04:40:21,713 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 04:40:21,713 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 04:40:21,746 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 04:40:21,746 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 04:40:21,746 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [847943967] [2025-03-09 04:40:21,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [847943967] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 04:40:21,746 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 04:40:21,746 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 04:40:21,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2052663867] [2025-03-09 04:40:21,746 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 04:40:21,747 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 04:40:21,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 04:40:21,747 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 04:40:21,747 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 04:40:21,747 INFO L87 Difference]: Start difference. First operand 47 states and 62 transitions. Second operand has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 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-09 04:40:21,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 04:40:21,769 INFO L93 Difference]: Finished difference Result 47 states and 62 transitions. [2025-03-09 04:40:21,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 04:40:21,770 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 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 18 [2025-03-09 04:40:21,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 04:40:21,771 INFO L225 Difference]: With dead ends: 47 [2025-03-09 04:40:21,771 INFO L226 Difference]: Without dead ends: 46 [2025-03-09 04:40:21,771 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 04:40:21,772 INFO L435 NwaCegarLoop]: 55 mSDtfsCounter, 0 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 04:40:21,773 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 106 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 04:40:21,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2025-03-09 04:40:21,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2025-03-09 04:40:21,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 39 states have (on average 1.4102564102564104) internal successors, (55), 41 states have internal predecessors, (55), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-09 04:40:21,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 61 transitions. [2025-03-09 04:40:21,778 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 61 transitions. Word has length 18 [2025-03-09 04:40:21,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 04:40:21,778 INFO L471 AbstractCegarLoop]: Abstraction has 46 states and 61 transitions. [2025-03-09 04:40:21,778 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 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-09 04:40:21,778 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 61 transitions. [2025-03-09 04:40:21,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-03-09 04:40:21,779 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 04:40:21,779 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 04:40:21,779 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-09 04:40:21,779 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-03-09 04:40:21,779 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 04:40:21,779 INFO L85 PathProgramCache]: Analyzing trace with hash -1165903144, now seen corresponding path program 1 times [2025-03-09 04:40:21,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 04:40:21,780 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1834983652] [2025-03-09 04:40:21,780 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 04:40:21,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 04:40:21,792 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-09 04:40:21,802 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-09 04:40:21,802 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 04:40:21,802 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 04:40:21,837 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-09 04:40:21,837 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 04:40:21,837 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1834983652] [2025-03-09 04:40:21,837 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1834983652] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 04:40:21,837 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 04:40:21,837 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 04:40:21,837 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [959551725] [2025-03-09 04:40:21,837 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 04:40:21,838 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 04:40:21,838 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 04:40:21,839 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 04:40:21,839 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 04:40:21,839 INFO L87 Difference]: Start difference. First operand 46 states and 61 transitions. Second operand has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-09 04:40:21,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 04:40:21,857 INFO L93 Difference]: Finished difference Result 46 states and 61 transitions. [2025-03-09 04:40:21,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 04:40:21,857 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 24 [2025-03-09 04:40:21,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 04:40:21,858 INFO L225 Difference]: With dead ends: 46 [2025-03-09 04:40:21,858 INFO L226 Difference]: Without dead ends: 0 [2025-03-09 04:40:21,859 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 04:40:21,859 INFO L435 NwaCegarLoop]: 54 mSDtfsCounter, 1 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 04:40:21,860 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 107 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 04:40:21,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-09 04:40:21,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-09 04:40:21,861 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 04:40:21,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-09 04:40:21,861 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 24 [2025-03-09 04:40:21,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 04:40:21,861 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-09 04:40:21,861 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-09 04:40:21,861 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-09 04:40:21,862 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-09 04:40:21,864 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 4 remaining) [2025-03-09 04:40:21,864 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 4 remaining) [2025-03-09 04:40:21,864 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 4 remaining) [2025-03-09 04:40:21,864 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 4 remaining) [2025-03-09 04:40:21,864 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-09 04:40:21,868 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-03-09 04:40:21,869 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-03-09 04:40:21,882 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-09 04:40:21,888 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.03 04:40:21 BoogieIcfgContainer [2025-03-09 04:40:21,888 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-09 04:40:21,889 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-09 04:40:21,889 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-09 04:40:21,889 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-09 04:40:21,890 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 04:40:20" (3/4) ... [2025-03-09 04:40:21,891 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-09 04:40:21,895 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure printLine [2025-03-09 04:40:21,895 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure printIntLine [2025-03-09 04:40:21,899 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges [2025-03-09 04:40:21,899 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2025-03-09 04:40:21,899 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-09 04:40:21,963 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-09 04:40:21,963 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-09 04:40:21,963 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-09 04:40:21,965 INFO L158 Benchmark]: Toolchain (without parser) took 2137.08ms. Allocated memory is still 201.3MB. Free memory was 155.8MB in the beginning and 95.7MB in the end (delta: 60.1MB). Peak memory consumption was 57.8MB. Max. memory is 16.1GB. [2025-03-09 04:40:21,965 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 201.3MB. Free memory is still 115.5MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-09 04:40:21,966 INFO L158 Benchmark]: CACSL2BoogieTranslator took 726.78ms. Allocated memory is still 201.3MB. Free memory was 155.5MB in the beginning and 96.7MB in the end (delta: 58.8MB). Peak memory consumption was 50.3MB. Max. memory is 16.1GB. [2025-03-09 04:40:21,966 INFO L158 Benchmark]: Boogie Procedure Inliner took 36.24ms. Allocated memory is still 201.3MB. Free memory was 96.7MB in the beginning and 93.8MB in the end (delta: 2.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-09 04:40:21,966 INFO L158 Benchmark]: Boogie Preprocessor took 29.72ms. Allocated memory is still 201.3MB. Free memory was 93.8MB in the beginning and 92.4MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-09 04:40:21,967 INFO L158 Benchmark]: IcfgBuilder took 320.11ms. Allocated memory is still 201.3MB. Free memory was 92.4MB in the beginning and 75.1MB in the end (delta: 17.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-09 04:40:21,967 INFO L158 Benchmark]: TraceAbstraction took 944.52ms. Allocated memory is still 201.3MB. Free memory was 74.6MB in the beginning and 101.8MB in the end (delta: -27.3MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-09 04:40:21,967 INFO L158 Benchmark]: Witness Printer took 74.89ms. Allocated memory is still 201.3MB. Free memory was 101.8MB in the beginning and 95.7MB in the end (delta: 6.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-09 04:40:21,969 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.20ms. Allocated memory is still 201.3MB. Free memory is still 115.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 726.78ms. Allocated memory is still 201.3MB. Free memory was 155.5MB in the beginning and 96.7MB in the end (delta: 58.8MB). Peak memory consumption was 50.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 36.24ms. Allocated memory is still 201.3MB. Free memory was 96.7MB in the beginning and 93.8MB in the end (delta: 2.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 29.72ms. Allocated memory is still 201.3MB. Free memory was 93.8MB in the beginning and 92.4MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 320.11ms. Allocated memory is still 201.3MB. Free memory was 92.4MB in the beginning and 75.1MB in the end (delta: 17.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 944.52ms. Allocated memory is still 201.3MB. Free memory was 74.6MB in the beginning and 101.8MB in the end (delta: -27.3MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 74.89ms. Allocated memory is still 201.3MB. Free memory was 101.8MB in the beginning and 95.7MB in the end (delta: 6.1MB). 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: 1577]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1577]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1559]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1559]: 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 3 procedures, 57 locations, 79 edges, 4 error locations. Started 1 CEGAR loops. OverallTime: 0.9s, OverallIterations: 4, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 6 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 6 mSDsluCounter, 596 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 376 mSDsCounter, 2 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 125 IncrementalHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2 mSolverCounterUnsat, 220 mSDtfsCounter, 125 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=57occurred in iteration=0, InterpolantAutomatonStates: 15, 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, 5 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 76 NumberOfCodeBlocks, 76 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 72 ConstructedInterpolants, 0 QuantifiedInterpolants, 108 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 4 InterpolantComputations, 4 PerfectInterpolantSequences, 4/4 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 04:40:21,983 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