./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/array-examples/standard_init8_ground-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 8fc3dc66 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/array-examples/standard_init8_ground-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash dda1041cfa36c4017116912acad0e6776c355afeb5733cf0531e7478051aaa6d --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 14:37:44,902 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 14:37:44,943 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-03-17 14:37:44,948 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 14:37:44,951 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 14:37:44,973 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 14:37:44,975 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 14:37:44,975 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 14:37:44,975 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 14:37:44,976 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 14:37:44,976 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 14:37:44,976 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 14:37:44,977 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 14:37:44,977 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 14:37:44,977 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 14:37:44,977 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 14:37:44,977 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 14:37:44,977 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 14:37:44,977 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 14:37:44,977 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 14:37:44,977 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 14:37:44,978 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 14:37:44,978 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 14:37:44,978 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 14:37:44,978 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-17 14:37:44,978 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-17 14:37:44,978 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 14:37:44,978 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 14:37:44,978 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 14:37:44,978 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 14:37:44,978 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 14:37:44,978 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 14:37:44,979 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 14:37:44,979 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 14:37:44,979 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 14:37:44,979 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 14:37:44,979 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 14:37:44,979 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 14:37:44,979 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 14:37:44,980 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 14:37:44,980 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 14:37:44,980 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 14:37:44,980 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 14:37:44,980 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 14:37:44,980 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 14:37:44,980 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> dda1041cfa36c4017116912acad0e6776c355afeb5733cf0531e7478051aaa6d [2025-03-17 14:37:45,216 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 14:37:45,225 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 14:37:45,227 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 14:37:45,228 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 14:37:45,228 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 14:37:45,229 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-examples/standard_init8_ground-1.i [2025-03-17 14:37:46,367 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6fe0a9afa/13666de60c14428e84b38eb12edcd60b/FLAG7d0cd0a0e [2025-03-17 14:37:46,578 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 14:37:46,578 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-examples/standard_init8_ground-1.i [2025-03-17 14:37:46,583 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6fe0a9afa/13666de60c14428e84b38eb12edcd60b/FLAG7d0cd0a0e [2025-03-17 14:37:46,938 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6fe0a9afa/13666de60c14428e84b38eb12edcd60b [2025-03-17 14:37:46,940 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 14:37:46,941 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 14:37:46,942 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 14:37:46,942 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 14:37:46,945 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 14:37:46,945 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 02:37:46" (1/1) ... [2025-03-17 14:37:46,946 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@552f6182 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:37:46, skipping insertion in model container [2025-03-17 14:37:46,946 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 02:37:46" (1/1) ... [2025-03-17 14:37:46,956 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 14:37:47,050 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 14:37:47,057 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 14:37:47,077 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 14:37:47,089 INFO L204 MainTranslator]: Completed translation [2025-03-17 14:37:47,089 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:37:47 WrapperNode [2025-03-17 14:37:47,089 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 14:37:47,090 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 14:37:47,091 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 14:37:47,091 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 14:37:47,096 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:37:47" (1/1) ... [2025-03-17 14:37:47,100 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:37:47" (1/1) ... [2025-03-17 14:37:47,112 INFO L138 Inliner]: procedures = 15, calls = 20, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 81 [2025-03-17 14:37:47,113 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 14:37:47,114 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 14:37:47,114 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 14:37:47,114 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 14:37:47,119 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:37:47" (1/1) ... [2025-03-17 14:37:47,120 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:37:47" (1/1) ... [2025-03-17 14:37:47,121 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:37:47" (1/1) ... [2025-03-17 14:37:47,130 INFO L175 MemorySlicer]: Split 11 memory accesses to 2 slices as follows [2, 9]. 82 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 8 writes are split as follows [0, 8]. [2025-03-17 14:37:47,131 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:37:47" (1/1) ... [2025-03-17 14:37:47,131 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:37:47" (1/1) ... [2025-03-17 14:37:47,134 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:37:47" (1/1) ... [2025-03-17 14:37:47,134 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:37:47" (1/1) ... [2025-03-17 14:37:47,135 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:37:47" (1/1) ... [2025-03-17 14:37:47,135 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:37:47" (1/1) ... [2025-03-17 14:37:47,136 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 14:37:47,137 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 14:37:47,137 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 14:37:47,137 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 14:37:47,138 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:37:47" (1/1) ... [2025-03-17 14:37:47,141 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 14:37:47,150 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:37:47,160 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-17 14:37:47,164 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-17 14:37:47,178 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 14:37:47,178 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 14:37:47,178 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-17 14:37:47,178 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-17 14:37:47,178 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-17 14:37:47,178 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-17 14:37:47,178 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 14:37:47,178 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 14:37:47,178 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-17 14:37:47,178 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-17 14:37:47,178 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-17 14:37:47,229 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 14:37:47,231 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 14:37:47,380 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L15: call ULTIMATE.dealloc(main_~#a~0#1.base, main_~#a~0#1.offset);havoc main_~#a~0#1.base, main_~#a~0#1.offset; [2025-03-17 14:37:47,387 INFO L? ?]: Removed 27 outVars from TransFormulas that were not future-live. [2025-03-17 14:37:47,387 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 14:37:47,393 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 14:37:47,394 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 14:37:47,395 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 02:37:47 BoogieIcfgContainer [2025-03-17 14:37:47,395 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 14:37:47,396 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 14:37:47,397 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 14:37:47,400 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 14:37:47,401 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 02:37:46" (1/3) ... [2025-03-17 14:37:47,402 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b6700eb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 02:37:47, skipping insertion in model container [2025-03-17 14:37:47,402 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:37:47" (2/3) ... [2025-03-17 14:37:47,402 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b6700eb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 02:37:47, skipping insertion in model container [2025-03-17 14:37:47,402 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 02:37:47" (3/3) ... [2025-03-17 14:37:47,403 INFO L128 eAbstractionObserver]: Analyzing ICFG standard_init8_ground-1.i [2025-03-17 14:37:47,414 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 14:37:47,416 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG standard_init8_ground-1.i that has 1 procedures, 53 locations, 1 initial locations, 9 loop locations, and 18 error locations. [2025-03-17 14:37:47,463 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 14:37:47,472 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;@41f6404, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 14:37:47,472 INFO L334 AbstractCegarLoop]: Starting to check reachability of 18 error locations. [2025-03-17 14:37:47,475 INFO L276 IsEmpty]: Start isEmpty. Operand has 53 states, 34 states have (on average 1.8529411764705883) internal successors, (63), 52 states have internal predecessors, (63), 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-17 14:37:47,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2025-03-17 14:37:47,478 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:37:47,478 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1] [2025-03-17 14:37:47,479 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-03-17 14:37:47,482 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:37:47,482 INFO L85 PathProgramCache]: Analyzing trace with hash 92317, now seen corresponding path program 1 times [2025-03-17 14:37:47,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:37:47,487 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [536044541] [2025-03-17 14:37:47,487 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:37:47,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:37:47,550 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-17 14:37:47,566 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-17 14:37:47,567 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:37:47,567 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:37:47,643 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-17 14:37:47,645 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:37:47,646 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [536044541] [2025-03-17 14:37:47,646 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [536044541] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:37:47,646 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:37:47,647 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-17 14:37:47,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [107975704] [2025-03-17 14:37:47,648 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:37:47,651 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 14:37:47,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:37:47,664 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 14:37:47,664 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 14:37:47,666 INFO L87 Difference]: Start difference. First operand has 53 states, 34 states have (on average 1.8529411764705883) internal successors, (63), 52 states have internal predecessors, (63), 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) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 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-17 14:37:47,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:37:47,774 INFO L93 Difference]: Finished difference Result 64 states and 76 transitions. [2025-03-17 14:37:47,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 14:37:47,776 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 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) Word has length 3 [2025-03-17 14:37:47,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:37:47,780 INFO L225 Difference]: With dead ends: 64 [2025-03-17 14:37:47,780 INFO L226 Difference]: Without dead ends: 40 [2025-03-17 14:37:47,783 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 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-17 14:37:47,788 INFO L435 NwaCegarLoop]: 12 mSDtfsCounter, 15 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 14:37:47,788 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 22 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 14:37:47,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2025-03-17 14:37:47,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2025-03-17 14:37:47,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 30 states have (on average 1.6) internal successors, (48), 39 states have internal predecessors, (48), 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-17 14:37:47,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 48 transitions. [2025-03-17 14:37:47,815 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 48 transitions. Word has length 3 [2025-03-17 14:37:47,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:37:47,815 INFO L471 AbstractCegarLoop]: Abstraction has 40 states and 48 transitions. [2025-03-17 14:37:47,816 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 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-17 14:37:47,816 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 48 transitions. [2025-03-17 14:37:47,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-03-17 14:37:47,816 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:37:47,816 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-03-17 14:37:47,816 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-17 14:37:47,816 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-03-17 14:37:47,817 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:37:47,817 INFO L85 PathProgramCache]: Analyzing trace with hash 2861855, now seen corresponding path program 1 times [2025-03-17 14:37:47,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:37:47,817 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [293794118] [2025-03-17 14:37:47,817 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:37:47,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:37:47,822 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-17 14:37:47,826 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-17 14:37:47,826 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:37:47,827 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:37:47,859 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-17 14:37:47,859 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:37:47,859 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [293794118] [2025-03-17 14:37:47,859 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [293794118] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:37:47,859 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:37:47,859 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-17 14:37:47,859 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [876381347] [2025-03-17 14:37:47,859 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:37:47,860 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 14:37:47,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:37:47,860 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 14:37:47,861 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 14:37:47,861 INFO L87 Difference]: Start difference. First operand 40 states and 48 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 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-17 14:37:47,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:37:47,989 INFO L93 Difference]: Finished difference Result 100 states and 130 transitions. [2025-03-17 14:37:47,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 14:37:47,990 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 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) Word has length 4 [2025-03-17 14:37:47,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:37:47,990 INFO L225 Difference]: With dead ends: 100 [2025-03-17 14:37:47,990 INFO L226 Difference]: Without dead ends: 64 [2025-03-17 14:37:47,991 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 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-17 14:37:47,991 INFO L435 NwaCegarLoop]: 24 mSDtfsCounter, 14 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 14:37:47,991 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 31 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 14:37:47,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2025-03-17 14:37:47,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2025-03-17 14:37:48,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 54 states have (on average 1.3333333333333333) internal successors, (72), 63 states have internal predecessors, (72), 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-17 14:37:48,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 72 transitions. [2025-03-17 14:37:48,001 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 72 transitions. Word has length 4 [2025-03-17 14:37:48,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:37:48,001 INFO L471 AbstractCegarLoop]: Abstraction has 64 states and 72 transitions. [2025-03-17 14:37:48,001 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 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-17 14:37:48,001 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 72 transitions. [2025-03-17 14:37:48,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-03-17 14:37:48,003 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:37:48,003 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1] [2025-03-17 14:37:48,003 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 14:37:48,003 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-03-17 14:37:48,003 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:37:48,003 INFO L85 PathProgramCache]: Analyzing trace with hash -641791905, now seen corresponding path program 1 times [2025-03-17 14:37:48,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:37:48,004 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1260809265] [2025-03-17 14:37:48,004 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:37:48,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:37:48,012 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-17 14:37:48,020 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-17 14:37:48,020 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:37:48,020 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:37:48,051 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 14:37:48,051 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:37:48,051 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1260809265] [2025-03-17 14:37:48,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1260809265] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:37:48,051 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:37:48,052 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 14:37:48,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2070429095] [2025-03-17 14:37:48,052 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:37:48,053 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 14:37:48,053 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:37:48,053 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 14:37:48,053 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 14:37:48,053 INFO L87 Difference]: Start difference. First operand 64 states and 72 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 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-17 14:37:48,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:37:48,131 INFO L93 Difference]: Finished difference Result 64 states and 72 transitions. [2025-03-17 14:37:48,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 14:37:48,132 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 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) Word has length 7 [2025-03-17 14:37:48,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:37:48,132 INFO L225 Difference]: With dead ends: 64 [2025-03-17 14:37:48,132 INFO L226 Difference]: Without dead ends: 56 [2025-03-17 14:37:48,133 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-17 14:37:48,133 INFO L435 NwaCegarLoop]: 16 mSDtfsCounter, 14 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 14:37:48,133 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 23 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 14:37:48,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2025-03-17 14:37:48,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 40. [2025-03-17 14:37:48,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 38 states have (on average 1.263157894736842) internal successors, (48), 39 states have internal predecessors, (48), 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-17 14:37:48,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 48 transitions. [2025-03-17 14:37:48,138 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 48 transitions. Word has length 7 [2025-03-17 14:37:48,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:37:48,138 INFO L471 AbstractCegarLoop]: Abstraction has 40 states and 48 transitions. [2025-03-17 14:37:48,138 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 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-17 14:37:48,138 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 48 transitions. [2025-03-17 14:37:48,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-03-17 14:37:48,139 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:37:48,139 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1] [2025-03-17 14:37:48,139 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 14:37:48,139 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-03-17 14:37:48,139 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:37:48,139 INFO L85 PathProgramCache]: Analyzing trace with hash -328785852, now seen corresponding path program 1 times [2025-03-17 14:37:48,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:37:48,140 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1157136369] [2025-03-17 14:37:48,140 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:37:48,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:37:48,153 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-03-17 14:37:48,157 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-03-17 14:37:48,157 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:37:48,157 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:37:48,228 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-17 14:37:48,228 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:37:48,228 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1157136369] [2025-03-17 14:37:48,228 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1157136369] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:37:48,228 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [147066256] [2025-03-17 14:37:48,228 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:37:48,229 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:37:48,229 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:37:48,235 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 14:37:48,236 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-17 14:37:48,287 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-03-17 14:37:48,307 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-03-17 14:37:48,307 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:37:48,307 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:37:48,309 INFO L256 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-17 14:37:48,312 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:37:48,344 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-17 14:37:48,346 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 14:37:48,370 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-17 14:37:48,370 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [147066256] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 14:37:48,370 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 14:37:48,370 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2025-03-17 14:37:48,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1814900459] [2025-03-17 14:37:48,370 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 14:37:48,371 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 14:37:48,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:37:48,371 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 14:37:48,371 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-17 14:37:48,371 INFO L87 Difference]: Start difference. First operand 40 states and 48 transitions. Second operand has 6 states, 6 states have (on average 7.0) internal successors, (42), 5 states have internal predecessors, (42), 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-17 14:37:48,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:37:48,552 INFO L93 Difference]: Finished difference Result 147 states and 186 transitions. [2025-03-17 14:37:48,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 14:37:48,552 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.0) internal successors, (42), 5 states have internal predecessors, (42), 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) Word has length 37 [2025-03-17 14:37:48,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:37:48,553 INFO L225 Difference]: With dead ends: 147 [2025-03-17 14:37:48,553 INFO L226 Difference]: Without dead ends: 112 [2025-03-17 14:37:48,553 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-17 14:37:48,554 INFO L435 NwaCegarLoop]: 16 mSDtfsCounter, 60 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 14:37:48,554 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 44 Invalid, 166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 14:37:48,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2025-03-17 14:37:48,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2025-03-17 14:37:48,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 110 states have (on average 1.0909090909090908) internal successors, (120), 111 states have internal predecessors, (120), 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-17 14:37:48,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 120 transitions. [2025-03-17 14:37:48,562 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 120 transitions. Word has length 37 [2025-03-17 14:37:48,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:37:48,562 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 120 transitions. [2025-03-17 14:37:48,562 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.0) internal successors, (42), 5 states have internal predecessors, (42), 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-17 14:37:48,562 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 120 transitions. [2025-03-17 14:37:48,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-03-17 14:37:48,564 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:37:48,564 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:37:48,570 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-17 14:37:48,768 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:37:48,768 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-03-17 14:37:48,768 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:37:48,769 INFO L85 PathProgramCache]: Analyzing trace with hash 1763900100, now seen corresponding path program 2 times [2025-03-17 14:37:48,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:37:48,769 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2070483314] [2025-03-17 14:37:48,769 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 14:37:48,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:37:48,788 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 109 statements into 2 equivalence classes. [2025-03-17 14:37:48,792 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 13 of 109 statements. [2025-03-17 14:37:48,793 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-17 14:37:48,793 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:37:48,850 INFO L134 CoverageAnalysis]: Checked inductivity of 176 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 176 trivial. 0 not checked. [2025-03-17 14:37:48,850 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:37:48,850 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2070483314] [2025-03-17 14:37:48,850 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2070483314] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:37:48,850 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:37:48,850 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 14:37:48,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1217599419] [2025-03-17 14:37:48,850 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:37:48,851 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 14:37:48,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:37:48,851 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 14:37:48,851 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 14:37:48,851 INFO L87 Difference]: Start difference. First operand 112 states and 120 transitions. Second operand has 4 states, 3 states have (on average 12.333333333333334) internal successors, (37), 4 states have internal predecessors, (37), 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-17 14:37:48,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:37:48,874 INFO L93 Difference]: Finished difference Result 119 states and 127 transitions. [2025-03-17 14:37:48,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 14:37:48,874 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 12.333333333333334) internal successors, (37), 4 states have internal predecessors, (37), 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) Word has length 109 [2025-03-17 14:37:48,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:37:48,875 INFO L225 Difference]: With dead ends: 119 [2025-03-17 14:37:48,875 INFO L226 Difference]: Without dead ends: 117 [2025-03-17 14:37:48,875 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-17 14:37:48,876 INFO L435 NwaCegarLoop]: 36 mSDtfsCounter, 1 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 103 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-17 14:37:48,876 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 103 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 14:37:48,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2025-03-17 14:37:48,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 117. [2025-03-17 14:37:48,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 115 states have (on average 1.0869565217391304) internal successors, (125), 116 states have internal predecessors, (125), 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-17 14:37:48,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 125 transitions. [2025-03-17 14:37:48,889 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 125 transitions. Word has length 109 [2025-03-17 14:37:48,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:37:48,889 INFO L471 AbstractCegarLoop]: Abstraction has 117 states and 125 transitions. [2025-03-17 14:37:48,889 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 12.333333333333334) internal successors, (37), 4 states have internal predecessors, (37), 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-17 14:37:48,889 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 125 transitions. [2025-03-17 14:37:48,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2025-03-17 14:37:48,891 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:37:48,891 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:37:48,891 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-17 14:37:48,891 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-03-17 14:37:48,891 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:37:48,891 INFO L85 PathProgramCache]: Analyzing trace with hash -458673121, now seen corresponding path program 1 times [2025-03-17 14:37:48,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:37:48,892 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [466056877] [2025-03-17 14:37:48,892 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:37:48,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:37:48,909 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-03-17 14:37:48,947 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-03-17 14:37:48,950 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:37:48,950 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:37:49,165 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 158 trivial. 0 not checked. [2025-03-17 14:37:49,166 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:37:49,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [466056877] [2025-03-17 14:37:49,166 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [466056877] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:37:49,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [771128642] [2025-03-17 14:37:49,166 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:37:49,166 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:37:49,167 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:37:49,169 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 14:37:49,170 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-17 14:37:49,229 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-03-17 14:37:49,271 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-03-17 14:37:49,271 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:37:49,271 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:37:49,273 INFO L256 TraceCheckSpWp]: Trace formula consists of 368 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-17 14:37:49,275 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:37:49,305 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 158 trivial. 0 not checked. [2025-03-17 14:37:49,306 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 14:37:49,371 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 158 trivial. 0 not checked. [2025-03-17 14:37:49,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [771128642] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 14:37:49,372 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 14:37:49,372 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2025-03-17 14:37:49,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1980344953] [2025-03-17 14:37:49,372 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 14:37:49,373 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-17 14:37:49,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:37:49,374 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-17 14:37:49,375 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2025-03-17 14:37:49,375 INFO L87 Difference]: Start difference. First operand 117 states and 125 transitions. Second operand has 12 states, 12 states have (on average 5.166666666666667) internal successors, (62), 11 states have internal predecessors, (62), 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-17 14:37:49,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:37:49,748 INFO L93 Difference]: Finished difference Result 364 states and 427 transitions. [2025-03-17 14:37:49,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-17 14:37:49,749 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.166666666666667) internal successors, (62), 11 states have internal predecessors, (62), 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) Word has length 114 [2025-03-17 14:37:49,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:37:49,750 INFO L225 Difference]: With dead ends: 364 [2025-03-17 14:37:49,750 INFO L226 Difference]: Without dead ends: 261 [2025-03-17 14:37:49,751 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 232 GetRequests, 222 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2025-03-17 14:37:49,751 INFO L435 NwaCegarLoop]: 16 mSDtfsCounter, 382 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 249 mSolverCounterSat, 240 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 382 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 489 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 240 IncrementalHoareTripleChecker+Valid, 249 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 14:37:49,751 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [382 Valid, 23 Invalid, 489 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [240 Valid, 249 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 14:37:49,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2025-03-17 14:37:49,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 261. [2025-03-17 14:37:49,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 261 states, 259 states have (on average 1.0386100386100385) internal successors, (269), 260 states have internal predecessors, (269), 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-17 14:37:49,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 269 transitions. [2025-03-17 14:37:49,788 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 269 transitions. Word has length 114 [2025-03-17 14:37:49,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:37:49,788 INFO L471 AbstractCegarLoop]: Abstraction has 261 states and 269 transitions. [2025-03-17 14:37:49,788 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.166666666666667) internal successors, (62), 11 states have internal predecessors, (62), 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-17 14:37:49,788 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 269 transitions. [2025-03-17 14:37:49,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2025-03-17 14:37:49,791 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:37:49,791 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:37:49,798 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-17 14:37:49,991 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2025-03-17 14:37:49,992 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-03-17 14:37:49,992 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:37:49,992 INFO L85 PathProgramCache]: Analyzing trace with hash -1065991137, now seen corresponding path program 2 times [2025-03-17 14:37:49,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:37:49,993 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1877588113] [2025-03-17 14:37:49,993 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 14:37:49,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:37:50,034 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 258 statements into 2 equivalence classes. [2025-03-17 14:37:50,092 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 258 of 258 statements. [2025-03-17 14:37:50,093 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 14:37:50,093 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:37:50,401 INFO L134 CoverageAnalysis]: Checked inductivity of 1164 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1160 trivial. 0 not checked. [2025-03-17 14:37:50,401 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:37:50,401 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1877588113] [2025-03-17 14:37:50,401 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1877588113] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:37:50,401 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1049155522] [2025-03-17 14:37:50,401 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 14:37:50,402 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:37:50,402 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:37:50,404 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 14:37:50,406 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-17 14:37:50,489 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 258 statements into 2 equivalence classes. [2025-03-17 14:37:50,571 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 258 of 258 statements. [2025-03-17 14:37:50,571 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 14:37:50,571 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:37:50,574 INFO L256 TraceCheckSpWp]: Trace formula consists of 800 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-17 14:37:50,580 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:37:50,746 INFO L134 CoverageAnalysis]: Checked inductivity of 1164 backedges. 0 proven. 145 refuted. 0 times theorem prover too weak. 1019 trivial. 0 not checked. [2025-03-17 14:37:50,746 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 14:37:50,998 INFO L134 CoverageAnalysis]: Checked inductivity of 1164 backedges. 0 proven. 145 refuted. 0 times theorem prover too weak. 1019 trivial. 0 not checked. [2025-03-17 14:37:50,998 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1049155522] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 14:37:50,998 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 14:37:50,998 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 12, 12] total 28 [2025-03-17 14:37:50,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [297934990] [2025-03-17 14:37:50,998 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 14:37:50,999 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-03-17 14:37:50,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:37:51,000 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-03-17 14:37:51,000 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=284, Invalid=472, Unknown=0, NotChecked=0, Total=756 [2025-03-17 14:37:51,000 INFO L87 Difference]: Start difference. First operand 261 states and 269 transitions. Second operand has 28 states, 28 states have (on average 5.0) internal successors, (140), 28 states have internal predecessors, (140), 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-17 14:37:51,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:37:51,790 INFO L93 Difference]: Finished difference Result 777 states and 889 transitions. [2025-03-17 14:37:51,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2025-03-17 14:37:51,791 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 5.0) internal successors, (140), 28 states have internal predecessors, (140), 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) Word has length 258 [2025-03-17 14:37:51,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:37:51,792 INFO L225 Difference]: With dead ends: 777 [2025-03-17 14:37:51,792 INFO L226 Difference]: Without dead ends: 548 [2025-03-17 14:37:51,793 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 519 GetRequests, 493 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=284, Invalid=472, Unknown=0, NotChecked=0, Total=756 [2025-03-17 14:37:51,794 INFO L435 NwaCegarLoop]: 11 mSDtfsCounter, 635 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 734 mSolverCounterSat, 409 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 635 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 1143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 409 IncrementalHoareTripleChecker+Valid, 734 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-17 14:37:51,794 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [635 Valid, 59 Invalid, 1143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [409 Valid, 734 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-17 14:37:51,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 548 states. [2025-03-17 14:37:51,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 548 to 548. [2025-03-17 14:37:51,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 548 states, 547 states have (on average 1.016453382084095) internal successors, (556), 547 states have internal predecessors, (556), 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-17 14:37:51,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 548 states to 548 states and 556 transitions. [2025-03-17 14:37:51,810 INFO L78 Accepts]: Start accepts. Automaton has 548 states and 556 transitions. Word has length 258 [2025-03-17 14:37:51,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:37:51,810 INFO L471 AbstractCegarLoop]: Abstraction has 548 states and 556 transitions. [2025-03-17 14:37:51,810 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 5.0) internal successors, (140), 28 states have internal predecessors, (140), 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-17 14:37:51,810 INFO L276 IsEmpty]: Start isEmpty. Operand 548 states and 556 transitions. [2025-03-17 14:37:51,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 548 [2025-03-17 14:37:51,820 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:37:51,820 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:37:51,828 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-17 14:37:52,021 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:37:52,022 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-03-17 14:37:52,022 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:37:52,022 INFO L85 PathProgramCache]: Analyzing trace with hash -253747289, now seen corresponding path program 1 times [2025-03-17 14:37:52,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:37:52,022 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1097638390] [2025-03-17 14:37:52,022 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:37:52,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:37:52,074 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 547 statements into 1 equivalence classes. [2025-03-17 14:37:52,153 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 547 of 547 statements. [2025-03-17 14:37:52,153 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:37:52,153 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:37:52,429 INFO L134 CoverageAnalysis]: Checked inductivity of 5725 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 5721 trivial. 0 not checked. [2025-03-17 14:37:52,430 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:37:52,430 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1097638390] [2025-03-17 14:37:52,430 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1097638390] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:37:52,430 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:37:52,430 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 14:37:52,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1240799786] [2025-03-17 14:37:52,430 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:37:52,431 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 14:37:52,431 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:37:52,431 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 14:37:52,431 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 14:37:52,431 INFO L87 Difference]: Start difference. First operand 548 states and 556 transitions. Second operand has 4 states, 3 states have (on average 14.333333333333334) internal successors, (43), 4 states have internal predecessors, (43), 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-17 14:37:52,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:37:52,450 INFO L93 Difference]: Finished difference Result 548 states and 556 transitions. [2025-03-17 14:37:52,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 14:37:52,451 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 14.333333333333334) internal successors, (43), 4 states have internal predecessors, (43), 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) Word has length 547 [2025-03-17 14:37:52,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:37:52,454 INFO L225 Difference]: With dead ends: 548 [2025-03-17 14:37:52,454 INFO L226 Difference]: Without dead ends: 0 [2025-03-17 14:37:52,455 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-17 14:37:52,456 INFO L435 NwaCegarLoop]: 34 mSDtfsCounter, 0 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 98 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-17 14:37:52,456 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 98 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 14:37:52,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-17 14:37:52,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-17 14:37:52,457 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-17 14:37:52,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-17 14:37:52,457 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 547 [2025-03-17 14:37:52,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:37:52,457 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-17 14:37:52,457 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 14.333333333333334) internal successors, (43), 4 states have internal predecessors, (43), 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-17 14:37:52,457 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-17 14:37:52,458 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-17 14:37:52,462 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 18 remaining) [2025-03-17 14:37:52,463 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 18 remaining) [2025-03-17 14:37:52,463 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 18 remaining) [2025-03-17 14:37:52,463 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 18 remaining) [2025-03-17 14:37:52,463 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 18 remaining) [2025-03-17 14:37:52,464 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 18 remaining) [2025-03-17 14:37:52,464 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 18 remaining) [2025-03-17 14:37:52,464 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 18 remaining) [2025-03-17 14:37:52,464 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 18 remaining) [2025-03-17 14:37:52,464 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 18 remaining) [2025-03-17 14:37:52,464 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 18 remaining) [2025-03-17 14:37:52,464 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 18 remaining) [2025-03-17 14:37:52,464 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 18 remaining) [2025-03-17 14:37:52,464 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 18 remaining) [2025-03-17 14:37:52,464 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 18 remaining) [2025-03-17 14:37:52,464 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 18 remaining) [2025-03-17 14:37:52,464 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 18 remaining) [2025-03-17 14:37:52,465 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 18 remaining) [2025-03-17 14:37:52,465 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-17 14:37:52,467 INFO L422 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1] [2025-03-17 14:37:52,469 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-03-17 14:37:52,533 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-17 14:37:52,544 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.03 02:37:52 BoogieIcfgContainer [2025-03-17 14:37:52,544 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-17 14:37:52,545 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-17 14:37:52,545 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-17 14:37:52,545 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-17 14:37:52,546 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 02:37:47" (3/4) ... [2025-03-17 14:37:52,548 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-17 14:37:52,556 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 10 nodes and edges [2025-03-17 14:37:52,556 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-03-17 14:37:52,556 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-17 14:37:52,556 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-17 14:37:52,621 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-17 14:37:52,622 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-17 14:37:52,622 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-17 14:37:52,622 INFO L158 Benchmark]: Toolchain (without parser) took 5681.31ms. Allocated memory was 142.6MB in the beginning and 427.8MB in the end (delta: 285.2MB). Free memory was 113.5MB in the beginning and 157.2MB in the end (delta: -43.8MB). Peak memory consumption was 240.2MB. Max. memory is 16.1GB. [2025-03-17 14:37:52,622 INFO L158 Benchmark]: CDTParser took 0.41ms. Allocated memory is still 201.3MB. Free memory is still 124.1MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 14:37:52,623 INFO L158 Benchmark]: CACSL2BoogieTranslator took 147.81ms. Allocated memory is still 142.6MB. Free memory was 113.5MB in the beginning and 102.5MB in the end (delta: 11.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 14:37:52,623 INFO L158 Benchmark]: Boogie Procedure Inliner took 23.01ms. Allocated memory is still 142.6MB. Free memory was 102.5MB in the beginning and 101.0MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 14:37:52,624 INFO L158 Benchmark]: Boogie Preprocessor took 22.77ms. Allocated memory is still 142.6MB. Free memory was 101.0MB in the beginning and 100.0MB in the end (delta: 986.3kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 14:37:52,624 INFO L158 Benchmark]: IcfgBuilder took 257.88ms. Allocated memory is still 142.6MB. Free memory was 100.0MB in the beginning and 85.2MB in the end (delta: 14.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-17 14:37:52,624 INFO L158 Benchmark]: TraceAbstraction took 5147.81ms. Allocated memory was 142.6MB in the beginning and 427.8MB in the end (delta: 285.2MB). Free memory was 84.7MB in the beginning and 161.6MB in the end (delta: -76.8MB). Peak memory consumption was 206.6MB. Max. memory is 16.1GB. [2025-03-17 14:37:52,625 INFO L158 Benchmark]: Witness Printer took 76.85ms. Allocated memory is still 427.8MB. Free memory was 161.6MB in the beginning and 157.2MB in the end (delta: 4.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 14:37:52,627 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.41ms. Allocated memory is still 201.3MB. Free memory is still 124.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 147.81ms. Allocated memory is still 142.6MB. Free memory was 113.5MB in the beginning and 102.5MB in the end (delta: 11.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 23.01ms. Allocated memory is still 142.6MB. Free memory was 102.5MB in the beginning and 101.0MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 22.77ms. Allocated memory is still 142.6MB. Free memory was 101.0MB in the beginning and 100.0MB in the end (delta: 986.3kB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 257.88ms. Allocated memory is still 142.6MB. Free memory was 100.0MB in the beginning and 85.2MB in the end (delta: 14.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 5147.81ms. Allocated memory was 142.6MB in the beginning and 427.8MB in the end (delta: 285.2MB). Free memory was 84.7MB in the beginning and 161.6MB in the end (delta: -76.8MB). Peak memory consumption was 206.6MB. Max. memory is 16.1GB. * Witness Printer took 76.85ms. Allocated memory is still 427.8MB. Free memory was 161.6MB in the beginning and 157.2MB in the end (delta: 4.3MB). 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: 57]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 57]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 54]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 54]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 49]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 49]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 44]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 44]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 39]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 39]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 34]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 34]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 29]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 29]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 24]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 24]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 19]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 19]: 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 1 procedures, 53 locations, 63 edges, 18 error locations. Started 1 CEGAR loops. OverallTime: 5.0s, OverallIterations: 8, TraceHistogramMax: 22, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 1.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1121 SdHoareTripleChecker+Valid, 1.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1121 mSDsluCounter, 403 SdHoareTripleChecker+Invalid, 1.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 238 mSDsCounter, 775 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1258 IncrementalHoareTripleChecker+Invalid, 2033 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 775 mSolverCounterUnsat, 165 mSDtfsCounter, 1258 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 836 GetRequests, 789 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=548occurred in iteration=7, InterpolantAutomatonStates: 63, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 8 MinimizatonAttempts, 16 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 1488 NumberOfCodeBlocks, 1392 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 1883 ConstructedInterpolants, 0 QuantifiedInterpolants, 2157 SizeOfPredicates, 0 NumberOfNonLiveVariables, 1306 ConjunctsInSsa, 21 ConjunctsInUnsatCore, 14 InterpolantComputations, 5 PerfectInterpolantSequences, 9597/9960 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 18 specifications checked. All of them hold - InvariantResult [Line: 22]: Location Invariant Derived location invariant: (0 < ((long long) i + 1)) - InvariantResult [Line: 17]: Location Invariant Derived location invariant: (0 < ((long long) i + 1)) - InvariantResult [Line: 47]: Location Invariant Derived location invariant: (0 < ((long long) i + 1)) - InvariantResult [Line: 27]: Location Invariant Derived location invariant: (0 < ((long long) i + 1)) - InvariantResult [Line: 52]: Location Invariant Derived location invariant: (0 < ((long long) i + 1)) - InvariantResult [Line: 32]: Location Invariant Derived location invariant: (0 < ((long long) i + 1)) - InvariantResult [Line: 57]: Location Invariant Derived location invariant: ((0 < x) || (x == 0)) - InvariantResult [Line: 42]: Location Invariant Derived location invariant: (0 < ((long long) i + 1)) - InvariantResult [Line: 37]: Location Invariant Derived location invariant: (0 < ((long long) i + 1)) RESULT: Ultimate proved your program to be correct! [2025-03-17 14:37:52,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