./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/ldv-regression/test23-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/ldv-regression/test23-1.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 4c2b7377d2b430a15e16457512411598a883b6588c528bba211e64f887de4d8e --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 13:37:02,601 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 13:37:02,681 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-02-06 13:37:02,687 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 13:37:02,688 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 13:37:02,712 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 13:37:02,713 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 13:37:02,713 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 13:37:02,713 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 13:37:02,713 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 13:37:02,713 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 13:37:02,713 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 13:37:02,713 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 13:37:02,714 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 13:37:02,714 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 13:37:02,714 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 13:37:02,714 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 13:37:02,714 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 13:37:02,714 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 13:37:02,714 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 13:37:02,714 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 13:37:02,714 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 13:37:02,714 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 13:37:02,716 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 13:37:02,717 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-02-06 13:37:02,717 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-06 13:37:02,717 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 13:37:02,717 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 13:37:02,717 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 13:37:02,717 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 13:37:02,717 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 13:37:02,718 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 13:37:02,718 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 13:37:02,718 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 13:37:02,718 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 13:37:02,719 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 13:37:02,719 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 13:37:02,719 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 13:37:02,719 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 13:37:02,719 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 13:37:02,719 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 13:37:02,719 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 13:37:02,719 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 13:37:02,720 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 13:37:02,720 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 13:37:02,720 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-jdk21/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 -> 4c2b7377d2b430a15e16457512411598a883b6588c528bba211e64f887de4d8e [2025-02-06 13:37:03,069 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 13:37:03,079 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 13:37:03,081 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 13:37:03,083 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 13:37:03,083 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 13:37:03,086 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-regression/test23-1.c [2025-02-06 13:37:05,048 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/1873716be/2be4e57326c748ecabe5b03e3196bd8b/FLAG0fb984497 [2025-02-06 13:37:05,513 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 13:37:05,514 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-regression/test23-1.c [2025-02-06 13:37:05,576 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/1873716be/2be4e57326c748ecabe5b03e3196bd8b/FLAG0fb984497 [2025-02-06 13:37:05,645 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/1873716be/2be4e57326c748ecabe5b03e3196bd8b [2025-02-06 13:37:05,648 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 13:37:05,650 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 13:37:05,652 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 13:37:05,652 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 13:37:05,658 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 13:37:05,659 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 01:37:05" (1/1) ... [2025-02-06 13:37:05,661 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@9490386 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:37:05, skipping insertion in model container [2025-02-06 13:37:05,661 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 01:37:05" (1/1) ... [2025-02-06 13:37:05,680 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 13:37:05,858 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 13:37:05,879 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 13:37:05,911 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 13:37:05,948 INFO L204 MainTranslator]: Completed translation [2025-02-06 13:37:05,949 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:37:05 WrapperNode [2025-02-06 13:37:05,949 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 13:37:05,950 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 13:37:05,950 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 13:37:05,950 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 13:37:05,955 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:37:05" (1/1) ... [2025-02-06 13:37:05,967 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:37:05" (1/1) ... [2025-02-06 13:37:06,013 INFO L138 Inliner]: procedures = 16, calls = 58, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 117 [2025-02-06 13:37:06,017 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 13:37:06,017 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 13:37:06,017 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 13:37:06,018 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 13:37:06,027 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:37:05" (1/1) ... [2025-02-06 13:37:06,028 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:37:05" (1/1) ... [2025-02-06 13:37:06,031 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:37:05" (1/1) ... [2025-02-06 13:37:06,052 INFO L175 MemorySlicer]: Split 46 memory accesses to 2 slices as follows [2, 44]. 96 percent of accesses are in the largest equivalence class. The 38 initializations are split as follows [2, 36]. The 5 writes are split as follows [0, 5]. [2025-02-06 13:37:06,053 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:37:05" (1/1) ... [2025-02-06 13:37:06,053 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:37:05" (1/1) ... [2025-02-06 13:37:06,065 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:37:05" (1/1) ... [2025-02-06 13:37:06,070 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:37:05" (1/1) ... [2025-02-06 13:37:06,075 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:37:05" (1/1) ... [2025-02-06 13:37:06,080 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:37:05" (1/1) ... [2025-02-06 13:37:06,082 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 13:37:06,083 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 13:37:06,086 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 13:37:06,086 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 13:37:06,087 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:37:05" (1/1) ... [2025-02-06 13:37:06,094 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 13:37:06,115 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 13:37:06,155 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-06 13:37:06,158 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-06 13:37:06,181 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 13:37:06,181 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-06 13:37:06,181 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-06 13:37:06,181 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-06 13:37:06,181 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-06 13:37:06,181 INFO L130 BoogieDeclarations]: Found specification of procedure get_dummy [2025-02-06 13:37:06,181 INFO L138 BoogieDeclarations]: Found implementation of procedure get_dummy [2025-02-06 13:37:06,181 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 13:37:06,182 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 13:37:06,182 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-06 13:37:06,182 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-06 13:37:06,311 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 13:37:06,318 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 13:37:06,423 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L25: havoc #t~nondet8; [2025-02-06 13:37:06,676 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L30: havoc check_#t~mem9#1; [2025-02-06 13:37:06,691 INFO L? ?]: Removed 24 outVars from TransFormulas that were not future-live. [2025-02-06 13:37:06,693 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 13:37:06,706 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 13:37:06,707 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 13:37:06,708 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 01:37:06 BoogieIcfgContainer [2025-02-06 13:37:06,708 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 13:37:06,711 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 13:37:06,711 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 13:37:06,716 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 13:37:06,717 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 01:37:05" (1/3) ... [2025-02-06 13:37:06,717 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d3b02e2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 01:37:06, skipping insertion in model container [2025-02-06 13:37:06,719 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:37:05" (2/3) ... [2025-02-06 13:37:06,719 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d3b02e2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 01:37:06, skipping insertion in model container [2025-02-06 13:37:06,719 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 01:37:06" (3/3) ... [2025-02-06 13:37:06,720 INFO L128 eAbstractionObserver]: Analyzing ICFG test23-1.c [2025-02-06 13:37:06,737 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 13:37:06,739 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG test23-1.c that has 2 procedures, 30 locations, 1 initial locations, 1 loop locations, and 4 error locations. [2025-02-06 13:37:06,796 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 13:37:06,807 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;@3f758058, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 13:37:06,807 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-02-06 13:37:06,811 INFO L276 IsEmpty]: Start isEmpty. Operand has 30 states, 22 states have (on average 1.3636363636363635) internal successors, (30), 26 states have internal predecessors, (30), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-06 13:37:06,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-02-06 13:37:06,816 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 13:37:06,817 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:37:06,817 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-02-06 13:37:06,822 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:37:06,823 INFO L85 PathProgramCache]: Analyzing trace with hash 561998817, now seen corresponding path program 1 times [2025-02-06 13:37:06,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:37:06,829 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1856265988] [2025-02-06 13:37:06,830 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:37:06,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:37:06,965 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-02-06 13:37:07,064 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-02-06 13:37:07,064 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:37:07,065 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:37:07,724 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-06 13:37:07,725 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:37:07,725 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1856265988] [2025-02-06 13:37:07,725 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1856265988] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:37:07,726 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:37:07,726 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 13:37:07,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1579111983] [2025-02-06 13:37:07,730 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:37:07,735 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 13:37:07,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:37:07,764 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 13:37:07,764 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 13:37:07,768 INFO L87 Difference]: Start difference. First operand has 30 states, 22 states have (on average 1.3636363636363635) internal successors, (30), 26 states have internal predecessors, (30), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) 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), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 13:37:07,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 13:37:07,832 INFO L93 Difference]: Finished difference Result 38 states and 42 transitions. [2025-02-06 13:37:07,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 13:37:07,839 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), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 15 [2025-02-06 13:37:07,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 13:37:07,846 INFO L225 Difference]: With dead ends: 38 [2025-02-06 13:37:07,851 INFO L226 Difference]: Without dead ends: 20 [2025-02-06 13:37:07,854 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-02-06 13:37:07,859 INFO L435 NwaCegarLoop]: 27 mSDtfsCounter, 1 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 13:37:07,860 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 51 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 13:37:07,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2025-02-06 13:37:07,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2025-02-06 13:37:07,887 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), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-06 13:37:07,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 21 transitions. [2025-02-06 13:37:07,893 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 21 transitions. Word has length 15 [2025-02-06 13:37:07,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 13:37:07,895 INFO L471 AbstractCegarLoop]: Abstraction has 20 states and 21 transitions. [2025-02-06 13:37:07,895 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), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 13:37:07,895 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 21 transitions. [2025-02-06 13:37:07,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-02-06 13:37:07,896 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 13:37:07,896 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:37:07,897 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-06 13:37:07,897 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-02-06 13:37:07,898 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:37:07,898 INFO L85 PathProgramCache]: Analyzing trace with hash 242094139, now seen corresponding path program 1 times [2025-02-06 13:37:07,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:37:07,898 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [908168188] [2025-02-06 13:37:07,899 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:37:07,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:37:07,914 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-02-06 13:37:07,944 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-02-06 13:37:07,944 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:37:07,944 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:37:08,096 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-06 13:37:08,097 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:37:08,097 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [908168188] [2025-02-06 13:37:08,097 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [908168188] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:37:08,097 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:37:08,097 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 13:37:08,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [61951749] [2025-02-06 13:37:08,098 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:37:08,099 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 13:37:08,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:37:08,099 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 13:37:08,099 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 13:37:08,099 INFO L87 Difference]: Start difference. First operand 20 states and 21 transitions. Second operand has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 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-02-06 13:37:08,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 13:37:08,120 INFO L93 Difference]: Finished difference Result 20 states and 21 transitions. [2025-02-06 13:37:08,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 13:37:08,122 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 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 16 [2025-02-06 13:37:08,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 13:37:08,123 INFO L225 Difference]: With dead ends: 20 [2025-02-06 13:37:08,124 INFO L226 Difference]: Without dead ends: 19 [2025-02-06 13:37:08,125 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-02-06 13:37:08,125 INFO L435 NwaCegarLoop]: 18 mSDtfsCounter, 0 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 13:37:08,131 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 34 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 13:37:08,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2025-02-06 13:37:08,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2025-02-06 13:37:08,135 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), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-06 13:37:08,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 20 transitions. [2025-02-06 13:37:08,138 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 20 transitions. Word has length 16 [2025-02-06 13:37:08,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 13:37:08,139 INFO L471 AbstractCegarLoop]: Abstraction has 19 states and 20 transitions. [2025-02-06 13:37:08,139 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 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-02-06 13:37:08,139 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 20 transitions. [2025-02-06 13:37:08,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-02-06 13:37:08,139 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 13:37:08,139 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:37:08,139 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 13:37:08,140 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-02-06 13:37:08,140 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:37:08,140 INFO L85 PathProgramCache]: Analyzing trace with hash 976398941, now seen corresponding path program 1 times [2025-02-06 13:37:08,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:37:08,140 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [7536125] [2025-02-06 13:37:08,140 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:37:08,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:37:08,174 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-02-06 13:37:08,199 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-02-06 13:37:08,206 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:37:08,207 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:37:08,337 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-06 13:37:08,338 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:37:08,338 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [7536125] [2025-02-06 13:37:08,338 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [7536125] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:37:08,338 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:37:08,338 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 13:37:08,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1963213331] [2025-02-06 13:37:08,338 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:37:08,339 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 13:37:08,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:37:08,343 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 13:37:08,343 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 13:37:08,343 INFO L87 Difference]: Start difference. First operand 19 states and 20 transitions. Second operand has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 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-02-06 13:37:08,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 13:37:08,410 INFO L93 Difference]: Finished difference Result 19 states and 20 transitions. [2025-02-06 13:37:08,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 13:37:08,411 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 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 19 [2025-02-06 13:37:08,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 13:37:08,412 INFO L225 Difference]: With dead ends: 19 [2025-02-06 13:37:08,413 INFO L226 Difference]: Without dead ends: 18 [2025-02-06 13:37:08,413 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 13:37:08,417 INFO L435 NwaCegarLoop]: 12 mSDtfsCounter, 1 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 13:37:08,417 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 32 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 13:37:08,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2025-02-06 13:37:08,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2025-02-06 13:37:08,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 14 states have (on average 1.0714285714285714) internal successors, (15), 14 states have internal predecessors, (15), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-06 13:37:08,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 19 transitions. [2025-02-06 13:37:08,422 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 19 transitions. Word has length 19 [2025-02-06 13:37:08,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 13:37:08,422 INFO L471 AbstractCegarLoop]: Abstraction has 18 states and 19 transitions. [2025-02-06 13:37:08,422 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 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-02-06 13:37:08,422 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 19 transitions. [2025-02-06 13:37:08,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-02-06 13:37:08,429 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 13:37:08,429 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:37:08,429 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 13:37:08,429 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-02-06 13:37:08,430 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:37:08,434 INFO L85 PathProgramCache]: Analyzing trace with hash 203596087, now seen corresponding path program 1 times [2025-02-06 13:37:08,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:37:08,435 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1916638584] [2025-02-06 13:37:08,435 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:37:08,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:37:08,474 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-02-06 13:37:08,504 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-02-06 13:37:08,507 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:37:08,510 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:37:08,732 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-06 13:37:08,732 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:37:08,732 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1916638584] [2025-02-06 13:37:08,732 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1916638584] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:37:08,732 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:37:08,732 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 13:37:08,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1193894811] [2025-02-06 13:37:08,733 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:37:08,733 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 13:37:08,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:37:08,733 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 13:37:08,733 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 13:37:08,735 INFO L87 Difference]: Start difference. First operand 18 states and 19 transitions. Second operand has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 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-02-06 13:37:08,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 13:37:08,772 INFO L93 Difference]: Finished difference Result 23 states and 24 transitions. [2025-02-06 13:37:08,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 13:37:08,774 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 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 20 [2025-02-06 13:37:08,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 13:37:08,774 INFO L225 Difference]: With dead ends: 23 [2025-02-06 13:37:08,774 INFO L226 Difference]: Without dead ends: 22 [2025-02-06 13:37:08,775 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 13:37:08,777 INFO L435 NwaCegarLoop]: 14 mSDtfsCounter, 0 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 13:37:08,777 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 36 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 13:37:08,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2025-02-06 13:37:08,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2025-02-06 13:37:08,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 18 states have (on average 1.0555555555555556) internal successors, (19), 18 states have internal predecessors, (19), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-06 13:37:08,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 23 transitions. [2025-02-06 13:37:08,785 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 23 transitions. Word has length 20 [2025-02-06 13:37:08,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 13:37:08,785 INFO L471 AbstractCegarLoop]: Abstraction has 22 states and 23 transitions. [2025-02-06 13:37:08,785 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 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-02-06 13:37:08,785 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 23 transitions. [2025-02-06 13:37:08,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-02-06 13:37:08,787 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 13:37:08,787 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:37:08,787 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-06 13:37:08,787 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-02-06 13:37:08,788 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:37:08,788 INFO L85 PathProgramCache]: Analyzing trace with hash 183391283, now seen corresponding path program 1 times [2025-02-06 13:37:08,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:37:08,788 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [540509942] [2025-02-06 13:37:08,788 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:37:08,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:37:08,805 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-02-06 13:37:08,850 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-02-06 13:37:08,851 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:37:08,851 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:37:09,005 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-06 13:37:09,005 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:37:09,005 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [540509942] [2025-02-06 13:37:09,006 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [540509942] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 13:37:09,006 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [996487345] [2025-02-06 13:37:09,006 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:37:09,006 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:37:09,006 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 13:37:09,011 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 13:37:09,014 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-06 13:37:09,081 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-02-06 13:37:09,140 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-02-06 13:37:09,140 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:37:09,140 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:37:09,144 INFO L256 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-02-06 13:37:09,150 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 13:37:09,304 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-06 13:37:09,304 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 13:37:09,390 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-06 13:37:09,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [996487345] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 13:37:09,392 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 13:37:09,392 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-02-06 13:37:09,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [235028465] [2025-02-06 13:37:09,392 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 13:37:09,393 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-06 13:37:09,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:37:09,393 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-06 13:37:09,393 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2025-02-06 13:37:09,393 INFO L87 Difference]: Start difference. First operand 22 states and 23 transitions. Second operand has 8 states, 7 states have (on average 4.142857142857143) internal successors, (29), 8 states have internal predecessors, (29), 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-02-06 13:37:09,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 13:37:09,437 INFO L93 Difference]: Finished difference Result 35 states and 38 transitions. [2025-02-06 13:37:09,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 13:37:09,438 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 4.142857142857143) internal successors, (29), 8 states have internal predecessors, (29), 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-02-06 13:37:09,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 13:37:09,438 INFO L225 Difference]: With dead ends: 35 [2025-02-06 13:37:09,438 INFO L226 Difference]: Without dead ends: 34 [2025-02-06 13:37:09,438 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2025-02-06 13:37:09,440 INFO L435 NwaCegarLoop]: 14 mSDtfsCounter, 0 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 13:37:09,445 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 39 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 13:37:09,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2025-02-06 13:37:09,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2025-02-06 13:37:09,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 30 states have (on average 1.0333333333333334) internal successors, (31), 30 states have internal predecessors, (31), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-06 13:37:09,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 35 transitions. [2025-02-06 13:37:09,455 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 35 transitions. Word has length 24 [2025-02-06 13:37:09,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 13:37:09,457 INFO L471 AbstractCegarLoop]: Abstraction has 34 states and 35 transitions. [2025-02-06 13:37:09,457 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 4.142857142857143) internal successors, (29), 8 states have internal predecessors, (29), 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-02-06 13:37:09,457 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 35 transitions. [2025-02-06 13:37:09,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-02-06 13:37:09,458 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 13:37:09,458 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:37:09,470 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-06 13:37:09,658 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:37:09,659 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-02-06 13:37:09,660 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:37:09,660 INFO L85 PathProgramCache]: Analyzing trace with hash 479344935, now seen corresponding path program 2 times [2025-02-06 13:37:09,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:37:09,660 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1383081123] [2025-02-06 13:37:09,660 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 13:37:09,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:37:09,703 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 36 statements into 2 equivalence classes. [2025-02-06 13:37:09,841 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 15 of 36 statements. [2025-02-06 13:37:09,841 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-06 13:37:09,841 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:37:11,211 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 2 proven. 12 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2025-02-06 13:37:11,213 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:37:11,213 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1383081123] [2025-02-06 13:37:11,213 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1383081123] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 13:37:11,213 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1550646829] [2025-02-06 13:37:11,213 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 13:37:11,214 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:37:11,214 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 13:37:11,216 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 13:37:11,219 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-06 13:37:11,265 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 36 statements into 2 equivalence classes. [2025-02-06 13:37:11,297 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 15 of 36 statements. [2025-02-06 13:37:11,297 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-06 13:37:11,297 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:37:11,299 INFO L256 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-02-06 13:37:11,301 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 13:37:11,376 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 1 [2025-02-06 13:37:11,461 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-02-06 13:37:11,487 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2025-02-06 13:37:11,487 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 13:37:11,576 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2025-02-06 13:37:11,577 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1550646829] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 13:37:11,577 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 13:37:11,577 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4, 4] total 9 [2025-02-06 13:37:11,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [421774910] [2025-02-06 13:37:11,577 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 13:37:11,577 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-06 13:37:11,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:37:11,578 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-06 13:37:11,578 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2025-02-06 13:37:11,578 INFO L87 Difference]: Start difference. First operand 34 states and 35 transitions. Second operand has 10 states, 9 states have (on average 4.0) internal successors, (36), 10 states have internal predecessors, (36), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-02-06 13:37:11,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 13:37:11,720 INFO L93 Difference]: Finished difference Result 34 states and 35 transitions. [2025-02-06 13:37:11,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-06 13:37:11,722 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 4.0) internal successors, (36), 10 states have internal predecessors, (36), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 36 [2025-02-06 13:37:11,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 13:37:11,723 INFO L225 Difference]: With dead ends: 34 [2025-02-06 13:37:11,723 INFO L226 Difference]: Without dead ends: 0 [2025-02-06 13:37:11,723 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 70 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=64, Invalid=176, Unknown=0, NotChecked=0, Total=240 [2025-02-06 13:37:11,724 INFO L435 NwaCegarLoop]: 12 mSDtfsCounter, 13 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 13:37:11,724 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 68 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 13:37:11,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-02-06 13:37:11,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-02-06 13:37:11,724 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-02-06 13:37:11,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-02-06 13:37:11,725 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 36 [2025-02-06 13:37:11,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 13:37:11,725 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-02-06 13:37:11,725 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 4.0) internal successors, (36), 10 states have internal predecessors, (36), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-02-06 13:37:11,725 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-02-06 13:37:11,725 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-02-06 13:37:11,730 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 4 remaining) [2025-02-06 13:37:11,731 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 4 remaining) [2025-02-06 13:37:11,731 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 4 remaining) [2025-02-06 13:37:11,731 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 4 remaining) [2025-02-06 13:37:11,740 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-02-06 13:37:11,931 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:37:11,935 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1] [2025-02-06 13:37:11,936 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-02-06 13:37:12,020 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-06 13:37:12,028 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#d2~0!offset [2025-02-06 13:37:12,029 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#d1~0!offset [2025-02-06 13:37:12,029 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2025-02-06 13:37:12,030 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] [2025-02-06 13:37:12,030 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~pa~0!base,]]] [2025-02-06 13:37:12,033 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.02 01:37:12 BoogieIcfgContainer [2025-02-06 13:37:12,033 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-06 13:37:12,034 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-06 13:37:12,034 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-06 13:37:12,034 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-06 13:37:12,035 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 01:37:06" (3/4) ... [2025-02-06 13:37:12,037 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-02-06 13:37:12,041 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure get_dummy [2025-02-06 13:37:12,045 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges [2025-02-06 13:37:12,045 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2025-02-06 13:37:12,045 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-02-06 13:37:12,046 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-02-06 13:37:12,129 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-06 13:37:12,129 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-02-06 13:37:12,130 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-06 13:37:12,130 INFO L158 Benchmark]: Toolchain (without parser) took 6480.46ms. Allocated memory is still 142.6MB. Free memory was 112.0MB in the beginning and 62.8MB in the end (delta: 49.1MB). Peak memory consumption was 50.7MB. Max. memory is 16.1GB. [2025-02-06 13:37:12,131 INFO L158 Benchmark]: CDTParser took 0.39ms. Allocated memory is still 201.3MB. Free memory is still 123.7MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 13:37:12,131 INFO L158 Benchmark]: CACSL2BoogieTranslator took 297.69ms. Allocated memory is still 142.6MB. Free memory was 112.0MB in the beginning and 100.5MB in the end (delta: 11.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-06 13:37:12,132 INFO L158 Benchmark]: Boogie Procedure Inliner took 66.89ms. Allocated memory is still 142.6MB. Free memory was 100.5MB in the beginning and 98.7MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 13:37:12,132 INFO L158 Benchmark]: Boogie Preprocessor took 64.89ms. Allocated memory is still 142.6MB. Free memory was 98.7MB in the beginning and 97.1MB in the end (delta: 1.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-06 13:37:12,132 INFO L158 Benchmark]: IcfgBuilder took 625.62ms. Allocated memory is still 142.6MB. Free memory was 97.1MB in the beginning and 81.9MB in the end (delta: 15.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-06 13:37:12,133 INFO L158 Benchmark]: TraceAbstraction took 5322.31ms. Allocated memory is still 142.6MB. Free memory was 81.4MB in the beginning and 69.7MB in the end (delta: 11.6MB). Peak memory consumption was 17.1MB. Max. memory is 16.1GB. [2025-02-06 13:37:12,134 INFO L158 Benchmark]: Witness Printer took 95.68ms. Allocated memory is still 142.6MB. Free memory was 69.7MB in the beginning and 62.8MB in the end (delta: 6.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-06 13:37:12,135 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.39ms. Allocated memory is still 201.3MB. Free memory is still 123.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 297.69ms. Allocated memory is still 142.6MB. Free memory was 112.0MB in the beginning and 100.5MB in the end (delta: 11.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 66.89ms. Allocated memory is still 142.6MB. Free memory was 100.5MB in the beginning and 98.7MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 64.89ms. Allocated memory is still 142.6MB. Free memory was 98.7MB in the beginning and 97.1MB in the end (delta: 1.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 625.62ms. Allocated memory is still 142.6MB. Free memory was 97.1MB in the beginning and 81.9MB in the end (delta: 15.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 5322.31ms. Allocated memory is still 142.6MB. Free memory was 81.4MB in the beginning and 69.7MB in the end (delta: 11.6MB). Peak memory consumption was 17.1MB. Max. memory is 16.1GB. * Witness Printer took 95.68ms. Allocated memory is still 142.6MB. Free memory was 69.7MB in the beginning and 62.8MB in the end (delta: 6.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~#d2~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~#d1~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#1 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~pa~0!base,]]] * 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: 43]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 43]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 41]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 41]: 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 2 procedures, 30 locations, 4 error locations. Started 1 CEGAR loops. OverallTime: 5.2s, OverallIterations: 6, TraceHistogramMax: 5, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 0.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 16 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 15 mSDsluCounter, 260 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 163 mSDsCounter, 5 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 122 IncrementalHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 5 mSolverCounterUnsat, 97 mSDtfsCounter, 122 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 145 GetRequests, 118 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=34occurred in iteration=5, InterpolantAutomatonStates: 30, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 6 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 3.2s InterpolantComputationTime, 190 NumberOfCodeBlocks, 148 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 240 ConstructedInterpolants, 0 QuantifiedInterpolants, 740 SizeOfPredicates, 15 NumberOfNonLiveVariables, 372 ConjunctsInSsa, 23 ConjunctsInUnsatCore, 10 InterpolantComputations, 4 PerfectInterpolantSequences, 114/162 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 - InvariantResult [Line: 42]: Location Invariant Derived location invariant: ((0 <= (i + 2147483648)) && (i <= 2147483646)) RESULT: Ultimate proved your program to be correct! [2025-02-06 13:37:12,158 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE