./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/recursive-simple/sum_10x0-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 023d838f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/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.5.800.v20200727-1323.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_10x0-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 68d0cd7d514b491e1404560081afc21267eb1b3dae98cdb9832a8634357d65e4 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 19:39:45,858 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 19:39:45,931 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2024-11-10 19:39:45,937 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 19:39:45,937 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 19:39:45,960 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 19:39:45,960 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 19:39:45,961 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 19:39:45,961 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 19:39:45,961 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 19:39:45,961 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 19:39:45,962 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 19:39:45,962 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 19:39:45,967 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 19:39:45,967 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 19:39:45,967 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 19:39:45,967 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 19:39:45,967 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 19:39:45,968 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 19:39:45,968 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 19:39:45,968 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 19:39:45,970 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 19:39:45,970 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 19:39:45,970 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 19:39:45,970 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 19:39:45,971 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-11-10 19:39:45,971 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-10 19:39:45,971 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 19:39:45,971 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 19:39:45,971 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 19:39:45,971 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 19:39:45,972 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 19:39:45,972 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 19:39:45,972 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 19:39:45,972 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 19:39:45,973 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 19:39:45,973 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 19:39:45,973 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 19:39:45,974 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 19:39:45,974 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 19:39:45,974 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 19:39:45,976 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 19:39:45,976 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 19:39:45,977 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 19:39:45,977 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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 -> 68d0cd7d514b491e1404560081afc21267eb1b3dae98cdb9832a8634357d65e4 [2024-11-10 19:39:46,181 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 19:39:46,201 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 19:39:46,204 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 19:39:46,205 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 19:39:46,206 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 19:39:46,207 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/recursive-simple/sum_10x0-1.c [2024-11-10 19:39:47,545 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 19:39:47,729 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 19:39:47,729 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive-simple/sum_10x0-1.c [2024-11-10 19:39:47,734 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7e0aca67f/53d14db3b12a48feb4e21a4163d20b13/FLAGea815bf17 [2024-11-10 19:39:48,134 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7e0aca67f/53d14db3b12a48feb4e21a4163d20b13 [2024-11-10 19:39:48,136 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 19:39:48,137 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 19:39:48,138 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 19:39:48,138 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 19:39:48,143 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 19:39:48,143 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 07:39:48" (1/1) ... [2024-11-10 19:39:48,144 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7c956ab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:39:48, skipping insertion in model container [2024-11-10 19:39:48,144 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 07:39:48" (1/1) ... [2024-11-10 19:39:48,161 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 19:39:48,291 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 19:39:48,301 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 19:39:48,318 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 19:39:48,334 INFO L204 MainTranslator]: Completed translation [2024-11-10 19:39:48,334 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:39:48 WrapperNode [2024-11-10 19:39:48,334 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 19:39:48,335 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 19:39:48,335 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 19:39:48,335 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 19:39:48,341 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:39:48" (1/1) ... [2024-11-10 19:39:48,347 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:39:48" (1/1) ... [2024-11-10 19:39:48,360 INFO L138 Inliner]: procedures = 12, calls = 10, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 22 [2024-11-10 19:39:48,360 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 19:39:48,361 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 19:39:48,361 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 19:39:48,361 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 19:39:48,369 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:39:48" (1/1) ... [2024-11-10 19:39:48,369 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:39:48" (1/1) ... [2024-11-10 19:39:48,370 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:39:48" (1/1) ... [2024-11-10 19:39:48,383 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]. [2024-11-10 19:39:48,383 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:39:48" (1/1) ... [2024-11-10 19:39:48,383 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:39:48" (1/1) ... [2024-11-10 19:39:48,385 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:39:48" (1/1) ... [2024-11-10 19:39:48,385 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:39:48" (1/1) ... [2024-11-10 19:39:48,386 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:39:48" (1/1) ... [2024-11-10 19:39:48,386 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:39:48" (1/1) ... [2024-11-10 19:39:48,388 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 19:39:48,390 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 19:39:48,390 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 19:39:48,391 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 19:39:48,392 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:39:48" (1/1) ... [2024-11-10 19:39:48,396 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 19:39:48,409 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 19:39:48,423 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) [2024-11-10 19:39:48,424 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 [2024-11-10 19:39:48,460 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 19:39:48,460 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 19:39:48,460 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 19:39:48,460 INFO L130 BoogieDeclarations]: Found specification of procedure sum [2024-11-10 19:39:48,460 INFO L138 BoogieDeclarations]: Found implementation of procedure sum [2024-11-10 19:39:48,460 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-10 19:39:48,508 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 19:39:48,510 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 19:39:48,603 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L9: havoc #t~ret4; [2024-11-10 19:39:48,610 INFO L? ?]: Removed 22 outVars from TransFormulas that were not future-live. [2024-11-10 19:39:48,610 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 19:39:48,624 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 19:39:48,624 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 19:39:48,624 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 07:39:48 BoogieIcfgContainer [2024-11-10 19:39:48,625 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 19:39:48,626 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 19:39:48,626 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 19:39:48,631 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 19:39:48,631 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 07:39:48" (1/3) ... [2024-11-10 19:39:48,632 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a929624 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 07:39:48, skipping insertion in model container [2024-11-10 19:39:48,636 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:39:48" (2/3) ... [2024-11-10 19:39:48,637 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a929624 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 07:39:48, skipping insertion in model container [2024-11-10 19:39:48,637 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 07:39:48" (3/3) ... [2024-11-10 19:39:48,638 INFO L112 eAbstractionObserver]: Analyzing ICFG sum_10x0-1.c [2024-11-10 19:39:48,652 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 19:39:48,652 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 8 error locations. [2024-11-10 19:39:48,698 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 19:39:48,703 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;@7b20b28e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 19:39:48,704 INFO L334 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2024-11-10 19:39:48,707 INFO L276 IsEmpty]: Start isEmpty. Operand has 33 states, 21 states have (on average 1.4761904761904763) internal successors, (31), 29 states have internal predecessors, (31), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-10 19:39:48,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-10 19:39:48,714 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 19:39:48,714 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-10 19:39:48,715 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting sumErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, sumErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-11-10 19:39:48,720 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 19:39:48,721 INFO L85 PathProgramCache]: Analyzing trace with hash 1242256818, now seen corresponding path program 1 times [2024-11-10 19:39:48,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 19:39:48,729 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2143884988] [2024-11-10 19:39:48,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 19:39:48,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 19:39:48,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:39:48,909 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 19:39:48,910 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 19:39:48,910 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2143884988] [2024-11-10 19:39:48,910 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2143884988] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 19:39:48,910 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 19:39:48,911 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 19:39:48,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [232035298] [2024-11-10 19:39:48,912 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 19:39:48,920 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 19:39:48,920 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 19:39:48,950 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 19:39:48,951 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 19:39:48,952 INFO L87 Difference]: Start difference. First operand has 33 states, 21 states have (on average 1.4761904761904763) internal successors, (31), 29 states have internal predecessors, (31), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) 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) [2024-11-10 19:39:49,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 19:39:49,072 INFO L93 Difference]: Finished difference Result 64 states and 67 transitions. [2024-11-10 19:39:49,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 19:39:49,075 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 [2024-11-10 19:39:49,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 19:39:49,082 INFO L225 Difference]: With dead ends: 64 [2024-11-10 19:39:49,082 INFO L226 Difference]: Without dead ends: 40 [2024-11-10 19:39:49,084 INFO L431 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 [2024-11-10 19:39:49,087 INFO L432 NwaCegarLoop]: 22 mSDtfsCounter, 23 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 19:39:49,087 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 76 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 19:39:49,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2024-11-10 19:39:49,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 37. [2024-11-10 19:39:49,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 24 states have (on average 1.4583333333333333) internal successors, (35), 31 states have internal predecessors, (35), 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) [2024-11-10 19:39:49,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 41 transitions. [2024-11-10 19:39:49,116 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 41 transitions. Word has length 6 [2024-11-10 19:39:49,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 19:39:49,117 INFO L471 AbstractCegarLoop]: Abstraction has 37 states and 41 transitions. [2024-11-10 19:39:49,117 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) [2024-11-10 19:39:49,117 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 41 transitions. [2024-11-10 19:39:49,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-10 19:39:49,117 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 19:39:49,117 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-10 19:39:49,118 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-10 19:39:49,118 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting sumErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, sumErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-11-10 19:39:49,118 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 19:39:49,118 INFO L85 PathProgramCache]: Analyzing trace with hash -144743008, now seen corresponding path program 1 times [2024-11-10 19:39:49,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 19:39:49,119 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1162164791] [2024-11-10 19:39:49,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 19:39:49,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 19:39:49,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:39:49,192 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 19:39:49,192 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 19:39:49,192 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1162164791] [2024-11-10 19:39:49,192 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1162164791] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 19:39:49,192 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 19:39:49,192 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 19:39:49,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [684415632] [2024-11-10 19:39:49,193 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 19:39:49,194 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 19:39:49,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 19:39:49,194 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 19:39:49,194 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 19:39:49,195 INFO L87 Difference]: Start difference. First operand 37 states and 41 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) [2024-11-10 19:39:49,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 19:39:49,259 INFO L93 Difference]: Finished difference Result 39 states and 44 transitions. [2024-11-10 19:39:49,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 19:39:49,260 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 [2024-11-10 19:39:49,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 19:39:49,261 INFO L225 Difference]: With dead ends: 39 [2024-11-10 19:39:49,262 INFO L226 Difference]: Without dead ends: 38 [2024-11-10 19:39:49,262 INFO L431 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 [2024-11-10 19:39:49,263 INFO L432 NwaCegarLoop]: 12 mSDtfsCounter, 29 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 19:39:49,263 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 29 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 19:39:49,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2024-11-10 19:39:49,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 36. [2024-11-10 19:39:49,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 24 states have (on average 1.375) internal successors, (33), 30 states have internal predecessors, (33), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-10 19:39:49,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 39 transitions. [2024-11-10 19:39:49,270 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 39 transitions. Word has length 7 [2024-11-10 19:39:49,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 19:39:49,270 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 39 transitions. [2024-11-10 19:39:49,270 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) [2024-11-10 19:39:49,270 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 39 transitions. [2024-11-10 19:39:49,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-10 19:39:49,274 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 19:39:49,274 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 19:39:49,275 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-10 19:39:49,275 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting sumErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, sumErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-11-10 19:39:49,275 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 19:39:49,275 INFO L85 PathProgramCache]: Analyzing trace with hash -192065958, now seen corresponding path program 1 times [2024-11-10 19:39:49,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 19:39:49,276 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [424024089] [2024-11-10 19:39:49,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 19:39:49,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 19:39:49,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:39:49,379 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 19:39:49,379 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 19:39:49,379 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [424024089] [2024-11-10 19:39:49,379 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [424024089] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 19:39:49,379 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 19:39:49,379 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 19:39:49,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [170454877] [2024-11-10 19:39:49,380 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 19:39:49,380 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 19:39:49,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 19:39:49,380 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 19:39:49,380 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 19:39:49,381 INFO L87 Difference]: Start difference. First operand 36 states and 39 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) [2024-11-10 19:39:49,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 19:39:49,475 INFO L93 Difference]: Finished difference Result 38 states and 39 transitions. [2024-11-10 19:39:49,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 19:39:49,480 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 [2024-11-10 19:39:49,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 19:39:49,481 INFO L225 Difference]: With dead ends: 38 [2024-11-10 19:39:49,481 INFO L226 Difference]: Without dead ends: 36 [2024-11-10 19:39:49,483 INFO L431 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 [2024-11-10 19:39:49,484 INFO L432 NwaCegarLoop]: 21 mSDtfsCounter, 14 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 19:39:49,484 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 71 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 19:39:49,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2024-11-10 19:39:49,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2024-11-10 19:39:49,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 30 states have internal predecessors, (31), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-10 19:39:49,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 37 transitions. [2024-11-10 19:39:49,490 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 37 transitions. Word has length 8 [2024-11-10 19:39:49,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 19:39:49,490 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 37 transitions. [2024-11-10 19:39:49,490 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) [2024-11-10 19:39:49,490 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 37 transitions. [2024-11-10 19:39:49,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-10 19:39:49,491 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 19:39:49,491 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 19:39:49,491 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-10 19:39:49,491 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting sumErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, sumErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-11-10 19:39:49,491 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 19:39:49,492 INFO L85 PathProgramCache]: Analyzing trace with hash -1900437619, now seen corresponding path program 1 times [2024-11-10 19:39:49,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 19:39:49,492 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1949141085] [2024-11-10 19:39:49,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 19:39:49,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 19:39:49,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:39:49,600 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 19:39:49,601 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 19:39:49,602 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1949141085] [2024-11-10 19:39:49,602 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1949141085] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 19:39:49,602 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [612014354] [2024-11-10 19:39:49,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 19:39:49,603 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 19:39:49,603 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 19:39:49,605 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) [2024-11-10 19:39:49,609 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-10 19:39:49,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:39:49,657 INFO L255 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-10 19:39:49,662 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 19:39:49,715 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 19:39:49,715 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 19:39:49,785 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 19:39:49,786 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [612014354] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 19:39:49,786 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 19:39:49,786 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 12 [2024-11-10 19:39:49,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1040280179] [2024-11-10 19:39:49,786 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 19:39:49,787 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-10 19:39:49,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 19:39:49,787 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-10 19:39:49,788 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2024-11-10 19:39:49,788 INFO L87 Difference]: Start difference. First operand 36 states and 37 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) [2024-11-10 19:39:49,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 19:39:49,922 INFO L93 Difference]: Finished difference Result 90 states and 99 transitions. [2024-11-10 19:39:49,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-10 19:39:49,923 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 [2024-11-10 19:39:49,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 19:39:49,924 INFO L225 Difference]: With dead ends: 90 [2024-11-10 19:39:49,924 INFO L226 Difference]: Without dead ends: 73 [2024-11-10 19:39:49,924 INFO L431 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 [2024-11-10 19:39:49,927 INFO L432 NwaCegarLoop]: 25 mSDtfsCounter, 104 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 19:39:49,928 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 123 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 19:39:49,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2024-11-10 19:39:49,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 65. [2024-11-10 19:39:49,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 48 states have (on average 1.25) internal successors, (60), 53 states have internal predecessors, (60), 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) [2024-11-10 19:39:49,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 72 transitions. [2024-11-10 19:39:49,942 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 72 transitions. Word has length 13 [2024-11-10 19:39:49,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 19:39:49,942 INFO L471 AbstractCegarLoop]: Abstraction has 65 states and 72 transitions. [2024-11-10 19:39:49,942 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) [2024-11-10 19:39:49,942 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 72 transitions. [2024-11-10 19:39:49,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-10 19:39:49,943 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 19:39:49,943 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 19:39:49,957 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-10 19:39:50,145 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 [2024-11-10 19:39:50,146 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting sumErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, sumErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-11-10 19:39:50,146 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 19:39:50,146 INFO L85 PathProgramCache]: Analyzing trace with hash -959410827, now seen corresponding path program 1 times [2024-11-10 19:39:50,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 19:39:50,146 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1903869712] [2024-11-10 19:39:50,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 19:39:50,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 19:39:50,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:39:50,226 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 19:39:50,226 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 19:39:50,226 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1903869712] [2024-11-10 19:39:50,226 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1903869712] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 19:39:50,226 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1100699566] [2024-11-10 19:39:50,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 19:39:50,226 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 19:39:50,227 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 19:39:50,228 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) [2024-11-10 19:39:50,228 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-10 19:39:50,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:39:50,259 INFO L255 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-10 19:39:50,260 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 19:39:50,300 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 19:39:50,300 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 19:39:50,301 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1100699566] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 19:39:50,301 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-10 19:39:50,301 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 9 [2024-11-10 19:39:50,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2113262032] [2024-11-10 19:39:50,301 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 19:39:50,301 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 19:39:50,301 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 19:39:50,302 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 19:39:50,302 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-11-10 19:39:50,302 INFO L87 Difference]: Start difference. First operand 65 states and 72 transitions. Second operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 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) [2024-11-10 19:39:50,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 19:39:50,350 INFO L93 Difference]: Finished difference Result 67 states and 75 transitions. [2024-11-10 19:39:50,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 19:39:50,352 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 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 [2024-11-10 19:39:50,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 19:39:50,353 INFO L225 Difference]: With dead ends: 67 [2024-11-10 19:39:50,353 INFO L226 Difference]: Without dead ends: 66 [2024-11-10 19:39:50,353 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2024-11-10 19:39:50,354 INFO L432 NwaCegarLoop]: 22 mSDtfsCounter, 29 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 19:39:50,354 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 50 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 19:39:50,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2024-11-10 19:39:50,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 64. [2024-11-10 19:39:50,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 48 states have (on average 1.1666666666666667) internal successors, (56), 52 states have internal predecessors, (56), 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) [2024-11-10 19:39:50,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 68 transitions. [2024-11-10 19:39:50,368 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 68 transitions. Word has length 15 [2024-11-10 19:39:50,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 19:39:50,368 INFO L471 AbstractCegarLoop]: Abstraction has 64 states and 68 transitions. [2024-11-10 19:39:50,368 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 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) [2024-11-10 19:39:50,368 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 68 transitions. [2024-11-10 19:39:50,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-10 19:39:50,369 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 19:39:50,369 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2024-11-10 19:39:50,381 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-10 19:39:50,569 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 [2024-11-10 19:39:50,569 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting sumErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, sumErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-11-10 19:39:50,570 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 19:39:50,570 INFO L85 PathProgramCache]: Analyzing trace with hash 323035427, now seen corresponding path program 1 times [2024-11-10 19:39:50,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 19:39:50,570 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [327954754] [2024-11-10 19:39:50,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 19:39:50,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 19:39:50,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:39:50,644 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 19:39:50,645 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 19:39:50,645 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [327954754] [2024-11-10 19:39:50,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [327954754] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 19:39:50,645 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1595881064] [2024-11-10 19:39:50,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 19:39:50,645 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 19:39:50,645 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 19:39:50,650 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) [2024-11-10 19:39:50,651 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-10 19:39:50,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:39:50,680 INFO L255 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-10 19:39:50,681 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 19:39:50,730 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 19:39:50,730 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 19:39:50,791 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 19:39:50,792 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1595881064] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 19:39:50,792 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 19:39:50,792 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 14 [2024-11-10 19:39:50,792 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [847033071] [2024-11-10 19:39:50,794 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 19:39:50,794 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-10 19:39:50,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 19:39:50,794 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-10 19:39:50,795 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=160, Unknown=0, NotChecked=0, Total=210 [2024-11-10 19:39:50,795 INFO L87 Difference]: Start difference. First operand 64 states and 68 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) [2024-11-10 19:39:50,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 19:39:50,911 INFO L93 Difference]: Finished difference Result 67 states and 71 transitions. [2024-11-10 19:39:50,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-10 19:39:50,911 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 [2024-11-10 19:39:50,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 19:39:50,912 INFO L225 Difference]: With dead ends: 67 [2024-11-10 19:39:50,912 INFO L226 Difference]: Without dead ends: 66 [2024-11-10 19:39:50,912 INFO L431 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 [2024-11-10 19:39:50,913 INFO L432 NwaCegarLoop]: 25 mSDtfsCounter, 70 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 19:39:50,913 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 132 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 19:39:50,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2024-11-10 19:39:50,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 64. [2024-11-10 19:39:50,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 48 states have (on average 1.1041666666666667) internal successors, (53), 52 states have internal predecessors, (53), 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) [2024-11-10 19:39:50,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 65 transitions. [2024-11-10 19:39:50,936 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 65 transitions. Word has length 16 [2024-11-10 19:39:50,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 19:39:50,936 INFO L471 AbstractCegarLoop]: Abstraction has 64 states and 65 transitions. [2024-11-10 19:39:50,936 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) [2024-11-10 19:39:50,936 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 65 transitions. [2024-11-10 19:39:50,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-10 19:39:50,937 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 19:39:50,937 INFO L215 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1] [2024-11-10 19:39:50,951 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-10 19:39:51,141 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 [2024-11-10 19:39:51,142 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting sumErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, sumErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-11-10 19:39:51,143 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 19:39:51,143 INFO L85 PathProgramCache]: Analyzing trace with hash -1802042126, now seen corresponding path program 2 times [2024-11-10 19:39:51,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 19:39:51,143 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1110443932] [2024-11-10 19:39:51,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 19:39:51,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 19:39:51,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:39:51,337 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 19:39:51,337 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 19:39:51,337 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1110443932] [2024-11-10 19:39:51,337 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1110443932] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 19:39:51,338 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1709774690] [2024-11-10 19:39:51,338 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-10 19:39:51,338 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 19:39:51,338 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 19:39:51,341 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) [2024-11-10 19:39:51,342 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-10 19:39:51,375 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-10 19:39:51,376 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-10 19:39:51,377 INFO L255 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-10 19:39:51,378 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 19:39:51,457 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 19:39:51,457 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 19:39:51,619 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 19:39:51,619 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1709774690] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 19:39:51,619 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 19:39:51,619 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 24 [2024-11-10 19:39:51,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [890135569] [2024-11-10 19:39:51,620 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 19:39:51,620 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-11-10 19:39:51,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 19:39:51,622 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-11-10 19:39:51,622 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=416, Unknown=0, NotChecked=0, Total=552 [2024-11-10 19:39:51,623 INFO L87 Difference]: Start difference. First operand 64 states and 65 transitions. Second operand has 24 states, 22 states have (on average 2.5454545454545454) internal successors, (56), 14 states have internal predecessors, (56), 10 states have call successors, (10), 10 states have call predecessors, (10), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 19:39:51,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 19:39:51,888 INFO L93 Difference]: Finished difference Result 157 states and 169 transitions. [2024-11-10 19:39:51,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-11-10 19:39:51,888 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 22 states have (on average 2.5454545454545454) internal successors, (56), 14 states have internal predecessors, (56), 10 states have call successors, (10), 10 states have call predecessors, (10), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2024-11-10 19:39:51,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 19:39:51,889 INFO L225 Difference]: With dead ends: 157 [2024-11-10 19:39:51,889 INFO L226 Difference]: Without dead ends: 132 [2024-11-10 19:39:51,890 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 180 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=311, Invalid=811, Unknown=0, NotChecked=0, Total=1122 [2024-11-10 19:39:51,891 INFO L432 NwaCegarLoop]: 36 mSDtfsCounter, 190 mSDsluCounter, 266 mSDsCounter, 0 mSdLazyCounter, 220 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 192 SdHoareTripleChecker+Valid, 302 SdHoareTripleChecker+Invalid, 242 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 220 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 19:39:51,891 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [192 Valid, 302 Invalid, 242 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 220 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 19:39:51,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2024-11-10 19:39:51,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 124. [2024-11-10 19:39:51,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 96 states have (on average 1.1145833333333333) internal successors, (107), 100 states have internal predecessors, (107), 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) [2024-11-10 19:39:51,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 131 transitions. [2024-11-10 19:39:51,915 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 131 transitions. Word has length 34 [2024-11-10 19:39:51,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 19:39:51,915 INFO L471 AbstractCegarLoop]: Abstraction has 124 states and 131 transitions. [2024-11-10 19:39:51,915 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 22 states have (on average 2.5454545454545454) internal successors, (56), 14 states have internal predecessors, (56), 10 states have call successors, (10), 10 states have call predecessors, (10), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 19:39:51,915 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 131 transitions. [2024-11-10 19:39:51,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-10 19:39:51,916 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 19:39:51,916 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 1, 1, 1, 1] [2024-11-10 19:39:51,930 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-11-10 19:39:52,120 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 [2024-11-10 19:39:52,121 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting sumErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, sumErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-11-10 19:39:52,121 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 19:39:52,121 INFO L85 PathProgramCache]: Analyzing trace with hash -1839495778, now seen corresponding path program 2 times [2024-11-10 19:39:52,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 19:39:52,121 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1369843517] [2024-11-10 19:39:52,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 19:39:52,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 19:39:52,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:39:52,244 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 19:39:52,244 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 19:39:52,244 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1369843517] [2024-11-10 19:39:52,245 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1369843517] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 19:39:52,245 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1120854680] [2024-11-10 19:39:52,245 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-10 19:39:52,245 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 19:39:52,245 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 19:39:52,246 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) [2024-11-10 19:39:52,248 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-10 19:39:52,289 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-10 19:39:52,289 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-10 19:39:52,290 INFO L255 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-10 19:39:52,291 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 19:39:52,365 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 19:39:52,365 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 19:39:52,531 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 19:39:52,532 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1120854680] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 19:39:52,532 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 19:39:52,532 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 26 [2024-11-10 19:39:52,532 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1747687259] [2024-11-10 19:39:52,532 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 19:39:52,533 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2024-11-10 19:39:52,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 19:39:52,533 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2024-11-10 19:39:52,534 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=164, Invalid=538, Unknown=0, NotChecked=0, Total=702 [2024-11-10 19:39:52,534 INFO L87 Difference]: Start difference. First operand 124 states and 131 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) [2024-11-10 19:39:52,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 19:39:52,742 INFO L93 Difference]: Finished difference Result 127 states and 134 transitions. [2024-11-10 19:39:52,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-11-10 19:39:52,743 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 [2024-11-10 19:39:52,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 19:39:52,744 INFO L225 Difference]: With dead ends: 127 [2024-11-10 19:39:52,744 INFO L226 Difference]: Without dead ends: 126 [2024-11-10 19:39:52,745 INFO L431 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 [2024-11-10 19:39:52,745 INFO L432 NwaCegarLoop]: 37 mSDtfsCounter, 192 mSDsluCounter, 250 mSDsCounter, 0 mSdLazyCounter, 198 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 194 SdHoareTripleChecker+Valid, 287 SdHoareTripleChecker+Invalid, 221 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 198 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 19:39:52,746 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [194 Valid, 287 Invalid, 221 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 198 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 19:39:52,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2024-11-10 19:39:52,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 124. [2024-11-10 19:39:52,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 96 states have (on average 1.0520833333333333) internal successors, (101), 100 states have internal predecessors, (101), 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) [2024-11-10 19:39:52,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 125 transitions. [2024-11-10 19:39:52,755 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 125 transitions. Word has length 37 [2024-11-10 19:39:52,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 19:39:52,756 INFO L471 AbstractCegarLoop]: Abstraction has 124 states and 125 transitions. [2024-11-10 19:39:52,756 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) [2024-11-10 19:39:52,756 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 125 transitions. [2024-11-10 19:39:52,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2024-11-10 19:39:52,757 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 19:39:52,757 INFO L215 NwaCegarLoop]: trace histogram [11, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1] [2024-11-10 19:39:52,769 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-10 19:39:52,961 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 [2024-11-10 19:39:52,962 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting sumErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, sumErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-11-10 19:39:52,962 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 19:39:52,962 INFO L85 PathProgramCache]: Analyzing trace with hash 1163737042, now seen corresponding path program 3 times [2024-11-10 19:39:52,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 19:39:52,962 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [372899065] [2024-11-10 19:39:52,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 19:39:52,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 19:39:52,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:39:53,341 INFO L134 CoverageAnalysis]: Checked inductivity of 335 backedges. 212 proven. 123 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 19:39:53,343 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 19:39:53,343 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [372899065] [2024-11-10 19:39:53,344 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [372899065] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 19:39:53,344 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1144406782] [2024-11-10 19:39:53,344 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-10 19:39:53,344 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 19:39:53,344 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 19:39:53,345 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) [2024-11-10 19:39:53,347 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-10 19:39:53,381 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-11-10 19:39:53,382 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-10 19:39:53,382 INFO L255 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-10 19:39:53,384 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 19:39:53,472 INFO L134 CoverageAnalysis]: Checked inductivity of 335 backedges. 65 proven. 0 refuted. 0 times theorem prover too weak. 270 trivial. 0 not checked. [2024-11-10 19:39:53,472 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 19:39:53,473 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1144406782] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 19:39:53,473 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-10 19:39:53,473 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [24] total 28 [2024-11-10 19:39:53,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1152262217] [2024-11-10 19:39:53,473 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 19:39:53,473 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 19:39:53,473 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 19:39:53,474 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 19:39:53,474 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=684, Unknown=0, NotChecked=0, Total=812 [2024-11-10 19:39:53,474 INFO L87 Difference]: Start difference. First operand 124 states and 125 transitions. Second operand has 6 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 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) [2024-11-10 19:39:53,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 19:39:53,546 INFO L93 Difference]: Finished difference Result 126 states and 128 transitions. [2024-11-10 19:39:53,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-10 19:39:53,547 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 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 76 [2024-11-10 19:39:53,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 19:39:53,548 INFO L225 Difference]: With dead ends: 126 [2024-11-10 19:39:53,548 INFO L226 Difference]: Without dead ends: 125 [2024-11-10 19:39:53,549 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 213 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=144, Invalid=848, Unknown=0, NotChecked=0, Total=992 [2024-11-10 19:39:53,550 INFO L432 NwaCegarLoop]: 16 mSDtfsCounter, 34 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 19:39:53,551 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 49 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 19:39:53,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2024-11-10 19:39:53,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 123. [2024-11-10 19:39:53,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 96 states have (on average 1.0416666666666667) internal successors, (100), 99 states have internal predecessors, (100), 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) [2024-11-10 19:39:53,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 124 transitions. [2024-11-10 19:39:53,568 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 124 transitions. Word has length 76 [2024-11-10 19:39:53,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 19:39:53,571 INFO L471 AbstractCegarLoop]: Abstraction has 123 states and 124 transitions. [2024-11-10 19:39:53,571 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 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) [2024-11-10 19:39:53,571 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 124 transitions. [2024-11-10 19:39:53,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-11-10 19:39:53,573 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 19:39:53,573 INFO L215 NwaCegarLoop]: trace histogram [11, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1] [2024-11-10 19:39:53,591 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-10 19:39:53,773 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 [2024-11-10 19:39:53,774 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting sumErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, sumErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-11-10 19:39:53,774 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 19:39:53,774 INFO L85 PathProgramCache]: Analyzing trace with hash 1716109919, now seen corresponding path program 1 times [2024-11-10 19:39:53,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 19:39:53,774 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [915229883] [2024-11-10 19:39:53,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 19:39:53,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 19:39:53,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:39:54,143 INFO L134 CoverageAnalysis]: Checked inductivity of 335 backedges. 0 proven. 335 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 19:39:54,143 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 19:39:54,143 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [915229883] [2024-11-10 19:39:54,143 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [915229883] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 19:39:54,143 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1989227443] [2024-11-10 19:39:54,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 19:39:54,144 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 19:39:54,144 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 19:39:54,147 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) [2024-11-10 19:39:54,149 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-10 19:39:54,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:39:54,191 INFO L255 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-11-10 19:39:54,193 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 19:39:54,330 INFO L134 CoverageAnalysis]: Checked inductivity of 335 backedges. 0 proven. 335 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 19:39:54,331 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 19:39:54,857 INFO L134 CoverageAnalysis]: Checked inductivity of 335 backedges. 0 proven. 335 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 19:39:54,857 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1989227443] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 19:39:54,857 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 19:39:54,857 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 53 [2024-11-10 19:39:54,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [664323252] [2024-11-10 19:39:54,858 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 19:39:54,858 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 54 states [2024-11-10 19:39:54,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 19:39:54,859 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2024-11-10 19:39:54,860 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=629, Invalid=2233, Unknown=0, NotChecked=0, Total=2862 [2024-11-10 19:39:54,860 INFO L87 Difference]: Start difference. First operand 123 states and 124 transitions. Second operand has 54 states, 50 states have (on average 2.82) internal successors, (141), 31 states have internal predecessors, (141), 24 states have call successors, (24), 23 states have call predecessors, (24), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 19:39:55,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 19:39:55,773 INFO L93 Difference]: Finished difference Result 291 states and 325 transitions. [2024-11-10 19:39:55,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2024-11-10 19:39:55,774 INFO L78 Accepts]: Start accepts. Automaton has has 54 states, 50 states have (on average 2.82) internal successors, (141), 31 states have internal predecessors, (141), 24 states have call successors, (24), 23 states have call predecessors, (24), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 77 [2024-11-10 19:39:55,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 19:39:55,775 INFO L225 Difference]: With dead ends: 291 [2024-11-10 19:39:55,775 INFO L226 Difference]: Without dead ends: 289 [2024-11-10 19:39:55,777 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 212 GetRequests, 125 SyntacticMatches, 0 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1882 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1788, Invalid=6044, Unknown=0, NotChecked=0, Total=7832 [2024-11-10 19:39:55,778 INFO L432 NwaCegarLoop]: 30 mSDtfsCounter, 822 mSDsluCounter, 417 mSDsCounter, 0 mSdLazyCounter, 445 mSolverCounterSat, 109 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 823 SdHoareTripleChecker+Valid, 447 SdHoareTripleChecker+Invalid, 554 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 109 IncrementalHoareTripleChecker+Valid, 445 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-10 19:39:55,778 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [823 Valid, 447 Invalid, 554 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [109 Valid, 445 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-10 19:39:55,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2024-11-10 19:39:55,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 265. [2024-11-10 19:39:55,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 265 states, 217 states have (on average 1.064516129032258) internal successors, (231), 219 states have internal predecessors, (231), 23 states have call successors, (23), 22 states have call predecessors, (23), 22 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-11-10 19:39:55,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 277 transitions. [2024-11-10 19:39:55,794 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 277 transitions. Word has length 77 [2024-11-10 19:39:55,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 19:39:55,794 INFO L471 AbstractCegarLoop]: Abstraction has 265 states and 277 transitions. [2024-11-10 19:39:55,795 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 54 states, 50 states have (on average 2.82) internal successors, (141), 31 states have internal predecessors, (141), 24 states have call successors, (24), 23 states have call predecessors, (24), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 19:39:55,795 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 277 transitions. [2024-11-10 19:39:55,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-11-10 19:39:55,800 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 19:39:55,800 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 19:39:55,813 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-11-10 19:39:56,001 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 [2024-11-10 19:39:56,001 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, sumErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-11-10 19:39:56,001 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 19:39:56,001 INFO L85 PathProgramCache]: Analyzing trace with hash 1671054385, now seen corresponding path program 1 times [2024-11-10 19:39:56,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 19:39:56,002 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1912499717] [2024-11-10 19:39:56,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 19:39:56,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 19:39:56,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:39:56,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 19:39:56,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:39:56,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 19:39:56,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:39:56,094 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 19:39:56,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:39:56,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 19:39:56,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:39:56,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 19:39:56,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:39:56,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 19:39:56,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:39:56,144 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 19:39:56,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:39:56,151 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 19:39:56,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:39:56,156 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 19:39:56,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:39:56,160 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 19:39:56,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:39:56,163 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 19:39:56,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:39:56,165 INFO L134 CoverageAnalysis]: Checked inductivity of 490 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 490 trivial. 0 not checked. [2024-11-10 19:39:56,166 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 19:39:56,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1912499717] [2024-11-10 19:39:56,166 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1912499717] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 19:39:56,166 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 19:39:56,166 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 19:39:56,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1147150513] [2024-11-10 19:39:56,166 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 19:39:56,167 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 19:39:56,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 19:39:56,168 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 19:39:56,168 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 19:39:56,168 INFO L87 Difference]: Start difference. First operand 265 states and 277 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) [2024-11-10 19:39:56,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 19:39:56,180 INFO L93 Difference]: Finished difference Result 265 states and 277 transitions. [2024-11-10 19:39:56,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 19:39:56,181 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 112 [2024-11-10 19:39:56,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 19:39:56,182 INFO L225 Difference]: With dead ends: 265 [2024-11-10 19:39:56,182 INFO L226 Difference]: Without dead ends: 264 [2024-11-10 19:39:56,183 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 19:39:56,183 INFO L432 NwaCegarLoop]: 20 mSDtfsCounter, 1 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 19:39:56,183 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 37 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 19:39:56,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2024-11-10 19:39:56,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 264. [2024-11-10 19:39:56,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 264 states, 217 states have (on average 1.0599078341013826) internal successors, (230), 218 states have internal predecessors, (230), 23 states have call successors, (23), 22 states have call predecessors, (23), 22 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-11-10 19:39:56,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 276 transitions. [2024-11-10 19:39:56,199 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 276 transitions. Word has length 112 [2024-11-10 19:39:56,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 19:39:56,200 INFO L471 AbstractCegarLoop]: Abstraction has 264 states and 276 transitions. [2024-11-10 19:39:56,200 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) [2024-11-10 19:39:56,200 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 276 transitions. [2024-11-10 19:39:56,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-11-10 19:39:56,202 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 19:39:56,203 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 19:39:56,203 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-10 19:39:56,204 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, sumErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-11-10 19:39:56,204 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 19:39:56,204 INFO L85 PathProgramCache]: Analyzing trace with hash 263078358, now seen corresponding path program 1 times [2024-11-10 19:39:56,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 19:39:56,204 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [10740540] [2024-11-10 19:39:56,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 19:39:56,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 19:39:56,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:39:56,245 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 19:39:56,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:39:56,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 19:39:56,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:39:56,277 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 19:39:56,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:39:56,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 19:39:56,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:39:56,299 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 19:39:56,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:39:56,307 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 19:39:56,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:39:56,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 19:39:56,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:39:56,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 19:39:56,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:39:56,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 19:39:56,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:39:56,329 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 19:39:56,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:39:56,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 19:39:56,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:39:56,334 INFO L134 CoverageAnalysis]: Checked inductivity of 490 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 490 trivial. 0 not checked. [2024-11-10 19:39:56,335 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 19:39:56,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [10740540] [2024-11-10 19:39:56,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [10740540] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 19:39:56,335 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 19:39:56,335 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 19:39:56,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [827024562] [2024-11-10 19:39:56,335 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 19:39:56,337 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 19:39:56,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 19:39:56,337 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 19:39:56,338 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 19:39:56,338 INFO L87 Difference]: Start difference. First operand 264 states and 276 transitions. Second operand has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-10 19:39:56,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 19:39:56,348 INFO L93 Difference]: Finished difference Result 264 states and 276 transitions. [2024-11-10 19:39:56,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 19:39:56,349 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 113 [2024-11-10 19:39:56,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 19:39:56,350 INFO L225 Difference]: With dead ends: 264 [2024-11-10 19:39:56,351 INFO L226 Difference]: Without dead ends: 158 [2024-11-10 19:39:56,351 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 19:39:56,352 INFO L432 NwaCegarLoop]: 20 mSDtfsCounter, 0 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 37 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 [2024-11-10 19:39:56,353 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 37 Invalid, 1 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 19:39:56,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2024-11-10 19:39:56,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 157. [2024-11-10 19:39:56,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 134 states have (on average 1.007462686567164) internal successors, (135), 134 states have internal predecessors, (135), 22 states have call successors, (22), 22 states have call predecessors, (22), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 19:39:56,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 157 transitions. [2024-11-10 19:39:56,361 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 157 transitions. Word has length 113 [2024-11-10 19:39:56,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 19:39:56,361 INFO L471 AbstractCegarLoop]: Abstraction has 157 states and 157 transitions. [2024-11-10 19:39:56,361 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-10 19:39:56,361 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 157 transitions. [2024-11-10 19:39:56,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2024-11-10 19:39:56,362 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 19:39:56,362 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 22, 22, 21, 21, 1, 1, 1, 1] [2024-11-10 19:39:56,362 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-10 19:39:56,363 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting sumErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, sumErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-11-10 19:39:56,363 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 19:39:56,363 INFO L85 PathProgramCache]: Analyzing trace with hash -1105232541, now seen corresponding path program 3 times [2024-11-10 19:39:56,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 19:39:56,363 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [33692550] [2024-11-10 19:39:56,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 19:39:56,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 19:39:56,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:39:56,732 INFO L134 CoverageAnalysis]: Checked inductivity of 1596 backedges. 1167 proven. 0 refuted. 0 times theorem prover too weak. 429 trivial. 0 not checked. [2024-11-10 19:39:56,733 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 19:39:56,733 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [33692550] [2024-11-10 19:39:56,733 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [33692550] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 19:39:56,733 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 19:39:56,733 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2024-11-10 19:39:56,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [605294282] [2024-11-10 19:39:56,734 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 19:39:56,734 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-11-10 19:39:56,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 19:39:56,735 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-11-10 19:39:56,735 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=157, Invalid=443, Unknown=0, NotChecked=0, Total=600 [2024-11-10 19:39:56,735 INFO L87 Difference]: Start difference. First operand 157 states and 157 transitions. Second operand has 25 states, 24 states have (on average 2.9583333333333335) internal successors, (71), 14 states have internal predecessors, (71), 12 states have call successors, (12), 12 states have call predecessors, (12), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 19:39:56,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 19:39:56,930 INFO L93 Difference]: Finished difference Result 157 states and 157 transitions. [2024-11-10 19:39:56,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-11-10 19:39:56,930 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 2.9583333333333335) internal successors, (71), 14 states have internal predecessors, (71), 12 states have call successors, (12), 12 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 156 [2024-11-10 19:39:56,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 19:39:56,930 INFO L225 Difference]: With dead ends: 157 [2024-11-10 19:39:56,930 INFO L226 Difference]: Without dead ends: 0 [2024-11-10 19:39:56,931 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 190 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=366, Invalid=894, Unknown=0, NotChecked=0, Total=1260 [2024-11-10 19:39:56,932 INFO L432 NwaCegarLoop]: 33 mSDtfsCounter, 61 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 299 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 299 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 299 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 19:39:56,932 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 147 Invalid, 299 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 299 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 19:39:56,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-10 19:39:56,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-10 19:39:56,933 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) [2024-11-10 19:39:56,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-10 19:39:56,933 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 156 [2024-11-10 19:39:56,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 19:39:56,933 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-10 19:39:56,933 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 2.9583333333333335) internal successors, (71), 14 states have internal predecessors, (71), 12 states have call successors, (12), 12 states have call predecessors, (12), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 19:39:56,933 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-10 19:39:56,933 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-10 19:39:56,936 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 8 remaining) [2024-11-10 19:39:56,936 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 8 remaining) [2024-11-10 19:39:56,936 INFO L782 garLoopResultBuilder]: Registering result SAFE for location sumErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 8 remaining) [2024-11-10 19:39:56,936 INFO L782 garLoopResultBuilder]: Registering result SAFE for location sumErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 8 remaining) [2024-11-10 19:39:56,936 INFO L782 garLoopResultBuilder]: Registering result SAFE for location sumErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 8 remaining) [2024-11-10 19:39:56,936 INFO L782 garLoopResultBuilder]: Registering result SAFE for location sumErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 8 remaining) [2024-11-10 19:39:56,936 INFO L782 garLoopResultBuilder]: Registering result SAFE for location sumErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 8 remaining) [2024-11-10 19:39:56,936 INFO L782 garLoopResultBuilder]: Registering result SAFE for location sumErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 8 remaining) [2024-11-10 19:39:56,937 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-10 19:39:56,939 INFO L407 BasicCegarLoop]: Path program histogram: [3, 3, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 19:39:56,941 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-10 19:39:58,652 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-10 19:39:58,702 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2024-11-10 19:39:58,711 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 07:39:58 BoogieIcfgContainer [2024-11-10 19:39:58,711 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-10 19:39:58,711 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-10 19:39:58,711 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-10 19:39:58,711 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-10 19:39:58,712 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 07:39:48" (3/4) ... [2024-11-10 19:39:58,714 INFO L143 WitnessPrinter]: Generating witness for correct program [2024-11-10 19:39:58,718 INFO L393 IcfgBacktranslator]: Ignoring RootEdge to procedure sum [2024-11-10 19:39:58,721 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2024-11-10 19:39:58,721 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2024-11-10 19:39:58,721 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-10 19:39:58,721 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-10 19:39:58,788 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-10 19:39:58,790 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-10 19:39:58,790 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-10 19:39:58,791 INFO L158 Benchmark]: Toolchain (without parser) took 10653.26ms. Allocated memory was 174.1MB in the beginning and 251.7MB in the end (delta: 77.6MB). Free memory was 142.6MB in the beginning and 112.3MB in the end (delta: 30.3MB). Peak memory consumption was 108.5MB. Max. memory is 16.1GB. [2024-11-10 19:39:58,791 INFO L158 Benchmark]: CDTParser took 0.76ms. Allocated memory is still 130.0MB. Free memory is still 90.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 19:39:58,791 INFO L158 Benchmark]: CACSL2BoogieTranslator took 196.31ms. Allocated memory is still 174.1MB. Free memory was 142.6MB in the beginning and 130.6MB in the end (delta: 12.0MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-10 19:39:58,791 INFO L158 Benchmark]: Boogie Procedure Inliner took 25.38ms. Allocated memory is still 174.1MB. Free memory was 130.6MB in the beginning and 129.6MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 19:39:58,791 INFO L158 Benchmark]: Boogie Preprocessor took 27.65ms. Allocated memory is still 174.1MB. Free memory was 129.6MB in the beginning and 127.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-10 19:39:58,791 INFO L158 Benchmark]: IcfgBuilder took 235.00ms. Allocated memory is still 174.1MB. Free memory was 127.5MB in the beginning and 115.9MB in the end (delta: 11.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-10 19:39:58,792 INFO L158 Benchmark]: TraceAbstraction took 10084.41ms. Allocated memory was 174.1MB in the beginning and 251.7MB in the end (delta: 77.6MB). Free memory was 115.9MB in the beginning and 116.5MB in the end (delta: -584.7kB). Peak memory consumption was 96.5MB. Max. memory is 16.1GB. [2024-11-10 19:39:58,792 INFO L158 Benchmark]: Witness Printer took 79.12ms. Allocated memory is still 251.7MB. Free memory was 116.5MB in the beginning and 112.3MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-10 19:39:58,793 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.76ms. Allocated memory is still 130.0MB. Free memory is still 90.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 196.31ms. Allocated memory is still 174.1MB. Free memory was 142.6MB in the beginning and 130.6MB in the end (delta: 12.0MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 25.38ms. Allocated memory is still 174.1MB. Free memory was 130.6MB in the beginning and 129.6MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 27.65ms. Allocated memory is still 174.1MB. Free memory was 129.6MB in the beginning and 127.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * IcfgBuilder took 235.00ms. Allocated memory is still 174.1MB. Free memory was 127.5MB in the beginning and 115.9MB in the end (delta: 11.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 10084.41ms. Allocated memory was 174.1MB in the beginning and 251.7MB in the end (delta: 77.6MB). Free memory was 115.9MB in the beginning and 116.5MB in the end (delta: -584.7kB). Peak memory consumption was 96.5MB. Max. memory is 16.1GB. * Witness Printer took 79.12ms. Allocated memory is still 251.7MB. Free memory was 116.5MB in the beginning and 112.3MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression * 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, 33 locations, 8 error locations. Started 1 CEGAR loops. OverallTime: 8.3s, OverallIterations: 13, TraceHistogramMax: 22, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 2.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1583 SdHoareTripleChecker+Valid, 1.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1569 mSDsluCounter, 1787 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1468 mSDsCounter, 200 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1559 IncrementalHoareTripleChecker+Invalid, 1759 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 200 mSolverCounterUnsat, 319 mSDtfsCounter, 1559 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 697 GetRequests, 425 SyntacticMatches, 0 SemanticMatches, 272 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2833 ImplicationChecksByTransitivity, 2.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=265occurred in iteration=10, InterpolantAutomatonStates: 191, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 13 MinimizatonAttempts, 54 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 3.6s InterpolantComputationTime, 938 NumberOfCodeBlocks, 875 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 1090 ConstructedInterpolants, 0 QuantifiedInterpolants, 2576 SizeOfPredicates, 29 NumberOfNonLiveVariables, 598 ConjunctsInSsa, 72 ConjunctsInUnsatCore, 25 InterpolantComputations, 8 PerfectInterpolantSequences, 3128/4633 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 - AllSpecificationsHoldResult: All specifications hold 8 specifications checked. All of them hold - ProcedureContractResult [Line: 5]: Procedure Contract for sum Derived contract for procedure sum. Requires: (((((((((((((0 <= (m + 2147483648)) && (n == 1)) && (m <= 9)) || ((((0 <= n) && (n <= 5)) && (0 <= (m + 2147483648))) && (m <= 5))) || (((m <= 7) && (3 == n)) && (0 <= (m + 2147483648)))) || (((n == 0) && (0 <= (m + 2147483648))) && (m <= 10))) || ((((1 <= n) && (n <= 7)) && (m <= 3)) && (0 <= (m + 2147483648)))) || (((m <= 8) && (2 == n)) && (0 <= (m + 2147483648)))) || ((((m <= 6) && (0 <= n)) && (0 <= (m + 2147483648))) && (n <= 4))) || ((n == 10) && (m == 0))) || (((0 <= (m + 2147483648)) && (8 == n)) && (m <= 2))) || (((m <= 4) && (6 == n)) && (0 <= (m + 2147483648)))) || ((((n <= 9) && (0 <= n)) && (0 <= (m + 2147483648))) && (m <= 1))) Ensures: (((((((((((((0 <= (m + 2147483648)) && (n == 1)) && (m <= 9)) || ((((0 <= n) && (n <= 5)) && (0 <= (m + 2147483648))) && (m <= 5))) || (((m <= 7) && (3 == n)) && (0 <= (m + 2147483648)))) || (((n == 0) && (0 <= (m + 2147483648))) && (m <= 10))) || ((((1 <= n) && (n <= 7)) && (m <= 3)) && (0 <= (m + 2147483648)))) || (((m <= 8) && (2 == n)) && (0 <= (m + 2147483648)))) || ((((m <= 6) && (0 <= n)) && (0 <= (m + 2147483648))) && (n <= 4))) || ((n == 10) && (m == 0))) || (((0 <= (m + 2147483648)) && (8 == n)) && (m <= 2))) || (((m <= 4) && (6 == n)) && (0 <= (m + 2147483648)))) || ((((n <= 9) && (0 <= n)) && (0 <= (m + 2147483648))) && (m <= 1))) RESULT: Ultimate proved your program to be correct! [2024-11-10 19:39:58,820 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