./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/recursive-simple/sum_20x0-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/recursive-simple/sum_20x0-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 0b12653f6fa3db43ddf9a1a43787bd2cd7fe91d3e4035502f1ea10705d9c83a6 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-09 02:43:21,271 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-09 02:43:21,319 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-03-09 02:43:21,326 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-09 02:43:21,327 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-09 02:43:21,347 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-09 02:43:21,348 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-09 02:43:21,348 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-09 02:43:21,348 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-09 02:43:21,349 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-09 02:43:21,349 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-09 02:43:21,349 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-09 02:43:21,350 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-09 02:43:21,350 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-09 02:43:21,350 INFO L153 SettingsManager]: * Use SBE=true [2025-03-09 02:43:21,350 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-09 02:43:21,350 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-09 02:43:21,350 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-09 02:43:21,351 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-09 02:43:21,351 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-09 02:43:21,351 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-09 02:43:21,351 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-09 02:43:21,351 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-09 02:43:21,351 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-09 02:43:21,351 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-09 02:43:21,351 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-09 02:43:21,351 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-09 02:43:21,351 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-09 02:43:21,351 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-09 02:43:21,352 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-09 02:43:21,352 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-09 02:43:21,352 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-09 02:43:21,352 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-09 02:43:21,352 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-09 02:43:21,352 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 02:43:21,352 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-09 02:43:21,353 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-09 02:43:21,353 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-09 02:43:21,353 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-09 02:43:21,353 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-09 02:43:21,353 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-09 02:43:21,353 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-09 02:43:21,353 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-09 02:43:21,353 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-09 02:43:21,353 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-09 02:43:21,353 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 -> 0b12653f6fa3db43ddf9a1a43787bd2cd7fe91d3e4035502f1ea10705d9c83a6 [2025-03-09 02:43:21,595 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-09 02:43:21,604 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-09 02:43:21,606 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-09 02:43:21,607 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-09 02:43:21,607 INFO L274 PluginConnector]: CDTParser initialized [2025-03-09 02:43:21,609 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/recursive-simple/sum_20x0-1.c [2025-03-09 02:43:22,753 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/88a35d560/8cd0a3c453c2424d9b7c128b7091622a/FLAG8d016e8f0 [2025-03-09 02:43:22,966 INFO L384 CDTParser]: Found 1 translation units. [2025-03-09 02:43:22,967 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive-simple/sum_20x0-1.c [2025-03-09 02:43:22,987 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/88a35d560/8cd0a3c453c2424d9b7c128b7091622a/FLAG8d016e8f0 [2025-03-09 02:43:23,329 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/88a35d560/8cd0a3c453c2424d9b7c128b7091622a [2025-03-09 02:43:23,331 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-09 02:43:23,332 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-09 02:43:23,333 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-09 02:43:23,333 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-09 02:43:23,336 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-09 02:43:23,337 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 02:43:23" (1/1) ... [2025-03-09 02:43:23,337 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@73e00d8c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:43:23, skipping insertion in model container [2025-03-09 02:43:23,337 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 02:43:23" (1/1) ... [2025-03-09 02:43:23,346 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-09 02:43:23,442 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 02:43:23,449 INFO L200 MainTranslator]: Completed pre-run [2025-03-09 02:43:23,459 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 02:43:23,470 INFO L204 MainTranslator]: Completed translation [2025-03-09 02:43:23,471 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:43:23 WrapperNode [2025-03-09 02:43:23,471 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-09 02:43:23,472 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-09 02:43:23,472 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-09 02:43:23,472 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-09 02:43:23,477 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:43:23" (1/1) ... [2025-03-09 02:43:23,483 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:43:23" (1/1) ... [2025-03-09 02:43:23,494 INFO L138 Inliner]: procedures = 12, calls = 10, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 22 [2025-03-09 02:43:23,494 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-09 02:43:23,495 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-09 02:43:23,496 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-09 02:43:23,496 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-09 02:43:23,501 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:43:23" (1/1) ... [2025-03-09 02:43:23,501 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:43:23" (1/1) ... [2025-03-09 02:43:23,502 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:43:23" (1/1) ... [2025-03-09 02:43:23,513 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-09 02:43:23,514 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:43:23" (1/1) ... [2025-03-09 02:43:23,514 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:43:23" (1/1) ... [2025-03-09 02:43:23,515 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:43:23" (1/1) ... [2025-03-09 02:43:23,516 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:43:23" (1/1) ... [2025-03-09 02:43:23,516 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:43:23" (1/1) ... [2025-03-09 02:43:23,518 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:43:23" (1/1) ... [2025-03-09 02:43:23,519 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-09 02:43:23,520 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-09 02:43:23,521 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-09 02:43:23,521 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-09 02:43:23,522 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:43:23" (1/1) ... [2025-03-09 02:43:23,526 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 02:43:23,536 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:43:23,551 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-09 02:43:23,558 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-09 02:43:23,576 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-09 02:43:23,577 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-09 02:43:23,577 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-09 02:43:23,577 INFO L130 BoogieDeclarations]: Found specification of procedure sum [2025-03-09 02:43:23,577 INFO L138 BoogieDeclarations]: Found implementation of procedure sum [2025-03-09 02:43:23,577 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-09 02:43:23,623 INFO L256 CfgBuilder]: Building ICFG [2025-03-09 02:43:23,624 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-09 02:43:23,698 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L9: havoc #t~ret4; [2025-03-09 02:43:23,707 INFO L? ?]: Removed 22 outVars from TransFormulas that were not future-live. [2025-03-09 02:43:23,707 INFO L307 CfgBuilder]: Performing block encoding [2025-03-09 02:43:23,714 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-09 02:43:23,715 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-09 02:43:23,715 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 02:43:23 BoogieIcfgContainer [2025-03-09 02:43:23,715 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-09 02:43:23,716 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-09 02:43:23,716 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-09 02:43:23,720 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-09 02:43:23,720 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.03 02:43:23" (1/3) ... [2025-03-09 02:43:23,721 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7712afe0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 02:43:23, skipping insertion in model container [2025-03-09 02:43:23,721 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:43:23" (2/3) ... [2025-03-09 02:43:23,722 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7712afe0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 02:43:23, skipping insertion in model container [2025-03-09 02:43:23,722 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 02:43:23" (3/3) ... [2025-03-09 02:43:23,723 INFO L128 eAbstractionObserver]: Analyzing ICFG sum_20x0-1.c [2025-03-09 02:43:23,733 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-09 02:43:23,734 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG sum_20x0-1.c that has 2 procedures, 32 locations, 1 initial locations, 0 loop locations, and 8 error locations. [2025-03-09 02:43:23,765 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-09 02:43:23,773 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;@70ca0fb3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-09 02:43:23,773 INFO L334 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2025-03-09 02:43:23,776 INFO L276 IsEmpty]: Start isEmpty. Operand has 32 states, 20 states have (on average 1.5) internal successors, (30), 28 states have internal predecessors, (30), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-09 02:43:23,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-03-09 02:43:23,779 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:43:23,780 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-09 02:43:23,780 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-09 02:43:23,785 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:43:23,785 INFO L85 PathProgramCache]: Analyzing trace with hash 1242226034, now seen corresponding path program 1 times [2025-03-09 02:43:23,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:43:23,791 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [101682014] [2025-03-09 02:43:23,791 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:43:23,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:43:23,833 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-09 02:43:23,847 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-09 02:43:23,848 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:43:23,848 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:43:23,963 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 02:43:23,965 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:43:23,965 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [101682014] [2025-03-09 02:43:23,966 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [101682014] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:43:23,966 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:43:23,967 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-09 02:43:23,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [180785877] [2025-03-09 02:43:23,968 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:43:23,971 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 02:43:23,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:43:23,983 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 02:43:23,983 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-09 02:43:23,985 INFO L87 Difference]: Start difference. First operand has 32 states, 20 states have (on average 1.5) internal successors, (30), 28 states have internal predecessors, (30), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 5 states, 4 states have (on average 1.25) internal successors, (5), 4 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-09 02:43:24,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:43:24,077 INFO L93 Difference]: Finished difference Result 62 states and 65 transitions. [2025-03-09 02:43:24,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 02:43:24,079 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.25) internal successors, (5), 4 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-09 02:43:24,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:43:24,083 INFO L225 Difference]: With dead ends: 62 [2025-03-09 02:43:24,083 INFO L226 Difference]: Without dead ends: 39 [2025-03-09 02:43:24,085 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 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-09 02:43:24,087 INFO L435 NwaCegarLoop]: 21 mSDtfsCounter, 23 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 02:43:24,089 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 73 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 02:43:24,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2025-03-09 02:43:24,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 36. [2025-03-09 02:43:24,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 23 states have (on average 1.4782608695652173) internal successors, (34), 30 states have internal predecessors, (34), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-09 02:43:24,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 40 transitions. [2025-03-09 02:43:24,110 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 40 transitions. Word has length 6 [2025-03-09 02:43:24,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:43:24,111 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 40 transitions. [2025-03-09 02:43:24,111 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.25) internal successors, (5), 4 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-09 02:43:24,111 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 40 transitions. [2025-03-09 02:43:24,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-03-09 02:43:24,111 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:43:24,111 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:43:24,111 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-09 02:43:24,111 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-09 02:43:24,112 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:43:24,112 INFO L85 PathProgramCache]: Analyzing trace with hash -145697313, now seen corresponding path program 1 times [2025-03-09 02:43:24,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:43:24,112 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [299691015] [2025-03-09 02:43:24,112 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:43:24,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:43:24,116 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-09 02:43:24,119 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-09 02:43:24,119 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:43:24,119 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:43:24,158 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 02:43:24,158 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:43:24,158 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [299691015] [2025-03-09 02:43:24,158 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [299691015] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:43:24,158 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:43:24,159 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-09 02:43:24,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1736900182] [2025-03-09 02:43:24,159 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:43:24,159 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 02:43:24,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:43:24,160 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 02:43:24,160 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-09 02:43:24,160 INFO L87 Difference]: Start difference. First operand 36 states and 40 transitions. Second operand has 5 states, 3 states have (on average 2.0) internal successors, (6), 4 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-09 02:43:24,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:43:24,223 INFO L93 Difference]: Finished difference Result 38 states and 43 transitions. [2025-03-09 02:43:24,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 02:43:24,223 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 3 states have (on average 2.0) internal successors, (6), 4 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-09 02:43:24,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:43:24,225 INFO L225 Difference]: With dead ends: 38 [2025-03-09 02:43:24,225 INFO L226 Difference]: Without dead ends: 37 [2025-03-09 02:43:24,225 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-09 02:43:24,225 INFO L435 NwaCegarLoop]: 12 mSDtfsCounter, 27 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 29 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-09 02:43:24,226 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 29 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 02:43:24,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2025-03-09 02:43:24,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 35. [2025-03-09 02:43:24,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 23 states have (on average 1.391304347826087) internal successors, (32), 29 states have internal predecessors, (32), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-09 02:43:24,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 38 transitions. [2025-03-09 02:43:24,231 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 38 transitions. Word has length 7 [2025-03-09 02:43:24,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:43:24,231 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 38 transitions. [2025-03-09 02:43:24,231 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 3 states have (on average 2.0) internal successors, (6), 4 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-09 02:43:24,231 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 38 transitions. [2025-03-09 02:43:24,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-03-09 02:43:24,232 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:43:24,232 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:43:24,232 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-09 02:43:24,232 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-09 02:43:24,232 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:43:24,232 INFO L85 PathProgramCache]: Analyzing trace with hash -221649414, now seen corresponding path program 1 times [2025-03-09 02:43:24,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:43:24,232 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1804202489] [2025-03-09 02:43:24,232 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:43:24,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:43:24,236 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-09 02:43:24,238 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-09 02:43:24,238 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:43:24,238 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:43:24,283 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 02:43:24,283 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:43:24,283 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1804202489] [2025-03-09 02:43:24,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1804202489] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:43:24,283 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:43:24,283 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-09 02:43:24,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [709042642] [2025-03-09 02:43:24,284 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:43:24,284 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 02:43:24,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:43:24,284 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 02:43:24,284 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-09 02:43:24,284 INFO L87 Difference]: Start difference. First operand 35 states and 38 transitions. Second operand has 5 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 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-09 02:43:24,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:43:24,332 INFO L93 Difference]: Finished difference Result 37 states and 38 transitions. [2025-03-09 02:43:24,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 02:43:24,333 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 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-09 02:43:24,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:43:24,333 INFO L225 Difference]: With dead ends: 37 [2025-03-09 02:43:24,333 INFO L226 Difference]: Without dead ends: 35 [2025-03-09 02:43:24,334 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-09 02:43:24,334 INFO L435 NwaCegarLoop]: 20 mSDtfsCounter, 14 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 02:43:24,334 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 68 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 02:43:24,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2025-03-09 02:43:24,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2025-03-09 02:43:24,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 29 states have internal predecessors, (30), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-09 02:43:24,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 36 transitions. [2025-03-09 02:43:24,338 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 36 transitions. Word has length 8 [2025-03-09 02:43:24,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:43:24,339 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 36 transitions. [2025-03-09 02:43:24,339 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 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-09 02:43:24,339 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 36 transitions. [2025-03-09 02:43:24,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-03-09 02:43:24,339 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:43:24,339 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:43:24,340 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-09 02:43:24,340 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting sumErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, sumErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-09 02:43:24,340 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:43:24,340 INFO L85 PathProgramCache]: Analyzing trace with hash -759415764, now seen corresponding path program 1 times [2025-03-09 02:43:24,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:43:24,340 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [6533427] [2025-03-09 02:43:24,340 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:43:24,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:43:24,350 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-09 02:43:24,357 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-09 02:43:24,357 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:43:24,357 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:43:24,430 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-09 02:43:24,430 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:43:24,430 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [6533427] [2025-03-09 02:43:24,430 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [6533427] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 02:43:24,430 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1777732660] [2025-03-09 02:43:24,430 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:43:24,431 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:43:24,431 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:43:24,432 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-09 02:43:24,433 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-09 02:43:24,453 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-09 02:43:24,459 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-09 02:43:24,459 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:43:24,459 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:43:24,463 INFO L256 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-09 02:43:24,466 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:43:24,514 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-09 02:43:24,514 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 02:43:24,573 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-09 02:43:24,573 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1777732660] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 02:43:24,573 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 02:43:24,573 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 12 [2025-03-09 02:43:24,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [162751436] [2025-03-09 02:43:24,573 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 02:43:24,574 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-09 02:43:24,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:43:24,574 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-09 02:43:24,574 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2025-03-09 02:43:24,574 INFO L87 Difference]: Start difference. First operand 35 states and 36 transitions. Second operand has 12 states, 10 states have (on average 2.0) internal successors, (20), 8 states have internal predecessors, (20), 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-09 02:43:24,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:43:24,709 INFO L93 Difference]: Finished difference Result 88 states and 97 transitions. [2025-03-09 02:43:24,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-09 02:43:24,710 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 2.0) internal successors, (20), 8 states have internal predecessors, (20), 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 13 [2025-03-09 02:43:24,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:43:24,711 INFO L225 Difference]: With dead ends: 88 [2025-03-09 02:43:24,711 INFO L226 Difference]: Without dead ends: 72 [2025-03-09 02:43:24,711 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 21 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-09 02:43:24,711 INFO L435 NwaCegarLoop]: 24 mSDtfsCounter, 88 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 152 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 02:43:24,712 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 152 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 02:43:24,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2025-03-09 02:43:24,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 64. [2025-03-09 02:43:24,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 47 states have (on average 1.2553191489361701) internal successors, (59), 52 states have internal predecessors, (59), 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-09 02:43:24,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 71 transitions. [2025-03-09 02:43:24,723 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 71 transitions. Word has length 13 [2025-03-09 02:43:24,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:43:24,723 INFO L471 AbstractCegarLoop]: Abstraction has 64 states and 71 transitions. [2025-03-09 02:43:24,723 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 2.0) internal successors, (20), 8 states have internal predecessors, (20), 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-09 02:43:24,723 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 71 transitions. [2025-03-09 02:43:24,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-03-09 02:43:24,723 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:43:24,723 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:43:24,729 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-09 02:43:24,924 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:43:24,924 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting sumErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, sumErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-09 02:43:24,924 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:43:24,924 INFO L85 PathProgramCache]: Analyzing trace with hash 345931316, now seen corresponding path program 1 times [2025-03-09 02:43:24,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:43:24,925 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [432716885] [2025-03-09 02:43:24,925 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:43:24,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:43:24,929 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-09 02:43:24,932 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-09 02:43:24,933 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:43:24,933 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:43:25,004 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 02:43:25,004 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:43:25,004 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [432716885] [2025-03-09 02:43:25,004 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [432716885] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 02:43:25,004 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [119919303] [2025-03-09 02:43:25,004 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:43:25,005 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:43:25,005 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:43:25,006 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-09 02:43:25,007 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-09 02:43:25,025 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-09 02:43:25,031 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-09 02:43:25,031 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:43:25,031 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:43:25,032 INFO L256 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-09 02:43:25,033 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:43:25,098 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 02:43:25,099 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 02:43:25,099 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [119919303] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:43:25,099 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-09 02:43:25,099 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 9 [2025-03-09 02:43:25,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1884390031] [2025-03-09 02:43:25,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:43:25,099 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-09 02:43:25,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:43:25,099 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-09 02:43:25,099 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2025-03-09 02:43:25,100 INFO L87 Difference]: Start difference. First operand 64 states and 71 transitions. Second operand has 7 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 02:43:25,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:43:25,163 INFO L93 Difference]: Finished difference Result 66 states and 74 transitions. [2025-03-09 02:43:25,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-09 02:43:25,163 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2025-03-09 02:43:25,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:43:25,164 INFO L225 Difference]: With dead ends: 66 [2025-03-09 02:43:25,164 INFO L226 Difference]: Without dead ends: 65 [2025-03-09 02:43:25,164 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2025-03-09 02:43:25,165 INFO L435 NwaCegarLoop]: 16 mSDtfsCounter, 36 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 02:43:25,166 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 49 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 02:43:25,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2025-03-09 02:43:25,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 63. [2025-03-09 02:43:25,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 47 states have (on average 1.1702127659574468) internal successors, (55), 51 states have internal predecessors, (55), 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-09 02:43:25,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 67 transitions. [2025-03-09 02:43:25,172 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 67 transitions. Word has length 15 [2025-03-09 02:43:25,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:43:25,172 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 67 transitions. [2025-03-09 02:43:25,172 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 02:43:25,173 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 67 transitions. [2025-03-09 02:43:25,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-03-09 02:43:25,173 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:43:25,173 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2025-03-09 02:43:25,178 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-09 02:43:25,375 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:43:25,375 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-09 02:43:25,376 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:43:25,376 INFO L85 PathProgramCache]: Analyzing trace with hash 2133936195, now seen corresponding path program 1 times [2025-03-09 02:43:25,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:43:25,376 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1300293218] [2025-03-09 02:43:25,376 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:43:25,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:43:25,381 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-09 02:43:25,383 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-09 02:43:25,384 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:43:25,384 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:43:25,438 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-09 02:43:25,438 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:43:25,439 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1300293218] [2025-03-09 02:43:25,439 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1300293218] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 02:43:25,439 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [626941870] [2025-03-09 02:43:25,439 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:43:25,439 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:43:25,439 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:43:25,441 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-09 02:43:25,442 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-09 02:43:25,458 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-09 02:43:25,464 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-09 02:43:25,464 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:43:25,464 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:43:25,465 INFO L256 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-09 02:43:25,465 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:43:25,506 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-09 02:43:25,506 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 02:43:25,560 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-09 02:43:25,560 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [626941870] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 02:43:25,560 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 02:43:25,560 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 14 [2025-03-09 02:43:25,560 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [933505778] [2025-03-09 02:43:25,560 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 02:43:25,560 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-09 02:43:25,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:43:25,561 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-09 02:43:25,561 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=160, Unknown=0, NotChecked=0, Total=210 [2025-03-09 02:43:25,561 INFO L87 Difference]: Start difference. First operand 63 states and 67 transitions. Second operand has 15 states, 11 states have (on average 3.090909090909091) internal successors, (34), 10 states have internal predecessors, (34), 6 states have call successors, (6), 5 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 02:43:25,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:43:25,653 INFO L93 Difference]: Finished difference Result 66 states and 70 transitions. [2025-03-09 02:43:25,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-09 02:43:25,654 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 11 states have (on average 3.090909090909091) internal successors, (34), 10 states have internal predecessors, (34), 6 states have call successors, (6), 5 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2025-03-09 02:43:25,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:43:25,654 INFO L225 Difference]: With dead ends: 66 [2025-03-09 02:43:25,654 INFO L226 Difference]: Without dead ends: 65 [2025-03-09 02:43:25,655 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=86, Invalid=256, Unknown=0, NotChecked=0, Total=342 [2025-03-09 02:43:25,656 INFO L435 NwaCegarLoop]: 24 mSDtfsCounter, 64 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 02:43:25,656 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 148 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 02:43:25,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2025-03-09 02:43:25,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 63. [2025-03-09 02:43:25,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 47 states have (on average 1.1063829787234043) internal successors, (52), 51 states have internal predecessors, (52), 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-09 02:43:25,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 64 transitions. [2025-03-09 02:43:25,663 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 64 transitions. Word has length 16 [2025-03-09 02:43:25,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:43:25,664 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 64 transitions. [2025-03-09 02:43:25,664 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 11 states have (on average 3.090909090909091) internal successors, (34), 10 states have internal predecessors, (34), 6 states have call successors, (6), 5 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 02:43:25,664 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 64 transitions. [2025-03-09 02:43:25,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-03-09 02:43:25,664 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:43:25,664 INFO L218 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1] [2025-03-09 02:43:25,670 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-09 02:43:25,865 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:43:25,865 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-09 02:43:25,865 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:43:25,866 INFO L85 PathProgramCache]: Analyzing trace with hash -1442921742, now seen corresponding path program 2 times [2025-03-09 02:43:25,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:43:25,866 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [381818928] [2025-03-09 02:43:25,866 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 02:43:25,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:43:25,870 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 34 statements into 2 equivalence classes. [2025-03-09 02:43:25,883 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 34 of 34 statements. [2025-03-09 02:43:25,883 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 02:43:25,883 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:43:26,064 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 11 proven. 39 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 02:43:26,064 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:43:26,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [381818928] [2025-03-09 02:43:26,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [381818928] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 02:43:26,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1554223751] [2025-03-09 02:43:26,064 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 02:43:26,064 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:43:26,064 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:43:26,066 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-09 02:43:26,068 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-09 02:43:26,085 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 34 statements into 2 equivalence classes. [2025-03-09 02:43:26,094 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 34 of 34 statements. [2025-03-09 02:43:26,095 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 02:43:26,095 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:43:26,095 INFO L256 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-09 02:43:26,096 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:43:26,279 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-09 02:43:26,279 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 02:43:26,530 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-09 02:43:26,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1554223751] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 02:43:26,530 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 02:43:26,531 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13, 13] total 35 [2025-03-09 02:43:26,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1203052986] [2025-03-09 02:43:26,531 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 02:43:26,531 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2025-03-09 02:43:26,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:43:26,532 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2025-03-09 02:43:26,533 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=164, Invalid=1026, Unknown=0, NotChecked=0, Total=1190 [2025-03-09 02:43:26,533 INFO L87 Difference]: Start difference. First operand 63 states and 64 transitions. Second operand has 35 states, 32 states have (on average 2.625) internal successors, (84), 20 states have internal predecessors, (84), 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-09 02:43:27,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:43:27,354 INFO L93 Difference]: Finished difference Result 153 states and 167 transitions. [2025-03-09 02:43:27,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2025-03-09 02:43:27,355 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 32 states have (on average 2.625) internal successors, (84), 20 states have internal predecessors, (84), 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 34 [2025-03-09 02:43:27,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:43:27,356 INFO L225 Difference]: With dead ends: 153 [2025-03-09 02:43:27,357 INFO L226 Difference]: Without dead ends: 129 [2025-03-09 02:43:27,359 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 874 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=779, Invalid=3511, Unknown=0, NotChecked=0, Total=4290 [2025-03-09 02:43:27,363 INFO L435 NwaCegarLoop]: 29 mSDtfsCounter, 553 mSDsluCounter, 260 mSDsCounter, 0 mSdLazyCounter, 597 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 553 SdHoareTripleChecker+Valid, 289 SdHoareTripleChecker+Invalid, 654 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 597 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-09 02:43:27,363 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [553 Valid, 289 Invalid, 654 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 597 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-09 02:43:27,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2025-03-09 02:43:27,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 121. [2025-03-09 02:43:27,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 95 states have (on average 1.0947368421052632) internal successors, (104), 97 states have internal predecessors, (104), 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-09 02:43:27,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 128 transitions. [2025-03-09 02:43:27,372 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 128 transitions. Word has length 34 [2025-03-09 02:43:27,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:43:27,372 INFO L471 AbstractCegarLoop]: Abstraction has 121 states and 128 transitions. [2025-03-09 02:43:27,372 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 32 states have (on average 2.625) internal successors, (84), 20 states have internal predecessors, (84), 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-09 02:43:27,373 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 128 transitions. [2025-03-09 02:43:27,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-03-09 02:43:27,373 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:43:27,373 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 1, 1, 1, 1] [2025-03-09 02:43:27,379 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-09 02:43:27,573 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:43:27,574 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-09 02:43:27,575 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:43:27,575 INFO L85 PathProgramCache]: Analyzing trace with hash -2047671363, now seen corresponding path program 2 times [2025-03-09 02:43:27,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:43:27,575 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1478325232] [2025-03-09 02:43:27,575 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 02:43:27,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:43:27,578 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 37 statements into 2 equivalence classes. [2025-03-09 02:43:27,583 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 37 of 37 statements. [2025-03-09 02:43:27,586 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 02:43:27,586 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:43:27,720 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-09 02:43:27,720 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:43:27,721 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1478325232] [2025-03-09 02:43:27,721 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1478325232] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 02:43:27,721 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [973656287] [2025-03-09 02:43:27,721 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 02:43:27,721 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:43:27,721 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:43:27,722 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-09 02:43:27,724 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-09 02:43:27,741 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 37 statements into 2 equivalence classes. [2025-03-09 02:43:27,750 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 37 of 37 statements. [2025-03-09 02:43:27,751 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 02:43:27,751 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:43:27,751 INFO L256 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-09 02:43:27,753 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:43:27,821 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-09 02:43:27,822 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 02:43:27,974 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-09 02:43:27,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [973656287] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 02:43:27,974 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 02:43:27,974 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 26 [2025-03-09 02:43:27,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [274031008] [2025-03-09 02:43:27,975 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 02:43:27,975 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2025-03-09 02:43:27,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:43:27,975 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2025-03-09 02:43:27,975 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=164, Invalid=538, Unknown=0, NotChecked=0, Total=702 [2025-03-09 02:43:27,976 INFO L87 Difference]: Start difference. First operand 121 states and 128 transitions. Second operand has 27 states, 23 states have (on average 3.0434782608695654) internal successors, (70), 16 states have internal predecessors, (70), 12 states have call successors, (12), 11 states have call predecessors, (12), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 02:43:28,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:43:28,193 INFO L93 Difference]: Finished difference Result 124 states and 131 transitions. [2025-03-09 02:43:28,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-03-09 02:43:28,194 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 23 states have (on average 3.0434782608695654) internal successors, (70), 16 states have internal predecessors, (70), 12 states have call successors, (12), 11 states have call predecessors, (12), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2025-03-09 02:43:28,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:43:28,195 INFO L225 Difference]: With dead ends: 124 [2025-03-09 02:43:28,195 INFO L226 Difference]: Without dead ends: 123 [2025-03-09 02:43:28,195 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 282 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=341, Invalid=991, Unknown=0, NotChecked=0, Total=1332 [2025-03-09 02:43:28,196 INFO L435 NwaCegarLoop]: 35 mSDtfsCounter, 188 mSDsluCounter, 293 mSDsCounter, 0 mSdLazyCounter, 218 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 190 SdHoareTripleChecker+Valid, 328 SdHoareTripleChecker+Invalid, 242 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 218 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 02:43:28,196 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [190 Valid, 328 Invalid, 242 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 218 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 02:43:28,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2025-03-09 02:43:28,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 121. [2025-03-09 02:43:28,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 95 states have (on average 1.0315789473684212) internal successors, (98), 97 states have internal predecessors, (98), 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-09 02:43:28,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 122 transitions. [2025-03-09 02:43:28,204 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 122 transitions. Word has length 37 [2025-03-09 02:43:28,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:43:28,205 INFO L471 AbstractCegarLoop]: Abstraction has 121 states and 122 transitions. [2025-03-09 02:43:28,205 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 23 states have (on average 3.0434782608695654) internal successors, (70), 16 states have internal predecessors, (70), 12 states have call successors, (12), 11 states have call predecessors, (12), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 02:43:28,205 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 122 transitions. [2025-03-09 02:43:28,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-03-09 02:43:28,209 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:43:28,209 INFO L218 NwaCegarLoop]: trace histogram [11, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1] [2025-03-09 02:43:28,216 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-09 02:43:28,409 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:43:28,409 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-09 02:43:28,410 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:43:28,410 INFO L85 PathProgramCache]: Analyzing trace with hash 2108646142, now seen corresponding path program 1 times [2025-03-09 02:43:28,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:43:28,410 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [578972638] [2025-03-09 02:43:28,410 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:43:28,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:43:28,415 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-03-09 02:43:28,434 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-03-09 02:43:28,435 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:43:28,435 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:43:28,771 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-09 02:43:28,772 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:43:28,772 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [578972638] [2025-03-09 02:43:28,772 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [578972638] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 02:43:28,772 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [489874598] [2025-03-09 02:43:28,772 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:43:28,772 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:43:28,772 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:43:28,775 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-09 02:43:28,776 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-09 02:43:28,799 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-03-09 02:43:28,822 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-03-09 02:43:28,822 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:43:28,822 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:43:28,823 INFO L256 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-03-09 02:43:28,825 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:43:29,300 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-09 02:43:29,300 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 02:43:29,842 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-09 02:43:29,842 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [489874598] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 02:43:29,842 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 02:43:29,842 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 68 [2025-03-09 02:43:29,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1252070131] [2025-03-09 02:43:29,843 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 02:43:29,843 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 68 states [2025-03-09 02:43:29,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:43:29,844 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2025-03-09 02:43:29,845 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=624, Invalid=3932, Unknown=0, NotChecked=0, Total=4556 [2025-03-09 02:43:29,845 INFO L87 Difference]: Start difference. First operand 121 states and 122 transitions. Second operand has 68 states, 65 states have (on average 2.876923076923077) internal successors, (187), 37 states have internal predecessors, (187), 32 states have call successors, (32), 31 states have call predecessors, (32), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 02:43:30,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:43:30,819 INFO L93 Difference]: Finished difference Result 273 states and 293 transitions. [2025-03-09 02:43:30,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2025-03-09 02:43:30,820 INFO L78 Accepts]: Start accepts. Automaton has has 68 states, 65 states have (on average 2.876923076923077) internal successors, (187), 37 states have internal predecessors, (187), 32 states have call successors, (32), 31 states have call predecessors, (32), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 77 [2025-03-09 02:43:30,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:43:30,821 INFO L225 Difference]: With dead ends: 273 [2025-03-09 02:43:30,821 INFO L226 Difference]: Without dead ends: 232 [2025-03-09 02:43:30,823 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 209 GetRequests, 107 SyntacticMatches, 4 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2333 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1785, Invalid=8115, Unknown=0, NotChecked=0, Total=9900 [2025-03-09 02:43:30,825 INFO L435 NwaCegarLoop]: 52 mSDtfsCounter, 607 mSDsluCounter, 752 mSDsCounter, 0 mSdLazyCounter, 766 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 608 SdHoareTripleChecker+Valid, 804 SdHoareTripleChecker+Invalid, 832 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 766 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-09 02:43:30,825 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [608 Valid, 804 Invalid, 832 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 766 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-09 02:43:30,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2025-03-09 02:43:30,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 221. [2025-03-09 02:43:30,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 221 states, 175 states have (on average 1.0685714285714285) internal successors, (187), 177 states have internal predecessors, (187), 22 states have call successors, (22), 21 states have call predecessors, (22), 21 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2025-03-09 02:43:30,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 231 transitions. [2025-03-09 02:43:30,847 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 231 transitions. Word has length 77 [2025-03-09 02:43:30,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:43:30,847 INFO L471 AbstractCegarLoop]: Abstraction has 221 states and 231 transitions. [2025-03-09 02:43:30,847 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 68 states, 65 states have (on average 2.876923076923077) internal successors, (187), 37 states have internal predecessors, (187), 32 states have call successors, (32), 31 states have call predecessors, (32), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 02:43:30,848 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 231 transitions. [2025-03-09 02:43:30,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2025-03-09 02:43:30,849 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:43:30,849 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 12, 12, 11, 11, 1, 1, 1, 1] [2025-03-09 02:43:30,855 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-09 02:43:31,053 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:43:31,053 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-09 02:43:31,053 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:43:31,053 INFO L85 PathProgramCache]: Analyzing trace with hash 930299395, now seen corresponding path program 3 times [2025-03-09 02:43:31,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:43:31,053 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1359066148] [2025-03-09 02:43:31,054 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-09 02:43:31,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:43:31,058 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 86 statements into 12 equivalence classes. [2025-03-09 02:43:31,073 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) and asserted 86 of 86 statements. [2025-03-09 02:43:31,073 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2025-03-09 02:43:31,073 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:43:31,519 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-09 02:43:31,520 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:43:31,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1359066148] [2025-03-09 02:43:31,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1359066148] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 02:43:31,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [952331507] [2025-03-09 02:43:31,520 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-09 02:43:31,520 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:43:31,520 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:43:31,522 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-09 02:43:31,524 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-09 02:43:31,542 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 86 statements into 12 equivalence classes. [2025-03-09 02:43:31,563 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) and asserted 86 of 86 statements. [2025-03-09 02:43:31,563 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2025-03-09 02:43:31,563 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:43:31,564 INFO L256 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-03-09 02:43:31,566 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:43:31,688 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-09 02:43:31,688 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 02:43:32,201 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-09 02:43:32,202 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [952331507] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 02:43:32,202 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 02:43:32,202 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26, 26] total 54 [2025-03-09 02:43:32,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1269206824] [2025-03-09 02:43:32,202 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 02:43:32,202 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 55 states [2025-03-09 02:43:32,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:43:32,203 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2025-03-09 02:43:32,204 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=710, Invalid=2260, Unknown=0, NotChecked=0, Total=2970 [2025-03-09 02:43:32,204 INFO L87 Difference]: Start difference. First operand 221 states and 231 transitions. Second operand has 55 states, 51 states have (on average 3.019607843137255) internal successors, (154), 30 states have internal predecessors, (154), 26 states have call successors, (26), 25 states have call predecessors, (26), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 02:43:32,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:43:32,847 INFO L93 Difference]: Finished difference Result 284 states and 302 transitions. [2025-03-09 02:43:32,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2025-03-09 02:43:32,847 INFO L78 Accepts]: Start accepts. Automaton has has 55 states, 51 states have (on average 3.019607843137255) internal successors, (154), 30 states have internal predecessors, (154), 26 states have call successors, (26), 25 states have call predecessors, (26), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 86 [2025-03-09 02:43:32,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:43:32,850 INFO L225 Difference]: With dead ends: 284 [2025-03-09 02:43:32,852 INFO L226 Difference]: Without dead ends: 283 [2025-03-09 02:43:32,854 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 220 GetRequests, 143 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1360 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1636, Invalid=4526, Unknown=0, NotChecked=0, Total=6162 [2025-03-09 02:43:32,854 INFO L435 NwaCegarLoop]: 51 mSDtfsCounter, 472 mSDsluCounter, 598 mSDsCounter, 0 mSdLazyCounter, 479 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 474 SdHoareTripleChecker+Valid, 649 SdHoareTripleChecker+Invalid, 539 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 479 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-09 02:43:32,854 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [474 Valid, 649 Invalid, 539 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 479 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-09 02:43:32,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2025-03-09 02:43:32,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 269. [2025-03-09 02:43:32,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 269 states, 215 states have (on average 1.0511627906976744) internal successors, (226), 217 states have internal predecessors, (226), 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-09 02:43:32,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 278 transitions. [2025-03-09 02:43:32,877 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 278 transitions. Word has length 86 [2025-03-09 02:43:32,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:43:32,877 INFO L471 AbstractCegarLoop]: Abstraction has 269 states and 278 transitions. [2025-03-09 02:43:32,878 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 55 states, 51 states have (on average 3.019607843137255) internal successors, (154), 30 states have internal predecessors, (154), 26 states have call successors, (26), 25 states have call predecessors, (26), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 02:43:32,878 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 278 transitions. [2025-03-09 02:43:32,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2025-03-09 02:43:32,880 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:43:32,880 INFO L218 NwaCegarLoop]: trace histogram [21, 20, 20, 20, 20, 20, 20, 1, 1, 1, 1, 1, 1] [2025-03-09 02:43:32,887 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-09 02:43:33,081 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:43:33,081 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-09 02:43:33,082 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:43:33,082 INFO L85 PathProgramCache]: Analyzing trace with hash 213206334, now seen corresponding path program 2 times [2025-03-09 02:43:33,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:43:33,082 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [831973495] [2025-03-09 02:43:33,082 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 02:43:33,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:43:33,086 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 147 statements into 2 equivalence classes. [2025-03-09 02:43:33,092 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 147 of 147 statements. [2025-03-09 02:43:33,092 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 02:43:33,092 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:43:33,174 INFO L134 CoverageAnalysis]: Checked inductivity of 1370 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 1311 trivial. 0 not checked. [2025-03-09 02:43:33,174 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:43:33,174 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [831973495] [2025-03-09 02:43:33,174 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [831973495] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:43:33,174 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:43:33,174 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-09 02:43:33,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1964316716] [2025-03-09 02:43:33,174 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:43:33,175 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-09 02:43:33,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:43:33,175 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-09 02:43:33,175 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-09 02:43:33,175 INFO L87 Difference]: Start difference. First operand 269 states and 278 transitions. Second operand has 6 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 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-09 02:43:33,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:43:33,218 INFO L93 Difference]: Finished difference Result 279 states and 289 transitions. [2025-03-09 02:43:33,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-09 02:43:33,218 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 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 147 [2025-03-09 02:43:33,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:43:33,220 INFO L225 Difference]: With dead ends: 279 [2025-03-09 02:43:33,220 INFO L226 Difference]: Without dead ends: 278 [2025-03-09 02:43:33,221 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-09 02:43:33,221 INFO L435 NwaCegarLoop]: 22 mSDtfsCounter, 26 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 62 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-09 02:43:33,221 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 62 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 02:43:33,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2025-03-09 02:43:33,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 268. [2025-03-09 02:43:33,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 268 states, 215 states have (on average 1.027906976744186) internal successors, (221), 216 states have internal predecessors, (221), 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-09 02:43:33,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 273 transitions. [2025-03-09 02:43:33,237 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 273 transitions. Word has length 147 [2025-03-09 02:43:33,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:43:33,237 INFO L471 AbstractCegarLoop]: Abstraction has 268 states and 273 transitions. [2025-03-09 02:43:33,237 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 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-09 02:43:33,237 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 273 transitions. [2025-03-09 02:43:33,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2025-03-09 02:43:33,238 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:43:33,239 INFO L218 NwaCegarLoop]: trace histogram [25, 25, 25, 25, 25, 24, 24, 1, 1, 1, 1] [2025-03-09 02:43:33,239 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-09 02:43:33,239 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-09 02:43:33,239 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:43:33,239 INFO L85 PathProgramCache]: Analyzing trace with hash 58234941, now seen corresponding path program 4 times [2025-03-09 02:43:33,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:43:33,239 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [962760232] [2025-03-09 02:43:33,239 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-09 02:43:33,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:43:33,248 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 177 statements into 2 equivalence classes. [2025-03-09 02:43:33,275 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 177 of 177 statements. [2025-03-09 02:43:33,275 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-09 02:43:33,275 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:43:34,509 INFO L134 CoverageAnalysis]: Checked inductivity of 2076 backedges. 1913 proven. 163 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 02:43:34,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:43:34,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [962760232] [2025-03-09 02:43:34,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [962760232] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 02:43:34,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [729473752] [2025-03-09 02:43:34,509 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-09 02:43:34,509 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:43:34,509 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:43:34,511 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 02:43:34,512 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-09 02:43:34,539 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 177 statements into 2 equivalence classes. [2025-03-09 02:43:34,574 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 177 of 177 statements. [2025-03-09 02:43:34,574 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-09 02:43:34,574 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:43:34,576 INFO L256 TraceCheckSpWp]: Trace formula consists of 400 conjuncts, 52 conjuncts are in the unsatisfiable core [2025-03-09 02:43:34,580 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:43:34,809 INFO L134 CoverageAnalysis]: Checked inductivity of 2076 backedges. 2076 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 02:43:34,810 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 02:43:34,810 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [729473752] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:43:34,810 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-09 02:43:34,810 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [53] imperfect sequences [53] total 56 [2025-03-09 02:43:34,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [543010182] [2025-03-09 02:43:34,810 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:43:34,810 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 53 states [2025-03-09 02:43:34,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:43:34,811 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2025-03-09 02:43:34,812 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=712, Invalid=2368, Unknown=0, NotChecked=0, Total=3080 [2025-03-09 02:43:34,812 INFO L87 Difference]: Start difference. First operand 268 states and 273 transitions. Second operand has 53 states, 52 states have (on average 2.923076923076923) internal successors, (152), 28 states have internal predecessors, (152), 25 states have call successors, (25), 25 states have call predecessors, (25), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 02:43:35,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:43:35,391 INFO L93 Difference]: Finished difference Result 334 states and 338 transitions. [2025-03-09 02:43:35,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2025-03-09 02:43:35,391 INFO L78 Accepts]: Start accepts. Automaton has has 53 states, 52 states have (on average 2.923076923076923) internal successors, (152), 28 states have internal predecessors, (152), 25 states have call successors, (25), 25 states have call predecessors, (25), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 177 [2025-03-09 02:43:35,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:43:35,393 INFO L225 Difference]: With dead ends: 334 [2025-03-09 02:43:35,393 INFO L226 Difference]: Without dead ends: 213 [2025-03-09 02:43:35,394 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 250 GetRequests, 175 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1262 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1426, Invalid=4426, Unknown=0, NotChecked=0, Total=5852 [2025-03-09 02:43:35,394 INFO L435 NwaCegarLoop]: 67 mSDtfsCounter, 349 mSDsluCounter, 405 mSDsCounter, 0 mSdLazyCounter, 913 mSolverCounterSat, 105 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 350 SdHoareTripleChecker+Valid, 472 SdHoareTripleChecker+Invalid, 1018 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 105 IncrementalHoareTripleChecker+Valid, 913 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-09 02:43:35,395 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [350 Valid, 472 Invalid, 1018 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [105 Valid, 913 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-09 02:43:35,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2025-03-09 02:43:35,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 213. [2025-03-09 02:43:35,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 213 states, 170 states have (on average 1.0) internal successors, (170), 170 states have internal predecessors, (170), 21 states have call successors, (21), 21 states have call predecessors, (21), 21 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2025-03-09 02:43:35,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 212 transitions. [2025-03-09 02:43:35,404 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 212 transitions. Word has length 177 [2025-03-09 02:43:35,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:43:35,405 INFO L471 AbstractCegarLoop]: Abstraction has 213 states and 212 transitions. [2025-03-09 02:43:35,405 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 53 states, 52 states have (on average 2.923076923076923) internal successors, (152), 28 states have internal predecessors, (152), 25 states have call successors, (25), 25 states have call predecessors, (25), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 02:43:35,405 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 212 transitions. [2025-03-09 02:43:35,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2025-03-09 02:43:35,407 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:43:35,407 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 20, 20, 20, 20, 20, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:43:35,416 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-03-09 02:43:35,612 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2025-03-09 02:43:35,612 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-09 02:43:35,612 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:43:35,612 INFO L85 PathProgramCache]: Analyzing trace with hash -158154359, now seen corresponding path program 1 times [2025-03-09 02:43:35,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:43:35,613 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [100577220] [2025-03-09 02:43:35,613 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:43:35,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:43:35,618 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 212 statements into 1 equivalence classes. [2025-03-09 02:43:35,627 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 212 of 212 statements. [2025-03-09 02:43:35,627 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:43:35,627 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:43:35,686 INFO L134 CoverageAnalysis]: Checked inductivity of 1980 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1980 trivial. 0 not checked. [2025-03-09 02:43:35,687 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:43:35,687 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [100577220] [2025-03-09 02:43:35,687 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [100577220] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:43:35,687 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:43:35,687 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 02:43:35,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1389611890] [2025-03-09 02:43:35,687 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:43:35,687 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 02:43:35,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:43:35,688 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 02:43:35,688 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 02:43:35,688 INFO L87 Difference]: Start difference. First operand 213 states and 212 transitions. Second operand has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-09 02:43:35,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:43:35,697 INFO L93 Difference]: Finished difference Result 213 states and 212 transitions. [2025-03-09 02:43:35,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 02:43:35,697 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 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 212 [2025-03-09 02:43:35,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:43:35,698 INFO L225 Difference]: With dead ends: 213 [2025-03-09 02:43:35,698 INFO L226 Difference]: Without dead ends: 0 [2025-03-09 02:43:35,699 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 02:43:35,699 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-09 02:43:35,699 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-09 02:43:35,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-09 02:43:35,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-09 02:43:35,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 02:43:35,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-09 02:43:35,700 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 212 [2025-03-09 02:43:35,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:43:35,700 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-09 02:43:35,700 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 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-09 02:43:35,700 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-09 02:43:35,700 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-09 02:43:35,703 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 8 remaining) [2025-03-09 02:43:35,703 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 8 remaining) [2025-03-09 02:43:35,703 INFO L782 garLoopResultBuilder]: Registering result SAFE for location sumErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 8 remaining) [2025-03-09 02:43:35,703 INFO L782 garLoopResultBuilder]: Registering result SAFE for location sumErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 8 remaining) [2025-03-09 02:43:35,703 INFO L782 garLoopResultBuilder]: Registering result SAFE for location sumErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 8 remaining) [2025-03-09 02:43:35,703 INFO L782 garLoopResultBuilder]: Registering result SAFE for location sumErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 8 remaining) [2025-03-09 02:43:35,703 INFO L782 garLoopResultBuilder]: Registering result SAFE for location sumErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 8 remaining) [2025-03-09 02:43:35,703 INFO L782 garLoopResultBuilder]: Registering result SAFE for location sumErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 8 remaining) [2025-03-09 02:43:35,704 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-09 02:43:35,706 INFO L422 BasicCegarLoop]: Path program histogram: [4, 2, 2, 1, 1, 1, 1, 1] [2025-03-09 02:43:35,708 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-03-09 02:43:38,374 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-09 02:43:38,378 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.03 02:43:38 BoogieIcfgContainer [2025-03-09 02:43:38,378 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-09 02:43:38,378 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-09 02:43:38,378 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-09 02:43:38,379 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-09 02:43:38,379 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 02:43:23" (3/4) ... [2025-03-09 02:43:38,381 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-09 02:43:38,385 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure sum [2025-03-09 02:43:38,387 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2025-03-09 02:43:38,388 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2025-03-09 02:43:38,388 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-09 02:43:38,389 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-09 02:43:38,442 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-09 02:43:38,443 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-09 02:43:38,443 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-09 02:43:38,443 INFO L158 Benchmark]: Toolchain (without parser) took 15110.70ms. Allocated memory was 142.6MB in the beginning and 260.0MB in the end (delta: 117.4MB). Free memory was 113.1MB in the beginning and 202.3MB in the end (delta: -89.2MB). Peak memory consumption was 25.8MB. Max. memory is 16.1GB. [2025-03-09 02:43:38,443 INFO L158 Benchmark]: CDTParser took 0.30ms. Allocated memory is still 201.3MB. Free memory is still 123.2MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-09 02:43:38,443 INFO L158 Benchmark]: CACSL2BoogieTranslator took 138.38ms. Allocated memory is still 142.6MB. Free memory was 113.1MB in the beginning and 102.6MB in the end (delta: 10.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-09 02:43:38,444 INFO L158 Benchmark]: Boogie Procedure Inliner took 21.94ms. Allocated memory is still 142.6MB. Free memory was 102.6MB in the beginning and 101.7MB in the end (delta: 912.9kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-09 02:43:38,444 INFO L158 Benchmark]: Boogie Preprocessor took 24.75ms. Allocated memory is still 142.6MB. Free memory was 101.7MB in the beginning and 100.8MB in the end (delta: 938.2kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-09 02:43:38,445 INFO L158 Benchmark]: IcfgBuilder took 194.55ms. Allocated memory is still 142.6MB. Free memory was 100.8MB in the beginning and 90.1MB in the end (delta: 10.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-09 02:43:38,445 INFO L158 Benchmark]: TraceAbstraction took 14661.58ms. Allocated memory was 142.6MB in the beginning and 260.0MB in the end (delta: 117.4MB). Free memory was 89.2MB in the beginning and 207.8MB in the end (delta: -118.6MB). Peak memory consumption was 120.2MB. Max. memory is 16.1GB. [2025-03-09 02:43:38,445 INFO L158 Benchmark]: Witness Printer took 64.16ms. Allocated memory is still 260.0MB. Free memory was 207.8MB in the beginning and 202.3MB in the end (delta: 5.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-09 02:43:38,447 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.30ms. Allocated memory is still 201.3MB. Free memory is still 123.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 138.38ms. Allocated memory is still 142.6MB. Free memory was 113.1MB in the beginning and 102.6MB in the end (delta: 10.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 21.94ms. Allocated memory is still 142.6MB. Free memory was 102.6MB in the beginning and 101.7MB in the end (delta: 912.9kB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 24.75ms. Allocated memory is still 142.6MB. Free memory was 101.7MB in the beginning and 100.8MB in the end (delta: 938.2kB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 194.55ms. Allocated memory is still 142.6MB. Free memory was 100.8MB in the beginning and 90.1MB in the end (delta: 10.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 14661.58ms. Allocated memory was 142.6MB in the beginning and 260.0MB in the end (delta: 117.4MB). Free memory was 89.2MB in the beginning and 207.8MB in the end (delta: -118.6MB). Peak memory consumption was 120.2MB. Max. memory is 16.1GB. * Witness Printer took 64.16ms. Allocated memory is still 260.0MB. Free memory was 207.8MB in the beginning and 202.3MB in the end (delta: 5.5MB). 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, 32 locations, 36 edges, 8 error locations. Started 1 CEGAR loops. OverallTime: 12.0s, OverallIterations: 13, TraceHistogramMax: 25, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 3.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2462 SdHoareTripleChecker+Valid, 1.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2447 mSDsluCounter, 3156 SdHoareTripleChecker+Invalid, 1.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2765 mSDsCounter, 357 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3397 IncrementalHoareTripleChecker+Invalid, 3754 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 357 mSolverCounterUnsat, 391 mSDtfsCounter, 3397 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1007 GetRequests, 593 SyntacticMatches, 4 SemanticMatches, 410 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6200 ImplicationChecksByTransitivity, 4.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=269occurred in iteration=10, InterpolantAutomatonStates: 254, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 13 MinimizatonAttempts, 62 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 5.7s InterpolantComputationTime, 1290 NumberOfCodeBlocks, 1290 NumberOfCodeBlocksAsserted, 50 NumberOfCheckSat, 1526 ConstructedInterpolants, 0 QuantifiedInterpolants, 3928 SizeOfPredicates, 64 NumberOfNonLiveVariables, 1151 ConjunctsInSsa, 144 ConjunctsInUnsatCore, 27 InterpolantComputations, 7 PerfectInterpolantSequences, 7355/10242 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-09 02:43:38,460 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE