./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/recursive-simple/sum_20x0-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 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_20x0-1.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 0b12653f6fa3db43ddf9a1a43787bd2cd7fe91d3e4035502f1ea10705d9c83a6 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 19:39:52,596 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 19:39:52,684 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:52,689 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 19:39:52,689 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 19:39:52,709 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 19:39:52,710 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 19:39:52,710 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 19:39:52,711 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 19:39:52,714 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 19:39:52,715 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 19:39:52,715 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 19:39:52,715 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 19:39:52,716 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 19:39:52,716 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 19:39:52,716 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 19:39:52,716 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 19:39:52,716 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 19:39:52,717 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 19:39:52,717 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 19:39:52,717 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 19:39:52,718 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 19:39:52,718 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 19:39:52,718 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 19:39:52,719 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 19:39:52,719 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-11-10 19:39:52,719 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-10 19:39:52,719 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 19:39:52,720 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 19:39:52,720 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 19:39:52,720 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 19:39:52,720 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 19:39:52,721 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 19:39:52,721 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 19:39:52,721 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 19:39:52,721 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 19:39:52,721 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 19:39:52,721 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 19:39:52,722 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 19:39:52,722 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 19:39:52,722 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 19:39:52,723 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 19:39:52,723 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 19:39:52,723 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 19:39:52,724 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 -> 0b12653f6fa3db43ddf9a1a43787bd2cd7fe91d3e4035502f1ea10705d9c83a6 [2024-11-10 19:39:52,976 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 19:39:52,997 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 19:39:53,001 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 19:39:53,002 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 19:39:53,002 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 19:39:53,003 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/recursive-simple/sum_20x0-1.c [2024-11-10 19:39:54,417 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 19:39:54,589 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 19:39:54,589 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive-simple/sum_20x0-1.c [2024-11-10 19:39:54,596 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f008ba972/c22aaa6fb4ac4da19751a9a3db314eb4/FLAGe4ec826d7 [2024-11-10 19:39:54,608 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f008ba972/c22aaa6fb4ac4da19751a9a3db314eb4 [2024-11-10 19:39:54,610 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 19:39:54,611 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 19:39:54,612 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 19:39:54,612 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 19:39:54,617 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 19:39:54,618 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 07:39:54" (1/1) ... [2024-11-10 19:39:54,619 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@62813724 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:39:54, skipping insertion in model container [2024-11-10 19:39:54,619 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 07:39:54" (1/1) ... [2024-11-10 19:39:54,635 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 19:39:54,804 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 19:39:54,812 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 19:39:54,841 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 19:39:54,859 INFO L204 MainTranslator]: Completed translation [2024-11-10 19:39:54,860 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:39:54 WrapperNode [2024-11-10 19:39:54,860 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 19:39:54,861 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 19:39:54,861 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 19:39:54,861 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 19:39:54,868 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:54" (1/1) ... [2024-11-10 19:39:54,881 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:54" (1/1) ... [2024-11-10 19:39:54,897 INFO L138 Inliner]: procedures = 12, calls = 10, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 22 [2024-11-10 19:39:54,897 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 19:39:54,898 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 19:39:54,898 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 19:39:54,898 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 19:39:54,907 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:54" (1/1) ... [2024-11-10 19:39:54,908 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:54" (1/1) ... [2024-11-10 19:39:54,909 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:54" (1/1) ... [2024-11-10 19:39:54,924 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:54,924 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:54" (1/1) ... [2024-11-10 19:39:54,925 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:54" (1/1) ... [2024-11-10 19:39:54,927 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:54" (1/1) ... [2024-11-10 19:39:54,927 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:54" (1/1) ... [2024-11-10 19:39:54,928 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:54" (1/1) ... [2024-11-10 19:39:54,929 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:54" (1/1) ... [2024-11-10 19:39:54,930 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 19:39:54,932 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 19:39:54,933 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 19:39:54,933 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 19:39:54,934 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:39:54" (1/1) ... [2024-11-10 19:39:54,941 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 19:39:54,954 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 19:39:54,971 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:54,978 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:55,022 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 19:39:55,022 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 19:39:55,022 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 19:39:55,023 INFO L130 BoogieDeclarations]: Found specification of procedure sum [2024-11-10 19:39:55,023 INFO L138 BoogieDeclarations]: Found implementation of procedure sum [2024-11-10 19:39:55,023 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-10 19:39:55,073 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 19:39:55,075 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 19:39:55,182 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L9: havoc #t~ret4; [2024-11-10 19:39:55,194 INFO L? ?]: Removed 22 outVars from TransFormulas that were not future-live. [2024-11-10 19:39:55,194 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 19:39:55,211 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 19:39:55,212 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 19:39:55,212 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 07:39:55 BoogieIcfgContainer [2024-11-10 19:39:55,213 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 19:39:55,216 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 19:39:55,216 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 19:39:55,219 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 19:39:55,220 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 07:39:54" (1/3) ... [2024-11-10 19:39:55,221 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@432b2504 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 07:39:55, skipping insertion in model container [2024-11-10 19:39:55,222 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:39:54" (2/3) ... [2024-11-10 19:39:55,222 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@432b2504 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 07:39:55, skipping insertion in model container [2024-11-10 19:39:55,223 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 07:39:55" (3/3) ... [2024-11-10 19:39:55,224 INFO L112 eAbstractionObserver]: Analyzing ICFG sum_20x0-1.c [2024-11-10 19:39:55,242 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 19:39:55,243 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 8 error locations. [2024-11-10 19:39:55,312 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 19:39:55,319 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;@46cad8d2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 19:39:55,320 INFO L334 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2024-11-10 19:39:55,323 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:55,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-10 19:39:55,328 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 19:39:55,328 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-10 19:39:55,329 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:55,333 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 19:39:55,333 INFO L85 PathProgramCache]: Analyzing trace with hash 1242256818, now seen corresponding path program 1 times [2024-11-10 19:39:55,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 19:39:55,342 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [484661207] [2024-11-10 19:39:55,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 19:39:55,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 19:39:55,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:39:55,538 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:55,539 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 19:39:55,539 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [484661207] [2024-11-10 19:39:55,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [484661207] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 19:39:55,540 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 19:39:55,540 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 19:39:55,542 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [302019436] [2024-11-10 19:39:55,542 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 19:39:55,546 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 19:39:55,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 19:39:55,567 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 19:39:55,568 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 19:39:55,570 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:55,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 19:39:55,678 INFO L93 Difference]: Finished difference Result 64 states and 67 transitions. [2024-11-10 19:39:55,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 19:39:55,680 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:55,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 19:39:55,686 INFO L225 Difference]: With dead ends: 64 [2024-11-10 19:39:55,687 INFO L226 Difference]: Without dead ends: 40 [2024-11-10 19:39:55,690 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:55,694 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:55,695 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:55,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2024-11-10 19:39:55,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 37. [2024-11-10 19:39:55,723 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:55,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 41 transitions. [2024-11-10 19:39:55,726 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 41 transitions. Word has length 6 [2024-11-10 19:39:55,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 19:39:55,727 INFO L471 AbstractCegarLoop]: Abstraction has 37 states and 41 transitions. [2024-11-10 19:39:55,727 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:55,727 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 41 transitions. [2024-11-10 19:39:55,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-10 19:39:55,727 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 19:39:55,728 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-10 19:39:55,728 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-10 19:39:55,728 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:55,729 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 19:39:55,729 INFO L85 PathProgramCache]: Analyzing trace with hash -144743008, now seen corresponding path program 1 times [2024-11-10 19:39:55,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 19:39:55,730 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1125986703] [2024-11-10 19:39:55,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 19:39:55,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 19:39:55,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:39:55,804 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:55,805 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 19:39:55,805 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1125986703] [2024-11-10 19:39:55,805 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1125986703] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 19:39:55,805 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 19:39:55,805 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 19:39:55,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [876984714] [2024-11-10 19:39:55,806 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 19:39:55,807 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 19:39:55,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 19:39:55,808 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 19:39:55,808 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 19:39:55,809 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:55,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 19:39:55,884 INFO L93 Difference]: Finished difference Result 39 states and 44 transitions. [2024-11-10 19:39:55,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 19:39:55,884 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:55,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 19:39:55,886 INFO L225 Difference]: With dead ends: 39 [2024-11-10 19:39:55,886 INFO L226 Difference]: Without dead ends: 38 [2024-11-10 19:39:55,887 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:55,890 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.1s IncrementalHoareTripleChecker+Time [2024-11-10 19:39:55,890 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.1s Time] [2024-11-10 19:39:55,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2024-11-10 19:39:55,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 36. [2024-11-10 19:39:55,904 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:55,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 39 transitions. [2024-11-10 19:39:55,905 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 39 transitions. Word has length 7 [2024-11-10 19:39:55,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 19:39:55,906 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 39 transitions. [2024-11-10 19:39:55,906 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:55,906 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 39 transitions. [2024-11-10 19:39:55,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-10 19:39:55,908 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 19:39:55,908 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 19:39:55,908 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-10 19:39:55,908 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:55,909 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 19:39:55,909 INFO L85 PathProgramCache]: Analyzing trace with hash -192065958, now seen corresponding path program 1 times [2024-11-10 19:39:55,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 19:39:55,909 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [610974803] [2024-11-10 19:39:55,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 19:39:55,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 19:39:55,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:39:55,974 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:55,974 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 19:39:55,975 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [610974803] [2024-11-10 19:39:55,975 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [610974803] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 19:39:55,975 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 19:39:55,975 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 19:39:55,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [618888386] [2024-11-10 19:39:55,976 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 19:39:55,976 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 19:39:55,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 19:39:55,977 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 19:39:55,977 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 19:39:55,977 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:56,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 19:39:56,030 INFO L93 Difference]: Finished difference Result 38 states and 39 transitions. [2024-11-10 19:39:56,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 19:39:56,031 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:56,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 19:39:56,032 INFO L225 Difference]: With dead ends: 38 [2024-11-10 19:39:56,032 INFO L226 Difference]: Without dead ends: 36 [2024-11-10 19:39:56,032 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:56,033 INFO L432 NwaCegarLoop]: 21 mSDtfsCounter, 14 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s 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.0s IncrementalHoareTripleChecker+Time [2024-11-10 19:39:56,034 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.0s Time] [2024-11-10 19:39:56,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2024-11-10 19:39:56,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2024-11-10 19:39:56,043 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:56,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 37 transitions. [2024-11-10 19:39:56,046 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 37 transitions. Word has length 8 [2024-11-10 19:39:56,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 19:39:56,047 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 37 transitions. [2024-11-10 19:39:56,047 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:56,048 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 37 transitions. [2024-11-10 19:39:56,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-10 19:39:56,048 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 19:39:56,048 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 19:39:56,049 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-10 19:39:56,049 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:56,050 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 19:39:56,050 INFO L85 PathProgramCache]: Analyzing trace with hash -1900437619, now seen corresponding path program 1 times [2024-11-10 19:39:56,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 19:39:56,053 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1194964563] [2024-11-10 19:39:56,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 19:39:56,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 19:39:56,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:39:56,192 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:56,193 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 19:39:56,193 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1194964563] [2024-11-10 19:39:56,193 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1194964563] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 19:39:56,193 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1741200339] [2024-11-10 19:39:56,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 19:39:56,194 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 19:39:56,194 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 19:39:56,196 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:56,197 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:56,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:39:56,240 INFO L255 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-10 19:39:56,244 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 19:39:56,299 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:56,299 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 19:39:56,381 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:56,383 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1741200339] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 19:39:56,383 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 19:39:56,383 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 12 [2024-11-10 19:39:56,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1719712356] [2024-11-10 19:39:56,386 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 19:39:56,387 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-10 19:39:56,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 19:39:56,388 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-10 19:39:56,388 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2024-11-10 19:39:56,388 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:56,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 19:39:56,545 INFO L93 Difference]: Finished difference Result 90 states and 99 transitions. [2024-11-10 19:39:56,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-10 19:39:56,546 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:56,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 19:39:56,547 INFO L225 Difference]: With dead ends: 90 [2024-11-10 19:39:56,547 INFO L226 Difference]: Without dead ends: 73 [2024-11-10 19:39:56,548 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:56,549 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:56,549 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:56,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2024-11-10 19:39:56,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 65. [2024-11-10 19:39:56,561 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:56,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 72 transitions. [2024-11-10 19:39:56,562 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 72 transitions. Word has length 13 [2024-11-10 19:39:56,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 19:39:56,562 INFO L471 AbstractCegarLoop]: Abstraction has 65 states and 72 transitions. [2024-11-10 19:39:56,563 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:56,563 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 72 transitions. [2024-11-10 19:39:56,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-10 19:39:56,564 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 19:39:56,564 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 19:39:56,582 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:56,765 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:56,766 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:56,766 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 19:39:56,767 INFO L85 PathProgramCache]: Analyzing trace with hash -959410827, now seen corresponding path program 1 times [2024-11-10 19:39:56,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 19:39:56,767 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [707017149] [2024-11-10 19:39:56,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 19:39:56,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 19:39:56,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:39:56,956 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:56,957 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 19:39:56,957 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [707017149] [2024-11-10 19:39:56,957 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [707017149] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 19:39:56,957 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1935720527] [2024-11-10 19:39:56,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 19:39:56,957 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 19:39:56,957 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 19:39:56,959 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:56,961 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:56,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:39:56,998 INFO L255 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-10 19:39:56,999 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 19:39:57,044 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:57,044 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 19:39:57,044 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1935720527] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 19:39:57,045 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-10 19:39:57,045 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 9 [2024-11-10 19:39:57,045 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [527006976] [2024-11-10 19:39:57,045 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 19:39:57,046 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 19:39:57,046 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 19:39:57,046 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 19:39:57,046 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-11-10 19:39:57,047 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:57,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 19:39:57,092 INFO L93 Difference]: Finished difference Result 67 states and 75 transitions. [2024-11-10 19:39:57,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 19:39:57,093 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:57,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 19:39:57,094 INFO L225 Difference]: With dead ends: 67 [2024-11-10 19:39:57,095 INFO L226 Difference]: Without dead ends: 66 [2024-11-10 19:39:57,095 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2024-11-10 19:39:57,096 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:57,099 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:57,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2024-11-10 19:39:57,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 64. [2024-11-10 19:39:57,113 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:57,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 68 transitions. [2024-11-10 19:39:57,114 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 68 transitions. Word has length 15 [2024-11-10 19:39:57,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 19:39:57,115 INFO L471 AbstractCegarLoop]: Abstraction has 64 states and 68 transitions. [2024-11-10 19:39:57,115 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:57,115 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 68 transitions. [2024-11-10 19:39:57,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-10 19:39:57,118 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 19:39:57,118 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2024-11-10 19:39:57,135 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-10 19:39:57,322 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:57,323 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:57,323 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 19:39:57,323 INFO L85 PathProgramCache]: Analyzing trace with hash 323035427, now seen corresponding path program 1 times [2024-11-10 19:39:57,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 19:39:57,324 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1220993288] [2024-11-10 19:39:57,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 19:39:57,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 19:39:57,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:39:57,433 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:57,433 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 19:39:57,433 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1220993288] [2024-11-10 19:39:57,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1220993288] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 19:39:57,434 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1432422867] [2024-11-10 19:39:57,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 19:39:57,434 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 19:39:57,434 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 19:39:57,436 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:57,437 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:57,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:39:57,475 INFO L255 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-10 19:39:57,475 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 19:39:57,525 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:57,525 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 19:39:57,597 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:57,597 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1432422867] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 19:39:57,597 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 19:39:57,598 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 14 [2024-11-10 19:39:57,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1830158775] [2024-11-10 19:39:57,598 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 19:39:57,598 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-10 19:39:57,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 19:39:57,599 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-10 19:39:57,599 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=160, Unknown=0, NotChecked=0, Total=210 [2024-11-10 19:39:57,600 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:57,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 19:39:57,730 INFO L93 Difference]: Finished difference Result 67 states and 71 transitions. [2024-11-10 19:39:57,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-10 19:39:57,730 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:57,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 19:39:57,731 INFO L225 Difference]: With dead ends: 67 [2024-11-10 19:39:57,731 INFO L226 Difference]: Without dead ends: 66 [2024-11-10 19:39:57,732 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:57,732 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:57,733 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:57,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2024-11-10 19:39:57,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 64. [2024-11-10 19:39:57,747 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:57,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 65 transitions. [2024-11-10 19:39:57,748 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 65 transitions. Word has length 16 [2024-11-10 19:39:57,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 19:39:57,748 INFO L471 AbstractCegarLoop]: Abstraction has 64 states and 65 transitions. [2024-11-10 19:39:57,748 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:57,749 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 65 transitions. [2024-11-10 19:39:57,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-10 19:39:57,749 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 19:39:57,749 INFO L215 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1] [2024-11-10 19:39:57,764 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:57,950 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:57,950 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:57,951 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 19:39:57,951 INFO L85 PathProgramCache]: Analyzing trace with hash -1802042126, now seen corresponding path program 2 times [2024-11-10 19:39:57,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 19:39:57,951 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1500884434] [2024-11-10 19:39:57,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 19:39:57,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 19:39:57,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:39:58,141 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:58,141 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 19:39:58,142 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1500884434] [2024-11-10 19:39:58,142 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1500884434] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 19:39:58,142 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1397858864] [2024-11-10 19:39:58,142 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-10 19:39:58,142 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 19:39:58,142 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 19:39:58,145 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:58,146 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:58,194 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-10 19:39:58,194 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-10 19:39:58,195 INFO L255 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-10 19:39:58,196 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 19:39:58,259 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:58,261 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 19:39:58,452 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:58,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1397858864] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 19:39:58,453 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 19:39:58,453 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 24 [2024-11-10 19:39:58,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1741079600] [2024-11-10 19:39:58,453 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 19:39:58,454 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-11-10 19:39:58,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 19:39:58,455 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-11-10 19:39:58,456 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=416, Unknown=0, NotChecked=0, Total=552 [2024-11-10 19:39:58,456 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:58,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 19:39:58,808 INFO L93 Difference]: Finished difference Result 157 states and 169 transitions. [2024-11-10 19:39:58,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-11-10 19:39:58,808 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:58,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 19:39:58,810 INFO L225 Difference]: With dead ends: 157 [2024-11-10 19:39:58,810 INFO L226 Difference]: Without dead ends: 132 [2024-11-10 19:39:58,811 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 180 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=311, Invalid=811, Unknown=0, NotChecked=0, Total=1122 [2024-11-10 19:39:58,811 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.2s IncrementalHoareTripleChecker+Time [2024-11-10 19:39:58,811 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.2s Time] [2024-11-10 19:39:58,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2024-11-10 19:39:58,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 124. [2024-11-10 19:39:58,835 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:58,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 131 transitions. [2024-11-10 19:39:58,840 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 131 transitions. Word has length 34 [2024-11-10 19:39:58,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 19:39:58,840 INFO L471 AbstractCegarLoop]: Abstraction has 124 states and 131 transitions. [2024-11-10 19:39:58,840 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:58,840 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 131 transitions. [2024-11-10 19:39:58,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-10 19:39:58,841 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 19:39:58,841 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 1, 1, 1, 1] [2024-11-10 19:39:58,858 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:59,045 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:59,046 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:59,046 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 19:39:59,046 INFO L85 PathProgramCache]: Analyzing trace with hash -1839495778, now seen corresponding path program 2 times [2024-11-10 19:39:59,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 19:39:59,046 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [413715284] [2024-11-10 19:39:59,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 19:39:59,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 19:39:59,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:39:59,222 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:59,223 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 19:39:59,223 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [413715284] [2024-11-10 19:39:59,223 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [413715284] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 19:39:59,223 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [768959799] [2024-11-10 19:39:59,224 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-10 19:39:59,224 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 19:39:59,224 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 19:39:59,225 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:59,227 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:59,265 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-10 19:39:59,265 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-10 19:39:59,266 INFO L255 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-10 19:39:59,268 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 19:39:59,358 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:59,358 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 19:39:59,568 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:59,568 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [768959799] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 19:39:59,568 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 19:39:59,568 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 26 [2024-11-10 19:39:59,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1318982684] [2024-11-10 19:39:59,569 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 19:39:59,569 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2024-11-10 19:39:59,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 19:39:59,571 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2024-11-10 19:39:59,572 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=164, Invalid=538, Unknown=0, NotChecked=0, Total=702 [2024-11-10 19:39:59,572 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:59,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 19:39:59,866 INFO L93 Difference]: Finished difference Result 127 states and 134 transitions. [2024-11-10 19:39:59,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-11-10 19:39:59,866 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:59,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 19:39:59,868 INFO L225 Difference]: With dead ends: 127 [2024-11-10 19:39:59,868 INFO L226 Difference]: Without dead ends: 126 [2024-11-10 19:39:59,868 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 282 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=341, Invalid=991, Unknown=0, NotChecked=0, Total=1332 [2024-11-10 19:39:59,869 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:59,869 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:59,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2024-11-10 19:39:59,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 124. [2024-11-10 19:39:59,886 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:59,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 125 transitions. [2024-11-10 19:39:59,887 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 125 transitions. Word has length 37 [2024-11-10 19:39:59,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 19:39:59,888 INFO L471 AbstractCegarLoop]: Abstraction has 124 states and 125 transitions. [2024-11-10 19:39:59,888 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:59,888 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 125 transitions. [2024-11-10 19:39:59,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2024-11-10 19:39:59,892 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 19:39:59,892 INFO L215 NwaCegarLoop]: trace histogram [11, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1] [2024-11-10 19:39:59,908 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:40:00,092 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:40:00,093 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:40:00,093 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 19:40:00,094 INFO L85 PathProgramCache]: Analyzing trace with hash 1163737042, now seen corresponding path program 3 times [2024-11-10 19:40:00,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 19:40:00,094 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1939507730] [2024-11-10 19:40:00,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 19:40:00,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 19:40:00,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:40:00,543 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:40:00,543 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 19:40:00,543 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1939507730] [2024-11-10 19:40:00,543 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1939507730] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 19:40:00,544 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1609838144] [2024-11-10 19:40:00,544 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-10 19:40:00,544 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 19:40:00,544 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 19:40:00,561 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:40:00,562 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:40:00,597 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-11-10 19:40:00,597 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-10 19:40:00,598 INFO L255 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-10 19:40:00,600 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 19:40:00,709 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:40:00,709 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 19:40:00,710 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1609838144] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 19:40:00,710 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-10 19:40:00,710 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [25] total 29 [2024-11-10 19:40:00,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1025925373] [2024-11-10 19:40:00,710 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 19:40:00,710 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 19:40:00,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 19:40:00,711 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 19:40:00,711 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=177, Invalid=635, Unknown=0, NotChecked=0, Total=812 [2024-11-10 19:40:00,712 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:40:00,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 19:40:00,822 INFO L93 Difference]: Finished difference Result 126 states and 128 transitions. [2024-11-10 19:40:00,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-10 19:40:00,822 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:40:00,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 19:40:00,825 INFO L225 Difference]: With dead ends: 126 [2024-11-10 19:40:00,825 INFO L226 Difference]: Without dead ends: 125 [2024-11-10 19:40:00,825 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 178 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=193, Invalid=799, Unknown=0, NotChecked=0, Total=992 [2024-11-10 19:40:00,826 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:40:00,826 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:40:00,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2024-11-10 19:40:00,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 123. [2024-11-10 19:40:00,838 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:40:00,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 124 transitions. [2024-11-10 19:40:00,839 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 124 transitions. Word has length 76 [2024-11-10 19:40:00,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 19:40:00,839 INFO L471 AbstractCegarLoop]: Abstraction has 123 states and 124 transitions. [2024-11-10 19:40:00,839 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:40:00,840 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 124 transitions. [2024-11-10 19:40:00,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-11-10 19:40:00,842 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 19:40:00,842 INFO L215 NwaCegarLoop]: trace histogram [11, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1] [2024-11-10 19:40:00,859 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:40:01,046 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:40:01,047 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:40:01,047 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 19:40:01,047 INFO L85 PathProgramCache]: Analyzing trace with hash 1716109919, now seen corresponding path program 1 times [2024-11-10 19:40:01,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 19:40:01,048 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [967311250] [2024-11-10 19:40:01,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 19:40:01,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 19:40:01,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:40:01,483 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:40:01,483 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 19:40:01,484 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [967311250] [2024-11-10 19:40:01,484 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [967311250] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 19:40:01,484 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1493315209] [2024-11-10 19:40:01,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 19:40:01,484 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 19:40:01,484 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 19:40:01,486 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:40:01,487 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:40:01,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:40:01,539 INFO L255 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-11-10 19:40:01,541 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 19:40:02,141 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:40:02,141 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 19:40:02,929 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:40:02,929 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1493315209] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 19:40:02,930 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 19:40:02,930 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 68 [2024-11-10 19:40:02,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [853298008] [2024-11-10 19:40:02,930 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 19:40:02,931 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 68 states [2024-11-10 19:40:02,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 19:40:02,932 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2024-11-10 19:40:02,934 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=624, Invalid=3932, Unknown=0, NotChecked=0, Total=4556 [2024-11-10 19:40:02,934 INFO L87 Difference]: Start difference. First operand 123 states and 124 transitions. Second operand has 68 states, 65 states have (on average 2.876923076923077) internal successors, (187), 37 states have internal predecessors, (187), 32 states have call successors, (32), 31 states have call predecessors, (32), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 19:40:04,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 19:40:04,164 INFO L93 Difference]: Finished difference Result 276 states and 297 transitions. [2024-11-10 19:40:04,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2024-11-10 19:40:04,165 INFO L78 Accepts]: Start accepts. Automaton has has 68 states, 65 states have (on average 2.876923076923077) internal successors, (187), 37 states have internal predecessors, (187), 32 states have call successors, (32), 31 states have call predecessors, (32), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 77 [2024-11-10 19:40:04,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 19:40:04,166 INFO L225 Difference]: With dead ends: 276 [2024-11-10 19:40:04,167 INFO L226 Difference]: Without dead ends: 233 [2024-11-10 19:40:04,169 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 209 GetRequests, 107 SyntacticMatches, 4 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2333 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=1785, Invalid=8115, Unknown=0, NotChecked=0, Total=9900 [2024-11-10 19:40:04,170 INFO L432 NwaCegarLoop]: 53 mSDtfsCounter, 762 mSDsluCounter, 675 mSDsCounter, 0 mSdLazyCounter, 739 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 763 SdHoareTripleChecker+Valid, 728 SdHoareTripleChecker+Invalid, 807 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 739 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-10 19:40:04,170 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [763 Valid, 728 Invalid, 807 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 739 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-10 19:40:04,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2024-11-10 19:40:04,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 222. [2024-11-10 19:40:04,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 222 states, 176 states have (on average 1.0681818181818181) internal successors, (188), 178 states have internal predecessors, (188), 22 states have call successors, (22), 21 states have call predecessors, (22), 21 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-11-10 19:40:04,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 232 transitions. [2024-11-10 19:40:04,194 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 232 transitions. Word has length 77 [2024-11-10 19:40:04,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 19:40:04,195 INFO L471 AbstractCegarLoop]: Abstraction has 222 states and 232 transitions. [2024-11-10 19:40:04,195 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 68 states, 65 states have (on average 2.876923076923077) internal successors, (187), 37 states have internal predecessors, (187), 32 states have call successors, (32), 31 states have call predecessors, (32), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 19:40:04,195 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 232 transitions. [2024-11-10 19:40:04,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-11-10 19:40:04,198 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 19:40:04,199 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 12, 12, 11, 11, 1, 1, 1, 1] [2024-11-10 19:40:04,215 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-11-10 19:40:04,400 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:40:04,401 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting sumErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, sumErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-11-10 19:40:04,401 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 19:40:04,402 INFO L85 PathProgramCache]: Analyzing trace with hash 1605819203, now seen corresponding path program 3 times [2024-11-10 19:40:04,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 19:40:04,402 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1873237480] [2024-11-10 19:40:04,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 19:40:04,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 19:40:04,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:40:04,874 INFO L134 CoverageAnalysis]: Checked inductivity of 451 backedges. 0 proven. 451 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 19:40:04,875 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 19:40:04,875 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1873237480] [2024-11-10 19:40:04,875 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1873237480] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 19:40:04,875 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2084350824] [2024-11-10 19:40:04,875 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-10 19:40:04,875 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 19:40:04,876 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 19:40:04,877 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 19:40:04,882 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-10 19:40:04,937 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2024-11-10 19:40:04,937 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-10 19:40:04,938 INFO L255 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-11-10 19:40:04,940 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 19:40:05,082 INFO L134 CoverageAnalysis]: Checked inductivity of 451 backedges. 0 proven. 451 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 19:40:05,083 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 19:40:05,686 INFO L134 CoverageAnalysis]: Checked inductivity of 451 backedges. 0 proven. 451 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 19:40:05,687 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2084350824] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 19:40:05,687 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 19:40:05,687 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26, 26] total 54 [2024-11-10 19:40:05,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [461482872] [2024-11-10 19:40:05,687 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 19:40:05,688 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 55 states [2024-11-10 19:40:05,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 19:40:05,689 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2024-11-10 19:40:05,690 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=710, Invalid=2260, Unknown=0, NotChecked=0, Total=2970 [2024-11-10 19:40:05,691 INFO L87 Difference]: Start difference. First operand 222 states and 232 transitions. Second operand has 55 states, 51 states have (on average 3.019607843137255) internal successors, (154), 30 states have internal predecessors, (154), 26 states have call successors, (26), 25 states have call predecessors, (26), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 19:40:06,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 19:40:06,489 INFO L93 Difference]: Finished difference Result 289 states and 307 transitions. [2024-11-10 19:40:06,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2024-11-10 19:40:06,490 INFO L78 Accepts]: Start accepts. Automaton has has 55 states, 51 states have (on average 3.019607843137255) internal successors, (154), 30 states have internal predecessors, (154), 26 states have call successors, (26), 25 states have call predecessors, (26), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 86 [2024-11-10 19:40:06,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 19:40:06,491 INFO L225 Difference]: With dead ends: 289 [2024-11-10 19:40:06,491 INFO L226 Difference]: Without dead ends: 288 [2024-11-10 19:40:06,493 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 220 GetRequests, 143 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1360 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1636, Invalid=4526, Unknown=0, NotChecked=0, Total=6162 [2024-11-10 19:40:06,494 INFO L432 NwaCegarLoop]: 51 mSDtfsCounter, 514 mSDsluCounter, 586 mSDsCounter, 0 mSdLazyCounter, 476 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 516 SdHoareTripleChecker+Valid, 637 SdHoareTripleChecker+Invalid, 535 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 476 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-10 19:40:06,495 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [516 Valid, 637 Invalid, 535 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 476 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-10 19:40:06,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2024-11-10 19:40:06,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 274. [2024-11-10 19:40:06,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 274 states, 220 states have (on average 1.05) internal successors, (231), 222 states have internal predecessors, (231), 26 states have call successors, (26), 25 states have call predecessors, (26), 25 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-10 19:40:06,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 283 transitions. [2024-11-10 19:40:06,518 INFO L78 Accepts]: Start accepts. Automaton has 274 states and 283 transitions. Word has length 86 [2024-11-10 19:40:06,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 19:40:06,518 INFO L471 AbstractCegarLoop]: Abstraction has 274 states and 283 transitions. [2024-11-10 19:40:06,519 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 55 states, 51 states have (on average 3.019607843137255) internal successors, (154), 30 states have internal predecessors, (154), 26 states have call successors, (26), 25 states have call predecessors, (26), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 19:40:06,519 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 283 transitions. [2024-11-10 19:40:06,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2024-11-10 19:40:06,522 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 19:40:06,522 INFO L215 NwaCegarLoop]: trace histogram [21, 20, 20, 20, 20, 20, 20, 1, 1, 1, 1, 1, 1] [2024-11-10 19:40:06,539 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-11-10 19:40:06,722 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2024-11-10 19:40:06,723 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting sumErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, sumErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-11-10 19:40:06,723 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 19:40:06,723 INFO L85 PathProgramCache]: Analyzing trace with hash -2099495873, now seen corresponding path program 2 times [2024-11-10 19:40:06,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 19:40:06,724 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [470715809] [2024-11-10 19:40:06,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 19:40:06,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 19:40:06,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:40:07,848 INFO L134 CoverageAnalysis]: Checked inductivity of 1370 backedges. 0 proven. 1370 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 19:40:07,848 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 19:40:07,848 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [470715809] [2024-11-10 19:40:07,849 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [470715809] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 19:40:07,849 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [218685340] [2024-11-10 19:40:07,849 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-10 19:40:07,849 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 19:40:07,849 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 19:40:07,851 INFO L229 MonitoredProcess]: Starting monitored process 10 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:40:07,853 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-10 19:40:07,920 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-10 19:40:07,920 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-10 19:40:07,922 INFO L255 TraceCheckSpWp]: Trace formula consists of 338 conjuncts, 45 conjuncts are in the unsatisfiable core [2024-11-10 19:40:07,925 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 19:40:08,166 INFO L134 CoverageAnalysis]: Checked inductivity of 1370 backedges. 0 proven. 1370 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 19:40:08,166 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 19:40:09,617 INFO L134 CoverageAnalysis]: Checked inductivity of 1370 backedges. 0 proven. 1370 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 19:40:09,617 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [218685340] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 19:40:09,617 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 19:40:09,617 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 45, 45] total 93 [2024-11-10 19:40:09,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1784982856] [2024-11-10 19:40:09,617 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 19:40:09,618 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 94 states [2024-11-10 19:40:09,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 19:40:09,619 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 94 interpolants. [2024-11-10 19:40:09,621 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=2019, Invalid=6723, Unknown=0, NotChecked=0, Total=8742 [2024-11-10 19:40:09,622 INFO L87 Difference]: Start difference. First operand 274 states and 283 transitions. Second operand has 94 states, 90 states have (on average 2.9) internal successors, (261), 51 states have internal predecessors, (261), 44 states have call successors, (44), 43 states have call predecessors, (44), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 19:40:12,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 19:40:12,071 INFO L93 Difference]: Finished difference Result 540 states and 600 transitions. [2024-11-10 19:40:12,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 110 states. [2024-11-10 19:40:12,071 INFO L78 Accepts]: Start accepts. Automaton has has 94 states, 90 states have (on average 2.9) internal successors, (261), 51 states have internal predecessors, (261), 44 states have call successors, (44), 43 states have call predecessors, (44), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 147 [2024-11-10 19:40:12,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 19:40:12,074 INFO L225 Difference]: With dead ends: 540 [2024-11-10 19:40:12,074 INFO L226 Difference]: Without dead ends: 538 [2024-11-10 19:40:12,079 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 402 GetRequests, 245 SyntacticMatches, 0 SemanticMatches, 157 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6112 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=5898, Invalid=19224, Unknown=0, NotChecked=0, Total=25122 [2024-11-10 19:40:12,080 INFO L432 NwaCegarLoop]: 50 mSDtfsCounter, 1954 mSDsluCounter, 892 mSDsCounter, 0 mSdLazyCounter, 841 mSolverCounterSat, 209 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1955 SdHoareTripleChecker+Valid, 942 SdHoareTripleChecker+Invalid, 1050 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 209 IncrementalHoareTripleChecker+Valid, 841 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-10 19:40:12,080 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1955 Valid, 942 Invalid, 1050 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [209 Valid, 841 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-10 19:40:12,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 538 states. [2024-11-10 19:40:12,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 538 to 494. [2024-11-10 19:40:12,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 494 states, 407 states have (on average 1.0565110565110565) internal successors, (430), 408 states have internal predecessors, (430), 43 states have call successors, (43), 42 states have call predecessors, (43), 42 states have return successors, (43), 43 states have call predecessors, (43), 43 states have call successors, (43) [2024-11-10 19:40:12,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 494 states to 494 states and 516 transitions. [2024-11-10 19:40:12,110 INFO L78 Accepts]: Start accepts. Automaton has 494 states and 516 transitions. Word has length 147 [2024-11-10 19:40:12,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 19:40:12,110 INFO L471 AbstractCegarLoop]: Abstraction has 494 states and 516 transitions. [2024-11-10 19:40:12,111 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 94 states, 90 states have (on average 2.9) internal successors, (261), 51 states have internal predecessors, (261), 44 states have call successors, (44), 43 states have call predecessors, (44), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 19:40:12,111 INFO L276 IsEmpty]: Start isEmpty. Operand 494 states and 516 transitions. [2024-11-10 19:40:12,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2024-11-10 19:40:12,113 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 19:40:12,113 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 20, 20, 20, 20, 20, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 19:40:12,126 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-11-10 19:40:12,315 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 19:40:12,315 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, sumErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-11-10 19:40:12,315 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 19:40:12,315 INFO L85 PathProgramCache]: Analyzing trace with hash 1163826614, now seen corresponding path program 1 times [2024-11-10 19:40:12,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 19:40:12,316 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1997288308] [2024-11-10 19:40:12,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 19:40:12,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 19:40:12,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:40:12,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 19:40:12,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:40:12,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 19:40:12,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:40:12,471 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 19:40:12,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:40:12,496 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 19:40:12,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:40:12,546 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 19:40:12,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:40:12,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 19:40:12,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:40:12,590 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 19:40:12,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:40:12,608 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 19:40:12,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:40:12,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 19:40:12,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:40:12,639 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 19:40:12,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:40:12,654 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 19:40:12,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:40:12,669 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 19:40:12,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:40:12,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 19:40:12,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:40:12,694 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 19:40:12,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:40:12,704 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 19:40:12,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:40:12,713 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 19:40:12,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:40:12,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 19:40:12,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:40:12,732 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 19:40:12,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:40:12,738 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 19:40:12,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:40:12,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 19:40:12,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:40:12,746 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 19:40:12,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:40:12,751 INFO L134 CoverageAnalysis]: Checked inductivity of 1980 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1980 trivial. 0 not checked. [2024-11-10 19:40:12,751 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 19:40:12,751 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1997288308] [2024-11-10 19:40:12,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1997288308] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 19:40:12,751 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 19:40:12,752 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 19:40:12,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1255775196] [2024-11-10 19:40:12,752 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 19:40:12,753 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 19:40:12,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 19:40:12,754 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 19:40:12,754 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 19:40:12,754 INFO L87 Difference]: Start difference. First operand 494 states and 516 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:40:12,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 19:40:12,776 INFO L93 Difference]: Finished difference Result 494 states and 516 transitions. [2024-11-10 19:40:12,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 19:40:12,776 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 213 [2024-11-10 19:40:12,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 19:40:12,778 INFO L225 Difference]: With dead ends: 494 [2024-11-10 19:40:12,778 INFO L226 Difference]: Without dead ends: 298 [2024-11-10 19:40:12,779 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 43 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:40:12,780 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:40:12,783 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:40:12,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2024-11-10 19:40:12,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 297. [2024-11-10 19:40:12,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 297 states, 254 states have (on average 1.0039370078740157) internal successors, (255), 254 states have internal predecessors, (255), 42 states have call successors, (42), 42 states have call predecessors, (42), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 19:40:12,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 297 transitions. [2024-11-10 19:40:12,808 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 297 transitions. Word has length 213 [2024-11-10 19:40:12,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 19:40:12,809 INFO L471 AbstractCegarLoop]: Abstraction has 297 states and 297 transitions. [2024-11-10 19:40:12,809 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:40:12,809 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 297 transitions. [2024-11-10 19:40:12,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 297 [2024-11-10 19:40:12,812 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 19:40:12,813 INFO L215 NwaCegarLoop]: trace histogram [42, 42, 42, 42, 42, 41, 41, 1, 1, 1, 1] [2024-11-10 19:40:12,813 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-10 19:40:12,813 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting sumErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, sumErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-11-10 19:40:12,813 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 19:40:12,814 INFO L85 PathProgramCache]: Analyzing trace with hash 1460763043, now seen corresponding path program 4 times [2024-11-10 19:40:12,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 19:40:12,814 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2066705461] [2024-11-10 19:40:12,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 19:40:12,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 19:40:12,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 19:40:14,186 INFO L134 CoverageAnalysis]: Checked inductivity of 5986 backedges. 4432 proven. 0 refuted. 0 times theorem prover too weak. 1554 trivial. 0 not checked. [2024-11-10 19:40:14,187 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 19:40:14,187 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2066705461] [2024-11-10 19:40:14,187 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2066705461] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 19:40:14,187 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 19:40:14,188 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [45] imperfect sequences [] total 45 [2024-11-10 19:40:14,188 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1758942307] [2024-11-10 19:40:14,188 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 19:40:14,188 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2024-11-10 19:40:14,188 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 19:40:14,189 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2024-11-10 19:40:14,189 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=507, Invalid=1473, Unknown=0, NotChecked=0, Total=1980 [2024-11-10 19:40:14,190 INFO L87 Difference]: Start difference. First operand 297 states and 297 transitions. Second operand has 45 states, 44 states have (on average 2.977272727272727) internal successors, (131), 24 states have internal predecessors, (131), 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:40:14,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 19:40:14,659 INFO L93 Difference]: Finished difference Result 297 states and 297 transitions. [2024-11-10 19:40:14,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2024-11-10 19:40:14,660 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 44 states have (on average 2.977272727272727) internal successors, (131), 24 states have internal predecessors, (131), 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) Word has length 296 [2024-11-10 19:40:14,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 19:40:14,660 INFO L225 Difference]: With dead ends: 297 [2024-11-10 19:40:14,661 INFO L226 Difference]: Without dead ends: 0 [2024-11-10 19:40:14,662 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 780 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1221, Invalid=3069, Unknown=0, NotChecked=0, Total=4290 [2024-11-10 19:40:14,663 INFO L432 NwaCegarLoop]: 63 mSDtfsCounter, 121 mSDsluCounter, 283 mSDsCounter, 0 mSdLazyCounter, 792 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 346 SdHoareTripleChecker+Invalid, 792 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 792 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-10 19:40:14,663 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 346 Invalid, 792 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 792 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-10 19:40:14,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-10 19:40:14,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-10 19:40:14,663 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:40:14,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-10 19:40:14,664 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 296 [2024-11-10 19:40:14,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 19:40:14,664 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-10 19:40:14,664 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 44 states have (on average 2.977272727272727) internal successors, (131), 24 states have internal predecessors, (131), 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:40:14,664 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-10 19:40:14,664 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-10 19:40:14,666 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 8 remaining) [2024-11-10 19:40:14,666 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 8 remaining) [2024-11-10 19:40:14,666 INFO L782 garLoopResultBuilder]: Registering result SAFE for location sumErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 8 remaining) [2024-11-10 19:40:14,666 INFO L782 garLoopResultBuilder]: Registering result SAFE for location sumErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 8 remaining) [2024-11-10 19:40:14,671 INFO L782 garLoopResultBuilder]: Registering result SAFE for location sumErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 8 remaining) [2024-11-10 19:40:14,671 INFO L782 garLoopResultBuilder]: Registering result SAFE for location sumErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 8 remaining) [2024-11-10 19:40:14,671 INFO L782 garLoopResultBuilder]: Registering result SAFE for location sumErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 8 remaining) [2024-11-10 19:40:14,672 INFO L782 garLoopResultBuilder]: Registering result SAFE for location sumErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 8 remaining) [2024-11-10 19:40:14,672 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-10 19:40:14,675 INFO L407 BasicCegarLoop]: Path program histogram: [4, 3, 2, 1, 1, 1, 1, 1] [2024-11-10 19:40:14,677 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-10 19:40:20,518 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-10 19:40:20,691 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2024-11-10 19:40:20,710 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 07:40:20 BoogieIcfgContainer [2024-11-10 19:40:20,710 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-10 19:40:20,710 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-10 19:40:20,711 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-10 19:40:20,712 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-10 19:40:20,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:55" (3/4) ... [2024-11-10 19:40:20,714 INFO L143 WitnessPrinter]: Generating witness for correct program [2024-11-10 19:40:20,718 INFO L393 IcfgBacktranslator]: Ignoring RootEdge to procedure sum [2024-11-10 19:40:20,722 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2024-11-10 19:40:20,722 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2024-11-10 19:40:20,723 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-10 19:40:20,723 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-10 19:40:20,803 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-10 19:40:20,804 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-10 19:40:20,804 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-10 19:40:20,805 INFO L158 Benchmark]: Toolchain (without parser) took 26193.29ms. Allocated memory was 134.2MB in the beginning and 453.0MB in the end (delta: 318.8MB). Free memory was 63.7MB in the beginning and 295.8MB in the end (delta: -232.1MB). Peak memory consumption was 88.0MB. Max. memory is 16.1GB. [2024-11-10 19:40:20,805 INFO L158 Benchmark]: CDTParser took 0.93ms. Allocated memory is still 134.2MB. Free memory is still 93.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 19:40:20,805 INFO L158 Benchmark]: CACSL2BoogieTranslator took 248.10ms. Allocated memory was 134.2MB in the beginning and 180.4MB in the end (delta: 46.1MB). Free memory was 63.4MB in the beginning and 150.0MB in the end (delta: -86.6MB). Peak memory consumption was 15.1MB. Max. memory is 16.1GB. [2024-11-10 19:40:20,805 INFO L158 Benchmark]: Boogie Procedure Inliner took 36.49ms. Allocated memory is still 180.4MB. Free memory was 150.0MB in the beginning and 150.5MB in the end (delta: -542.3kB). Peak memory consumption was 6.4MB. Max. memory is 16.1GB. [2024-11-10 19:40:20,806 INFO L158 Benchmark]: Boogie Preprocessor took 31.75ms. Allocated memory is still 180.4MB. Free memory was 150.5MB in the beginning and 148.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-10 19:40:20,806 INFO L158 Benchmark]: IcfgBuilder took 280.21ms. Allocated memory is still 180.4MB. Free memory was 148.4MB in the beginning and 136.9MB in the end (delta: 11.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-11-10 19:40:20,806 INFO L158 Benchmark]: TraceAbstraction took 25494.12ms. Allocated memory was 180.4MB in the beginning and 453.0MB in the end (delta: 272.6MB). Free memory was 135.8MB in the beginning and 300.0MB in the end (delta: -164.2MB). Peak memory consumption was 257.4MB. Max. memory is 16.1GB. [2024-11-10 19:40:20,807 INFO L158 Benchmark]: Witness Printer took 93.67ms. Allocated memory is still 453.0MB. Free memory was 300.0MB in the beginning and 295.8MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-10 19:40:20,808 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.93ms. Allocated memory is still 134.2MB. Free memory is still 93.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 248.10ms. Allocated memory was 134.2MB in the beginning and 180.4MB in the end (delta: 46.1MB). Free memory was 63.4MB in the beginning and 150.0MB in the end (delta: -86.6MB). Peak memory consumption was 15.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 36.49ms. Allocated memory is still 180.4MB. Free memory was 150.0MB in the beginning and 150.5MB in the end (delta: -542.3kB). Peak memory consumption was 6.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 31.75ms. Allocated memory is still 180.4MB. Free memory was 150.5MB in the beginning and 148.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * IcfgBuilder took 280.21ms. Allocated memory is still 180.4MB. Free memory was 148.4MB in the beginning and 136.9MB in the end (delta: 11.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 25494.12ms. Allocated memory was 180.4MB in the beginning and 453.0MB in the end (delta: 272.6MB). Free memory was 135.8MB in the beginning and 300.0MB in the end (delta: -164.2MB). Peak memory consumption was 257.4MB. Max. memory is 16.1GB. * Witness Printer took 93.67ms. Allocated memory is still 453.0MB. Free memory was 300.0MB in the beginning and 295.8MB 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: 19.4s, OverallIterations: 14, TraceHistogramMax: 42, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 6.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 4053 SdHoareTripleChecker+Valid, 2.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 4036 mSDsluCounter, 3809 SdHoareTripleChecker+Invalid, 1.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3356 mSDsCounter, 427 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3660 IncrementalHoareTripleChecker+Invalid, 4087 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 427 mSolverCounterUnsat, 453 mSDtfsCounter, 3660 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1342 GetRequests, 792 SyntacticMatches, 4 SemanticMatches, 546 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11311 ImplicationChecksByTransitivity, 9.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=494occurred in iteration=12, InterpolantAutomatonStates: 354, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 14 MinimizatonAttempts, 99 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 9.9s InterpolantComputationTime, 1532 NumberOfCodeBlocks, 1469 NumberOfCodeBlocksAsserted, 38 NumberOfCheckSat, 1912 ConstructedInterpolants, 0 QuantifiedInterpolants, 4872 SizeOfPredicates, 62 NumberOfNonLiveVariables, 1141 ConjunctsInSsa, 142 ConjunctsInUnsatCore, 30 InterpolantComputations, 7 PerfectInterpolantSequences, 8306/15486 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: (((((((((((((((((((((((m <= 4) && (0 <= (m + 2147483648))) && (16 == n)) || ((((1 <= n) && (n <= 11)) && (0 <= (m + 2147483648))) && (m <= 9))) || ((((n <= 10) && (0 <= n)) && (0 <= (m + 2147483648))) && (m <= 10))) || (((n == 0) && (0 <= (m + 2147483648))) && (m <= 20))) || (((0 <= (m + 2147483648)) && (n == 1)) && (m <= 19))) || (((18 == n) && (0 <= (m + 2147483648))) && (m <= 2))) || (((m <= 7) && (0 <= (m + 2147483648))) && (n == 13))) || (((m <= 6) && (0 <= (m + 2147483648))) && (14 == n))) || ((((m <= 16) && (0 <= n)) && (0 <= (m + 2147483648))) && (n <= 4))) || (((0 <= (m + 2147483648)) && (19 == n)) && (m <= 1))) || (((6 == n) && (m <= 14)) && (0 <= (m + 2147483648)))) || (((m <= 12) && (0 <= (m + 2147483648))) && (8 == n))) || (((3 == n) && (0 <= (m + 2147483648))) && (m <= 17))) || ((((0 <= n) && (0 <= (m + 2147483648))) && (n <= 15)) && (m <= 5))) || ((((1 <= n) && (m <= 3)) && (0 <= (m + 2147483648))) && (n <= 17))) || ((((m <= 15) && (0 <= n)) && (n <= 5)) && (0 <= (m + 2147483648)))) || (((7 == n) && (0 <= (m + 2147483648))) && (m <= 13))) || (((2 == n) && (0 <= (m + 2147483648))) && (m <= 18))) || ((20 == n) && (m == 0))) || ((((m <= 8) && (n <= 12)) && (0 <= (m + 2147483648))) && (2 <= n))) || (((0 <= (m + 2147483648)) && (9 == n)) && (m <= 11))) Ensures: (((((((((((((((((((((((m <= 4) && (0 <= (m + 2147483648))) && (16 == n)) || ((((1 <= n) && (n <= 11)) && (0 <= (m + 2147483648))) && (m <= 9))) || ((((n <= 10) && (0 <= n)) && (0 <= (m + 2147483648))) && (m <= 10))) || (((n == 0) && (0 <= (m + 2147483648))) && (m <= 20))) || (((0 <= (m + 2147483648)) && (n == 1)) && (m <= 19))) || (((18 == n) && (0 <= (m + 2147483648))) && (m <= 2))) || (((m <= 7) && (0 <= (m + 2147483648))) && (n == 13))) || (((m <= 6) && (0 <= (m + 2147483648))) && (14 == n))) || ((((m <= 16) && (0 <= n)) && (0 <= (m + 2147483648))) && (n <= 4))) || (((0 <= (m + 2147483648)) && (19 == n)) && (m <= 1))) || (((6 == n) && (m <= 14)) && (0 <= (m + 2147483648)))) || (((m <= 12) && (0 <= (m + 2147483648))) && (8 == n))) || (((3 == n) && (0 <= (m + 2147483648))) && (m <= 17))) || ((((0 <= n) && (0 <= (m + 2147483648))) && (n <= 15)) && (m <= 5))) || ((((1 <= n) && (m <= 3)) && (0 <= (m + 2147483648))) && (n <= 17))) || ((((m <= 15) && (0 <= n)) && (n <= 5)) && (0 <= (m + 2147483648)))) || (((7 == n) && (0 <= (m + 2147483648))) && (m <= 13))) || (((2 == n) && (0 <= (m + 2147483648))) && (m <= 18))) || ((20 == n) && (m == 0))) || ((((m <= 8) && (n <= 12)) && (0 <= (m + 2147483648))) && (2 <= n))) || (((0 <= (m + 2147483648)) && (9 == n)) && (m <= 11))) RESULT: Ultimate proved your program to be correct! [2024-11-10 19:40:20,837 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