./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/recursive-simple/sum_25x0-1.c --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/recursive-simple/sum_25x0-1.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 8ec6e434f91e1569e6fad03794f07a751e615694ef413649174052dcc7984987 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 15:46:56,781 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 15:46:56,822 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-03-17 15:46:56,827 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 15:46:56,830 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 15:46:56,846 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 15:46:56,848 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 15:46:56,848 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 15:46:56,848 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 15:46:56,849 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 15:46:56,849 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 15:46:56,849 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 15:46:56,850 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 15:46:56,850 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 15:46:56,850 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 15:46:56,850 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 15:46:56,850 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 15:46:56,850 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 15:46:56,850 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 15:46:56,850 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 15:46:56,850 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 15:46:56,850 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 15:46:56,850 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 15:46:56,850 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 15:46:56,850 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-17 15:46:56,850 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-17 15:46:56,850 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 15:46:56,850 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 15:46:56,850 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 15:46:56,850 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 15:46:56,850 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 15:46:56,850 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 15:46:56,850 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 15:46:56,850 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 15:46:56,851 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 15:46:56,851 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 15:46:56,851 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 15:46:56,851 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 15:46:56,851 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 15:46:56,851 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 15:46:56,851 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 15:46:56,851 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 15:46:56,851 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 15:46:56,851 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 15:46:56,851 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 15:46:56,851 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 -> 8ec6e434f91e1569e6fad03794f07a751e615694ef413649174052dcc7984987 [2025-03-17 15:46:57,072 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 15:46:57,080 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 15:46:57,082 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 15:46:57,082 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 15:46:57,082 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 15:46:57,083 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/recursive-simple/sum_25x0-1.c [2025-03-17 15:46:58,173 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/81c8407a6/28337b49e7874603a235ca71837cb393/FLAG22cfdc5e6 [2025-03-17 15:46:58,392 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 15:46:58,392 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive-simple/sum_25x0-1.c [2025-03-17 15:46:58,398 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/81c8407a6/28337b49e7874603a235ca71837cb393/FLAG22cfdc5e6 [2025-03-17 15:46:58,435 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/81c8407a6/28337b49e7874603a235ca71837cb393 [2025-03-17 15:46:58,437 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 15:46:58,440 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 15:46:58,441 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 15:46:58,442 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 15:46:58,445 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 15:46:58,446 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 03:46:58" (1/1) ... [2025-03-17 15:46:58,446 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7f1027a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:46:58, skipping insertion in model container [2025-03-17 15:46:58,448 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 03:46:58" (1/1) ... [2025-03-17 15:46:58,458 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 15:46:58,553 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 15:46:58,560 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 15:46:58,570 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 15:46:58,580 INFO L204 MainTranslator]: Completed translation [2025-03-17 15:46:58,581 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:46:58 WrapperNode [2025-03-17 15:46:58,581 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 15:46:58,582 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 15:46:58,583 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 15:46:58,583 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 15:46:58,587 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:46:58" (1/1) ... [2025-03-17 15:46:58,592 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:46:58" (1/1) ... [2025-03-17 15:46:58,601 INFO L138 Inliner]: procedures = 12, calls = 10, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 22 [2025-03-17 15:46:58,601 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 15:46:58,602 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 15:46:58,602 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 15:46:58,602 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 15:46:58,607 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:46:58" (1/1) ... [2025-03-17 15:46:58,607 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:46:58" (1/1) ... [2025-03-17 15:46:58,609 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:46:58" (1/1) ... [2025-03-17 15:46:58,617 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-17 15:46:58,619 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:46:58" (1/1) ... [2025-03-17 15:46:58,619 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:46:58" (1/1) ... [2025-03-17 15:46:58,620 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:46:58" (1/1) ... [2025-03-17 15:46:58,621 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:46:58" (1/1) ... [2025-03-17 15:46:58,622 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:46:58" (1/1) ... [2025-03-17 15:46:58,623 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:46:58" (1/1) ... [2025-03-17 15:46:58,623 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 15:46:58,625 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 15:46:58,625 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 15:46:58,625 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 15:46:58,626 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:46:58" (1/1) ... [2025-03-17 15:46:58,631 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 15:46:58,639 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 15:46:58,651 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 15:46:58,655 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 15:46:58,672 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 15:46:58,672 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 15:46:58,672 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 15:46:58,672 INFO L130 BoogieDeclarations]: Found specification of procedure sum [2025-03-17 15:46:58,672 INFO L138 BoogieDeclarations]: Found implementation of procedure sum [2025-03-17 15:46:58,672 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 15:46:58,707 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 15:46:58,708 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 15:46:58,819 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L9: havoc #t~ret4; [2025-03-17 15:46:58,827 INFO L? ?]: Removed 19 outVars from TransFormulas that were not future-live. [2025-03-17 15:46:58,827 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 15:46:58,837 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 15:46:58,837 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 15:46:58,838 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 03:46:58 BoogieIcfgContainer [2025-03-17 15:46:58,838 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 15:46:58,840 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 15:46:58,841 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 15:46:58,844 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 15:46:58,844 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 03:46:58" (1/3) ... [2025-03-17 15:46:58,845 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@427331e0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 03:46:58, skipping insertion in model container [2025-03-17 15:46:58,845 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:46:58" (2/3) ... [2025-03-17 15:46:58,846 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@427331e0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 03:46:58, skipping insertion in model container [2025-03-17 15:46:58,846 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 03:46:58" (3/3) ... [2025-03-17 15:46:58,847 INFO L128 eAbstractionObserver]: Analyzing ICFG sum_25x0-1.c [2025-03-17 15:46:58,858 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 15:46:58,860 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG sum_25x0-1.c that has 2 procedures, 29 locations, 1 initial locations, 0 loop locations, and 8 error locations. [2025-03-17 15:46:58,901 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 15:46:58,908 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;@3cd25833, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 15:46:58,908 INFO L334 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2025-03-17 15:46:58,911 INFO L276 IsEmpty]: Start isEmpty. Operand has 29 states, 17 states have (on average 1.588235294117647) internal successors, (27), 25 states have internal predecessors, (27), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-17 15:46:58,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-03-17 15:46:58,914 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:46:58,915 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-03-17 15:46:58,915 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting sumErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, sumErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-17 15:46:58,919 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:46:58,919 INFO L85 PathProgramCache]: Analyzing trace with hash 37862298, now seen corresponding path program 1 times [2025-03-17 15:46:58,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:46:58,925 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [6579112] [2025-03-17 15:46:58,926 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:46:58,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:46:58,967 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-17 15:46:58,981 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-17 15:46:58,982 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:46:58,982 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:46:59,065 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 15:46:59,065 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:46:59,065 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [6579112] [2025-03-17 15:46:59,065 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [6579112] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 15:46:59,066 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 15:46:59,066 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 15:46:59,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1838507666] [2025-03-17 15:46:59,068 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 15:46:59,071 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 15:46:59,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:46:59,084 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 15:46:59,085 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 15:46:59,086 INFO L87 Difference]: Start difference. First operand has 29 states, 17 states have (on average 1.588235294117647) internal successors, (27), 25 states have internal predecessors, (27), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 5 states, 4 states have (on average 1.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 15:46:59,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:46:59,164 INFO L93 Difference]: Finished difference Result 58 states and 61 transitions. [2025-03-17 15:46:59,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 15:46:59,166 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2025-03-17 15:46:59,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:46:59,169 INFO L225 Difference]: With dead ends: 58 [2025-03-17 15:46:59,170 INFO L226 Difference]: Without dead ends: 38 [2025-03-17 15:46:59,171 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-17 15:46:59,173 INFO L435 NwaCegarLoop]: 20 mSDtfsCounter, 23 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 15:46:59,174 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 69 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 15:46:59,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2025-03-17 15:46:59,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 35. [2025-03-17 15:46:59,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 22 states have (on average 1.5) internal successors, (33), 29 states have internal predecessors, (33), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-17 15:46:59,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 39 transitions. [2025-03-17 15:46:59,197 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 39 transitions. Word has length 5 [2025-03-17 15:46:59,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:46:59,197 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 39 transitions. [2025-03-17 15:46:59,197 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 15:46:59,197 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2025-03-17 15:46:59,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-03-17 15:46:59,197 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:46:59,197 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-17 15:46:59,198 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-17 15:46:59,198 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting sumErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, sumErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-17 15:46:59,198 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:46:59,198 INFO L85 PathProgramCache]: Analyzing trace with hash 1173732532, now seen corresponding path program 1 times [2025-03-17 15:46:59,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:46:59,199 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1419600216] [2025-03-17 15:46:59,199 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:46:59,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:46:59,202 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-17 15:46:59,205 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-17 15:46:59,205 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:46:59,205 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:46:59,239 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 15:46:59,240 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:46:59,240 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1419600216] [2025-03-17 15:46:59,240 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1419600216] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 15:46:59,240 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 15:46:59,240 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 15:46:59,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1771575354] [2025-03-17 15:46:59,240 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 15:46:59,241 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 15:46:59,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:46:59,241 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 15:46:59,241 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 15:46:59,242 INFO L87 Difference]: Start difference. First operand 35 states and 39 transitions. Second operand has 5 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 15:46:59,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:46:59,309 INFO L93 Difference]: Finished difference Result 37 states and 42 transitions. [2025-03-17 15:46:59,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 15:46:59,309 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2025-03-17 15:46:59,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:46:59,311 INFO L225 Difference]: With dead ends: 37 [2025-03-17 15:46:59,311 INFO L226 Difference]: Without dead ends: 36 [2025-03-17 15:46:59,311 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-17 15:46:59,311 INFO L435 NwaCegarLoop]: 11 mSDtfsCounter, 27 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 15:46:59,311 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 25 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 15:46:59,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2025-03-17 15:46:59,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 34. [2025-03-17 15:46:59,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 22 states have (on average 1.4090909090909092) internal successors, (31), 28 states have internal predecessors, (31), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-17 15:46:59,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 37 transitions. [2025-03-17 15:46:59,317 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 37 transitions. Word has length 6 [2025-03-17 15:46:59,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:46:59,317 INFO L471 AbstractCegarLoop]: Abstraction has 34 states and 37 transitions. [2025-03-17 15:46:59,317 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 15:46:59,317 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 37 transitions. [2025-03-17 15:46:59,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-03-17 15:46:59,318 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:46:59,318 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-17 15:46:59,319 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 15:46:59,319 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting sumErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, sumErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-17 15:46:59,319 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:46:59,322 INFO L85 PathProgramCache]: Analyzing trace with hash 2025970114, now seen corresponding path program 1 times [2025-03-17 15:46:59,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:46:59,322 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1944669347] [2025-03-17 15:46:59,322 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:46:59,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:46:59,325 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-17 15:46:59,332 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-17 15:46:59,335 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:46:59,335 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:46:59,371 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 15:46:59,372 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:46:59,372 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1944669347] [2025-03-17 15:46:59,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1944669347] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 15:46:59,372 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 15:46:59,372 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 15:46:59,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [802317120] [2025-03-17 15:46:59,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 15:46:59,372 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 15:46:59,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:46:59,373 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 15:46:59,373 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 15:46:59,373 INFO L87 Difference]: Start difference. First operand 34 states and 37 transitions. Second operand has 5 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 15:46:59,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:46:59,424 INFO L93 Difference]: Finished difference Result 36 states and 40 transitions. [2025-03-17 15:46:59,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 15:46:59,425 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2025-03-17 15:46:59,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:46:59,425 INFO L225 Difference]: With dead ends: 36 [2025-03-17 15:46:59,425 INFO L226 Difference]: Without dead ends: 35 [2025-03-17 15:46:59,425 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-17 15:46:59,426 INFO L435 NwaCegarLoop]: 12 mSDtfsCounter, 24 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 15:46:59,426 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 27 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 15:46:59,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2025-03-17 15:46:59,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 33. [2025-03-17 15:46:59,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 22 states have (on average 1.3181818181818181) internal successors, (29), 27 states have internal predecessors, (29), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-17 15:46:59,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 35 transitions. [2025-03-17 15:46:59,434 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 35 transitions. Word has length 7 [2025-03-17 15:46:59,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:46:59,434 INFO L471 AbstractCegarLoop]: Abstraction has 33 states and 35 transitions. [2025-03-17 15:46:59,434 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 15:46:59,434 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 35 transitions. [2025-03-17 15:46:59,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-03-17 15:46:59,435 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:46:59,435 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 15:46:59,435 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 15:46:59,435 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting sumErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, sumErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-17 15:46:59,435 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:46:59,435 INFO L85 PathProgramCache]: Analyzing trace with hash -1619435918, now seen corresponding path program 1 times [2025-03-17 15:46:59,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:46:59,435 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1736928398] [2025-03-17 15:46:59,435 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:46:59,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:46:59,441 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-17 15:46:59,444 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-17 15:46:59,444 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:46:59,444 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:46:59,482 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 15:46:59,483 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:46:59,483 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1736928398] [2025-03-17 15:46:59,483 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1736928398] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 15:46:59,483 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 15:46:59,483 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 15:46:59,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1028338379] [2025-03-17 15:46:59,483 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 15:46:59,484 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 15:46:59,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:46:59,484 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 15:46:59,484 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 15:46:59,485 INFO L87 Difference]: Start difference. First operand 33 states and 35 transitions. Second operand has 5 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 15:46:59,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:46:59,539 INFO L93 Difference]: Finished difference Result 34 states and 35 transitions. [2025-03-17 15:46:59,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 15:46:59,540 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2025-03-17 15:46:59,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:46:59,541 INFO L225 Difference]: With dead ends: 34 [2025-03-17 15:46:59,541 INFO L226 Difference]: Without dead ends: 33 [2025-03-17 15:46:59,542 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-17 15:46:59,542 INFO L435 NwaCegarLoop]: 18 mSDtfsCounter, 13 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 15:46:59,544 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 61 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 15:46:59,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2025-03-17 15:46:59,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2025-03-17 15:46:59,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 27 states have internal predecessors, (28), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-17 15:46:59,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 34 transitions. [2025-03-17 15:46:59,552 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 34 transitions. Word has length 8 [2025-03-17 15:46:59,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:46:59,552 INFO L471 AbstractCegarLoop]: Abstraction has 33 states and 34 transitions. [2025-03-17 15:46:59,552 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 15:46:59,552 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 34 transitions. [2025-03-17 15:46:59,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-03-17 15:46:59,552 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:46:59,552 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 15:46:59,552 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 15:46:59,552 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting sumErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, sumErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-17 15:46:59,553 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:46:59,553 INFO L85 PathProgramCache]: Analyzing trace with hash 1843508769, now seen corresponding path program 1 times [2025-03-17 15:46:59,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:46:59,553 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1757199820] [2025-03-17 15:46:59,553 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:46:59,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:46:59,559 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-17 15:46:59,563 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-17 15:46:59,565 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:46:59,565 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:46:59,641 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 15:46:59,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:46:59,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1757199820] [2025-03-17 15:46:59,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1757199820] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 15:46:59,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [400931887] [2025-03-17 15:46:59,642 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:46:59,642 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:46:59,642 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 15:46:59,644 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 15:46:59,645 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 15:46:59,664 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-17 15:46:59,670 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-17 15:46:59,670 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:46:59,670 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:46:59,671 INFO L256 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-17 15:46:59,673 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 15:46:59,706 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 15:46:59,707 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 15:46:59,769 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 15:46:59,769 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [400931887] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 15:46:59,769 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 15:46:59,769 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2025-03-17 15:46:59,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [70921227] [2025-03-17 15:46:59,769 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 15:46:59,770 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-17 15:46:59,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:46:59,770 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-17 15:46:59,770 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2025-03-17 15:46:59,770 INFO L87 Difference]: Start difference. First operand 33 states and 34 transitions. Second operand has 12 states, 10 states have (on average 1.9) internal successors, (19), 7 states have internal predecessors, (19), 4 states have call successors, (4), 4 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 15:46:59,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:46:59,894 INFO L93 Difference]: Finished difference Result 83 states and 92 transitions. [2025-03-17 15:46:59,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-17 15:46:59,894 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 1.9) internal successors, (19), 7 states have internal predecessors, (19), 4 states have call successors, (4), 4 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2025-03-17 15:46:59,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:46:59,895 INFO L225 Difference]: With dead ends: 83 [2025-03-17 15:46:59,895 INFO L226 Difference]: Without dead ends: 67 [2025-03-17 15:46:59,895 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=68, Invalid=172, Unknown=0, NotChecked=0, Total=240 [2025-03-17 15:46:59,895 INFO L435 NwaCegarLoop]: 22 mSDtfsCounter, 72 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 140 SdHoareTripleChecker+Invalid, 130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 15:46:59,896 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 140 Invalid, 130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 15:46:59,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2025-03-17 15:46:59,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 62. [2025-03-17 15:46:59,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 46 states have (on average 1.173913043478261) internal successors, (54), 50 states have internal predecessors, (54), 6 states have call successors, (6), 5 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-17 15:46:59,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 66 transitions. [2025-03-17 15:46:59,901 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 66 transitions. Word has length 12 [2025-03-17 15:46:59,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:46:59,901 INFO L471 AbstractCegarLoop]: Abstraction has 62 states and 66 transitions. [2025-03-17 15:46:59,901 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 1.9) internal successors, (19), 7 states have internal predecessors, (19), 4 states have call successors, (4), 4 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 15:46:59,901 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 66 transitions. [2025-03-17 15:46:59,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-03-17 15:46:59,902 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:46:59,902 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2025-03-17 15:46:59,908 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-17 15:47:00,102 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:47:00,102 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting sumErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, sumErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-17 15:47:00,103 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:47:00,103 INFO L85 PathProgramCache]: Analyzing trace with hash 224166539, now seen corresponding path program 1 times [2025-03-17 15:47:00,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:47:00,103 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1080594809] [2025-03-17 15:47:00,103 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:47:00,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:47:00,106 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-17 15:47:00,109 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-17 15:47:00,109 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:47:00,109 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:47:00,169 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 15:47:00,170 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:47:00,170 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1080594809] [2025-03-17 15:47:00,170 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1080594809] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 15:47:00,170 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [151642433] [2025-03-17 15:47:00,170 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:47:00,170 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:47:00,170 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 15:47:00,172 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 15:47:00,173 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 15:47:00,193 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-17 15:47:00,200 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-17 15:47:00,201 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:47:00,201 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:47:00,201 INFO L256 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-17 15:47:00,202 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 15:47:00,220 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 15:47:00,220 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 15:47:00,273 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 15:47:00,273 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [151642433] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 15:47:00,273 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 15:47:00,273 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2025-03-17 15:47:00,273 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1414485313] [2025-03-17 15:47:00,274 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 15:47:00,274 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-17 15:47:00,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:47:00,274 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-17 15:47:00,274 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2025-03-17 15:47:00,274 INFO L87 Difference]: Start difference. First operand 62 states and 66 transitions. Second operand has 12 states, 9 states have (on average 2.888888888888889) internal successors, (26), 7 states have internal predecessors, (26), 4 states have call successors, (4), 4 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 15:47:00,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:47:00,376 INFO L93 Difference]: Finished difference Result 65 states and 69 transitions. [2025-03-17 15:47:00,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-17 15:47:00,376 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 9 states have (on average 2.888888888888889) internal successors, (26), 7 states have internal predecessors, (26), 4 states have call successors, (4), 4 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2025-03-17 15:47:00,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:47:00,377 INFO L225 Difference]: With dead ends: 65 [2025-03-17 15:47:00,377 INFO L226 Difference]: Without dead ends: 64 [2025-03-17 15:47:00,377 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=68, Invalid=172, Unknown=0, NotChecked=0, Total=240 [2025-03-17 15:47:00,377 INFO L435 NwaCegarLoop]: 23 mSDtfsCounter, 58 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 15:47:00,377 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 134 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 15:47:00,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2025-03-17 15:47:00,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 62. [2025-03-17 15:47:00,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 46 states have (on average 1.108695652173913) internal successors, (51), 50 states have internal predecessors, (51), 6 states have call successors, (6), 5 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-17 15:47:00,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 63 transitions. [2025-03-17 15:47:00,386 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 63 transitions. Word has length 15 [2025-03-17 15:47:00,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:47:00,386 INFO L471 AbstractCegarLoop]: Abstraction has 62 states and 63 transitions. [2025-03-17 15:47:00,388 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 9 states have (on average 2.888888888888889) internal successors, (26), 7 states have internal predecessors, (26), 4 states have call successors, (4), 4 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 15:47:00,388 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 63 transitions. [2025-03-17 15:47:00,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-03-17 15:47:00,389 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:47:00,389 INFO L218 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2025-03-17 15:47:00,395 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-17 15:47:00,589 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 15:47:00,589 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting sumErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, sumErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-17 15:47:00,590 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:47:00,590 INFO L85 PathProgramCache]: Analyzing trace with hash -414165030, now seen corresponding path program 2 times [2025-03-17 15:47:00,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:47:00,590 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1964361892] [2025-03-17 15:47:00,590 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 15:47:00,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:47:00,594 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 33 statements into 2 equivalence classes. [2025-03-17 15:47:00,600 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 33 of 33 statements. [2025-03-17 15:47:00,600 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 15:47:00,600 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:47:00,751 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 27 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 15:47:00,751 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:47:00,752 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1964361892] [2025-03-17 15:47:00,752 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1964361892] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 15:47:00,752 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [415333087] [2025-03-17 15:47:00,752 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 15:47:00,752 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:47:00,752 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 15:47:00,754 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 15:47:00,755 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 15:47:00,774 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 33 statements into 2 equivalence classes. [2025-03-17 15:47:00,783 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 33 of 33 statements. [2025-03-17 15:47:00,784 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 15:47:00,784 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:47:00,784 INFO L256 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-17 15:47:00,785 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 15:47:00,957 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 15:47:00,958 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 15:47:01,197 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 15:47:01,197 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [415333087] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 15:47:01,198 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 15:47:01,198 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12, 12] total 34 [2025-03-17 15:47:01,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2091761708] [2025-03-17 15:47:01,198 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 15:47:01,198 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2025-03-17 15:47:01,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:47:01,199 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2025-03-17 15:47:01,199 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=170, Invalid=1020, Unknown=0, NotChecked=0, Total=1190 [2025-03-17 15:47:01,199 INFO L87 Difference]: Start difference. First operand 62 states and 63 transitions. Second operand has 35 states, 32 states have (on average 2.59375) internal successors, (83), 19 states have internal predecessors, (83), 15 states have call successors, (15), 15 states have call predecessors, (15), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 15:47:01,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:47:01,963 INFO L93 Difference]: Finished difference Result 152 states and 166 transitions. [2025-03-17 15:47:01,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2025-03-17 15:47:01,963 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 32 states have (on average 2.59375) internal successors, (83), 19 states have internal predecessors, (83), 15 states have call successors, (15), 15 states have call predecessors, (15), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2025-03-17 15:47:01,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:47:01,964 INFO L225 Difference]: With dead ends: 152 [2025-03-17 15:47:01,964 INFO L226 Difference]: Without dead ends: 128 [2025-03-17 15:47:01,966 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 947 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=824, Invalid=3466, Unknown=0, NotChecked=0, Total=4290 [2025-03-17 15:47:01,966 INFO L435 NwaCegarLoop]: 28 mSDtfsCounter, 622 mSDsluCounter, 212 mSDsCounter, 0 mSdLazyCounter, 552 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 622 SdHoareTripleChecker+Valid, 240 SdHoareTripleChecker+Invalid, 620 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 552 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 15:47:01,968 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [622 Valid, 240 Invalid, 620 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 552 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 15:47:01,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2025-03-17 15:47:01,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 120. [2025-03-17 15:47:01,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 94 states have (on average 1.0957446808510638) internal successors, (103), 96 states have internal predecessors, (103), 12 states have call successors, (12), 11 states have call predecessors, (12), 11 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-03-17 15:47:01,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 127 transitions. [2025-03-17 15:47:01,985 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 127 transitions. Word has length 33 [2025-03-17 15:47:01,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:47:01,987 INFO L471 AbstractCegarLoop]: Abstraction has 120 states and 127 transitions. [2025-03-17 15:47:01,988 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 32 states have (on average 2.59375) internal successors, (83), 19 states have internal predecessors, (83), 15 states have call successors, (15), 15 states have call predecessors, (15), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 15:47:01,988 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 127 transitions. [2025-03-17 15:47:01,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-03-17 15:47:01,988 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:47:01,988 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 1, 1, 1] [2025-03-17 15:47:01,994 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-17 15:47:02,188 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 15:47:02,189 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting sumErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, sumErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-17 15:47:02,189 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:47:02,189 INFO L85 PathProgramCache]: Analyzing trace with hash 1051875890, now seen corresponding path program 2 times [2025-03-17 15:47:02,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:47:02,189 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1322099281] [2025-03-17 15:47:02,189 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 15:47:02,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:47:02,193 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 36 statements into 2 equivalence classes. [2025-03-17 15:47:02,199 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 36 of 36 statements. [2025-03-17 15:47:02,200 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 15:47:02,200 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:47:02,315 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 15:47:02,316 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:47:02,316 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1322099281] [2025-03-17 15:47:02,316 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1322099281] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 15:47:02,316 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1528729184] [2025-03-17 15:47:02,316 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 15:47:02,316 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:47:02,316 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 15:47:02,317 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 15:47:02,318 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-17 15:47:02,335 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 36 statements into 2 equivalence classes. [2025-03-17 15:47:02,346 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 36 of 36 statements. [2025-03-17 15:47:02,346 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 15:47:02,346 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:47:02,347 INFO L256 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-17 15:47:02,349 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 15:47:02,396 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 15:47:02,396 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 15:47:02,533 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 15:47:02,533 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1528729184] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 15:47:02,533 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 15:47:02,533 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 22 [2025-03-17 15:47:02,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1385311433] [2025-03-17 15:47:02,534 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 15:47:02,534 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-03-17 15:47:02,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:47:02,534 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-03-17 15:47:02,534 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=416, Unknown=0, NotChecked=0, Total=552 [2025-03-17 15:47:02,535 INFO L87 Difference]: Start difference. First operand 120 states and 127 transitions. Second operand has 24 states, 21 states have (on average 2.9523809523809526) internal successors, (62), 13 states have internal predecessors, (62), 10 states have call successors, (10), 10 states have call predecessors, (10), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 15:47:02,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:47:02,728 INFO L93 Difference]: Finished difference Result 123 states and 130 transitions. [2025-03-17 15:47:02,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-03-17 15:47:02,729 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 21 states have (on average 2.9523809523809526) internal successors, (62), 13 states have internal predecessors, (62), 10 states have call successors, (10), 10 states have call predecessors, (10), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2025-03-17 15:47:02,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:47:02,730 INFO L225 Difference]: With dead ends: 123 [2025-03-17 15:47:02,730 INFO L226 Difference]: Without dead ends: 122 [2025-03-17 15:47:02,731 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 180 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=311, Invalid=811, Unknown=0, NotChecked=0, Total=1122 [2025-03-17 15:47:02,731 INFO L435 NwaCegarLoop]: 34 mSDtfsCounter, 168 mSDsluCounter, 212 mSDsCounter, 0 mSdLazyCounter, 169 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 170 SdHoareTripleChecker+Valid, 246 SdHoareTripleChecker+Invalid, 192 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 15:47:02,731 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [170 Valid, 246 Invalid, 192 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 169 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 15:47:02,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2025-03-17 15:47:02,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 120. [2025-03-17 15:47:02,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 94 states have (on average 1.0319148936170213) internal successors, (97), 96 states have internal predecessors, (97), 12 states have call successors, (12), 11 states have call predecessors, (12), 11 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-03-17 15:47:02,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 121 transitions. [2025-03-17 15:47:02,746 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 121 transitions. Word has length 36 [2025-03-17 15:47:02,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:47:02,746 INFO L471 AbstractCegarLoop]: Abstraction has 120 states and 121 transitions. [2025-03-17 15:47:02,746 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 21 states have (on average 2.9523809523809526) internal successors, (62), 13 states have internal predecessors, (62), 10 states have call successors, (10), 10 states have call predecessors, (10), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 15:47:02,746 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 121 transitions. [2025-03-17 15:47:02,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-03-17 15:47:02,748 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:47:02,748 INFO L218 NwaCegarLoop]: trace histogram [11, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1] [2025-03-17 15:47:02,755 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-17 15:47:02,948 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:47:02,949 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting sumErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, sumErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-17 15:47:02,949 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:47:02,949 INFO L85 PathProgramCache]: Analyzing trace with hash 500246771, now seen corresponding path program 1 times [2025-03-17 15:47:02,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:47:02,949 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [154157397] [2025-03-17 15:47:02,949 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:47:02,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:47:02,953 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-03-17 15:47:02,969 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-03-17 15:47:02,970 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:47:02,970 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:47:03,311 INFO L134 CoverageAnalysis]: Checked inductivity of 335 backedges. 0 proven. 335 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 15:47:03,311 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:47:03,311 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [154157397] [2025-03-17 15:47:03,311 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [154157397] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 15:47:03,311 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1964302016] [2025-03-17 15:47:03,312 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:47:03,312 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:47:03,312 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 15:47:03,313 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 15:47:03,315 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-17 15:47:03,335 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-03-17 15:47:03,351 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-03-17 15:47:03,351 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:47:03,351 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:47:03,352 INFO L256 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-03-17 15:47:03,354 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 15:47:03,833 INFO L134 CoverageAnalysis]: Checked inductivity of 335 backedges. 0 proven. 335 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 15:47:03,834 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 15:47:04,438 INFO L134 CoverageAnalysis]: Checked inductivity of 335 backedges. 0 proven. 335 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 15:47:04,438 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1964302016] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 15:47:04,438 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 15:47:04,439 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24, 24] total 71 [2025-03-17 15:47:04,439 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [877481226] [2025-03-17 15:47:04,439 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 15:47:04,439 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 72 states [2025-03-17 15:47:04,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:47:04,440 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2025-03-17 15:47:04,442 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=714, Invalid=4398, Unknown=0, NotChecked=0, Total=5112 [2025-03-17 15:47:04,442 INFO L87 Difference]: Start difference. First operand 120 states and 121 transitions. Second operand has 72 states, 69 states have (on average 2.7971014492753623) internal successors, (193), 38 states have internal predecessors, (193), 33 states have call successors, (33), 33 states have call predecessors, (33), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 15:47:05,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:47:05,498 INFO L93 Difference]: Finished difference Result 294 states and 318 transitions. [2025-03-17 15:47:05,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2025-03-17 15:47:05,499 INFO L78 Accepts]: Start accepts. Automaton has has 72 states, 69 states have (on average 2.7971014492753623) internal successors, (193), 38 states have internal predecessors, (193), 33 states have call successors, (33), 33 states have call predecessors, (33), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 76 [2025-03-17 15:47:05,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:47:05,502 INFO L225 Difference]: With dead ends: 294 [2025-03-17 15:47:05,502 INFO L226 Difference]: Without dead ends: 253 [2025-03-17 15:47:05,505 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 208 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2468 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=2028, Invalid=9102, Unknown=0, NotChecked=0, Total=11130 [2025-03-17 15:47:05,506 INFO L435 NwaCegarLoop]: 55 mSDtfsCounter, 650 mSDsluCounter, 791 mSDsCounter, 0 mSdLazyCounter, 789 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 651 SdHoareTripleChecker+Valid, 846 SdHoareTripleChecker+Invalid, 861 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 789 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 15:47:05,507 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [651 Valid, 846 Invalid, 861 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 789 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 15:47:05,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2025-03-17 15:47:05,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 240. [2025-03-17 15:47:05,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 240 states, 190 states have (on average 1.0736842105263158) internal successors, (204), 192 states have internal predecessors, (204), 24 states have call successors, (24), 23 states have call predecessors, (24), 23 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2025-03-17 15:47:05,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 252 transitions. [2025-03-17 15:47:05,524 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 252 transitions. Word has length 76 [2025-03-17 15:47:05,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:47:05,525 INFO L471 AbstractCegarLoop]: Abstraction has 240 states and 252 transitions. [2025-03-17 15:47:05,525 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 72 states, 69 states have (on average 2.7971014492753623) internal successors, (193), 38 states have internal predecessors, (193), 33 states have call successors, (33), 33 states have call predecessors, (33), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 15:47:05,525 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 252 transitions. [2025-03-17 15:47:05,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2025-03-17 15:47:05,526 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:47:05,526 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 12, 12, 11, 11, 1, 1, 1] [2025-03-17 15:47:05,532 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-17 15:47:05,726 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:47:05,727 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting sumErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, sumErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-17 15:47:05,727 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:47:05,727 INFO L85 PathProgramCache]: Analyzing trace with hash -497378005, now seen corresponding path program 3 times [2025-03-17 15:47:05,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:47:05,727 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1437501517] [2025-03-17 15:47:05,727 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-17 15:47:05,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:47:05,732 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 85 statements into 12 equivalence classes. [2025-03-17 15:47:05,741 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) and asserted 85 of 85 statements. [2025-03-17 15:47:05,741 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2025-03-17 15:47:05,741 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:47:06,129 INFO L134 CoverageAnalysis]: Checked inductivity of 451 backedges. 0 proven. 451 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 15:47:06,130 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:47:06,130 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1437501517] [2025-03-17 15:47:06,130 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1437501517] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 15:47:06,130 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [130327602] [2025-03-17 15:47:06,130 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-17 15:47:06,130 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:47:06,130 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 15:47:06,132 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 15:47:06,133 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-17 15:47:06,158 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 85 statements into 12 equivalence classes. [2025-03-17 15:47:06,181 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) and asserted 85 of 85 statements. [2025-03-17 15:47:06,181 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2025-03-17 15:47:06,181 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:47:06,182 INFO L256 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-03-17 15:47:06,184 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 15:47:06,267 INFO L134 CoverageAnalysis]: Checked inductivity of 451 backedges. 0 proven. 451 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 15:47:06,268 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 15:47:06,733 INFO L134 CoverageAnalysis]: Checked inductivity of 451 backedges. 0 proven. 451 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 15:47:06,733 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [130327602] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 15:47:06,733 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 15:47:06,733 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 50 [2025-03-17 15:47:06,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1892011960] [2025-03-17 15:47:06,733 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 15:47:06,733 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2025-03-17 15:47:06,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:47:06,734 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2025-03-17 15:47:06,734 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=654, Invalid=1998, Unknown=0, NotChecked=0, Total=2652 [2025-03-17 15:47:06,735 INFO L87 Difference]: Start difference. First operand 240 states and 252 transitions. Second operand has 52 states, 49 states have (on average 2.979591836734694) internal successors, (146), 27 states have internal predecessors, (146), 24 states have call successors, (24), 24 states have call predecessors, (24), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 15:47:07,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:47:07,356 INFO L93 Difference]: Finished difference Result 273 states and 289 transitions. [2025-03-17 15:47:07,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2025-03-17 15:47:07,356 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 49 states have (on average 2.979591836734694) internal successors, (146), 27 states have internal predecessors, (146), 24 states have call successors, (24), 24 states have call predecessors, (24), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 85 [2025-03-17 15:47:07,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:47:07,358 INFO L225 Difference]: With dead ends: 273 [2025-03-17 15:47:07,358 INFO L226 Difference]: Without dead ends: 272 [2025-03-17 15:47:07,360 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 217 GetRequests, 143 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1104 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1578, Invalid=4122, Unknown=0, NotChecked=0, Total=5700 [2025-03-17 15:47:07,360 INFO L435 NwaCegarLoop]: 54 mSDtfsCounter, 438 mSDsluCounter, 533 mSDsCounter, 0 mSdLazyCounter, 435 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 440 SdHoareTripleChecker+Valid, 587 SdHoareTripleChecker+Invalid, 488 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 435 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 15:47:07,360 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [440 Valid, 587 Invalid, 488 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 435 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 15:47:07,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2025-03-17 15:47:07,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 264. [2025-03-17 15:47:07,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 264 states, 210 states have (on average 1.0333333333333334) internal successors, (217), 212 states have internal predecessors, (217), 26 states have call successors, (26), 25 states have call predecessors, (26), 25 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2025-03-17 15:47:07,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 269 transitions. [2025-03-17 15:47:07,380 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 269 transitions. Word has length 85 [2025-03-17 15:47:07,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:47:07,381 INFO L471 AbstractCegarLoop]: Abstraction has 264 states and 269 transitions. [2025-03-17 15:47:07,381 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 49 states have (on average 2.979591836734694) internal successors, (146), 27 states have internal predecessors, (146), 24 states have call successors, (24), 24 states have call predecessors, (24), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 15:47:07,381 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 269 transitions. [2025-03-17 15:47:07,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2025-03-17 15:47:07,382 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:47:07,382 INFO L218 NwaCegarLoop]: trace histogram [23, 22, 22, 22, 22, 22, 22, 1, 1, 1, 1, 1] [2025-03-17 15:47:07,389 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-17 15:47:07,583 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:47:07,583 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting sumErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, sumErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-17 15:47:07,584 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:47:07,584 INFO L85 PathProgramCache]: Analyzing trace with hash 294984755, now seen corresponding path program 2 times [2025-03-17 15:47:07,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:47:07,584 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [827353878] [2025-03-17 15:47:07,584 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 15:47:07,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:47:07,591 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 160 statements into 2 equivalence classes. [2025-03-17 15:47:07,603 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 160 of 160 statements. [2025-03-17 15:47:07,604 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 15:47:07,604 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:47:07,758 INFO L134 CoverageAnalysis]: Checked inductivity of 1661 backedges. 65 proven. 0 refuted. 0 times theorem prover too weak. 1596 trivial. 0 not checked. [2025-03-17 15:47:07,759 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:47:07,759 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [827353878] [2025-03-17 15:47:07,759 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [827353878] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 15:47:07,759 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 15:47:07,759 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 15:47:07,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1046330101] [2025-03-17 15:47:07,759 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 15:47:07,760 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 15:47:07,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:47:07,760 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 15:47:07,760 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-17 15:47:07,760 INFO L87 Difference]: Start difference. First operand 264 states and 269 transitions. Second operand has 6 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 15:47:07,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:47:07,817 INFO L93 Difference]: Finished difference Result 270 states and 276 transitions. [2025-03-17 15:47:07,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 15:47:07,817 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 160 [2025-03-17 15:47:07,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:47:07,819 INFO L225 Difference]: With dead ends: 270 [2025-03-17 15:47:07,819 INFO L226 Difference]: Without dead ends: 269 [2025-03-17 15:47:07,819 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2025-03-17 15:47:07,819 INFO L435 NwaCegarLoop]: 21 mSDtfsCounter, 26 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 15:47:07,820 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 58 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 15:47:07,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2025-03-17 15:47:07,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 263. [2025-03-17 15:47:07,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 263 states, 210 states have (on average 1.019047619047619) internal successors, (214), 211 states have internal predecessors, (214), 26 states have call successors, (26), 25 states have call predecessors, (26), 25 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2025-03-17 15:47:07,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 266 transitions. [2025-03-17 15:47:07,839 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 266 transitions. Word has length 160 [2025-03-17 15:47:07,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:47:07,839 INFO L471 AbstractCegarLoop]: Abstraction has 263 states and 266 transitions. [2025-03-17 15:47:07,840 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 15:47:07,840 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 266 transitions. [2025-03-17 15:47:07,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2025-03-17 15:47:07,841 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:47:07,841 INFO L218 NwaCegarLoop]: trace histogram [25, 25, 25, 25, 25, 24, 24, 1, 1, 1] [2025-03-17 15:47:07,842 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-17 15:47:07,842 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting sumErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, sumErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-17 15:47:07,842 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:47:07,842 INFO L85 PathProgramCache]: Analyzing trace with hash 199779570, now seen corresponding path program 4 times [2025-03-17 15:47:07,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:47:07,842 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [981868844] [2025-03-17 15:47:07,842 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-17 15:47:07,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:47:07,849 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 176 statements into 2 equivalence classes. [2025-03-17 15:47:07,887 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 176 of 176 statements. [2025-03-17 15:47:07,888 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-17 15:47:07,888 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:47:09,090 INFO L134 CoverageAnalysis]: Checked inductivity of 2076 backedges. 0 proven. 2076 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 15:47:09,091 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:47:09,091 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [981868844] [2025-03-17 15:47:09,091 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [981868844] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 15:47:09,091 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1177201152] [2025-03-17 15:47:09,091 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-17 15:47:09,091 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:47:09,091 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 15:47:09,093 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 15:47:09,094 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-17 15:47:09,118 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 176 statements into 2 equivalence classes. [2025-03-17 15:47:09,149 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 176 of 176 statements. [2025-03-17 15:47:09,149 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-17 15:47:09,149 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:47:09,150 INFO L256 TraceCheckSpWp]: Trace formula consists of 400 conjuncts, 52 conjuncts are in the unsatisfiable core [2025-03-17 15:47:09,155 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 15:47:09,378 INFO L134 CoverageAnalysis]: Checked inductivity of 2076 backedges. 0 proven. 2076 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 15:47:09,379 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 15:47:10,963 INFO L134 CoverageAnalysis]: Checked inductivity of 2076 backedges. 0 proven. 2076 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 15:47:10,963 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1177201152] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 15:47:10,963 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 15:47:10,963 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 51, 51] total 105 [2025-03-17 15:47:10,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1563139246] [2025-03-17 15:47:10,963 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 15:47:10,964 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 107 states [2025-03-17 15:47:10,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:47:10,965 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 107 interpolants. [2025-03-17 15:47:10,968 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=2764, Invalid=8578, Unknown=0, NotChecked=0, Total=11342 [2025-03-17 15:47:10,968 INFO L87 Difference]: Start difference. First operand 263 states and 266 transitions. Second operand has 107 states, 103 states have (on average 3.0) internal successors, (309), 55 states have internal predecessors, (309), 52 states have call successors, (52), 51 states have call predecessors, (52), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 15:47:12,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:47:12,970 INFO L93 Difference]: Finished difference Result 634 states and 689 transitions. [2025-03-17 15:47:12,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 104 states. [2025-03-17 15:47:12,971 INFO L78 Accepts]: Start accepts. Automaton has has 107 states, 103 states have (on average 3.0) internal successors, (309), 55 states have internal predecessors, (309), 52 states have call successors, (52), 51 states have call predecessors, (52), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 176 [2025-03-17 15:47:12,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:47:12,973 INFO L225 Difference]: With dead ends: 634 [2025-03-17 15:47:12,973 INFO L226 Difference]: Without dead ends: 633 [2025-03-17 15:47:12,977 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 451 GetRequests, 296 SyntacticMatches, 0 SemanticMatches, 155 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5442 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=6641, Invalid=17851, Unknown=0, NotChecked=0, Total=24492 [2025-03-17 15:47:12,977 INFO L435 NwaCegarLoop]: 54 mSDtfsCounter, 2074 mSDsluCounter, 863 mSDsCounter, 0 mSdLazyCounter, 786 mSolverCounterSat, 229 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2076 SdHoareTripleChecker+Valid, 917 SdHoareTripleChecker+Invalid, 1015 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 229 IncrementalHoareTripleChecker+Valid, 786 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-17 15:47:12,977 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2076 Valid, 917 Invalid, 1015 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [229 Valid, 786 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-17 15:47:12,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 633 states. [2025-03-17 15:47:12,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 633 to 575. [2025-03-17 15:47:12,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 575 states, 470 states have (on average 1.0638297872340425) internal successors, (500), 471 states have internal predecessors, (500), 52 states have call successors, (52), 51 states have call predecessors, (52), 51 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) [2025-03-17 15:47:13,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 575 states to 575 states and 604 transitions. [2025-03-17 15:47:13,000 INFO L78 Accepts]: Start accepts. Automaton has 575 states and 604 transitions. Word has length 176 [2025-03-17 15:47:13,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:47:13,001 INFO L471 AbstractCegarLoop]: Abstraction has 575 states and 604 transitions. [2025-03-17 15:47:13,001 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 107 states, 103 states have (on average 3.0) internal successors, (309), 55 states have internal predecessors, (309), 52 states have call successors, (52), 51 states have call predecessors, (52), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 15:47:13,001 INFO L276 IsEmpty]: Start isEmpty. Operand 575 states and 604 transitions. [2025-03-17 15:47:13,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2025-03-17 15:47:13,003 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:47:13,003 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 22, 22, 22, 22, 22, 22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 15:47:13,010 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-03-17 15:47:13,206 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:47:13,206 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, sumErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-17 15:47:13,206 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:47:13,206 INFO L85 PathProgramCache]: Analyzing trace with hash -1947302382, now seen corresponding path program 1 times [2025-03-17 15:47:13,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:47:13,207 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [307838573] [2025-03-17 15:47:13,207 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:47:13,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:47:13,213 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 231 statements into 1 equivalence classes. [2025-03-17 15:47:13,222 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 231 of 231 statements. [2025-03-17 15:47:13,222 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:47:13,222 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:47:13,273 INFO L134 CoverageAnalysis]: Checked inductivity of 2398 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2398 trivial. 0 not checked. [2025-03-17 15:47:13,274 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:47:13,274 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [307838573] [2025-03-17 15:47:13,274 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [307838573] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 15:47:13,274 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 15:47:13,274 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 15:47:13,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1109929800] [2025-03-17 15:47:13,274 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 15:47:13,274 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 15:47:13,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:47:13,275 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 15:47:13,275 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 15:47:13,275 INFO L87 Difference]: Start difference. First operand 575 states and 604 transitions. Second operand has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-17 15:47:13,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:47:13,291 INFO L93 Difference]: Finished difference Result 575 states and 604 transitions. [2025-03-17 15:47:13,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 15:47:13,292 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 231 [2025-03-17 15:47:13,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:47:13,294 INFO L225 Difference]: With dead ends: 575 [2025-03-17 15:47:13,294 INFO L226 Difference]: Without dead ends: 360 [2025-03-17 15:47:13,296 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 15:47:13,296 INFO L435 NwaCegarLoop]: 18 mSDtfsCounter, 0 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 1 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 15:47:13,297 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 33 Invalid, 1 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 15:47:13,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 360 states. [2025-03-17 15:47:13,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 360 to 359. [2025-03-17 15:47:13,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 359 states, 307 states have (on average 1.003257328990228) internal successors, (308), 307 states have internal predecessors, (308), 51 states have call successors, (51), 51 states have call predecessors, (51), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 15:47:13,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 359 states to 359 states and 359 transitions. [2025-03-17 15:47:13,309 INFO L78 Accepts]: Start accepts. Automaton has 359 states and 359 transitions. Word has length 231 [2025-03-17 15:47:13,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:47:13,309 INFO L471 AbstractCegarLoop]: Abstraction has 359 states and 359 transitions. [2025-03-17 15:47:13,309 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-17 15:47:13,310 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 359 transitions. [2025-03-17 15:47:13,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 359 [2025-03-17 15:47:13,312 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:47:13,312 INFO L218 NwaCegarLoop]: trace histogram [51, 51, 51, 51, 51, 50, 50, 1, 1, 1] [2025-03-17 15:47:13,312 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-17 15:47:13,312 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting sumErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, sumErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-17 15:47:13,312 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:47:13,313 INFO L85 PathProgramCache]: Analyzing trace with hash -667349678, now seen corresponding path program 5 times [2025-03-17 15:47:13,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:47:13,313 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1767445886] [2025-03-17 15:47:13,313 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-17 15:47:13,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:47:13,325 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 358 statements into 51 equivalence classes. [2025-03-17 15:47:13,428 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 51 check-sat command(s) and asserted 358 of 358 statements. [2025-03-17 15:47:13,428 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 51 check-sat command(s) [2025-03-17 15:47:13,428 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:47:17,000 INFO L134 CoverageAnalysis]: Checked inductivity of 8875 backedges. 8871 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-17 15:47:17,000 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:47:17,001 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1767445886] [2025-03-17 15:47:17,001 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1767445886] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 15:47:17,001 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 15:47:17,001 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [102] imperfect sequences [] total 102 [2025-03-17 15:47:17,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [88553538] [2025-03-17 15:47:17,001 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 15:47:17,001 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 103 states [2025-03-17 15:47:17,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:47:17,002 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 103 interpolants. [2025-03-17 15:47:17,003 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=2653, Invalid=7853, Unknown=0, NotChecked=0, Total=10506 [2025-03-17 15:47:17,004 INFO L87 Difference]: Start difference. First operand 359 states and 359 transitions. Second operand has 103 states, 102 states have (on average 2.980392156862745) internal successors, (304), 52 states have internal predecessors, (304), 51 states have call successors, (51), 51 states have call predecessors, (51), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 15:47:17,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:47:17,617 INFO L93 Difference]: Finished difference Result 359 states and 359 transitions. [2025-03-17 15:47:17,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2025-03-17 15:47:17,618 INFO L78 Accepts]: Start accepts. Automaton has has 103 states, 102 states have (on average 2.980392156862745) internal successors, (304), 52 states have internal predecessors, (304), 51 states have call successors, (51), 51 states have call predecessors, (51), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 358 [2025-03-17 15:47:17,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:47:17,619 INFO L225 Difference]: With dead ends: 359 [2025-03-17 15:47:17,619 INFO L226 Difference]: Without dead ends: 0 [2025-03-17 15:47:17,621 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 127 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4247 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=3732, Invalid=12780, Unknown=0, NotChecked=0, Total=16512 [2025-03-17 15:47:17,621 INFO L435 NwaCegarLoop]: 77 mSDtfsCounter, 151 mSDsluCounter, 459 mSDsCounter, 0 mSdLazyCounter, 1184 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 536 SdHoareTripleChecker+Invalid, 1185 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1184 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 15:47:17,621 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [151 Valid, 536 Invalid, 1185 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1184 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 15:47:17,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-17 15:47:17,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-17 15:47:17,622 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 15:47:17,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-17 15:47:17,622 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 358 [2025-03-17 15:47:17,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:47:17,622 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-17 15:47:17,622 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 103 states, 102 states have (on average 2.980392156862745) internal successors, (304), 52 states have internal predecessors, (304), 51 states have call successors, (51), 51 states have call predecessors, (51), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 15:47:17,622 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-17 15:47:17,623 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-17 15:47:17,624 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 8 remaining) [2025-03-17 15:47:17,625 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 8 remaining) [2025-03-17 15:47:17,625 INFO L782 garLoopResultBuilder]: Registering result SAFE for location sumErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 8 remaining) [2025-03-17 15:47:17,625 INFO L782 garLoopResultBuilder]: Registering result SAFE for location sumErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 8 remaining) [2025-03-17 15:47:17,625 INFO L782 garLoopResultBuilder]: Registering result SAFE for location sumErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 8 remaining) [2025-03-17 15:47:17,625 INFO L782 garLoopResultBuilder]: Registering result SAFE for location sumErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 8 remaining) [2025-03-17 15:47:17,625 INFO L782 garLoopResultBuilder]: Registering result SAFE for location sumErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 8 remaining) [2025-03-17 15:47:17,625 INFO L782 garLoopResultBuilder]: Registering result SAFE for location sumErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 8 remaining) [2025-03-17 15:47:17,625 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-17 15:47:17,627 INFO L422 BasicCegarLoop]: Path program histogram: [5, 2, 2, 1, 1, 1, 1, 1] [2025-03-17 15:47:17,628 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-03-17 15:47:23,613 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-17 15:47:23,617 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.03 03:47:23 BoogieIcfgContainer [2025-03-17 15:47:23,617 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-17 15:47:23,617 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-17 15:47:23,617 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-17 15:47:23,617 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-17 15:47:23,618 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 03:46:58" (3/4) ... [2025-03-17 15:47:23,619 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-17 15:47:23,624 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure sum [2025-03-17 15:47:23,626 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2025-03-17 15:47:23,626 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2025-03-17 15:47:23,626 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-17 15:47:23,626 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-17 15:47:23,674 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-17 15:47:23,674 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-17 15:47:23,674 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-17 15:47:23,675 INFO L158 Benchmark]: Toolchain (without parser) took 25235.48ms. Allocated memory was 167.8MB in the beginning and 880.8MB in the end (delta: 713.0MB). Free memory was 122.6MB in the beginning and 501.0MB in the end (delta: -378.3MB). Peak memory consumption was 330.1MB. Max. memory is 16.1GB. [2025-03-17 15:47:23,675 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 201.3MB. Free memory is still 117.0MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 15:47:23,675 INFO L158 Benchmark]: CACSL2BoogieTranslator took 139.84ms. Allocated memory is still 167.8MB. Free memory was 122.6MB in the beginning and 112.9MB in the end (delta: 9.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 15:47:23,675 INFO L158 Benchmark]: Boogie Procedure Inliner took 19.70ms. Allocated memory is still 167.8MB. Free memory was 112.9MB in the beginning and 111.9MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 15:47:23,675 INFO L158 Benchmark]: Boogie Preprocessor took 22.46ms. Allocated memory is still 167.8MB. Free memory was 111.9MB in the beginning and 110.9MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 15:47:23,675 INFO L158 Benchmark]: IcfgBuilder took 213.66ms. Allocated memory is still 167.8MB. Free memory was 110.9MB in the beginning and 99.2MB in the end (delta: 11.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-17 15:47:23,675 INFO L158 Benchmark]: TraceAbstraction took 24776.45ms. Allocated memory was 167.8MB in the beginning and 880.8MB in the end (delta: 713.0MB). Free memory was 98.2MB in the beginning and 509.3MB in the end (delta: -411.1MB). Peak memory consumption was 490.2MB. Max. memory is 16.1GB. [2025-03-17 15:47:23,676 INFO L158 Benchmark]: Witness Printer took 57.15ms. Allocated memory is still 880.8MB. Free memory was 509.3MB in the beginning and 501.0MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 15:47:23,676 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.12ms. Allocated memory is still 201.3MB. Free memory is still 117.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 139.84ms. Allocated memory is still 167.8MB. Free memory was 122.6MB in the beginning and 112.9MB in the end (delta: 9.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 19.70ms. Allocated memory is still 167.8MB. Free memory was 112.9MB in the beginning and 111.9MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 22.46ms. Allocated memory is still 167.8MB. Free memory was 111.9MB in the beginning and 110.9MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 213.66ms. Allocated memory is still 167.8MB. Free memory was 110.9MB in the beginning and 99.2MB in the end (delta: 11.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 24776.45ms. Allocated memory was 167.8MB in the beginning and 880.8MB in the end (delta: 713.0MB). Free memory was 98.2MB in the beginning and 509.3MB in the end (delta: -411.1MB). Peak memory consumption was 490.2MB. Max. memory is 16.1GB. * Witness Printer took 57.15ms. Allocated memory is still 880.8MB. Free memory was 509.3MB in the beginning and 501.0MB in the end (delta: 8.4MB). 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: 17]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 17]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 7]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 7]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 9]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 9]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 9]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 9]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 29 locations, 33 edges, 8 error locations. Started 1 CEGAR loops. OverallTime: 18.7s, OverallIterations: 14, TraceHistogramMax: 51, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 5.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 4362 SdHoareTripleChecker+Valid, 2.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 4346 mSDsluCounter, 3919 SdHoareTripleChecker+Invalid, 1.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3472 mSDsCounter, 485 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4313 IncrementalHoareTripleChecker+Invalid, 4798 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 485 mSolverCounterUnsat, 447 mSDtfsCounter, 4313 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1299 GetRequests, 691 SyntacticMatches, 0 SemanticMatches, 608 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14438 ImplicationChecksByTransitivity, 9.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=575occurred in iteration=12, InterpolantAutomatonStates: 370, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 14 MinimizatonAttempts, 110 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 10.5s InterpolantComputationTime, 1641 NumberOfCodeBlocks, 1641 NumberOfCodeBlocksAsserted, 100 NumberOfCheckSat, 2046 ConstructedInterpolants, 0 QuantifiedInterpolants, 5694 SizeOfPredicates, 62 NumberOfNonLiveVariables, 1097 ConjunctsInSsa, 138 ConjunctsInUnsatCore, 28 InterpolantComputations, 7 PerfectInterpolantSequences, 12961/21892 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 8 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-03-17 15:47:23,689 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE