./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_fgets_postinc_07_good.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 798a7b37 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_fgets_postinc_07_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 ccb496fd329cd773fa1188e9378f4f160bab9c32cc9bc08176f92b28a42a5a19 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 12:35:55,248 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 12:35:55,299 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2025-03-04 12:35:55,303 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 12:35:55,304 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 12:35:55,326 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 12:35:55,328 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 12:35:55,328 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 12:35:55,328 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 12:35:55,328 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 12:35:55,329 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 12:35:55,329 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 12:35:55,329 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 12:35:55,330 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 12:35:55,330 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 12:35:55,330 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 12:35:55,330 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 12:35:55,330 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 12:35:55,330 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 12:35:55,331 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 12:35:55,331 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 12:35:55,331 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 12:35:55,331 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-04 12:35:55,331 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 12:35:55,331 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 12:35:55,331 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 12:35:55,331 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 12:35:55,331 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 12:35:55,331 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 12:35:55,331 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 12:35:55,332 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 12:35:55,332 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 12:35:55,332 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 12:35:55,332 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 12:35:55,332 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 12:35:55,332 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 12:35:55,332 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 12:35:55,332 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 12:35:55,332 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 12:35:55,332 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 12:35:55,332 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 12:35:55,333 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 12:35:55,333 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 -> ccb496fd329cd773fa1188e9378f4f160bab9c32cc9bc08176f92b28a42a5a19 [2025-03-04 12:35:55,554 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 12:35:55,562 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 12:35:55,564 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 12:35:55,565 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 12:35:55,566 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 12:35:55,567 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_fgets_postinc_07_good.i [2025-03-04 12:35:56,668 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b1bc3e39f/25bc41559e8d4ef1b62cf73643f33c07/FLAG8c68b4866 [2025-03-04 12:35:57,011 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 12:35:57,012 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_fgets_postinc_07_good.i [2025-03-04 12:35:57,038 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b1bc3e39f/25bc41559e8d4ef1b62cf73643f33c07/FLAG8c68b4866 [2025-03-04 12:35:57,220 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b1bc3e39f/25bc41559e8d4ef1b62cf73643f33c07 [2025-03-04 12:35:57,222 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 12:35:57,223 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 12:35:57,224 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 12:35:57,224 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 12:35:57,227 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 12:35:57,228 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 12:35:57" (1/1) ... [2025-03-04 12:35:57,229 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@b429eef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:35:57, skipping insertion in model container [2025-03-04 12:35:57,229 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 12:35:57" (1/1) ... [2025-03-04 12:35:57,260 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 12:35:57,734 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 12:35:57,742 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 12:35:57,833 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 12:35:57,921 INFO L204 MainTranslator]: Completed translation [2025-03-04 12:35:57,922 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:35:57 WrapperNode [2025-03-04 12:35:57,922 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 12:35:57,923 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 12:35:57,923 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 12:35:57,923 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 12:35:57,930 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:35:57" (1/1) ... [2025-03-04 12:35:57,957 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:35:57" (1/1) ... [2025-03-04 12:35:57,991 INFO L138 Inliner]: procedures = 502, calls = 46, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 138 [2025-03-04 12:35:57,992 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 12:35:57,992 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 12:35:57,992 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 12:35:57,992 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 12:35:57,999 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:35:57" (1/1) ... [2025-03-04 12:35:57,999 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:35:57" (1/1) ... [2025-03-04 12:35:58,004 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:35:57" (1/1) ... [2025-03-04 12:35:58,015 INFO L175 MemorySlicer]: Split 2 memory accesses to 2 slices as follows [1, 1]. 50 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [1, 1]. The 0 writes are split as follows [0, 0]. [2025-03-04 12:35:58,015 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:35:57" (1/1) ... [2025-03-04 12:35:58,015 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:35:57" (1/1) ... [2025-03-04 12:35:58,024 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:35:57" (1/1) ... [2025-03-04 12:35:58,025 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:35:57" (1/1) ... [2025-03-04 12:35:58,026 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:35:57" (1/1) ... [2025-03-04 12:35:58,027 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:35:57" (1/1) ... [2025-03-04 12:35:58,029 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 12:35:58,029 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 12:35:58,029 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 12:35:58,029 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 12:35:58,030 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:35:57" (1/1) ... [2025-03-04 12:35:58,034 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 12:35:58,047 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 12:35:58,058 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-04 12:35:58,060 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-04 12:35:58,078 INFO L130 BoogieDeclarations]: Found specification of procedure printIntLine [2025-03-04 12:35:58,078 INFO L138 BoogieDeclarations]: Found implementation of procedure printIntLine [2025-03-04 12:35:58,078 INFO L130 BoogieDeclarations]: Found specification of procedure printLine [2025-03-04 12:35:58,078 INFO L138 BoogieDeclarations]: Found implementation of procedure printLine [2025-03-04 12:35:58,078 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 12:35:58,079 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 12:35:58,079 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 12:35:58,079 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 12:35:58,079 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-04 12:35:58,197 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 12:35:58,199 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 12:35:58,386 INFO L? ?]: Removed 34 outVars from TransFormulas that were not future-live. [2025-03-04 12:35:58,386 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 12:35:58,393 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 12:35:58,393 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 12:35:58,393 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 12:35:58 BoogieIcfgContainer [2025-03-04 12:35:58,393 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 12:35:58,395 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 12:35:58,395 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 12:35:58,398 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 12:35:58,398 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 12:35:57" (1/3) ... [2025-03-04 12:35:58,399 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6be9b778 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 12:35:58, skipping insertion in model container [2025-03-04 12:35:58,400 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:35:57" (2/3) ... [2025-03-04 12:35:58,400 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6be9b778 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 12:35:58, skipping insertion in model container [2025-03-04 12:35:58,400 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 12:35:58" (3/3) ... [2025-03-04 12:35:58,401 INFO L128 eAbstractionObserver]: Analyzing ICFG CWE190_Integer_Overflow__int_fgets_postinc_07_good.i [2025-03-04 12:35:58,411 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 12:35:58,413 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG CWE190_Integer_Overflow__int_fgets_postinc_07_good.i that has 3 procedures, 65 locations, 1 initial locations, 0 loop locations, and 8 error locations. [2025-03-04 12:35:58,468 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 12:35:58,477 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;@171a8c36, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 12:35:58,478 INFO L334 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2025-03-04 12:35:58,481 INFO L276 IsEmpty]: Start isEmpty. Operand has 65 states, 42 states have (on average 1.5) internal successors, (63), 56 states have internal predecessors, (63), 12 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 11 states have call predecessors, (12), 12 states have call successors, (12) [2025-03-04 12:35:58,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-03-04 12:35:58,485 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 12:35:58,485 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 12:35:58,486 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-04 12:35:58,490 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 12:35:58,490 INFO L85 PathProgramCache]: Analyzing trace with hash -1788494176, now seen corresponding path program 1 times [2025-03-04 12:35:58,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 12:35:58,497 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [155304046] [2025-03-04 12:35:58,498 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 12:35:58,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 12:35:58,566 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-04 12:35:58,581 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-04 12:35:58,581 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 12:35:58,581 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 12:35:58,684 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-04 12:35:58,685 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 12:35:58,685 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [155304046] [2025-03-04 12:35:58,686 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [155304046] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 12:35:58,686 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 12:35:58,686 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 12:35:58,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1727449157] [2025-03-04 12:35:58,687 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 12:35:58,690 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 12:35:58,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 12:35:58,703 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 12:35:58,704 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 12:35:58,706 INFO L87 Difference]: Start difference. First operand has 65 states, 42 states have (on average 1.5) internal successors, (63), 56 states have internal predecessors, (63), 12 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 11 states have call predecessors, (12), 12 states have call successors, (12) Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 12:35:58,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 12:35:58,749 INFO L93 Difference]: Finished difference Result 120 states and 158 transitions. [2025-03-04 12:35:58,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 12:35:58,751 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2025-03-04 12:35:58,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 12:35:58,758 INFO L225 Difference]: With dead ends: 120 [2025-03-04 12:35:58,758 INFO L226 Difference]: Without dead ends: 54 [2025-03-04 12:35:58,760 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-04 12:35:58,762 INFO L435 NwaCegarLoop]: 67 mSDtfsCounter, 71 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 12:35:58,762 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 67 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 12:35:58,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2025-03-04 12:35:58,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2025-03-04 12:35:58,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 36 states have (on average 1.3333333333333333) internal successors, (48), 47 states have internal predecessors, (48), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2025-03-04 12:35:58,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 64 transitions. [2025-03-04 12:35:58,788 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 64 transitions. Word has length 12 [2025-03-04 12:35:58,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 12:35:58,790 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 64 transitions. [2025-03-04 12:35:58,790 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 12:35:58,790 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 64 transitions. [2025-03-04 12:35:58,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-03-04 12:35:58,791 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 12:35:58,791 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 12:35:58,791 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 12:35:58,792 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-04 12:35:58,792 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 12:35:58,793 INFO L85 PathProgramCache]: Analyzing trace with hash -782611166, now seen corresponding path program 1 times [2025-03-04 12:35:58,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 12:35:58,793 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1499862939] [2025-03-04 12:35:58,793 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 12:35:58,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 12:35:58,806 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-04 12:35:58,815 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-04 12:35:58,815 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 12:35:58,815 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 12:35:58,933 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-04 12:35:58,934 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 12:35:58,934 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1499862939] [2025-03-04 12:35:58,934 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1499862939] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 12:35:58,934 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 12:35:58,934 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 12:35:58,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1680341906] [2025-03-04 12:35:58,934 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 12:35:58,935 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 12:35:58,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 12:35:58,935 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 12:35:58,935 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 12:35:58,935 INFO L87 Difference]: Start difference. First operand 54 states and 64 transitions. Second operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 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-04 12:35:58,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 12:35:58,959 INFO L93 Difference]: Finished difference Result 54 states and 64 transitions. [2025-03-04 12:35:58,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 12:35:58,963 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 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 14 [2025-03-04 12:35:58,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 12:35:58,964 INFO L225 Difference]: With dead ends: 54 [2025-03-04 12:35:58,964 INFO L226 Difference]: Without dead ends: 53 [2025-03-04 12:35:58,964 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-03-04 12:35:58,964 INFO L435 NwaCegarLoop]: 58 mSDtfsCounter, 3 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 164 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 12:35:58,965 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 164 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 12:35:58,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2025-03-04 12:35:58,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2025-03-04 12:35:58,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 36 states have (on average 1.3055555555555556) internal successors, (47), 46 states have internal predecessors, (47), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2025-03-04 12:35:58,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 63 transitions. [2025-03-04 12:35:58,975 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 63 transitions. Word has length 14 [2025-03-04 12:35:58,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 12:35:58,975 INFO L471 AbstractCegarLoop]: Abstraction has 53 states and 63 transitions. [2025-03-04 12:35:58,975 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 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-04 12:35:58,975 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 63 transitions. [2025-03-04 12:35:58,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-03-04 12:35:58,976 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 12:35:58,976 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 12:35:58,976 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 12:35:58,976 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-04 12:35:58,977 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 12:35:58,977 INFO L85 PathProgramCache]: Analyzing trace with hash 1508857656, now seen corresponding path program 1 times [2025-03-04 12:35:58,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 12:35:58,978 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [535807958] [2025-03-04 12:35:58,978 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 12:35:58,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 12:35:58,996 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-04 12:35:59,008 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-04 12:35:59,009 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 12:35:59,009 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 12:35:59,068 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-04 12:35:59,069 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 12:35:59,069 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [535807958] [2025-03-04 12:35:59,070 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [535807958] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 12:35:59,070 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 12:35:59,070 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 12:35:59,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1410721208] [2025-03-04 12:35:59,070 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 12:35:59,070 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 12:35:59,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 12:35:59,070 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 12:35:59,070 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 12:35:59,070 INFO L87 Difference]: Start difference. First operand 53 states and 63 transitions. Second operand has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 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-04 12:35:59,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 12:35:59,083 INFO L93 Difference]: Finished difference Result 53 states and 63 transitions. [2025-03-04 12:35:59,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 12:35:59,086 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 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 15 [2025-03-04 12:35:59,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 12:35:59,086 INFO L225 Difference]: With dead ends: 53 [2025-03-04 12:35:59,086 INFO L226 Difference]: Without dead ends: 52 [2025-03-04 12:35:59,087 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-04 12:35:59,087 INFO L435 NwaCegarLoop]: 60 mSDtfsCounter, 0 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 12:35:59,087 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 117 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 12:35:59,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2025-03-04 12:35:59,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2025-03-04 12:35:59,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 36 states have (on average 1.2777777777777777) internal successors, (46), 45 states have internal predecessors, (46), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2025-03-04 12:35:59,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 62 transitions. [2025-03-04 12:35:59,096 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 62 transitions. Word has length 15 [2025-03-04 12:35:59,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 12:35:59,096 INFO L471 AbstractCegarLoop]: Abstraction has 52 states and 62 transitions. [2025-03-04 12:35:59,096 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 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-04 12:35:59,096 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 62 transitions. [2025-03-04 12:35:59,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-03-04 12:35:59,097 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 12:35:59,097 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, 1] [2025-03-04 12:35:59,097 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 12:35:59,098 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-04 12:35:59,098 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 12:35:59,099 INFO L85 PathProgramCache]: Analyzing trace with hash -1695299535, now seen corresponding path program 1 times [2025-03-04 12:35:59,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 12:35:59,099 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [989445779] [2025-03-04 12:35:59,099 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 12:35:59,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 12:35:59,120 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-04 12:35:59,130 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-04 12:35:59,131 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 12:35:59,131 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 12:35:59,233 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-04 12:35:59,234 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 12:35:59,234 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [989445779] [2025-03-04 12:35:59,234 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [989445779] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 12:35:59,234 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 12:35:59,235 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 12:35:59,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1622602285] [2025-03-04 12:35:59,235 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 12:35:59,235 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 12:35:59,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 12:35:59,236 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 12:35:59,236 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 12:35:59,237 INFO L87 Difference]: Start difference. First operand 52 states and 62 transitions. Second operand has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 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-04 12:35:59,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 12:35:59,258 INFO L93 Difference]: Finished difference Result 52 states and 62 transitions. [2025-03-04 12:35:59,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 12:35:59,259 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 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 25 [2025-03-04 12:35:59,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 12:35:59,259 INFO L225 Difference]: With dead ends: 52 [2025-03-04 12:35:59,260 INFO L226 Difference]: Without dead ends: 51 [2025-03-04 12:35:59,260 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-03-04 12:35:59,260 INFO L435 NwaCegarLoop]: 56 mSDtfsCounter, 3 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 158 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 12:35:59,260 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 158 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 12:35:59,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2025-03-04 12:35:59,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2025-03-04 12:35:59,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 36 states have (on average 1.25) internal successors, (45), 44 states have internal predecessors, (45), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2025-03-04 12:35:59,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 61 transitions. [2025-03-04 12:35:59,265 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 61 transitions. Word has length 25 [2025-03-04 12:35:59,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 12:35:59,265 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 61 transitions. [2025-03-04 12:35:59,265 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 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-04 12:35:59,266 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 61 transitions. [2025-03-04 12:35:59,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-03-04 12:35:59,266 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 12:35:59,266 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, 1, 1] [2025-03-04 12:35:59,266 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 12:35:59,266 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-04 12:35:59,267 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 12:35:59,267 INFO L85 PathProgramCache]: Analyzing trace with hash -1014678026, now seen corresponding path program 1 times [2025-03-04 12:35:59,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 12:35:59,267 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1620373382] [2025-03-04 12:35:59,267 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 12:35:59,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 12:35:59,289 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-04 12:35:59,295 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-04 12:35:59,295 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 12:35:59,295 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 12:35:59,338 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-04 12:35:59,339 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 12:35:59,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1620373382] [2025-03-04 12:35:59,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1620373382] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 12:35:59,339 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 12:35:59,339 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 12:35:59,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1880485164] [2025-03-04 12:35:59,339 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 12:35:59,339 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 12:35:59,339 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 12:35:59,340 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 12:35:59,340 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 12:35:59,340 INFO L87 Difference]: Start difference. First operand 51 states and 61 transitions. Second operand has 3 states, 2 states have (on average 9.5) internal successors, (19), 3 states have internal predecessors, (19), 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-04 12:35:59,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 12:35:59,347 INFO L93 Difference]: Finished difference Result 51 states and 61 transitions. [2025-03-04 12:35:59,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 12:35:59,348 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 9.5) internal successors, (19), 3 states have internal predecessors, (19), 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 26 [2025-03-04 12:35:59,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 12:35:59,348 INFO L225 Difference]: With dead ends: 51 [2025-03-04 12:35:59,348 INFO L226 Difference]: Without dead ends: 50 [2025-03-04 12:35:59,348 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-04 12:35:59,349 INFO L435 NwaCegarLoop]: 58 mSDtfsCounter, 0 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 12:35:59,349 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 113 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 12:35:59,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2025-03-04 12:35:59,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2025-03-04 12:35:59,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 36 states have (on average 1.2222222222222223) internal successors, (44), 43 states have internal predecessors, (44), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2025-03-04 12:35:59,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 60 transitions. [2025-03-04 12:35:59,354 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 60 transitions. Word has length 26 [2025-03-04 12:35:59,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 12:35:59,354 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 60 transitions. [2025-03-04 12:35:59,354 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 9.5) internal successors, (19), 3 states have internal predecessors, (19), 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-04 12:35:59,354 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 60 transitions. [2025-03-04 12:35:59,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-03-04 12:35:59,354 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 12:35:59,355 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 12:35:59,355 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 12:35:59,355 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-04 12:35:59,355 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 12:35:59,355 INFO L85 PathProgramCache]: Analyzing trace with hash 912174188, now seen corresponding path program 1 times [2025-03-04 12:35:59,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 12:35:59,355 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [367713093] [2025-03-04 12:35:59,355 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 12:35:59,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 12:35:59,366 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-04 12:35:59,371 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-04 12:35:59,372 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 12:35:59,372 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 12:35:59,411 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-04 12:35:59,411 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 12:35:59,411 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [367713093] [2025-03-04 12:35:59,411 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [367713093] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 12:35:59,411 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 12:35:59,412 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 12:35:59,412 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1464153959] [2025-03-04 12:35:59,412 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 12:35:59,412 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 12:35:59,412 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 12:35:59,412 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 12:35:59,412 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 12:35:59,412 INFO L87 Difference]: Start difference. First operand 50 states and 60 transitions. Second operand has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-04 12:35:59,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 12:35:59,423 INFO L93 Difference]: Finished difference Result 50 states and 60 transitions. [2025-03-04 12:35:59,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 12:35:59,424 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 33 [2025-03-04 12:35:59,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 12:35:59,424 INFO L225 Difference]: With dead ends: 50 [2025-03-04 12:35:59,424 INFO L226 Difference]: Without dead ends: 48 [2025-03-04 12:35:59,425 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-03-04 12:35:59,425 INFO L435 NwaCegarLoop]: 55 mSDtfsCounter, 1 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 160 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 12:35:59,425 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 160 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 12:35:59,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2025-03-04 12:35:59,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2025-03-04 12:35:59,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 36 states have (on average 1.1666666666666667) internal successors, (42), 41 states have internal predecessors, (42), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2025-03-04 12:35:59,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 58 transitions. [2025-03-04 12:35:59,430 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 58 transitions. Word has length 33 [2025-03-04 12:35:59,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 12:35:59,430 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 58 transitions. [2025-03-04 12:35:59,430 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-04 12:35:59,430 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 58 transitions. [2025-03-04 12:35:59,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2025-03-04 12:35:59,434 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 12:35:59,434 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 12:35:59,434 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 12:35:59,435 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-04 12:35:59,435 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 12:35:59,435 INFO L85 PathProgramCache]: Analyzing trace with hash -1599607002, now seen corresponding path program 1 times [2025-03-04 12:35:59,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 12:35:59,435 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2111359602] [2025-03-04 12:35:59,435 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 12:35:59,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 12:35:59,451 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-03-04 12:35:59,456 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-03-04 12:35:59,456 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 12:35:59,456 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 12:35:59,496 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-04 12:35:59,496 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 12:35:59,496 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2111359602] [2025-03-04 12:35:59,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2111359602] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 12:35:59,496 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 12:35:59,496 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 12:35:59,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1775760877] [2025-03-04 12:35:59,496 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 12:35:59,496 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 12:35:59,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 12:35:59,497 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 12:35:59,497 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 12:35:59,497 INFO L87 Difference]: Start difference. First operand 48 states and 58 transitions. Second operand has 4 states, 3 states have (on average 9.666666666666666) internal successors, (29), 4 states have internal predecessors, (29), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-04 12:35:59,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 12:35:59,506 INFO L93 Difference]: Finished difference Result 48 states and 58 transitions. [2025-03-04 12:35:59,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 12:35:59,507 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 9.666666666666666) internal successors, (29), 4 states have internal predecessors, (29), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 43 [2025-03-04 12:35:59,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 12:35:59,507 INFO L225 Difference]: With dead ends: 48 [2025-03-04 12:35:59,507 INFO L226 Difference]: Without dead ends: 0 [2025-03-04 12:35:59,508 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-03-04 12:35:59,508 INFO L435 NwaCegarLoop]: 54 mSDtfsCounter, 1 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 159 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 12:35:59,508 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 159 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 12:35:59,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-04 12:35:59,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-04 12:35:59,509 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-04 12:35:59,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-04 12:35:59,509 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 43 [2025-03-04 12:35:59,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 12:35:59,509 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-04 12:35:59,509 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 9.666666666666666) internal successors, (29), 4 states have internal predecessors, (29), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-04 12:35:59,509 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-04 12:35:59,509 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-04 12:35:59,511 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 8 remaining) [2025-03-04 12:35:59,512 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 8 remaining) [2025-03-04 12:35:59,512 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 8 remaining) [2025-03-04 12:35:59,512 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 8 remaining) [2025-03-04 12:35:59,512 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 8 remaining) [2025-03-04 12:35:59,512 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 8 remaining) [2025-03-04 12:35:59,512 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 8 remaining) [2025-03-04 12:35:59,512 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 8 remaining) [2025-03-04 12:35:59,512 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 12:35:59,514 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2025-03-04 12:35:59,515 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-03-04 12:35:59,548 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-04 12:35:59,554 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.03 12:35:59 BoogieIcfgContainer [2025-03-04 12:35:59,554 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-04 12:35:59,555 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-04 12:35:59,555 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-04 12:35:59,555 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-04 12:35:59,556 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 12:35:58" (3/4) ... [2025-03-04 12:35:59,557 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-04 12:35:59,561 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure printLine [2025-03-04 12:35:59,561 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure printIntLine [2025-03-04 12:35:59,564 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 17 nodes and edges [2025-03-04 12:35:59,564 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2025-03-04 12:35:59,564 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-03-04 12:35:59,564 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-04 12:35:59,565 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-04 12:35:59,622 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-04 12:35:59,623 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-04 12:35:59,623 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-04 12:35:59,624 INFO L158 Benchmark]: Toolchain (without parser) took 2400.02ms. Allocated memory is still 167.8MB. Free memory was 119.2MB in the beginning and 62.3MB in the end (delta: 56.9MB). Peak memory consumption was 60.2MB. Max. memory is 16.1GB. [2025-03-04 12:35:59,624 INFO L158 Benchmark]: CDTParser took 0.29ms. Allocated memory is still 201.3MB. Free memory is still 119.2MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 12:35:59,624 INFO L158 Benchmark]: CACSL2BoogieTranslator took 698.44ms. Allocated memory is still 167.8MB. Free memory was 118.7MB in the beginning and 57.4MB in the end (delta: 61.3MB). Peak memory consumption was 67.1MB. Max. memory is 16.1GB. [2025-03-04 12:35:59,625 INFO L158 Benchmark]: Boogie Procedure Inliner took 68.40ms. Allocated memory is still 167.8MB. Free memory was 57.4MB in the beginning and 54.7MB in the end (delta: 2.7MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 12:35:59,625 INFO L158 Benchmark]: Boogie Preprocessor took 36.57ms. Allocated memory is still 167.8MB. Free memory was 54.7MB in the beginning and 52.8MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 12:35:59,626 INFO L158 Benchmark]: IcfgBuilder took 364.11ms. Allocated memory is still 167.8MB. Free memory was 52.8MB in the beginning and 36.0MB in the end (delta: 16.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-04 12:35:59,626 INFO L158 Benchmark]: TraceAbstraction took 1159.61ms. Allocated memory is still 167.8MB. Free memory was 35.5MB in the beginning and 68.5MB in the end (delta: -33.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 12:35:59,626 INFO L158 Benchmark]: Witness Printer took 67.81ms. Allocated memory is still 167.8MB. Free memory was 68.5MB in the beginning and 62.3MB in the end (delta: 6.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 12:35:59,628 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.29ms. Allocated memory is still 201.3MB. Free memory is still 119.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 698.44ms. Allocated memory is still 167.8MB. Free memory was 118.7MB in the beginning and 57.4MB in the end (delta: 61.3MB). Peak memory consumption was 67.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 68.40ms. Allocated memory is still 167.8MB. Free memory was 57.4MB in the beginning and 54.7MB in the end (delta: 2.7MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 36.57ms. Allocated memory is still 167.8MB. Free memory was 54.7MB in the beginning and 52.8MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 364.11ms. Allocated memory is still 167.8MB. Free memory was 52.8MB in the beginning and 36.0MB in the end (delta: 16.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 1159.61ms. Allocated memory is still 167.8MB. Free memory was 35.5MB in the beginning and 68.5MB in the end (delta: -33.0MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 67.81ms. Allocated memory is still 167.8MB. Free memory was 68.5MB in the beginning and 62.3MB in the end (delta: 6.2MB). Peak memory consumption was 8.4MB. 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: 1649]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1649]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1632]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1632]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1607]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1607]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1575]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1575]: 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, 65 locations, 8 error locations. Started 1 CEGAR loops. OverallTime: 1.1s, OverallIterations: 7, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 81 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 79 mSDsluCounter, 938 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 530 mSDsCounter, 11 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 67 IncrementalHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 11 mSolverCounterUnsat, 408 mSDtfsCounter, 67 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 20 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=65occurred in iteration=0, InterpolantAutomatonStates: 25, 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, 7 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 168 NumberOfCodeBlocks, 168 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 161 ConstructedInterpolants, 0 QuantifiedInterpolants, 217 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 PerfectInterpolantSequences, 32/32 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 8 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-03-04 12:35:59,645 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE