./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/no-overflow.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive-simple/sum_25x0-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 61a67961 Calling Ultimate with: /root/.sdkman/candidates/java/current/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 /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive-simple/sum_25x0-2.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 0189dbb29c824fc5d22409df9775c70fa543bd61c2bf554681db703f0a461966 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 21:13:02,533 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 21:13:02,623 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2024-10-14 21:13:02,629 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 21:13:02,631 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 21:13:02,664 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 21:13:02,664 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 21:13:02,665 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 21:13:02,665 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 21:13:02,666 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 21:13:02,667 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 21:13:02,667 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 21:13:02,667 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 21:13:02,669 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 21:13:02,670 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 21:13:02,670 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 21:13:02,670 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 21:13:02,671 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 21:13:02,671 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-14 21:13:02,671 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 21:13:02,671 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 21:13:02,675 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 21:13:02,676 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 21:13:02,676 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 21:13:02,676 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 21:13:02,676 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-10-14 21:13:02,676 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-14 21:13:02,676 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 21:13:02,677 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 21:13:02,677 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 21:13:02,677 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 21:13:02,677 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 21:13:02,677 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 21:13:02,678 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 21:13:02,678 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 21:13:02,678 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 21:13:02,678 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 21:13:02,678 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 21:13:02,679 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-14 21:13:02,679 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-14 21:13:02,679 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 21:13:02,681 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 21:13:02,681 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 21:13:02,681 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 21:13:02,682 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 -> 0189dbb29c824fc5d22409df9775c70fa543bd61c2bf554681db703f0a461966 [2024-10-14 21:13:02,926 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 21:13:02,952 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 21:13:02,955 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 21:13:02,956 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 21:13:02,956 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 21:13:02,957 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive-simple/sum_25x0-2.c [2024-10-14 21:13:04,404 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 21:13:04,584 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 21:13:04,584 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive-simple/sum_25x0-2.c [2024-10-14 21:13:04,593 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/38952523e/0fa831f489b84d29bb1b1c5ed0bc1e39/FLAG14c5def47 [2024-10-14 21:13:04,607 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/38952523e/0fa831f489b84d29bb1b1c5ed0bc1e39 [2024-10-14 21:13:04,609 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 21:13:04,610 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 21:13:04,612 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 21:13:04,612 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 21:13:04,618 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 21:13:04,619 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 09:13:04" (1/1) ... [2024-10-14 21:13:04,620 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6b88a487 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:13:04, skipping insertion in model container [2024-10-14 21:13:04,620 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 09:13:04" (1/1) ... [2024-10-14 21:13:04,635 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 21:13:04,785 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 21:13:04,805 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 21:13:04,826 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 21:13:04,844 INFO L204 MainTranslator]: Completed translation [2024-10-14 21:13:04,845 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:13:04 WrapperNode [2024-10-14 21:13:04,845 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 21:13:04,846 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 21:13:04,847 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 21:13:04,847 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 21:13:04,853 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:13:04" (1/1) ... [2024-10-14 21:13:04,860 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:13:04" (1/1) ... [2024-10-14 21:13:04,875 INFO L138 Inliner]: procedures = 12, calls = 10, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 22 [2024-10-14 21:13:04,876 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 21:13:04,876 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 21:13:04,877 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 21:13:04,877 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 21:13:04,886 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:13:04" (1/1) ... [2024-10-14 21:13:04,886 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:13:04" (1/1) ... [2024-10-14 21:13:04,887 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:13:04" (1/1) ... [2024-10-14 21:13:04,897 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-10-14 21:13:04,897 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:13:04" (1/1) ... [2024-10-14 21:13:04,897 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:13:04" (1/1) ... [2024-10-14 21:13:04,900 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:13:04" (1/1) ... [2024-10-14 21:13:04,902 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:13:04" (1/1) ... [2024-10-14 21:13:04,903 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:13:04" (1/1) ... [2024-10-14 21:13:04,904 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:13:04" (1/1) ... [2024-10-14 21:13:04,906 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 21:13:04,908 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 21:13:04,909 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 21:13:04,909 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 21:13:04,910 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:13:04" (1/1) ... [2024-10-14 21:13:04,920 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 21:13:04,931 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 21:13:04,947 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-10-14 21:13:04,951 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-10-14 21:13:04,991 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 21:13:04,992 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 21:13:04,992 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 21:13:04,992 INFO L130 BoogieDeclarations]: Found specification of procedure sum [2024-10-14 21:13:04,992 INFO L138 BoogieDeclarations]: Found implementation of procedure sum [2024-10-14 21:13:04,992 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-14 21:13:05,043 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 21:13:05,045 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 21:13:05,175 INFO L? ?]: Removed 22 outVars from TransFormulas that were not future-live. [2024-10-14 21:13:05,176 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 21:13:05,198 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 21:13:05,199 INFO L314 CfgBuilder]: Removed 0 assume(true) statements. [2024-10-14 21:13:05,199 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 09:13:05 BoogieIcfgContainer [2024-10-14 21:13:05,200 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 21:13:05,202 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 21:13:05,202 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 21:13:05,206 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 21:13:05,206 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 09:13:04" (1/3) ... [2024-10-14 21:13:05,207 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a7931de and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 09:13:05, skipping insertion in model container [2024-10-14 21:13:05,207 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:13:04" (2/3) ... [2024-10-14 21:13:05,208 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a7931de and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 09:13:05, skipping insertion in model container [2024-10-14 21:13:05,208 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 09:13:05" (3/3) ... [2024-10-14 21:13:05,210 INFO L112 eAbstractionObserver]: Analyzing ICFG sum_25x0-2.c [2024-10-14 21:13:05,226 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 21:13:05,227 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 8 error locations. [2024-10-14 21:13:05,296 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 21:13:05,304 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;@7bd4ce48, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 21:13:05,304 INFO L334 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2024-10-14 21:13:05,309 INFO L276 IsEmpty]: Start isEmpty. Operand has 28 states, 16 states have (on average 1.625) internal successors, (26), 24 states have internal predecessors, (26), 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-10-14 21:13:05,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-10-14 21:13:05,322 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 21:13:05,324 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-10-14 21:13:05,325 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting sumErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, sumErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-10-14 21:13:05,332 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 21:13:05,332 INFO L85 PathProgramCache]: Analyzing trace with hash 71429977, now seen corresponding path program 1 times [2024-10-14 21:13:05,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 21:13:05,342 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [261628781] [2024-10-14 21:13:05,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 21:13:05,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 21:13:05,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:13:05,579 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 21:13:05,579 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 21:13:05,580 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [261628781] [2024-10-14 21:13:05,583 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [261628781] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 21:13:05,584 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 21:13:05,584 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 21:13:05,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [436692337] [2024-10-14 21:13:05,586 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 21:13:05,590 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 21:13:05,590 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 21:13:05,627 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 21:13:05,628 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 21:13:05,630 INFO L87 Difference]: Start difference. First operand has 28 states, 16 states have (on average 1.625) internal successors, (26), 24 states have internal predecessors, (26), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 5 states, 4 states have (on average 1.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 21:13:05,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 21:13:05,748 INFO L93 Difference]: Finished difference Result 56 states and 59 transitions. [2024-10-14 21:13:05,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 21:13:05,751 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2024-10-14 21:13:05,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 21:13:05,758 INFO L225 Difference]: With dead ends: 56 [2024-10-14 21:13:05,759 INFO L226 Difference]: Without dead ends: 38 [2024-10-14 21:13:05,762 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-14 21:13:05,766 INFO L432 NwaCegarLoop]: 17 mSDtfsCounter, 23 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 21:13:05,768 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 59 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 21:13:05,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2024-10-14 21:13:05,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 35. [2024-10-14 21:13:05,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 22 states have (on average 1.5) internal successors, (33), 29 states have internal predecessors, (33), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-14 21:13:05,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 39 transitions. [2024-10-14 21:13:05,802 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 39 transitions. Word has length 5 [2024-10-14 21:13:05,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 21:13:05,802 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 39 transitions. [2024-10-14 21:13:05,802 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 21:13:05,802 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2024-10-14 21:13:05,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-10-14 21:13:05,803 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 21:13:05,803 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-10-14 21:13:05,803 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-14 21:13:05,804 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting sumErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, sumErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-10-14 21:13:05,804 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 21:13:05,804 INFO L85 PathProgramCache]: Analyzing trace with hash -2080632986, now seen corresponding path program 1 times [2024-10-14 21:13:05,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 21:13:05,805 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [283743117] [2024-10-14 21:13:05,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 21:13:05,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 21:13:05,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:13:05,893 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 21:13:05,893 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 21:13:05,893 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [283743117] [2024-10-14 21:13:05,894 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [283743117] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 21:13:05,894 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 21:13:05,894 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 21:13:05,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [394075604] [2024-10-14 21:13:05,895 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 21:13:05,896 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 21:13:05,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 21:13:05,897 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 21:13:05,901 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 21:13:05,901 INFO L87 Difference]: Start difference. First operand 35 states and 39 transitions. Second operand has 5 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 21:13:05,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 21:13:05,980 INFO L93 Difference]: Finished difference Result 37 states and 42 transitions. [2024-10-14 21:13:05,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 21:13:05,982 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2024-10-14 21:13:05,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 21:13:05,984 INFO L225 Difference]: With dead ends: 37 [2024-10-14 21:13:05,986 INFO L226 Difference]: Without dead ends: 36 [2024-10-14 21:13:05,986 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-14 21:13:05,989 INFO L432 NwaCegarLoop]: 10 mSDtfsCounter, 27 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 21:13:05,989 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 22 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 21:13:05,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2024-10-14 21:13:06,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 34. [2024-10-14 21:13:06,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 22 states have (on average 1.4090909090909092) internal successors, (31), 28 states have internal predecessors, (31), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-14 21:13:06,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 37 transitions. [2024-10-14 21:13:06,003 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 37 transitions. Word has length 6 [2024-10-14 21:13:06,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 21:13:06,004 INFO L471 AbstractCegarLoop]: Abstraction has 34 states and 37 transitions. [2024-10-14 21:13:06,004 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 21:13:06,004 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 37 transitions. [2024-10-14 21:13:06,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-10-14 21:13:06,005 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 21:13:06,006 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-10-14 21:13:06,006 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-14 21:13:06,006 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting sumErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, sumErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-10-14 21:13:06,007 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 21:13:06,007 INFO L85 PathProgramCache]: Analyzing trace with hash -75113061, now seen corresponding path program 1 times [2024-10-14 21:13:06,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 21:13:06,008 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [778227754] [2024-10-14 21:13:06,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 21:13:06,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 21:13:06,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:13:06,091 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 21:13:06,091 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 21:13:06,091 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [778227754] [2024-10-14 21:13:06,091 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [778227754] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 21:13:06,092 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 21:13:06,092 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 21:13:06,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1323048827] [2024-10-14 21:13:06,092 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 21:13:06,093 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 21:13:06,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 21:13:06,093 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 21:13:06,094 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 21:13:06,094 INFO L87 Difference]: Start difference. First operand 34 states and 37 transitions. Second operand has 5 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 21:13:06,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 21:13:06,160 INFO L93 Difference]: Finished difference Result 36 states and 37 transitions. [2024-10-14 21:13:06,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 21:13:06,160 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2024-10-14 21:13:06,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 21:13:06,161 INFO L225 Difference]: With dead ends: 36 [2024-10-14 21:13:06,161 INFO L226 Difference]: Without dead ends: 34 [2024-10-14 21:13:06,162 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-14 21:13:06,163 INFO L432 NwaCegarLoop]: 18 mSDtfsCounter, 14 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 21:13:06,164 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 61 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 21:13:06,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2024-10-14 21:13:06,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2024-10-14 21:13:06,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 22 states have (on average 1.3181818181818181) internal successors, (29), 28 states have internal predecessors, (29), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-14 21:13:06,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 35 transitions. [2024-10-14 21:13:06,171 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 35 transitions. Word has length 7 [2024-10-14 21:13:06,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 21:13:06,171 INFO L471 AbstractCegarLoop]: Abstraction has 34 states and 35 transitions. [2024-10-14 21:13:06,171 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 21:13:06,172 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 35 transitions. [2024-10-14 21:13:06,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-10-14 21:13:06,172 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 21:13:06,173 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 21:13:06,173 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-14 21:13:06,173 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting sumErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, sumErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-10-14 21:13:06,174 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 21:13:06,174 INFO L85 PathProgramCache]: Analyzing trace with hash -1695709356, now seen corresponding path program 1 times [2024-10-14 21:13:06,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 21:13:06,174 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1898386757] [2024-10-14 21:13:06,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 21:13:06,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 21:13:06,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:13:06,295 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 21:13:06,296 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 21:13:06,296 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1898386757] [2024-10-14 21:13:06,296 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1898386757] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 21:13:06,296 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [630404419] [2024-10-14 21:13:06,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 21:13:06,297 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 21:13:06,297 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 21:13:06,299 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-10-14 21:13:06,301 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-10-14 21:13:06,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:13:06,359 INFO L255 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-14 21:13:06,367 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 21:13:06,431 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 21:13:06,432 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 21:13:06,517 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 21:13:06,518 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [630404419] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 21:13:06,518 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 21:13:06,518 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2024-10-14 21:13:06,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1372240522] [2024-10-14 21:13:06,518 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 21:13:06,519 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-14 21:13:06,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 21:13:06,520 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-14 21:13:06,520 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2024-10-14 21:13:06,520 INFO L87 Difference]: Start difference. First operand 34 states and 35 transitions. Second operand has 12 states, 10 states have (on average 1.9) internal successors, (19), 7 states have internal predecessors, (19), 4 states have call successors, (4), 4 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 21:13:06,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 21:13:06,669 INFO L93 Difference]: Finished difference Result 87 states and 96 transitions. [2024-10-14 21:13:06,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-14 21:13:06,670 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 1.9) internal successors, (19), 7 states have internal predecessors, (19), 4 states have call successors, (4), 4 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2024-10-14 21:13:06,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 21:13:06,671 INFO L225 Difference]: With dead ends: 87 [2024-10-14 21:13:06,671 INFO L226 Difference]: Without dead ends: 71 [2024-10-14 21:13:06,672 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=68, Invalid=172, Unknown=0, NotChecked=0, Total=240 [2024-10-14 21:13:06,673 INFO L432 NwaCegarLoop]: 22 mSDtfsCounter, 96 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 21:13:06,673 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 109 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 21:13:06,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2024-10-14 21:13:06,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 63. [2024-10-14 21:13:06,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 46 states have (on average 1.2608695652173914) internal successors, (58), 51 states have internal predecessors, (58), 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-10-14 21:13:06,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 70 transitions. [2024-10-14 21:13:06,685 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 70 transitions. Word has length 12 [2024-10-14 21:13:06,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 21:13:06,685 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 70 transitions. [2024-10-14 21:13:06,685 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 1.9) internal successors, (19), 7 states have internal predecessors, (19), 4 states have call successors, (4), 4 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 21:13:06,686 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 70 transitions. [2024-10-14 21:13:06,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-10-14 21:13:06,686 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 21:13:06,686 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2024-10-14 21:13:06,699 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-14 21:13:06,889 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-10-14 21:13:06,890 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting sumErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, sumErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-10-14 21:13:06,890 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 21:13:06,890 INFO L85 PathProgramCache]: Analyzing trace with hash -1783930154, now seen corresponding path program 1 times [2024-10-14 21:13:06,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 21:13:06,891 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2065040121] [2024-10-14 21:13:06,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 21:13:06,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 21:13:06,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:13:06,999 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 21:13:06,999 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 21:13:07,000 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2065040121] [2024-10-14 21:13:07,000 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2065040121] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 21:13:07,000 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1080047596] [2024-10-14 21:13:07,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 21:13:07,000 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 21:13:07,001 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 21:13:07,002 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-10-14 21:13:07,006 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-10-14 21:13:07,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:13:07,040 INFO L255 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-14 21:13:07,041 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 21:13:07,089 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 21:13:07,090 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 21:13:07,090 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1080047596] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 21:13:07,090 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-14 21:13:07,090 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 9 [2024-10-14 21:13:07,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [325297870] [2024-10-14 21:13:07,090 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 21:13:07,091 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 21:13:07,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 21:13:07,091 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 21:13:07,091 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-10-14 21:13:07,092 INFO L87 Difference]: Start difference. First operand 63 states and 70 transitions. Second operand has 5 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 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-10-14 21:13:07,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 21:13:07,153 INFO L93 Difference]: Finished difference Result 65 states and 73 transitions. [2024-10-14 21:13:07,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 21:13:07,155 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 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 14 [2024-10-14 21:13:07,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 21:13:07,156 INFO L225 Difference]: With dead ends: 65 [2024-10-14 21:13:07,156 INFO L226 Difference]: Without dead ends: 64 [2024-10-14 21:13:07,156 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 11 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-10-14 21:13:07,157 INFO L432 NwaCegarLoop]: 20 mSDtfsCounter, 26 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 21:13:07,157 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 44 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 21:13:07,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2024-10-14 21:13:07,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 62. [2024-10-14 21:13:07,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 46 states have (on average 1.173913043478261) internal successors, (54), 50 states have internal predecessors, (54), 6 states have call successors, (6), 5 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-14 21:13:07,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 66 transitions. [2024-10-14 21:13:07,175 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 66 transitions. Word has length 14 [2024-10-14 21:13:07,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 21:13:07,176 INFO L471 AbstractCegarLoop]: Abstraction has 62 states and 66 transitions. [2024-10-14 21:13:07,176 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 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-10-14 21:13:07,176 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 66 transitions. [2024-10-14 21:13:07,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-10-14 21:13:07,176 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 21:13:07,176 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2024-10-14 21:13:07,195 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-10-14 21:13:07,382 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-10-14 21:13:07,383 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting sumErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, sumErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-10-14 21:13:07,384 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 21:13:07,384 INFO L85 PathProgramCache]: Analyzing trace with hash 532740141, now seen corresponding path program 1 times [2024-10-14 21:13:07,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 21:13:07,384 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [344259577] [2024-10-14 21:13:07,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 21:13:07,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 21:13:07,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:13:07,458 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 21:13:07,458 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 21:13:07,458 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [344259577] [2024-10-14 21:13:07,459 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [344259577] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 21:13:07,459 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1733407666] [2024-10-14 21:13:07,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 21:13:07,459 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 21:13:07,459 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 21:13:07,461 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-10-14 21:13:07,462 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-10-14 21:13:07,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:13:07,502 INFO L255 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-14 21:13:07,503 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 21:13:07,552 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 21:13:07,552 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 21:13:07,625 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 21:13:07,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1733407666] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 21:13:07,625 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 21:13:07,625 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 13 [2024-10-14 21:13:07,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [106830070] [2024-10-14 21:13:07,626 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 21:13:07,626 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-10-14 21:13:07,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 21:13:07,627 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-10-14 21:13:07,627 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=160, Unknown=0, NotChecked=0, Total=210 [2024-10-14 21:13:07,627 INFO L87 Difference]: Start difference. First operand 62 states and 66 transitions. Second operand has 15 states, 11 states have (on average 3.0) internal successors, (33), 9 states have internal predecessors, (33), 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-10-14 21:13:07,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 21:13:07,763 INFO L93 Difference]: Finished difference Result 65 states and 69 transitions. [2024-10-14 21:13:07,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-14 21:13:07,765 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 11 states have (on average 3.0) internal successors, (33), 9 states have internal predecessors, (33), 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 15 [2024-10-14 21:13:07,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 21:13:07,765 INFO L225 Difference]: With dead ends: 65 [2024-10-14 21:13:07,765 INFO L226 Difference]: Without dead ends: 64 [2024-10-14 21:13:07,766 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 20 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-10-14 21:13:07,766 INFO L432 NwaCegarLoop]: 22 mSDtfsCounter, 84 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 21:13:07,767 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 104 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 21:13:07,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2024-10-14 21:13:07,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 62. [2024-10-14 21:13:07,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 46 states have (on average 1.108695652173913) internal successors, (51), 50 states have internal predecessors, (51), 6 states have call successors, (6), 5 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-14 21:13:07,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 63 transitions. [2024-10-14 21:13:07,786 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 63 transitions. Word has length 15 [2024-10-14 21:13:07,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 21:13:07,787 INFO L471 AbstractCegarLoop]: Abstraction has 62 states and 63 transitions. [2024-10-14 21:13:07,787 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 11 states have (on average 3.0) internal successors, (33), 9 states have internal predecessors, (33), 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-10-14 21:13:07,787 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 63 transitions. [2024-10-14 21:13:07,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-10-14 21:13:07,788 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 21:13:07,788 INFO L215 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2024-10-14 21:13:07,805 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-14 21:13:07,989 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-10-14 21:13:07,989 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting sumErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, sumErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-10-14 21:13:07,990 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 21:13:07,990 INFO L85 PathProgramCache]: Analyzing trace with hash 381703833, now seen corresponding path program 2 times [2024-10-14 21:13:07,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 21:13:07,990 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [326133440] [2024-10-14 21:13:07,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 21:13:07,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 21:13:08,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:13:08,159 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 21:13:08,159 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 21:13:08,160 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [326133440] [2024-10-14 21:13:08,160 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [326133440] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 21:13:08,160 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1771451697] [2024-10-14 21:13:08,160 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-14 21:13:08,160 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 21:13:08,160 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 21:13:08,162 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-10-14 21:13:08,164 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-10-14 21:13:08,206 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-14 21:13:08,206 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-14 21:13:08,207 INFO L255 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-10-14 21:13:08,209 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 21:13:08,341 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 21:13:08,341 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 21:13:08,543 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 21:13:08,544 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1771451697] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 21:13:08,544 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 21:13:08,544 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 23 [2024-10-14 21:13:08,544 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1856280953] [2024-10-14 21:13:08,544 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 21:13:08,545 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-10-14 21:13:08,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 21:13:08,546 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-10-14 21:13:08,546 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=416, Unknown=0, NotChecked=0, Total=552 [2024-10-14 21:13:08,546 INFO L87 Difference]: Start difference. First operand 62 states and 63 transitions. Second operand has 24 states, 22 states have (on average 2.5) internal successors, (55), 13 states have internal predecessors, (55), 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-10-14 21:13:08,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 21:13:08,853 INFO L93 Difference]: Finished difference Result 154 states and 166 transitions. [2024-10-14 21:13:08,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-10-14 21:13:08,854 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 22 states have (on average 2.5) internal successors, (55), 13 states have internal predecessors, (55), 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 33 [2024-10-14 21:13:08,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 21:13:08,855 INFO L225 Difference]: With dead ends: 154 [2024-10-14 21:13:08,855 INFO L226 Difference]: Without dead ends: 130 [2024-10-14 21:13:08,856 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 54 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-10-14 21:13:08,857 INFO L432 NwaCegarLoop]: 33 mSDtfsCounter, 182 mSDsluCounter, 196 mSDsCounter, 0 mSdLazyCounter, 200 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 184 SdHoareTripleChecker+Valid, 229 SdHoareTripleChecker+Invalid, 223 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 200 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 21:13:08,859 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [184 Valid, 229 Invalid, 223 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 200 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 21:13:08,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2024-10-14 21:13:08,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 122. [2024-10-14 21:13:08,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 94 states have (on average 1.1170212765957446) internal successors, (105), 98 states have internal predecessors, (105), 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-10-14 21:13:08,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 129 transitions. [2024-10-14 21:13:08,883 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 129 transitions. Word has length 33 [2024-10-14 21:13:08,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 21:13:08,885 INFO L471 AbstractCegarLoop]: Abstraction has 122 states and 129 transitions. [2024-10-14 21:13:08,885 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 22 states have (on average 2.5) internal successors, (55), 13 states have internal predecessors, (55), 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-10-14 21:13:08,886 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 129 transitions. [2024-10-14 21:13:08,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-10-14 21:13:08,886 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 21:13:08,886 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 1, 1, 1] [2024-10-14 21:13:08,903 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-10-14 21:13:09,087 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-10-14 21:13:09,087 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting sumErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, sumErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-10-14 21:13:09,088 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 21:13:09,088 INFO L85 PathProgramCache]: Analyzing trace with hash -1729681720, now seen corresponding path program 2 times [2024-10-14 21:13:09,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 21:13:09,088 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1973432956] [2024-10-14 21:13:09,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 21:13:09,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 21:13:09,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:13:09,246 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 21:13:09,246 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 21:13:09,246 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1973432956] [2024-10-14 21:13:09,246 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1973432956] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 21:13:09,247 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1567865431] [2024-10-14 21:13:09,247 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-14 21:13:09,247 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 21:13:09,247 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 21:13:09,249 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-10-14 21:13:09,252 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-10-14 21:13:09,298 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-14 21:13:09,298 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-14 21:13:09,299 INFO L255 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-10-14 21:13:09,301 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 21:13:09,383 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 21:13:09,384 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 21:13:09,584 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 21:13:09,584 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1567865431] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 21:13:09,584 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 21:13:09,584 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 25 [2024-10-14 21:13:09,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1973376920] [2024-10-14 21:13:09,584 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 21:13:09,586 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2024-10-14 21:13:09,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 21:13:09,586 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2024-10-14 21:13:09,587 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=164, Invalid=538, Unknown=0, NotChecked=0, Total=702 [2024-10-14 21:13:09,587 INFO L87 Difference]: Start difference. First operand 122 states and 129 transitions. Second operand has 27 states, 23 states have (on average 3.0) internal successors, (69), 15 states have internal predecessors, (69), 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-10-14 21:13:09,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 21:13:09,874 INFO L93 Difference]: Finished difference Result 125 states and 132 transitions. [2024-10-14 21:13:09,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-10-14 21:13:09,874 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 23 states have (on average 3.0) internal successors, (69), 15 states have internal predecessors, (69), 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 36 [2024-10-14 21:13:09,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 21:13:09,876 INFO L225 Difference]: With dead ends: 125 [2024-10-14 21:13:09,876 INFO L226 Difference]: Without dead ends: 124 [2024-10-14 21:13:09,876 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 282 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=341, Invalid=991, Unknown=0, NotChecked=0, Total=1332 [2024-10-14 21:13:09,877 INFO L432 NwaCegarLoop]: 34 mSDtfsCounter, 216 mSDsluCounter, 269 mSDsCounter, 0 mSdLazyCounter, 216 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 218 SdHoareTripleChecker+Valid, 303 SdHoareTripleChecker+Invalid, 239 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 216 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 21:13:09,877 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [218 Valid, 303 Invalid, 239 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 216 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 21:13:09,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2024-10-14 21:13:09,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 122. [2024-10-14 21:13:09,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 94 states have (on average 1.053191489361702) internal successors, (99), 98 states have internal predecessors, (99), 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-10-14 21:13:09,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 123 transitions. [2024-10-14 21:13:09,891 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 123 transitions. Word has length 36 [2024-10-14 21:13:09,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 21:13:09,891 INFO L471 AbstractCegarLoop]: Abstraction has 122 states and 123 transitions. [2024-10-14 21:13:09,891 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 23 states have (on average 3.0) internal successors, (69), 15 states have internal predecessors, (69), 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-10-14 21:13:09,891 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 123 transitions. [2024-10-14 21:13:09,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-10-14 21:13:09,893 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 21:13:09,893 INFO L215 NwaCegarLoop]: trace histogram [11, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1] [2024-10-14 21:13:09,909 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-10-14 21:13:10,096 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-10-14 21:13:10,097 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting sumErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, sumErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-10-14 21:13:10,097 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 21:13:10,097 INFO L85 PathProgramCache]: Analyzing trace with hash 1050877305, now seen corresponding path program 3 times [2024-10-14 21:13:10,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 21:13:10,097 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [269831088] [2024-10-14 21:13:10,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 21:13:10,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 21:13:10,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:13:10,608 INFO L134 CoverageAnalysis]: Checked inductivity of 335 backedges. 0 proven. 335 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 21:13:10,609 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 21:13:10,609 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [269831088] [2024-10-14 21:13:10,609 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [269831088] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 21:13:10,610 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [517688791] [2024-10-14 21:13:10,610 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-14 21:13:10,610 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 21:13:10,610 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 21:13:10,612 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-10-14 21:13:10,613 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-10-14 21:13:10,657 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-10-14 21:13:10,658 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-14 21:13:10,659 INFO L255 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-14 21:13:10,661 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 21:13:10,769 INFO L134 CoverageAnalysis]: Checked inductivity of 335 backedges. 65 proven. 0 refuted. 0 times theorem prover too weak. 270 trivial. 0 not checked. [2024-10-14 21:13:10,769 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 21:13:10,769 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [517688791] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 21:13:10,769 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-14 21:13:10,769 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [24] total 29 [2024-10-14 21:13:10,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1076257335] [2024-10-14 21:13:10,769 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 21:13:10,770 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 21:13:10,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 21:13:10,770 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 21:13:10,771 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=177, Invalid=635, Unknown=0, NotChecked=0, Total=812 [2024-10-14 21:13:10,771 INFO L87 Difference]: Start difference. First operand 122 states and 123 transitions. Second operand has 6 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 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-10-14 21:13:10,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 21:13:10,888 INFO L93 Difference]: Finished difference Result 124 states and 126 transitions. [2024-10-14 21:13:10,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-14 21:13:10,889 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 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 75 [2024-10-14 21:13:10,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 21:13:10,890 INFO L225 Difference]: With dead ends: 124 [2024-10-14 21:13:10,890 INFO L226 Difference]: Without dead ends: 123 [2024-10-14 21:13:10,891 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 178 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=193, Invalid=799, Unknown=0, NotChecked=0, Total=992 [2024-10-14 21:13:10,892 INFO L432 NwaCegarLoop]: 14 mSDtfsCounter, 28 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 21:13:10,892 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 49 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 21:13:10,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2024-10-14 21:13:10,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 121. [2024-10-14 21:13:10,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 94 states have (on average 1.0425531914893618) internal successors, (98), 97 states have internal predecessors, (98), 12 states have call successors, (12), 11 states have call predecessors, (12), 11 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-14 21:13:10,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 122 transitions. [2024-10-14 21:13:10,904 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 122 transitions. Word has length 75 [2024-10-14 21:13:10,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 21:13:10,904 INFO L471 AbstractCegarLoop]: Abstraction has 121 states and 122 transitions. [2024-10-14 21:13:10,905 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 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-10-14 21:13:10,905 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 122 transitions. [2024-10-14 21:13:10,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2024-10-14 21:13:10,906 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 21:13:10,906 INFO L215 NwaCegarLoop]: trace histogram [11, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1] [2024-10-14 21:13:10,923 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-10-14 21:13:11,106 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-10-14 21:13:11,107 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting sumErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, sumErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-10-14 21:13:11,108 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 21:13:11,108 INFO L85 PathProgramCache]: Analyzing trace with hash -1782541855, now seen corresponding path program 1 times [2024-10-14 21:13:11,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 21:13:11,108 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [546661611] [2024-10-14 21:13:11,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 21:13:11,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 21:13:11,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:13:11,574 INFO L134 CoverageAnalysis]: Checked inductivity of 335 backedges. 0 proven. 335 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 21:13:11,574 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 21:13:11,574 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [546661611] [2024-10-14 21:13:11,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [546661611] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 21:13:11,575 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1332524836] [2024-10-14 21:13:11,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 21:13:11,575 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 21:13:11,575 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 21:13:11,577 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-10-14 21:13:11,578 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-10-14 21:13:11,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:13:11,640 INFO L255 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-10-14 21:13:11,642 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 21:13:12,242 INFO L134 CoverageAnalysis]: Checked inductivity of 335 backedges. 0 proven. 335 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 21:13:12,242 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 21:13:13,038 INFO L134 CoverageAnalysis]: Checked inductivity of 335 backedges. 0 proven. 335 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 21:13:13,038 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1332524836] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 21:13:13,038 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 21:13:13,039 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24, 24] total 71 [2024-10-14 21:13:13,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [757874783] [2024-10-14 21:13:13,039 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 21:13:13,040 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 72 states [2024-10-14 21:13:13,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 21:13:13,041 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2024-10-14 21:13:13,043 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=714, Invalid=4398, Unknown=0, NotChecked=0, Total=5112 [2024-10-14 21:13:13,043 INFO L87 Difference]: Start difference. First operand 121 states and 122 transitions. Second operand has 72 states, 69 states have (on average 2.7971014492753623) internal successors, (193), 38 states have internal predecessors, (193), 33 states have call successors, (33), 33 states have call predecessors, (33), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 21:13:14,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 21:13:14,429 INFO L93 Difference]: Finished difference Result 295 states and 320 transitions. [2024-10-14 21:13:14,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2024-10-14 21:13:14,431 INFO L78 Accepts]: Start accepts. Automaton has has 72 states, 69 states have (on average 2.7971014492753623) internal successors, (193), 38 states have internal predecessors, (193), 33 states have call successors, (33), 33 states have call predecessors, (33), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 76 [2024-10-14 21:13:14,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 21:13:14,433 INFO L225 Difference]: With dead ends: 295 [2024-10-14 21:13:14,433 INFO L226 Difference]: Without dead ends: 253 [2024-10-14 21:13:14,436 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 208 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2468 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=2028, Invalid=9102, Unknown=0, NotChecked=0, Total=11130 [2024-10-14 21:13:14,437 INFO L432 NwaCegarLoop]: 54 mSDtfsCounter, 739 mSDsluCounter, 919 mSDsCounter, 0 mSdLazyCounter, 922 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 740 SdHoareTripleChecker+Valid, 973 SdHoareTripleChecker+Invalid, 994 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 922 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-14 21:13:14,438 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [740 Valid, 973 Invalid, 994 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 922 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-14 21:13:14,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2024-10-14 21:13:14,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 240. [2024-10-14 21:13:14,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 240 states, 190 states have (on average 1.0736842105263158) internal successors, (204), 192 states have internal predecessors, (204), 24 states have call successors, (24), 23 states have call predecessors, (24), 23 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-10-14 21:13:14,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 252 transitions. [2024-10-14 21:13:14,466 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 252 transitions. Word has length 76 [2024-10-14 21:13:14,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 21:13:14,468 INFO L471 AbstractCegarLoop]: Abstraction has 240 states and 252 transitions. [2024-10-14 21:13:14,468 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 72 states, 69 states have (on average 2.7971014492753623) internal successors, (193), 38 states have internal predecessors, (193), 33 states have call successors, (33), 33 states have call predecessors, (33), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 21:13:14,468 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 252 transitions. [2024-10-14 21:13:14,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-10-14 21:13:14,471 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 21:13:14,471 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 12, 12, 11, 11, 1, 1, 1] [2024-10-14 21:13:14,488 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-10-14 21:13:14,675 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-10-14 21:13:14,676 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting sumErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, sumErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-10-14 21:13:14,676 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 21:13:14,676 INFO L85 PathProgramCache]: Analyzing trace with hash 1234632269, now seen corresponding path program 3 times [2024-10-14 21:13:14,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 21:13:14,677 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [620315344] [2024-10-14 21:13:14,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 21:13:14,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 21:13:14,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:13:15,132 INFO L134 CoverageAnalysis]: Checked inductivity of 451 backedges. 0 proven. 451 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 21:13:15,132 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 21:13:15,132 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [620315344] [2024-10-14 21:13:15,132 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [620315344] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 21:13:15,132 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1379673287] [2024-10-14 21:13:15,133 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-14 21:13:15,133 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 21:13:15,133 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 21:13:15,135 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-10-14 21:13:15,136 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-10-14 21:13:15,194 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2024-10-14 21:13:15,195 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-14 21:13:15,196 INFO L255 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-10-14 21:13:15,200 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 21:13:15,355 INFO L134 CoverageAnalysis]: Checked inductivity of 451 backedges. 0 proven. 451 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 21:13:15,355 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 21:13:15,940 INFO L134 CoverageAnalysis]: Checked inductivity of 451 backedges. 0 proven. 451 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 21:13:15,940 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1379673287] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 21:13:15,940 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 21:13:15,940 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 53 [2024-10-14 21:13:15,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1049439791] [2024-10-14 21:13:15,940 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 21:13:15,941 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 55 states [2024-10-14 21:13:15,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 21:13:15,942 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2024-10-14 21:13:15,943 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=710, Invalid=2260, Unknown=0, NotChecked=0, Total=2970 [2024-10-14 21:13:15,943 INFO L87 Difference]: Start difference. First operand 240 states and 252 transitions. Second operand has 55 states, 51 states have (on average 3.0) internal successors, (153), 29 states have internal predecessors, (153), 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-10-14 21:13:16,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 21:13:16,657 INFO L93 Difference]: Finished difference Result 273 states and 289 transitions. [2024-10-14 21:13:16,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2024-10-14 21:13:16,658 INFO L78 Accepts]: Start accepts. Automaton has has 55 states, 51 states have (on average 3.0) internal successors, (153), 29 states have internal predecessors, (153), 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 85 [2024-10-14 21:13:16,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 21:13:16,660 INFO L225 Difference]: With dead ends: 273 [2024-10-14 21:13:16,660 INFO L226 Difference]: Without dead ends: 272 [2024-10-14 21:13:16,664 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 217 GetRequests, 140 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1360 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1636, Invalid=4526, Unknown=0, NotChecked=0, Total=6162 [2024-10-14 21:13:16,664 INFO L432 NwaCegarLoop]: 53 mSDtfsCounter, 562 mSDsluCounter, 553 mSDsCounter, 0 mSdLazyCounter, 461 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 564 SdHoareTripleChecker+Valid, 606 SdHoareTripleChecker+Invalid, 514 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 461 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-14 21:13:16,665 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [564 Valid, 606 Invalid, 514 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 461 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-14 21:13:16,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2024-10-14 21:13:16,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 264. [2024-10-14 21:13:16,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 264 states, 210 states have (on average 1.0333333333333334) internal successors, (217), 212 states have internal predecessors, (217), 26 states have call successors, (26), 25 states have call predecessors, (26), 25 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-10-14 21:13:16,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 269 transitions. [2024-10-14 21:13:16,689 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 269 transitions. Word has length 85 [2024-10-14 21:13:16,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 21:13:16,690 INFO L471 AbstractCegarLoop]: Abstraction has 264 states and 269 transitions. [2024-10-14 21:13:16,690 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 55 states, 51 states have (on average 3.0) internal successors, (153), 29 states have internal predecessors, (153), 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-10-14 21:13:16,690 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 269 transitions. [2024-10-14 21:13:16,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2024-10-14 21:13:16,694 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 21:13:16,694 INFO L215 NwaCegarLoop]: trace histogram [23, 22, 22, 22, 22, 22, 22, 1, 1, 1, 1, 1] [2024-10-14 21:13:16,711 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-10-14 21:13:16,894 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-10-14 21:13:16,895 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting sumErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, sumErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-10-14 21:13:16,895 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 21:13:16,895 INFO L85 PathProgramCache]: Analyzing trace with hash 754549793, now seen corresponding path program 2 times [2024-10-14 21:13:16,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 21:13:16,896 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1195546009] [2024-10-14 21:13:16,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 21:13:16,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 21:13:16,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:13:18,219 INFO L134 CoverageAnalysis]: Checked inductivity of 1661 backedges. 0 proven. 1661 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 21:13:18,220 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 21:13:18,220 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1195546009] [2024-10-14 21:13:18,220 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1195546009] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 21:13:18,220 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [30354308] [2024-10-14 21:13:18,220 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-14 21:13:18,220 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 21:13:18,221 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 21:13:18,222 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-10-14 21:13:18,224 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-10-14 21:13:18,299 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-14 21:13:18,300 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-14 21:13:18,302 INFO L255 TraceCheckSpWp]: Trace formula consists of 368 conjuncts, 48 conjuncts are in the unsatisfiable core [2024-10-14 21:13:18,305 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 21:13:19,977 INFO L134 CoverageAnalysis]: Checked inductivity of 1661 backedges. 0 proven. 1661 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 21:13:19,977 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 21:13:21,621 INFO L134 CoverageAnalysis]: Checked inductivity of 1661 backedges. 0 proven. 1661 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 21:13:21,622 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [30354308] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 21:13:21,622 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 21:13:21,622 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 48, 48] total 101 [2024-10-14 21:13:21,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [713718597] [2024-10-14 21:13:21,622 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 21:13:21,623 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 102 states [2024-10-14 21:13:21,623 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 21:13:21,624 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 102 interpolants. [2024-10-14 21:13:21,628 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1308, Invalid=8994, Unknown=0, NotChecked=0, Total=10302 [2024-10-14 21:13:21,628 INFO L87 Difference]: Start difference. First operand 264 states and 269 transitions. Second operand has 102 states, 99 states have (on average 2.909090909090909) internal successors, (288), 53 states have internal predecessors, (288), 49 states have call successors, (49), 48 states have call predecessors, (49), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 21:13:23,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 21:13:23,921 INFO L93 Difference]: Finished difference Result 358 states and 364 transitions. [2024-10-14 21:13:23,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2024-10-14 21:13:23,921 INFO L78 Accepts]: Start accepts. Automaton has has 102 states, 99 states have (on average 2.909090909090909) internal successors, (288), 53 states have internal predecessors, (288), 49 states have call successors, (49), 48 states have call predecessors, (49), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 160 [2024-10-14 21:13:23,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 21:13:23,923 INFO L225 Difference]: With dead ends: 358 [2024-10-14 21:13:23,923 INFO L226 Difference]: Without dead ends: 273 [2024-10-14 21:13:23,928 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 415 GetRequests, 224 SyntacticMatches, 42 SemanticMatches, 149 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8234 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=4038, Invalid=18612, Unknown=0, NotChecked=0, Total=22650 [2024-10-14 21:13:23,929 INFO L432 NwaCegarLoop]: 60 mSDtfsCounter, 1049 mSDsluCounter, 967 mSDsCounter, 0 mSdLazyCounter, 1220 mSolverCounterSat, 99 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1050 SdHoareTripleChecker+Valid, 1027 SdHoareTripleChecker+Invalid, 1319 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 99 IncrementalHoareTripleChecker+Valid, 1220 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-14 21:13:23,929 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1050 Valid, 1027 Invalid, 1319 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [99 Valid, 1220 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-14 21:13:23,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2024-10-14 21:13:23,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 270. [2024-10-14 21:13:23,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 270 states, 214 states have (on average 1.0186915887850467) internal successors, (218), 216 states have internal predecessors, (218), 27 states have call successors, (27), 26 states have call predecessors, (27), 26 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2024-10-14 21:13:23,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 272 transitions. [2024-10-14 21:13:23,947 INFO L78 Accepts]: Start accepts. Automaton has 270 states and 272 transitions. Word has length 160 [2024-10-14 21:13:23,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 21:13:23,947 INFO L471 AbstractCegarLoop]: Abstraction has 270 states and 272 transitions. [2024-10-14 21:13:23,948 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 102 states, 99 states have (on average 2.909090909090909) internal successors, (288), 53 states have internal predecessors, (288), 49 states have call successors, (49), 48 states have call predecessors, (49), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 21:13:23,948 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 272 transitions. [2024-10-14 21:13:23,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2024-10-14 21:13:23,950 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 21:13:23,951 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 25, 25, 24, 24, 1, 1, 1] [2024-10-14 21:13:23,969 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-10-14 21:13:24,152 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-10-14 21:13:24,152 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting sumErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, sumErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-10-14 21:13:24,153 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 21:13:24,153 INFO L85 PathProgramCache]: Analyzing trace with hash -528459128, now seen corresponding path program 4 times [2024-10-14 21:13:24,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 21:13:24,153 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2112093170] [2024-10-14 21:13:24,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 21:13:24,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 21:13:24,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:13:25,564 INFO L134 CoverageAnalysis]: Checked inductivity of 2076 backedges. 0 proven. 2076 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 21:13:25,565 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 21:13:25,565 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2112093170] [2024-10-14 21:13:25,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2112093170] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 21:13:25,565 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2003797217] [2024-10-14 21:13:25,565 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-10-14 21:13:25,566 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 21:13:25,566 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 21:13:25,567 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 21:13:25,568 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-10-14 21:13:25,647 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-10-14 21:13:25,647 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-14 21:13:25,649 INFO L255 TraceCheckSpWp]: Trace formula consists of 400 conjuncts, 52 conjuncts are in the unsatisfiable core [2024-10-14 21:13:25,651 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 21:13:25,864 INFO L134 CoverageAnalysis]: Checked inductivity of 2076 backedges. 0 proven. 2076 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 21:13:25,864 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 21:13:27,790 INFO L134 CoverageAnalysis]: Checked inductivity of 2076 backedges. 0 proven. 2076 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 21:13:27,790 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2003797217] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 21:13:27,790 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 21:13:27,790 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 51, 51] total 105 [2024-10-14 21:13:27,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2085851938] [2024-10-14 21:13:27,791 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 21:13:27,791 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 107 states [2024-10-14 21:13:27,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 21:13:27,793 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 107 interpolants. [2024-10-14 21:13:27,794 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=2764, Invalid=8578, Unknown=0, NotChecked=0, Total=11342 [2024-10-14 21:13:27,794 INFO L87 Difference]: Start difference. First operand 270 states and 272 transitions. Second operand has 107 states, 103 states have (on average 3.0) internal successors, (309), 55 states have internal predecessors, (309), 52 states have call successors, (52), 51 states have call predecessors, (52), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 21:13:29,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 21:13:29,984 INFO L93 Difference]: Finished difference Result 648 states and 700 transitions. [2024-10-14 21:13:29,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 104 states. [2024-10-14 21:13:29,985 INFO L78 Accepts]: Start accepts. Automaton has has 107 states, 103 states have (on average 3.0) internal successors, (309), 55 states have internal predecessors, (309), 52 states have call successors, (52), 51 states have call predecessors, (52), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 176 [2024-10-14 21:13:29,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 21:13:29,988 INFO L225 Difference]: With dead ends: 648 [2024-10-14 21:13:29,988 INFO L226 Difference]: Without dead ends: 647 [2024-10-14 21:13:29,990 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 451 GetRequests, 296 SyntacticMatches, 0 SemanticMatches, 155 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5442 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=6641, Invalid=17851, Unknown=0, NotChecked=0, Total=24492 [2024-10-14 21:13:29,991 INFO L432 NwaCegarLoop]: 59 mSDtfsCounter, 1626 mSDsluCounter, 881 mSDsCounter, 0 mSdLazyCounter, 846 mSolverCounterSat, 184 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1628 SdHoareTripleChecker+Valid, 940 SdHoareTripleChecker+Invalid, 1030 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 184 IncrementalHoareTripleChecker+Valid, 846 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-14 21:13:29,991 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1628 Valid, 940 Invalid, 1030 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [184 Valid, 846 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-14 21:13:29,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 647 states. [2024-10-14 21:13:30,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 647 to 570. [2024-10-14 21:13:30,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 570 states, 464 states have (on average 1.1142241379310345) internal successors, (517), 466 states have internal predecessors, (517), 52 states have call successors, (52), 51 states have call predecessors, (52), 51 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) [2024-10-14 21:13:30,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 570 states to 570 states and 621 transitions. [2024-10-14 21:13:30,027 INFO L78 Accepts]: Start accepts. Automaton has 570 states and 621 transitions. Word has length 176 [2024-10-14 21:13:30,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 21:13:30,028 INFO L471 AbstractCegarLoop]: Abstraction has 570 states and 621 transitions. [2024-10-14 21:13:30,028 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 107 states, 103 states have (on average 3.0) internal successors, (309), 55 states have internal predecessors, (309), 52 states have call successors, (52), 51 states have call predecessors, (52), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 21:13:30,029 INFO L276 IsEmpty]: Start isEmpty. Operand 570 states and 621 transitions. [2024-10-14 21:13:30,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2024-10-14 21:13:30,030 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 21:13:30,030 INFO L215 NwaCegarLoop]: trace histogram [26, 25, 25, 25, 25, 25, 25, 1, 1, 1, 1, 1] [2024-10-14 21:13:30,047 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2024-10-14 21:13:30,231 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2024-10-14 21:13:30,231 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting sumErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, sumErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-10-14 21:13:30,231 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 21:13:30,231 INFO L85 PathProgramCache]: Analyzing trace with hash -271077658, now seen corresponding path program 3 times [2024-10-14 21:13:30,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 21:13:30,232 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1634562707] [2024-10-14 21:13:30,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 21:13:30,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 21:13:30,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:13:31,665 INFO L134 CoverageAnalysis]: Checked inductivity of 2150 backedges. 0 proven. 2150 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 21:13:31,665 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 21:13:31,665 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1634562707] [2024-10-14 21:13:31,666 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1634562707] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 21:13:31,666 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1792214974] [2024-10-14 21:13:31,666 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-14 21:13:31,666 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 21:13:31,666 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 21:13:31,670 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 21:13:31,672 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-10-14 21:13:31,720 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-10-14 21:13:31,720 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-14 21:13:31,720 INFO L255 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-14 21:13:31,722 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 21:13:31,840 INFO L134 CoverageAnalysis]: Checked inductivity of 2150 backedges. 74 proven. 0 refuted. 0 times theorem prover too weak. 2076 trivial. 0 not checked. [2024-10-14 21:13:31,841 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 21:13:31,841 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1792214974] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 21:13:31,841 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-14 21:13:31,841 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [54] total 59 [2024-10-14 21:13:31,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [893317004] [2024-10-14 21:13:31,841 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 21:13:31,841 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 21:13:31,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 21:13:31,842 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 21:13:31,842 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=847, Invalid=2693, Unknown=0, NotChecked=0, Total=3540 [2024-10-14 21:13:31,843 INFO L87 Difference]: Start difference. First operand 570 states and 621 transitions. Second operand has 6 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 21:13:31,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 21:13:31,980 INFO L93 Difference]: Finished difference Result 622 states and 674 transitions. [2024-10-14 21:13:31,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 21:13:31,981 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 181 [2024-10-14 21:13:31,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 21:13:31,983 INFO L225 Difference]: With dead ends: 622 [2024-10-14 21:13:31,984 INFO L226 Difference]: Without dead ends: 621 [2024-10-14 21:13:31,984 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 238 GetRequests, 177 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 806 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=863, Invalid=3043, Unknown=0, NotChecked=0, Total=3906 [2024-10-14 21:13:31,985 INFO L432 NwaCegarLoop]: 20 mSDtfsCounter, 20 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 21:13:31,985 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 64 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 21:13:31,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 621 states. [2024-10-14 21:13:32,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 621 to 569. [2024-10-14 21:13:32,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 569 states, 464 states have (on average 1.0581896551724137) internal successors, (491), 465 states have internal predecessors, (491), 52 states have call successors, (52), 51 states have call predecessors, (52), 51 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) [2024-10-14 21:13:32,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 569 states to 569 states and 595 transitions. [2024-10-14 21:13:32,022 INFO L78 Accepts]: Start accepts. Automaton has 569 states and 595 transitions. Word has length 181 [2024-10-14 21:13:32,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 21:13:32,022 INFO L471 AbstractCegarLoop]: Abstraction has 569 states and 595 transitions. [2024-10-14 21:13:32,022 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 21:13:32,022 INFO L276 IsEmpty]: Start isEmpty. Operand 569 states and 595 transitions. [2024-10-14 21:13:32,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 262 [2024-10-14 21:13:32,025 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 21:13:32,025 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 25, 25, 25, 25, 25, 25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 21:13:32,042 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2024-10-14 21:13:32,226 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2024-10-14 21:13:32,226 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, sumErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-10-14 21:13:32,227 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 21:13:32,227 INFO L85 PathProgramCache]: Analyzing trace with hash -249705433, now seen corresponding path program 1 times [2024-10-14 21:13:32,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 21:13:32,227 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [941959435] [2024-10-14 21:13:32,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 21:13:32,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 21:13:32,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:13:32,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 21:13:32,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:13:32,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-14 21:13:32,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:13:32,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-14 21:13:32,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:13:32,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-14 21:13:32,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:13:32,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-14 21:13:32,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:13:32,552 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-14 21:13:32,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:13:32,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-14 21:13:32,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:13:32,606 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-14 21:13:32,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:13:32,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-14 21:13:32,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:13:32,658 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-14 21:13:32,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:13:32,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-14 21:13:32,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:13:32,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-14 21:13:32,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:13:32,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-14 21:13:32,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:13:32,741 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-14 21:13:32,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:13:32,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-14 21:13:32,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:13:32,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-14 21:13:32,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:13:32,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-14 21:13:32,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:13:32,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-14 21:13:32,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:13:32,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-14 21:13:32,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:13:32,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-14 21:13:32,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:13:32,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-14 21:13:32,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:13:32,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-14 21:13:32,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:13:32,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-14 21:13:32,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:13:32,900 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-14 21:13:32,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:13:32,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-14 21:13:32,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:13:32,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-14 21:13:32,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:13:32,921 INFO L134 CoverageAnalysis]: Checked inductivity of 3100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3100 trivial. 0 not checked. [2024-10-14 21:13:32,922 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 21:13:32,922 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [941959435] [2024-10-14 21:13:32,922 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [941959435] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 21:13:32,922 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 21:13:32,922 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 21:13:32,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [863622260] [2024-10-14 21:13:32,922 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 21:13:32,923 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 21:13:32,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 21:13:32,924 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 21:13:32,924 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 21:13:32,924 INFO L87 Difference]: Start difference. First operand 569 states and 595 transitions. Second operand has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-14 21:13:32,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 21:13:32,955 INFO L93 Difference]: Finished difference Result 569 states and 595 transitions. [2024-10-14 21:13:32,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 21:13:32,956 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 261 [2024-10-14 21:13:32,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 21:13:32,958 INFO L225 Difference]: With dead ends: 569 [2024-10-14 21:13:32,958 INFO L226 Difference]: Without dead ends: 360 [2024-10-14 21:13:32,959 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 52 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-10-14 21:13:32,961 INFO L432 NwaCegarLoop]: 17 mSDtfsCounter, 0 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 21:13:32,961 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 32 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 21:13:32,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 360 states. [2024-10-14 21:13:32,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 360 to 359. [2024-10-14 21:13:32,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 359 states, 307 states have (on average 1.003257328990228) internal successors, (308), 307 states have internal predecessors, (308), 51 states have call successors, (51), 51 states have call predecessors, (51), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 21:13:32,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 359 states to 359 states and 359 transitions. [2024-10-14 21:13:32,979 INFO L78 Accepts]: Start accepts. Automaton has 359 states and 359 transitions. Word has length 261 [2024-10-14 21:13:32,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 21:13:32,981 INFO L471 AbstractCegarLoop]: Abstraction has 359 states and 359 transitions. [2024-10-14 21:13:32,981 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-14 21:13:32,981 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 359 transitions. [2024-10-14 21:13:32,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 359 [2024-10-14 21:13:32,986 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 21:13:32,986 INFO L215 NwaCegarLoop]: trace histogram [51, 51, 51, 51, 51, 50, 50, 1, 1, 1] [2024-10-14 21:13:32,986 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-14 21:13:32,986 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting sumErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, sumErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-10-14 21:13:32,987 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 21:13:32,987 INFO L85 PathProgramCache]: Analyzing trace with hash 2143411048, now seen corresponding path program 5 times [2024-10-14 21:13:32,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 21:13:32,987 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1770008003] [2024-10-14 21:13:32,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 21:13:32,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 21:13:33,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 21:13:34,698 INFO L134 CoverageAnalysis]: Checked inductivity of 8875 backedges. 6675 proven. 0 refuted. 0 times theorem prover too weak. 2200 trivial. 0 not checked. [2024-10-14 21:13:34,699 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 21:13:34,699 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1770008003] [2024-10-14 21:13:34,699 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1770008003] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 21:13:34,699 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 21:13:34,699 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [54] imperfect sequences [] total 54 [2024-10-14 21:13:34,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [709308536] [2024-10-14 21:13:34,699 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 21:13:34,700 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 55 states [2024-10-14 21:13:34,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 21:13:34,700 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2024-10-14 21:13:34,701 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=757, Invalid=2213, Unknown=0, NotChecked=0, Total=2970 [2024-10-14 21:13:34,701 INFO L87 Difference]: Start difference. First operand 359 states and 359 transitions. Second operand has 55 states, 54 states have (on average 2.962962962962963) internal successors, (160), 28 states have internal predecessors, (160), 27 states have call successors, (27), 27 states have call predecessors, (27), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 21:13:35,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 21:13:35,425 INFO L93 Difference]: Finished difference Result 359 states and 359 transitions. [2024-10-14 21:13:35,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2024-10-14 21:13:35,425 INFO L78 Accepts]: Start accepts. Automaton has has 55 states, 54 states have (on average 2.962962962962963) internal successors, (160), 28 states have internal predecessors, (160), 27 states have call successors, (27), 27 states have call predecessors, (27), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 358 [2024-10-14 21:13:35,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 21:13:35,426 INFO L225 Difference]: With dead ends: 359 [2024-10-14 21:13:35,426 INFO L226 Difference]: Without dead ends: 0 [2024-10-14 21:13:35,428 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1225 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1836, Invalid=4644, Unknown=0, NotChecked=0, Total=6480 [2024-10-14 21:13:35,429 INFO L432 NwaCegarLoop]: 76 mSDtfsCounter, 151 mSDsluCounter, 428 mSDsCounter, 0 mSdLazyCounter, 1178 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 504 SdHoareTripleChecker+Invalid, 1178 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1178 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-14 21:13:35,429 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [151 Valid, 504 Invalid, 1178 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1178 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-14 21:13:35,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-14 21:13:35,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-14 21:13:35,430 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-10-14 21:13:35,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-14 21:13:35,430 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 358 [2024-10-14 21:13:35,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 21:13:35,431 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-14 21:13:35,431 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 55 states, 54 states have (on average 2.962962962962963) internal successors, (160), 28 states have internal predecessors, (160), 27 states have call successors, (27), 27 states have call predecessors, (27), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 21:13:35,431 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-14 21:13:35,431 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-14 21:13:35,434 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 8 remaining) [2024-10-14 21:13:35,434 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 8 remaining) [2024-10-14 21:13:35,435 INFO L782 garLoopResultBuilder]: Registering result SAFE for location sumErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 8 remaining) [2024-10-14 21:13:35,435 INFO L782 garLoopResultBuilder]: Registering result SAFE for location sumErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 8 remaining) [2024-10-14 21:13:35,435 INFO L782 garLoopResultBuilder]: Registering result SAFE for location sumErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 8 remaining) [2024-10-14 21:13:35,435 INFO L782 garLoopResultBuilder]: Registering result SAFE for location sumErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 8 remaining) [2024-10-14 21:13:35,435 INFO L782 garLoopResultBuilder]: Registering result SAFE for location sumErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 8 remaining) [2024-10-14 21:13:35,435 INFO L782 garLoopResultBuilder]: Registering result SAFE for location sumErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 8 remaining) [2024-10-14 21:13:35,436 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-14 21:13:35,439 INFO L407 BasicCegarLoop]: Path program histogram: [5, 3, 3, 1, 1, 1, 1, 1] [2024-10-14 21:13:35,441 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-10-14 21:13:49,635 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-14 21:13:49,872 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2024-10-14 21:13:49,875 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.10 09:13:49 BoogieIcfgContainer [2024-10-14 21:13:49,875 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-14 21:13:49,876 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-14 21:13:49,876 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-14 21:13:49,876 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-14 21:13:49,876 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 09:13:05" (3/4) ... [2024-10-14 21:13:49,878 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-14 21:13:49,882 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure sum [2024-10-14 21:13:49,885 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges [2024-10-14 21:13:49,886 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2024-10-14 21:13:49,886 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-10-14 21:13:49,887 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-14 21:13:49,972 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-14 21:13:49,973 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-14 21:13:49,973 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-14 21:13:49,974 INFO L158 Benchmark]: Toolchain (without parser) took 45363.24ms. Allocated memory was 167.8MB in the beginning and 828.4MB in the end (delta: 660.6MB). Free memory was 111.2MB in the beginning and 713.4MB in the end (delta: -602.2MB). Peak memory consumption was 59.4MB. Max. memory is 16.1GB. [2024-10-14 21:13:49,974 INFO L158 Benchmark]: CDTParser took 1.10ms. Allocated memory is still 167.8MB. Free memory is still 129.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 21:13:49,975 INFO L158 Benchmark]: CACSL2BoogieTranslator took 233.94ms. Allocated memory is still 167.8MB. Free memory was 110.7MB in the beginning and 99.5MB in the end (delta: 11.2MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-10-14 21:13:49,975 INFO L158 Benchmark]: Boogie Procedure Inliner took 29.51ms. Allocated memory is still 167.8MB. Free memory was 99.5MB in the beginning and 98.0MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-14 21:13:49,976 INFO L158 Benchmark]: Boogie Preprocessor took 31.26ms. Allocated memory is still 167.8MB. Free memory was 98.0MB in the beginning and 96.5MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-14 21:13:49,976 INFO L158 Benchmark]: RCFGBuilder took 291.24ms. Allocated memory is still 167.8MB. Free memory was 96.5MB in the beginning and 84.9MB in the end (delta: 11.6MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-10-14 21:13:49,976 INFO L158 Benchmark]: TraceAbstraction took 44673.18ms. Allocated memory was 167.8MB in the beginning and 828.4MB in the end (delta: 660.6MB). Free memory was 83.9MB in the beginning and 717.6MB in the end (delta: -633.6MB). Peak memory consumption was 447.3MB. Max. memory is 16.1GB. [2024-10-14 21:13:49,976 INFO L158 Benchmark]: Witness Printer took 97.57ms. Allocated memory is still 828.4MB. Free memory was 717.6MB in the beginning and 713.4MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-14 21:13:49,979 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.10ms. Allocated memory is still 167.8MB. Free memory is still 129.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 233.94ms. Allocated memory is still 167.8MB. Free memory was 110.7MB in the beginning and 99.5MB in the end (delta: 11.2MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 29.51ms. Allocated memory is still 167.8MB. Free memory was 99.5MB in the beginning and 98.0MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 31.26ms. Allocated memory is still 167.8MB. Free memory was 98.0MB in the beginning and 96.5MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 291.24ms. Allocated memory is still 167.8MB. Free memory was 96.5MB in the beginning and 84.9MB in the end (delta: 11.6MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 44673.18ms. Allocated memory was 167.8MB in the beginning and 828.4MB in the end (delta: 660.6MB). Free memory was 83.9MB in the beginning and 717.6MB in the end (delta: -633.6MB). Peak memory consumption was 447.3MB. Max. memory is 16.1GB. * Witness Printer took 97.57ms. Allocated memory is still 828.4MB. Free memory was 717.6MB in the beginning and 713.4MB 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, 28 locations, 8 error locations. Started 1 CEGAR loops. OverallTime: 30.2s, OverallIterations: 16, TraceHistogramMax: 51, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 9.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 4863 SdHoareTripleChecker+Valid, 2.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 4843 mSDsluCounter, 5126 SdHoareTripleChecker+Invalid, 2.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 4597 mSDsCounter, 501 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5487 IncrementalHoareTripleChecker+Invalid, 5988 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 501 mSolverCounterUnsat, 529 mSDtfsCounter, 5487 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2044 GetRequests, 1227 SyntacticMatches, 42 SemanticMatches, 775 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20261 ImplicationChecksByTransitivity, 15.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=570occurred in iteration=13, InterpolantAutomatonStates: 423, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 16 MinimizatonAttempts, 183 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 17.4s InterpolantComputationTime, 2363 NumberOfCodeBlocks, 2132 NumberOfCodeBlocksAsserted, 44 NumberOfCheckSat, 2921 ConstructedInterpolants, 0 QuantifiedInterpolants, 7447 SizeOfPredicates, 89 NumberOfNonLiveVariables, 1624 ConjunctsInSsa, 202 ConjunctsInUnsatCore, 35 InterpolantComputations, 8 PerfectInterpolantSequences, 14465/30896 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 <= 15) && (n <= 10)) && (0 <= (m + 2147483648))) && (7 <= n)) || (((m <= 7) && (18 == n)) && (0 <= (m + 2147483648)))) || ((((n <= 9) && (m <= 16)) && (0 <= (m + 2147483648))) && (6 <= n))) || ((((0 <= n) && (0 <= (m + 2147483648))) && (m <= 10)) && (n <= 15))) || (((7 == n) && (0 <= (m + 2147483648))) && (m <= 18))) || ((((1 <= n) && (0 <= (m + 2147483648))) && (n <= 16)) && (m <= 9))) || (((0 <= (m + 2147483648)) && (n == 1)) && (m <= 24))) || (((n == 0) && (0 <= (m + 2147483648))) && (m <= 2147483622))) || (((5 == n) && (0 <= (m + 2147483648))) && (m <= 20))) || (((20 == n) && (0 <= (m + 2147483648))) && (m <= 5))) || (((m <= 6) && (0 <= (m + 2147483648))) && (19 == n))) || ((((0 <= n) && (0 <= (m + 2147483648))) && (n <= 3)) && (m <= 22))) || (((m <= 8) && (n == 17)) && (0 <= (m + 2147483648)))) || ((((9 <= n) && (n <= 12)) && (0 <= (m + 2147483648))) && (m <= 13))) || ((n == 25) && (m == 0))) || (((m <= 12) && (0 <= (m + 2147483648))) && (n == 13))) || (((0 <= (m + 2147483648)) && (m <= 17)) && (8 == n))) || (((0 <= (m + 2147483648)) && (n == 24)) && (m <= 1))) || (((0 <= (m + 2147483648)) && (14 == n)) && (m <= 11))) || ((((m <= 4) && (0 <= n)) && (0 <= (m + 2147483648))) && (n <= 21))) || ((((1 <= n) && (0 <= (m + 2147483648))) && (n <= 4)) && (m <= 21))) || ((((3 <= n) && (0 <= (m + 2147483648))) && (n <= 6)) && (m <= 19))) || (((2 == n) && (0 <= (m + 2147483648))) && (m <= 23))) || ((((m <= 14) && (n <= 11)) && (0 <= (m + 2147483648))) && (8 <= n))) || ((((0 <= (m + 2147483648)) && (m <= 2)) && (n <= 23)) && (2 <= n))) || ((((1 <= n) && (m <= 3)) && (0 <= (m + 2147483648))) && (n <= 22))) Ensures: (((((((((((((((((((((((((((((m <= 15) && (n <= 10)) && (0 <= (m + 2147483648))) && (7 <= n)) || (((m <= 7) && (18 == n)) && (0 <= (m + 2147483648)))) || ((((n <= 9) && (m <= 16)) && (0 <= (m + 2147483648))) && (6 <= n))) || ((((0 <= n) && (0 <= (m + 2147483648))) && (m <= 10)) && (n <= 15))) || (((7 == n) && (0 <= (m + 2147483648))) && (m <= 18))) || ((((1 <= n) && (0 <= (m + 2147483648))) && (n <= 16)) && (m <= 9))) || (((0 <= (m + 2147483648)) && (n == 1)) && (m <= 24))) || (((n == 0) && (0 <= (m + 2147483648))) && (m <= 2147483622))) || (((5 == n) && (0 <= (m + 2147483648))) && (m <= 20))) || (((20 == n) && (0 <= (m + 2147483648))) && (m <= 5))) || (((m <= 6) && (0 <= (m + 2147483648))) && (19 == n))) || ((((0 <= n) && (0 <= (m + 2147483648))) && (n <= 3)) && (m <= 22))) || (((m <= 8) && (n == 17)) && (0 <= (m + 2147483648)))) || ((((9 <= n) && (n <= 12)) && (0 <= (m + 2147483648))) && (m <= 13))) || ((n == 25) && (m == 0))) || (((m <= 12) && (0 <= (m + 2147483648))) && (n == 13))) || (((0 <= (m + 2147483648)) && (m <= 17)) && (8 == n))) || (((0 <= (m + 2147483648)) && (n == 24)) && (m <= 1))) || (((0 <= (m + 2147483648)) && (14 == n)) && (m <= 11))) || ((((m <= 4) && (0 <= n)) && (0 <= (m + 2147483648))) && (n <= 21))) || ((((1 <= n) && (0 <= (m + 2147483648))) && (n <= 4)) && (m <= 21))) || ((((3 <= n) && (0 <= (m + 2147483648))) && (n <= 6)) && (m <= 19))) || (((2 == n) && (0 <= (m + 2147483648))) && (m <= 23))) || ((((m <= 14) && (n <= 11)) && (0 <= (m + 2147483648))) && (8 <= n))) || ((((0 <= (m + 2147483648)) && (m <= 2)) && (n <= 23)) && (2 <= n))) || ((((1 <= n) && (m <= 3)) && (0 <= (m + 2147483648))) && (n <= 22))) RESULT: Ultimate proved your program to be correct! [2024-10-14 21:13:50,012 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE