/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf -i ../../../trunk/examples/svcomp/loop-zilu/benchmark20_conjunctive.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-e106359-m [2022-04-15 13:16:21,465 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-15 13:16:21,467 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-15 13:16:21,497 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-15 13:16:21,498 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-15 13:16:21,498 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-15 13:16:21,501 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-15 13:16:21,506 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-15 13:16:21,507 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-15 13:16:21,512 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-15 13:16:21,512 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-15 13:16:21,513 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-15 13:16:21,513 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-15 13:16:21,515 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-15 13:16:21,518 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-15 13:16:21,520 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-15 13:16:21,520 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-15 13:16:21,520 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-15 13:16:21,524 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-15 13:16:21,526 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-15 13:16:21,526 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-15 13:16:21,529 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-15 13:16:21,529 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-15 13:16:21,530 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-15 13:16:21,530 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-15 13:16:21,532 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-15 13:16:21,532 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-15 13:16:21,532 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-15 13:16:21,532 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-15 13:16:21,532 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-15 13:16:21,533 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-15 13:16:21,533 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-15 13:16:21,533 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-15 13:16:21,534 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-15 13:16:21,534 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-15 13:16:21,535 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-15 13:16:21,535 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-15 13:16:21,535 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-15 13:16:21,535 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-15 13:16:21,536 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-15 13:16:21,536 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-15 13:16:21,541 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-15 13:16:21,541 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf [2022-04-15 13:16:21,551 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-15 13:16:21,551 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-15 13:16:21,552 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-15 13:16:21,552 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-15 13:16:21,552 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-15 13:16:21,552 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-15 13:16:21,552 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-15 13:16:21,553 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-15 13:16:21,553 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-15 13:16:21,553 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-15 13:16:21,553 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-15 13:16:21,553 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-15 13:16:21,554 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-15 13:16:21,554 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-15 13:16:21,554 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-15 13:16:21,554 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 13:16:21,554 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-15 13:16:21,554 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-15 13:16:21,554 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-15 13:16:21,554 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-15 13:16:21,554 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-15 13:16:21,554 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-04-15 13:16:21,554 INFO L138 SettingsManager]: * Use separate solver for trace checks=false 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.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-15 13:16:21,704 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-15 13:16:21,719 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-15 13:16:21,721 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-15 13:16:21,722 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-15 13:16:21,723 INFO L275 PluginConnector]: CDTParser initialized [2022-04-15 13:16:21,723 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-zilu/benchmark20_conjunctive.i [2022-04-15 13:16:21,774 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1292d1be2/cf2bd2452f934004851fecc6ea8dee59/FLAG32816a5c0 [2022-04-15 13:16:22,109 INFO L306 CDTParser]: Found 1 translation units. [2022-04-15 13:16:22,109 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-zilu/benchmark20_conjunctive.i [2022-04-15 13:16:22,118 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1292d1be2/cf2bd2452f934004851fecc6ea8dee59/FLAG32816a5c0 [2022-04-15 13:16:22,548 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1292d1be2/cf2bd2452f934004851fecc6ea8dee59 [2022-04-15 13:16:22,549 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-15 13:16:22,550 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-15 13:16:22,551 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-15 13:16:22,551 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-15 13:16:22,553 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-15 13:16:22,554 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 01:16:22" (1/1) ... [2022-04-15 13:16:22,554 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@17827594 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:16:22, skipping insertion in model container [2022-04-15 13:16:22,555 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 01:16:22" (1/1) ... [2022-04-15 13:16:22,559 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-15 13:16:22,568 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-15 13:16:22,680 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-zilu/benchmark20_conjunctive.i[873,886] [2022-04-15 13:16:22,687 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 13:16:22,700 INFO L203 MainTranslator]: Completed pre-run [2022-04-15 13:16:22,708 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-zilu/benchmark20_conjunctive.i[873,886] [2022-04-15 13:16:22,711 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 13:16:22,719 INFO L208 MainTranslator]: Completed translation [2022-04-15 13:16:22,720 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:16:22 WrapperNode [2022-04-15 13:16:22,720 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-15 13:16:22,720 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-15 13:16:22,721 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-15 13:16:22,721 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-15 13:16:22,727 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:16:22" (1/1) ... [2022-04-15 13:16:22,728 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:16:22" (1/1) ... [2022-04-15 13:16:22,732 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:16:22" (1/1) ... [2022-04-15 13:16:22,732 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:16:22" (1/1) ... [2022-04-15 13:16:22,735 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:16:22" (1/1) ... [2022-04-15 13:16:22,738 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:16:22" (1/1) ... [2022-04-15 13:16:22,738 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:16:22" (1/1) ... [2022-04-15 13:16:22,741 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-15 13:16:22,741 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-15 13:16:22,741 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-15 13:16:22,741 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-15 13:16:22,742 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:16:22" (1/1) ... [2022-04-15 13:16:22,746 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 13:16:22,755 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 13:16:22,763 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-15 13:16:22,779 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-15 13:16:22,790 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-15 13:16:22,790 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-15 13:16:22,791 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-15 13:16:22,791 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-15 13:16:22,791 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-15 13:16:22,791 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-15 13:16:22,791 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2022-04-15 13:16:22,791 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2022-04-15 13:16:22,791 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-15 13:16:22,791 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-15 13:16:22,792 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-15 13:16:22,792 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2022-04-15 13:16:22,792 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-15 13:16:22,792 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-15 13:16:22,793 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-15 13:16:22,794 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-15 13:16:22,794 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-15 13:16:22,794 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-15 13:16:22,794 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-15 13:16:22,794 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-15 13:16:22,860 INFO L234 CfgBuilder]: Building ICFG [2022-04-15 13:16:22,861 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-15 13:16:22,955 INFO L275 CfgBuilder]: Performing block encoding [2022-04-15 13:16:22,959 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-15 13:16:22,960 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-15 13:16:22,961 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 01:16:22 BoogieIcfgContainer [2022-04-15 13:16:22,961 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-15 13:16:22,962 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-15 13:16:22,962 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-15 13:16:22,964 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-15 13:16:22,964 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.04 01:16:22" (1/3) ... [2022-04-15 13:16:22,965 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37ff9e0a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 01:16:22, skipping insertion in model container [2022-04-15 13:16:22,965 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:16:22" (2/3) ... [2022-04-15 13:16:22,965 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37ff9e0a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 01:16:22, skipping insertion in model container [2022-04-15 13:16:22,965 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 01:16:22" (3/3) ... [2022-04-15 13:16:22,966 INFO L111 eAbstractionObserver]: Analyzing ICFG benchmark20_conjunctive.i [2022-04-15 13:16:22,969 INFO L202 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-15 13:16:22,969 INFO L161 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-15 13:16:23,000 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-15 13:16:23,005 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, 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 [2022-04-15 13:16:23,005 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-15 13:16:23,036 INFO L276 IsEmpty]: Start isEmpty. Operand has 20 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 13 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 13:16:23,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-15 13:16:23,041 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 13:16:23,041 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 13:16:23,042 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 13:16:23,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 13:16:23,045 INFO L85 PathProgramCache]: Analyzing trace with hash -304977768, now seen corresponding path program 1 times [2022-04-15 13:16:23,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 13:16:23,050 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [815847130] [2022-04-15 13:16:23,066 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 13:16:23,066 INFO L85 PathProgramCache]: Analyzing trace with hash -304977768, now seen corresponding path program 2 times [2022-04-15 13:16:23,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:16:23,069 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [413183949] [2022-04-15 13:16:23,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:16:23,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:16:23,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:16:23,296 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 13:16:23,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:16:23,315 INFO L290 TraceCheckUtils]: 0: Hoare triple {31#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(26, 2); {23#true} is VALID [2022-04-15 13:16:23,316 INFO L290 TraceCheckUtils]: 1: Hoare triple {23#true} assume true; {23#true} is VALID [2022-04-15 13:16:23,316 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {23#true} {23#true} #45#return; {23#true} is VALID [2022-04-15 13:16:23,317 INFO L272 TraceCheckUtils]: 0: Hoare triple {23#true} call ULTIMATE.init(); {31#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 13:16:23,318 INFO L290 TraceCheckUtils]: 1: Hoare triple {31#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(26, 2); {23#true} is VALID [2022-04-15 13:16:23,318 INFO L290 TraceCheckUtils]: 2: Hoare triple {23#true} assume true; {23#true} is VALID [2022-04-15 13:16:23,318 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {23#true} {23#true} #45#return; {23#true} is VALID [2022-04-15 13:16:23,318 INFO L272 TraceCheckUtils]: 4: Hoare triple {23#true} call #t~ret5 := main(); {23#true} is VALID [2022-04-15 13:16:23,318 INFO L290 TraceCheckUtils]: 5: Hoare triple {23#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~i~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~n~0 := #t~nondet2;havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~sum~0 := #t~nondet3;havoc #t~nondet3; {23#true} is VALID [2022-04-15 13:16:23,320 INFO L290 TraceCheckUtils]: 6: Hoare triple {23#true} assume !!(((0 == ~i~0 && ~n~0 >= 0) && ~n~0 <= 100) && 0 == ~sum~0); {28#(<= 0 main_~sum~0)} is VALID [2022-04-15 13:16:23,320 INFO L290 TraceCheckUtils]: 7: Hoare triple {28#(<= 0 main_~sum~0)} assume !(~i~0 < ~n~0); {28#(<= 0 main_~sum~0)} is VALID [2022-04-15 13:16:23,321 INFO L272 TraceCheckUtils]: 8: Hoare triple {28#(<= 0 main_~sum~0)} call __VERIFIER_assert((if ~sum~0 >= 0 then 1 else 0)); {29#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 13:16:23,322 INFO L290 TraceCheckUtils]: 9: Hoare triple {29#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {30#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 13:16:23,322 INFO L290 TraceCheckUtils]: 10: Hoare triple {30#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {24#false} is VALID [2022-04-15 13:16:23,322 INFO L290 TraceCheckUtils]: 11: Hoare triple {24#false} assume !false; {24#false} is VALID [2022-04-15 13:16:23,323 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 13:16:23,323 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 13:16:23,324 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [413183949] [2022-04-15 13:16:23,324 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [413183949] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:16:23,325 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:16:23,325 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 13:16:23,327 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 13:16:23,328 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [815847130] [2022-04-15 13:16:23,328 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [815847130] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:16:23,328 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:16:23,328 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 13:16:23,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1479809289] [2022-04-15 13:16:23,329 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 13:16:23,333 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-15 13:16:23,334 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 13:16:23,336 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:16:23,352 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:16:23,352 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-15 13:16:23,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 13:16:23,376 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-15 13:16:23,377 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-15 13:16:23,379 INFO L87 Difference]: Start difference. First operand has 20 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 13 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:16:23,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:16:23,637 INFO L93 Difference]: Finished difference Result 41 states and 49 transitions. [2022-04-15 13:16:23,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-15 13:16:23,638 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-15 13:16:23,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 13:16:23,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:16:23,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 49 transitions. [2022-04-15 13:16:23,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:16:23,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 49 transitions. [2022-04-15 13:16:23,657 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 49 transitions. [2022-04-15 13:16:23,696 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:16:23,701 INFO L225 Difference]: With dead ends: 41 [2022-04-15 13:16:23,702 INFO L226 Difference]: Without dead ends: 14 [2022-04-15 13:16:23,704 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-04-15 13:16:23,707 INFO L913 BasicCegarLoop]: 19 mSDtfsCounter, 25 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 13:16:23,708 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [26 Valid, 40 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 13:16:23,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2022-04-15 13:16:23,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2022-04-15 13:16:23,735 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 13:16:23,735 INFO L82 GeneralOperation]: Start isEquivalent. First operand 14 states. Second operand has 14 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:16:23,736 INFO L74 IsIncluded]: Start isIncluded. First operand 14 states. Second operand has 14 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:16:23,736 INFO L87 Difference]: Start difference. First operand 14 states. Second operand has 14 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:16:23,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:16:23,739 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2022-04-15 13:16:23,739 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2022-04-15 13:16:23,739 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:16:23,740 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:16:23,740 INFO L74 IsIncluded]: Start isIncluded. First operand has 14 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 14 states. [2022-04-15 13:16:23,740 INFO L87 Difference]: Start difference. First operand has 14 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 14 states. [2022-04-15 13:16:23,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:16:23,743 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2022-04-15 13:16:23,743 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2022-04-15 13:16:23,743 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:16:23,743 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:16:23,743 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 13:16:23,744 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 13:16:23,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:16:23,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2022-04-15 13:16:23,752 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 12 [2022-04-15 13:16:23,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 13:16:23,752 INFO L478 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2022-04-15 13:16:23,752 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:16:23,753 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 14 transitions. [2022-04-15 13:16:23,766 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:16:23,767 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2022-04-15 13:16:23,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-04-15 13:16:23,770 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 13:16:23,775 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 13:16:23,775 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-15 13:16:23,776 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 13:16:23,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 13:16:23,777 INFO L85 PathProgramCache]: Analyzing trace with hash -828987386, now seen corresponding path program 1 times [2022-04-15 13:16:23,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 13:16:23,777 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1265985263] [2022-04-15 13:16:23,971 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 13:16:23,973 INFO L85 PathProgramCache]: Analyzing trace with hash 28963623, now seen corresponding path program 1 times [2022-04-15 13:16:23,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:16:23,973 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1067314250] [2022-04-15 13:16:23,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:16:23,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:16:23,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 13:16:23,988 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 13:16:23,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 13:16:24,006 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 13:16:24,007 INFO L85 PathProgramCache]: Analyzing trace with hash -828987386, now seen corresponding path program 2 times [2022-04-15 13:16:24,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:16:24,007 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [115229811] [2022-04-15 13:16:24,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:16:24,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:16:24,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:16:24,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 13:16:24,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:16:24,087 INFO L290 TraceCheckUtils]: 0: Hoare triple {189#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(26, 2); {180#true} is VALID [2022-04-15 13:16:24,088 INFO L290 TraceCheckUtils]: 1: Hoare triple {180#true} assume true; {180#true} is VALID [2022-04-15 13:16:24,088 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {180#true} {180#true} #45#return; {180#true} is VALID [2022-04-15 13:16:24,089 INFO L272 TraceCheckUtils]: 0: Hoare triple {180#true} call ULTIMATE.init(); {189#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 13:16:24,089 INFO L290 TraceCheckUtils]: 1: Hoare triple {189#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(26, 2); {180#true} is VALID [2022-04-15 13:16:24,089 INFO L290 TraceCheckUtils]: 2: Hoare triple {180#true} assume true; {180#true} is VALID [2022-04-15 13:16:24,089 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {180#true} {180#true} #45#return; {180#true} is VALID [2022-04-15 13:16:24,090 INFO L272 TraceCheckUtils]: 4: Hoare triple {180#true} call #t~ret5 := main(); {180#true} is VALID [2022-04-15 13:16:24,091 INFO L290 TraceCheckUtils]: 5: Hoare triple {180#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~i~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~n~0 := #t~nondet2;havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~sum~0 := #t~nondet3;havoc #t~nondet3; {180#true} is VALID [2022-04-15 13:16:24,091 INFO L290 TraceCheckUtils]: 6: Hoare triple {180#true} assume !!(((0 == ~i~0 && ~n~0 >= 0) && ~n~0 <= 100) && 0 == ~sum~0); {185#(<= 0 (+ main_~sum~0 main_~i~0))} is VALID [2022-04-15 13:16:24,099 INFO L290 TraceCheckUtils]: 7: Hoare triple {185#(<= 0 (+ main_~sum~0 main_~i~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {186#(<= 0 main_~sum~0)} is VALID [2022-04-15 13:16:24,100 INFO L290 TraceCheckUtils]: 8: Hoare triple {186#(<= 0 main_~sum~0)} assume !(~i~0 < ~n~0); {186#(<= 0 main_~sum~0)} is VALID [2022-04-15 13:16:24,101 INFO L272 TraceCheckUtils]: 9: Hoare triple {186#(<= 0 main_~sum~0)} call __VERIFIER_assert((if ~sum~0 >= 0 then 1 else 0)); {187#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 13:16:24,101 INFO L290 TraceCheckUtils]: 10: Hoare triple {187#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {188#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 13:16:24,102 INFO L290 TraceCheckUtils]: 11: Hoare triple {188#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {181#false} is VALID [2022-04-15 13:16:24,102 INFO L290 TraceCheckUtils]: 12: Hoare triple {181#false} assume !false; {181#false} is VALID [2022-04-15 13:16:24,102 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 13:16:24,102 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 13:16:24,103 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [115229811] [2022-04-15 13:16:24,103 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [115229811] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 13:16:24,103 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2107156324] [2022-04-15 13:16:24,104 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 13:16:24,104 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 13:16:24,104 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 13:16:24,105 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) [2022-04-15 13:16:24,106 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-15 13:16:24,150 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 13:16:24,150 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 13:16:24,151 INFO L263 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 6 conjunts are in the unsatisfiable core [2022-04-15 13:16:24,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:16:24,190 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 13:16:24,372 INFO L272 TraceCheckUtils]: 0: Hoare triple {180#true} call ULTIMATE.init(); {180#true} is VALID [2022-04-15 13:16:24,373 INFO L290 TraceCheckUtils]: 1: Hoare triple {180#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(26, 2); {180#true} is VALID [2022-04-15 13:16:24,373 INFO L290 TraceCheckUtils]: 2: Hoare triple {180#true} assume true; {180#true} is VALID [2022-04-15 13:16:24,373 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {180#true} {180#true} #45#return; {180#true} is VALID [2022-04-15 13:16:24,373 INFO L272 TraceCheckUtils]: 4: Hoare triple {180#true} call #t~ret5 := main(); {180#true} is VALID [2022-04-15 13:16:24,373 INFO L290 TraceCheckUtils]: 5: Hoare triple {180#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~i~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~n~0 := #t~nondet2;havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~sum~0 := #t~nondet3;havoc #t~nondet3; {180#true} is VALID [2022-04-15 13:16:24,374 INFO L290 TraceCheckUtils]: 6: Hoare triple {180#true} assume !!(((0 == ~i~0 && ~n~0 >= 0) && ~n~0 <= 100) && 0 == ~sum~0); {211#(and (<= 0 main_~i~0) (<= 0 main_~sum~0))} is VALID [2022-04-15 13:16:24,374 INFO L290 TraceCheckUtils]: 7: Hoare triple {211#(and (<= 0 main_~i~0) (<= 0 main_~sum~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {186#(<= 0 main_~sum~0)} is VALID [2022-04-15 13:16:24,375 INFO L290 TraceCheckUtils]: 8: Hoare triple {186#(<= 0 main_~sum~0)} assume !(~i~0 < ~n~0); {186#(<= 0 main_~sum~0)} is VALID [2022-04-15 13:16:24,375 INFO L272 TraceCheckUtils]: 9: Hoare triple {186#(<= 0 main_~sum~0)} call __VERIFIER_assert((if ~sum~0 >= 0 then 1 else 0)); {221#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 13:16:24,376 INFO L290 TraceCheckUtils]: 10: Hoare triple {221#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {225#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 13:16:24,376 INFO L290 TraceCheckUtils]: 11: Hoare triple {225#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {181#false} is VALID [2022-04-15 13:16:24,376 INFO L290 TraceCheckUtils]: 12: Hoare triple {181#false} assume !false; {181#false} is VALID [2022-04-15 13:16:24,377 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 13:16:24,377 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 13:16:24,517 INFO L290 TraceCheckUtils]: 12: Hoare triple {181#false} assume !false; {181#false} is VALID [2022-04-15 13:16:24,517 INFO L290 TraceCheckUtils]: 11: Hoare triple {225#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {181#false} is VALID [2022-04-15 13:16:24,518 INFO L290 TraceCheckUtils]: 10: Hoare triple {221#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {225#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 13:16:24,518 INFO L272 TraceCheckUtils]: 9: Hoare triple {186#(<= 0 main_~sum~0)} call __VERIFIER_assert((if ~sum~0 >= 0 then 1 else 0)); {221#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 13:16:24,519 INFO L290 TraceCheckUtils]: 8: Hoare triple {186#(<= 0 main_~sum~0)} assume !(~i~0 < ~n~0); {186#(<= 0 main_~sum~0)} is VALID [2022-04-15 13:16:24,520 INFO L290 TraceCheckUtils]: 7: Hoare triple {185#(<= 0 (+ main_~sum~0 main_~i~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {186#(<= 0 main_~sum~0)} is VALID [2022-04-15 13:16:24,523 INFO L290 TraceCheckUtils]: 6: Hoare triple {180#true} assume !!(((0 == ~i~0 && ~n~0 >= 0) && ~n~0 <= 100) && 0 == ~sum~0); {185#(<= 0 (+ main_~sum~0 main_~i~0))} is VALID [2022-04-15 13:16:24,523 INFO L290 TraceCheckUtils]: 5: Hoare triple {180#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~i~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~n~0 := #t~nondet2;havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~sum~0 := #t~nondet3;havoc #t~nondet3; {180#true} is VALID [2022-04-15 13:16:24,523 INFO L272 TraceCheckUtils]: 4: Hoare triple {180#true} call #t~ret5 := main(); {180#true} is VALID [2022-04-15 13:16:24,524 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {180#true} {180#true} #45#return; {180#true} is VALID [2022-04-15 13:16:24,524 INFO L290 TraceCheckUtils]: 2: Hoare triple {180#true} assume true; {180#true} is VALID [2022-04-15 13:16:24,524 INFO L290 TraceCheckUtils]: 1: Hoare triple {180#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(26, 2); {180#true} is VALID [2022-04-15 13:16:24,524 INFO L272 TraceCheckUtils]: 0: Hoare triple {180#true} call ULTIMATE.init(); {180#true} is VALID [2022-04-15 13:16:24,524 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 13:16:24,524 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2107156324] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 13:16:24,525 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 13:16:24,525 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 10 [2022-04-15 13:16:24,525 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 13:16:24,525 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1265985263] [2022-04-15 13:16:24,526 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1265985263] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:16:24,526 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:16:24,526 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-15 13:16:24,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [560209103] [2022-04-15 13:16:24,526 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 13:16:24,526 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 5 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2022-04-15 13:16:24,527 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 13:16:24,527 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 5 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:16:24,536 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:16:24,536 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-15 13:16:24,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 13:16:24,536 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-15 13:16:24,537 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-04-15 13:16:24,537 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand has 7 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 5 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:16:24,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:16:24,638 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2022-04-15 13:16:24,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-15 13:16:24,639 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 5 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2022-04-15 13:16:24,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 13:16:24,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 5 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:16:24,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 20 transitions. [2022-04-15 13:16:24,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 5 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:16:24,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 20 transitions. [2022-04-15 13:16:24,642 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 20 transitions. [2022-04-15 13:16:24,656 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:16:24,658 INFO L225 Difference]: With dead ends: 20 [2022-04-15 13:16:24,658 INFO L226 Difference]: Without dead ends: 15 [2022-04-15 13:16:24,659 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 24 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2022-04-15 13:16:24,661 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 10 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 13:16:24,663 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 33 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 13:16:24,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2022-04-15 13:16:24,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2022-04-15 13:16:24,670 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 13:16:24,671 INFO L82 GeneralOperation]: Start isEquivalent. First operand 15 states. Second operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:16:24,672 INFO L74 IsIncluded]: Start isIncluded. First operand 15 states. Second operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:16:24,674 INFO L87 Difference]: Start difference. First operand 15 states. Second operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:16:24,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:16:24,676 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2022-04-15 13:16:24,676 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2022-04-15 13:16:24,676 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:16:24,676 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:16:24,677 INFO L74 IsIncluded]: Start isIncluded. First operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 15 states. [2022-04-15 13:16:24,677 INFO L87 Difference]: Start difference. First operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 15 states. [2022-04-15 13:16:24,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:16:24,678 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2022-04-15 13:16:24,678 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2022-04-15 13:16:24,678 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:16:24,678 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:16:24,678 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 13:16:24,679 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 13:16:24,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:16:24,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2022-04-15 13:16:24,680 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 13 [2022-04-15 13:16:24,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 13:16:24,681 INFO L478 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2022-04-15 13:16:24,681 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 5 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:16:24,681 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 15 transitions. [2022-04-15 13:16:24,695 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:16:24,696 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2022-04-15 13:16:24,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-04-15 13:16:24,696 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 13:16:24,696 INFO L499 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 13:16:24,713 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-04-15 13:16:24,911 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 13:16:24,912 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 13:16:24,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 13:16:24,912 INFO L85 PathProgramCache]: Analyzing trace with hash 106583640, now seen corresponding path program 3 times [2022-04-15 13:16:24,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 13:16:24,912 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [597577041] [2022-04-15 13:16:25,184 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 13:16:25,186 INFO L85 PathProgramCache]: Analyzing trace with hash 88068967, now seen corresponding path program 1 times [2022-04-15 13:16:25,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:16:25,186 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1513795675] [2022-04-15 13:16:25,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:16:25,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:16:25,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 13:16:25,197 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 13:16:25,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 13:16:25,205 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 13:16:25,205 INFO L85 PathProgramCache]: Analyzing trace with hash 106583640, now seen corresponding path program 4 times [2022-04-15 13:16:25,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:16:25,205 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1457783115] [2022-04-15 13:16:25,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:16:25,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:16:25,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:16:25,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 13:16:25,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:16:25,277 INFO L290 TraceCheckUtils]: 0: Hoare triple {388#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(26, 2); {378#true} is VALID [2022-04-15 13:16:25,278 INFO L290 TraceCheckUtils]: 1: Hoare triple {378#true} assume true; {378#true} is VALID [2022-04-15 13:16:25,278 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {378#true} {378#true} #45#return; {378#true} is VALID [2022-04-15 13:16:25,280 INFO L272 TraceCheckUtils]: 0: Hoare triple {378#true} call ULTIMATE.init(); {388#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 13:16:25,280 INFO L290 TraceCheckUtils]: 1: Hoare triple {388#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(26, 2); {378#true} is VALID [2022-04-15 13:16:25,280 INFO L290 TraceCheckUtils]: 2: Hoare triple {378#true} assume true; {378#true} is VALID [2022-04-15 13:16:25,280 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {378#true} {378#true} #45#return; {378#true} is VALID [2022-04-15 13:16:25,280 INFO L272 TraceCheckUtils]: 4: Hoare triple {378#true} call #t~ret5 := main(); {378#true} is VALID [2022-04-15 13:16:25,280 INFO L290 TraceCheckUtils]: 5: Hoare triple {378#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~i~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~n~0 := #t~nondet2;havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~sum~0 := #t~nondet3;havoc #t~nondet3; {378#true} is VALID [2022-04-15 13:16:25,281 INFO L290 TraceCheckUtils]: 6: Hoare triple {378#true} assume !!(((0 == ~i~0 && ~n~0 >= 0) && ~n~0 <= 100) && 0 == ~sum~0); {383#(<= 0 (+ main_~sum~0 (* main_~i~0 2)))} is VALID [2022-04-15 13:16:25,281 INFO L290 TraceCheckUtils]: 7: Hoare triple {383#(<= 0 (+ main_~sum~0 (* main_~i~0 2)))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {384#(<= 1 (+ main_~sum~0 main_~i~0))} is VALID [2022-04-15 13:16:25,282 INFO L290 TraceCheckUtils]: 8: Hoare triple {384#(<= 1 (+ main_~sum~0 main_~i~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {385#(<= 1 main_~sum~0)} is VALID [2022-04-15 13:16:25,283 INFO L290 TraceCheckUtils]: 9: Hoare triple {385#(<= 1 main_~sum~0)} assume !(~i~0 < ~n~0); {385#(<= 1 main_~sum~0)} is VALID [2022-04-15 13:16:25,283 INFO L272 TraceCheckUtils]: 10: Hoare triple {385#(<= 1 main_~sum~0)} call __VERIFIER_assert((if ~sum~0 >= 0 then 1 else 0)); {386#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 13:16:25,284 INFO L290 TraceCheckUtils]: 11: Hoare triple {386#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {387#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 13:16:25,284 INFO L290 TraceCheckUtils]: 12: Hoare triple {387#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {379#false} is VALID [2022-04-15 13:16:25,284 INFO L290 TraceCheckUtils]: 13: Hoare triple {379#false} assume !false; {379#false} is VALID [2022-04-15 13:16:25,285 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 13:16:25,285 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 13:16:25,285 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1457783115] [2022-04-15 13:16:25,285 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1457783115] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 13:16:25,285 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1142604402] [2022-04-15 13:16:25,285 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 13:16:25,285 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 13:16:25,285 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 13:16:25,286 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) [2022-04-15 13:16:25,287 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-04-15 13:16:25,315 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 13:16:25,316 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 13:16:25,316 INFO L263 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 8 conjunts are in the unsatisfiable core [2022-04-15 13:16:25,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:16:25,326 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 13:16:25,444 INFO L272 TraceCheckUtils]: 0: Hoare triple {378#true} call ULTIMATE.init(); {378#true} is VALID [2022-04-15 13:16:25,445 INFO L290 TraceCheckUtils]: 1: Hoare triple {378#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(26, 2); {378#true} is VALID [2022-04-15 13:16:25,445 INFO L290 TraceCheckUtils]: 2: Hoare triple {378#true} assume true; {378#true} is VALID [2022-04-15 13:16:25,445 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {378#true} {378#true} #45#return; {378#true} is VALID [2022-04-15 13:16:25,445 INFO L272 TraceCheckUtils]: 4: Hoare triple {378#true} call #t~ret5 := main(); {378#true} is VALID [2022-04-15 13:16:25,445 INFO L290 TraceCheckUtils]: 5: Hoare triple {378#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~i~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~n~0 := #t~nondet2;havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~sum~0 := #t~nondet3;havoc #t~nondet3; {378#true} is VALID [2022-04-15 13:16:25,446 INFO L290 TraceCheckUtils]: 6: Hoare triple {378#true} assume !!(((0 == ~i~0 && ~n~0 >= 0) && ~n~0 <= 100) && 0 == ~sum~0); {410#(and (<= 0 main_~i~0) (<= 0 main_~sum~0))} is VALID [2022-04-15 13:16:25,447 INFO L290 TraceCheckUtils]: 7: Hoare triple {410#(and (<= 0 main_~i~0) (<= 0 main_~sum~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {414#(and (<= 0 main_~sum~0) (<= 1 main_~i~0))} is VALID [2022-04-15 13:16:25,447 INFO L290 TraceCheckUtils]: 8: Hoare triple {414#(and (<= 0 main_~sum~0) (<= 1 main_~i~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {385#(<= 1 main_~sum~0)} is VALID [2022-04-15 13:16:25,448 INFO L290 TraceCheckUtils]: 9: Hoare triple {385#(<= 1 main_~sum~0)} assume !(~i~0 < ~n~0); {385#(<= 1 main_~sum~0)} is VALID [2022-04-15 13:16:25,448 INFO L272 TraceCheckUtils]: 10: Hoare triple {385#(<= 1 main_~sum~0)} call __VERIFIER_assert((if ~sum~0 >= 0 then 1 else 0)); {424#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 13:16:25,448 INFO L290 TraceCheckUtils]: 11: Hoare triple {424#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {428#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 13:16:25,449 INFO L290 TraceCheckUtils]: 12: Hoare triple {428#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {379#false} is VALID [2022-04-15 13:16:25,449 INFO L290 TraceCheckUtils]: 13: Hoare triple {379#false} assume !false; {379#false} is VALID [2022-04-15 13:16:25,449 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 13:16:25,449 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 13:16:25,569 INFO L290 TraceCheckUtils]: 13: Hoare triple {379#false} assume !false; {379#false} is VALID [2022-04-15 13:16:25,569 INFO L290 TraceCheckUtils]: 12: Hoare triple {428#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {379#false} is VALID [2022-04-15 13:16:25,570 INFO L290 TraceCheckUtils]: 11: Hoare triple {424#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {428#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 13:16:25,570 INFO L272 TraceCheckUtils]: 10: Hoare triple {444#(<= 0 main_~sum~0)} call __VERIFIER_assert((if ~sum~0 >= 0 then 1 else 0)); {424#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 13:16:25,571 INFO L290 TraceCheckUtils]: 9: Hoare triple {444#(<= 0 main_~sum~0)} assume !(~i~0 < ~n~0); {444#(<= 0 main_~sum~0)} is VALID [2022-04-15 13:16:25,571 INFO L290 TraceCheckUtils]: 8: Hoare triple {451#(<= 0 (+ main_~sum~0 main_~i~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {444#(<= 0 main_~sum~0)} is VALID [2022-04-15 13:16:25,572 INFO L290 TraceCheckUtils]: 7: Hoare triple {455#(<= 0 (+ main_~sum~0 (* main_~i~0 2) 1))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {451#(<= 0 (+ main_~sum~0 main_~i~0))} is VALID [2022-04-15 13:16:25,572 INFO L290 TraceCheckUtils]: 6: Hoare triple {378#true} assume !!(((0 == ~i~0 && ~n~0 >= 0) && ~n~0 <= 100) && 0 == ~sum~0); {455#(<= 0 (+ main_~sum~0 (* main_~i~0 2) 1))} is VALID [2022-04-15 13:16:25,572 INFO L290 TraceCheckUtils]: 5: Hoare triple {378#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~i~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~n~0 := #t~nondet2;havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~sum~0 := #t~nondet3;havoc #t~nondet3; {378#true} is VALID [2022-04-15 13:16:25,572 INFO L272 TraceCheckUtils]: 4: Hoare triple {378#true} call #t~ret5 := main(); {378#true} is VALID [2022-04-15 13:16:25,573 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {378#true} {378#true} #45#return; {378#true} is VALID [2022-04-15 13:16:25,573 INFO L290 TraceCheckUtils]: 2: Hoare triple {378#true} assume true; {378#true} is VALID [2022-04-15 13:16:25,573 INFO L290 TraceCheckUtils]: 1: Hoare triple {378#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(26, 2); {378#true} is VALID [2022-04-15 13:16:25,573 INFO L272 TraceCheckUtils]: 0: Hoare triple {378#true} call ULTIMATE.init(); {378#true} is VALID [2022-04-15 13:16:25,573 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 13:16:25,573 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1142604402] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 13:16:25,573 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 13:16:25,573 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 15 [2022-04-15 13:16:25,574 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 13:16:25,574 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [597577041] [2022-04-15 13:16:25,574 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [597577041] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:16:25,574 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:16:25,574 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-15 13:16:25,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2072537755] [2022-04-15 13:16:25,574 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 13:16:25,574 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.25) internal successors, (10), 6 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2022-04-15 13:16:25,574 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 13:16:25,575 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 1.25) internal successors, (10), 6 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:16:25,583 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:16:25,583 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-15 13:16:25,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 13:16:25,583 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-15 13:16:25,583 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=168, Unknown=0, NotChecked=0, Total=210 [2022-04-15 13:16:25,584 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand has 8 states, 8 states have (on average 1.25) internal successors, (10), 6 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:16:25,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:16:25,728 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2022-04-15 13:16:25,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-15 13:16:25,728 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.25) internal successors, (10), 6 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2022-04-15 13:16:25,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 13:16:25,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 1.25) internal successors, (10), 6 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:16:25,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 21 transitions. [2022-04-15 13:16:25,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 1.25) internal successors, (10), 6 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:16:25,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 21 transitions. [2022-04-15 13:16:25,730 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 21 transitions. [2022-04-15 13:16:25,743 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:16:25,743 INFO L225 Difference]: With dead ends: 21 [2022-04-15 13:16:25,743 INFO L226 Difference]: Without dead ends: 16 [2022-04-15 13:16:25,744 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 22 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=67, Invalid=313, Unknown=0, NotChecked=0, Total=380 [2022-04-15 13:16:25,744 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 10 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 13:16:25,745 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 38 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 13:16:25,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2022-04-15 13:16:25,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2022-04-15 13:16:25,750 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 13:16:25,750 INFO L82 GeneralOperation]: Start isEquivalent. First operand 16 states. Second operand has 16 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 11 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:16:25,750 INFO L74 IsIncluded]: Start isIncluded. First operand 16 states. Second operand has 16 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 11 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:16:25,750 INFO L87 Difference]: Start difference. First operand 16 states. Second operand has 16 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 11 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:16:25,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:16:25,751 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2022-04-15 13:16:25,751 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2022-04-15 13:16:25,751 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:16:25,751 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:16:25,751 INFO L74 IsIncluded]: Start isIncluded. First operand has 16 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 11 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 16 states. [2022-04-15 13:16:25,752 INFO L87 Difference]: Start difference. First operand has 16 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 11 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 16 states. [2022-04-15 13:16:25,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:16:25,752 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2022-04-15 13:16:25,752 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2022-04-15 13:16:25,752 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:16:25,752 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:16:25,753 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 13:16:25,753 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 13:16:25,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 11 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:16:25,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2022-04-15 13:16:25,753 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 14 [2022-04-15 13:16:25,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 13:16:25,753 INFO L478 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2022-04-15 13:16:25,754 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.25) internal successors, (10), 6 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:16:25,754 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 16 states and 16 transitions. [2022-04-15 13:16:25,767 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:16:25,767 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2022-04-15 13:16:25,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-04-15 13:16:25,767 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 13:16:25,767 INFO L499 BasicCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 13:16:25,784 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-04-15 13:16:25,979 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2022-04-15 13:16:25,980 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 13:16:25,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 13:16:25,980 INFO L85 PathProgramCache]: Analyzing trace with hash -955485626, now seen corresponding path program 5 times [2022-04-15 13:16:25,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 13:16:25,980 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [13643049] [2022-04-15 13:16:26,132 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 13:16:26,134 INFO L85 PathProgramCache]: Analyzing trace with hash 147174311, now seen corresponding path program 1 times [2022-04-15 13:16:26,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:16:26,134 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [988545430] [2022-04-15 13:16:26,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:16:26,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:16:26,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 13:16:26,152 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 13:16:26,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 13:16:26,159 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 13:16:26,159 INFO L85 PathProgramCache]: Analyzing trace with hash -955485626, now seen corresponding path program 6 times [2022-04-15 13:16:26,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:16:26,159 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [868262862] [2022-04-15 13:16:26,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:16:26,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:16:26,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:16:26,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 13:16:26,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:16:26,268 INFO L290 TraceCheckUtils]: 0: Hoare triple {607#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(26, 2); {595#true} is VALID [2022-04-15 13:16:26,271 INFO L290 TraceCheckUtils]: 1: Hoare triple {595#true} assume true; {595#true} is VALID [2022-04-15 13:16:26,271 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {595#true} {595#true} #45#return; {595#true} is VALID [2022-04-15 13:16:26,272 INFO L272 TraceCheckUtils]: 0: Hoare triple {595#true} call ULTIMATE.init(); {607#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 13:16:26,272 INFO L290 TraceCheckUtils]: 1: Hoare triple {607#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(26, 2); {595#true} is VALID [2022-04-15 13:16:26,272 INFO L290 TraceCheckUtils]: 2: Hoare triple {595#true} assume true; {595#true} is VALID [2022-04-15 13:16:26,272 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {595#true} {595#true} #45#return; {595#true} is VALID [2022-04-15 13:16:26,272 INFO L272 TraceCheckUtils]: 4: Hoare triple {595#true} call #t~ret5 := main(); {595#true} is VALID [2022-04-15 13:16:26,272 INFO L290 TraceCheckUtils]: 5: Hoare triple {595#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~i~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~n~0 := #t~nondet2;havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~sum~0 := #t~nondet3;havoc #t~nondet3; {595#true} is VALID [2022-04-15 13:16:26,273 INFO L290 TraceCheckUtils]: 6: Hoare triple {595#true} assume !!(((0 == ~i~0 && ~n~0 >= 0) && ~n~0 <= 100) && 0 == ~sum~0); {600#(<= 0 (+ main_~sum~0 (* main_~i~0 3)))} is VALID [2022-04-15 13:16:26,273 INFO L290 TraceCheckUtils]: 7: Hoare triple {600#(<= 0 (+ main_~sum~0 (* main_~i~0 3)))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {601#(<= 2 (+ main_~sum~0 main_~i~0 main_~n~0))} is VALID [2022-04-15 13:16:26,274 INFO L290 TraceCheckUtils]: 8: Hoare triple {601#(<= 2 (+ main_~sum~0 main_~i~0 main_~n~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {602#(<= 2 (+ main_~sum~0 main_~n~0))} is VALID [2022-04-15 13:16:26,275 INFO L290 TraceCheckUtils]: 9: Hoare triple {602#(<= 2 (+ main_~sum~0 main_~n~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {603#(<= (+ main_~i~0 1) (+ main_~sum~0 main_~n~0))} is VALID [2022-04-15 13:16:26,275 INFO L290 TraceCheckUtils]: 10: Hoare triple {603#(<= (+ main_~i~0 1) (+ main_~sum~0 main_~n~0))} assume !(~i~0 < ~n~0); {604#(<= 1 main_~sum~0)} is VALID [2022-04-15 13:16:26,276 INFO L272 TraceCheckUtils]: 11: Hoare triple {604#(<= 1 main_~sum~0)} call __VERIFIER_assert((if ~sum~0 >= 0 then 1 else 0)); {605#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 13:16:26,276 INFO L290 TraceCheckUtils]: 12: Hoare triple {605#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {606#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 13:16:26,276 INFO L290 TraceCheckUtils]: 13: Hoare triple {606#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {596#false} is VALID [2022-04-15 13:16:26,277 INFO L290 TraceCheckUtils]: 14: Hoare triple {596#false} assume !false; {596#false} is VALID [2022-04-15 13:16:26,277 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 13:16:26,277 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 13:16:26,277 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [868262862] [2022-04-15 13:16:26,277 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [868262862] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 13:16:26,277 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [154217985] [2022-04-15 13:16:26,277 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 13:16:26,277 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 13:16:26,278 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 13:16:26,278 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) [2022-04-15 13:16:26,294 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-04-15 13:16:26,320 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-04-15 13:16:26,320 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 13:16:26,321 INFO L263 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 10 conjunts are in the unsatisfiable core [2022-04-15 13:16:26,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:16:26,330 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 13:16:26,515 INFO L272 TraceCheckUtils]: 0: Hoare triple {595#true} call ULTIMATE.init(); {595#true} is VALID [2022-04-15 13:16:26,516 INFO L290 TraceCheckUtils]: 1: Hoare triple {595#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(26, 2); {595#true} is VALID [2022-04-15 13:16:26,516 INFO L290 TraceCheckUtils]: 2: Hoare triple {595#true} assume true; {595#true} is VALID [2022-04-15 13:16:26,516 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {595#true} {595#true} #45#return; {595#true} is VALID [2022-04-15 13:16:26,516 INFO L272 TraceCheckUtils]: 4: Hoare triple {595#true} call #t~ret5 := main(); {595#true} is VALID [2022-04-15 13:16:26,516 INFO L290 TraceCheckUtils]: 5: Hoare triple {595#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~i~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~n~0 := #t~nondet2;havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~sum~0 := #t~nondet3;havoc #t~nondet3; {595#true} is VALID [2022-04-15 13:16:26,517 INFO L290 TraceCheckUtils]: 6: Hoare triple {595#true} assume !!(((0 == ~i~0 && ~n~0 >= 0) && ~n~0 <= 100) && 0 == ~sum~0); {629#(and (<= 0 main_~i~0) (<= 0 main_~sum~0))} is VALID [2022-04-15 13:16:26,518 INFO L290 TraceCheckUtils]: 7: Hoare triple {629#(and (<= 0 main_~i~0) (<= 0 main_~sum~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {633#(and (<= 0 main_~sum~0) (<= 1 main_~i~0))} is VALID [2022-04-15 13:16:26,519 INFO L290 TraceCheckUtils]: 8: Hoare triple {633#(and (<= 0 main_~sum~0) (<= 1 main_~i~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {637#(and (<= 2 main_~i~0) (<= 1 main_~sum~0))} is VALID [2022-04-15 13:16:26,528 INFO L290 TraceCheckUtils]: 9: Hoare triple {637#(and (<= 2 main_~i~0) (<= 1 main_~sum~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {641#(<= 3 main_~sum~0)} is VALID [2022-04-15 13:16:26,528 INFO L290 TraceCheckUtils]: 10: Hoare triple {641#(<= 3 main_~sum~0)} assume !(~i~0 < ~n~0); {641#(<= 3 main_~sum~0)} is VALID [2022-04-15 13:16:26,529 INFO L272 TraceCheckUtils]: 11: Hoare triple {641#(<= 3 main_~sum~0)} call __VERIFIER_assert((if ~sum~0 >= 0 then 1 else 0)); {648#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 13:16:26,529 INFO L290 TraceCheckUtils]: 12: Hoare triple {648#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {652#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 13:16:26,529 INFO L290 TraceCheckUtils]: 13: Hoare triple {652#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {596#false} is VALID [2022-04-15 13:16:26,530 INFO L290 TraceCheckUtils]: 14: Hoare triple {596#false} assume !false; {596#false} is VALID [2022-04-15 13:16:26,530 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 13:16:26,530 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 13:16:26,938 INFO L290 TraceCheckUtils]: 14: Hoare triple {596#false} assume !false; {596#false} is VALID [2022-04-15 13:16:26,939 INFO L290 TraceCheckUtils]: 13: Hoare triple {652#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {596#false} is VALID [2022-04-15 13:16:26,939 INFO L290 TraceCheckUtils]: 12: Hoare triple {648#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {652#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 13:16:26,940 INFO L272 TraceCheckUtils]: 11: Hoare triple {668#(<= 0 main_~sum~0)} call __VERIFIER_assert((if ~sum~0 >= 0 then 1 else 0)); {648#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 13:16:26,940 INFO L290 TraceCheckUtils]: 10: Hoare triple {668#(<= 0 main_~sum~0)} assume !(~i~0 < ~n~0); {668#(<= 0 main_~sum~0)} is VALID [2022-04-15 13:16:26,941 INFO L290 TraceCheckUtils]: 9: Hoare triple {675#(<= 0 (+ main_~sum~0 main_~i~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {668#(<= 0 main_~sum~0)} is VALID [2022-04-15 13:16:26,941 INFO L290 TraceCheckUtils]: 8: Hoare triple {679#(<= 0 (+ main_~sum~0 (* main_~i~0 2) 1))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {675#(<= 0 (+ main_~sum~0 main_~i~0))} is VALID [2022-04-15 13:16:26,942 INFO L290 TraceCheckUtils]: 7: Hoare triple {683#(<= (div (+ main_~sum~0 main_~i~0 1) (- 2)) (+ main_~i~0 1))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {679#(<= 0 (+ main_~sum~0 (* main_~i~0 2) 1))} is VALID [2022-04-15 13:16:26,942 INFO L290 TraceCheckUtils]: 6: Hoare triple {595#true} assume !!(((0 == ~i~0 && ~n~0 >= 0) && ~n~0 <= 100) && 0 == ~sum~0); {683#(<= (div (+ main_~sum~0 main_~i~0 1) (- 2)) (+ main_~i~0 1))} is VALID [2022-04-15 13:16:26,943 INFO L290 TraceCheckUtils]: 5: Hoare triple {595#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~i~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~n~0 := #t~nondet2;havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~sum~0 := #t~nondet3;havoc #t~nondet3; {595#true} is VALID [2022-04-15 13:16:26,943 INFO L272 TraceCheckUtils]: 4: Hoare triple {595#true} call #t~ret5 := main(); {595#true} is VALID [2022-04-15 13:16:26,943 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {595#true} {595#true} #45#return; {595#true} is VALID [2022-04-15 13:16:26,943 INFO L290 TraceCheckUtils]: 2: Hoare triple {595#true} assume true; {595#true} is VALID [2022-04-15 13:16:26,943 INFO L290 TraceCheckUtils]: 1: Hoare triple {595#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(26, 2); {595#true} is VALID [2022-04-15 13:16:26,943 INFO L272 TraceCheckUtils]: 0: Hoare triple {595#true} call ULTIMATE.init(); {595#true} is VALID [2022-04-15 13:16:26,943 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 13:16:26,943 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [154217985] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 13:16:26,944 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 13:16:26,944 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 8] total 20 [2022-04-15 13:16:26,944 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 13:16:26,944 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [13643049] [2022-04-15 13:16:26,944 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [13643049] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:16:26,944 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:16:26,944 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-15 13:16:26,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [662528551] [2022-04-15 13:16:26,944 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 13:16:26,945 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 8 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-04-15 13:16:26,945 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 13:16:26,945 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 8 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:16:26,956 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:16:26,957 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-15 13:16:26,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 13:16:26,957 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-15 13:16:26,957 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=318, Unknown=0, NotChecked=0, Total=380 [2022-04-15 13:16:26,957 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand has 10 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 8 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:16:27,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:16:27,181 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2022-04-15 13:16:27,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-15 13:16:27,182 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 8 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-04-15 13:16:27,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 13:16:27,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 8 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:16:27,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 22 transitions. [2022-04-15 13:16:27,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 8 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:16:27,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 22 transitions. [2022-04-15 13:16:27,184 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 22 transitions. [2022-04-15 13:16:27,212 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:16:27,212 INFO L225 Difference]: With dead ends: 22 [2022-04-15 13:16:27,213 INFO L226 Difference]: Without dead ends: 17 [2022-04-15 13:16:27,213 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 21 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=96, Invalid=606, Unknown=0, NotChecked=0, Total=702 [2022-04-15 13:16:27,214 INFO L913 BasicCegarLoop]: 10 mSDtfsCounter, 11 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 13:16:27,214 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [11 Valid, 47 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 13:16:27,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2022-04-15 13:16:27,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2022-04-15 13:16:27,232 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 13:16:27,233 INFO L82 GeneralOperation]: Start isEquivalent. First operand 17 states. Second operand has 17 states, 12 states have (on average 1.0833333333333333) internal successors, (13), 12 states have internal predecessors, (13), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:16:27,233 INFO L74 IsIncluded]: Start isIncluded. First operand 17 states. Second operand has 17 states, 12 states have (on average 1.0833333333333333) internal successors, (13), 12 states have internal predecessors, (13), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:16:27,233 INFO L87 Difference]: Start difference. First operand 17 states. Second operand has 17 states, 12 states have (on average 1.0833333333333333) internal successors, (13), 12 states have internal predecessors, (13), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:16:27,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:16:27,234 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2022-04-15 13:16:27,234 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2022-04-15 13:16:27,234 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:16:27,234 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:16:27,234 INFO L74 IsIncluded]: Start isIncluded. First operand has 17 states, 12 states have (on average 1.0833333333333333) internal successors, (13), 12 states have internal predecessors, (13), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 17 states. [2022-04-15 13:16:27,234 INFO L87 Difference]: Start difference. First operand has 17 states, 12 states have (on average 1.0833333333333333) internal successors, (13), 12 states have internal predecessors, (13), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 17 states. [2022-04-15 13:16:27,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:16:27,235 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2022-04-15 13:16:27,235 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2022-04-15 13:16:27,235 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:16:27,235 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:16:27,235 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 13:16:27,235 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 13:16:27,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 12 states have (on average 1.0833333333333333) internal successors, (13), 12 states have internal predecessors, (13), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:16:27,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2022-04-15 13:16:27,236 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 15 [2022-04-15 13:16:27,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 13:16:27,236 INFO L478 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2022-04-15 13:16:27,236 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 8 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:16:27,237 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 17 states and 17 transitions. [2022-04-15 13:16:27,249 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:16:27,249 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2022-04-15 13:16:27,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-04-15 13:16:27,249 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 13:16:27,249 INFO L499 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 13:16:27,265 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-04-15 13:16:27,451 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 13:16:27,451 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 13:16:27,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 13:16:27,452 INFO L85 PathProgramCache]: Analyzing trace with hash 480105496, now seen corresponding path program 7 times [2022-04-15 13:16:27,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 13:16:27,455 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1249632433] [2022-04-15 13:16:27,578 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 13:16:27,580 INFO L85 PathProgramCache]: Analyzing trace with hash 206279655, now seen corresponding path program 1 times [2022-04-15 13:16:27,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:16:27,580 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [985754327] [2022-04-15 13:16:27,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:16:27,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:16:27,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 13:16:27,588 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 13:16:27,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 13:16:27,594 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 13:16:27,594 INFO L85 PathProgramCache]: Analyzing trace with hash 480105496, now seen corresponding path program 8 times [2022-04-15 13:16:27,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:16:27,594 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [550831750] [2022-04-15 13:16:27,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:16:27,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:16:27,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:16:27,678 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 13:16:27,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:16:27,684 INFO L290 TraceCheckUtils]: 0: Hoare triple {845#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(26, 2); {833#true} is VALID [2022-04-15 13:16:27,684 INFO L290 TraceCheckUtils]: 1: Hoare triple {833#true} assume true; {833#true} is VALID [2022-04-15 13:16:27,684 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {833#true} {833#true} #45#return; {833#true} is VALID [2022-04-15 13:16:27,685 INFO L272 TraceCheckUtils]: 0: Hoare triple {833#true} call ULTIMATE.init(); {845#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 13:16:27,685 INFO L290 TraceCheckUtils]: 1: Hoare triple {845#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(26, 2); {833#true} is VALID [2022-04-15 13:16:27,685 INFO L290 TraceCheckUtils]: 2: Hoare triple {833#true} assume true; {833#true} is VALID [2022-04-15 13:16:27,685 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {833#true} {833#true} #45#return; {833#true} is VALID [2022-04-15 13:16:27,685 INFO L272 TraceCheckUtils]: 4: Hoare triple {833#true} call #t~ret5 := main(); {833#true} is VALID [2022-04-15 13:16:27,686 INFO L290 TraceCheckUtils]: 5: Hoare triple {833#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~i~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~n~0 := #t~nondet2;havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~sum~0 := #t~nondet3;havoc #t~nondet3; {833#true} is VALID [2022-04-15 13:16:27,686 INFO L290 TraceCheckUtils]: 6: Hoare triple {833#true} assume !!(((0 == ~i~0 && ~n~0 >= 0) && ~n~0 <= 100) && 0 == ~sum~0); {838#(<= 0 (+ main_~sum~0 (* main_~i~0 4)))} is VALID [2022-04-15 13:16:27,686 INFO L290 TraceCheckUtils]: 7: Hoare triple {838#(<= 0 (+ main_~sum~0 (* main_~i~0 4)))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {839#(<= 3 (+ main_~sum~0 (* main_~i~0 3)))} is VALID [2022-04-15 13:16:27,687 INFO L290 TraceCheckUtils]: 8: Hoare triple {839#(<= 3 (+ main_~sum~0 (* main_~i~0 3)))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {840#(<= 5 (+ main_~sum~0 (* main_~i~0 2)))} is VALID [2022-04-15 13:16:27,688 INFO L290 TraceCheckUtils]: 9: Hoare triple {840#(<= 5 (+ main_~sum~0 (* main_~i~0 2)))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {841#(<= 6 (+ main_~sum~0 main_~i~0))} is VALID [2022-04-15 13:16:27,688 INFO L290 TraceCheckUtils]: 10: Hoare triple {841#(<= 6 (+ main_~sum~0 main_~i~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {842#(<= 6 main_~sum~0)} is VALID [2022-04-15 13:16:27,688 INFO L290 TraceCheckUtils]: 11: Hoare triple {842#(<= 6 main_~sum~0)} assume !(~i~0 < ~n~0); {842#(<= 6 main_~sum~0)} is VALID [2022-04-15 13:16:27,689 INFO L272 TraceCheckUtils]: 12: Hoare triple {842#(<= 6 main_~sum~0)} call __VERIFIER_assert((if ~sum~0 >= 0 then 1 else 0)); {843#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 13:16:27,689 INFO L290 TraceCheckUtils]: 13: Hoare triple {843#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {844#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 13:16:27,689 INFO L290 TraceCheckUtils]: 14: Hoare triple {844#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {834#false} is VALID [2022-04-15 13:16:27,690 INFO L290 TraceCheckUtils]: 15: Hoare triple {834#false} assume !false; {834#false} is VALID [2022-04-15 13:16:27,690 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 13:16:27,690 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 13:16:27,690 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [550831750] [2022-04-15 13:16:27,690 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [550831750] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 13:16:27,690 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2108087571] [2022-04-15 13:16:27,690 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 13:16:27,690 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 13:16:27,690 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 13:16:27,691 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) [2022-04-15 13:16:27,692 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-04-15 13:16:27,721 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 13:16:27,721 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 13:16:27,722 INFO L263 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 12 conjunts are in the unsatisfiable core [2022-04-15 13:16:27,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:16:27,729 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 13:16:27,917 INFO L272 TraceCheckUtils]: 0: Hoare triple {833#true} call ULTIMATE.init(); {833#true} is VALID [2022-04-15 13:16:27,917 INFO L290 TraceCheckUtils]: 1: Hoare triple {833#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(26, 2); {833#true} is VALID [2022-04-15 13:16:27,917 INFO L290 TraceCheckUtils]: 2: Hoare triple {833#true} assume true; {833#true} is VALID [2022-04-15 13:16:27,917 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {833#true} {833#true} #45#return; {833#true} is VALID [2022-04-15 13:16:27,918 INFO L272 TraceCheckUtils]: 4: Hoare triple {833#true} call #t~ret5 := main(); {833#true} is VALID [2022-04-15 13:16:27,918 INFO L290 TraceCheckUtils]: 5: Hoare triple {833#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~i~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~n~0 := #t~nondet2;havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~sum~0 := #t~nondet3;havoc #t~nondet3; {833#true} is VALID [2022-04-15 13:16:27,919 INFO L290 TraceCheckUtils]: 6: Hoare triple {833#true} assume !!(((0 == ~i~0 && ~n~0 >= 0) && ~n~0 <= 100) && 0 == ~sum~0); {867#(and (<= 0 main_~i~0) (<= 0 main_~sum~0))} is VALID [2022-04-15 13:16:27,919 INFO L290 TraceCheckUtils]: 7: Hoare triple {867#(and (<= 0 main_~i~0) (<= 0 main_~sum~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {871#(and (<= 0 main_~sum~0) (<= 1 main_~i~0))} is VALID [2022-04-15 13:16:27,920 INFO L290 TraceCheckUtils]: 8: Hoare triple {871#(and (<= 0 main_~sum~0) (<= 1 main_~i~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {875#(and (<= 2 main_~i~0) (<= 1 main_~sum~0))} is VALID [2022-04-15 13:16:27,920 INFO L290 TraceCheckUtils]: 9: Hoare triple {875#(and (<= 2 main_~i~0) (<= 1 main_~sum~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {879#(and (<= 3 main_~sum~0) (<= 3 main_~i~0))} is VALID [2022-04-15 13:16:27,921 INFO L290 TraceCheckUtils]: 10: Hoare triple {879#(and (<= 3 main_~sum~0) (<= 3 main_~i~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {842#(<= 6 main_~sum~0)} is VALID [2022-04-15 13:16:27,921 INFO L290 TraceCheckUtils]: 11: Hoare triple {842#(<= 6 main_~sum~0)} assume !(~i~0 < ~n~0); {842#(<= 6 main_~sum~0)} is VALID [2022-04-15 13:16:27,922 INFO L272 TraceCheckUtils]: 12: Hoare triple {842#(<= 6 main_~sum~0)} call __VERIFIER_assert((if ~sum~0 >= 0 then 1 else 0)); {889#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 13:16:27,922 INFO L290 TraceCheckUtils]: 13: Hoare triple {889#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {893#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 13:16:27,922 INFO L290 TraceCheckUtils]: 14: Hoare triple {893#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {834#false} is VALID [2022-04-15 13:16:27,922 INFO L290 TraceCheckUtils]: 15: Hoare triple {834#false} assume !false; {834#false} is VALID [2022-04-15 13:16:27,923 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 13:16:27,923 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 13:16:28,453 INFO L290 TraceCheckUtils]: 15: Hoare triple {834#false} assume !false; {834#false} is VALID [2022-04-15 13:16:28,454 INFO L290 TraceCheckUtils]: 14: Hoare triple {893#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {834#false} is VALID [2022-04-15 13:16:28,454 INFO L290 TraceCheckUtils]: 13: Hoare triple {889#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {893#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 13:16:28,460 INFO L272 TraceCheckUtils]: 12: Hoare triple {909#(<= 0 main_~sum~0)} call __VERIFIER_assert((if ~sum~0 >= 0 then 1 else 0)); {889#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 13:16:28,460 INFO L290 TraceCheckUtils]: 11: Hoare triple {909#(<= 0 main_~sum~0)} assume !(~i~0 < ~n~0); {909#(<= 0 main_~sum~0)} is VALID [2022-04-15 13:16:28,461 INFO L290 TraceCheckUtils]: 10: Hoare triple {916#(<= 0 (+ main_~sum~0 main_~i~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {909#(<= 0 main_~sum~0)} is VALID [2022-04-15 13:16:28,461 INFO L290 TraceCheckUtils]: 9: Hoare triple {920#(<= 0 (+ main_~sum~0 (* main_~i~0 2) 1))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {916#(<= 0 (+ main_~sum~0 main_~i~0))} is VALID [2022-04-15 13:16:28,462 INFO L290 TraceCheckUtils]: 8: Hoare triple {924#(<= (div (+ main_~sum~0 main_~i~0 1) (- 2)) (+ main_~i~0 1))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {920#(<= 0 (+ main_~sum~0 (* main_~i~0 2) 1))} is VALID [2022-04-15 13:16:28,462 INFO L290 TraceCheckUtils]: 7: Hoare triple {928#(<= (div main_~sum~0 (- 2)) (+ 3 (* main_~i~0 2)))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {924#(<= (div (+ main_~sum~0 main_~i~0 1) (- 2)) (+ main_~i~0 1))} is VALID [2022-04-15 13:16:28,463 INFO L290 TraceCheckUtils]: 6: Hoare triple {833#true} assume !!(((0 == ~i~0 && ~n~0 >= 0) && ~n~0 <= 100) && 0 == ~sum~0); {928#(<= (div main_~sum~0 (- 2)) (+ 3 (* main_~i~0 2)))} is VALID [2022-04-15 13:16:28,463 INFO L290 TraceCheckUtils]: 5: Hoare triple {833#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~i~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~n~0 := #t~nondet2;havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~sum~0 := #t~nondet3;havoc #t~nondet3; {833#true} is VALID [2022-04-15 13:16:28,463 INFO L272 TraceCheckUtils]: 4: Hoare triple {833#true} call #t~ret5 := main(); {833#true} is VALID [2022-04-15 13:16:28,463 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {833#true} {833#true} #45#return; {833#true} is VALID [2022-04-15 13:16:28,463 INFO L290 TraceCheckUtils]: 2: Hoare triple {833#true} assume true; {833#true} is VALID [2022-04-15 13:16:28,463 INFO L290 TraceCheckUtils]: 1: Hoare triple {833#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(26, 2); {833#true} is VALID [2022-04-15 13:16:28,466 INFO L272 TraceCheckUtils]: 0: Hoare triple {833#true} call ULTIMATE.init(); {833#true} is VALID [2022-04-15 13:16:28,467 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 13:16:28,467 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2108087571] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 13:16:28,467 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 13:16:28,467 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 21 [2022-04-15 13:16:28,467 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 13:16:28,467 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1249632433] [2022-04-15 13:16:28,467 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1249632433] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:16:28,467 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:16:28,467 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-15 13:16:28,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [554917519] [2022-04-15 13:16:28,467 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 13:16:28,468 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.2) internal successors, (12), 8 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2022-04-15 13:16:28,468 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 13:16:28,468 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 1.2) internal successors, (12), 8 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:16:28,480 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:16:28,480 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-15 13:16:28,481 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 13:16:28,481 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-15 13:16:28,481 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=338, Unknown=0, NotChecked=0, Total=420 [2022-04-15 13:16:28,481 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand has 10 states, 10 states have (on average 1.2) internal successors, (12), 8 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:16:28,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:16:28,687 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2022-04-15 13:16:28,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-15 13:16:28,687 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.2) internal successors, (12), 8 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2022-04-15 13:16:28,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 13:16:28,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 1.2) internal successors, (12), 8 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:16:28,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 23 transitions. [2022-04-15 13:16:28,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 1.2) internal successors, (12), 8 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:16:28,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 23 transitions. [2022-04-15 13:16:28,692 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 23 transitions. [2022-04-15 13:16:28,714 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:16:28,715 INFO L225 Difference]: With dead ends: 23 [2022-04-15 13:16:28,715 INFO L226 Difference]: Without dead ends: 18 [2022-04-15 13:16:28,715 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 22 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 128 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=117, Invalid=639, Unknown=0, NotChecked=0, Total=756 [2022-04-15 13:16:28,716 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 10 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 13:16:28,716 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 48 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 13:16:28,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2022-04-15 13:16:28,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2022-04-15 13:16:28,728 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 13:16:28,729 INFO L82 GeneralOperation]: Start isEquivalent. First operand 18 states. Second operand has 18 states, 13 states have (on average 1.0769230769230769) internal successors, (14), 13 states have internal predecessors, (14), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:16:28,729 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states. Second operand has 18 states, 13 states have (on average 1.0769230769230769) internal successors, (14), 13 states have internal predecessors, (14), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:16:28,729 INFO L87 Difference]: Start difference. First operand 18 states. Second operand has 18 states, 13 states have (on average 1.0769230769230769) internal successors, (14), 13 states have internal predecessors, (14), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:16:28,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:16:28,730 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2022-04-15 13:16:28,730 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2022-04-15 13:16:28,730 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:16:28,730 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:16:28,730 INFO L74 IsIncluded]: Start isIncluded. First operand has 18 states, 13 states have (on average 1.0769230769230769) internal successors, (14), 13 states have internal predecessors, (14), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 18 states. [2022-04-15 13:16:28,730 INFO L87 Difference]: Start difference. First operand has 18 states, 13 states have (on average 1.0769230769230769) internal successors, (14), 13 states have internal predecessors, (14), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 18 states. [2022-04-15 13:16:28,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:16:28,731 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2022-04-15 13:16:28,731 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2022-04-15 13:16:28,731 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:16:28,731 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:16:28,731 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 13:16:28,731 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 13:16:28,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 13 states have (on average 1.0769230769230769) internal successors, (14), 13 states have internal predecessors, (14), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:16:28,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2022-04-15 13:16:28,732 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 16 [2022-04-15 13:16:28,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 13:16:28,732 INFO L478 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions. [2022-04-15 13:16:28,732 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 1.2) internal successors, (12), 8 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:16:28,732 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 18 states and 18 transitions. [2022-04-15 13:16:28,748 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:16:28,748 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2022-04-15 13:16:28,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-15 13:16:28,749 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 13:16:28,749 INFO L499 BasicCegarLoop]: trace histogram [5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 13:16:28,769 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-04-15 13:16:28,965 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 13:16:28,965 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 13:16:28,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 13:16:28,966 INFO L85 PathProgramCache]: Analyzing trace with hash 2033757318, now seen corresponding path program 9 times [2022-04-15 13:16:28,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 13:16:28,966 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1293117775] [2022-04-15 13:16:29,111 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 13:16:29,113 INFO L85 PathProgramCache]: Analyzing trace with hash 265384999, now seen corresponding path program 1 times [2022-04-15 13:16:29,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:16:29,113 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1809036764] [2022-04-15 13:16:29,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:16:29,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:16:29,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 13:16:29,129 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 13:16:29,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 13:16:29,133 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 13:16:29,134 INFO L85 PathProgramCache]: Analyzing trace with hash 2033757318, now seen corresponding path program 10 times [2022-04-15 13:16:29,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:16:29,134 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1433350946] [2022-04-15 13:16:29,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:16:29,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:16:29,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:16:29,226 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 13:16:29,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:16:29,230 INFO L290 TraceCheckUtils]: 0: Hoare triple {1097#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(26, 2); {1084#true} is VALID [2022-04-15 13:16:29,230 INFO L290 TraceCheckUtils]: 1: Hoare triple {1084#true} assume true; {1084#true} is VALID [2022-04-15 13:16:29,230 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1084#true} {1084#true} #45#return; {1084#true} is VALID [2022-04-15 13:16:29,230 INFO L272 TraceCheckUtils]: 0: Hoare triple {1084#true} call ULTIMATE.init(); {1097#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 13:16:29,230 INFO L290 TraceCheckUtils]: 1: Hoare triple {1097#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(26, 2); {1084#true} is VALID [2022-04-15 13:16:29,230 INFO L290 TraceCheckUtils]: 2: Hoare triple {1084#true} assume true; {1084#true} is VALID [2022-04-15 13:16:29,231 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1084#true} {1084#true} #45#return; {1084#true} is VALID [2022-04-15 13:16:29,231 INFO L272 TraceCheckUtils]: 4: Hoare triple {1084#true} call #t~ret5 := main(); {1084#true} is VALID [2022-04-15 13:16:29,231 INFO L290 TraceCheckUtils]: 5: Hoare triple {1084#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~i~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~n~0 := #t~nondet2;havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~sum~0 := #t~nondet3;havoc #t~nondet3; {1084#true} is VALID [2022-04-15 13:16:29,231 INFO L290 TraceCheckUtils]: 6: Hoare triple {1084#true} assume !!(((0 == ~i~0 && ~n~0 >= 0) && ~n~0 <= 100) && 0 == ~sum~0); {1089#(<= 0 (+ (* 5 main_~i~0) main_~sum~0))} is VALID [2022-04-15 13:16:29,232 INFO L290 TraceCheckUtils]: 7: Hoare triple {1089#(<= 0 (+ (* 5 main_~i~0) main_~sum~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1090#(<= 4 (+ main_~sum~0 (* main_~i~0 4)))} is VALID [2022-04-15 13:16:29,232 INFO L290 TraceCheckUtils]: 8: Hoare triple {1090#(<= 4 (+ main_~sum~0 (* main_~i~0 4)))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1091#(<= 7 (+ main_~sum~0 (* main_~i~0 3)))} is VALID [2022-04-15 13:16:29,233 INFO L290 TraceCheckUtils]: 9: Hoare triple {1091#(<= 7 (+ main_~sum~0 (* main_~i~0 3)))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1092#(<= 9 (+ main_~sum~0 (* main_~i~0 2)))} is VALID [2022-04-15 13:16:29,234 INFO L290 TraceCheckUtils]: 10: Hoare triple {1092#(<= 9 (+ main_~sum~0 (* main_~i~0 2)))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1093#(<= 10 (+ main_~sum~0 main_~i~0))} is VALID [2022-04-15 13:16:29,234 INFO L290 TraceCheckUtils]: 11: Hoare triple {1093#(<= 10 (+ main_~sum~0 main_~i~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1094#(<= 10 main_~sum~0)} is VALID [2022-04-15 13:16:29,234 INFO L290 TraceCheckUtils]: 12: Hoare triple {1094#(<= 10 main_~sum~0)} assume !(~i~0 < ~n~0); {1094#(<= 10 main_~sum~0)} is VALID [2022-04-15 13:16:29,235 INFO L272 TraceCheckUtils]: 13: Hoare triple {1094#(<= 10 main_~sum~0)} call __VERIFIER_assert((if ~sum~0 >= 0 then 1 else 0)); {1095#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 13:16:29,235 INFO L290 TraceCheckUtils]: 14: Hoare triple {1095#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {1096#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 13:16:29,236 INFO L290 TraceCheckUtils]: 15: Hoare triple {1096#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {1085#false} is VALID [2022-04-15 13:16:29,236 INFO L290 TraceCheckUtils]: 16: Hoare triple {1085#false} assume !false; {1085#false} is VALID [2022-04-15 13:16:29,236 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 13:16:29,236 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 13:16:29,236 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1433350946] [2022-04-15 13:16:29,236 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1433350946] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 13:16:29,236 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1883000826] [2022-04-15 13:16:29,236 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 13:16:29,236 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 13:16:29,237 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 13:16:29,237 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) [2022-04-15 13:16:29,238 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-04-15 13:16:29,266 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 13:16:29,267 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 13:16:29,267 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 14 conjunts are in the unsatisfiable core [2022-04-15 13:16:29,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:16:29,276 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 13:16:29,523 INFO L272 TraceCheckUtils]: 0: Hoare triple {1084#true} call ULTIMATE.init(); {1084#true} is VALID [2022-04-15 13:16:29,523 INFO L290 TraceCheckUtils]: 1: Hoare triple {1084#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(26, 2); {1084#true} is VALID [2022-04-15 13:16:29,523 INFO L290 TraceCheckUtils]: 2: Hoare triple {1084#true} assume true; {1084#true} is VALID [2022-04-15 13:16:29,524 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1084#true} {1084#true} #45#return; {1084#true} is VALID [2022-04-15 13:16:29,524 INFO L272 TraceCheckUtils]: 4: Hoare triple {1084#true} call #t~ret5 := main(); {1084#true} is VALID [2022-04-15 13:16:29,524 INFO L290 TraceCheckUtils]: 5: Hoare triple {1084#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~i~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~n~0 := #t~nondet2;havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~sum~0 := #t~nondet3;havoc #t~nondet3; {1084#true} is VALID [2022-04-15 13:16:29,524 INFO L290 TraceCheckUtils]: 6: Hoare triple {1084#true} assume !!(((0 == ~i~0 && ~n~0 >= 0) && ~n~0 <= 100) && 0 == ~sum~0); {1119#(and (<= 0 main_~i~0) (<= 0 main_~sum~0))} is VALID [2022-04-15 13:16:29,525 INFO L290 TraceCheckUtils]: 7: Hoare triple {1119#(and (<= 0 main_~i~0) (<= 0 main_~sum~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1123#(and (<= 0 main_~sum~0) (<= 1 main_~i~0))} is VALID [2022-04-15 13:16:29,525 INFO L290 TraceCheckUtils]: 8: Hoare triple {1123#(and (<= 0 main_~sum~0) (<= 1 main_~i~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1127#(and (<= 2 main_~i~0) (<= 1 main_~sum~0))} is VALID [2022-04-15 13:16:29,526 INFO L290 TraceCheckUtils]: 9: Hoare triple {1127#(and (<= 2 main_~i~0) (<= 1 main_~sum~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1131#(and (<= 3 main_~sum~0) (<= 3 main_~i~0))} is VALID [2022-04-15 13:16:29,526 INFO L290 TraceCheckUtils]: 10: Hoare triple {1131#(and (<= 3 main_~sum~0) (<= 3 main_~i~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1135#(and (<= 6 main_~sum~0) (<= 4 main_~i~0))} is VALID [2022-04-15 13:16:29,527 INFO L290 TraceCheckUtils]: 11: Hoare triple {1135#(and (<= 6 main_~sum~0) (<= 4 main_~i~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1094#(<= 10 main_~sum~0)} is VALID [2022-04-15 13:16:29,527 INFO L290 TraceCheckUtils]: 12: Hoare triple {1094#(<= 10 main_~sum~0)} assume !(~i~0 < ~n~0); {1094#(<= 10 main_~sum~0)} is VALID [2022-04-15 13:16:29,528 INFO L272 TraceCheckUtils]: 13: Hoare triple {1094#(<= 10 main_~sum~0)} call __VERIFIER_assert((if ~sum~0 >= 0 then 1 else 0)); {1145#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 13:16:29,528 INFO L290 TraceCheckUtils]: 14: Hoare triple {1145#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1149#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 13:16:29,529 INFO L290 TraceCheckUtils]: 15: Hoare triple {1149#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1085#false} is VALID [2022-04-15 13:16:29,529 INFO L290 TraceCheckUtils]: 16: Hoare triple {1085#false} assume !false; {1085#false} is VALID [2022-04-15 13:16:29,529 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 10 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 13:16:29,529 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 13:16:30,356 INFO L290 TraceCheckUtils]: 16: Hoare triple {1085#false} assume !false; {1085#false} is VALID [2022-04-15 13:16:30,356 INFO L290 TraceCheckUtils]: 15: Hoare triple {1149#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1085#false} is VALID [2022-04-15 13:16:30,357 INFO L290 TraceCheckUtils]: 14: Hoare triple {1145#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1149#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 13:16:30,357 INFO L272 TraceCheckUtils]: 13: Hoare triple {1165#(<= 0 main_~sum~0)} call __VERIFIER_assert((if ~sum~0 >= 0 then 1 else 0)); {1145#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 13:16:30,358 INFO L290 TraceCheckUtils]: 12: Hoare triple {1165#(<= 0 main_~sum~0)} assume !(~i~0 < ~n~0); {1165#(<= 0 main_~sum~0)} is VALID [2022-04-15 13:16:30,358 INFO L290 TraceCheckUtils]: 11: Hoare triple {1172#(<= 0 (+ main_~sum~0 main_~i~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1165#(<= 0 main_~sum~0)} is VALID [2022-04-15 13:16:30,359 INFO L290 TraceCheckUtils]: 10: Hoare triple {1176#(<= 0 (+ main_~sum~0 (* main_~i~0 2) 1))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1172#(<= 0 (+ main_~sum~0 main_~i~0))} is VALID [2022-04-15 13:16:30,360 INFO L290 TraceCheckUtils]: 9: Hoare triple {1180#(<= (div (+ main_~sum~0 main_~i~0 1) (- 2)) (+ main_~i~0 1))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1176#(<= 0 (+ main_~sum~0 (* main_~i~0 2) 1))} is VALID [2022-04-15 13:16:30,361 INFO L290 TraceCheckUtils]: 8: Hoare triple {1184#(<= (div main_~sum~0 (- 2)) (+ 3 (* main_~i~0 2)))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1180#(<= (div (+ main_~sum~0 main_~i~0 1) (- 2)) (+ main_~i~0 1))} is VALID [2022-04-15 13:16:30,361 INFO L290 TraceCheckUtils]: 7: Hoare triple {1188#(<= (div (+ (* (- 1) (div (+ (- 2) main_~sum~0 main_~i~0) (- 2))) 4) (- 2)) (+ main_~i~0 1))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1184#(<= (div main_~sum~0 (- 2)) (+ 3 (* main_~i~0 2)))} is VALID [2022-04-15 13:16:30,362 INFO L290 TraceCheckUtils]: 6: Hoare triple {1084#true} assume !!(((0 == ~i~0 && ~n~0 >= 0) && ~n~0 <= 100) && 0 == ~sum~0); {1188#(<= (div (+ (* (- 1) (div (+ (- 2) main_~sum~0 main_~i~0) (- 2))) 4) (- 2)) (+ main_~i~0 1))} is VALID [2022-04-15 13:16:30,362 INFO L290 TraceCheckUtils]: 5: Hoare triple {1084#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~i~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~n~0 := #t~nondet2;havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~sum~0 := #t~nondet3;havoc #t~nondet3; {1084#true} is VALID [2022-04-15 13:16:30,362 INFO L272 TraceCheckUtils]: 4: Hoare triple {1084#true} call #t~ret5 := main(); {1084#true} is VALID [2022-04-15 13:16:30,362 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1084#true} {1084#true} #45#return; {1084#true} is VALID [2022-04-15 13:16:30,362 INFO L290 TraceCheckUtils]: 2: Hoare triple {1084#true} assume true; {1084#true} is VALID [2022-04-15 13:16:30,362 INFO L290 TraceCheckUtils]: 1: Hoare triple {1084#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(26, 2); {1084#true} is VALID [2022-04-15 13:16:30,362 INFO L272 TraceCheckUtils]: 0: Hoare triple {1084#true} call ULTIMATE.init(); {1084#true} is VALID [2022-04-15 13:16:30,363 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 13:16:30,363 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1883000826] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 13:16:30,363 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 13:16:30,363 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 24 [2022-04-15 13:16:30,363 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 13:16:30,363 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1293117775] [2022-04-15 13:16:30,363 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1293117775] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:16:30,363 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:16:30,363 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-15 13:16:30,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [400870251] [2022-04-15 13:16:30,363 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 13:16:30,364 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 9 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-04-15 13:16:30,364 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 13:16:30,364 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 9 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:16:30,383 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:16:30,383 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-15 13:16:30,383 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 13:16:30,384 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-15 13:16:30,384 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=444, Unknown=0, NotChecked=0, Total=552 [2022-04-15 13:16:30,384 INFO L87 Difference]: Start difference. First operand 18 states and 18 transitions. Second operand has 11 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 9 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:16:30,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:16:30,653 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2022-04-15 13:16:30,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-15 13:16:30,653 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 9 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-04-15 13:16:30,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 13:16:30,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 9 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:16:30,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 24 transitions. [2022-04-15 13:16:30,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 9 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:16:30,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 24 transitions. [2022-04-15 13:16:30,655 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 24 transitions. [2022-04-15 13:16:30,677 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:16:30,677 INFO L225 Difference]: With dead ends: 24 [2022-04-15 13:16:30,677 INFO L226 Difference]: Without dead ends: 19 [2022-04-15 13:16:30,678 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 22 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 178 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=148, Invalid=844, Unknown=0, NotChecked=0, Total=992 [2022-04-15 13:16:30,679 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 10 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 13:16:30,679 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 53 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 13:16:30,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2022-04-15 13:16:30,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2022-04-15 13:16:30,691 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 13:16:30,691 INFO L82 GeneralOperation]: Start isEquivalent. First operand 19 states. Second operand has 19 states, 14 states have (on average 1.0714285714285714) internal successors, (15), 14 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:16:30,691 INFO L74 IsIncluded]: Start isIncluded. First operand 19 states. Second operand has 19 states, 14 states have (on average 1.0714285714285714) internal successors, (15), 14 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:16:30,691 INFO L87 Difference]: Start difference. First operand 19 states. Second operand has 19 states, 14 states have (on average 1.0714285714285714) internal successors, (15), 14 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:16:30,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:16:30,692 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2022-04-15 13:16:30,692 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2022-04-15 13:16:30,692 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:16:30,692 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:16:30,692 INFO L74 IsIncluded]: Start isIncluded. First operand has 19 states, 14 states have (on average 1.0714285714285714) internal successors, (15), 14 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 19 states. [2022-04-15 13:16:30,693 INFO L87 Difference]: Start difference. First operand has 19 states, 14 states have (on average 1.0714285714285714) internal successors, (15), 14 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 19 states. [2022-04-15 13:16:30,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:16:30,693 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2022-04-15 13:16:30,693 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2022-04-15 13:16:30,693 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:16:30,693 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:16:30,693 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 13:16:30,694 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 13:16:30,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 14 states have (on average 1.0714285714285714) internal successors, (15), 14 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:16:30,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2022-04-15 13:16:30,694 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 17 [2022-04-15 13:16:30,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 13:16:30,694 INFO L478 AbstractCegarLoop]: Abstraction has 19 states and 19 transitions. [2022-04-15 13:16:30,695 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 9 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:16:30,695 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 19 states and 19 transitions. [2022-04-15 13:16:30,715 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:16:30,715 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2022-04-15 13:16:30,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-15 13:16:30,716 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 13:16:30,716 INFO L499 BasicCegarLoop]: trace histogram [6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 13:16:30,735 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-04-15 13:16:30,916 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10,SelfDestructingSolverStorable9 [2022-04-15 13:16:30,916 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 13:16:30,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 13:16:30,917 INFO L85 PathProgramCache]: Analyzing trace with hash -1342643752, now seen corresponding path program 11 times [2022-04-15 13:16:30,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 13:16:30,917 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2129840450] [2022-04-15 13:16:31,028 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 13:16:31,029 INFO L85 PathProgramCache]: Analyzing trace with hash 324490343, now seen corresponding path program 1 times [2022-04-15 13:16:31,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:16:31,030 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1918760962] [2022-04-15 13:16:31,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:16:31,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:16:31,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 13:16:31,046 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 13:16:31,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 13:16:31,050 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 13:16:31,050 INFO L85 PathProgramCache]: Analyzing trace with hash -1342643752, now seen corresponding path program 12 times [2022-04-15 13:16:31,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:16:31,051 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1642294825] [2022-04-15 13:16:31,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:16:31,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:16:31,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:16:31,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 13:16:31,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:16:31,154 INFO L290 TraceCheckUtils]: 0: Hoare triple {1366#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(26, 2); {1352#true} is VALID [2022-04-15 13:16:31,154 INFO L290 TraceCheckUtils]: 1: Hoare triple {1352#true} assume true; {1352#true} is VALID [2022-04-15 13:16:31,154 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1352#true} {1352#true} #45#return; {1352#true} is VALID [2022-04-15 13:16:31,155 INFO L272 TraceCheckUtils]: 0: Hoare triple {1352#true} call ULTIMATE.init(); {1366#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 13:16:31,155 INFO L290 TraceCheckUtils]: 1: Hoare triple {1366#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(26, 2); {1352#true} is VALID [2022-04-15 13:16:31,155 INFO L290 TraceCheckUtils]: 2: Hoare triple {1352#true} assume true; {1352#true} is VALID [2022-04-15 13:16:31,155 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1352#true} {1352#true} #45#return; {1352#true} is VALID [2022-04-15 13:16:31,155 INFO L272 TraceCheckUtils]: 4: Hoare triple {1352#true} call #t~ret5 := main(); {1352#true} is VALID [2022-04-15 13:16:31,155 INFO L290 TraceCheckUtils]: 5: Hoare triple {1352#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~i~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~n~0 := #t~nondet2;havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~sum~0 := #t~nondet3;havoc #t~nondet3; {1352#true} is VALID [2022-04-15 13:16:31,156 INFO L290 TraceCheckUtils]: 6: Hoare triple {1352#true} assume !!(((0 == ~i~0 && ~n~0 >= 0) && ~n~0 <= 100) && 0 == ~sum~0); {1357#(<= 0 (+ (* main_~i~0 6) main_~sum~0))} is VALID [2022-04-15 13:16:31,156 INFO L290 TraceCheckUtils]: 7: Hoare triple {1357#(<= 0 (+ (* main_~i~0 6) main_~sum~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1358#(<= 5 (+ (* 5 main_~i~0) main_~sum~0))} is VALID [2022-04-15 13:16:31,157 INFO L290 TraceCheckUtils]: 8: Hoare triple {1358#(<= 5 (+ (* 5 main_~i~0) main_~sum~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1359#(<= 9 (+ main_~sum~0 (* main_~i~0 4)))} is VALID [2022-04-15 13:16:31,157 INFO L290 TraceCheckUtils]: 9: Hoare triple {1359#(<= 9 (+ main_~sum~0 (* main_~i~0 4)))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1360#(<= 12 (+ main_~sum~0 (* main_~i~0 3)))} is VALID [2022-04-15 13:16:31,158 INFO L290 TraceCheckUtils]: 10: Hoare triple {1360#(<= 12 (+ main_~sum~0 (* main_~i~0 3)))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1361#(<= 14 (+ main_~sum~0 (* main_~i~0 2)))} is VALID [2022-04-15 13:16:31,159 INFO L290 TraceCheckUtils]: 11: Hoare triple {1361#(<= 14 (+ main_~sum~0 (* main_~i~0 2)))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1362#(<= 15 (+ main_~sum~0 main_~i~0))} is VALID [2022-04-15 13:16:31,159 INFO L290 TraceCheckUtils]: 12: Hoare triple {1362#(<= 15 (+ main_~sum~0 main_~i~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1363#(<= 15 main_~sum~0)} is VALID [2022-04-15 13:16:31,159 INFO L290 TraceCheckUtils]: 13: Hoare triple {1363#(<= 15 main_~sum~0)} assume !(~i~0 < ~n~0); {1363#(<= 15 main_~sum~0)} is VALID [2022-04-15 13:16:31,160 INFO L272 TraceCheckUtils]: 14: Hoare triple {1363#(<= 15 main_~sum~0)} call __VERIFIER_assert((if ~sum~0 >= 0 then 1 else 0)); {1364#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 13:16:31,160 INFO L290 TraceCheckUtils]: 15: Hoare triple {1364#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {1365#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 13:16:31,161 INFO L290 TraceCheckUtils]: 16: Hoare triple {1365#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {1353#false} is VALID [2022-04-15 13:16:31,161 INFO L290 TraceCheckUtils]: 17: Hoare triple {1353#false} assume !false; {1353#false} is VALID [2022-04-15 13:16:31,161 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 13:16:31,161 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 13:16:31,161 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1642294825] [2022-04-15 13:16:31,161 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1642294825] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 13:16:31,161 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [715874011] [2022-04-15 13:16:31,161 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 13:16:31,161 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 13:16:31,162 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 13:16:31,162 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) [2022-04-15 13:16:31,163 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-04-15 13:16:31,201 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2022-04-15 13:16:31,202 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 13:16:31,202 INFO L263 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 16 conjunts are in the unsatisfiable core [2022-04-15 13:16:31,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:16:31,218 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 13:16:31,491 INFO L272 TraceCheckUtils]: 0: Hoare triple {1352#true} call ULTIMATE.init(); {1352#true} is VALID [2022-04-15 13:16:31,491 INFO L290 TraceCheckUtils]: 1: Hoare triple {1352#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(26, 2); {1352#true} is VALID [2022-04-15 13:16:31,491 INFO L290 TraceCheckUtils]: 2: Hoare triple {1352#true} assume true; {1352#true} is VALID [2022-04-15 13:16:31,491 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1352#true} {1352#true} #45#return; {1352#true} is VALID [2022-04-15 13:16:31,491 INFO L272 TraceCheckUtils]: 4: Hoare triple {1352#true} call #t~ret5 := main(); {1352#true} is VALID [2022-04-15 13:16:31,491 INFO L290 TraceCheckUtils]: 5: Hoare triple {1352#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~i~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~n~0 := #t~nondet2;havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~sum~0 := #t~nondet3;havoc #t~nondet3; {1352#true} is VALID [2022-04-15 13:16:31,494 INFO L290 TraceCheckUtils]: 6: Hoare triple {1352#true} assume !!(((0 == ~i~0 && ~n~0 >= 0) && ~n~0 <= 100) && 0 == ~sum~0); {1388#(and (<= 0 main_~i~0) (<= 0 main_~sum~0))} is VALID [2022-04-15 13:16:31,495 INFO L290 TraceCheckUtils]: 7: Hoare triple {1388#(and (<= 0 main_~i~0) (<= 0 main_~sum~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1392#(and (<= 0 main_~sum~0) (<= 1 main_~i~0))} is VALID [2022-04-15 13:16:31,495 INFO L290 TraceCheckUtils]: 8: Hoare triple {1392#(and (<= 0 main_~sum~0) (<= 1 main_~i~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1396#(and (<= 2 main_~i~0) (<= 1 main_~sum~0))} is VALID [2022-04-15 13:16:31,496 INFO L290 TraceCheckUtils]: 9: Hoare triple {1396#(and (<= 2 main_~i~0) (<= 1 main_~sum~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1400#(and (<= 3 main_~sum~0) (<= 3 main_~i~0))} is VALID [2022-04-15 13:16:31,496 INFO L290 TraceCheckUtils]: 10: Hoare triple {1400#(and (<= 3 main_~sum~0) (<= 3 main_~i~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1404#(and (<= 6 main_~sum~0) (<= 4 main_~i~0))} is VALID [2022-04-15 13:16:31,497 INFO L290 TraceCheckUtils]: 11: Hoare triple {1404#(and (<= 6 main_~sum~0) (<= 4 main_~i~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1408#(and (<= 10 main_~sum~0) (<= 5 main_~i~0))} is VALID [2022-04-15 13:16:31,498 INFO L290 TraceCheckUtils]: 12: Hoare triple {1408#(and (<= 10 main_~sum~0) (<= 5 main_~i~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1363#(<= 15 main_~sum~0)} is VALID [2022-04-15 13:16:31,498 INFO L290 TraceCheckUtils]: 13: Hoare triple {1363#(<= 15 main_~sum~0)} assume !(~i~0 < ~n~0); {1363#(<= 15 main_~sum~0)} is VALID [2022-04-15 13:16:31,499 INFO L272 TraceCheckUtils]: 14: Hoare triple {1363#(<= 15 main_~sum~0)} call __VERIFIER_assert((if ~sum~0 >= 0 then 1 else 0)); {1418#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 13:16:31,499 INFO L290 TraceCheckUtils]: 15: Hoare triple {1418#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1422#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 13:16:31,499 INFO L290 TraceCheckUtils]: 16: Hoare triple {1422#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1353#false} is VALID [2022-04-15 13:16:31,500 INFO L290 TraceCheckUtils]: 17: Hoare triple {1353#false} assume !false; {1353#false} is VALID [2022-04-15 13:16:31,500 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 15 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 13:16:31,500 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 13:16:59,654 INFO L290 TraceCheckUtils]: 17: Hoare triple {1353#false} assume !false; {1353#false} is VALID [2022-04-15 13:16:59,655 INFO L290 TraceCheckUtils]: 16: Hoare triple {1422#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1353#false} is VALID [2022-04-15 13:16:59,655 INFO L290 TraceCheckUtils]: 15: Hoare triple {1418#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1422#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 13:16:59,656 INFO L272 TraceCheckUtils]: 14: Hoare triple {1438#(<= 0 main_~sum~0)} call __VERIFIER_assert((if ~sum~0 >= 0 then 1 else 0)); {1418#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 13:16:59,656 INFO L290 TraceCheckUtils]: 13: Hoare triple {1438#(<= 0 main_~sum~0)} assume !(~i~0 < ~n~0); {1438#(<= 0 main_~sum~0)} is VALID [2022-04-15 13:16:59,657 INFO L290 TraceCheckUtils]: 12: Hoare triple {1445#(<= 0 (+ main_~sum~0 main_~i~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1438#(<= 0 main_~sum~0)} is VALID [2022-04-15 13:16:59,658 INFO L290 TraceCheckUtils]: 11: Hoare triple {1449#(<= 0 (+ main_~sum~0 (* main_~i~0 2) 1))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1445#(<= 0 (+ main_~sum~0 main_~i~0))} is VALID [2022-04-15 13:16:59,658 INFO L290 TraceCheckUtils]: 10: Hoare triple {1453#(<= (div (+ main_~sum~0 main_~i~0 1) (- 2)) (+ main_~i~0 1))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1449#(<= 0 (+ main_~sum~0 (* main_~i~0 2) 1))} is VALID [2022-04-15 13:16:59,659 INFO L290 TraceCheckUtils]: 9: Hoare triple {1457#(<= (div main_~sum~0 (- 2)) (+ 3 (* main_~i~0 2)))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1453#(<= (div (+ main_~sum~0 main_~i~0 1) (- 2)) (+ main_~i~0 1))} is VALID [2022-04-15 13:16:59,660 INFO L290 TraceCheckUtils]: 8: Hoare triple {1461#(<= (div (+ (* (- 1) (div (+ (- 2) main_~sum~0 main_~i~0) (- 2))) 4) (- 2)) (+ main_~i~0 1))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1457#(<= (div main_~sum~0 (- 2)) (+ 3 (* main_~i~0 2)))} is VALID [2022-04-15 13:16:59,661 INFO L290 TraceCheckUtils]: 7: Hoare triple {1465#(<= (div (+ (- 1) (div (+ 5 main_~sum~0) 2) main_~i~0) (- 2)) (+ main_~i~0 3))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1461#(<= (div (+ (* (- 1) (div (+ (- 2) main_~sum~0 main_~i~0) (- 2))) 4) (- 2)) (+ main_~i~0 1))} is VALID [2022-04-15 13:16:59,662 INFO L290 TraceCheckUtils]: 6: Hoare triple {1352#true} assume !!(((0 == ~i~0 && ~n~0 >= 0) && ~n~0 <= 100) && 0 == ~sum~0); {1465#(<= (div (+ (- 1) (div (+ 5 main_~sum~0) 2) main_~i~0) (- 2)) (+ main_~i~0 3))} is VALID [2022-04-15 13:16:59,662 INFO L290 TraceCheckUtils]: 5: Hoare triple {1352#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~i~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~n~0 := #t~nondet2;havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~sum~0 := #t~nondet3;havoc #t~nondet3; {1352#true} is VALID [2022-04-15 13:16:59,662 INFO L272 TraceCheckUtils]: 4: Hoare triple {1352#true} call #t~ret5 := main(); {1352#true} is VALID [2022-04-15 13:16:59,662 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1352#true} {1352#true} #45#return; {1352#true} is VALID [2022-04-15 13:16:59,662 INFO L290 TraceCheckUtils]: 2: Hoare triple {1352#true} assume true; {1352#true} is VALID [2022-04-15 13:16:59,662 INFO L290 TraceCheckUtils]: 1: Hoare triple {1352#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(26, 2); {1352#true} is VALID [2022-04-15 13:16:59,662 INFO L272 TraceCheckUtils]: 0: Hoare triple {1352#true} call ULTIMATE.init(); {1352#true} is VALID [2022-04-15 13:16:59,663 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 13:16:59,663 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [715874011] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 13:16:59,663 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 13:16:59,663 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 27 [2022-04-15 13:16:59,663 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 13:16:59,663 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2129840450] [2022-04-15 13:16:59,663 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2129840450] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:16:59,663 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:16:59,663 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-04-15 13:16:59,663 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [347972143] [2022-04-15 13:16:59,663 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 13:16:59,664 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 10 states have internal predecessors, (14), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2022-04-15 13:16:59,664 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 13:16:59,664 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 12 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 10 states have internal predecessors, (14), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:16:59,676 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:16:59,676 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-15 13:16:59,676 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 13:16:59,676 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-15 13:16:59,676 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=564, Unknown=0, NotChecked=0, Total=702 [2022-04-15 13:16:59,677 INFO L87 Difference]: Start difference. First operand 19 states and 19 transitions. Second operand has 12 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 10 states have internal predecessors, (14), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:17:00,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:17:00,512 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2022-04-15 13:17:00,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-15 13:17:00,513 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 10 states have internal predecessors, (14), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2022-04-15 13:17:00,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 13:17:00,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 10 states have internal predecessors, (14), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:17:00,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 25 transitions. [2022-04-15 13:17:00,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 10 states have internal predecessors, (14), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:17:00,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 25 transitions. [2022-04-15 13:17:00,514 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 25 transitions. [2022-04-15 13:17:00,532 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:17:00,533 INFO L225 Difference]: With dead ends: 25 [2022-04-15 13:17:00,533 INFO L226 Difference]: Without dead ends: 20 [2022-04-15 13:17:00,533 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 22 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 236 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=183, Invalid=1077, Unknown=0, NotChecked=0, Total=1260 [2022-04-15 13:17:00,534 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 10 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 128 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-15 13:17:00,534 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 58 Invalid, 138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-15 13:17:00,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2022-04-15 13:17:00,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2022-04-15 13:17:00,549 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 13:17:00,549 INFO L82 GeneralOperation]: Start isEquivalent. First operand 20 states. Second operand has 20 states, 15 states have (on average 1.0666666666666667) internal successors, (16), 15 states have internal predecessors, (16), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:17:00,549 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states. Second operand has 20 states, 15 states have (on average 1.0666666666666667) internal successors, (16), 15 states have internal predecessors, (16), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:17:00,549 INFO L87 Difference]: Start difference. First operand 20 states. Second operand has 20 states, 15 states have (on average 1.0666666666666667) internal successors, (16), 15 states have internal predecessors, (16), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:17:00,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:17:00,550 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2022-04-15 13:17:00,550 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2022-04-15 13:17:00,551 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:17:00,551 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:17:00,551 INFO L74 IsIncluded]: Start isIncluded. First operand has 20 states, 15 states have (on average 1.0666666666666667) internal successors, (16), 15 states have internal predecessors, (16), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 20 states. [2022-04-15 13:17:00,551 INFO L87 Difference]: Start difference. First operand has 20 states, 15 states have (on average 1.0666666666666667) internal successors, (16), 15 states have internal predecessors, (16), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 20 states. [2022-04-15 13:17:00,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:17:00,551 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2022-04-15 13:17:00,551 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2022-04-15 13:17:00,552 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:17:00,552 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:17:00,552 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 13:17:00,552 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 13:17:00,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 15 states have (on average 1.0666666666666667) internal successors, (16), 15 states have internal predecessors, (16), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:17:00,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 20 transitions. [2022-04-15 13:17:00,552 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 20 transitions. Word has length 18 [2022-04-15 13:17:00,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 13:17:00,553 INFO L478 AbstractCegarLoop]: Abstraction has 20 states and 20 transitions. [2022-04-15 13:17:00,553 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 10 states have internal predecessors, (14), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:17:00,553 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 20 states and 20 transitions. [2022-04-15 13:17:00,571 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:17:00,571 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2022-04-15 13:17:00,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-04-15 13:17:00,571 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 13:17:00,571 INFO L499 BasicCegarLoop]: trace histogram [7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 13:17:00,589 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-04-15 13:17:00,787 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,SelfDestructingSolverStorable12,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 13:17:00,788 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 13:17:00,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 13:17:00,788 INFO L85 PathProgramCache]: Analyzing trace with hash 1363105478, now seen corresponding path program 13 times [2022-04-15 13:17:00,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 13:17:00,788 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1464068303] [2022-04-15 13:17:01,058 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 13:17:01,059 INFO L85 PathProgramCache]: Analyzing trace with hash 383595687, now seen corresponding path program 1 times [2022-04-15 13:17:01,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:17:01,059 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [408329890] [2022-04-15 13:17:01,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:17:01,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:17:01,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 13:17:01,066 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 13:17:01,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 13:17:01,070 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 13:17:01,070 INFO L85 PathProgramCache]: Analyzing trace with hash 1363105478, now seen corresponding path program 14 times [2022-04-15 13:17:01,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:17:01,070 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1547358235] [2022-04-15 13:17:01,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:17:01,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:17:01,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:17:01,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 13:17:01,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:17:01,364 INFO L290 TraceCheckUtils]: 0: Hoare triple {1652#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(26, 2); {1637#true} is VALID [2022-04-15 13:17:01,364 INFO L290 TraceCheckUtils]: 1: Hoare triple {1637#true} assume true; {1637#true} is VALID [2022-04-15 13:17:01,364 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1637#true} {1637#true} #45#return; {1637#true} is VALID [2022-04-15 13:17:01,365 INFO L272 TraceCheckUtils]: 0: Hoare triple {1637#true} call ULTIMATE.init(); {1652#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 13:17:01,365 INFO L290 TraceCheckUtils]: 1: Hoare triple {1652#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(26, 2); {1637#true} is VALID [2022-04-15 13:17:01,365 INFO L290 TraceCheckUtils]: 2: Hoare triple {1637#true} assume true; {1637#true} is VALID [2022-04-15 13:17:01,365 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1637#true} {1637#true} #45#return; {1637#true} is VALID [2022-04-15 13:17:01,365 INFO L272 TraceCheckUtils]: 4: Hoare triple {1637#true} call #t~ret5 := main(); {1637#true} is VALID [2022-04-15 13:17:01,365 INFO L290 TraceCheckUtils]: 5: Hoare triple {1637#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~i~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~n~0 := #t~nondet2;havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~sum~0 := #t~nondet3;havoc #t~nondet3; {1637#true} is VALID [2022-04-15 13:17:01,365 INFO L290 TraceCheckUtils]: 6: Hoare triple {1637#true} assume !!(((0 == ~i~0 && ~n~0 >= 0) && ~n~0 <= 100) && 0 == ~sum~0); {1642#(<= 0 (+ (* 7 main_~i~0) main_~sum~0))} is VALID [2022-04-15 13:17:01,366 INFO L290 TraceCheckUtils]: 7: Hoare triple {1642#(<= 0 (+ (* 7 main_~i~0) main_~sum~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1643#(<= 6 (+ (* main_~i~0 6) main_~sum~0))} is VALID [2022-04-15 13:17:01,367 INFO L290 TraceCheckUtils]: 8: Hoare triple {1643#(<= 6 (+ (* main_~i~0 6) main_~sum~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1644#(<= 11 (+ (* 5 main_~i~0) main_~sum~0))} is VALID [2022-04-15 13:17:01,368 INFO L290 TraceCheckUtils]: 9: Hoare triple {1644#(<= 11 (+ (* 5 main_~i~0) main_~sum~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1645#(<= 15 (+ main_~sum~0 (* main_~i~0 4)))} is VALID [2022-04-15 13:17:01,368 INFO L290 TraceCheckUtils]: 10: Hoare triple {1645#(<= 15 (+ main_~sum~0 (* main_~i~0 4)))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1646#(<= 18 (+ main_~sum~0 (* main_~i~0 3)))} is VALID [2022-04-15 13:17:01,369 INFO L290 TraceCheckUtils]: 11: Hoare triple {1646#(<= 18 (+ main_~sum~0 (* main_~i~0 3)))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1647#(<= 20 (+ main_~sum~0 (* main_~i~0 2)))} is VALID [2022-04-15 13:17:01,369 INFO L290 TraceCheckUtils]: 12: Hoare triple {1647#(<= 20 (+ main_~sum~0 (* main_~i~0 2)))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1648#(<= 21 (+ main_~sum~0 main_~i~0))} is VALID [2022-04-15 13:17:01,370 INFO L290 TraceCheckUtils]: 13: Hoare triple {1648#(<= 21 (+ main_~sum~0 main_~i~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1649#(<= 21 main_~sum~0)} is VALID [2022-04-15 13:17:01,371 INFO L290 TraceCheckUtils]: 14: Hoare triple {1649#(<= 21 main_~sum~0)} assume !(~i~0 < ~n~0); {1649#(<= 21 main_~sum~0)} is VALID [2022-04-15 13:17:01,371 INFO L272 TraceCheckUtils]: 15: Hoare triple {1649#(<= 21 main_~sum~0)} call __VERIFIER_assert((if ~sum~0 >= 0 then 1 else 0)); {1650#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 13:17:01,371 INFO L290 TraceCheckUtils]: 16: Hoare triple {1650#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {1651#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 13:17:01,372 INFO L290 TraceCheckUtils]: 17: Hoare triple {1651#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {1638#false} is VALID [2022-04-15 13:17:01,372 INFO L290 TraceCheckUtils]: 18: Hoare triple {1638#false} assume !false; {1638#false} is VALID [2022-04-15 13:17:01,372 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 13:17:01,372 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 13:17:01,372 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1547358235] [2022-04-15 13:17:01,372 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1547358235] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 13:17:01,372 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1985437499] [2022-04-15 13:17:01,372 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 13:17:01,373 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 13:17:01,373 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 13:17:01,373 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) [2022-04-15 13:17:01,374 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-04-15 13:17:01,412 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 13:17:01,412 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 13:17:01,413 INFO L263 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 18 conjunts are in the unsatisfiable core [2022-04-15 13:17:01,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:17:01,425 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 13:17:01,991 INFO L272 TraceCheckUtils]: 0: Hoare triple {1637#true} call ULTIMATE.init(); {1637#true} is VALID [2022-04-15 13:17:01,991 INFO L290 TraceCheckUtils]: 1: Hoare triple {1637#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(26, 2); {1637#true} is VALID [2022-04-15 13:17:01,991 INFO L290 TraceCheckUtils]: 2: Hoare triple {1637#true} assume true; {1637#true} is VALID [2022-04-15 13:17:01,991 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1637#true} {1637#true} #45#return; {1637#true} is VALID [2022-04-15 13:17:01,991 INFO L272 TraceCheckUtils]: 4: Hoare triple {1637#true} call #t~ret5 := main(); {1637#true} is VALID [2022-04-15 13:17:01,991 INFO L290 TraceCheckUtils]: 5: Hoare triple {1637#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~i~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~n~0 := #t~nondet2;havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~sum~0 := #t~nondet3;havoc #t~nondet3; {1637#true} is VALID [2022-04-15 13:17:01,992 INFO L290 TraceCheckUtils]: 6: Hoare triple {1637#true} assume !!(((0 == ~i~0 && ~n~0 >= 0) && ~n~0 <= 100) && 0 == ~sum~0); {1674#(and (<= 0 main_~i~0) (<= 0 main_~sum~0))} is VALID [2022-04-15 13:17:01,993 INFO L290 TraceCheckUtils]: 7: Hoare triple {1674#(and (<= 0 main_~i~0) (<= 0 main_~sum~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1678#(and (<= 0 main_~sum~0) (<= 1 main_~i~0))} is VALID [2022-04-15 13:17:01,993 INFO L290 TraceCheckUtils]: 8: Hoare triple {1678#(and (<= 0 main_~sum~0) (<= 1 main_~i~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1682#(and (<= 2 main_~i~0) (<= 1 main_~sum~0))} is VALID [2022-04-15 13:17:01,994 INFO L290 TraceCheckUtils]: 9: Hoare triple {1682#(and (<= 2 main_~i~0) (<= 1 main_~sum~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1686#(and (<= 3 main_~sum~0) (<= 3 main_~i~0))} is VALID [2022-04-15 13:17:02,018 INFO L290 TraceCheckUtils]: 10: Hoare triple {1686#(and (<= 3 main_~sum~0) (<= 3 main_~i~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1690#(and (<= 6 main_~sum~0) (<= 4 main_~i~0))} is VALID [2022-04-15 13:17:02,019 INFO L290 TraceCheckUtils]: 11: Hoare triple {1690#(and (<= 6 main_~sum~0) (<= 4 main_~i~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1694#(and (<= 10 main_~sum~0) (<= 5 main_~i~0))} is VALID [2022-04-15 13:17:02,020 INFO L290 TraceCheckUtils]: 12: Hoare triple {1694#(and (<= 10 main_~sum~0) (<= 5 main_~i~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1698#(and (<= 15 main_~sum~0) (<= 6 main_~i~0))} is VALID [2022-04-15 13:17:02,020 INFO L290 TraceCheckUtils]: 13: Hoare triple {1698#(and (<= 15 main_~sum~0) (<= 6 main_~i~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1649#(<= 21 main_~sum~0)} is VALID [2022-04-15 13:17:02,021 INFO L290 TraceCheckUtils]: 14: Hoare triple {1649#(<= 21 main_~sum~0)} assume !(~i~0 < ~n~0); {1649#(<= 21 main_~sum~0)} is VALID [2022-04-15 13:17:02,021 INFO L272 TraceCheckUtils]: 15: Hoare triple {1649#(<= 21 main_~sum~0)} call __VERIFIER_assert((if ~sum~0 >= 0 then 1 else 0)); {1708#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 13:17:02,022 INFO L290 TraceCheckUtils]: 16: Hoare triple {1708#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1712#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 13:17:02,022 INFO L290 TraceCheckUtils]: 17: Hoare triple {1712#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1638#false} is VALID [2022-04-15 13:17:02,022 INFO L290 TraceCheckUtils]: 18: Hoare triple {1638#false} assume !false; {1638#false} is VALID [2022-04-15 13:17:02,022 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 21 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 13:17:02,023 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 13:17:19,599 INFO L290 TraceCheckUtils]: 18: Hoare triple {1638#false} assume !false; {1638#false} is VALID [2022-04-15 13:17:19,600 INFO L290 TraceCheckUtils]: 17: Hoare triple {1712#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1638#false} is VALID [2022-04-15 13:17:19,600 INFO L290 TraceCheckUtils]: 16: Hoare triple {1708#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1712#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 13:17:19,601 INFO L272 TraceCheckUtils]: 15: Hoare triple {1728#(<= 0 main_~sum~0)} call __VERIFIER_assert((if ~sum~0 >= 0 then 1 else 0)); {1708#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 13:17:19,601 INFO L290 TraceCheckUtils]: 14: Hoare triple {1728#(<= 0 main_~sum~0)} assume !(~i~0 < ~n~0); {1728#(<= 0 main_~sum~0)} is VALID [2022-04-15 13:17:19,602 INFO L290 TraceCheckUtils]: 13: Hoare triple {1735#(<= 0 (+ main_~sum~0 main_~i~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1728#(<= 0 main_~sum~0)} is VALID [2022-04-15 13:17:19,603 INFO L290 TraceCheckUtils]: 12: Hoare triple {1739#(<= 0 (+ main_~sum~0 (* main_~i~0 2) 1))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1735#(<= 0 (+ main_~sum~0 main_~i~0))} is VALID [2022-04-15 13:17:19,604 INFO L290 TraceCheckUtils]: 11: Hoare triple {1743#(<= (div (+ main_~sum~0 main_~i~0 1) (- 2)) (+ main_~i~0 1))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1739#(<= 0 (+ main_~sum~0 (* main_~i~0 2) 1))} is VALID [2022-04-15 13:17:19,605 INFO L290 TraceCheckUtils]: 10: Hoare triple {1747#(<= (div main_~sum~0 (- 2)) (+ 3 (* main_~i~0 2)))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1743#(<= (div (+ main_~sum~0 main_~i~0 1) (- 2)) (+ main_~i~0 1))} is VALID [2022-04-15 13:17:19,606 INFO L290 TraceCheckUtils]: 9: Hoare triple {1751#(<= (div (+ (* (- 1) (div (+ (- 2) main_~sum~0 main_~i~0) (- 2))) 4) (- 2)) (+ main_~i~0 1))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1747#(<= (div main_~sum~0 (- 2)) (+ 3 (* main_~i~0 2)))} is VALID [2022-04-15 13:17:19,607 INFO L290 TraceCheckUtils]: 8: Hoare triple {1755#(<= (div (+ (- 1) (div (+ 5 main_~sum~0) 2) main_~i~0) (- 2)) (+ main_~i~0 3))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1751#(<= (div (+ (* (- 1) (div (+ (- 2) main_~sum~0 main_~i~0) (- 2))) 4) (- 2)) (+ main_~i~0 1))} is VALID [2022-04-15 13:17:19,608 INFO L290 TraceCheckUtils]: 7: Hoare triple {1759#(<= (div (+ (* (- 1) (div (+ main_~sum~0 main_~i~0 1) (- 2))) main_~i~0) (- 2)) (+ 5 main_~i~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1755#(<= (div (+ (- 1) (div (+ 5 main_~sum~0) 2) main_~i~0) (- 2)) (+ main_~i~0 3))} is VALID [2022-04-15 13:17:19,608 INFO L290 TraceCheckUtils]: 6: Hoare triple {1637#true} assume !!(((0 == ~i~0 && ~n~0 >= 0) && ~n~0 <= 100) && 0 == ~sum~0); {1759#(<= (div (+ (* (- 1) (div (+ main_~sum~0 main_~i~0 1) (- 2))) main_~i~0) (- 2)) (+ 5 main_~i~0))} is VALID [2022-04-15 13:17:19,608 INFO L290 TraceCheckUtils]: 5: Hoare triple {1637#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~i~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~n~0 := #t~nondet2;havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~sum~0 := #t~nondet3;havoc #t~nondet3; {1637#true} is VALID [2022-04-15 13:17:19,608 INFO L272 TraceCheckUtils]: 4: Hoare triple {1637#true} call #t~ret5 := main(); {1637#true} is VALID [2022-04-15 13:17:19,608 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1637#true} {1637#true} #45#return; {1637#true} is VALID [2022-04-15 13:17:19,609 INFO L290 TraceCheckUtils]: 2: Hoare triple {1637#true} assume true; {1637#true} is VALID [2022-04-15 13:17:19,609 INFO L290 TraceCheckUtils]: 1: Hoare triple {1637#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(26, 2); {1637#true} is VALID [2022-04-15 13:17:19,609 INFO L272 TraceCheckUtils]: 0: Hoare triple {1637#true} call ULTIMATE.init(); {1637#true} is VALID [2022-04-15 13:17:19,609 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 13:17:19,609 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1985437499] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 13:17:19,609 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 13:17:19,609 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 12] total 30 [2022-04-15 13:17:19,609 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 13:17:19,609 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1464068303] [2022-04-15 13:17:19,609 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1464068303] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:17:19,610 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:17:19,610 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-04-15 13:17:19,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [604793923] [2022-04-15 13:17:19,610 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 13:17:19,610 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 11 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2022-04-15 13:17:19,610 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 13:17:19,610 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 13 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 11 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:17:19,624 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:17:19,624 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-15 13:17:19,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 13:17:19,624 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-15 13:17:19,625 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=172, Invalid=698, Unknown=0, NotChecked=0, Total=870 [2022-04-15 13:17:19,625 INFO L87 Difference]: Start difference. First operand 20 states and 20 transitions. Second operand has 13 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 11 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:17:20,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:17:20,625 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2022-04-15 13:17:20,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-15 13:17:20,626 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 11 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2022-04-15 13:17:20,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 13:17:20,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 11 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:17:20,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 26 transitions. [2022-04-15 13:17:20,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 11 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:17:20,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 26 transitions. [2022-04-15 13:17:20,628 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 26 transitions. [2022-04-15 13:17:20,647 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:17:20,647 INFO L225 Difference]: With dead ends: 26 [2022-04-15 13:17:20,647 INFO L226 Difference]: Without dead ends: 21 [2022-04-15 13:17:20,648 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 22 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 302 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=222, Invalid=1338, Unknown=0, NotChecked=0, Total=1560 [2022-04-15 13:17:20,648 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 10 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 152 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 152 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-15 13:17:20,649 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 63 Invalid, 163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 152 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-15 13:17:20,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2022-04-15 13:17:20,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2022-04-15 13:17:20,665 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 13:17:20,665 INFO L82 GeneralOperation]: Start isEquivalent. First operand 21 states. Second operand has 21 states, 16 states have (on average 1.0625) internal successors, (17), 16 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:17:20,665 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states. Second operand has 21 states, 16 states have (on average 1.0625) internal successors, (17), 16 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:17:20,666 INFO L87 Difference]: Start difference. First operand 21 states. Second operand has 21 states, 16 states have (on average 1.0625) internal successors, (17), 16 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:17:20,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:17:20,666 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2022-04-15 13:17:20,666 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2022-04-15 13:17:20,667 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:17:20,667 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:17:20,667 INFO L74 IsIncluded]: Start isIncluded. First operand has 21 states, 16 states have (on average 1.0625) internal successors, (17), 16 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 21 states. [2022-04-15 13:17:20,667 INFO L87 Difference]: Start difference. First operand has 21 states, 16 states have (on average 1.0625) internal successors, (17), 16 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 21 states. [2022-04-15 13:17:20,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:17:20,668 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2022-04-15 13:17:20,668 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2022-04-15 13:17:20,669 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:17:20,669 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:17:20,669 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 13:17:20,669 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 13:17:20,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 16 states have (on average 1.0625) internal successors, (17), 16 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:17:20,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2022-04-15 13:17:20,669 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 19 [2022-04-15 13:17:20,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 13:17:20,669 INFO L478 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2022-04-15 13:17:20,670 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 11 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:17:20,670 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 21 states and 21 transitions. [2022-04-15 13:17:20,689 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:17:20,689 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2022-04-15 13:17:20,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-15 13:17:20,690 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 13:17:20,690 INFO L499 BasicCegarLoop]: trace histogram [8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 13:17:20,706 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-04-15 13:17:20,903 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,SelfDestructingSolverStorable14,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 13:17:20,903 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 13:17:20,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 13:17:20,904 INFO L85 PathProgramCache]: Analyzing trace with hash -658014312, now seen corresponding path program 15 times [2022-04-15 13:17:20,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 13:17:20,904 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [825142005] [2022-04-15 13:17:21,240 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 13:17:21,242 INFO L85 PathProgramCache]: Analyzing trace with hash 442701031, now seen corresponding path program 1 times [2022-04-15 13:17:21,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:17:21,242 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1849980135] [2022-04-15 13:17:21,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:17:21,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:17:21,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 13:17:21,249 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 13:17:21,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 13:17:21,252 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 13:17:21,253 INFO L85 PathProgramCache]: Analyzing trace with hash -658014312, now seen corresponding path program 16 times [2022-04-15 13:17:21,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:17:21,253 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [433165770] [2022-04-15 13:17:21,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:17:21,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:17:21,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:17:21,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 13:17:21,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:17:21,559 INFO L290 TraceCheckUtils]: 0: Hoare triple {1955#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(26, 2); {1939#true} is VALID [2022-04-15 13:17:21,559 INFO L290 TraceCheckUtils]: 1: Hoare triple {1939#true} assume true; {1939#true} is VALID [2022-04-15 13:17:21,559 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1939#true} {1939#true} #45#return; {1939#true} is VALID [2022-04-15 13:17:21,559 INFO L272 TraceCheckUtils]: 0: Hoare triple {1939#true} call ULTIMATE.init(); {1955#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 13:17:21,560 INFO L290 TraceCheckUtils]: 1: Hoare triple {1955#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(26, 2); {1939#true} is VALID [2022-04-15 13:17:21,560 INFO L290 TraceCheckUtils]: 2: Hoare triple {1939#true} assume true; {1939#true} is VALID [2022-04-15 13:17:21,560 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1939#true} {1939#true} #45#return; {1939#true} is VALID [2022-04-15 13:17:21,560 INFO L272 TraceCheckUtils]: 4: Hoare triple {1939#true} call #t~ret5 := main(); {1939#true} is VALID [2022-04-15 13:17:21,560 INFO L290 TraceCheckUtils]: 5: Hoare triple {1939#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~i~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~n~0 := #t~nondet2;havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~sum~0 := #t~nondet3;havoc #t~nondet3; {1939#true} is VALID [2022-04-15 13:17:21,563 INFO L290 TraceCheckUtils]: 6: Hoare triple {1939#true} assume !!(((0 == ~i~0 && ~n~0 >= 0) && ~n~0 <= 100) && 0 == ~sum~0); {1944#(<= 0 (+ main_~sum~0 (* main_~i~0 8)))} is VALID [2022-04-15 13:17:21,564 INFO L290 TraceCheckUtils]: 7: Hoare triple {1944#(<= 0 (+ main_~sum~0 (* main_~i~0 8)))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1945#(<= 7 (+ (* 7 main_~i~0) main_~sum~0))} is VALID [2022-04-15 13:17:21,565 INFO L290 TraceCheckUtils]: 8: Hoare triple {1945#(<= 7 (+ (* 7 main_~i~0) main_~sum~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1946#(<= 13 (+ (* main_~i~0 6) main_~sum~0))} is VALID [2022-04-15 13:17:21,565 INFO L290 TraceCheckUtils]: 9: Hoare triple {1946#(<= 13 (+ (* main_~i~0 6) main_~sum~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1947#(<= 18 (+ (* 5 main_~i~0) main_~sum~0))} is VALID [2022-04-15 13:17:21,566 INFO L290 TraceCheckUtils]: 10: Hoare triple {1947#(<= 18 (+ (* 5 main_~i~0) main_~sum~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1948#(<= 22 (+ main_~sum~0 (* main_~i~0 4)))} is VALID [2022-04-15 13:17:21,567 INFO L290 TraceCheckUtils]: 11: Hoare triple {1948#(<= 22 (+ main_~sum~0 (* main_~i~0 4)))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1949#(<= 25 (+ main_~sum~0 (* main_~i~0 3)))} is VALID [2022-04-15 13:17:21,568 INFO L290 TraceCheckUtils]: 12: Hoare triple {1949#(<= 25 (+ main_~sum~0 (* main_~i~0 3)))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1950#(<= 27 (+ main_~sum~0 (* main_~i~0 2)))} is VALID [2022-04-15 13:17:21,568 INFO L290 TraceCheckUtils]: 13: Hoare triple {1950#(<= 27 (+ main_~sum~0 (* main_~i~0 2)))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1951#(<= 28 (+ main_~sum~0 main_~i~0))} is VALID [2022-04-15 13:17:21,569 INFO L290 TraceCheckUtils]: 14: Hoare triple {1951#(<= 28 (+ main_~sum~0 main_~i~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1952#(<= 28 main_~sum~0)} is VALID [2022-04-15 13:17:21,569 INFO L290 TraceCheckUtils]: 15: Hoare triple {1952#(<= 28 main_~sum~0)} assume !(~i~0 < ~n~0); {1952#(<= 28 main_~sum~0)} is VALID [2022-04-15 13:17:21,570 INFO L272 TraceCheckUtils]: 16: Hoare triple {1952#(<= 28 main_~sum~0)} call __VERIFIER_assert((if ~sum~0 >= 0 then 1 else 0)); {1953#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 13:17:21,570 INFO L290 TraceCheckUtils]: 17: Hoare triple {1953#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {1954#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 13:17:21,570 INFO L290 TraceCheckUtils]: 18: Hoare triple {1954#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {1940#false} is VALID [2022-04-15 13:17:21,571 INFO L290 TraceCheckUtils]: 19: Hoare triple {1940#false} assume !false; {1940#false} is VALID [2022-04-15 13:17:21,571 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 13:17:21,571 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 13:17:21,571 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [433165770] [2022-04-15 13:17:21,571 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [433165770] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 13:17:21,571 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [366070310] [2022-04-15 13:17:21,571 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 13:17:21,571 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 13:17:21,571 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 13:17:21,572 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) [2022-04-15 13:17:21,573 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-04-15 13:17:21,605 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 13:17:21,605 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 13:17:21,606 INFO L263 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 20 conjunts are in the unsatisfiable core [2022-04-15 13:17:21,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:17:21,617 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 13:17:22,248 INFO L272 TraceCheckUtils]: 0: Hoare triple {1939#true} call ULTIMATE.init(); {1939#true} is VALID [2022-04-15 13:17:22,249 INFO L290 TraceCheckUtils]: 1: Hoare triple {1939#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(26, 2); {1939#true} is VALID [2022-04-15 13:17:22,249 INFO L290 TraceCheckUtils]: 2: Hoare triple {1939#true} assume true; {1939#true} is VALID [2022-04-15 13:17:22,249 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1939#true} {1939#true} #45#return; {1939#true} is VALID [2022-04-15 13:17:22,249 INFO L272 TraceCheckUtils]: 4: Hoare triple {1939#true} call #t~ret5 := main(); {1939#true} is VALID [2022-04-15 13:17:22,249 INFO L290 TraceCheckUtils]: 5: Hoare triple {1939#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~i~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~n~0 := #t~nondet2;havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~sum~0 := #t~nondet3;havoc #t~nondet3; {1939#true} is VALID [2022-04-15 13:17:22,249 INFO L290 TraceCheckUtils]: 6: Hoare triple {1939#true} assume !!(((0 == ~i~0 && ~n~0 >= 0) && ~n~0 <= 100) && 0 == ~sum~0); {1977#(and (<= 0 main_~i~0) (<= 0 main_~sum~0))} is VALID [2022-04-15 13:17:22,250 INFO L290 TraceCheckUtils]: 7: Hoare triple {1977#(and (<= 0 main_~i~0) (<= 0 main_~sum~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1981#(and (<= 0 main_~sum~0) (<= 1 main_~i~0))} is VALID [2022-04-15 13:17:22,251 INFO L290 TraceCheckUtils]: 8: Hoare triple {1981#(and (<= 0 main_~sum~0) (<= 1 main_~i~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1985#(and (<= 2 main_~i~0) (<= 1 main_~sum~0))} is VALID [2022-04-15 13:17:22,252 INFO L290 TraceCheckUtils]: 9: Hoare triple {1985#(and (<= 2 main_~i~0) (<= 1 main_~sum~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1989#(and (<= 3 main_~sum~0) (<= 3 main_~i~0))} is VALID [2022-04-15 13:17:22,252 INFO L290 TraceCheckUtils]: 10: Hoare triple {1989#(and (<= 3 main_~sum~0) (<= 3 main_~i~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1993#(and (<= 6 main_~sum~0) (<= 4 main_~i~0))} is VALID [2022-04-15 13:17:22,253 INFO L290 TraceCheckUtils]: 11: Hoare triple {1993#(and (<= 6 main_~sum~0) (<= 4 main_~i~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1997#(and (<= 10 main_~sum~0) (<= 5 main_~i~0))} is VALID [2022-04-15 13:17:22,253 INFO L290 TraceCheckUtils]: 12: Hoare triple {1997#(and (<= 10 main_~sum~0) (<= 5 main_~i~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2001#(and (<= 15 main_~sum~0) (<= 6 main_~i~0))} is VALID [2022-04-15 13:17:22,254 INFO L290 TraceCheckUtils]: 13: Hoare triple {2001#(and (<= 15 main_~sum~0) (<= 6 main_~i~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2005#(and (<= 21 main_~sum~0) (<= 7 main_~i~0))} is VALID [2022-04-15 13:17:22,255 INFO L290 TraceCheckUtils]: 14: Hoare triple {2005#(and (<= 21 main_~sum~0) (<= 7 main_~i~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1952#(<= 28 main_~sum~0)} is VALID [2022-04-15 13:17:22,255 INFO L290 TraceCheckUtils]: 15: Hoare triple {1952#(<= 28 main_~sum~0)} assume !(~i~0 < ~n~0); {1952#(<= 28 main_~sum~0)} is VALID [2022-04-15 13:17:22,255 INFO L272 TraceCheckUtils]: 16: Hoare triple {1952#(<= 28 main_~sum~0)} call __VERIFIER_assert((if ~sum~0 >= 0 then 1 else 0)); {2015#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 13:17:22,256 INFO L290 TraceCheckUtils]: 17: Hoare triple {2015#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2019#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 13:17:22,256 INFO L290 TraceCheckUtils]: 18: Hoare triple {2019#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1940#false} is VALID [2022-04-15 13:17:22,256 INFO L290 TraceCheckUtils]: 19: Hoare triple {1940#false} assume !false; {1940#false} is VALID [2022-04-15 13:17:22,256 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 28 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 13:17:22,256 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 13:17:40,912 INFO L290 TraceCheckUtils]: 19: Hoare triple {1940#false} assume !false; {1940#false} is VALID [2022-04-15 13:17:40,913 INFO L290 TraceCheckUtils]: 18: Hoare triple {2019#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1940#false} is VALID [2022-04-15 13:17:40,913 INFO L290 TraceCheckUtils]: 17: Hoare triple {2015#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2019#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 13:17:40,913 INFO L272 TraceCheckUtils]: 16: Hoare triple {2035#(<= 0 main_~sum~0)} call __VERIFIER_assert((if ~sum~0 >= 0 then 1 else 0)); {2015#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 13:17:40,914 INFO L290 TraceCheckUtils]: 15: Hoare triple {2035#(<= 0 main_~sum~0)} assume !(~i~0 < ~n~0); {2035#(<= 0 main_~sum~0)} is VALID [2022-04-15 13:17:40,915 INFO L290 TraceCheckUtils]: 14: Hoare triple {2042#(<= 0 (+ main_~sum~0 main_~i~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2035#(<= 0 main_~sum~0)} is VALID [2022-04-15 13:17:40,916 INFO L290 TraceCheckUtils]: 13: Hoare triple {2046#(<= 0 (+ main_~sum~0 (* main_~i~0 2) 1))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2042#(<= 0 (+ main_~sum~0 main_~i~0))} is VALID [2022-04-15 13:17:40,917 INFO L290 TraceCheckUtils]: 12: Hoare triple {2050#(<= (div (+ main_~sum~0 main_~i~0 1) (- 2)) (+ main_~i~0 1))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2046#(<= 0 (+ main_~sum~0 (* main_~i~0 2) 1))} is VALID [2022-04-15 13:17:40,917 INFO L290 TraceCheckUtils]: 11: Hoare triple {2054#(<= (div main_~sum~0 (- 2)) (+ 3 (* main_~i~0 2)))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2050#(<= (div (+ main_~sum~0 main_~i~0 1) (- 2)) (+ main_~i~0 1))} is VALID [2022-04-15 13:17:40,918 INFO L290 TraceCheckUtils]: 10: Hoare triple {2058#(<= (div (+ (* (- 1) (div (+ (- 2) main_~sum~0 main_~i~0) (- 2))) 4) (- 2)) (+ main_~i~0 1))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2054#(<= (div main_~sum~0 (- 2)) (+ 3 (* main_~i~0 2)))} is VALID [2022-04-15 13:17:40,919 INFO L290 TraceCheckUtils]: 9: Hoare triple {2062#(<= (div (+ (- 1) (div (+ 5 main_~sum~0) 2) main_~i~0) (- 2)) (+ main_~i~0 3))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2058#(<= (div (+ (* (- 1) (div (+ (- 2) main_~sum~0 main_~i~0) (- 2))) 4) (- 2)) (+ main_~i~0 1))} is VALID [2022-04-15 13:17:40,921 INFO L290 TraceCheckUtils]: 8: Hoare triple {2066#(<= (div (+ (* (- 1) (div (+ main_~sum~0 main_~i~0 1) (- 2))) main_~i~0) (- 2)) (+ 5 main_~i~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2062#(<= (div (+ (- 1) (div (+ 5 main_~sum~0) 2) main_~i~0) (- 2)) (+ main_~i~0 3))} is VALID [2022-04-15 13:17:40,922 INFO L290 TraceCheckUtils]: 7: Hoare triple {2070#(<= (div (- (div main_~sum~0 (- 2))) (- 2)) (+ 7 (* main_~i~0 2)))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2066#(<= (div (+ (* (- 1) (div (+ main_~sum~0 main_~i~0 1) (- 2))) main_~i~0) (- 2)) (+ 5 main_~i~0))} is VALID [2022-04-15 13:17:40,922 INFO L290 TraceCheckUtils]: 6: Hoare triple {1939#true} assume !!(((0 == ~i~0 && ~n~0 >= 0) && ~n~0 <= 100) && 0 == ~sum~0); {2070#(<= (div (- (div main_~sum~0 (- 2))) (- 2)) (+ 7 (* main_~i~0 2)))} is VALID [2022-04-15 13:17:40,922 INFO L290 TraceCheckUtils]: 5: Hoare triple {1939#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~i~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~n~0 := #t~nondet2;havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~sum~0 := #t~nondet3;havoc #t~nondet3; {1939#true} is VALID [2022-04-15 13:17:40,922 INFO L272 TraceCheckUtils]: 4: Hoare triple {1939#true} call #t~ret5 := main(); {1939#true} is VALID [2022-04-15 13:17:40,922 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1939#true} {1939#true} #45#return; {1939#true} is VALID [2022-04-15 13:17:40,922 INFO L290 TraceCheckUtils]: 2: Hoare triple {1939#true} assume true; {1939#true} is VALID [2022-04-15 13:17:40,922 INFO L290 TraceCheckUtils]: 1: Hoare triple {1939#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(26, 2); {1939#true} is VALID [2022-04-15 13:17:40,922 INFO L272 TraceCheckUtils]: 0: Hoare triple {1939#true} call ULTIMATE.init(); {1939#true} is VALID [2022-04-15 13:17:40,923 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 13:17:40,923 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [366070310] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 13:17:40,923 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 13:17:40,923 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 13] total 33 [2022-04-15 13:17:40,923 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 13:17:40,923 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [825142005] [2022-04-15 13:17:40,923 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [825142005] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:17:40,923 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:17:40,923 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-04-15 13:17:40,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1719122450] [2022-04-15 13:17:40,924 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 13:17:40,924 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 12 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2022-04-15 13:17:40,924 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 13:17:40,924 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 14 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 12 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:17:40,939 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:17:40,940 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-15 13:17:40,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 13:17:40,940 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-15 13:17:40,940 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=846, Unknown=0, NotChecked=0, Total=1056 [2022-04-15 13:17:40,940 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand has 14 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 12 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:17:42,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:17:42,189 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2022-04-15 13:17:42,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-04-15 13:17:42,189 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 12 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2022-04-15 13:17:42,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 13:17:42,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 12 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:17:42,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 27 transitions. [2022-04-15 13:17:42,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 12 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:17:42,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 27 transitions. [2022-04-15 13:17:42,191 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 27 transitions. [2022-04-15 13:17:42,220 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:17:42,221 INFO L225 Difference]: With dead ends: 27 [2022-04-15 13:17:42,221 INFO L226 Difference]: Without dead ends: 22 [2022-04-15 13:17:42,221 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 22 SyntacticMatches, 1 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 376 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=265, Invalid=1627, Unknown=0, NotChecked=0, Total=1892 [2022-04-15 13:17:42,222 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 10 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 178 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 190 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 178 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-15 13:17:42,222 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 68 Invalid, 190 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 178 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-15 13:17:42,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2022-04-15 13:17:42,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2022-04-15 13:17:42,247 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 13:17:42,247 INFO L82 GeneralOperation]: Start isEquivalent. First operand 22 states. Second operand has 22 states, 17 states have (on average 1.0588235294117647) internal successors, (18), 17 states have internal predecessors, (18), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:17:42,247 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand has 22 states, 17 states have (on average 1.0588235294117647) internal successors, (18), 17 states have internal predecessors, (18), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:17:42,247 INFO L87 Difference]: Start difference. First operand 22 states. Second operand has 22 states, 17 states have (on average 1.0588235294117647) internal successors, (18), 17 states have internal predecessors, (18), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:17:42,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:17:42,249 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2022-04-15 13:17:42,249 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2022-04-15 13:17:42,249 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:17:42,249 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:17:42,249 INFO L74 IsIncluded]: Start isIncluded. First operand has 22 states, 17 states have (on average 1.0588235294117647) internal successors, (18), 17 states have internal predecessors, (18), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 22 states. [2022-04-15 13:17:42,249 INFO L87 Difference]: Start difference. First operand has 22 states, 17 states have (on average 1.0588235294117647) internal successors, (18), 17 states have internal predecessors, (18), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 22 states. [2022-04-15 13:17:42,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:17:42,250 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2022-04-15 13:17:42,250 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2022-04-15 13:17:42,250 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:17:42,250 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:17:42,250 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 13:17:42,250 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 13:17:42,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 17 states have (on average 1.0588235294117647) internal successors, (18), 17 states have internal predecessors, (18), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:17:42,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 22 transitions. [2022-04-15 13:17:42,259 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 22 transitions. Word has length 20 [2022-04-15 13:17:42,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 13:17:42,259 INFO L478 AbstractCegarLoop]: Abstraction has 22 states and 22 transitions. [2022-04-15 13:17:42,260 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 12 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:17:42,260 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 22 states and 22 transitions. [2022-04-15 13:17:42,284 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:17:42,284 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2022-04-15 13:17:42,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-04-15 13:17:42,284 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 13:17:42,284 INFO L499 BasicCegarLoop]: trace histogram [9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 13:17:42,300 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-04-15 13:17:42,485 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15,SelfDestructingSolverStorable16 [2022-04-15 13:17:42,485 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 13:17:42,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 13:17:42,485 INFO L85 PathProgramCache]: Analyzing trace with hash 1111781638, now seen corresponding path program 17 times [2022-04-15 13:17:42,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 13:17:42,485 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [573801777] [2022-04-15 13:17:42,822 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 13:17:42,823 INFO L85 PathProgramCache]: Analyzing trace with hash 501806375, now seen corresponding path program 1 times [2022-04-15 13:17:42,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:17:42,823 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1582811227] [2022-04-15 13:17:42,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:17:42,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:17:42,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 13:17:42,830 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 13:17:42,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 13:17:42,833 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 13:17:42,834 INFO L85 PathProgramCache]: Analyzing trace with hash 1111781638, now seen corresponding path program 18 times [2022-04-15 13:17:42,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:17:42,834 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [412611145] [2022-04-15 13:17:42,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:17:42,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:17:42,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:17:43,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 13:17:43,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:17:43,168 INFO L290 TraceCheckUtils]: 0: Hoare triple {2275#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(26, 2); {2258#true} is VALID [2022-04-15 13:17:43,168 INFO L290 TraceCheckUtils]: 1: Hoare triple {2258#true} assume true; {2258#true} is VALID [2022-04-15 13:17:43,168 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2258#true} {2258#true} #45#return; {2258#true} is VALID [2022-04-15 13:17:43,168 INFO L272 TraceCheckUtils]: 0: Hoare triple {2258#true} call ULTIMATE.init(); {2275#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 13:17:43,168 INFO L290 TraceCheckUtils]: 1: Hoare triple {2275#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(26, 2); {2258#true} is VALID [2022-04-15 13:17:43,168 INFO L290 TraceCheckUtils]: 2: Hoare triple {2258#true} assume true; {2258#true} is VALID [2022-04-15 13:17:43,169 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2258#true} {2258#true} #45#return; {2258#true} is VALID [2022-04-15 13:17:43,169 INFO L272 TraceCheckUtils]: 4: Hoare triple {2258#true} call #t~ret5 := main(); {2258#true} is VALID [2022-04-15 13:17:43,169 INFO L290 TraceCheckUtils]: 5: Hoare triple {2258#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~i~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~n~0 := #t~nondet2;havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~sum~0 := #t~nondet3;havoc #t~nondet3; {2258#true} is VALID [2022-04-15 13:17:43,169 INFO L290 TraceCheckUtils]: 6: Hoare triple {2258#true} assume !!(((0 == ~i~0 && ~n~0 >= 0) && ~n~0 <= 100) && 0 == ~sum~0); {2263#(<= 0 (+ (* main_~i~0 9) main_~sum~0))} is VALID [2022-04-15 13:17:43,170 INFO L290 TraceCheckUtils]: 7: Hoare triple {2263#(<= 0 (+ (* main_~i~0 9) main_~sum~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2264#(<= 8 (+ main_~sum~0 (* main_~i~0 8)))} is VALID [2022-04-15 13:17:43,171 INFO L290 TraceCheckUtils]: 8: Hoare triple {2264#(<= 8 (+ main_~sum~0 (* main_~i~0 8)))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2265#(<= 15 (+ (* 7 main_~i~0) main_~sum~0))} is VALID [2022-04-15 13:17:43,172 INFO L290 TraceCheckUtils]: 9: Hoare triple {2265#(<= 15 (+ (* 7 main_~i~0) main_~sum~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2266#(<= 21 (+ (* main_~i~0 6) main_~sum~0))} is VALID [2022-04-15 13:17:43,172 INFO L290 TraceCheckUtils]: 10: Hoare triple {2266#(<= 21 (+ (* main_~i~0 6) main_~sum~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2267#(<= 26 (+ (* 5 main_~i~0) main_~sum~0))} is VALID [2022-04-15 13:17:43,173 INFO L290 TraceCheckUtils]: 11: Hoare triple {2267#(<= 26 (+ (* 5 main_~i~0) main_~sum~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2268#(<= 30 (+ main_~sum~0 (* main_~i~0 4)))} is VALID [2022-04-15 13:17:43,174 INFO L290 TraceCheckUtils]: 12: Hoare triple {2268#(<= 30 (+ main_~sum~0 (* main_~i~0 4)))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2269#(<= 33 (+ main_~sum~0 (* main_~i~0 3)))} is VALID [2022-04-15 13:17:43,174 INFO L290 TraceCheckUtils]: 13: Hoare triple {2269#(<= 33 (+ main_~sum~0 (* main_~i~0 3)))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2270#(<= 35 (+ main_~sum~0 (* main_~i~0 2)))} is VALID [2022-04-15 13:17:43,175 INFO L290 TraceCheckUtils]: 14: Hoare triple {2270#(<= 35 (+ main_~sum~0 (* main_~i~0 2)))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2271#(<= 36 (+ main_~sum~0 main_~i~0))} is VALID [2022-04-15 13:17:43,176 INFO L290 TraceCheckUtils]: 15: Hoare triple {2271#(<= 36 (+ main_~sum~0 main_~i~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2272#(<= 36 main_~sum~0)} is VALID [2022-04-15 13:17:43,176 INFO L290 TraceCheckUtils]: 16: Hoare triple {2272#(<= 36 main_~sum~0)} assume !(~i~0 < ~n~0); {2272#(<= 36 main_~sum~0)} is VALID [2022-04-15 13:17:43,177 INFO L272 TraceCheckUtils]: 17: Hoare triple {2272#(<= 36 main_~sum~0)} call __VERIFIER_assert((if ~sum~0 >= 0 then 1 else 0)); {2273#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 13:17:43,177 INFO L290 TraceCheckUtils]: 18: Hoare triple {2273#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {2274#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 13:17:43,177 INFO L290 TraceCheckUtils]: 19: Hoare triple {2274#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {2259#false} is VALID [2022-04-15 13:17:43,177 INFO L290 TraceCheckUtils]: 20: Hoare triple {2259#false} assume !false; {2259#false} is VALID [2022-04-15 13:17:43,178 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 13:17:43,178 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 13:17:43,178 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [412611145] [2022-04-15 13:17:43,178 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [412611145] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 13:17:43,178 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1983161335] [2022-04-15 13:17:43,178 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 13:17:43,178 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 13:17:43,178 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 13:17:43,179 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) [2022-04-15 13:17:43,180 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-04-15 13:17:43,213 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2022-04-15 13:17:43,213 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 13:17:43,214 INFO L263 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 24 conjunts are in the unsatisfiable core [2022-04-15 13:17:43,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:17:43,226 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 13:17:44,424 INFO L272 TraceCheckUtils]: 0: Hoare triple {2258#true} call ULTIMATE.init(); {2258#true} is VALID [2022-04-15 13:17:44,425 INFO L290 TraceCheckUtils]: 1: Hoare triple {2258#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(26, 2); {2258#true} is VALID [2022-04-15 13:17:44,425 INFO L290 TraceCheckUtils]: 2: Hoare triple {2258#true} assume true; {2258#true} is VALID [2022-04-15 13:17:44,425 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2258#true} {2258#true} #45#return; {2258#true} is VALID [2022-04-15 13:17:44,425 INFO L272 TraceCheckUtils]: 4: Hoare triple {2258#true} call #t~ret5 := main(); {2258#true} is VALID [2022-04-15 13:17:44,425 INFO L290 TraceCheckUtils]: 5: Hoare triple {2258#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~i~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~n~0 := #t~nondet2;havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~sum~0 := #t~nondet3;havoc #t~nondet3; {2258#true} is VALID [2022-04-15 13:17:44,425 INFO L290 TraceCheckUtils]: 6: Hoare triple {2258#true} assume !!(((0 == ~i~0 && ~n~0 >= 0) && ~n~0 <= 100) && 0 == ~sum~0); {2297#(and (<= 0 main_~i~0) (<= 0 main_~sum~0))} is VALID [2022-04-15 13:17:44,427 INFO L290 TraceCheckUtils]: 7: Hoare triple {2297#(and (<= 0 main_~i~0) (<= 0 main_~sum~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2301#(and (<= 0 main_~sum~0) (<= 1 main_~i~0))} is VALID [2022-04-15 13:17:44,427 INFO L290 TraceCheckUtils]: 8: Hoare triple {2301#(and (<= 0 main_~sum~0) (<= 1 main_~i~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2305#(and (<= 2 main_~i~0) (<= 1 main_~sum~0))} is VALID [2022-04-15 13:17:44,428 INFO L290 TraceCheckUtils]: 9: Hoare triple {2305#(and (<= 2 main_~i~0) (<= 1 main_~sum~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2309#(and (<= 3 main_~sum~0) (<= 3 main_~i~0))} is VALID [2022-04-15 13:17:44,429 INFO L290 TraceCheckUtils]: 10: Hoare triple {2309#(and (<= 3 main_~sum~0) (<= 3 main_~i~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2313#(and (<= 6 main_~sum~0) (<= 4 main_~i~0))} is VALID [2022-04-15 13:17:44,429 INFO L290 TraceCheckUtils]: 11: Hoare triple {2313#(and (<= 6 main_~sum~0) (<= 4 main_~i~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2317#(and (<= 10 main_~sum~0) (<= 5 main_~i~0))} is VALID [2022-04-15 13:17:44,431 INFO L290 TraceCheckUtils]: 12: Hoare triple {2317#(and (<= 10 main_~sum~0) (<= 5 main_~i~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2321#(and (< 5 main_~n~0) (<= 15 main_~sum~0) (<= 6 main_~i~0))} is VALID [2022-04-15 13:17:44,432 INFO L290 TraceCheckUtils]: 13: Hoare triple {2321#(and (< 5 main_~n~0) (<= 15 main_~sum~0) (<= 6 main_~i~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2325#(and (< 5 main_~n~0) (<= 21 main_~sum~0))} is VALID [2022-04-15 13:17:44,433 INFO L290 TraceCheckUtils]: 14: Hoare triple {2325#(and (< 5 main_~n~0) (<= 21 main_~sum~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2329#(and (< 5 main_~n~0) (<= (+ main_~i~0 20) main_~sum~0))} is VALID [2022-04-15 13:17:44,434 INFO L290 TraceCheckUtils]: 15: Hoare triple {2329#(and (< 5 main_~n~0) (<= (+ main_~i~0 20) main_~sum~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2333#(and (< 5 main_~n~0) (<= main_~i~0 (+ (div (+ (- 20) main_~sum~0) 2) 1)))} is VALID [2022-04-15 13:17:44,434 INFO L290 TraceCheckUtils]: 16: Hoare triple {2333#(and (< 5 main_~n~0) (<= main_~i~0 (+ (div (+ (- 20) main_~sum~0) 2) 1)))} assume !(~i~0 < ~n~0); {2337#(< 4 (div (+ (- 20) main_~sum~0) 2))} is VALID [2022-04-15 13:17:44,435 INFO L272 TraceCheckUtils]: 17: Hoare triple {2337#(< 4 (div (+ (- 20) main_~sum~0) 2))} call __VERIFIER_assert((if ~sum~0 >= 0 then 1 else 0)); {2341#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 13:17:44,435 INFO L290 TraceCheckUtils]: 18: Hoare triple {2341#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2345#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 13:17:44,436 INFO L290 TraceCheckUtils]: 19: Hoare triple {2345#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2259#false} is VALID [2022-04-15 13:17:44,436 INFO L290 TraceCheckUtils]: 20: Hoare triple {2259#false} assume !false; {2259#false} is VALID [2022-04-15 13:17:44,436 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 21 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 13:17:44,436 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 13:17:51,621 INFO L290 TraceCheckUtils]: 20: Hoare triple {2259#false} assume !false; {2259#false} is VALID [2022-04-15 13:17:51,622 INFO L290 TraceCheckUtils]: 19: Hoare triple {2345#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2259#false} is VALID [2022-04-15 13:17:51,622 INFO L290 TraceCheckUtils]: 18: Hoare triple {2341#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2345#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 13:17:51,623 INFO L272 TraceCheckUtils]: 17: Hoare triple {2361#(<= 0 main_~sum~0)} call __VERIFIER_assert((if ~sum~0 >= 0 then 1 else 0)); {2341#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 13:17:51,623 INFO L290 TraceCheckUtils]: 16: Hoare triple {2365#(or (< main_~i~0 main_~n~0) (<= 0 main_~sum~0))} assume !(~i~0 < ~n~0); {2361#(<= 0 main_~sum~0)} is VALID [2022-04-15 13:17:51,625 INFO L290 TraceCheckUtils]: 15: Hoare triple {2369#(or (<= 0 (+ main_~sum~0 main_~i~0)) (< (+ main_~i~0 1) main_~n~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2365#(or (< main_~i~0 main_~n~0) (<= 0 main_~sum~0))} is VALID [2022-04-15 13:17:51,625 INFO L290 TraceCheckUtils]: 14: Hoare triple {2373#(<= 3 (+ main_~sum~0 (* main_~n~0 2)))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2369#(or (<= 0 (+ main_~sum~0 main_~i~0)) (< (+ main_~i~0 1) main_~n~0))} is VALID [2022-04-15 13:17:51,626 INFO L290 TraceCheckUtils]: 13: Hoare triple {2377#(<= 3 (+ main_~sum~0 main_~i~0 (* main_~n~0 2)))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2373#(<= 3 (+ main_~sum~0 (* main_~n~0 2)))} is VALID [2022-04-15 13:17:51,627 INFO L290 TraceCheckUtils]: 12: Hoare triple {2381#(<= (div (+ (- 2) main_~sum~0) (- 2)) (+ (* main_~i~0 2) 1))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2377#(<= 3 (+ main_~sum~0 main_~i~0 (* main_~n~0 2)))} is VALID [2022-04-15 13:17:51,628 INFO L290 TraceCheckUtils]: 11: Hoare triple {2385#(<= (div (+ 2 (* (- 1) (div (+ main_~sum~0 main_~i~0 (- 4)) (- 2)))) (- 2)) (+ main_~i~0 1))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2381#(<= (div (+ (- 2) main_~sum~0) (- 2)) (+ (* main_~i~0 2) 1))} is VALID [2022-04-15 13:17:51,629 INFO L290 TraceCheckUtils]: 10: Hoare triple {2389#(<= (div (+ (- 1) (div (+ (- 1) main_~sum~0) 2) main_~i~0) (- 2)) (+ main_~i~0 3))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2385#(<= (div (+ 2 (* (- 1) (div (+ main_~sum~0 main_~i~0 (- 4)) (- 2)))) (- 2)) (+ main_~i~0 1))} is VALID [2022-04-15 13:17:51,630 INFO L290 TraceCheckUtils]: 9: Hoare triple {2393#(<= (div (+ main_~i~0 (* (- 1) (div (+ main_~sum~0 main_~i~0 (- 5)) (- 2)))) (- 2)) (+ 5 main_~i~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2389#(<= (div (+ (- 1) (div (+ (- 1) main_~sum~0) 2) main_~i~0) (- 2)) (+ main_~i~0 3))} is VALID [2022-04-15 13:17:53,664 WARN L290 TraceCheckUtils]: 8: Hoare triple {2397#(forall ((v_main_~i~0_113 Int) (aux_div_aux_div_v_main_~sum~0_123_55_70 Int)) (or (<= aux_div_aux_div_v_main_~sum~0_123_55_70 (+ 5 v_main_~i~0_113)) (<= 1 (+ (div (+ main_~sum~0 main_~i~0 (- 7) (* 3 v_main_~i~0_113)) 2) (* aux_div_aux_div_v_main_~sum~0_123_55_70 2))) (not (<= (+ main_~i~0 1) v_main_~i~0_113))))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2393#(<= (div (+ main_~i~0 (* (- 1) (div (+ main_~sum~0 main_~i~0 (- 5)) (- 2)))) (- 2)) (+ 5 main_~i~0))} is UNKNOWN [2022-04-15 13:17:55,668 WARN L290 TraceCheckUtils]: 7: Hoare triple {2401#(forall ((v_main_~i~0_113 Int) (aux_div_aux_div_v_main_~sum~0_124_73_50 Int)) (or (<= aux_div_aux_div_v_main_~sum~0_124_73_50 (+ 6 v_main_~i~0_113)) (<= 1 (+ main_~i~0 (div (+ main_~sum~0 (* 3 v_main_~i~0_113) (- 10)) 2) (* aux_div_aux_div_v_main_~sum~0_124_73_50 2))) (< v_main_~i~0_113 (+ main_~i~0 2))))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2397#(forall ((v_main_~i~0_113 Int) (aux_div_aux_div_v_main_~sum~0_123_55_70 Int)) (or (<= aux_div_aux_div_v_main_~sum~0_123_55_70 (+ 5 v_main_~i~0_113)) (<= 1 (+ (div (+ main_~sum~0 main_~i~0 (- 7) (* 3 v_main_~i~0_113)) 2) (* aux_div_aux_div_v_main_~sum~0_123_55_70 2))) (not (<= (+ main_~i~0 1) v_main_~i~0_113))))} is UNKNOWN [2022-04-15 13:17:55,670 INFO L290 TraceCheckUtils]: 6: Hoare triple {2258#true} assume !!(((0 == ~i~0 && ~n~0 >= 0) && ~n~0 <= 100) && 0 == ~sum~0); {2401#(forall ((v_main_~i~0_113 Int) (aux_div_aux_div_v_main_~sum~0_124_73_50 Int)) (or (<= aux_div_aux_div_v_main_~sum~0_124_73_50 (+ 6 v_main_~i~0_113)) (<= 1 (+ main_~i~0 (div (+ main_~sum~0 (* 3 v_main_~i~0_113) (- 10)) 2) (* aux_div_aux_div_v_main_~sum~0_124_73_50 2))) (< v_main_~i~0_113 (+ main_~i~0 2))))} is VALID [2022-04-15 13:17:55,670 INFO L290 TraceCheckUtils]: 5: Hoare triple {2258#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~i~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~n~0 := #t~nondet2;havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~sum~0 := #t~nondet3;havoc #t~nondet3; {2258#true} is VALID [2022-04-15 13:17:55,670 INFO L272 TraceCheckUtils]: 4: Hoare triple {2258#true} call #t~ret5 := main(); {2258#true} is VALID [2022-04-15 13:17:55,670 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2258#true} {2258#true} #45#return; {2258#true} is VALID [2022-04-15 13:17:55,670 INFO L290 TraceCheckUtils]: 2: Hoare triple {2258#true} assume true; {2258#true} is VALID [2022-04-15 13:17:55,670 INFO L290 TraceCheckUtils]: 1: Hoare triple {2258#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(26, 2); {2258#true} is VALID [2022-04-15 13:17:55,670 INFO L272 TraceCheckUtils]: 0: Hoare triple {2258#true} call ULTIMATE.init(); {2258#true} is VALID [2022-04-15 13:17:55,670 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 13:17:55,671 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1983161335] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 13:17:55,671 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 13:17:55,671 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 39 [2022-04-15 13:17:55,671 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 13:17:55,671 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [573801777] [2022-04-15 13:17:55,671 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [573801777] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:17:55,671 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:17:55,671 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-04-15 13:17:55,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [955207662] [2022-04-15 13:17:55,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 13:17:55,672 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 13 states have internal predecessors, (17), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2022-04-15 13:17:55,672 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 13:17:55,672 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 15 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 13 states have internal predecessors, (17), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:17:55,687 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:17:55,687 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-04-15 13:17:55,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 13:17:55,687 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-04-15 13:17:55,687 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=212, Invalid=1269, Unknown=1, NotChecked=0, Total=1482 [2022-04-15 13:17:55,688 INFO L87 Difference]: Start difference. First operand 22 states and 22 transitions. Second operand has 15 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 13 states have internal predecessors, (17), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:17:57,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:17:57,019 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2022-04-15 13:17:57,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-04-15 13:17:57,020 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 13 states have internal predecessors, (17), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2022-04-15 13:17:57,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 13:17:57,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 13 states have internal predecessors, (17), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:17:57,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 28 transitions. [2022-04-15 13:17:57,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 13 states have internal predecessors, (17), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:17:57,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 28 transitions. [2022-04-15 13:17:57,021 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 28 transitions. [2022-04-15 13:17:57,046 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:17:57,047 INFO L225 Difference]: With dead ends: 28 [2022-04-15 13:17:57,047 INFO L226 Difference]: Without dead ends: 23 [2022-04-15 13:17:57,048 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 19 SyntacticMatches, 1 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 434 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=272, Invalid=2277, Unknown=1, NotChecked=0, Total=2550 [2022-04-15 13:17:57,048 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 10 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 206 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 219 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 206 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-15 13:17:57,048 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 73 Invalid, 219 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 206 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-15 13:17:57,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2022-04-15 13:17:57,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2022-04-15 13:17:57,073 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 13:17:57,073 INFO L82 GeneralOperation]: Start isEquivalent. First operand 23 states. Second operand has 23 states, 18 states have (on average 1.0555555555555556) internal successors, (19), 18 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:17:57,073 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand has 23 states, 18 states have (on average 1.0555555555555556) internal successors, (19), 18 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:17:57,073 INFO L87 Difference]: Start difference. First operand 23 states. Second operand has 23 states, 18 states have (on average 1.0555555555555556) internal successors, (19), 18 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:17:57,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:17:57,074 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2022-04-15 13:17:57,074 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2022-04-15 13:17:57,075 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:17:57,075 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:17:57,075 INFO L74 IsIncluded]: Start isIncluded. First operand has 23 states, 18 states have (on average 1.0555555555555556) internal successors, (19), 18 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 23 states. [2022-04-15 13:17:57,075 INFO L87 Difference]: Start difference. First operand has 23 states, 18 states have (on average 1.0555555555555556) internal successors, (19), 18 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 23 states. [2022-04-15 13:17:57,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:17:57,076 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2022-04-15 13:17:57,076 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2022-04-15 13:17:57,076 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:17:57,076 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:17:57,076 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 13:17:57,076 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 13:17:57,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 18 states have (on average 1.0555555555555556) internal successors, (19), 18 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:17:57,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions. [2022-04-15 13:17:57,077 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 23 transitions. Word has length 21 [2022-04-15 13:17:57,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 13:17:57,077 INFO L478 AbstractCegarLoop]: Abstraction has 23 states and 23 transitions. [2022-04-15 13:17:57,077 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 13 states have internal predecessors, (17), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:17:57,077 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 23 states and 23 transitions. [2022-04-15 13:17:57,104 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:17:57,105 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2022-04-15 13:17:57,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-15 13:17:57,105 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 13:17:57,105 INFO L499 BasicCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 13:17:57,121 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-04-15 13:17:57,305 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-04-15 13:17:57,306 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 13:17:57,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 13:17:57,306 INFO L85 PathProgramCache]: Analyzing trace with hash 140881240, now seen corresponding path program 19 times [2022-04-15 13:17:57,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 13:17:57,306 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [414215291] [2022-04-15 13:17:57,618 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 13:17:57,619 INFO L85 PathProgramCache]: Analyzing trace with hash 560911719, now seen corresponding path program 1 times [2022-04-15 13:17:57,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:17:57,619 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [956064030] [2022-04-15 13:17:57,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:17:57,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:17:57,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 13:17:57,625 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 13:17:57,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 13:17:57,628 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 13:17:57,628 INFO L85 PathProgramCache]: Analyzing trace with hash 140881240, now seen corresponding path program 20 times [2022-04-15 13:17:57,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:17:57,628 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1164460932] [2022-04-15 13:17:57,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:17:57,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:17:57,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:17:57,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 13:17:57,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:17:57,967 INFO L290 TraceCheckUtils]: 0: Hoare triple {2615#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(26, 2); {2597#true} is VALID [2022-04-15 13:17:57,967 INFO L290 TraceCheckUtils]: 1: Hoare triple {2597#true} assume true; {2597#true} is VALID [2022-04-15 13:17:57,968 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2597#true} {2597#true} #45#return; {2597#true} is VALID [2022-04-15 13:17:57,968 INFO L272 TraceCheckUtils]: 0: Hoare triple {2597#true} call ULTIMATE.init(); {2615#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 13:17:57,968 INFO L290 TraceCheckUtils]: 1: Hoare triple {2615#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(26, 2); {2597#true} is VALID [2022-04-15 13:17:57,968 INFO L290 TraceCheckUtils]: 2: Hoare triple {2597#true} assume true; {2597#true} is VALID [2022-04-15 13:17:57,969 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2597#true} {2597#true} #45#return; {2597#true} is VALID [2022-04-15 13:17:57,970 INFO L272 TraceCheckUtils]: 4: Hoare triple {2597#true} call #t~ret5 := main(); {2597#true} is VALID [2022-04-15 13:17:57,970 INFO L290 TraceCheckUtils]: 5: Hoare triple {2597#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~i~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~n~0 := #t~nondet2;havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~sum~0 := #t~nondet3;havoc #t~nondet3; {2597#true} is VALID [2022-04-15 13:17:57,975 INFO L290 TraceCheckUtils]: 6: Hoare triple {2597#true} assume !!(((0 == ~i~0 && ~n~0 >= 0) && ~n~0 <= 100) && 0 == ~sum~0); {2602#(<= 0 (+ main_~sum~0 (* main_~i~0 10)))} is VALID [2022-04-15 13:17:57,977 INFO L290 TraceCheckUtils]: 7: Hoare triple {2602#(<= 0 (+ main_~sum~0 (* main_~i~0 10)))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2603#(<= 9 (+ (* main_~i~0 9) main_~sum~0))} is VALID [2022-04-15 13:17:57,977 INFO L290 TraceCheckUtils]: 8: Hoare triple {2603#(<= 9 (+ (* main_~i~0 9) main_~sum~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2604#(<= 17 (+ main_~sum~0 (* main_~i~0 8)))} is VALID [2022-04-15 13:17:57,978 INFO L290 TraceCheckUtils]: 9: Hoare triple {2604#(<= 17 (+ main_~sum~0 (* main_~i~0 8)))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2605#(<= 24 (+ (* 7 main_~i~0) main_~sum~0))} is VALID [2022-04-15 13:17:57,979 INFO L290 TraceCheckUtils]: 10: Hoare triple {2605#(<= 24 (+ (* 7 main_~i~0) main_~sum~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2606#(<= 30 (+ (* main_~i~0 6) main_~sum~0))} is VALID [2022-04-15 13:17:57,979 INFO L290 TraceCheckUtils]: 11: Hoare triple {2606#(<= 30 (+ (* main_~i~0 6) main_~sum~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2607#(<= 35 (+ (* 5 main_~i~0) main_~sum~0))} is VALID [2022-04-15 13:17:57,980 INFO L290 TraceCheckUtils]: 12: Hoare triple {2607#(<= 35 (+ (* 5 main_~i~0) main_~sum~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2608#(<= 39 (+ main_~sum~0 (* main_~i~0 4)))} is VALID [2022-04-15 13:17:57,981 INFO L290 TraceCheckUtils]: 13: Hoare triple {2608#(<= 39 (+ main_~sum~0 (* main_~i~0 4)))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2609#(<= 42 (+ main_~sum~0 (* main_~i~0 3)))} is VALID [2022-04-15 13:17:57,982 INFO L290 TraceCheckUtils]: 14: Hoare triple {2609#(<= 42 (+ main_~sum~0 (* main_~i~0 3)))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2610#(<= 44 (+ main_~sum~0 (* main_~i~0 2)))} is VALID [2022-04-15 13:17:57,983 INFO L290 TraceCheckUtils]: 15: Hoare triple {2610#(<= 44 (+ main_~sum~0 (* main_~i~0 2)))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2611#(<= 45 (+ main_~sum~0 main_~i~0))} is VALID [2022-04-15 13:17:57,984 INFO L290 TraceCheckUtils]: 16: Hoare triple {2611#(<= 45 (+ main_~sum~0 main_~i~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2612#(<= 45 main_~sum~0)} is VALID [2022-04-15 13:17:57,984 INFO L290 TraceCheckUtils]: 17: Hoare triple {2612#(<= 45 main_~sum~0)} assume !(~i~0 < ~n~0); {2612#(<= 45 main_~sum~0)} is VALID [2022-04-15 13:17:57,984 INFO L272 TraceCheckUtils]: 18: Hoare triple {2612#(<= 45 main_~sum~0)} call __VERIFIER_assert((if ~sum~0 >= 0 then 1 else 0)); {2613#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 13:17:57,985 INFO L290 TraceCheckUtils]: 19: Hoare triple {2613#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {2614#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 13:17:57,985 INFO L290 TraceCheckUtils]: 20: Hoare triple {2614#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {2598#false} is VALID [2022-04-15 13:17:57,985 INFO L290 TraceCheckUtils]: 21: Hoare triple {2598#false} assume !false; {2598#false} is VALID [2022-04-15 13:17:57,985 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 13:17:57,985 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 13:17:57,985 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1164460932] [2022-04-15 13:17:57,986 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1164460932] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 13:17:57,986 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [875498841] [2022-04-15 13:17:57,986 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 13:17:57,986 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 13:17:57,986 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 13:17:57,987 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) [2022-04-15 13:17:57,990 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-04-15 13:17:58,024 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 13:17:58,024 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 13:17:58,024 INFO L263 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 26 conjunts are in the unsatisfiable core [2022-04-15 13:17:58,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:17:58,060 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 13:17:58,999 INFO L272 TraceCheckUtils]: 0: Hoare triple {2597#true} call ULTIMATE.init(); {2597#true} is VALID [2022-04-15 13:17:58,999 INFO L290 TraceCheckUtils]: 1: Hoare triple {2597#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(26, 2); {2597#true} is VALID [2022-04-15 13:17:58,999 INFO L290 TraceCheckUtils]: 2: Hoare triple {2597#true} assume true; {2597#true} is VALID [2022-04-15 13:17:58,999 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2597#true} {2597#true} #45#return; {2597#true} is VALID [2022-04-15 13:17:58,999 INFO L272 TraceCheckUtils]: 4: Hoare triple {2597#true} call #t~ret5 := main(); {2597#true} is VALID [2022-04-15 13:17:59,000 INFO L290 TraceCheckUtils]: 5: Hoare triple {2597#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~i~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~n~0 := #t~nondet2;havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~sum~0 := #t~nondet3;havoc #t~nondet3; {2597#true} is VALID [2022-04-15 13:17:59,000 INFO L290 TraceCheckUtils]: 6: Hoare triple {2597#true} assume !!(((0 == ~i~0 && ~n~0 >= 0) && ~n~0 <= 100) && 0 == ~sum~0); {2637#(and (<= 0 main_~i~0) (<= 0 main_~sum~0))} is VALID [2022-04-15 13:17:59,001 INFO L290 TraceCheckUtils]: 7: Hoare triple {2637#(and (<= 0 main_~i~0) (<= 0 main_~sum~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2641#(and (<= 0 main_~sum~0) (<= 1 main_~i~0))} is VALID [2022-04-15 13:17:59,002 INFO L290 TraceCheckUtils]: 8: Hoare triple {2641#(and (<= 0 main_~sum~0) (<= 1 main_~i~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2645#(and (<= 2 main_~i~0) (<= 1 main_~sum~0))} is VALID [2022-04-15 13:17:59,003 INFO L290 TraceCheckUtils]: 9: Hoare triple {2645#(and (<= 2 main_~i~0) (<= 1 main_~sum~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2649#(and (<= 3 main_~sum~0) (<= 3 main_~i~0))} is VALID [2022-04-15 13:17:59,003 INFO L290 TraceCheckUtils]: 10: Hoare triple {2649#(and (<= 3 main_~sum~0) (<= 3 main_~i~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2653#(and (<= 6 main_~sum~0) (<= 4 main_~i~0))} is VALID [2022-04-15 13:17:59,004 INFO L290 TraceCheckUtils]: 11: Hoare triple {2653#(and (<= 6 main_~sum~0) (<= 4 main_~i~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2657#(and (<= 10 main_~sum~0) (<= 5 main_~i~0))} is VALID [2022-04-15 13:17:59,005 INFO L290 TraceCheckUtils]: 12: Hoare triple {2657#(and (<= 10 main_~sum~0) (<= 5 main_~i~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2661#(and (<= 15 main_~sum~0) (<= 6 main_~i~0))} is VALID [2022-04-15 13:17:59,005 INFO L290 TraceCheckUtils]: 13: Hoare triple {2661#(and (<= 15 main_~sum~0) (<= 6 main_~i~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2665#(and (<= 21 main_~sum~0) (<= 7 main_~i~0))} is VALID [2022-04-15 13:17:59,006 INFO L290 TraceCheckUtils]: 14: Hoare triple {2665#(and (<= 21 main_~sum~0) (<= 7 main_~i~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2669#(and (< 7 main_~n~0) (<= 8 main_~i~0) (<= 28 main_~sum~0))} is VALID [2022-04-15 13:17:59,007 INFO L290 TraceCheckUtils]: 15: Hoare triple {2669#(and (< 7 main_~n~0) (<= 8 main_~i~0) (<= 28 main_~sum~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2673#(and (< 7 main_~n~0) (<= 36 main_~sum~0))} is VALID [2022-04-15 13:17:59,007 INFO L290 TraceCheckUtils]: 16: Hoare triple {2673#(and (< 7 main_~n~0) (<= 36 main_~sum~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2677#(and (< 7 main_~n~0) (<= (+ 35 main_~i~0) main_~sum~0))} is VALID [2022-04-15 13:17:59,008 INFO L290 TraceCheckUtils]: 17: Hoare triple {2677#(and (< 7 main_~n~0) (<= (+ 35 main_~i~0) main_~sum~0))} assume !(~i~0 < ~n~0); {2681#(< 42 main_~sum~0)} is VALID [2022-04-15 13:17:59,008 INFO L272 TraceCheckUtils]: 18: Hoare triple {2681#(< 42 main_~sum~0)} call __VERIFIER_assert((if ~sum~0 >= 0 then 1 else 0)); {2685#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 13:17:59,009 INFO L290 TraceCheckUtils]: 19: Hoare triple {2685#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2689#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 13:17:59,009 INFO L290 TraceCheckUtils]: 20: Hoare triple {2689#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2598#false} is VALID [2022-04-15 13:17:59,009 INFO L290 TraceCheckUtils]: 21: Hoare triple {2598#false} assume !false; {2598#false} is VALID [2022-04-15 13:17:59,009 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 36 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 13:17:59,009 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 13:18:01,963 INFO L290 TraceCheckUtils]: 21: Hoare triple {2598#false} assume !false; {2598#false} is VALID [2022-04-15 13:18:01,964 INFO L290 TraceCheckUtils]: 20: Hoare triple {2689#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2598#false} is VALID [2022-04-15 13:18:01,964 INFO L290 TraceCheckUtils]: 19: Hoare triple {2685#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2689#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 13:18:01,964 INFO L272 TraceCheckUtils]: 18: Hoare triple {2705#(<= 0 main_~sum~0)} call __VERIFIER_assert((if ~sum~0 >= 0 then 1 else 0)); {2685#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 13:18:01,965 INFO L290 TraceCheckUtils]: 17: Hoare triple {2709#(or (< main_~i~0 main_~n~0) (<= 0 main_~sum~0))} assume !(~i~0 < ~n~0); {2705#(<= 0 main_~sum~0)} is VALID [2022-04-15 13:18:01,966 INFO L290 TraceCheckUtils]: 16: Hoare triple {2713#(<= 1 (+ main_~sum~0 main_~n~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2709#(or (< main_~i~0 main_~n~0) (<= 0 main_~sum~0))} is VALID [2022-04-15 13:18:01,967 INFO L290 TraceCheckUtils]: 15: Hoare triple {2717#(<= 1 (+ main_~sum~0 main_~i~0 main_~n~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2713#(<= 1 (+ main_~sum~0 main_~n~0))} is VALID [2022-04-15 13:18:01,968 INFO L290 TraceCheckUtils]: 14: Hoare triple {2721#(<= 0 (+ main_~sum~0 (* main_~i~0 3) 1))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2717#(<= 1 (+ main_~sum~0 main_~i~0 main_~n~0))} is VALID [2022-04-15 13:18:01,969 INFO L290 TraceCheckUtils]: 13: Hoare triple {2725#(<= (div (+ main_~sum~0 main_~i~0 1) (- 3)) (+ main_~i~0 1))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2721#(<= 0 (+ main_~sum~0 (* main_~i~0 3) 1))} is VALID [2022-04-15 13:18:01,970 INFO L290 TraceCheckUtils]: 12: Hoare triple {2729#(<= (div (+ (- 1) main_~sum~0 (* main_~i~0 2)) (- 3)) (+ main_~i~0 3))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2725#(<= (div (+ main_~sum~0 main_~i~0 1) (- 3)) (+ main_~i~0 1))} is VALID [2022-04-15 13:18:01,978 INFO L290 TraceCheckUtils]: 11: Hoare triple {2733#(forall ((aux_div_v_main_~sum~0_143_61 Int) (v_main_~i~0_132 Int)) (or (not (<= (+ main_~i~0 1) v_main_~i~0_132)) (<= aux_div_v_main_~sum~0_143_61 (+ 3 v_main_~i~0_132)) (<= 4 (+ (* aux_div_v_main_~sum~0_143_61 3) (* 2 v_main_~i~0_132) main_~sum~0 main_~i~0))))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2729#(<= (div (+ (- 1) main_~sum~0 (* main_~i~0 2)) (- 3)) (+ main_~i~0 3))} is VALID [2022-04-15 13:18:01,980 INFO L290 TraceCheckUtils]: 10: Hoare triple {2737#(forall ((aux_div_v_main_~sum~0_143_61 Int) (v_main_~i~0_132 Int)) (or (< v_main_~i~0_132 (+ main_~i~0 2)) (<= 3 (+ (* aux_div_v_main_~sum~0_143_61 3) (* 2 v_main_~i~0_132) main_~sum~0 (* main_~i~0 2))) (<= aux_div_v_main_~sum~0_143_61 (+ 3 v_main_~i~0_132))))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2733#(forall ((aux_div_v_main_~sum~0_143_61 Int) (v_main_~i~0_132 Int)) (or (not (<= (+ main_~i~0 1) v_main_~i~0_132)) (<= aux_div_v_main_~sum~0_143_61 (+ 3 v_main_~i~0_132)) (<= 4 (+ (* aux_div_v_main_~sum~0_143_61 3) (* 2 v_main_~i~0_132) main_~sum~0 main_~i~0))))} is VALID [2022-04-15 13:18:01,982 INFO L290 TraceCheckUtils]: 9: Hoare triple {2741#(forall ((aux_div_v_main_~sum~0_143_61 Int)) (or (<= aux_div_v_main_~sum~0_143_61 (+ main_~i~0 6)) (<= (div (+ (* aux_div_v_main_~sum~0_143_61 3) main_~sum~0 main_~i~0 (- 3)) (- 2)) (+ (* main_~i~0 2) 4))))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2737#(forall ((aux_div_v_main_~sum~0_143_61 Int) (v_main_~i~0_132 Int)) (or (< v_main_~i~0_132 (+ main_~i~0 2)) (<= 3 (+ (* aux_div_v_main_~sum~0_143_61 3) (* 2 v_main_~i~0_132) main_~sum~0 (* main_~i~0 2))) (<= aux_div_v_main_~sum~0_143_61 (+ 3 v_main_~i~0_132))))} is VALID [2022-04-15 13:18:01,987 INFO L290 TraceCheckUtils]: 8: Hoare triple {2745#(forall ((v_main_~i~0_135 Int) (aux_div_v_main_~sum~0_143_61 Int) (aux_div_v_main_~sum~0_146_90 Int)) (or (<= aux_div_v_main_~sum~0_146_90 (+ (* 2 v_main_~i~0_135) 4)) (<= 5 (+ (* aux_div_v_main_~sum~0_143_61 3) main_~sum~0 main_~i~0 v_main_~i~0_135 (* aux_div_v_main_~sum~0_146_90 2))) (not (<= (+ main_~i~0 1) v_main_~i~0_135)) (<= aux_div_v_main_~sum~0_143_61 (+ 6 v_main_~i~0_135))))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2741#(forall ((aux_div_v_main_~sum~0_143_61 Int)) (or (<= aux_div_v_main_~sum~0_143_61 (+ main_~i~0 6)) (<= (div (+ (* aux_div_v_main_~sum~0_143_61 3) main_~sum~0 main_~i~0 (- 3)) (- 2)) (+ (* main_~i~0 2) 4))))} is VALID [2022-04-15 13:18:01,989 INFO L290 TraceCheckUtils]: 7: Hoare triple {2749#(forall ((v_main_~i~0_135 Int) (aux_div_v_main_~sum~0_143_61 Int) (aux_div_v_main_~sum~0_146_90 Int)) (or (<= aux_div_v_main_~sum~0_146_90 (+ (* 2 v_main_~i~0_135) 4)) (<= 4 (+ (* aux_div_v_main_~sum~0_143_61 3) main_~sum~0 (* main_~i~0 2) v_main_~i~0_135 (* aux_div_v_main_~sum~0_146_90 2))) (< v_main_~i~0_135 (+ main_~i~0 2)) (<= aux_div_v_main_~sum~0_143_61 (+ 6 v_main_~i~0_135))))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2745#(forall ((v_main_~i~0_135 Int) (aux_div_v_main_~sum~0_143_61 Int) (aux_div_v_main_~sum~0_146_90 Int)) (or (<= aux_div_v_main_~sum~0_146_90 (+ (* 2 v_main_~i~0_135) 4)) (<= 5 (+ (* aux_div_v_main_~sum~0_143_61 3) main_~sum~0 main_~i~0 v_main_~i~0_135 (* aux_div_v_main_~sum~0_146_90 2))) (not (<= (+ main_~i~0 1) v_main_~i~0_135)) (<= aux_div_v_main_~sum~0_143_61 (+ 6 v_main_~i~0_135))))} is VALID [2022-04-15 13:18:01,990 INFO L290 TraceCheckUtils]: 6: Hoare triple {2597#true} assume !!(((0 == ~i~0 && ~n~0 >= 0) && ~n~0 <= 100) && 0 == ~sum~0); {2749#(forall ((v_main_~i~0_135 Int) (aux_div_v_main_~sum~0_143_61 Int) (aux_div_v_main_~sum~0_146_90 Int)) (or (<= aux_div_v_main_~sum~0_146_90 (+ (* 2 v_main_~i~0_135) 4)) (<= 4 (+ (* aux_div_v_main_~sum~0_143_61 3) main_~sum~0 (* main_~i~0 2) v_main_~i~0_135 (* aux_div_v_main_~sum~0_146_90 2))) (< v_main_~i~0_135 (+ main_~i~0 2)) (<= aux_div_v_main_~sum~0_143_61 (+ 6 v_main_~i~0_135))))} is VALID [2022-04-15 13:18:01,990 INFO L290 TraceCheckUtils]: 5: Hoare triple {2597#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~i~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~n~0 := #t~nondet2;havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~sum~0 := #t~nondet3;havoc #t~nondet3; {2597#true} is VALID [2022-04-15 13:18:01,990 INFO L272 TraceCheckUtils]: 4: Hoare triple {2597#true} call #t~ret5 := main(); {2597#true} is VALID [2022-04-15 13:18:01,990 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2597#true} {2597#true} #45#return; {2597#true} is VALID [2022-04-15 13:18:01,990 INFO L290 TraceCheckUtils]: 2: Hoare triple {2597#true} assume true; {2597#true} is VALID [2022-04-15 13:18:01,990 INFO L290 TraceCheckUtils]: 1: Hoare triple {2597#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(26, 2); {2597#true} is VALID [2022-04-15 13:18:01,990 INFO L272 TraceCheckUtils]: 0: Hoare triple {2597#true} call ULTIMATE.init(); {2597#true} is VALID [2022-04-15 13:18:01,990 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 13:18:01,991 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [875498841] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 13:18:01,991 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 13:18:01,991 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 42 [2022-04-15 13:18:01,991 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 13:18:01,991 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [414215291] [2022-04-15 13:18:01,991 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [414215291] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:18:01,991 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:18:01,991 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-04-15 13:18:01,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1570977280] [2022-04-15 13:18:01,991 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 13:18:01,992 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.125) internal successors, (18), 14 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2022-04-15 13:18:01,992 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 13:18:01,992 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 16 states, 16 states have (on average 1.125) internal successors, (18), 14 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:18:02,010 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:18:02,010 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-04-15 13:18:02,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 13:18:02,010 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-04-15 13:18:02,011 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=274, Invalid=1448, Unknown=0, NotChecked=0, Total=1722 [2022-04-15 13:18:02,011 INFO L87 Difference]: Start difference. First operand 23 states and 23 transitions. Second operand has 16 states, 16 states have (on average 1.125) internal successors, (18), 14 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:18:03,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:18:03,547 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2022-04-15 13:18:03,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-04-15 13:18:03,547 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.125) internal successors, (18), 14 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2022-04-15 13:18:03,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 13:18:03,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 1.125) internal successors, (18), 14 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:18:03,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 29 transitions. [2022-04-15 13:18:03,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 1.125) internal successors, (18), 14 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:18:03,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 29 transitions. [2022-04-15 13:18:03,549 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 16 states and 29 transitions. [2022-04-15 13:18:03,575 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:18:03,576 INFO L225 Difference]: With dead ends: 29 [2022-04-15 13:18:03,576 INFO L226 Difference]: Without dead ends: 24 [2022-04-15 13:18:03,577 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 19 SyntacticMatches, 1 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 555 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=339, Invalid=2631, Unknown=0, NotChecked=0, Total=2970 [2022-04-15 13:18:03,577 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 10 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 236 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 250 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 236 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-15 13:18:03,577 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 78 Invalid, 250 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 236 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-15 13:18:03,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2022-04-15 13:18:03,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2022-04-15 13:18:03,609 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 13:18:03,609 INFO L82 GeneralOperation]: Start isEquivalent. First operand 24 states. Second operand has 24 states, 19 states have (on average 1.0526315789473684) internal successors, (20), 19 states have internal predecessors, (20), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:18:03,610 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand has 24 states, 19 states have (on average 1.0526315789473684) internal successors, (20), 19 states have internal predecessors, (20), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:18:03,610 INFO L87 Difference]: Start difference. First operand 24 states. Second operand has 24 states, 19 states have (on average 1.0526315789473684) internal successors, (20), 19 states have internal predecessors, (20), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:18:03,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:18:03,610 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2022-04-15 13:18:03,610 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2022-04-15 13:18:03,610 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:18:03,611 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:18:03,611 INFO L74 IsIncluded]: Start isIncluded. First operand has 24 states, 19 states have (on average 1.0526315789473684) internal successors, (20), 19 states have internal predecessors, (20), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 24 states. [2022-04-15 13:18:03,611 INFO L87 Difference]: Start difference. First operand has 24 states, 19 states have (on average 1.0526315789473684) internal successors, (20), 19 states have internal predecessors, (20), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 24 states. [2022-04-15 13:18:03,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:18:03,611 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2022-04-15 13:18:03,611 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2022-04-15 13:18:03,611 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:18:03,612 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:18:03,612 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 13:18:03,612 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 13:18:03,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 19 states have (on average 1.0526315789473684) internal successors, (20), 19 states have internal predecessors, (20), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:18:03,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 24 transitions. [2022-04-15 13:18:03,612 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 24 transitions. Word has length 22 [2022-04-15 13:18:03,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 13:18:03,612 INFO L478 AbstractCegarLoop]: Abstraction has 24 states and 24 transitions. [2022-04-15 13:18:03,612 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 1.125) internal successors, (18), 14 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:18:03,613 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 24 states and 24 transitions. [2022-04-15 13:18:03,646 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:18:03,647 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2022-04-15 13:18:03,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-15 13:18:03,647 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 13:18:03,647 INFO L499 BasicCegarLoop]: trace histogram [11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 13:18:03,663 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-04-15 13:18:03,847 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2022-04-15 13:18:03,848 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 13:18:03,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 13:18:03,848 INFO L85 PathProgramCache]: Analyzing trace with hash 107739974, now seen corresponding path program 21 times [2022-04-15 13:18:03,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 13:18:03,848 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [163775036] [2022-04-15 13:18:04,089 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 13:18:04,091 INFO L85 PathProgramCache]: Analyzing trace with hash 620017063, now seen corresponding path program 1 times [2022-04-15 13:18:04,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:18:04,091 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [571031612] [2022-04-15 13:18:04,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:18:04,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:18:04,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 13:18:04,098 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 13:18:04,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 13:18:04,102 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 13:18:04,102 INFO L85 PathProgramCache]: Analyzing trace with hash 107739974, now seen corresponding path program 22 times [2022-04-15 13:18:04,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:18:04,102 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2130088345] [2022-04-15 13:18:04,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:18:04,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:18:04,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:18:04,477 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 13:18:04,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:18:04,481 INFO L290 TraceCheckUtils]: 0: Hoare triple {2972#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(26, 2); {2953#true} is VALID [2022-04-15 13:18:04,481 INFO L290 TraceCheckUtils]: 1: Hoare triple {2953#true} assume true; {2953#true} is VALID [2022-04-15 13:18:04,481 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2953#true} {2953#true} #45#return; {2953#true} is VALID [2022-04-15 13:18:04,481 INFO L272 TraceCheckUtils]: 0: Hoare triple {2953#true} call ULTIMATE.init(); {2972#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 13:18:04,481 INFO L290 TraceCheckUtils]: 1: Hoare triple {2972#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(26, 2); {2953#true} is VALID [2022-04-15 13:18:04,482 INFO L290 TraceCheckUtils]: 2: Hoare triple {2953#true} assume true; {2953#true} is VALID [2022-04-15 13:18:04,482 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2953#true} {2953#true} #45#return; {2953#true} is VALID [2022-04-15 13:18:04,482 INFO L272 TraceCheckUtils]: 4: Hoare triple {2953#true} call #t~ret5 := main(); {2953#true} is VALID [2022-04-15 13:18:04,482 INFO L290 TraceCheckUtils]: 5: Hoare triple {2953#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~i~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~n~0 := #t~nondet2;havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~sum~0 := #t~nondet3;havoc #t~nondet3; {2953#true} is VALID [2022-04-15 13:18:04,482 INFO L290 TraceCheckUtils]: 6: Hoare triple {2953#true} assume !!(((0 == ~i~0 && ~n~0 >= 0) && ~n~0 <= 100) && 0 == ~sum~0); {2958#(<= 0 (+ main_~sum~0 (* main_~i~0 11)))} is VALID [2022-04-15 13:18:04,484 INFO L290 TraceCheckUtils]: 7: Hoare triple {2958#(<= 0 (+ main_~sum~0 (* main_~i~0 11)))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2959#(<= 10 (+ main_~sum~0 (* main_~i~0 10)))} is VALID [2022-04-15 13:18:04,484 INFO L290 TraceCheckUtils]: 8: Hoare triple {2959#(<= 10 (+ main_~sum~0 (* main_~i~0 10)))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2960#(<= 19 (+ (* main_~i~0 9) main_~sum~0))} is VALID [2022-04-15 13:18:04,485 INFO L290 TraceCheckUtils]: 9: Hoare triple {2960#(<= 19 (+ (* main_~i~0 9) main_~sum~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2961#(<= 27 (+ main_~sum~0 (* main_~i~0 8)))} is VALID [2022-04-15 13:18:04,486 INFO L290 TraceCheckUtils]: 10: Hoare triple {2961#(<= 27 (+ main_~sum~0 (* main_~i~0 8)))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2962#(<= 34 (+ (* 7 main_~i~0) main_~sum~0))} is VALID [2022-04-15 13:18:04,487 INFO L290 TraceCheckUtils]: 11: Hoare triple {2962#(<= 34 (+ (* 7 main_~i~0) main_~sum~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2963#(<= 40 (+ (* main_~i~0 6) main_~sum~0))} is VALID [2022-04-15 13:18:04,487 INFO L290 TraceCheckUtils]: 12: Hoare triple {2963#(<= 40 (+ (* main_~i~0 6) main_~sum~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2964#(<= 45 (+ (* 5 main_~i~0) main_~sum~0))} is VALID [2022-04-15 13:18:04,488 INFO L290 TraceCheckUtils]: 13: Hoare triple {2964#(<= 45 (+ (* 5 main_~i~0) main_~sum~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2965#(<= 49 (+ main_~sum~0 (* main_~i~0 4)))} is VALID [2022-04-15 13:18:04,489 INFO L290 TraceCheckUtils]: 14: Hoare triple {2965#(<= 49 (+ main_~sum~0 (* main_~i~0 4)))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2966#(<= 52 (+ main_~sum~0 (* main_~i~0 3)))} is VALID [2022-04-15 13:18:04,490 INFO L290 TraceCheckUtils]: 15: Hoare triple {2966#(<= 52 (+ main_~sum~0 (* main_~i~0 3)))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2967#(<= 54 (+ main_~sum~0 (* main_~i~0 2)))} is VALID [2022-04-15 13:18:04,491 INFO L290 TraceCheckUtils]: 16: Hoare triple {2967#(<= 54 (+ main_~sum~0 (* main_~i~0 2)))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2968#(<= 55 (+ main_~sum~0 main_~i~0))} is VALID [2022-04-15 13:18:04,492 INFO L290 TraceCheckUtils]: 17: Hoare triple {2968#(<= 55 (+ main_~sum~0 main_~i~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2969#(<= 55 main_~sum~0)} is VALID [2022-04-15 13:18:04,492 INFO L290 TraceCheckUtils]: 18: Hoare triple {2969#(<= 55 main_~sum~0)} assume !(~i~0 < ~n~0); {2969#(<= 55 main_~sum~0)} is VALID [2022-04-15 13:18:04,492 INFO L272 TraceCheckUtils]: 19: Hoare triple {2969#(<= 55 main_~sum~0)} call __VERIFIER_assert((if ~sum~0 >= 0 then 1 else 0)); {2970#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 13:18:04,493 INFO L290 TraceCheckUtils]: 20: Hoare triple {2970#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {2971#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 13:18:04,493 INFO L290 TraceCheckUtils]: 21: Hoare triple {2971#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {2954#false} is VALID [2022-04-15 13:18:04,493 INFO L290 TraceCheckUtils]: 22: Hoare triple {2954#false} assume !false; {2954#false} is VALID [2022-04-15 13:18:04,493 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 13:18:04,493 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 13:18:04,493 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2130088345] [2022-04-15 13:18:04,494 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2130088345] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 13:18:04,494 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1718358510] [2022-04-15 13:18:04,494 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 13:18:04,494 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 13:18:04,494 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 13:18:04,495 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) [2022-04-15 13:18:04,495 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-04-15 13:18:04,529 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 13:18:04,529 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 13:18:04,529 INFO L263 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 26 conjunts are in the unsatisfiable core [2022-04-15 13:18:04,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:18:04,548 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 13:18:05,426 INFO L272 TraceCheckUtils]: 0: Hoare triple {2953#true} call ULTIMATE.init(); {2953#true} is VALID [2022-04-15 13:18:05,426 INFO L290 TraceCheckUtils]: 1: Hoare triple {2953#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(26, 2); {2953#true} is VALID [2022-04-15 13:18:05,426 INFO L290 TraceCheckUtils]: 2: Hoare triple {2953#true} assume true; {2953#true} is VALID [2022-04-15 13:18:05,426 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2953#true} {2953#true} #45#return; {2953#true} is VALID [2022-04-15 13:18:05,426 INFO L272 TraceCheckUtils]: 4: Hoare triple {2953#true} call #t~ret5 := main(); {2953#true} is VALID [2022-04-15 13:18:05,426 INFO L290 TraceCheckUtils]: 5: Hoare triple {2953#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~i~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~n~0 := #t~nondet2;havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~sum~0 := #t~nondet3;havoc #t~nondet3; {2953#true} is VALID [2022-04-15 13:18:05,427 INFO L290 TraceCheckUtils]: 6: Hoare triple {2953#true} assume !!(((0 == ~i~0 && ~n~0 >= 0) && ~n~0 <= 100) && 0 == ~sum~0); {2994#(and (<= 0 main_~i~0) (<= 0 main_~sum~0))} is VALID [2022-04-15 13:18:05,428 INFO L290 TraceCheckUtils]: 7: Hoare triple {2994#(and (<= 0 main_~i~0) (<= 0 main_~sum~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2998#(and (<= 0 main_~sum~0) (<= 1 main_~i~0))} is VALID [2022-04-15 13:18:05,429 INFO L290 TraceCheckUtils]: 8: Hoare triple {2998#(and (<= 0 main_~sum~0) (<= 1 main_~i~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3002#(and (<= 2 main_~i~0) (<= 1 main_~sum~0))} is VALID [2022-04-15 13:18:05,430 INFO L290 TraceCheckUtils]: 9: Hoare triple {3002#(and (<= 2 main_~i~0) (<= 1 main_~sum~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3006#(and (<= 3 main_~sum~0) (<= 3 main_~i~0))} is VALID [2022-04-15 13:18:05,430 INFO L290 TraceCheckUtils]: 10: Hoare triple {3006#(and (<= 3 main_~sum~0) (<= 3 main_~i~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3010#(and (<= 6 main_~sum~0) (<= 4 main_~i~0))} is VALID [2022-04-15 13:18:05,431 INFO L290 TraceCheckUtils]: 11: Hoare triple {3010#(and (<= 6 main_~sum~0) (<= 4 main_~i~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3014#(and (<= 10 main_~sum~0) (<= 5 main_~i~0))} is VALID [2022-04-15 13:18:05,432 INFO L290 TraceCheckUtils]: 12: Hoare triple {3014#(and (<= 10 main_~sum~0) (<= 5 main_~i~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3018#(and (<= 15 main_~sum~0) (<= 6 main_~i~0))} is VALID [2022-04-15 13:18:05,433 INFO L290 TraceCheckUtils]: 13: Hoare triple {3018#(and (<= 15 main_~sum~0) (<= 6 main_~i~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3022#(and (<= 21 main_~sum~0) (<= 7 main_~i~0))} is VALID [2022-04-15 13:18:05,434 INFO L290 TraceCheckUtils]: 14: Hoare triple {3022#(and (<= 21 main_~sum~0) (<= 7 main_~i~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3026#(and (<= 8 main_~i~0) (<= 28 main_~sum~0))} is VALID [2022-04-15 13:18:05,434 INFO L290 TraceCheckUtils]: 15: Hoare triple {3026#(and (<= 8 main_~i~0) (<= 28 main_~sum~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3030#(and (<= 9 main_~i~0) (<= 36 main_~sum~0))} is VALID [2022-04-15 13:18:05,435 INFO L290 TraceCheckUtils]: 16: Hoare triple {3030#(and (<= 9 main_~i~0) (<= 36 main_~sum~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3034#(and (<= 10 main_~i~0) (<= 45 main_~sum~0))} is VALID [2022-04-15 13:18:05,435 INFO L290 TraceCheckUtils]: 17: Hoare triple {3034#(and (<= 10 main_~i~0) (<= 45 main_~sum~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2969#(<= 55 main_~sum~0)} is VALID [2022-04-15 13:18:05,436 INFO L290 TraceCheckUtils]: 18: Hoare triple {2969#(<= 55 main_~sum~0)} assume !(~i~0 < ~n~0); {2969#(<= 55 main_~sum~0)} is VALID [2022-04-15 13:18:05,436 INFO L272 TraceCheckUtils]: 19: Hoare triple {2969#(<= 55 main_~sum~0)} call __VERIFIER_assert((if ~sum~0 >= 0 then 1 else 0)); {3044#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 13:18:05,436 INFO L290 TraceCheckUtils]: 20: Hoare triple {3044#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3048#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 13:18:05,437 INFO L290 TraceCheckUtils]: 21: Hoare triple {3048#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2954#false} is VALID [2022-04-15 13:18:05,437 INFO L290 TraceCheckUtils]: 22: Hoare triple {2954#false} assume !false; {2954#false} is VALID [2022-04-15 13:18:05,437 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 55 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 13:18:05,437 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 13:18:41,820 INFO L290 TraceCheckUtils]: 22: Hoare triple {2954#false} assume !false; {2954#false} is VALID [2022-04-15 13:18:41,821 INFO L290 TraceCheckUtils]: 21: Hoare triple {3048#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2954#false} is VALID [2022-04-15 13:18:41,821 INFO L290 TraceCheckUtils]: 20: Hoare triple {3044#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3048#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 13:18:41,822 INFO L272 TraceCheckUtils]: 19: Hoare triple {3064#(<= 0 main_~sum~0)} call __VERIFIER_assert((if ~sum~0 >= 0 then 1 else 0)); {3044#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 13:18:41,822 INFO L290 TraceCheckUtils]: 18: Hoare triple {3064#(<= 0 main_~sum~0)} assume !(~i~0 < ~n~0); {3064#(<= 0 main_~sum~0)} is VALID [2022-04-15 13:18:41,824 INFO L290 TraceCheckUtils]: 17: Hoare triple {3071#(<= 0 (+ main_~sum~0 main_~i~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3064#(<= 0 main_~sum~0)} is VALID [2022-04-15 13:18:41,825 INFO L290 TraceCheckUtils]: 16: Hoare triple {3075#(<= 0 (+ main_~sum~0 (* main_~i~0 2) 1))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3071#(<= 0 (+ main_~sum~0 main_~i~0))} is VALID [2022-04-15 13:18:41,826 INFO L290 TraceCheckUtils]: 15: Hoare triple {3079#(<= (div (+ main_~sum~0 main_~i~0 1) (- 2)) (+ main_~i~0 1))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3075#(<= 0 (+ main_~sum~0 (* main_~i~0 2) 1))} is VALID [2022-04-15 13:18:41,827 INFO L290 TraceCheckUtils]: 14: Hoare triple {3083#(<= (div main_~sum~0 (- 2)) (+ 3 (* main_~i~0 2)))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3079#(<= (div (+ main_~sum~0 main_~i~0 1) (- 2)) (+ main_~i~0 1))} is VALID [2022-04-15 13:18:41,828 INFO L290 TraceCheckUtils]: 13: Hoare triple {3087#(<= (div (+ (* (- 1) (div (+ (- 2) main_~sum~0 main_~i~0) (- 2))) 4) (- 2)) (+ main_~i~0 1))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3083#(<= (div main_~sum~0 (- 2)) (+ 3 (* main_~i~0 2)))} is VALID [2022-04-15 13:18:41,829 INFO L290 TraceCheckUtils]: 12: Hoare triple {3091#(<= (div (+ (- 1) (div (+ 5 main_~sum~0) 2) main_~i~0) (- 2)) (+ main_~i~0 3))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3087#(<= (div (+ (* (- 1) (div (+ (- 2) main_~sum~0 main_~i~0) (- 2))) 4) (- 2)) (+ main_~i~0 1))} is VALID [2022-04-15 13:18:41,830 INFO L290 TraceCheckUtils]: 11: Hoare triple {3095#(<= (div (+ (* (- 1) (div (+ main_~sum~0 main_~i~0 1) (- 2))) main_~i~0) (- 2)) (+ 5 main_~i~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3091#(<= (div (+ (- 1) (div (+ 5 main_~sum~0) 2) main_~i~0) (- 2)) (+ main_~i~0 3))} is VALID [2022-04-15 13:18:41,844 INFO L290 TraceCheckUtils]: 10: Hoare triple {3099#(forall ((v_main_~i~0_157 Int) (aux_div_aux_div_v_main_~sum~0_169_51_70 Int)) (or (<= 1 (+ (* aux_div_aux_div_v_main_~sum~0_169_51_70 2) (div (+ (- 1) main_~sum~0 main_~i~0 (* 3 v_main_~i~0_157)) 2))) (<= aux_div_aux_div_v_main_~sum~0_169_51_70 (+ 5 v_main_~i~0_157)) (not (<= (+ main_~i~0 1) v_main_~i~0_157))))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3095#(<= (div (+ (* (- 1) (div (+ main_~sum~0 main_~i~0 1) (- 2))) main_~i~0) (- 2)) (+ 5 main_~i~0))} is VALID [2022-04-15 13:18:43,852 WARN L290 TraceCheckUtils]: 9: Hoare triple {3103#(forall ((v_main_~i~0_157 Int) (aux_div_aux_div_v_main_~sum~0_170_73_50 Int)) (or (<= 1 (+ (* 2 aux_div_aux_div_v_main_~sum~0_170_73_50) main_~i~0 (div (+ main_~sum~0 (- 4) (* 3 v_main_~i~0_157)) 2))) (< v_main_~i~0_157 (+ main_~i~0 2)) (<= aux_div_aux_div_v_main_~sum~0_170_73_50 (+ 6 v_main_~i~0_157))))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3099#(forall ((v_main_~i~0_157 Int) (aux_div_aux_div_v_main_~sum~0_169_51_70 Int)) (or (<= 1 (+ (* aux_div_aux_div_v_main_~sum~0_169_51_70 2) (div (+ (- 1) main_~sum~0 main_~i~0 (* 3 v_main_~i~0_157)) 2))) (<= aux_div_aux_div_v_main_~sum~0_169_51_70 (+ 5 v_main_~i~0_157)) (not (<= (+ main_~i~0 1) v_main_~i~0_157))))} is UNKNOWN [2022-04-15 13:18:43,882 INFO L290 TraceCheckUtils]: 8: Hoare triple {3107#(forall ((aux_div_aux_div_v_main_~sum~0_170_73_50 Int) (aux_div_v_main_~sum~0_171_57 Int)) (or (<= 0 (+ aux_div_v_main_~sum~0_171_57 (* 2 aux_div_aux_div_v_main_~sum~0_170_73_50) main_~i~0)) (<= (div (+ main_~sum~0 main_~i~0 (- 6) (* aux_div_v_main_~sum~0_171_57 (- 2))) (- 3)) (+ main_~i~0 3)) (<= aux_div_aux_div_v_main_~sum~0_170_73_50 (+ main_~i~0 9))))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3103#(forall ((v_main_~i~0_157 Int) (aux_div_aux_div_v_main_~sum~0_170_73_50 Int)) (or (<= 1 (+ (* 2 aux_div_aux_div_v_main_~sum~0_170_73_50) main_~i~0 (div (+ main_~sum~0 (- 4) (* 3 v_main_~i~0_157)) 2))) (< v_main_~i~0_157 (+ main_~i~0 2)) (<= aux_div_aux_div_v_main_~sum~0_170_73_50 (+ 6 v_main_~i~0_157))))} is VALID [2022-04-15 13:18:43,884 INFO L290 TraceCheckUtils]: 7: Hoare triple {3111#(forall ((aux_div_v_main_~sum~0_172_94 Int)) (or (<= (div (+ (div (+ main_~sum~0 (* aux_div_v_main_~sum~0_172_94 3) (- 8)) 2) 2) (- 2)) (+ (* main_~i~0 2) 11)) (<= aux_div_v_main_~sum~0_172_94 (+ main_~i~0 4))))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3107#(forall ((aux_div_aux_div_v_main_~sum~0_170_73_50 Int) (aux_div_v_main_~sum~0_171_57 Int)) (or (<= 0 (+ aux_div_v_main_~sum~0_171_57 (* 2 aux_div_aux_div_v_main_~sum~0_170_73_50) main_~i~0)) (<= (div (+ main_~sum~0 main_~i~0 (- 6) (* aux_div_v_main_~sum~0_171_57 (- 2))) (- 3)) (+ main_~i~0 3)) (<= aux_div_aux_div_v_main_~sum~0_170_73_50 (+ main_~i~0 9))))} is VALID [2022-04-15 13:18:43,885 INFO L290 TraceCheckUtils]: 6: Hoare triple {2953#true} assume !!(((0 == ~i~0 && ~n~0 >= 0) && ~n~0 <= 100) && 0 == ~sum~0); {3111#(forall ((aux_div_v_main_~sum~0_172_94 Int)) (or (<= (div (+ (div (+ main_~sum~0 (* aux_div_v_main_~sum~0_172_94 3) (- 8)) 2) 2) (- 2)) (+ (* main_~i~0 2) 11)) (<= aux_div_v_main_~sum~0_172_94 (+ main_~i~0 4))))} is VALID [2022-04-15 13:18:43,885 INFO L290 TraceCheckUtils]: 5: Hoare triple {2953#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~i~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~n~0 := #t~nondet2;havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~sum~0 := #t~nondet3;havoc #t~nondet3; {2953#true} is VALID [2022-04-15 13:18:43,885 INFO L272 TraceCheckUtils]: 4: Hoare triple {2953#true} call #t~ret5 := main(); {2953#true} is VALID [2022-04-15 13:18:43,885 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2953#true} {2953#true} #45#return; {2953#true} is VALID [2022-04-15 13:18:43,885 INFO L290 TraceCheckUtils]: 2: Hoare triple {2953#true} assume true; {2953#true} is VALID [2022-04-15 13:18:43,886 INFO L290 TraceCheckUtils]: 1: Hoare triple {2953#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(26, 2); {2953#true} is VALID [2022-04-15 13:18:43,886 INFO L272 TraceCheckUtils]: 0: Hoare triple {2953#true} call ULTIMATE.init(); {2953#true} is VALID [2022-04-15 13:18:43,886 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 13:18:43,886 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1718358510] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 13:18:43,886 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 13:18:43,886 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16, 16] total 42 [2022-04-15 13:18:43,886 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 13:18:43,886 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [163775036] [2022-04-15 13:18:43,886 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [163775036] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:18:43,886 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:18:43,886 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-04-15 13:18:43,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1592404843] [2022-04-15 13:18:43,887 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 13:18:43,887 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.1176470588235294) internal successors, (19), 15 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2022-04-15 13:18:43,887 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 13:18:43,887 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 17 states, 17 states have (on average 1.1176470588235294) internal successors, (19), 15 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:18:43,903 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:18:43,903 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-04-15 13:18:43,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 13:18:43,904 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-04-15 13:18:43,904 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=348, Invalid=1367, Unknown=7, NotChecked=0, Total=1722 [2022-04-15 13:18:43,904 INFO L87 Difference]: Start difference. First operand 24 states and 24 transitions. Second operand has 17 states, 17 states have (on average 1.1176470588235294) internal successors, (19), 15 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:18:45,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:18:45,833 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2022-04-15 13:18:45,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-04-15 13:18:45,833 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.1176470588235294) internal successors, (19), 15 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2022-04-15 13:18:45,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 13:18:45,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 1.1176470588235294) internal successors, (19), 15 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:18:45,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 30 transitions. [2022-04-15 13:18:45,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 1.1176470588235294) internal successors, (19), 15 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:18:45,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 30 transitions. [2022-04-15 13:18:45,835 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 17 states and 30 transitions. [2022-04-15 13:18:45,864 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:18:45,865 INFO L225 Difference]: With dead ends: 30 [2022-04-15 13:18:45,865 INFO L226 Difference]: Without dead ends: 25 [2022-04-15 13:18:45,866 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 22 SyntacticMatches, 1 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 646 ImplicationChecksByTransitivity, 17.0s TimeCoverageRelationStatistics Valid=418, Invalid=2655, Unknown=7, NotChecked=0, Total=3080 [2022-04-15 13:18:45,866 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 10 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 268 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 283 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 268 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-15 13:18:45,866 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 83 Invalid, 283 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 268 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-15 13:18:45,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2022-04-15 13:18:45,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2022-04-15 13:18:45,899 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 13:18:45,899 INFO L82 GeneralOperation]: Start isEquivalent. First operand 25 states. Second operand has 25 states, 20 states have (on average 1.05) internal successors, (21), 20 states have internal predecessors, (21), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:18:45,899 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand has 25 states, 20 states have (on average 1.05) internal successors, (21), 20 states have internal predecessors, (21), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:18:45,899 INFO L87 Difference]: Start difference. First operand 25 states. Second operand has 25 states, 20 states have (on average 1.05) internal successors, (21), 20 states have internal predecessors, (21), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:18:45,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:18:45,900 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2022-04-15 13:18:45,900 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2022-04-15 13:18:45,900 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:18:45,900 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:18:45,900 INFO L74 IsIncluded]: Start isIncluded. First operand has 25 states, 20 states have (on average 1.05) internal successors, (21), 20 states have internal predecessors, (21), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 25 states. [2022-04-15 13:18:45,900 INFO L87 Difference]: Start difference. First operand has 25 states, 20 states have (on average 1.05) internal successors, (21), 20 states have internal predecessors, (21), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 25 states. [2022-04-15 13:18:45,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:18:45,901 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2022-04-15 13:18:45,901 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2022-04-15 13:18:45,901 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:18:45,901 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:18:45,901 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 13:18:45,901 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 13:18:45,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 20 states have (on average 1.05) internal successors, (21), 20 states have internal predecessors, (21), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:18:45,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2022-04-15 13:18:45,902 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 25 transitions. Word has length 23 [2022-04-15 13:18:45,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 13:18:45,902 INFO L478 AbstractCegarLoop]: Abstraction has 25 states and 25 transitions. [2022-04-15 13:18:45,902 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 1.1176470588235294) internal successors, (19), 15 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:18:45,902 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 25 states and 25 transitions. [2022-04-15 13:18:45,941 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:18:45,941 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2022-04-15 13:18:45,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-04-15 13:18:45,941 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 13:18:45,941 INFO L499 BasicCegarLoop]: trace histogram [12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 13:18:45,957 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2022-04-15 13:18:46,141 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21,SelfDestructingSolverStorable22 [2022-04-15 13:18:46,142 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 13:18:46,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 13:18:46,142 INFO L85 PathProgramCache]: Analyzing trace with hash -919639272, now seen corresponding path program 23 times [2022-04-15 13:18:46,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 13:18:46,142 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [840860048] [2022-04-15 13:18:46,477 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 13:18:46,478 INFO L85 PathProgramCache]: Analyzing trace with hash 679122407, now seen corresponding path program 1 times [2022-04-15 13:18:46,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:18:46,478 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [182453600] [2022-04-15 13:18:46,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:18:46,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:18:46,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 13:18:46,484 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 13:18:46,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 13:18:46,486 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 13:18:46,487 INFO L85 PathProgramCache]: Analyzing trace with hash -919639272, now seen corresponding path program 24 times [2022-04-15 13:18:46,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:18:46,487 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1288035482] [2022-04-15 13:18:46,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:18:46,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:18:46,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:18:46,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 13:18:46,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:18:46,992 INFO L290 TraceCheckUtils]: 0: Hoare triple {3343#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(26, 2); {3323#true} is VALID [2022-04-15 13:18:46,992 INFO L290 TraceCheckUtils]: 1: Hoare triple {3323#true} assume true; {3323#true} is VALID [2022-04-15 13:18:46,992 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3323#true} {3323#true} #45#return; {3323#true} is VALID [2022-04-15 13:18:46,992 INFO L272 TraceCheckUtils]: 0: Hoare triple {3323#true} call ULTIMATE.init(); {3343#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 13:18:46,993 INFO L290 TraceCheckUtils]: 1: Hoare triple {3343#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(26, 2); {3323#true} is VALID [2022-04-15 13:18:46,993 INFO L290 TraceCheckUtils]: 2: Hoare triple {3323#true} assume true; {3323#true} is VALID [2022-04-15 13:18:46,993 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3323#true} {3323#true} #45#return; {3323#true} is VALID [2022-04-15 13:18:46,993 INFO L272 TraceCheckUtils]: 4: Hoare triple {3323#true} call #t~ret5 := main(); {3323#true} is VALID [2022-04-15 13:18:46,993 INFO L290 TraceCheckUtils]: 5: Hoare triple {3323#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~i~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~n~0 := #t~nondet2;havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~sum~0 := #t~nondet3;havoc #t~nondet3; {3323#true} is VALID [2022-04-15 13:18:46,993 INFO L290 TraceCheckUtils]: 6: Hoare triple {3323#true} assume !!(((0 == ~i~0 && ~n~0 >= 0) && ~n~0 <= 100) && 0 == ~sum~0); {3328#(<= 0 (+ main_~sum~0 (* main_~i~0 12)))} is VALID [2022-04-15 13:18:46,995 INFO L290 TraceCheckUtils]: 7: Hoare triple {3328#(<= 0 (+ main_~sum~0 (* main_~i~0 12)))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3329#(<= 11 (+ main_~sum~0 (* main_~i~0 11)))} is VALID [2022-04-15 13:18:46,996 INFO L290 TraceCheckUtils]: 8: Hoare triple {3329#(<= 11 (+ main_~sum~0 (* main_~i~0 11)))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3330#(<= 21 (+ main_~sum~0 (* main_~i~0 10)))} is VALID [2022-04-15 13:18:46,996 INFO L290 TraceCheckUtils]: 9: Hoare triple {3330#(<= 21 (+ main_~sum~0 (* main_~i~0 10)))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3331#(<= 30 (+ (* main_~i~0 9) main_~sum~0))} is VALID [2022-04-15 13:18:46,997 INFO L290 TraceCheckUtils]: 10: Hoare triple {3331#(<= 30 (+ (* main_~i~0 9) main_~sum~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3332#(<= 38 (+ main_~sum~0 (* main_~i~0 8)))} is VALID [2022-04-15 13:18:46,998 INFO L290 TraceCheckUtils]: 11: Hoare triple {3332#(<= 38 (+ main_~sum~0 (* main_~i~0 8)))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3333#(<= 45 (+ (* 7 main_~i~0) main_~sum~0))} is VALID [2022-04-15 13:18:46,999 INFO L290 TraceCheckUtils]: 12: Hoare triple {3333#(<= 45 (+ (* 7 main_~i~0) main_~sum~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3334#(<= 51 (+ (* main_~i~0 6) main_~sum~0))} is VALID [2022-04-15 13:18:47,000 INFO L290 TraceCheckUtils]: 13: Hoare triple {3334#(<= 51 (+ (* main_~i~0 6) main_~sum~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3335#(<= 56 (+ (* 5 main_~i~0) main_~sum~0))} is VALID [2022-04-15 13:18:47,001 INFO L290 TraceCheckUtils]: 14: Hoare triple {3335#(<= 56 (+ (* 5 main_~i~0) main_~sum~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3336#(<= 60 (+ main_~sum~0 (* main_~i~0 4)))} is VALID [2022-04-15 13:18:47,002 INFO L290 TraceCheckUtils]: 15: Hoare triple {3336#(<= 60 (+ main_~sum~0 (* main_~i~0 4)))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3337#(<= 63 (+ main_~sum~0 (* main_~i~0 3)))} is VALID [2022-04-15 13:18:47,003 INFO L290 TraceCheckUtils]: 16: Hoare triple {3337#(<= 63 (+ main_~sum~0 (* main_~i~0 3)))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3338#(<= 65 (+ main_~sum~0 (* main_~i~0 2)))} is VALID [2022-04-15 13:18:47,004 INFO L290 TraceCheckUtils]: 17: Hoare triple {3338#(<= 65 (+ main_~sum~0 (* main_~i~0 2)))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3339#(<= 66 (+ main_~sum~0 main_~i~0))} is VALID [2022-04-15 13:18:47,005 INFO L290 TraceCheckUtils]: 18: Hoare triple {3339#(<= 66 (+ main_~sum~0 main_~i~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3340#(<= 66 main_~sum~0)} is VALID [2022-04-15 13:18:47,005 INFO L290 TraceCheckUtils]: 19: Hoare triple {3340#(<= 66 main_~sum~0)} assume !(~i~0 < ~n~0); {3340#(<= 66 main_~sum~0)} is VALID [2022-04-15 13:18:47,006 INFO L272 TraceCheckUtils]: 20: Hoare triple {3340#(<= 66 main_~sum~0)} call __VERIFIER_assert((if ~sum~0 >= 0 then 1 else 0)); {3341#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 13:18:47,006 INFO L290 TraceCheckUtils]: 21: Hoare triple {3341#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {3342#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 13:18:47,007 INFO L290 TraceCheckUtils]: 22: Hoare triple {3342#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {3324#false} is VALID [2022-04-15 13:18:47,007 INFO L290 TraceCheckUtils]: 23: Hoare triple {3324#false} assume !false; {3324#false} is VALID [2022-04-15 13:18:47,007 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 13:18:47,007 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 13:18:47,007 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1288035482] [2022-04-15 13:18:47,007 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1288035482] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 13:18:47,007 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1899952173] [2022-04-15 13:18:47,007 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 13:18:47,007 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 13:18:47,008 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 13:18:47,008 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 13:18:47,009 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-04-15 13:18:47,044 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2022-04-15 13:18:47,044 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 13:18:47,045 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 28 conjunts are in the unsatisfiable core [2022-04-15 13:18:47,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:18:47,058 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 13:18:48,057 INFO L272 TraceCheckUtils]: 0: Hoare triple {3323#true} call ULTIMATE.init(); {3323#true} is VALID [2022-04-15 13:18:48,057 INFO L290 TraceCheckUtils]: 1: Hoare triple {3323#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(26, 2); {3323#true} is VALID [2022-04-15 13:18:48,057 INFO L290 TraceCheckUtils]: 2: Hoare triple {3323#true} assume true; {3323#true} is VALID [2022-04-15 13:18:48,057 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3323#true} {3323#true} #45#return; {3323#true} is VALID [2022-04-15 13:18:48,057 INFO L272 TraceCheckUtils]: 4: Hoare triple {3323#true} call #t~ret5 := main(); {3323#true} is VALID [2022-04-15 13:18:48,057 INFO L290 TraceCheckUtils]: 5: Hoare triple {3323#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~i~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~n~0 := #t~nondet2;havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~sum~0 := #t~nondet3;havoc #t~nondet3; {3323#true} is VALID [2022-04-15 13:18:48,058 INFO L290 TraceCheckUtils]: 6: Hoare triple {3323#true} assume !!(((0 == ~i~0 && ~n~0 >= 0) && ~n~0 <= 100) && 0 == ~sum~0); {3365#(and (<= 0 main_~i~0) (<= 0 main_~sum~0))} is VALID [2022-04-15 13:18:48,059 INFO L290 TraceCheckUtils]: 7: Hoare triple {3365#(and (<= 0 main_~i~0) (<= 0 main_~sum~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3369#(and (<= 0 main_~sum~0) (<= 1 main_~i~0))} is VALID [2022-04-15 13:18:48,060 INFO L290 TraceCheckUtils]: 8: Hoare triple {3369#(and (<= 0 main_~sum~0) (<= 1 main_~i~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3373#(and (<= 2 main_~i~0) (<= 1 main_~sum~0))} is VALID [2022-04-15 13:18:48,061 INFO L290 TraceCheckUtils]: 9: Hoare triple {3373#(and (<= 2 main_~i~0) (<= 1 main_~sum~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3377#(and (<= 3 main_~sum~0) (<= 3 main_~i~0))} is VALID [2022-04-15 13:18:48,062 INFO L290 TraceCheckUtils]: 10: Hoare triple {3377#(and (<= 3 main_~sum~0) (<= 3 main_~i~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3381#(and (<= 6 main_~sum~0) (<= 4 main_~i~0))} is VALID [2022-04-15 13:18:48,062 INFO L290 TraceCheckUtils]: 11: Hoare triple {3381#(and (<= 6 main_~sum~0) (<= 4 main_~i~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3385#(and (<= 10 main_~sum~0) (<= 5 main_~i~0))} is VALID [2022-04-15 13:18:48,063 INFO L290 TraceCheckUtils]: 12: Hoare triple {3385#(and (<= 10 main_~sum~0) (<= 5 main_~i~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3389#(and (<= 15 main_~sum~0) (<= 6 main_~i~0))} is VALID [2022-04-15 13:18:48,064 INFO L290 TraceCheckUtils]: 13: Hoare triple {3389#(and (<= 15 main_~sum~0) (<= 6 main_~i~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3393#(and (<= 21 main_~sum~0) (<= 7 main_~i~0))} is VALID [2022-04-15 13:18:48,065 INFO L290 TraceCheckUtils]: 14: Hoare triple {3393#(and (<= 21 main_~sum~0) (<= 7 main_~i~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3397#(and (<= 8 main_~i~0) (<= 28 main_~sum~0))} is VALID [2022-04-15 13:18:48,065 INFO L290 TraceCheckUtils]: 15: Hoare triple {3397#(and (<= 8 main_~i~0) (<= 28 main_~sum~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3401#(and (<= 9 main_~i~0) (<= 36 main_~sum~0))} is VALID [2022-04-15 13:18:48,066 INFO L290 TraceCheckUtils]: 16: Hoare triple {3401#(and (<= 9 main_~i~0) (<= 36 main_~sum~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3405#(and (<= 10 main_~i~0) (<= 45 main_~sum~0))} is VALID [2022-04-15 13:18:48,067 INFO L290 TraceCheckUtils]: 17: Hoare triple {3405#(and (<= 10 main_~i~0) (<= 45 main_~sum~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3409#(and (<= 55 main_~sum~0) (<= 11 main_~i~0))} is VALID [2022-04-15 13:18:48,068 INFO L290 TraceCheckUtils]: 18: Hoare triple {3409#(and (<= 55 main_~sum~0) (<= 11 main_~i~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3340#(<= 66 main_~sum~0)} is VALID [2022-04-15 13:18:48,068 INFO L290 TraceCheckUtils]: 19: Hoare triple {3340#(<= 66 main_~sum~0)} assume !(~i~0 < ~n~0); {3340#(<= 66 main_~sum~0)} is VALID [2022-04-15 13:18:48,069 INFO L272 TraceCheckUtils]: 20: Hoare triple {3340#(<= 66 main_~sum~0)} call __VERIFIER_assert((if ~sum~0 >= 0 then 1 else 0)); {3419#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 13:18:48,069 INFO L290 TraceCheckUtils]: 21: Hoare triple {3419#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3423#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 13:18:48,069 INFO L290 TraceCheckUtils]: 22: Hoare triple {3423#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3324#false} is VALID [2022-04-15 13:18:48,069 INFO L290 TraceCheckUtils]: 23: Hoare triple {3324#false} assume !false; {3324#false} is VALID [2022-04-15 13:18:48,070 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 66 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 13:18:48,070 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 13:19:09,656 INFO L290 TraceCheckUtils]: 23: Hoare triple {3324#false} assume !false; {3324#false} is VALID [2022-04-15 13:19:09,656 INFO L290 TraceCheckUtils]: 22: Hoare triple {3423#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3324#false} is VALID [2022-04-15 13:19:09,657 INFO L290 TraceCheckUtils]: 21: Hoare triple {3419#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3423#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 13:19:09,657 INFO L272 TraceCheckUtils]: 20: Hoare triple {3439#(<= 0 main_~sum~0)} call __VERIFIER_assert((if ~sum~0 >= 0 then 1 else 0)); {3419#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 13:19:09,657 INFO L290 TraceCheckUtils]: 19: Hoare triple {3439#(<= 0 main_~sum~0)} assume !(~i~0 < ~n~0); {3439#(<= 0 main_~sum~0)} is VALID [2022-04-15 13:19:09,660 INFO L290 TraceCheckUtils]: 18: Hoare triple {3446#(<= 0 (+ main_~sum~0 main_~i~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3439#(<= 0 main_~sum~0)} is VALID [2022-04-15 13:19:09,661 INFO L290 TraceCheckUtils]: 17: Hoare triple {3450#(<= 0 (+ main_~sum~0 (* main_~i~0 2) 1))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3446#(<= 0 (+ main_~sum~0 main_~i~0))} is VALID [2022-04-15 13:19:09,662 INFO L290 TraceCheckUtils]: 16: Hoare triple {3454#(<= (div (+ main_~sum~0 main_~i~0 1) (- 2)) (+ main_~i~0 1))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3450#(<= 0 (+ main_~sum~0 (* main_~i~0 2) 1))} is VALID [2022-04-15 13:19:09,663 INFO L290 TraceCheckUtils]: 15: Hoare triple {3458#(<= (div main_~sum~0 (- 2)) (+ 3 (* main_~i~0 2)))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3454#(<= (div (+ main_~sum~0 main_~i~0 1) (- 2)) (+ main_~i~0 1))} is VALID [2022-04-15 13:19:09,664 INFO L290 TraceCheckUtils]: 14: Hoare triple {3462#(<= (div (+ (* (- 1) (div (+ (- 2) main_~sum~0 main_~i~0) (- 2))) 4) (- 2)) (+ main_~i~0 1))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3458#(<= (div main_~sum~0 (- 2)) (+ 3 (* main_~i~0 2)))} is VALID [2022-04-15 13:19:09,665 INFO L290 TraceCheckUtils]: 13: Hoare triple {3466#(<= (div (+ (- 1) (div (+ 5 main_~sum~0) 2) main_~i~0) (- 2)) (+ main_~i~0 3))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3462#(<= (div (+ (* (- 1) (div (+ (- 2) main_~sum~0 main_~i~0) (- 2))) 4) (- 2)) (+ main_~i~0 1))} is VALID [2022-04-15 13:19:09,667 INFO L290 TraceCheckUtils]: 12: Hoare triple {3470#(<= (div (+ (* (- 1) (div (+ main_~sum~0 main_~i~0 1) (- 2))) main_~i~0) (- 2)) (+ 5 main_~i~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3466#(<= (div (+ (- 1) (div (+ 5 main_~sum~0) 2) main_~i~0) (- 2)) (+ main_~i~0 3))} is VALID [2022-04-15 13:19:09,678 INFO L290 TraceCheckUtils]: 11: Hoare triple {3474#(forall ((aux_mod_aux_div_v_main_~sum~0_195_51_70 Int) (v_main_~i~0_182 Int) (aux_div_aux_div_v_main_~sum~0_195_51_70 Int)) (or (<= (+ (* 2 aux_mod_aux_div_v_main_~sum~0_195_51_70) 1) (+ main_~sum~0 (* 3 v_main_~i~0_182) main_~i~0 (* aux_div_aux_div_v_main_~sum~0_195_51_70 4))) (> 0 aux_mod_aux_div_v_main_~sum~0_195_51_70) (not (<= (+ main_~i~0 1) v_main_~i~0_182)) (>= aux_mod_aux_div_v_main_~sum~0_195_51_70 2) (<= aux_div_aux_div_v_main_~sum~0_195_51_70 (+ 5 v_main_~i~0_182))))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3470#(<= (div (+ (* (- 1) (div (+ main_~sum~0 main_~i~0 1) (- 2))) main_~i~0) (- 2)) (+ 5 main_~i~0))} is VALID [2022-04-15 13:19:09,682 INFO L290 TraceCheckUtils]: 10: Hoare triple {3478#(forall ((aux_mod_aux_div_v_main_~sum~0_195_51_70 Int) (v_main_~i~0_182 Int) (aux_div_aux_div_v_main_~sum~0_195_51_70 Int)) (or (< v_main_~i~0_182 (+ main_~i~0 2)) (> 0 aux_mod_aux_div_v_main_~sum~0_195_51_70) (>= aux_mod_aux_div_v_main_~sum~0_195_51_70 2) (<= (* 2 aux_mod_aux_div_v_main_~sum~0_195_51_70) (+ main_~sum~0 (* 3 v_main_~i~0_182) (* aux_div_aux_div_v_main_~sum~0_195_51_70 4) (* main_~i~0 2))) (<= aux_div_aux_div_v_main_~sum~0_195_51_70 (+ 5 v_main_~i~0_182))))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3474#(forall ((aux_mod_aux_div_v_main_~sum~0_195_51_70 Int) (v_main_~i~0_182 Int) (aux_div_aux_div_v_main_~sum~0_195_51_70 Int)) (or (<= (+ (* 2 aux_mod_aux_div_v_main_~sum~0_195_51_70) 1) (+ main_~sum~0 (* 3 v_main_~i~0_182) main_~i~0 (* aux_div_aux_div_v_main_~sum~0_195_51_70 4))) (> 0 aux_mod_aux_div_v_main_~sum~0_195_51_70) (not (<= (+ main_~i~0 1) v_main_~i~0_182)) (>= aux_mod_aux_div_v_main_~sum~0_195_51_70 2) (<= aux_div_aux_div_v_main_~sum~0_195_51_70 (+ 5 v_main_~i~0_182))))} is VALID [2022-04-15 13:19:09,684 INFO L290 TraceCheckUtils]: 9: Hoare triple {3482#(forall ((aux_mod_aux_div_v_main_~sum~0_195_51_70 Int) (v_main_~i~0_184 Int) (v_main_~i~0_182 Int) (aux_div_aux_div_v_main_~sum~0_195_51_70 Int)) (or (> 0 aux_mod_aux_div_v_main_~sum~0_195_51_70) (< v_main_~i~0_182 (+ 2 v_main_~i~0_184)) (<= (* 2 aux_mod_aux_div_v_main_~sum~0_195_51_70) (+ (* 2 v_main_~i~0_184) main_~sum~0 (* 3 v_main_~i~0_182) main_~i~0 (* aux_div_aux_div_v_main_~sum~0_195_51_70 4))) (>= aux_mod_aux_div_v_main_~sum~0_195_51_70 2) (<= aux_div_aux_div_v_main_~sum~0_195_51_70 (+ 5 v_main_~i~0_182)) (not (<= (+ main_~i~0 1) v_main_~i~0_184))))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3478#(forall ((aux_mod_aux_div_v_main_~sum~0_195_51_70 Int) (v_main_~i~0_182 Int) (aux_div_aux_div_v_main_~sum~0_195_51_70 Int)) (or (< v_main_~i~0_182 (+ main_~i~0 2)) (> 0 aux_mod_aux_div_v_main_~sum~0_195_51_70) (>= aux_mod_aux_div_v_main_~sum~0_195_51_70 2) (<= (* 2 aux_mod_aux_div_v_main_~sum~0_195_51_70) (+ main_~sum~0 (* 3 v_main_~i~0_182) (* aux_div_aux_div_v_main_~sum~0_195_51_70 4) (* main_~i~0 2))) (<= aux_div_aux_div_v_main_~sum~0_195_51_70 (+ 5 v_main_~i~0_182))))} is VALID [2022-04-15 13:19:09,719 INFO L290 TraceCheckUtils]: 8: Hoare triple {3486#(forall ((aux_mod_aux_div_v_main_~sum~0_195_51_70 Int) (v_main_~i~0_184 Int) (v_main_~i~0_182 Int) (aux_div_aux_div_v_main_~sum~0_195_51_70 Int)) (or (<= (* 2 aux_mod_aux_div_v_main_~sum~0_195_51_70) (+ (* 2 v_main_~i~0_184) main_~sum~0 (* 3 v_main_~i~0_182) (* aux_div_aux_div_v_main_~sum~0_195_51_70 4) (* main_~i~0 2) 1)) (< v_main_~i~0_184 (+ main_~i~0 2)) (> 0 aux_mod_aux_div_v_main_~sum~0_195_51_70) (< v_main_~i~0_182 (+ 2 v_main_~i~0_184)) (>= aux_mod_aux_div_v_main_~sum~0_195_51_70 2) (<= aux_div_aux_div_v_main_~sum~0_195_51_70 (+ 5 v_main_~i~0_182))))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3482#(forall ((aux_mod_aux_div_v_main_~sum~0_195_51_70 Int) (v_main_~i~0_184 Int) (v_main_~i~0_182 Int) (aux_div_aux_div_v_main_~sum~0_195_51_70 Int)) (or (> 0 aux_mod_aux_div_v_main_~sum~0_195_51_70) (< v_main_~i~0_182 (+ 2 v_main_~i~0_184)) (<= (* 2 aux_mod_aux_div_v_main_~sum~0_195_51_70) (+ (* 2 v_main_~i~0_184) main_~sum~0 (* 3 v_main_~i~0_182) main_~i~0 (* aux_div_aux_div_v_main_~sum~0_195_51_70 4))) (>= aux_mod_aux_div_v_main_~sum~0_195_51_70 2) (<= aux_div_aux_div_v_main_~sum~0_195_51_70 (+ 5 v_main_~i~0_182)) (not (<= (+ main_~i~0 1) v_main_~i~0_184))))} is VALID [2022-04-15 13:19:09,721 INFO L290 TraceCheckUtils]: 7: Hoare triple {3490#(forall ((aux_mod_aux_div_v_main_~sum~0_195_51_70 Int) (v_main_~i~0_186 Int) (v_main_~i~0_184 Int) (v_main_~i~0_182 Int) (aux_div_aux_div_v_main_~sum~0_195_51_70 Int)) (or (> 0 aux_mod_aux_div_v_main_~sum~0_195_51_70) (< v_main_~i~0_182 (+ 2 v_main_~i~0_184)) (>= aux_mod_aux_div_v_main_~sum~0_195_51_70 2) (<= aux_div_aux_div_v_main_~sum~0_195_51_70 (+ 5 v_main_~i~0_182)) (< v_main_~i~0_184 (+ 2 v_main_~i~0_186)) (not (<= (+ main_~i~0 1) v_main_~i~0_186)) (<= (* 2 aux_mod_aux_div_v_main_~sum~0_195_51_70) (+ (* 2 v_main_~i~0_184) main_~sum~0 (* 3 v_main_~i~0_182) main_~i~0 (* aux_div_aux_div_v_main_~sum~0_195_51_70 4) (* 2 v_main_~i~0_186) 1))))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3486#(forall ((aux_mod_aux_div_v_main_~sum~0_195_51_70 Int) (v_main_~i~0_184 Int) (v_main_~i~0_182 Int) (aux_div_aux_div_v_main_~sum~0_195_51_70 Int)) (or (<= (* 2 aux_mod_aux_div_v_main_~sum~0_195_51_70) (+ (* 2 v_main_~i~0_184) main_~sum~0 (* 3 v_main_~i~0_182) (* aux_div_aux_div_v_main_~sum~0_195_51_70 4) (* main_~i~0 2) 1)) (< v_main_~i~0_184 (+ main_~i~0 2)) (> 0 aux_mod_aux_div_v_main_~sum~0_195_51_70) (< v_main_~i~0_182 (+ 2 v_main_~i~0_184)) (>= aux_mod_aux_div_v_main_~sum~0_195_51_70 2) (<= aux_div_aux_div_v_main_~sum~0_195_51_70 (+ 5 v_main_~i~0_182))))} is VALID [2022-04-15 13:19:09,722 INFO L290 TraceCheckUtils]: 6: Hoare triple {3323#true} assume !!(((0 == ~i~0 && ~n~0 >= 0) && ~n~0 <= 100) && 0 == ~sum~0); {3490#(forall ((aux_mod_aux_div_v_main_~sum~0_195_51_70 Int) (v_main_~i~0_186 Int) (v_main_~i~0_184 Int) (v_main_~i~0_182 Int) (aux_div_aux_div_v_main_~sum~0_195_51_70 Int)) (or (> 0 aux_mod_aux_div_v_main_~sum~0_195_51_70) (< v_main_~i~0_182 (+ 2 v_main_~i~0_184)) (>= aux_mod_aux_div_v_main_~sum~0_195_51_70 2) (<= aux_div_aux_div_v_main_~sum~0_195_51_70 (+ 5 v_main_~i~0_182)) (< v_main_~i~0_184 (+ 2 v_main_~i~0_186)) (not (<= (+ main_~i~0 1) v_main_~i~0_186)) (<= (* 2 aux_mod_aux_div_v_main_~sum~0_195_51_70) (+ (* 2 v_main_~i~0_184) main_~sum~0 (* 3 v_main_~i~0_182) main_~i~0 (* aux_div_aux_div_v_main_~sum~0_195_51_70 4) (* 2 v_main_~i~0_186) 1))))} is VALID [2022-04-15 13:19:09,722 INFO L290 TraceCheckUtils]: 5: Hoare triple {3323#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~i~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~n~0 := #t~nondet2;havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~sum~0 := #t~nondet3;havoc #t~nondet3; {3323#true} is VALID [2022-04-15 13:19:09,722 INFO L272 TraceCheckUtils]: 4: Hoare triple {3323#true} call #t~ret5 := main(); {3323#true} is VALID [2022-04-15 13:19:09,722 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3323#true} {3323#true} #45#return; {3323#true} is VALID [2022-04-15 13:19:09,723 INFO L290 TraceCheckUtils]: 2: Hoare triple {3323#true} assume true; {3323#true} is VALID [2022-04-15 13:19:09,723 INFO L290 TraceCheckUtils]: 1: Hoare triple {3323#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(26, 2); {3323#true} is VALID [2022-04-15 13:19:09,723 INFO L272 TraceCheckUtils]: 0: Hoare triple {3323#true} call ULTIMATE.init(); {3323#true} is VALID [2022-04-15 13:19:09,723 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 13:19:09,723 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1899952173] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 13:19:09,723 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 13:19:09,723 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17, 17] total 45 [2022-04-15 13:19:09,723 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 13:19:09,723 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [840860048] [2022-04-15 13:19:09,724 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [840860048] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:19:09,724 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:19:09,724 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2022-04-15 13:19:09,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [968914410] [2022-04-15 13:19:09,724 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 13:19:09,724 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 16 states have internal predecessors, (20), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 24 [2022-04-15 13:19:09,724 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 13:19:09,724 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 18 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 16 states have internal predecessors, (20), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:19:09,766 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:19:09,766 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-04-15 13:19:09,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 13:19:09,767 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-04-15 13:19:09,767 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=402, Invalid=1578, Unknown=0, NotChecked=0, Total=1980 [2022-04-15 13:19:09,767 INFO L87 Difference]: Start difference. First operand 25 states and 25 transitions. Second operand has 18 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 16 states have internal predecessors, (20), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:19:12,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:19:12,428 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2022-04-15 13:19:12,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-04-15 13:19:12,428 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 16 states have internal predecessors, (20), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 24 [2022-04-15 13:19:12,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 13:19:12,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 16 states have internal predecessors, (20), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:19:12,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 31 transitions. [2022-04-15 13:19:12,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 16 states have internal predecessors, (20), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:19:12,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 31 transitions. [2022-04-15 13:19:12,432 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 18 states and 31 transitions. [2022-04-15 13:19:12,458 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:19:12,459 INFO L225 Difference]: With dead ends: 31 [2022-04-15 13:19:12,459 INFO L226 Difference]: Without dead ends: 26 [2022-04-15 13:19:12,460 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 22 SyntacticMatches, 1 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 752 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=477, Invalid=3063, Unknown=0, NotChecked=0, Total=3540 [2022-04-15 13:19:12,460 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 10 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 302 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 318 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 302 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-04-15 13:19:12,460 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 88 Invalid, 318 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 302 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-04-15 13:19:12,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2022-04-15 13:19:12,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2022-04-15 13:19:12,500 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 13:19:12,500 INFO L82 GeneralOperation]: Start isEquivalent. First operand 26 states. Second operand has 26 states, 21 states have (on average 1.0476190476190477) internal successors, (22), 21 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:19:12,500 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand has 26 states, 21 states have (on average 1.0476190476190477) internal successors, (22), 21 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:19:12,500 INFO L87 Difference]: Start difference. First operand 26 states. Second operand has 26 states, 21 states have (on average 1.0476190476190477) internal successors, (22), 21 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:19:12,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:19:12,501 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2022-04-15 13:19:12,501 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2022-04-15 13:19:12,501 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:19:12,501 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:19:12,501 INFO L74 IsIncluded]: Start isIncluded. First operand has 26 states, 21 states have (on average 1.0476190476190477) internal successors, (22), 21 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 26 states. [2022-04-15 13:19:12,501 INFO L87 Difference]: Start difference. First operand has 26 states, 21 states have (on average 1.0476190476190477) internal successors, (22), 21 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 26 states. [2022-04-15 13:19:12,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:19:12,502 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2022-04-15 13:19:12,502 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2022-04-15 13:19:12,502 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:19:12,502 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:19:12,502 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 13:19:12,502 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 13:19:12,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 21 states have (on average 1.0476190476190477) internal successors, (22), 21 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:19:12,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 26 transitions. [2022-04-15 13:19:12,503 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 26 transitions. Word has length 24 [2022-04-15 13:19:12,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 13:19:12,503 INFO L478 AbstractCegarLoop]: Abstraction has 26 states and 26 transitions. [2022-04-15 13:19:12,503 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 16 states have internal predecessors, (20), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:19:12,503 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 26 states and 26 transitions. [2022-04-15 13:19:12,543 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:19:12,543 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2022-04-15 13:19:12,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-04-15 13:19:12,544 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 13:19:12,544 INFO L499 BasicCegarLoop]: trace histogram [13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 13:19:12,559 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-04-15 13:19:12,755 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23,SelfDestructingSolverStorable24 [2022-04-15 13:19:12,755 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 13:19:12,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 13:19:12,756 INFO L85 PathProgramCache]: Analyzing trace with hash 1591342470, now seen corresponding path program 25 times [2022-04-15 13:19:12,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 13:19:12,756 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [627720016] [2022-04-15 13:19:13,079 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 13:19:13,080 INFO L85 PathProgramCache]: Analyzing trace with hash 738227751, now seen corresponding path program 1 times [2022-04-15 13:19:13,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:19:13,080 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1924520602] [2022-04-15 13:19:13,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:19:13,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:19:13,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 13:19:13,086 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 13:19:13,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 13:19:13,089 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 13:19:13,089 INFO L85 PathProgramCache]: Analyzing trace with hash 1591342470, now seen corresponding path program 26 times [2022-04-15 13:19:13,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:19:13,090 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1957052131] [2022-04-15 13:19:13,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:19:13,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:19:13,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:19:13,593 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 13:19:13,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:19:13,597 INFO L290 TraceCheckUtils]: 0: Hoare triple {3731#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(26, 2); {3710#true} is VALID [2022-04-15 13:19:13,597 INFO L290 TraceCheckUtils]: 1: Hoare triple {3710#true} assume true; {3710#true} is VALID [2022-04-15 13:19:13,598 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3710#true} {3710#true} #45#return; {3710#true} is VALID [2022-04-15 13:19:13,598 INFO L272 TraceCheckUtils]: 0: Hoare triple {3710#true} call ULTIMATE.init(); {3731#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 13:19:13,598 INFO L290 TraceCheckUtils]: 1: Hoare triple {3731#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(26, 2); {3710#true} is VALID [2022-04-15 13:19:13,598 INFO L290 TraceCheckUtils]: 2: Hoare triple {3710#true} assume true; {3710#true} is VALID [2022-04-15 13:19:13,598 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3710#true} {3710#true} #45#return; {3710#true} is VALID [2022-04-15 13:19:13,598 INFO L272 TraceCheckUtils]: 4: Hoare triple {3710#true} call #t~ret5 := main(); {3710#true} is VALID [2022-04-15 13:19:13,598 INFO L290 TraceCheckUtils]: 5: Hoare triple {3710#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~i~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~n~0 := #t~nondet2;havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~sum~0 := #t~nondet3;havoc #t~nondet3; {3710#true} is VALID [2022-04-15 13:19:13,599 INFO L290 TraceCheckUtils]: 6: Hoare triple {3710#true} assume !!(((0 == ~i~0 && ~n~0 >= 0) && ~n~0 <= 100) && 0 == ~sum~0); {3715#(<= 0 (+ (* main_~i~0 13) main_~sum~0))} is VALID [2022-04-15 13:19:13,600 INFO L290 TraceCheckUtils]: 7: Hoare triple {3715#(<= 0 (+ (* main_~i~0 13) main_~sum~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3716#(<= 12 (+ main_~sum~0 (* main_~i~0 12)))} is VALID [2022-04-15 13:19:13,601 INFO L290 TraceCheckUtils]: 8: Hoare triple {3716#(<= 12 (+ main_~sum~0 (* main_~i~0 12)))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3717#(<= 23 (+ main_~sum~0 (* main_~i~0 11)))} is VALID [2022-04-15 13:19:13,602 INFO L290 TraceCheckUtils]: 9: Hoare triple {3717#(<= 23 (+ main_~sum~0 (* main_~i~0 11)))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3718#(<= 33 (+ main_~sum~0 (* main_~i~0 10)))} is VALID [2022-04-15 13:19:13,603 INFO L290 TraceCheckUtils]: 10: Hoare triple {3718#(<= 33 (+ main_~sum~0 (* main_~i~0 10)))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3719#(<= 42 (+ (* main_~i~0 9) main_~sum~0))} is VALID [2022-04-15 13:19:13,604 INFO L290 TraceCheckUtils]: 11: Hoare triple {3719#(<= 42 (+ (* main_~i~0 9) main_~sum~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3720#(<= 50 (+ main_~sum~0 (* main_~i~0 8)))} is VALID [2022-04-15 13:19:13,605 INFO L290 TraceCheckUtils]: 12: Hoare triple {3720#(<= 50 (+ main_~sum~0 (* main_~i~0 8)))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3721#(<= 57 (+ (* 7 main_~i~0) main_~sum~0))} is VALID [2022-04-15 13:19:13,607 INFO L290 TraceCheckUtils]: 13: Hoare triple {3721#(<= 57 (+ (* 7 main_~i~0) main_~sum~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3722#(<= 63 (+ (* main_~i~0 6) main_~sum~0))} is VALID [2022-04-15 13:19:13,608 INFO L290 TraceCheckUtils]: 14: Hoare triple {3722#(<= 63 (+ (* main_~i~0 6) main_~sum~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3723#(<= 68 (+ (* 5 main_~i~0) main_~sum~0))} is VALID [2022-04-15 13:19:13,609 INFO L290 TraceCheckUtils]: 15: Hoare triple {3723#(<= 68 (+ (* 5 main_~i~0) main_~sum~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3724#(<= 72 (+ main_~sum~0 (* main_~i~0 4)))} is VALID [2022-04-15 13:19:13,610 INFO L290 TraceCheckUtils]: 16: Hoare triple {3724#(<= 72 (+ main_~sum~0 (* main_~i~0 4)))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3725#(<= 75 (+ main_~sum~0 (* main_~i~0 3)))} is VALID [2022-04-15 13:19:13,611 INFO L290 TraceCheckUtils]: 17: Hoare triple {3725#(<= 75 (+ main_~sum~0 (* main_~i~0 3)))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3726#(<= 77 (+ main_~sum~0 (* main_~i~0 2)))} is VALID [2022-04-15 13:19:13,612 INFO L290 TraceCheckUtils]: 18: Hoare triple {3726#(<= 77 (+ main_~sum~0 (* main_~i~0 2)))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3727#(<= 78 (+ main_~sum~0 main_~i~0))} is VALID [2022-04-15 13:19:13,614 INFO L290 TraceCheckUtils]: 19: Hoare triple {3727#(<= 78 (+ main_~sum~0 main_~i~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3728#(<= 78 main_~sum~0)} is VALID [2022-04-15 13:19:13,614 INFO L290 TraceCheckUtils]: 20: Hoare triple {3728#(<= 78 main_~sum~0)} assume !(~i~0 < ~n~0); {3728#(<= 78 main_~sum~0)} is VALID [2022-04-15 13:19:13,615 INFO L272 TraceCheckUtils]: 21: Hoare triple {3728#(<= 78 main_~sum~0)} call __VERIFIER_assert((if ~sum~0 >= 0 then 1 else 0)); {3729#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 13:19:13,615 INFO L290 TraceCheckUtils]: 22: Hoare triple {3729#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {3730#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 13:19:13,615 INFO L290 TraceCheckUtils]: 23: Hoare triple {3730#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {3711#false} is VALID [2022-04-15 13:19:13,615 INFO L290 TraceCheckUtils]: 24: Hoare triple {3711#false} assume !false; {3711#false} is VALID [2022-04-15 13:19:13,616 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 13:19:13,616 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 13:19:13,616 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1957052131] [2022-04-15 13:19:13,616 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1957052131] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 13:19:13,616 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1628984477] [2022-04-15 13:19:13,616 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 13:19:13,616 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 13:19:13,616 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 13:19:13,617 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 13:19:13,618 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-04-15 13:19:13,658 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 13:19:13,658 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 13:19:13,659 INFO L263 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 30 conjunts are in the unsatisfiable core [2022-04-15 13:19:13,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:19:13,672 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 13:19:14,806 INFO L272 TraceCheckUtils]: 0: Hoare triple {3710#true} call ULTIMATE.init(); {3710#true} is VALID [2022-04-15 13:19:14,807 INFO L290 TraceCheckUtils]: 1: Hoare triple {3710#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(26, 2); {3710#true} is VALID [2022-04-15 13:19:14,807 INFO L290 TraceCheckUtils]: 2: Hoare triple {3710#true} assume true; {3710#true} is VALID [2022-04-15 13:19:14,807 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3710#true} {3710#true} #45#return; {3710#true} is VALID [2022-04-15 13:19:14,807 INFO L272 TraceCheckUtils]: 4: Hoare triple {3710#true} call #t~ret5 := main(); {3710#true} is VALID [2022-04-15 13:19:14,807 INFO L290 TraceCheckUtils]: 5: Hoare triple {3710#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~i~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~n~0 := #t~nondet2;havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~sum~0 := #t~nondet3;havoc #t~nondet3; {3710#true} is VALID [2022-04-15 13:19:14,807 INFO L290 TraceCheckUtils]: 6: Hoare triple {3710#true} assume !!(((0 == ~i~0 && ~n~0 >= 0) && ~n~0 <= 100) && 0 == ~sum~0); {3753#(and (<= 0 main_~i~0) (<= 0 main_~sum~0))} is VALID [2022-04-15 13:19:14,809 INFO L290 TraceCheckUtils]: 7: Hoare triple {3753#(and (<= 0 main_~i~0) (<= 0 main_~sum~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3757#(and (<= 0 main_~sum~0) (<= 1 main_~i~0))} is VALID [2022-04-15 13:19:14,810 INFO L290 TraceCheckUtils]: 8: Hoare triple {3757#(and (<= 0 main_~sum~0) (<= 1 main_~i~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3761#(and (<= 2 main_~i~0) (<= 1 main_~sum~0))} is VALID [2022-04-15 13:19:14,811 INFO L290 TraceCheckUtils]: 9: Hoare triple {3761#(and (<= 2 main_~i~0) (<= 1 main_~sum~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3765#(and (<= 3 main_~sum~0) (<= 3 main_~i~0))} is VALID [2022-04-15 13:19:14,812 INFO L290 TraceCheckUtils]: 10: Hoare triple {3765#(and (<= 3 main_~sum~0) (<= 3 main_~i~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3769#(and (<= 6 main_~sum~0) (<= 4 main_~i~0))} is VALID [2022-04-15 13:19:14,813 INFO L290 TraceCheckUtils]: 11: Hoare triple {3769#(and (<= 6 main_~sum~0) (<= 4 main_~i~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3773#(and (<= 10 main_~sum~0) (<= 5 main_~i~0))} is VALID [2022-04-15 13:19:14,813 INFO L290 TraceCheckUtils]: 12: Hoare triple {3773#(and (<= 10 main_~sum~0) (<= 5 main_~i~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3777#(and (<= 15 main_~sum~0) (<= 6 main_~i~0))} is VALID [2022-04-15 13:19:14,814 INFO L290 TraceCheckUtils]: 13: Hoare triple {3777#(and (<= 15 main_~sum~0) (<= 6 main_~i~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3781#(and (<= 21 main_~sum~0) (<= 7 main_~i~0))} is VALID [2022-04-15 13:19:14,815 INFO L290 TraceCheckUtils]: 14: Hoare triple {3781#(and (<= 21 main_~sum~0) (<= 7 main_~i~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3785#(and (<= 8 main_~i~0) (<= 28 main_~sum~0))} is VALID [2022-04-15 13:19:14,816 INFO L290 TraceCheckUtils]: 15: Hoare triple {3785#(and (<= 8 main_~i~0) (<= 28 main_~sum~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3789#(and (<= 9 main_~i~0) (<= 36 main_~sum~0))} is VALID [2022-04-15 13:19:14,817 INFO L290 TraceCheckUtils]: 16: Hoare triple {3789#(and (<= 9 main_~i~0) (<= 36 main_~sum~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3793#(and (<= 10 main_~i~0) (<= 45 main_~sum~0))} is VALID [2022-04-15 13:19:14,817 INFO L290 TraceCheckUtils]: 17: Hoare triple {3793#(and (<= 10 main_~i~0) (<= 45 main_~sum~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3797#(and (<= 55 main_~sum~0) (<= 11 main_~i~0))} is VALID [2022-04-15 13:19:14,818 INFO L290 TraceCheckUtils]: 18: Hoare triple {3797#(and (<= 55 main_~sum~0) (<= 11 main_~i~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3801#(and (<= 66 main_~sum~0) (<= 12 main_~i~0))} is VALID [2022-04-15 13:19:14,819 INFO L290 TraceCheckUtils]: 19: Hoare triple {3801#(and (<= 66 main_~sum~0) (<= 12 main_~i~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3728#(<= 78 main_~sum~0)} is VALID [2022-04-15 13:19:14,819 INFO L290 TraceCheckUtils]: 20: Hoare triple {3728#(<= 78 main_~sum~0)} assume !(~i~0 < ~n~0); {3728#(<= 78 main_~sum~0)} is VALID [2022-04-15 13:19:14,820 INFO L272 TraceCheckUtils]: 21: Hoare triple {3728#(<= 78 main_~sum~0)} call __VERIFIER_assert((if ~sum~0 >= 0 then 1 else 0)); {3811#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 13:19:14,820 INFO L290 TraceCheckUtils]: 22: Hoare triple {3811#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3815#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 13:19:14,820 INFO L290 TraceCheckUtils]: 23: Hoare triple {3815#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3711#false} is VALID [2022-04-15 13:19:14,821 INFO L290 TraceCheckUtils]: 24: Hoare triple {3711#false} assume !false; {3711#false} is VALID [2022-04-15 13:19:14,821 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 78 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 13:19:14,821 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 13:19:43,825 INFO L290 TraceCheckUtils]: 24: Hoare triple {3711#false} assume !false; {3711#false} is VALID [2022-04-15 13:19:43,825 INFO L290 TraceCheckUtils]: 23: Hoare triple {3815#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3711#false} is VALID [2022-04-15 13:19:43,826 INFO L290 TraceCheckUtils]: 22: Hoare triple {3811#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3815#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 13:19:43,826 INFO L272 TraceCheckUtils]: 21: Hoare triple {3831#(<= 0 main_~sum~0)} call __VERIFIER_assert((if ~sum~0 >= 0 then 1 else 0)); {3811#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 13:19:43,826 INFO L290 TraceCheckUtils]: 20: Hoare triple {3831#(<= 0 main_~sum~0)} assume !(~i~0 < ~n~0); {3831#(<= 0 main_~sum~0)} is VALID [2022-04-15 13:19:43,837 INFO L290 TraceCheckUtils]: 19: Hoare triple {3838#(<= 0 (+ main_~sum~0 main_~i~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3831#(<= 0 main_~sum~0)} is VALID [2022-04-15 13:19:43,839 INFO L290 TraceCheckUtils]: 18: Hoare triple {3842#(<= 0 (+ main_~sum~0 (* main_~i~0 2) 1))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3838#(<= 0 (+ main_~sum~0 main_~i~0))} is VALID [2022-04-15 13:19:43,840 INFO L290 TraceCheckUtils]: 17: Hoare triple {3846#(<= (div (+ main_~sum~0 main_~i~0 1) (- 2)) (+ main_~i~0 1))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3842#(<= 0 (+ main_~sum~0 (* main_~i~0 2) 1))} is VALID [2022-04-15 13:19:43,841 INFO L290 TraceCheckUtils]: 16: Hoare triple {3850#(<= (div main_~sum~0 (- 2)) (+ 3 (* main_~i~0 2)))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3846#(<= (div (+ main_~sum~0 main_~i~0 1) (- 2)) (+ main_~i~0 1))} is VALID [2022-04-15 13:19:43,842 INFO L290 TraceCheckUtils]: 15: Hoare triple {3854#(<= (div (+ (* (- 1) (div (+ (- 2) main_~sum~0 main_~i~0) (- 2))) 4) (- 2)) (+ main_~i~0 1))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3850#(<= (div main_~sum~0 (- 2)) (+ 3 (* main_~i~0 2)))} is VALID [2022-04-15 13:19:43,844 INFO L290 TraceCheckUtils]: 14: Hoare triple {3858#(<= (div (+ (- 1) (div (+ 5 main_~sum~0) 2) main_~i~0) (- 2)) (+ main_~i~0 3))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3854#(<= (div (+ (* (- 1) (div (+ (- 2) main_~sum~0 main_~i~0) (- 2))) 4) (- 2)) (+ main_~i~0 1))} is VALID [2022-04-15 13:19:43,845 INFO L290 TraceCheckUtils]: 13: Hoare triple {3862#(<= (div (+ (* (- 1) (div (+ main_~sum~0 main_~i~0 1) (- 2))) main_~i~0) (- 2)) (+ 5 main_~i~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3858#(<= (div (+ (- 1) (div (+ 5 main_~sum~0) 2) main_~i~0) (- 2)) (+ main_~i~0 3))} is VALID [2022-04-15 13:19:43,865 INFO L290 TraceCheckUtils]: 12: Hoare triple {3866#(forall ((aux_div_aux_div_v_main_~sum~0_223_51_70 Int) (v_main_~i~0_209 Int)) (or (not (<= (+ main_~i~0 1) v_main_~i~0_209)) (<= aux_div_aux_div_v_main_~sum~0_223_51_70 (+ 5 v_main_~i~0_209)) (<= 1 (+ (div (+ (- 1) (* 3 v_main_~i~0_209) main_~sum~0 main_~i~0) 2) (* 2 aux_div_aux_div_v_main_~sum~0_223_51_70)))))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3862#(<= (div (+ (* (- 1) (div (+ main_~sum~0 main_~i~0 1) (- 2))) main_~i~0) (- 2)) (+ 5 main_~i~0))} is VALID [2022-04-15 13:19:43,923 INFO L290 TraceCheckUtils]: 11: Hoare triple {3870#(forall ((aux_div_aux_div_v_main_~sum~0_223_51_70 Int) (aux_div_v_main_~sum~0_224_73 Int)) (or (<= 1 (+ aux_div_v_main_~sum~0_224_73 (* 2 aux_div_aux_div_v_main_~sum~0_223_51_70))) (<= aux_div_aux_div_v_main_~sum~0_223_51_70 (+ 7 main_~i~0)) (<= (div (+ (- 2) main_~sum~0 (* aux_div_v_main_~sum~0_224_73 (- 2)) (* main_~i~0 2)) (- 3)) (+ main_~i~0 2))))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3866#(forall ((aux_div_aux_div_v_main_~sum~0_223_51_70 Int) (v_main_~i~0_209 Int)) (or (not (<= (+ main_~i~0 1) v_main_~i~0_209)) (<= aux_div_aux_div_v_main_~sum~0_223_51_70 (+ 5 v_main_~i~0_209)) (<= 1 (+ (div (+ (- 1) (* 3 v_main_~i~0_209) main_~sum~0 main_~i~0) 2) (* 2 aux_div_aux_div_v_main_~sum~0_223_51_70)))))} is VALID [2022-04-15 13:19:43,931 INFO L290 TraceCheckUtils]: 10: Hoare triple {3874#(forall ((aux_div_aux_div_v_main_~sum~0_223_51_70 Int) (v_main_~i~0_211 Int) (aux_div_v_main_~sum~0_224_73 Int) (aux_div_v_main_~sum~0_225_100 Int)) (or (not (<= (+ main_~i~0 1) v_main_~i~0_211)) (<= 1 (+ aux_div_v_main_~sum~0_224_73 (* 2 aux_div_aux_div_v_main_~sum~0_223_51_70))) (<= aux_div_aux_div_v_main_~sum~0_223_51_70 (+ 7 v_main_~i~0_211)) (<= (+ 5 (* aux_div_v_main_~sum~0_224_73 2)) (+ (* 2 v_main_~i~0_211) main_~sum~0 main_~i~0 (* 3 aux_div_v_main_~sum~0_225_100))) (<= aux_div_v_main_~sum~0_225_100 (+ 2 v_main_~i~0_211))))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3870#(forall ((aux_div_aux_div_v_main_~sum~0_223_51_70 Int) (aux_div_v_main_~sum~0_224_73 Int)) (or (<= 1 (+ aux_div_v_main_~sum~0_224_73 (* 2 aux_div_aux_div_v_main_~sum~0_223_51_70))) (<= aux_div_aux_div_v_main_~sum~0_223_51_70 (+ 7 main_~i~0)) (<= (div (+ (- 2) main_~sum~0 (* aux_div_v_main_~sum~0_224_73 (- 2)) (* main_~i~0 2)) (- 3)) (+ main_~i~0 2))))} is VALID [2022-04-15 13:19:43,933 INFO L290 TraceCheckUtils]: 9: Hoare triple {3878#(forall ((aux_div_aux_div_v_main_~sum~0_223_51_70 Int) (v_main_~i~0_211 Int) (aux_div_v_main_~sum~0_224_73 Int) (aux_div_v_main_~sum~0_225_100 Int)) (or (<= (+ (* aux_div_v_main_~sum~0_224_73 2) 4) (+ (* 2 v_main_~i~0_211) main_~sum~0 (* 3 aux_div_v_main_~sum~0_225_100) (* main_~i~0 2))) (<= 1 (+ aux_div_v_main_~sum~0_224_73 (* 2 aux_div_aux_div_v_main_~sum~0_223_51_70))) (<= aux_div_aux_div_v_main_~sum~0_223_51_70 (+ 7 v_main_~i~0_211)) (< v_main_~i~0_211 (+ main_~i~0 2)) (<= aux_div_v_main_~sum~0_225_100 (+ 2 v_main_~i~0_211))))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3874#(forall ((aux_div_aux_div_v_main_~sum~0_223_51_70 Int) (v_main_~i~0_211 Int) (aux_div_v_main_~sum~0_224_73 Int) (aux_div_v_main_~sum~0_225_100 Int)) (or (not (<= (+ main_~i~0 1) v_main_~i~0_211)) (<= 1 (+ aux_div_v_main_~sum~0_224_73 (* 2 aux_div_aux_div_v_main_~sum~0_223_51_70))) (<= aux_div_aux_div_v_main_~sum~0_223_51_70 (+ 7 v_main_~i~0_211)) (<= (+ 5 (* aux_div_v_main_~sum~0_224_73 2)) (+ (* 2 v_main_~i~0_211) main_~sum~0 main_~i~0 (* 3 aux_div_v_main_~sum~0_225_100))) (<= aux_div_v_main_~sum~0_225_100 (+ 2 v_main_~i~0_211))))} is VALID [2022-04-15 13:19:44,006 INFO L290 TraceCheckUtils]: 8: Hoare triple {3882#(forall ((aux_div_aux_div_v_main_~sum~0_223_51_70 Int) (aux_div_v_main_~sum~0_225_100 Int)) (or (<= aux_div_v_main_~sum~0_225_100 (+ 5 main_~i~0)) (<= aux_div_aux_div_v_main_~sum~0_223_51_70 (+ main_~i~0 10)) (<= (div (+ main_~sum~0 main_~i~0 (- 4) (* 3 aux_div_v_main_~sum~0_225_100)) (- 2)) (+ (* 2 aux_div_aux_div_v_main_~sum~0_223_51_70) (* main_~i~0 2) 4))))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3878#(forall ((aux_div_aux_div_v_main_~sum~0_223_51_70 Int) (v_main_~i~0_211 Int) (aux_div_v_main_~sum~0_224_73 Int) (aux_div_v_main_~sum~0_225_100 Int)) (or (<= (+ (* aux_div_v_main_~sum~0_224_73 2) 4) (+ (* 2 v_main_~i~0_211) main_~sum~0 (* 3 aux_div_v_main_~sum~0_225_100) (* main_~i~0 2))) (<= 1 (+ aux_div_v_main_~sum~0_224_73 (* 2 aux_div_aux_div_v_main_~sum~0_223_51_70))) (<= aux_div_aux_div_v_main_~sum~0_223_51_70 (+ 7 v_main_~i~0_211)) (< v_main_~i~0_211 (+ main_~i~0 2)) (<= aux_div_v_main_~sum~0_225_100 (+ 2 v_main_~i~0_211))))} is VALID [2022-04-15 13:19:46,013 WARN L290 TraceCheckUtils]: 7: Hoare triple {3886#(forall ((aux_mod_aux_div_v_main_~sum~0_228_91_56 Int) (aux_div_aux_div_v_main_~sum~0_228_91_56 Int) (v_main_~i~0_214 Int) (aux_div_v_main_~sum~0_225_100 Int)) (or (<= (* aux_mod_aux_div_v_main_~sum~0_228_91_56 2) (+ main_~sum~0 main_~i~0 2 (* 4 aux_div_aux_div_v_main_~sum~0_228_91_56) (* 3 aux_div_v_main_~sum~0_225_100) v_main_~i~0_214)) (<= aux_div_aux_div_v_main_~sum~0_228_91_56 (+ (* 2 v_main_~i~0_214) 11)) (<= aux_div_v_main_~sum~0_225_100 (+ 5 v_main_~i~0_214)) (not (<= (+ main_~i~0 1) v_main_~i~0_214)) (>= aux_mod_aux_div_v_main_~sum~0_228_91_56 2) (> 0 aux_mod_aux_div_v_main_~sum~0_228_91_56)))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3882#(forall ((aux_div_aux_div_v_main_~sum~0_223_51_70 Int) (aux_div_v_main_~sum~0_225_100 Int)) (or (<= aux_div_v_main_~sum~0_225_100 (+ 5 main_~i~0)) (<= aux_div_aux_div_v_main_~sum~0_223_51_70 (+ main_~i~0 10)) (<= (div (+ main_~sum~0 main_~i~0 (- 4) (* 3 aux_div_v_main_~sum~0_225_100)) (- 2)) (+ (* 2 aux_div_aux_div_v_main_~sum~0_223_51_70) (* main_~i~0 2) 4))))} is UNKNOWN [2022-04-15 13:19:46,015 INFO L290 TraceCheckUtils]: 6: Hoare triple {3710#true} assume !!(((0 == ~i~0 && ~n~0 >= 0) && ~n~0 <= 100) && 0 == ~sum~0); {3886#(forall ((aux_mod_aux_div_v_main_~sum~0_228_91_56 Int) (aux_div_aux_div_v_main_~sum~0_228_91_56 Int) (v_main_~i~0_214 Int) (aux_div_v_main_~sum~0_225_100 Int)) (or (<= (* aux_mod_aux_div_v_main_~sum~0_228_91_56 2) (+ main_~sum~0 main_~i~0 2 (* 4 aux_div_aux_div_v_main_~sum~0_228_91_56) (* 3 aux_div_v_main_~sum~0_225_100) v_main_~i~0_214)) (<= aux_div_aux_div_v_main_~sum~0_228_91_56 (+ (* 2 v_main_~i~0_214) 11)) (<= aux_div_v_main_~sum~0_225_100 (+ 5 v_main_~i~0_214)) (not (<= (+ main_~i~0 1) v_main_~i~0_214)) (>= aux_mod_aux_div_v_main_~sum~0_228_91_56 2) (> 0 aux_mod_aux_div_v_main_~sum~0_228_91_56)))} is VALID [2022-04-15 13:19:46,015 INFO L290 TraceCheckUtils]: 5: Hoare triple {3710#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~i~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~n~0 := #t~nondet2;havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~sum~0 := #t~nondet3;havoc #t~nondet3; {3710#true} is VALID [2022-04-15 13:19:46,015 INFO L272 TraceCheckUtils]: 4: Hoare triple {3710#true} call #t~ret5 := main(); {3710#true} is VALID [2022-04-15 13:19:46,015 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3710#true} {3710#true} #45#return; {3710#true} is VALID [2022-04-15 13:19:46,015 INFO L290 TraceCheckUtils]: 2: Hoare triple {3710#true} assume true; {3710#true} is VALID [2022-04-15 13:19:46,015 INFO L290 TraceCheckUtils]: 1: Hoare triple {3710#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(26, 2); {3710#true} is VALID [2022-04-15 13:19:46,015 INFO L272 TraceCheckUtils]: 0: Hoare triple {3710#true} call ULTIMATE.init(); {3710#true} is VALID [2022-04-15 13:19:46,016 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 13:19:46,016 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1628984477] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 13:19:46,016 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 13:19:46,016 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 18, 18] total 48 [2022-04-15 13:19:46,016 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 13:19:46,016 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [627720016] [2022-04-15 13:19:46,016 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [627720016] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:19:46,016 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:19:46,016 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2022-04-15 13:19:46,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [192935928] [2022-04-15 13:19:46,017 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 13:19:46,017 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.105263157894737) internal successors, (21), 17 states have internal predecessors, (21), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2022-04-15 13:19:46,017 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 13:19:46,017 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 19 states, 19 states have (on average 1.105263157894737) internal successors, (21), 17 states have internal predecessors, (21), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:19:46,042 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:19:46,043 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-04-15 13:19:46,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 13:19:46,043 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-04-15 13:19:46,044 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=460, Invalid=1793, Unknown=3, NotChecked=0, Total=2256 [2022-04-15 13:19:46,044 INFO L87 Difference]: Start difference. First operand 26 states and 26 transitions. Second operand has 19 states, 19 states have (on average 1.105263157894737) internal successors, (21), 17 states have internal predecessors, (21), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:19:48,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:19:48,402 INFO L93 Difference]: Finished difference Result 32 states and 32 transitions. [2022-04-15 13:19:48,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-04-15 13:19:48,402 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.105263157894737) internal successors, (21), 17 states have internal predecessors, (21), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2022-04-15 13:19:48,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 13:19:48,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 1.105263157894737) internal successors, (21), 17 states have internal predecessors, (21), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:19:48,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 32 transitions. [2022-04-15 13:19:48,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 1.105263157894737) internal successors, (21), 17 states have internal predecessors, (21), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:19:48,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 32 transitions. [2022-04-15 13:19:48,403 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 19 states and 32 transitions. [2022-04-15 13:19:48,432 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:19:48,433 INFO L225 Difference]: With dead ends: 32 [2022-04-15 13:19:48,433 INFO L226 Difference]: Without dead ends: 27 [2022-04-15 13:19:48,434 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 22 SyntacticMatches, 1 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 866 ImplicationChecksByTransitivity, 9.4s TimeCoverageRelationStatistics Valid=540, Invalid=3489, Unknown=3, NotChecked=0, Total=4032 [2022-04-15 13:19:48,434 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 10 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 338 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 355 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 338 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-04-15 13:19:48,434 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 93 Invalid, 355 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 338 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-04-15 13:19:48,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-04-15 13:19:48,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2022-04-15 13:19:48,477 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 13:19:48,477 INFO L82 GeneralOperation]: Start isEquivalent. First operand 27 states. Second operand has 27 states, 22 states have (on average 1.0454545454545454) internal successors, (23), 22 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:19:48,477 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand has 27 states, 22 states have (on average 1.0454545454545454) internal successors, (23), 22 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:19:48,477 INFO L87 Difference]: Start difference. First operand 27 states. Second operand has 27 states, 22 states have (on average 1.0454545454545454) internal successors, (23), 22 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:19:48,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:19:48,477 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2022-04-15 13:19:48,477 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2022-04-15 13:19:48,478 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:19:48,478 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:19:48,478 INFO L74 IsIncluded]: Start isIncluded. First operand has 27 states, 22 states have (on average 1.0454545454545454) internal successors, (23), 22 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 27 states. [2022-04-15 13:19:48,478 INFO L87 Difference]: Start difference. First operand has 27 states, 22 states have (on average 1.0454545454545454) internal successors, (23), 22 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 27 states. [2022-04-15 13:19:48,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:19:48,478 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2022-04-15 13:19:48,478 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2022-04-15 13:19:48,478 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:19:48,479 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:19:48,479 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 13:19:48,479 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 13:19:48,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 22 states have (on average 1.0454545454545454) internal successors, (23), 22 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:19:48,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2022-04-15 13:19:48,479 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 25 [2022-04-15 13:19:48,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 13:19:48,479 INFO L478 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2022-04-15 13:19:48,479 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 1.105263157894737) internal successors, (21), 17 states have internal predecessors, (21), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:19:48,479 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 27 states and 27 transitions. [2022-04-15 13:19:48,520 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:19:48,520 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2022-04-15 13:19:48,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-15 13:19:48,520 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 13:19:48,520 INFO L499 BasicCegarLoop]: trace histogram [14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 13:19:48,536 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-04-15 13:19:48,731 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25,SelfDestructingSolverStorable26 [2022-04-15 13:19:48,731 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 13:19:48,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 13:19:48,732 INFO L85 PathProgramCache]: Analyzing trace with hash 2122365144, now seen corresponding path program 27 times [2022-04-15 13:19:48,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 13:19:48,732 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [308296377] [2022-04-15 13:19:49,058 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 13:19:49,059 INFO L85 PathProgramCache]: Analyzing trace with hash 797333095, now seen corresponding path program 1 times [2022-04-15 13:19:49,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:19:49,059 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [483513472] [2022-04-15 13:19:49,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:19:49,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:19:49,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 13:19:49,064 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 13:19:49,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 13:19:49,067 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 13:19:49,067 INFO L85 PathProgramCache]: Analyzing trace with hash 2122365144, now seen corresponding path program 28 times [2022-04-15 13:19:49,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:19:49,067 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1808762077] [2022-04-15 13:19:49,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:19:49,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:19:49,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:19:49,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 13:19:49,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:19:49,612 INFO L290 TraceCheckUtils]: 0: Hoare triple {4136#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(26, 2); {4114#true} is VALID [2022-04-15 13:19:49,612 INFO L290 TraceCheckUtils]: 1: Hoare triple {4114#true} assume true; {4114#true} is VALID [2022-04-15 13:19:49,612 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4114#true} {4114#true} #45#return; {4114#true} is VALID [2022-04-15 13:19:49,612 INFO L272 TraceCheckUtils]: 0: Hoare triple {4114#true} call ULTIMATE.init(); {4136#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 13:19:49,613 INFO L290 TraceCheckUtils]: 1: Hoare triple {4136#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(26, 2); {4114#true} is VALID [2022-04-15 13:19:49,613 INFO L290 TraceCheckUtils]: 2: Hoare triple {4114#true} assume true; {4114#true} is VALID [2022-04-15 13:19:49,613 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4114#true} {4114#true} #45#return; {4114#true} is VALID [2022-04-15 13:19:49,613 INFO L272 TraceCheckUtils]: 4: Hoare triple {4114#true} call #t~ret5 := main(); {4114#true} is VALID [2022-04-15 13:19:49,613 INFO L290 TraceCheckUtils]: 5: Hoare triple {4114#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~i~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~n~0 := #t~nondet2;havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~sum~0 := #t~nondet3;havoc #t~nondet3; {4114#true} is VALID [2022-04-15 13:19:49,613 INFO L290 TraceCheckUtils]: 6: Hoare triple {4114#true} assume !!(((0 == ~i~0 && ~n~0 >= 0) && ~n~0 <= 100) && 0 == ~sum~0); {4119#(<= 0 (+ main_~sum~0 (* main_~i~0 14)))} is VALID [2022-04-15 13:19:49,614 INFO L290 TraceCheckUtils]: 7: Hoare triple {4119#(<= 0 (+ main_~sum~0 (* main_~i~0 14)))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4120#(<= 13 (+ (* main_~i~0 13) main_~sum~0))} is VALID [2022-04-15 13:19:49,615 INFO L290 TraceCheckUtils]: 8: Hoare triple {4120#(<= 13 (+ (* main_~i~0 13) main_~sum~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4121#(<= 25 (+ main_~sum~0 (* main_~i~0 12)))} is VALID [2022-04-15 13:19:49,615 INFO L290 TraceCheckUtils]: 9: Hoare triple {4121#(<= 25 (+ main_~sum~0 (* main_~i~0 12)))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4122#(<= 36 (+ main_~sum~0 (* main_~i~0 11)))} is VALID [2022-04-15 13:19:49,617 INFO L290 TraceCheckUtils]: 10: Hoare triple {4122#(<= 36 (+ main_~sum~0 (* main_~i~0 11)))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4123#(<= 46 (+ main_~sum~0 (* main_~i~0 10)))} is VALID [2022-04-15 13:19:49,618 INFO L290 TraceCheckUtils]: 11: Hoare triple {4123#(<= 46 (+ main_~sum~0 (* main_~i~0 10)))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4124#(<= 55 (+ (* main_~i~0 9) main_~sum~0))} is VALID [2022-04-15 13:19:49,620 INFO L290 TraceCheckUtils]: 12: Hoare triple {4124#(<= 55 (+ (* main_~i~0 9) main_~sum~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4125#(<= 63 (+ main_~sum~0 (* main_~i~0 8)))} is VALID [2022-04-15 13:19:49,620 INFO L290 TraceCheckUtils]: 13: Hoare triple {4125#(<= 63 (+ main_~sum~0 (* main_~i~0 8)))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4126#(<= 70 (+ (* 7 main_~i~0) main_~sum~0))} is VALID [2022-04-15 13:19:49,621 INFO L290 TraceCheckUtils]: 14: Hoare triple {4126#(<= 70 (+ (* 7 main_~i~0) main_~sum~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4127#(<= 76 (+ (* main_~i~0 6) main_~sum~0))} is VALID [2022-04-15 13:19:49,622 INFO L290 TraceCheckUtils]: 15: Hoare triple {4127#(<= 76 (+ (* main_~i~0 6) main_~sum~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4128#(<= 81 (+ (* 5 main_~i~0) main_~sum~0))} is VALID [2022-04-15 13:19:49,624 INFO L290 TraceCheckUtils]: 16: Hoare triple {4128#(<= 81 (+ (* 5 main_~i~0) main_~sum~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4129#(<= 85 (+ main_~sum~0 (* main_~i~0 4)))} is VALID [2022-04-15 13:19:49,625 INFO L290 TraceCheckUtils]: 17: Hoare triple {4129#(<= 85 (+ main_~sum~0 (* main_~i~0 4)))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4130#(<= 88 (+ main_~sum~0 (* main_~i~0 3)))} is VALID [2022-04-15 13:19:49,626 INFO L290 TraceCheckUtils]: 18: Hoare triple {4130#(<= 88 (+ main_~sum~0 (* main_~i~0 3)))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4131#(<= 90 (+ main_~sum~0 (* main_~i~0 2)))} is VALID [2022-04-15 13:19:49,627 INFO L290 TraceCheckUtils]: 19: Hoare triple {4131#(<= 90 (+ main_~sum~0 (* main_~i~0 2)))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4132#(<= 91 (+ main_~sum~0 main_~i~0))} is VALID [2022-04-15 13:19:49,629 INFO L290 TraceCheckUtils]: 20: Hoare triple {4132#(<= 91 (+ main_~sum~0 main_~i~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4133#(<= 91 main_~sum~0)} is VALID [2022-04-15 13:19:49,629 INFO L290 TraceCheckUtils]: 21: Hoare triple {4133#(<= 91 main_~sum~0)} assume !(~i~0 < ~n~0); {4133#(<= 91 main_~sum~0)} is VALID [2022-04-15 13:19:49,629 INFO L272 TraceCheckUtils]: 22: Hoare triple {4133#(<= 91 main_~sum~0)} call __VERIFIER_assert((if ~sum~0 >= 0 then 1 else 0)); {4134#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 13:19:49,630 INFO L290 TraceCheckUtils]: 23: Hoare triple {4134#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {4135#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 13:19:49,630 INFO L290 TraceCheckUtils]: 24: Hoare triple {4135#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {4115#false} is VALID [2022-04-15 13:19:49,630 INFO L290 TraceCheckUtils]: 25: Hoare triple {4115#false} assume !false; {4115#false} is VALID [2022-04-15 13:19:49,630 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 13:19:49,630 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 13:19:49,630 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1808762077] [2022-04-15 13:19:49,630 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1808762077] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 13:19:49,630 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1969925836] [2022-04-15 13:19:49,631 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 13:19:49,631 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 13:19:49,631 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 13:19:49,631 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 13:19:49,632 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-04-15 13:19:49,668 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 13:19:49,668 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 13:19:49,669 INFO L263 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 32 conjunts are in the unsatisfiable core [2022-04-15 13:19:49,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:19:49,683 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 13:19:50,912 INFO L272 TraceCheckUtils]: 0: Hoare triple {4114#true} call ULTIMATE.init(); {4114#true} is VALID [2022-04-15 13:19:50,912 INFO L290 TraceCheckUtils]: 1: Hoare triple {4114#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(26, 2); {4114#true} is VALID [2022-04-15 13:19:50,912 INFO L290 TraceCheckUtils]: 2: Hoare triple {4114#true} assume true; {4114#true} is VALID [2022-04-15 13:19:50,912 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4114#true} {4114#true} #45#return; {4114#true} is VALID [2022-04-15 13:19:50,912 INFO L272 TraceCheckUtils]: 4: Hoare triple {4114#true} call #t~ret5 := main(); {4114#true} is VALID [2022-04-15 13:19:50,912 INFO L290 TraceCheckUtils]: 5: Hoare triple {4114#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~i~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~n~0 := #t~nondet2;havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~sum~0 := #t~nondet3;havoc #t~nondet3; {4114#true} is VALID [2022-04-15 13:19:50,915 INFO L290 TraceCheckUtils]: 6: Hoare triple {4114#true} assume !!(((0 == ~i~0 && ~n~0 >= 0) && ~n~0 <= 100) && 0 == ~sum~0); {4158#(and (<= 0 main_~i~0) (<= 0 main_~sum~0))} is VALID [2022-04-15 13:19:50,917 INFO L290 TraceCheckUtils]: 7: Hoare triple {4158#(and (<= 0 main_~i~0) (<= 0 main_~sum~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4162#(and (<= 0 main_~sum~0) (<= 1 main_~i~0))} is VALID [2022-04-15 13:19:50,918 INFO L290 TraceCheckUtils]: 8: Hoare triple {4162#(and (<= 0 main_~sum~0) (<= 1 main_~i~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4166#(and (<= 2 main_~i~0) (<= 1 main_~sum~0))} is VALID [2022-04-15 13:19:50,919 INFO L290 TraceCheckUtils]: 9: Hoare triple {4166#(and (<= 2 main_~i~0) (<= 1 main_~sum~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4170#(and (<= 3 main_~sum~0) (<= 3 main_~i~0))} is VALID [2022-04-15 13:19:50,920 INFO L290 TraceCheckUtils]: 10: Hoare triple {4170#(and (<= 3 main_~sum~0) (<= 3 main_~i~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4174#(and (<= 6 main_~sum~0) (<= 4 main_~i~0))} is VALID [2022-04-15 13:19:50,921 INFO L290 TraceCheckUtils]: 11: Hoare triple {4174#(and (<= 6 main_~sum~0) (<= 4 main_~i~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4178#(and (<= 10 main_~sum~0) (<= 5 main_~i~0))} is VALID [2022-04-15 13:19:50,922 INFO L290 TraceCheckUtils]: 12: Hoare triple {4178#(and (<= 10 main_~sum~0) (<= 5 main_~i~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4182#(and (<= 15 main_~sum~0) (<= 6 main_~i~0))} is VALID [2022-04-15 13:19:50,923 INFO L290 TraceCheckUtils]: 13: Hoare triple {4182#(and (<= 15 main_~sum~0) (<= 6 main_~i~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4186#(and (<= 21 main_~sum~0) (<= 7 main_~i~0))} is VALID [2022-04-15 13:19:50,924 INFO L290 TraceCheckUtils]: 14: Hoare triple {4186#(and (<= 21 main_~sum~0) (<= 7 main_~i~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4190#(and (<= 8 main_~i~0) (<= 28 main_~sum~0))} is VALID [2022-04-15 13:19:50,924 INFO L290 TraceCheckUtils]: 15: Hoare triple {4190#(and (<= 8 main_~i~0) (<= 28 main_~sum~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4194#(and (<= 9 main_~i~0) (<= 36 main_~sum~0))} is VALID [2022-04-15 13:19:50,925 INFO L290 TraceCheckUtils]: 16: Hoare triple {4194#(and (<= 9 main_~i~0) (<= 36 main_~sum~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4198#(and (<= 10 main_~i~0) (<= 45 main_~sum~0))} is VALID [2022-04-15 13:19:50,926 INFO L290 TraceCheckUtils]: 17: Hoare triple {4198#(and (<= 10 main_~i~0) (<= 45 main_~sum~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4202#(and (<= 55 main_~sum~0) (<= 11 main_~i~0))} is VALID [2022-04-15 13:19:50,928 INFO L290 TraceCheckUtils]: 18: Hoare triple {4202#(and (<= 55 main_~sum~0) (<= 11 main_~i~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4206#(and (<= 66 main_~sum~0) (<= 12 main_~i~0))} is VALID [2022-04-15 13:19:50,928 INFO L290 TraceCheckUtils]: 19: Hoare triple {4206#(and (<= 66 main_~sum~0) (<= 12 main_~i~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4210#(and (<= 13 main_~i~0) (<= 78 main_~sum~0))} is VALID [2022-04-15 13:19:50,929 INFO L290 TraceCheckUtils]: 20: Hoare triple {4210#(and (<= 13 main_~i~0) (<= 78 main_~sum~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4133#(<= 91 main_~sum~0)} is VALID [2022-04-15 13:19:50,930 INFO L290 TraceCheckUtils]: 21: Hoare triple {4133#(<= 91 main_~sum~0)} assume !(~i~0 < ~n~0); {4133#(<= 91 main_~sum~0)} is VALID [2022-04-15 13:19:50,930 INFO L272 TraceCheckUtils]: 22: Hoare triple {4133#(<= 91 main_~sum~0)} call __VERIFIER_assert((if ~sum~0 >= 0 then 1 else 0)); {4220#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 13:19:50,931 INFO L290 TraceCheckUtils]: 23: Hoare triple {4220#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {4224#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 13:19:50,931 INFO L290 TraceCheckUtils]: 24: Hoare triple {4224#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {4115#false} is VALID [2022-04-15 13:19:50,931 INFO L290 TraceCheckUtils]: 25: Hoare triple {4115#false} assume !false; {4115#false} is VALID [2022-04-15 13:19:50,931 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 91 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 13:19:50,931 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 13:20:13,936 INFO L290 TraceCheckUtils]: 25: Hoare triple {4115#false} assume !false; {4115#false} is VALID [2022-04-15 13:20:13,937 INFO L290 TraceCheckUtils]: 24: Hoare triple {4224#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {4115#false} is VALID [2022-04-15 13:20:13,937 INFO L290 TraceCheckUtils]: 23: Hoare triple {4220#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {4224#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 13:20:13,938 INFO L272 TraceCheckUtils]: 22: Hoare triple {4240#(<= 0 main_~sum~0)} call __VERIFIER_assert((if ~sum~0 >= 0 then 1 else 0)); {4220#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 13:20:13,938 INFO L290 TraceCheckUtils]: 21: Hoare triple {4240#(<= 0 main_~sum~0)} assume !(~i~0 < ~n~0); {4240#(<= 0 main_~sum~0)} is VALID [2022-04-15 13:20:13,941 INFO L290 TraceCheckUtils]: 20: Hoare triple {4247#(<= 0 (+ main_~sum~0 main_~i~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4240#(<= 0 main_~sum~0)} is VALID [2022-04-15 13:20:13,942 INFO L290 TraceCheckUtils]: 19: Hoare triple {4251#(<= 0 (+ main_~sum~0 (* main_~i~0 2) 1))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4247#(<= 0 (+ main_~sum~0 main_~i~0))} is VALID [2022-04-15 13:20:13,943 INFO L290 TraceCheckUtils]: 18: Hoare triple {4255#(<= (div (+ main_~sum~0 main_~i~0 1) (- 2)) (+ main_~i~0 1))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4251#(<= 0 (+ main_~sum~0 (* main_~i~0 2) 1))} is VALID [2022-04-15 13:20:13,944 INFO L290 TraceCheckUtils]: 17: Hoare triple {4259#(<= (div main_~sum~0 (- 2)) (+ 3 (* main_~i~0 2)))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4255#(<= (div (+ main_~sum~0 main_~i~0 1) (- 2)) (+ main_~i~0 1))} is VALID [2022-04-15 13:20:13,946 INFO L290 TraceCheckUtils]: 16: Hoare triple {4263#(<= (div (+ (* (- 1) (div (+ (- 2) main_~sum~0 main_~i~0) (- 2))) 4) (- 2)) (+ main_~i~0 1))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4259#(<= (div main_~sum~0 (- 2)) (+ 3 (* main_~i~0 2)))} is VALID [2022-04-15 13:20:13,947 INFO L290 TraceCheckUtils]: 15: Hoare triple {4267#(<= (div (+ (- 1) (div (+ 5 main_~sum~0) 2) main_~i~0) (- 2)) (+ main_~i~0 3))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4263#(<= (div (+ (* (- 1) (div (+ (- 2) main_~sum~0 main_~i~0) (- 2))) 4) (- 2)) (+ main_~i~0 1))} is VALID [2022-04-15 13:20:13,949 INFO L290 TraceCheckUtils]: 14: Hoare triple {4271#(<= (div (+ (* (- 1) (div (+ main_~sum~0 main_~i~0 1) (- 2))) main_~i~0) (- 2)) (+ 5 main_~i~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4267#(<= (div (+ (- 1) (div (+ 5 main_~sum~0) 2) main_~i~0) (- 2)) (+ main_~i~0 3))} is VALID [2022-04-15 13:20:13,959 INFO L290 TraceCheckUtils]: 13: Hoare triple {4275#(forall ((aux_mod_aux_div_v_main_~sum~0_253_51_70 Int) (v_main_~i~0_238 Int) (aux_div_aux_div_v_main_~sum~0_253_51_70 Int)) (or (<= (+ (* aux_mod_aux_div_v_main_~sum~0_253_51_70 2) 1) (+ (* 3 v_main_~i~0_238) main_~sum~0 main_~i~0 (* aux_div_aux_div_v_main_~sum~0_253_51_70 4))) (<= aux_div_aux_div_v_main_~sum~0_253_51_70 (+ 5 v_main_~i~0_238)) (> 0 aux_mod_aux_div_v_main_~sum~0_253_51_70) (>= aux_mod_aux_div_v_main_~sum~0_253_51_70 2) (not (<= (+ main_~i~0 1) v_main_~i~0_238))))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4271#(<= (div (+ (* (- 1) (div (+ main_~sum~0 main_~i~0 1) (- 2))) main_~i~0) (- 2)) (+ 5 main_~i~0))} is VALID [2022-04-15 13:20:13,961 INFO L290 TraceCheckUtils]: 12: Hoare triple {4279#(forall ((aux_mod_aux_div_v_main_~sum~0_253_51_70 Int) (v_main_~i~0_238 Int) (aux_div_aux_div_v_main_~sum~0_253_51_70 Int)) (or (<= aux_div_aux_div_v_main_~sum~0_253_51_70 (+ 5 v_main_~i~0_238)) (> 0 aux_mod_aux_div_v_main_~sum~0_253_51_70) (>= aux_mod_aux_div_v_main_~sum~0_253_51_70 2) (<= (* aux_mod_aux_div_v_main_~sum~0_253_51_70 2) (+ (* 3 v_main_~i~0_238) main_~sum~0 (* aux_div_aux_div_v_main_~sum~0_253_51_70 4) (* main_~i~0 2))) (< v_main_~i~0_238 (+ main_~i~0 2))))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4275#(forall ((aux_mod_aux_div_v_main_~sum~0_253_51_70 Int) (v_main_~i~0_238 Int) (aux_div_aux_div_v_main_~sum~0_253_51_70 Int)) (or (<= (+ (* aux_mod_aux_div_v_main_~sum~0_253_51_70 2) 1) (+ (* 3 v_main_~i~0_238) main_~sum~0 main_~i~0 (* aux_div_aux_div_v_main_~sum~0_253_51_70 4))) (<= aux_div_aux_div_v_main_~sum~0_253_51_70 (+ 5 v_main_~i~0_238)) (> 0 aux_mod_aux_div_v_main_~sum~0_253_51_70) (>= aux_mod_aux_div_v_main_~sum~0_253_51_70 2) (not (<= (+ main_~i~0 1) v_main_~i~0_238))))} is VALID [2022-04-15 13:20:13,963 INFO L290 TraceCheckUtils]: 11: Hoare triple {4283#(forall ((v_main_~i~0_240 Int) (aux_mod_aux_div_v_main_~sum~0_253_51_70 Int) (v_main_~i~0_238 Int) (aux_div_aux_div_v_main_~sum~0_253_51_70 Int)) (or (<= aux_div_aux_div_v_main_~sum~0_253_51_70 (+ 5 v_main_~i~0_238)) (< v_main_~i~0_238 (+ 2 v_main_~i~0_240)) (> 0 aux_mod_aux_div_v_main_~sum~0_253_51_70) (>= aux_mod_aux_div_v_main_~sum~0_253_51_70 2) (not (<= (+ main_~i~0 1) v_main_~i~0_240)) (<= (* aux_mod_aux_div_v_main_~sum~0_253_51_70 2) (+ (* 3 v_main_~i~0_238) main_~sum~0 main_~i~0 (* aux_div_aux_div_v_main_~sum~0_253_51_70 4) (* 2 v_main_~i~0_240)))))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4279#(forall ((aux_mod_aux_div_v_main_~sum~0_253_51_70 Int) (v_main_~i~0_238 Int) (aux_div_aux_div_v_main_~sum~0_253_51_70 Int)) (or (<= aux_div_aux_div_v_main_~sum~0_253_51_70 (+ 5 v_main_~i~0_238)) (> 0 aux_mod_aux_div_v_main_~sum~0_253_51_70) (>= aux_mod_aux_div_v_main_~sum~0_253_51_70 2) (<= (* aux_mod_aux_div_v_main_~sum~0_253_51_70 2) (+ (* 3 v_main_~i~0_238) main_~sum~0 (* aux_div_aux_div_v_main_~sum~0_253_51_70 4) (* main_~i~0 2))) (< v_main_~i~0_238 (+ main_~i~0 2))))} is VALID [2022-04-15 13:20:13,966 INFO L290 TraceCheckUtils]: 10: Hoare triple {4287#(forall ((v_main_~i~0_240 Int) (aux_mod_aux_div_v_main_~sum~0_253_51_70 Int) (v_main_~i~0_238 Int) (aux_div_aux_div_v_main_~sum~0_253_51_70 Int)) (or (<= aux_div_aux_div_v_main_~sum~0_253_51_70 (+ 5 v_main_~i~0_238)) (< v_main_~i~0_238 (+ 2 v_main_~i~0_240)) (> 0 aux_mod_aux_div_v_main_~sum~0_253_51_70) (>= aux_mod_aux_div_v_main_~sum~0_253_51_70 2) (< v_main_~i~0_240 (+ main_~i~0 2)) (<= (* aux_mod_aux_div_v_main_~sum~0_253_51_70 2) (+ (* 3 v_main_~i~0_238) main_~sum~0 (* aux_div_aux_div_v_main_~sum~0_253_51_70 4) (* main_~i~0 2) (* 2 v_main_~i~0_240) 1))))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4283#(forall ((v_main_~i~0_240 Int) (aux_mod_aux_div_v_main_~sum~0_253_51_70 Int) (v_main_~i~0_238 Int) (aux_div_aux_div_v_main_~sum~0_253_51_70 Int)) (or (<= aux_div_aux_div_v_main_~sum~0_253_51_70 (+ 5 v_main_~i~0_238)) (< v_main_~i~0_238 (+ 2 v_main_~i~0_240)) (> 0 aux_mod_aux_div_v_main_~sum~0_253_51_70) (>= aux_mod_aux_div_v_main_~sum~0_253_51_70 2) (not (<= (+ main_~i~0 1) v_main_~i~0_240)) (<= (* aux_mod_aux_div_v_main_~sum~0_253_51_70 2) (+ (* 3 v_main_~i~0_238) main_~sum~0 main_~i~0 (* aux_div_aux_div_v_main_~sum~0_253_51_70 4) (* 2 v_main_~i~0_240)))))} is VALID [2022-04-15 13:20:13,970 INFO L290 TraceCheckUtils]: 9: Hoare triple {4291#(forall ((v_main_~i~0_242 Int) (v_main_~i~0_240 Int) (aux_mod_aux_div_v_main_~sum~0_253_51_70 Int) (v_main_~i~0_238 Int) (aux_div_aux_div_v_main_~sum~0_253_51_70 Int)) (or (< v_main_~i~0_240 (+ 2 v_main_~i~0_242)) (<= aux_div_aux_div_v_main_~sum~0_253_51_70 (+ 5 v_main_~i~0_238)) (< v_main_~i~0_238 (+ 2 v_main_~i~0_240)) (> 0 aux_mod_aux_div_v_main_~sum~0_253_51_70) (>= aux_mod_aux_div_v_main_~sum~0_253_51_70 2) (<= (* aux_mod_aux_div_v_main_~sum~0_253_51_70 2) (+ (* 3 v_main_~i~0_238) main_~sum~0 main_~i~0 (* aux_div_aux_div_v_main_~sum~0_253_51_70 4) (* 2 v_main_~i~0_242) (* 2 v_main_~i~0_240) 1)) (not (<= (+ main_~i~0 1) v_main_~i~0_242))))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4287#(forall ((v_main_~i~0_240 Int) (aux_mod_aux_div_v_main_~sum~0_253_51_70 Int) (v_main_~i~0_238 Int) (aux_div_aux_div_v_main_~sum~0_253_51_70 Int)) (or (<= aux_div_aux_div_v_main_~sum~0_253_51_70 (+ 5 v_main_~i~0_238)) (< v_main_~i~0_238 (+ 2 v_main_~i~0_240)) (> 0 aux_mod_aux_div_v_main_~sum~0_253_51_70) (>= aux_mod_aux_div_v_main_~sum~0_253_51_70 2) (< v_main_~i~0_240 (+ main_~i~0 2)) (<= (* aux_mod_aux_div_v_main_~sum~0_253_51_70 2) (+ (* 3 v_main_~i~0_238) main_~sum~0 (* aux_div_aux_div_v_main_~sum~0_253_51_70 4) (* main_~i~0 2) (* 2 v_main_~i~0_240) 1))))} is VALID [2022-04-15 13:20:14,038 INFO L290 TraceCheckUtils]: 8: Hoare triple {4295#(forall ((v_main_~i~0_242 Int) (v_main_~i~0_240 Int) (aux_mod_aux_div_v_main_~sum~0_253_51_70 Int) (v_main_~i~0_238 Int) (aux_div_aux_div_v_main_~sum~0_253_51_70 Int)) (or (< v_main_~i~0_240 (+ 2 v_main_~i~0_242)) (<= aux_div_aux_div_v_main_~sum~0_253_51_70 (+ 5 v_main_~i~0_238)) (< v_main_~i~0_238 (+ 2 v_main_~i~0_240)) (< v_main_~i~0_242 (+ main_~i~0 2)) (> 0 aux_mod_aux_div_v_main_~sum~0_253_51_70) (>= aux_mod_aux_div_v_main_~sum~0_253_51_70 2) (<= (* aux_mod_aux_div_v_main_~sum~0_253_51_70 2) (+ (* 3 v_main_~i~0_238) main_~sum~0 2 (* aux_div_aux_div_v_main_~sum~0_253_51_70 4) (* 2 v_main_~i~0_242) (* main_~i~0 2) (* 2 v_main_~i~0_240)))))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4291#(forall ((v_main_~i~0_242 Int) (v_main_~i~0_240 Int) (aux_mod_aux_div_v_main_~sum~0_253_51_70 Int) (v_main_~i~0_238 Int) (aux_div_aux_div_v_main_~sum~0_253_51_70 Int)) (or (< v_main_~i~0_240 (+ 2 v_main_~i~0_242)) (<= aux_div_aux_div_v_main_~sum~0_253_51_70 (+ 5 v_main_~i~0_238)) (< v_main_~i~0_238 (+ 2 v_main_~i~0_240)) (> 0 aux_mod_aux_div_v_main_~sum~0_253_51_70) (>= aux_mod_aux_div_v_main_~sum~0_253_51_70 2) (<= (* aux_mod_aux_div_v_main_~sum~0_253_51_70 2) (+ (* 3 v_main_~i~0_238) main_~sum~0 main_~i~0 (* aux_div_aux_div_v_main_~sum~0_253_51_70 4) (* 2 v_main_~i~0_242) (* 2 v_main_~i~0_240) 1)) (not (<= (+ main_~i~0 1) v_main_~i~0_242))))} is VALID [2022-04-15 13:20:14,047 INFO L290 TraceCheckUtils]: 7: Hoare triple {4299#(forall ((v_main_~i~0_244 Int) (v_main_~i~0_242 Int) (v_main_~i~0_240 Int) (aux_mod_aux_div_v_main_~sum~0_253_51_70 Int) (v_main_~i~0_238 Int) (aux_div_aux_div_v_main_~sum~0_253_51_70 Int)) (or (< v_main_~i~0_240 (+ 2 v_main_~i~0_242)) (<= aux_div_aux_div_v_main_~sum~0_253_51_70 (+ 5 v_main_~i~0_238)) (< v_main_~i~0_238 (+ 2 v_main_~i~0_240)) (> 0 aux_mod_aux_div_v_main_~sum~0_253_51_70) (>= aux_mod_aux_div_v_main_~sum~0_253_51_70 2) (not (<= (+ main_~i~0 1) v_main_~i~0_244)) (< v_main_~i~0_242 (+ 2 v_main_~i~0_244)) (<= (* aux_mod_aux_div_v_main_~sum~0_253_51_70 2) (+ (* 3 v_main_~i~0_238) (* 2 v_main_~i~0_244) main_~sum~0 main_~i~0 2 (* aux_div_aux_div_v_main_~sum~0_253_51_70 4) (* 2 v_main_~i~0_242) (* 2 v_main_~i~0_240)))))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4295#(forall ((v_main_~i~0_242 Int) (v_main_~i~0_240 Int) (aux_mod_aux_div_v_main_~sum~0_253_51_70 Int) (v_main_~i~0_238 Int) (aux_div_aux_div_v_main_~sum~0_253_51_70 Int)) (or (< v_main_~i~0_240 (+ 2 v_main_~i~0_242)) (<= aux_div_aux_div_v_main_~sum~0_253_51_70 (+ 5 v_main_~i~0_238)) (< v_main_~i~0_238 (+ 2 v_main_~i~0_240)) (< v_main_~i~0_242 (+ main_~i~0 2)) (> 0 aux_mod_aux_div_v_main_~sum~0_253_51_70) (>= aux_mod_aux_div_v_main_~sum~0_253_51_70 2) (<= (* aux_mod_aux_div_v_main_~sum~0_253_51_70 2) (+ (* 3 v_main_~i~0_238) main_~sum~0 2 (* aux_div_aux_div_v_main_~sum~0_253_51_70 4) (* 2 v_main_~i~0_242) (* main_~i~0 2) (* 2 v_main_~i~0_240)))))} is VALID [2022-04-15 13:20:14,048 INFO L290 TraceCheckUtils]: 6: Hoare triple {4114#true} assume !!(((0 == ~i~0 && ~n~0 >= 0) && ~n~0 <= 100) && 0 == ~sum~0); {4299#(forall ((v_main_~i~0_244 Int) (v_main_~i~0_242 Int) (v_main_~i~0_240 Int) (aux_mod_aux_div_v_main_~sum~0_253_51_70 Int) (v_main_~i~0_238 Int) (aux_div_aux_div_v_main_~sum~0_253_51_70 Int)) (or (< v_main_~i~0_240 (+ 2 v_main_~i~0_242)) (<= aux_div_aux_div_v_main_~sum~0_253_51_70 (+ 5 v_main_~i~0_238)) (< v_main_~i~0_238 (+ 2 v_main_~i~0_240)) (> 0 aux_mod_aux_div_v_main_~sum~0_253_51_70) (>= aux_mod_aux_div_v_main_~sum~0_253_51_70 2) (not (<= (+ main_~i~0 1) v_main_~i~0_244)) (< v_main_~i~0_242 (+ 2 v_main_~i~0_244)) (<= (* aux_mod_aux_div_v_main_~sum~0_253_51_70 2) (+ (* 3 v_main_~i~0_238) (* 2 v_main_~i~0_244) main_~sum~0 main_~i~0 2 (* aux_div_aux_div_v_main_~sum~0_253_51_70 4) (* 2 v_main_~i~0_242) (* 2 v_main_~i~0_240)))))} is VALID [2022-04-15 13:20:14,048 INFO L290 TraceCheckUtils]: 5: Hoare triple {4114#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~i~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~n~0 := #t~nondet2;havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~sum~0 := #t~nondet3;havoc #t~nondet3; {4114#true} is VALID [2022-04-15 13:20:14,048 INFO L272 TraceCheckUtils]: 4: Hoare triple {4114#true} call #t~ret5 := main(); {4114#true} is VALID [2022-04-15 13:20:14,048 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4114#true} {4114#true} #45#return; {4114#true} is VALID [2022-04-15 13:20:14,048 INFO L290 TraceCheckUtils]: 2: Hoare triple {4114#true} assume true; {4114#true} is VALID [2022-04-15 13:20:14,048 INFO L290 TraceCheckUtils]: 1: Hoare triple {4114#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(26, 2); {4114#true} is VALID [2022-04-15 13:20:14,048 INFO L272 TraceCheckUtils]: 0: Hoare triple {4114#true} call ULTIMATE.init(); {4114#true} is VALID [2022-04-15 13:20:14,049 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 13:20:14,049 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1969925836] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 13:20:14,049 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 13:20:14,049 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 19, 19] total 51 [2022-04-15 13:20:14,049 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 13:20:14,049 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [308296377] [2022-04-15 13:20:14,049 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [308296377] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:20:14,049 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:20:14,049 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2022-04-15 13:20:14,049 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1365954831] [2022-04-15 13:20:14,049 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 13:20:14,050 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.1) internal successors, (22), 18 states have internal predecessors, (22), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2022-04-15 13:20:14,050 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 13:20:14,050 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 20 states, 20 states have (on average 1.1) internal successors, (22), 18 states have internal predecessors, (22), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:20:14,074 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:20:14,074 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-04-15 13:20:14,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 13:20:14,075 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-04-15 13:20:14,075 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=522, Invalid=2028, Unknown=0, NotChecked=0, Total=2550 [2022-04-15 13:20:14,075 INFO L87 Difference]: Start difference. First operand 27 states and 27 transitions. Second operand has 20 states, 20 states have (on average 1.1) internal successors, (22), 18 states have internal predecessors, (22), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:20:17,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:20:17,083 INFO L93 Difference]: Finished difference Result 33 states and 33 transitions. [2022-04-15 13:20:17,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-04-15 13:20:17,083 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.1) internal successors, (22), 18 states have internal predecessors, (22), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2022-04-15 13:20:17,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 13:20:17,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 1.1) internal successors, (22), 18 states have internal predecessors, (22), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:20:17,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 33 transitions. [2022-04-15 13:20:17,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 1.1) internal successors, (22), 18 states have internal predecessors, (22), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:20:17,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 33 transitions. [2022-04-15 13:20:17,085 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 20 states and 33 transitions. [2022-04-15 13:20:17,118 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:20:17,118 INFO L225 Difference]: With dead ends: 33 [2022-04-15 13:20:17,118 INFO L226 Difference]: Without dead ends: 28 [2022-04-15 13:20:17,119 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 22 SyntacticMatches, 1 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 988 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=607, Invalid=3949, Unknown=0, NotChecked=0, Total=4556 [2022-04-15 13:20:17,119 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 10 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 376 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 394 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 376 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-04-15 13:20:17,120 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 98 Invalid, 394 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 376 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-04-15 13:20:17,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2022-04-15 13:20:17,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2022-04-15 13:20:17,175 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 13:20:17,176 INFO L82 GeneralOperation]: Start isEquivalent. First operand 28 states. Second operand has 28 states, 23 states have (on average 1.0434782608695652) internal successors, (24), 23 states have internal predecessors, (24), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:20:17,176 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand has 28 states, 23 states have (on average 1.0434782608695652) internal successors, (24), 23 states have internal predecessors, (24), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:20:17,176 INFO L87 Difference]: Start difference. First operand 28 states. Second operand has 28 states, 23 states have (on average 1.0434782608695652) internal successors, (24), 23 states have internal predecessors, (24), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:20:17,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:20:17,176 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2022-04-15 13:20:17,176 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2022-04-15 13:20:17,176 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:20:17,176 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:20:17,177 INFO L74 IsIncluded]: Start isIncluded. First operand has 28 states, 23 states have (on average 1.0434782608695652) internal successors, (24), 23 states have internal predecessors, (24), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 28 states. [2022-04-15 13:20:17,177 INFO L87 Difference]: Start difference. First operand has 28 states, 23 states have (on average 1.0434782608695652) internal successors, (24), 23 states have internal predecessors, (24), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 28 states. [2022-04-15 13:20:17,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:20:17,177 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2022-04-15 13:20:17,177 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2022-04-15 13:20:17,177 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:20:17,177 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:20:17,177 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 13:20:17,177 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 13:20:17,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 23 states have (on average 1.0434782608695652) internal successors, (24), 23 states have internal predecessors, (24), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:20:17,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 28 transitions. [2022-04-15 13:20:17,178 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 28 transitions. Word has length 26 [2022-04-15 13:20:17,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 13:20:17,178 INFO L478 AbstractCegarLoop]: Abstraction has 28 states and 28 transitions. [2022-04-15 13:20:17,178 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 1.1) internal successors, (22), 18 states have internal predecessors, (22), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:20:17,178 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 28 states and 28 transitions. [2022-04-15 13:20:17,226 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:20:17,226 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2022-04-15 13:20:17,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-04-15 13:20:17,226 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 13:20:17,226 INFO L499 BasicCegarLoop]: trace histogram [15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 13:20:17,242 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-04-15 13:20:17,436 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27,SelfDestructingSolverStorable28,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 13:20:17,436 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 13:20:17,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 13:20:17,437 INFO L85 PathProgramCache]: Analyzing trace with hash 1404198854, now seen corresponding path program 29 times [2022-04-15 13:20:17,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 13:20:17,437 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1867492007] [2022-04-15 13:20:17,741 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 13:20:17,742 INFO L85 PathProgramCache]: Analyzing trace with hash 856438439, now seen corresponding path program 1 times [2022-04-15 13:20:17,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:20:17,742 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1513721935] [2022-04-15 13:20:17,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:20:17,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:20:17,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 13:20:17,747 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 13:20:17,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 13:20:17,750 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 13:20:17,750 INFO L85 PathProgramCache]: Analyzing trace with hash 1404198854, now seen corresponding path program 30 times [2022-04-15 13:20:17,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:20:17,751 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1265905562] [2022-04-15 13:20:17,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:20:17,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:20:17,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:20:18,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 13:20:18,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:20:18,312 INFO L290 TraceCheckUtils]: 0: Hoare triple {4558#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(26, 2); {4535#true} is VALID [2022-04-15 13:20:18,312 INFO L290 TraceCheckUtils]: 1: Hoare triple {4535#true} assume true; {4535#true} is VALID [2022-04-15 13:20:18,312 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4535#true} {4535#true} #45#return; {4535#true} is VALID [2022-04-15 13:20:18,312 INFO L272 TraceCheckUtils]: 0: Hoare triple {4535#true} call ULTIMATE.init(); {4558#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 13:20:18,312 INFO L290 TraceCheckUtils]: 1: Hoare triple {4558#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(26, 2); {4535#true} is VALID [2022-04-15 13:20:18,312 INFO L290 TraceCheckUtils]: 2: Hoare triple {4535#true} assume true; {4535#true} is VALID [2022-04-15 13:20:18,313 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4535#true} {4535#true} #45#return; {4535#true} is VALID [2022-04-15 13:20:18,313 INFO L272 TraceCheckUtils]: 4: Hoare triple {4535#true} call #t~ret5 := main(); {4535#true} is VALID [2022-04-15 13:20:18,313 INFO L290 TraceCheckUtils]: 5: Hoare triple {4535#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~i~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~n~0 := #t~nondet2;havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~sum~0 := #t~nondet3;havoc #t~nondet3; {4535#true} is VALID [2022-04-15 13:20:18,314 INFO L290 TraceCheckUtils]: 6: Hoare triple {4535#true} assume !!(((0 == ~i~0 && ~n~0 >= 0) && ~n~0 <= 100) && 0 == ~sum~0); {4540#(<= 0 (+ main_~sum~0 (* main_~i~0 15)))} is VALID [2022-04-15 13:20:18,317 INFO L290 TraceCheckUtils]: 7: Hoare triple {4540#(<= 0 (+ main_~sum~0 (* main_~i~0 15)))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4541#(<= 14 (+ main_~sum~0 (* main_~i~0 14)))} is VALID [2022-04-15 13:20:18,317 INFO L290 TraceCheckUtils]: 8: Hoare triple {4541#(<= 14 (+ main_~sum~0 (* main_~i~0 14)))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4542#(<= 27 (+ (* main_~i~0 13) main_~sum~0))} is VALID [2022-04-15 13:20:18,319 INFO L290 TraceCheckUtils]: 9: Hoare triple {4542#(<= 27 (+ (* main_~i~0 13) main_~sum~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4543#(<= 39 (+ main_~sum~0 (* main_~i~0 12)))} is VALID [2022-04-15 13:20:18,320 INFO L290 TraceCheckUtils]: 10: Hoare triple {4543#(<= 39 (+ main_~sum~0 (* main_~i~0 12)))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4544#(<= 50 (+ main_~sum~0 (* main_~i~0 11)))} is VALID [2022-04-15 13:20:18,321 INFO L290 TraceCheckUtils]: 11: Hoare triple {4544#(<= 50 (+ main_~sum~0 (* main_~i~0 11)))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4545#(<= 60 (+ main_~sum~0 (* main_~i~0 10)))} is VALID [2022-04-15 13:20:18,322 INFO L290 TraceCheckUtils]: 12: Hoare triple {4545#(<= 60 (+ main_~sum~0 (* main_~i~0 10)))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4546#(<= 69 (+ (* main_~i~0 9) main_~sum~0))} is VALID [2022-04-15 13:20:18,322 INFO L290 TraceCheckUtils]: 13: Hoare triple {4546#(<= 69 (+ (* main_~i~0 9) main_~sum~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4547#(<= 77 (+ main_~sum~0 (* main_~i~0 8)))} is VALID [2022-04-15 13:20:18,324 INFO L290 TraceCheckUtils]: 14: Hoare triple {4547#(<= 77 (+ main_~sum~0 (* main_~i~0 8)))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4548#(<= 84 (+ (* 7 main_~i~0) main_~sum~0))} is VALID [2022-04-15 13:20:18,325 INFO L290 TraceCheckUtils]: 15: Hoare triple {4548#(<= 84 (+ (* 7 main_~i~0) main_~sum~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4549#(<= 90 (+ (* main_~i~0 6) main_~sum~0))} is VALID [2022-04-15 13:20:18,327 INFO L290 TraceCheckUtils]: 16: Hoare triple {4549#(<= 90 (+ (* main_~i~0 6) main_~sum~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4550#(<= 95 (+ (* 5 main_~i~0) main_~sum~0))} is VALID [2022-04-15 13:20:18,327 INFO L290 TraceCheckUtils]: 17: Hoare triple {4550#(<= 95 (+ (* 5 main_~i~0) main_~sum~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4551#(<= 99 (+ main_~sum~0 (* main_~i~0 4)))} is VALID [2022-04-15 13:20:18,329 INFO L290 TraceCheckUtils]: 18: Hoare triple {4551#(<= 99 (+ main_~sum~0 (* main_~i~0 4)))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4552#(<= 102 (+ main_~sum~0 (* main_~i~0 3)))} is VALID [2022-04-15 13:20:18,330 INFO L290 TraceCheckUtils]: 19: Hoare triple {4552#(<= 102 (+ main_~sum~0 (* main_~i~0 3)))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4553#(<= 104 (+ main_~sum~0 (* main_~i~0 2)))} is VALID [2022-04-15 13:20:18,332 INFO L290 TraceCheckUtils]: 20: Hoare triple {4553#(<= 104 (+ main_~sum~0 (* main_~i~0 2)))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4554#(<= 105 (+ main_~sum~0 main_~i~0))} is VALID [2022-04-15 13:20:18,337 INFO L290 TraceCheckUtils]: 21: Hoare triple {4554#(<= 105 (+ main_~sum~0 main_~i~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4555#(<= 105 main_~sum~0)} is VALID [2022-04-15 13:20:18,338 INFO L290 TraceCheckUtils]: 22: Hoare triple {4555#(<= 105 main_~sum~0)} assume !(~i~0 < ~n~0); {4555#(<= 105 main_~sum~0)} is VALID [2022-04-15 13:20:18,338 INFO L272 TraceCheckUtils]: 23: Hoare triple {4555#(<= 105 main_~sum~0)} call __VERIFIER_assert((if ~sum~0 >= 0 then 1 else 0)); {4556#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 13:20:18,338 INFO L290 TraceCheckUtils]: 24: Hoare triple {4556#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {4557#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 13:20:18,339 INFO L290 TraceCheckUtils]: 25: Hoare triple {4557#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {4536#false} is VALID [2022-04-15 13:20:18,339 INFO L290 TraceCheckUtils]: 26: Hoare triple {4536#false} assume !false; {4536#false} is VALID [2022-04-15 13:20:18,339 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 13:20:18,339 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 13:20:18,339 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1265905562] [2022-04-15 13:20:18,339 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1265905562] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 13:20:18,339 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [111027230] [2022-04-15 13:20:18,339 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 13:20:18,339 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 13:20:18,340 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 13:20:18,340 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 13:20:18,341 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-04-15 13:20:18,378 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) [2022-04-15 13:20:18,378 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 13:20:18,379 INFO L263 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 34 conjunts are in the unsatisfiable core [2022-04-15 13:20:18,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:20:18,394 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 13:20:19,681 INFO L272 TraceCheckUtils]: 0: Hoare triple {4535#true} call ULTIMATE.init(); {4535#true} is VALID [2022-04-15 13:20:19,681 INFO L290 TraceCheckUtils]: 1: Hoare triple {4535#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(26, 2); {4535#true} is VALID [2022-04-15 13:20:19,682 INFO L290 TraceCheckUtils]: 2: Hoare triple {4535#true} assume true; {4535#true} is VALID [2022-04-15 13:20:19,682 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4535#true} {4535#true} #45#return; {4535#true} is VALID [2022-04-15 13:20:19,682 INFO L272 TraceCheckUtils]: 4: Hoare triple {4535#true} call #t~ret5 := main(); {4535#true} is VALID [2022-04-15 13:20:19,682 INFO L290 TraceCheckUtils]: 5: Hoare triple {4535#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~i~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~n~0 := #t~nondet2;havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~sum~0 := #t~nondet3;havoc #t~nondet3; {4535#true} is VALID [2022-04-15 13:20:19,682 INFO L290 TraceCheckUtils]: 6: Hoare triple {4535#true} assume !!(((0 == ~i~0 && ~n~0 >= 0) && ~n~0 <= 100) && 0 == ~sum~0); {4580#(and (<= 0 main_~i~0) (<= 0 main_~sum~0))} is VALID [2022-04-15 13:20:19,685 INFO L290 TraceCheckUtils]: 7: Hoare triple {4580#(and (<= 0 main_~i~0) (<= 0 main_~sum~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4584#(and (<= 0 main_~sum~0) (<= 1 main_~i~0))} is VALID [2022-04-15 13:20:19,686 INFO L290 TraceCheckUtils]: 8: Hoare triple {4584#(and (<= 0 main_~sum~0) (<= 1 main_~i~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4588#(and (<= 2 main_~i~0) (<= 1 main_~sum~0))} is VALID [2022-04-15 13:20:19,687 INFO L290 TraceCheckUtils]: 9: Hoare triple {4588#(and (<= 2 main_~i~0) (<= 1 main_~sum~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4592#(and (<= 3 main_~sum~0) (<= 3 main_~i~0))} is VALID [2022-04-15 13:20:19,688 INFO L290 TraceCheckUtils]: 10: Hoare triple {4592#(and (<= 3 main_~sum~0) (<= 3 main_~i~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4596#(and (<= 6 main_~sum~0) (<= 4 main_~i~0))} is VALID [2022-04-15 13:20:19,689 INFO L290 TraceCheckUtils]: 11: Hoare triple {4596#(and (<= 6 main_~sum~0) (<= 4 main_~i~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4600#(and (<= 10 main_~sum~0) (<= 5 main_~i~0))} is VALID [2022-04-15 13:20:19,690 INFO L290 TraceCheckUtils]: 12: Hoare triple {4600#(and (<= 10 main_~sum~0) (<= 5 main_~i~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4604#(and (<= 15 main_~sum~0) (<= 6 main_~i~0))} is VALID [2022-04-15 13:20:19,691 INFO L290 TraceCheckUtils]: 13: Hoare triple {4604#(and (<= 15 main_~sum~0) (<= 6 main_~i~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4608#(and (<= 21 main_~sum~0) (<= 7 main_~i~0))} is VALID [2022-04-15 13:20:19,692 INFO L290 TraceCheckUtils]: 14: Hoare triple {4608#(and (<= 21 main_~sum~0) (<= 7 main_~i~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4612#(and (<= 8 main_~i~0) (<= 28 main_~sum~0))} is VALID [2022-04-15 13:20:19,693 INFO L290 TraceCheckUtils]: 15: Hoare triple {4612#(and (<= 8 main_~i~0) (<= 28 main_~sum~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4616#(and (<= 9 main_~i~0) (<= 36 main_~sum~0))} is VALID [2022-04-15 13:20:19,694 INFO L290 TraceCheckUtils]: 16: Hoare triple {4616#(and (<= 9 main_~i~0) (<= 36 main_~sum~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4620#(and (<= 10 main_~i~0) (<= 45 main_~sum~0))} is VALID [2022-04-15 13:20:19,695 INFO L290 TraceCheckUtils]: 17: Hoare triple {4620#(and (<= 10 main_~i~0) (<= 45 main_~sum~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4624#(and (<= 55 main_~sum~0) (<= 11 main_~i~0))} is VALID [2022-04-15 13:20:19,696 INFO L290 TraceCheckUtils]: 18: Hoare triple {4624#(and (<= 55 main_~sum~0) (<= 11 main_~i~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4628#(and (<= 66 main_~sum~0) (<= 12 main_~i~0))} is VALID [2022-04-15 13:20:19,696 INFO L290 TraceCheckUtils]: 19: Hoare triple {4628#(and (<= 66 main_~sum~0) (<= 12 main_~i~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4632#(and (<= 13 main_~i~0) (<= 78 main_~sum~0))} is VALID [2022-04-15 13:20:19,697 INFO L290 TraceCheckUtils]: 20: Hoare triple {4632#(and (<= 13 main_~i~0) (<= 78 main_~sum~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4636#(and (<= 14 main_~i~0) (<= 91 main_~sum~0))} is VALID [2022-04-15 13:20:19,698 INFO L290 TraceCheckUtils]: 21: Hoare triple {4636#(and (<= 14 main_~i~0) (<= 91 main_~sum~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4555#(<= 105 main_~sum~0)} is VALID [2022-04-15 13:20:19,699 INFO L290 TraceCheckUtils]: 22: Hoare triple {4555#(<= 105 main_~sum~0)} assume !(~i~0 < ~n~0); {4555#(<= 105 main_~sum~0)} is VALID [2022-04-15 13:20:19,699 INFO L272 TraceCheckUtils]: 23: Hoare triple {4555#(<= 105 main_~sum~0)} call __VERIFIER_assert((if ~sum~0 >= 0 then 1 else 0)); {4646#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 13:20:19,699 INFO L290 TraceCheckUtils]: 24: Hoare triple {4646#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {4650#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 13:20:19,700 INFO L290 TraceCheckUtils]: 25: Hoare triple {4650#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {4536#false} is VALID [2022-04-15 13:20:19,700 INFO L290 TraceCheckUtils]: 26: Hoare triple {4536#false} assume !false; {4536#false} is VALID [2022-04-15 13:20:19,700 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 105 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 13:20:19,700 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 13:20:44,525 INFO L290 TraceCheckUtils]: 26: Hoare triple {4536#false} assume !false; {4536#false} is VALID [2022-04-15 13:20:44,525 INFO L290 TraceCheckUtils]: 25: Hoare triple {4650#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {4536#false} is VALID [2022-04-15 13:20:44,526 INFO L290 TraceCheckUtils]: 24: Hoare triple {4646#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {4650#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 13:20:44,526 INFO L272 TraceCheckUtils]: 23: Hoare triple {4666#(<= 0 main_~sum~0)} call __VERIFIER_assert((if ~sum~0 >= 0 then 1 else 0)); {4646#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 13:20:44,526 INFO L290 TraceCheckUtils]: 22: Hoare triple {4666#(<= 0 main_~sum~0)} assume !(~i~0 < ~n~0); {4666#(<= 0 main_~sum~0)} is VALID [2022-04-15 13:20:44,529 INFO L290 TraceCheckUtils]: 21: Hoare triple {4673#(<= 0 (+ main_~sum~0 main_~i~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4666#(<= 0 main_~sum~0)} is VALID [2022-04-15 13:20:44,531 INFO L290 TraceCheckUtils]: 20: Hoare triple {4677#(<= 0 (+ main_~sum~0 (* main_~i~0 2) 1))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4673#(<= 0 (+ main_~sum~0 main_~i~0))} is VALID [2022-04-15 13:20:44,532 INFO L290 TraceCheckUtils]: 19: Hoare triple {4681#(<= (div (+ main_~sum~0 main_~i~0 1) (- 2)) (+ main_~i~0 1))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4677#(<= 0 (+ main_~sum~0 (* main_~i~0 2) 1))} is VALID [2022-04-15 13:20:44,534 INFO L290 TraceCheckUtils]: 18: Hoare triple {4685#(<= (div main_~sum~0 (- 2)) (+ 3 (* main_~i~0 2)))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4681#(<= (div (+ main_~sum~0 main_~i~0 1) (- 2)) (+ main_~i~0 1))} is VALID [2022-04-15 13:20:44,535 INFO L290 TraceCheckUtils]: 17: Hoare triple {4689#(<= (div (+ (* (- 1) (div (+ (- 2) main_~sum~0 main_~i~0) (- 2))) 4) (- 2)) (+ main_~i~0 1))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4685#(<= (div main_~sum~0 (- 2)) (+ 3 (* main_~i~0 2)))} is VALID [2022-04-15 13:20:44,537 INFO L290 TraceCheckUtils]: 16: Hoare triple {4693#(<= (div (+ (- 1) (div (+ 5 main_~sum~0) 2) main_~i~0) (- 2)) (+ main_~i~0 3))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4689#(<= (div (+ (* (- 1) (div (+ (- 2) main_~sum~0 main_~i~0) (- 2))) 4) (- 2)) (+ main_~i~0 1))} is VALID [2022-04-15 13:20:44,538 INFO L290 TraceCheckUtils]: 15: Hoare triple {4697#(<= (div (+ (* (- 1) (div (+ main_~sum~0 main_~i~0 1) (- 2))) main_~i~0) (- 2)) (+ 5 main_~i~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4693#(<= (div (+ (- 1) (div (+ 5 main_~sum~0) 2) main_~i~0) (- 2)) (+ main_~i~0 3))} is VALID [2022-04-15 13:20:44,597 INFO L290 TraceCheckUtils]: 14: Hoare triple {4701#(forall ((aux_div_aux_div_v_main_~sum~0_285_51_70 Int) (aux_mod_aux_div_v_main_~sum~0_285_51_70 Int) (v_main_~i~0_269 Int)) (or (> 0 aux_mod_aux_div_v_main_~sum~0_285_51_70) (<= aux_div_aux_div_v_main_~sum~0_285_51_70 (+ 5 v_main_~i~0_269)) (not (<= (+ main_~i~0 1) v_main_~i~0_269)) (<= (+ (* 2 aux_mod_aux_div_v_main_~sum~0_285_51_70) 1) (+ (* 3 v_main_~i~0_269) (* aux_div_aux_div_v_main_~sum~0_285_51_70 4) main_~sum~0 main_~i~0)) (>= aux_mod_aux_div_v_main_~sum~0_285_51_70 2)))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4697#(<= (div (+ (* (- 1) (div (+ main_~sum~0 main_~i~0 1) (- 2))) main_~i~0) (- 2)) (+ 5 main_~i~0))} is VALID [2022-04-15 13:20:44,599 INFO L290 TraceCheckUtils]: 13: Hoare triple {4705#(forall ((aux_div_aux_div_v_main_~sum~0_285_51_70 Int) (aux_mod_aux_div_v_main_~sum~0_285_51_70 Int) (v_main_~i~0_269 Int)) (or (> 0 aux_mod_aux_div_v_main_~sum~0_285_51_70) (<= aux_div_aux_div_v_main_~sum~0_285_51_70 (+ 5 v_main_~i~0_269)) (<= (* 2 aux_mod_aux_div_v_main_~sum~0_285_51_70) (+ (* 3 v_main_~i~0_269) (* aux_div_aux_div_v_main_~sum~0_285_51_70 4) main_~sum~0 (* main_~i~0 2))) (>= aux_mod_aux_div_v_main_~sum~0_285_51_70 2) (< v_main_~i~0_269 (+ main_~i~0 2))))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4701#(forall ((aux_div_aux_div_v_main_~sum~0_285_51_70 Int) (aux_mod_aux_div_v_main_~sum~0_285_51_70 Int) (v_main_~i~0_269 Int)) (or (> 0 aux_mod_aux_div_v_main_~sum~0_285_51_70) (<= aux_div_aux_div_v_main_~sum~0_285_51_70 (+ 5 v_main_~i~0_269)) (not (<= (+ main_~i~0 1) v_main_~i~0_269)) (<= (+ (* 2 aux_mod_aux_div_v_main_~sum~0_285_51_70) 1) (+ (* 3 v_main_~i~0_269) (* aux_div_aux_div_v_main_~sum~0_285_51_70 4) main_~sum~0 main_~i~0)) (>= aux_mod_aux_div_v_main_~sum~0_285_51_70 2)))} is VALID [2022-04-15 13:20:44,601 INFO L290 TraceCheckUtils]: 12: Hoare triple {4709#(forall ((aux_div_aux_div_v_main_~sum~0_285_51_70 Int) (v_main_~i~0_271 Int) (aux_mod_aux_div_v_main_~sum~0_285_51_70 Int) (v_main_~i~0_269 Int)) (or (not (<= (+ main_~i~0 1) v_main_~i~0_271)) (> 0 aux_mod_aux_div_v_main_~sum~0_285_51_70) (<= aux_div_aux_div_v_main_~sum~0_285_51_70 (+ 5 v_main_~i~0_269)) (>= aux_mod_aux_div_v_main_~sum~0_285_51_70 2) (<= (* 2 aux_mod_aux_div_v_main_~sum~0_285_51_70) (+ (* 3 v_main_~i~0_269) (* aux_div_aux_div_v_main_~sum~0_285_51_70 4) main_~sum~0 main_~i~0 (* 2 v_main_~i~0_271))) (< v_main_~i~0_269 (+ 2 v_main_~i~0_271))))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4705#(forall ((aux_div_aux_div_v_main_~sum~0_285_51_70 Int) (aux_mod_aux_div_v_main_~sum~0_285_51_70 Int) (v_main_~i~0_269 Int)) (or (> 0 aux_mod_aux_div_v_main_~sum~0_285_51_70) (<= aux_div_aux_div_v_main_~sum~0_285_51_70 (+ 5 v_main_~i~0_269)) (<= (* 2 aux_mod_aux_div_v_main_~sum~0_285_51_70) (+ (* 3 v_main_~i~0_269) (* aux_div_aux_div_v_main_~sum~0_285_51_70 4) main_~sum~0 (* main_~i~0 2))) (>= aux_mod_aux_div_v_main_~sum~0_285_51_70 2) (< v_main_~i~0_269 (+ main_~i~0 2))))} is VALID [2022-04-15 13:20:44,603 INFO L290 TraceCheckUtils]: 11: Hoare triple {4713#(forall ((aux_div_aux_div_v_main_~sum~0_285_51_70 Int) (v_main_~i~0_271 Int) (aux_mod_aux_div_v_main_~sum~0_285_51_70 Int) (v_main_~i~0_269 Int)) (or (> 0 aux_mod_aux_div_v_main_~sum~0_285_51_70) (<= (* 2 aux_mod_aux_div_v_main_~sum~0_285_51_70) (+ (* 3 v_main_~i~0_269) (* aux_div_aux_div_v_main_~sum~0_285_51_70 4) main_~sum~0 (* main_~i~0 2) (* 2 v_main_~i~0_271) 1)) (<= aux_div_aux_div_v_main_~sum~0_285_51_70 (+ 5 v_main_~i~0_269)) (>= aux_mod_aux_div_v_main_~sum~0_285_51_70 2) (< v_main_~i~0_271 (+ main_~i~0 2)) (< v_main_~i~0_269 (+ 2 v_main_~i~0_271))))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4709#(forall ((aux_div_aux_div_v_main_~sum~0_285_51_70 Int) (v_main_~i~0_271 Int) (aux_mod_aux_div_v_main_~sum~0_285_51_70 Int) (v_main_~i~0_269 Int)) (or (not (<= (+ main_~i~0 1) v_main_~i~0_271)) (> 0 aux_mod_aux_div_v_main_~sum~0_285_51_70) (<= aux_div_aux_div_v_main_~sum~0_285_51_70 (+ 5 v_main_~i~0_269)) (>= aux_mod_aux_div_v_main_~sum~0_285_51_70 2) (<= (* 2 aux_mod_aux_div_v_main_~sum~0_285_51_70) (+ (* 3 v_main_~i~0_269) (* aux_div_aux_div_v_main_~sum~0_285_51_70 4) main_~sum~0 main_~i~0 (* 2 v_main_~i~0_271))) (< v_main_~i~0_269 (+ 2 v_main_~i~0_271))))} is VALID [2022-04-15 13:20:44,604 INFO L290 TraceCheckUtils]: 10: Hoare triple {4717#(forall ((aux_div_aux_div_v_main_~sum~0_285_51_70 Int) (v_main_~i~0_273 Int) (v_main_~i~0_271 Int) (aux_mod_aux_div_v_main_~sum~0_285_51_70 Int) (v_main_~i~0_269 Int)) (or (> 0 aux_mod_aux_div_v_main_~sum~0_285_51_70) (<= aux_div_aux_div_v_main_~sum~0_285_51_70 (+ 5 v_main_~i~0_269)) (<= (* 2 aux_mod_aux_div_v_main_~sum~0_285_51_70) (+ (* 3 v_main_~i~0_269) (* aux_div_aux_div_v_main_~sum~0_285_51_70 4) main_~sum~0 main_~i~0 (* 2 v_main_~i~0_273) (* 2 v_main_~i~0_271) 1)) (< v_main_~i~0_271 (+ 2 v_main_~i~0_273)) (>= aux_mod_aux_div_v_main_~sum~0_285_51_70 2) (not (<= (+ main_~i~0 1) v_main_~i~0_273)) (< v_main_~i~0_269 (+ 2 v_main_~i~0_271))))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4713#(forall ((aux_div_aux_div_v_main_~sum~0_285_51_70 Int) (v_main_~i~0_271 Int) (aux_mod_aux_div_v_main_~sum~0_285_51_70 Int) (v_main_~i~0_269 Int)) (or (> 0 aux_mod_aux_div_v_main_~sum~0_285_51_70) (<= (* 2 aux_mod_aux_div_v_main_~sum~0_285_51_70) (+ (* 3 v_main_~i~0_269) (* aux_div_aux_div_v_main_~sum~0_285_51_70 4) main_~sum~0 (* main_~i~0 2) (* 2 v_main_~i~0_271) 1)) (<= aux_div_aux_div_v_main_~sum~0_285_51_70 (+ 5 v_main_~i~0_269)) (>= aux_mod_aux_div_v_main_~sum~0_285_51_70 2) (< v_main_~i~0_271 (+ main_~i~0 2)) (< v_main_~i~0_269 (+ 2 v_main_~i~0_271))))} is VALID [2022-04-15 13:20:44,726 INFO L290 TraceCheckUtils]: 9: Hoare triple {4721#(forall ((aux_div_aux_div_v_main_~sum~0_285_51_70 Int) (v_main_~i~0_273 Int) (v_main_~i~0_271 Int) (aux_mod_aux_div_v_main_~sum~0_285_51_70 Int) (v_main_~i~0_269 Int)) (or (<= (* 2 aux_mod_aux_div_v_main_~sum~0_285_51_70) (+ (* 3 v_main_~i~0_269) (* aux_div_aux_div_v_main_~sum~0_285_51_70 4) main_~sum~0 2 (* 2 v_main_~i~0_273) (* main_~i~0 2) (* 2 v_main_~i~0_271))) (> 0 aux_mod_aux_div_v_main_~sum~0_285_51_70) (<= aux_div_aux_div_v_main_~sum~0_285_51_70 (+ 5 v_main_~i~0_269)) (< v_main_~i~0_271 (+ 2 v_main_~i~0_273)) (>= aux_mod_aux_div_v_main_~sum~0_285_51_70 2) (< v_main_~i~0_273 (+ main_~i~0 2)) (< v_main_~i~0_269 (+ 2 v_main_~i~0_271))))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4717#(forall ((aux_div_aux_div_v_main_~sum~0_285_51_70 Int) (v_main_~i~0_273 Int) (v_main_~i~0_271 Int) (aux_mod_aux_div_v_main_~sum~0_285_51_70 Int) (v_main_~i~0_269 Int)) (or (> 0 aux_mod_aux_div_v_main_~sum~0_285_51_70) (<= aux_div_aux_div_v_main_~sum~0_285_51_70 (+ 5 v_main_~i~0_269)) (<= (* 2 aux_mod_aux_div_v_main_~sum~0_285_51_70) (+ (* 3 v_main_~i~0_269) (* aux_div_aux_div_v_main_~sum~0_285_51_70 4) main_~sum~0 main_~i~0 (* 2 v_main_~i~0_273) (* 2 v_main_~i~0_271) 1)) (< v_main_~i~0_271 (+ 2 v_main_~i~0_273)) (>= aux_mod_aux_div_v_main_~sum~0_285_51_70 2) (not (<= (+ main_~i~0 1) v_main_~i~0_273)) (< v_main_~i~0_269 (+ 2 v_main_~i~0_271))))} is VALID [2022-04-15 13:20:46,736 WARN L290 TraceCheckUtils]: 8: Hoare triple {4725#(forall ((aux_div_aux_div_v_main_~sum~0_285_51_70 Int) (v_main_~i~0_275 Int) (v_main_~i~0_273 Int) (v_main_~i~0_271 Int) (aux_mod_aux_div_v_main_~sum~0_285_51_70 Int) (v_main_~i~0_269 Int)) (or (> 0 aux_mod_aux_div_v_main_~sum~0_285_51_70) (<= aux_div_aux_div_v_main_~sum~0_285_51_70 (+ 5 v_main_~i~0_269)) (< v_main_~i~0_271 (+ 2 v_main_~i~0_273)) (>= aux_mod_aux_div_v_main_~sum~0_285_51_70 2) (not (<= (+ main_~i~0 1) v_main_~i~0_275)) (<= (* 2 aux_mod_aux_div_v_main_~sum~0_285_51_70) (+ (* 3 v_main_~i~0_269) (* aux_div_aux_div_v_main_~sum~0_285_51_70 4) main_~sum~0 main_~i~0 2 (* 2 v_main_~i~0_273) (* 2 v_main_~i~0_271) (* 2 v_main_~i~0_275))) (< v_main_~i~0_273 (+ 2 v_main_~i~0_275)) (< v_main_~i~0_269 (+ 2 v_main_~i~0_271))))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4721#(forall ((aux_div_aux_div_v_main_~sum~0_285_51_70 Int) (v_main_~i~0_273 Int) (v_main_~i~0_271 Int) (aux_mod_aux_div_v_main_~sum~0_285_51_70 Int) (v_main_~i~0_269 Int)) (or (<= (* 2 aux_mod_aux_div_v_main_~sum~0_285_51_70) (+ (* 3 v_main_~i~0_269) (* aux_div_aux_div_v_main_~sum~0_285_51_70 4) main_~sum~0 2 (* 2 v_main_~i~0_273) (* main_~i~0 2) (* 2 v_main_~i~0_271))) (> 0 aux_mod_aux_div_v_main_~sum~0_285_51_70) (<= aux_div_aux_div_v_main_~sum~0_285_51_70 (+ 5 v_main_~i~0_269)) (< v_main_~i~0_271 (+ 2 v_main_~i~0_273)) (>= aux_mod_aux_div_v_main_~sum~0_285_51_70 2) (< v_main_~i~0_273 (+ main_~i~0 2)) (< v_main_~i~0_269 (+ 2 v_main_~i~0_271))))} is UNKNOWN [2022-04-15 13:20:46,745 INFO L290 TraceCheckUtils]: 7: Hoare triple {4729#(forall ((aux_div_aux_div_v_main_~sum~0_285_51_70 Int) (v_main_~i~0_275 Int) (v_main_~i~0_273 Int) (v_main_~i~0_271 Int) (aux_mod_aux_div_v_main_~sum~0_285_51_70 Int) (v_main_~i~0_269 Int)) (or (> 0 aux_mod_aux_div_v_main_~sum~0_285_51_70) (<= aux_div_aux_div_v_main_~sum~0_285_51_70 (+ 5 v_main_~i~0_269)) (<= (* 2 aux_mod_aux_div_v_main_~sum~0_285_51_70) (+ (* 3 v_main_~i~0_269) (* aux_div_aux_div_v_main_~sum~0_285_51_70 4) main_~sum~0 3 (* 2 v_main_~i~0_273) (* main_~i~0 2) (* 2 v_main_~i~0_271) (* 2 v_main_~i~0_275))) (< v_main_~i~0_271 (+ 2 v_main_~i~0_273)) (>= aux_mod_aux_div_v_main_~sum~0_285_51_70 2) (< v_main_~i~0_273 (+ 2 v_main_~i~0_275)) (< v_main_~i~0_275 (+ main_~i~0 2)) (< v_main_~i~0_269 (+ 2 v_main_~i~0_271))))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4725#(forall ((aux_div_aux_div_v_main_~sum~0_285_51_70 Int) (v_main_~i~0_275 Int) (v_main_~i~0_273 Int) (v_main_~i~0_271 Int) (aux_mod_aux_div_v_main_~sum~0_285_51_70 Int) (v_main_~i~0_269 Int)) (or (> 0 aux_mod_aux_div_v_main_~sum~0_285_51_70) (<= aux_div_aux_div_v_main_~sum~0_285_51_70 (+ 5 v_main_~i~0_269)) (< v_main_~i~0_271 (+ 2 v_main_~i~0_273)) (>= aux_mod_aux_div_v_main_~sum~0_285_51_70 2) (not (<= (+ main_~i~0 1) v_main_~i~0_275)) (<= (* 2 aux_mod_aux_div_v_main_~sum~0_285_51_70) (+ (* 3 v_main_~i~0_269) (* aux_div_aux_div_v_main_~sum~0_285_51_70 4) main_~sum~0 main_~i~0 2 (* 2 v_main_~i~0_273) (* 2 v_main_~i~0_271) (* 2 v_main_~i~0_275))) (< v_main_~i~0_273 (+ 2 v_main_~i~0_275)) (< v_main_~i~0_269 (+ 2 v_main_~i~0_271))))} is VALID [2022-04-15 13:20:46,746 INFO L290 TraceCheckUtils]: 6: Hoare triple {4535#true} assume !!(((0 == ~i~0 && ~n~0 >= 0) && ~n~0 <= 100) && 0 == ~sum~0); {4729#(forall ((aux_div_aux_div_v_main_~sum~0_285_51_70 Int) (v_main_~i~0_275 Int) (v_main_~i~0_273 Int) (v_main_~i~0_271 Int) (aux_mod_aux_div_v_main_~sum~0_285_51_70 Int) (v_main_~i~0_269 Int)) (or (> 0 aux_mod_aux_div_v_main_~sum~0_285_51_70) (<= aux_div_aux_div_v_main_~sum~0_285_51_70 (+ 5 v_main_~i~0_269)) (<= (* 2 aux_mod_aux_div_v_main_~sum~0_285_51_70) (+ (* 3 v_main_~i~0_269) (* aux_div_aux_div_v_main_~sum~0_285_51_70 4) main_~sum~0 3 (* 2 v_main_~i~0_273) (* main_~i~0 2) (* 2 v_main_~i~0_271) (* 2 v_main_~i~0_275))) (< v_main_~i~0_271 (+ 2 v_main_~i~0_273)) (>= aux_mod_aux_div_v_main_~sum~0_285_51_70 2) (< v_main_~i~0_273 (+ 2 v_main_~i~0_275)) (< v_main_~i~0_275 (+ main_~i~0 2)) (< v_main_~i~0_269 (+ 2 v_main_~i~0_271))))} is VALID [2022-04-15 13:20:46,746 INFO L290 TraceCheckUtils]: 5: Hoare triple {4535#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~i~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~n~0 := #t~nondet2;havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~sum~0 := #t~nondet3;havoc #t~nondet3; {4535#true} is VALID [2022-04-15 13:20:46,747 INFO L272 TraceCheckUtils]: 4: Hoare triple {4535#true} call #t~ret5 := main(); {4535#true} is VALID [2022-04-15 13:20:46,747 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4535#true} {4535#true} #45#return; {4535#true} is VALID [2022-04-15 13:20:46,747 INFO L290 TraceCheckUtils]: 2: Hoare triple {4535#true} assume true; {4535#true} is VALID [2022-04-15 13:20:46,747 INFO L290 TraceCheckUtils]: 1: Hoare triple {4535#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(26, 2); {4535#true} is VALID [2022-04-15 13:20:46,747 INFO L272 TraceCheckUtils]: 0: Hoare triple {4535#true} call ULTIMATE.init(); {4535#true} is VALID [2022-04-15 13:20:46,747 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 13:20:46,747 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [111027230] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 13:20:46,747 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 13:20:46,747 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 20, 20] total 54 [2022-04-15 13:20:46,748 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 13:20:46,748 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1867492007] [2022-04-15 13:20:46,748 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1867492007] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:20:46,748 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:20:46,748 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2022-04-15 13:20:46,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [72331693] [2022-04-15 13:20:46,748 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 13:20:46,748 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 1.0952380952380953) internal successors, (23), 19 states have internal predecessors, (23), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 27 [2022-04-15 13:20:46,748 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 13:20:46,749 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 21 states, 21 states have (on average 1.0952380952380953) internal successors, (23), 19 states have internal predecessors, (23), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:20:46,771 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:20:46,771 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-04-15 13:20:46,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 13:20:46,772 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-04-15 13:20:46,772 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=588, Invalid=2274, Unknown=0, NotChecked=0, Total=2862 [2022-04-15 13:20:46,772 INFO L87 Difference]: Start difference. First operand 28 states and 28 transitions. Second operand has 21 states, 21 states have (on average 1.0952380952380953) internal successors, (23), 19 states have internal predecessors, (23), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:20:50,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:20:50,070 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2022-04-15 13:20:50,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-04-15 13:20:50,070 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 1.0952380952380953) internal successors, (23), 19 states have internal predecessors, (23), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 27 [2022-04-15 13:20:50,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 13:20:50,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 21 states have (on average 1.0952380952380953) internal successors, (23), 19 states have internal predecessors, (23), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:20:50,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 34 transitions. [2022-04-15 13:20:50,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 21 states have (on average 1.0952380952380953) internal successors, (23), 19 states have internal predecessors, (23), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:20:50,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 34 transitions. [2022-04-15 13:20:50,071 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 21 states and 34 transitions. [2022-04-15 13:20:50,106 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:20:50,106 INFO L225 Difference]: With dead ends: 34 [2022-04-15 13:20:50,106 INFO L226 Difference]: Without dead ends: 29 [2022-04-15 13:20:50,108 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 22 SyntacticMatches, 1 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1118 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=678, Invalid=4434, Unknown=0, NotChecked=0, Total=5112 [2022-04-15 13:20:50,108 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 10 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 416 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 435 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 416 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-04-15 13:20:50,108 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 103 Invalid, 435 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 416 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-04-15 13:20:50,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-04-15 13:20:50,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2022-04-15 13:20:50,166 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 13:20:50,166 INFO L82 GeneralOperation]: Start isEquivalent. First operand 29 states. Second operand has 29 states, 24 states have (on average 1.0416666666666667) internal successors, (25), 24 states have internal predecessors, (25), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:20:50,166 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand has 29 states, 24 states have (on average 1.0416666666666667) internal successors, (25), 24 states have internal predecessors, (25), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:20:50,167 INFO L87 Difference]: Start difference. First operand 29 states. Second operand has 29 states, 24 states have (on average 1.0416666666666667) internal successors, (25), 24 states have internal predecessors, (25), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:20:50,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:20:50,167 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2022-04-15 13:20:50,167 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2022-04-15 13:20:50,167 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:20:50,167 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:20:50,167 INFO L74 IsIncluded]: Start isIncluded. First operand has 29 states, 24 states have (on average 1.0416666666666667) internal successors, (25), 24 states have internal predecessors, (25), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 29 states. [2022-04-15 13:20:50,167 INFO L87 Difference]: Start difference. First operand has 29 states, 24 states have (on average 1.0416666666666667) internal successors, (25), 24 states have internal predecessors, (25), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 29 states. [2022-04-15 13:20:50,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:20:50,168 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2022-04-15 13:20:50,168 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2022-04-15 13:20:50,168 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:20:50,168 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:20:50,168 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 13:20:50,168 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 13:20:50,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 24 states have (on average 1.0416666666666667) internal successors, (25), 24 states have internal predecessors, (25), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:20:50,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2022-04-15 13:20:50,169 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 29 transitions. Word has length 27 [2022-04-15 13:20:50,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 13:20:50,169 INFO L478 AbstractCegarLoop]: Abstraction has 29 states and 29 transitions. [2022-04-15 13:20:50,169 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 1.0952380952380953) internal successors, (23), 19 states have internal predecessors, (23), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:20:50,169 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 29 states and 29 transitions. [2022-04-15 13:20:50,230 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:20:50,231 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2022-04-15 13:20:50,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-15 13:20:50,231 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 13:20:50,231 INFO L499 BasicCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 13:20:50,247 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-04-15 13:20:50,443 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,SelfDestructingSolverStorable30,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 13:20:50,443 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 13:20:50,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 13:20:50,444 INFO L85 PathProgramCache]: Analyzing trace with hash 615880344, now seen corresponding path program 31 times [2022-04-15 13:20:50,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 13:20:50,444 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [539494862] [2022-04-15 13:20:50,762 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 13:20:50,764 INFO L85 PathProgramCache]: Analyzing trace with hash 915543783, now seen corresponding path program 1 times [2022-04-15 13:20:50,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:20:50,764 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [687621213] [2022-04-15 13:20:50,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:20:50,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:20:50,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 13:20:50,769 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 13:20:50,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 13:20:50,772 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 13:20:50,772 INFO L85 PathProgramCache]: Analyzing trace with hash 615880344, now seen corresponding path program 32 times [2022-04-15 13:20:50,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:20:50,772 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [416455119] [2022-04-15 13:20:50,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:20:50,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:20:50,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:20:51,428 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 13:20:51,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:20:51,431 INFO L290 TraceCheckUtils]: 0: Hoare triple {4997#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(26, 2); {4973#true} is VALID [2022-04-15 13:20:51,431 INFO L290 TraceCheckUtils]: 1: Hoare triple {4973#true} assume true; {4973#true} is VALID [2022-04-15 13:20:51,432 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4973#true} {4973#true} #45#return; {4973#true} is VALID [2022-04-15 13:20:51,432 INFO L272 TraceCheckUtils]: 0: Hoare triple {4973#true} call ULTIMATE.init(); {4997#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 13:20:51,432 INFO L290 TraceCheckUtils]: 1: Hoare triple {4997#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(26, 2); {4973#true} is VALID [2022-04-15 13:20:51,432 INFO L290 TraceCheckUtils]: 2: Hoare triple {4973#true} assume true; {4973#true} is VALID [2022-04-15 13:20:51,432 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4973#true} {4973#true} #45#return; {4973#true} is VALID [2022-04-15 13:20:51,432 INFO L272 TraceCheckUtils]: 4: Hoare triple {4973#true} call #t~ret5 := main(); {4973#true} is VALID [2022-04-15 13:20:51,432 INFO L290 TraceCheckUtils]: 5: Hoare triple {4973#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~i~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~n~0 := #t~nondet2;havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~sum~0 := #t~nondet3;havoc #t~nondet3; {4973#true} is VALID [2022-04-15 13:20:51,433 INFO L290 TraceCheckUtils]: 6: Hoare triple {4973#true} assume !!(((0 == ~i~0 && ~n~0 >= 0) && ~n~0 <= 100) && 0 == ~sum~0); {4978#(<= 0 (+ main_~sum~0 (* main_~i~0 16)))} is VALID [2022-04-15 13:20:51,436 INFO L290 TraceCheckUtils]: 7: Hoare triple {4978#(<= 0 (+ main_~sum~0 (* main_~i~0 16)))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4979#(<= 15 (+ main_~sum~0 (* main_~i~0 15)))} is VALID [2022-04-15 13:20:51,437 INFO L290 TraceCheckUtils]: 8: Hoare triple {4979#(<= 15 (+ main_~sum~0 (* main_~i~0 15)))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4980#(<= 29 (+ main_~sum~0 (* main_~i~0 14)))} is VALID [2022-04-15 13:20:51,438 INFO L290 TraceCheckUtils]: 9: Hoare triple {4980#(<= 29 (+ main_~sum~0 (* main_~i~0 14)))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4981#(<= 42 (+ (* main_~i~0 13) main_~sum~0))} is VALID [2022-04-15 13:20:51,439 INFO L290 TraceCheckUtils]: 10: Hoare triple {4981#(<= 42 (+ (* main_~i~0 13) main_~sum~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4982#(<= 54 (+ main_~sum~0 (* main_~i~0 12)))} is VALID [2022-04-15 13:20:51,441 INFO L290 TraceCheckUtils]: 11: Hoare triple {4982#(<= 54 (+ main_~sum~0 (* main_~i~0 12)))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4983#(<= 65 (+ main_~sum~0 (* main_~i~0 11)))} is VALID [2022-04-15 13:20:51,442 INFO L290 TraceCheckUtils]: 12: Hoare triple {4983#(<= 65 (+ main_~sum~0 (* main_~i~0 11)))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4984#(<= 75 (+ main_~sum~0 (* main_~i~0 10)))} is VALID [2022-04-15 13:20:51,443 INFO L290 TraceCheckUtils]: 13: Hoare triple {4984#(<= 75 (+ main_~sum~0 (* main_~i~0 10)))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4985#(<= 84 (+ (* main_~i~0 9) main_~sum~0))} is VALID [2022-04-15 13:20:51,444 INFO L290 TraceCheckUtils]: 14: Hoare triple {4985#(<= 84 (+ (* main_~i~0 9) main_~sum~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4986#(<= 92 (+ main_~sum~0 (* main_~i~0 8)))} is VALID [2022-04-15 13:20:51,445 INFO L290 TraceCheckUtils]: 15: Hoare triple {4986#(<= 92 (+ main_~sum~0 (* main_~i~0 8)))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4987#(<= 99 (+ (* 7 main_~i~0) main_~sum~0))} is VALID [2022-04-15 13:20:51,446 INFO L290 TraceCheckUtils]: 16: Hoare triple {4987#(<= 99 (+ (* 7 main_~i~0) main_~sum~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4988#(<= 105 (+ (* main_~i~0 6) main_~sum~0))} is VALID [2022-04-15 13:20:51,448 INFO L290 TraceCheckUtils]: 17: Hoare triple {4988#(<= 105 (+ (* main_~i~0 6) main_~sum~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4989#(<= 110 (+ (* 5 main_~i~0) main_~sum~0))} is VALID [2022-04-15 13:20:51,449 INFO L290 TraceCheckUtils]: 18: Hoare triple {4989#(<= 110 (+ (* 5 main_~i~0) main_~sum~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4990#(<= 114 (+ main_~sum~0 (* main_~i~0 4)))} is VALID [2022-04-15 13:20:51,451 INFO L290 TraceCheckUtils]: 19: Hoare triple {4990#(<= 114 (+ main_~sum~0 (* main_~i~0 4)))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4991#(<= 117 (+ main_~sum~0 (* main_~i~0 3)))} is VALID [2022-04-15 13:20:51,452 INFO L290 TraceCheckUtils]: 20: Hoare triple {4991#(<= 117 (+ main_~sum~0 (* main_~i~0 3)))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4992#(<= 119 (+ main_~sum~0 (* main_~i~0 2)))} is VALID [2022-04-15 13:20:51,454 INFO L290 TraceCheckUtils]: 21: Hoare triple {4992#(<= 119 (+ main_~sum~0 (* main_~i~0 2)))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4993#(<= 120 (+ main_~sum~0 main_~i~0))} is VALID [2022-04-15 13:20:51,456 INFO L290 TraceCheckUtils]: 22: Hoare triple {4993#(<= 120 (+ main_~sum~0 main_~i~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4994#(<= 120 main_~sum~0)} is VALID [2022-04-15 13:20:51,456 INFO L290 TraceCheckUtils]: 23: Hoare triple {4994#(<= 120 main_~sum~0)} assume !(~i~0 < ~n~0); {4994#(<= 120 main_~sum~0)} is VALID [2022-04-15 13:20:51,456 INFO L272 TraceCheckUtils]: 24: Hoare triple {4994#(<= 120 main_~sum~0)} call __VERIFIER_assert((if ~sum~0 >= 0 then 1 else 0)); {4995#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 13:20:51,457 INFO L290 TraceCheckUtils]: 25: Hoare triple {4995#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {4996#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 13:20:51,457 INFO L290 TraceCheckUtils]: 26: Hoare triple {4996#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {4974#false} is VALID [2022-04-15 13:20:51,457 INFO L290 TraceCheckUtils]: 27: Hoare triple {4974#false} assume !false; {4974#false} is VALID [2022-04-15 13:20:51,457 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 13:20:51,457 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 13:20:51,457 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [416455119] [2022-04-15 13:20:51,457 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [416455119] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 13:20:51,458 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1766477232] [2022-04-15 13:20:51,458 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 13:20:51,458 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 13:20:51,458 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 13:20:51,458 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 13:20:51,459 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-04-15 13:20:51,497 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 13:20:51,497 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 13:20:51,498 INFO L263 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 36 conjunts are in the unsatisfiable core [2022-04-15 13:20:51,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:20:51,514 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 13:20:52,869 INFO L272 TraceCheckUtils]: 0: Hoare triple {4973#true} call ULTIMATE.init(); {4973#true} is VALID [2022-04-15 13:20:52,869 INFO L290 TraceCheckUtils]: 1: Hoare triple {4973#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(26, 2); {4973#true} is VALID [2022-04-15 13:20:52,869 INFO L290 TraceCheckUtils]: 2: Hoare triple {4973#true} assume true; {4973#true} is VALID [2022-04-15 13:20:52,870 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4973#true} {4973#true} #45#return; {4973#true} is VALID [2022-04-15 13:20:52,870 INFO L272 TraceCheckUtils]: 4: Hoare triple {4973#true} call #t~ret5 := main(); {4973#true} is VALID [2022-04-15 13:20:52,870 INFO L290 TraceCheckUtils]: 5: Hoare triple {4973#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~i~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~n~0 := #t~nondet2;havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~sum~0 := #t~nondet3;havoc #t~nondet3; {4973#true} is VALID [2022-04-15 13:20:52,871 INFO L290 TraceCheckUtils]: 6: Hoare triple {4973#true} assume !!(((0 == ~i~0 && ~n~0 >= 0) && ~n~0 <= 100) && 0 == ~sum~0); {5019#(and (<= 0 main_~i~0) (<= 0 main_~sum~0))} is VALID [2022-04-15 13:20:52,874 INFO L290 TraceCheckUtils]: 7: Hoare triple {5019#(and (<= 0 main_~i~0) (<= 0 main_~sum~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5023#(and (<= 0 main_~sum~0) (<= 1 main_~i~0))} is VALID [2022-04-15 13:20:52,875 INFO L290 TraceCheckUtils]: 8: Hoare triple {5023#(and (<= 0 main_~sum~0) (<= 1 main_~i~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5027#(and (<= 2 main_~i~0) (<= 1 main_~sum~0))} is VALID [2022-04-15 13:20:52,876 INFO L290 TraceCheckUtils]: 9: Hoare triple {5027#(and (<= 2 main_~i~0) (<= 1 main_~sum~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5031#(and (<= 3 main_~sum~0) (<= 3 main_~i~0))} is VALID [2022-04-15 13:20:52,877 INFO L290 TraceCheckUtils]: 10: Hoare triple {5031#(and (<= 3 main_~sum~0) (<= 3 main_~i~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5035#(and (<= 6 main_~sum~0) (<= 4 main_~i~0))} is VALID [2022-04-15 13:20:52,879 INFO L290 TraceCheckUtils]: 11: Hoare triple {5035#(and (<= 6 main_~sum~0) (<= 4 main_~i~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5039#(and (<= 10 main_~sum~0) (<= 5 main_~i~0))} is VALID [2022-04-15 13:20:52,880 INFO L290 TraceCheckUtils]: 12: Hoare triple {5039#(and (<= 10 main_~sum~0) (<= 5 main_~i~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5043#(and (<= 15 main_~sum~0) (<= 6 main_~i~0))} is VALID [2022-04-15 13:20:52,881 INFO L290 TraceCheckUtils]: 13: Hoare triple {5043#(and (<= 15 main_~sum~0) (<= 6 main_~i~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5047#(and (<= 21 main_~sum~0) (<= 7 main_~i~0))} is VALID [2022-04-15 13:20:52,882 INFO L290 TraceCheckUtils]: 14: Hoare triple {5047#(and (<= 21 main_~sum~0) (<= 7 main_~i~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5051#(and (<= 8 main_~i~0) (<= 28 main_~sum~0))} is VALID [2022-04-15 13:20:52,883 INFO L290 TraceCheckUtils]: 15: Hoare triple {5051#(and (<= 8 main_~i~0) (<= 28 main_~sum~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5055#(and (<= 9 main_~i~0) (<= 36 main_~sum~0))} is VALID [2022-04-15 13:20:52,884 INFO L290 TraceCheckUtils]: 16: Hoare triple {5055#(and (<= 9 main_~i~0) (<= 36 main_~sum~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5059#(and (<= 10 main_~i~0) (<= 45 main_~sum~0))} is VALID [2022-04-15 13:20:52,885 INFO L290 TraceCheckUtils]: 17: Hoare triple {5059#(and (<= 10 main_~i~0) (<= 45 main_~sum~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5063#(and (<= 55 main_~sum~0) (<= 11 main_~i~0))} is VALID [2022-04-15 13:20:52,886 INFO L290 TraceCheckUtils]: 18: Hoare triple {5063#(and (<= 55 main_~sum~0) (<= 11 main_~i~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5067#(and (<= 66 main_~sum~0) (<= 12 main_~i~0))} is VALID [2022-04-15 13:20:52,887 INFO L290 TraceCheckUtils]: 19: Hoare triple {5067#(and (<= 66 main_~sum~0) (<= 12 main_~i~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5071#(and (<= 13 main_~i~0) (<= 78 main_~sum~0))} is VALID [2022-04-15 13:20:52,888 INFO L290 TraceCheckUtils]: 20: Hoare triple {5071#(and (<= 13 main_~i~0) (<= 78 main_~sum~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5075#(and (<= 14 main_~i~0) (<= 91 main_~sum~0))} is VALID [2022-04-15 13:20:52,889 INFO L290 TraceCheckUtils]: 21: Hoare triple {5075#(and (<= 14 main_~i~0) (<= 91 main_~sum~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5079#(and (<= 15 main_~i~0) (<= 105 main_~sum~0))} is VALID [2022-04-15 13:20:52,890 INFO L290 TraceCheckUtils]: 22: Hoare triple {5079#(and (<= 15 main_~i~0) (<= 105 main_~sum~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4994#(<= 120 main_~sum~0)} is VALID [2022-04-15 13:20:52,891 INFO L290 TraceCheckUtils]: 23: Hoare triple {4994#(<= 120 main_~sum~0)} assume !(~i~0 < ~n~0); {4994#(<= 120 main_~sum~0)} is VALID [2022-04-15 13:20:52,891 INFO L272 TraceCheckUtils]: 24: Hoare triple {4994#(<= 120 main_~sum~0)} call __VERIFIER_assert((if ~sum~0 >= 0 then 1 else 0)); {5089#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 13:20:52,891 INFO L290 TraceCheckUtils]: 25: Hoare triple {5089#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {5093#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 13:20:52,892 INFO L290 TraceCheckUtils]: 26: Hoare triple {5093#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {4974#false} is VALID [2022-04-15 13:20:52,892 INFO L290 TraceCheckUtils]: 27: Hoare triple {4974#false} assume !false; {4974#false} is VALID [2022-04-15 13:20:52,892 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 120 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 13:20:52,892 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 13:21:18,032 INFO L290 TraceCheckUtils]: 27: Hoare triple {4974#false} assume !false; {4974#false} is VALID [2022-04-15 13:21:18,032 INFO L290 TraceCheckUtils]: 26: Hoare triple {5093#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {4974#false} is VALID [2022-04-15 13:21:18,033 INFO L290 TraceCheckUtils]: 25: Hoare triple {5089#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {5093#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 13:21:18,033 INFO L272 TraceCheckUtils]: 24: Hoare triple {5109#(<= 0 main_~sum~0)} call __VERIFIER_assert((if ~sum~0 >= 0 then 1 else 0)); {5089#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 13:21:18,033 INFO L290 TraceCheckUtils]: 23: Hoare triple {5109#(<= 0 main_~sum~0)} assume !(~i~0 < ~n~0); {5109#(<= 0 main_~sum~0)} is VALID [2022-04-15 13:21:18,037 INFO L290 TraceCheckUtils]: 22: Hoare triple {5116#(<= 0 (+ main_~sum~0 main_~i~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5109#(<= 0 main_~sum~0)} is VALID [2022-04-15 13:21:18,039 INFO L290 TraceCheckUtils]: 21: Hoare triple {5120#(<= 0 (+ main_~sum~0 (* main_~i~0 2) 1))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5116#(<= 0 (+ main_~sum~0 main_~i~0))} is VALID [2022-04-15 13:21:18,040 INFO L290 TraceCheckUtils]: 20: Hoare triple {5124#(<= (div (+ main_~sum~0 main_~i~0 1) (- 2)) (+ main_~i~0 1))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5120#(<= 0 (+ main_~sum~0 (* main_~i~0 2) 1))} is VALID [2022-04-15 13:21:18,041 INFO L290 TraceCheckUtils]: 19: Hoare triple {5128#(<= (div main_~sum~0 (- 2)) (+ 3 (* main_~i~0 2)))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5124#(<= (div (+ main_~sum~0 main_~i~0 1) (- 2)) (+ main_~i~0 1))} is VALID [2022-04-15 13:21:18,043 INFO L290 TraceCheckUtils]: 18: Hoare triple {5132#(<= (div (+ (* (- 1) (div (+ (- 2) main_~sum~0 main_~i~0) (- 2))) 4) (- 2)) (+ main_~i~0 1))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5128#(<= (div main_~sum~0 (- 2)) (+ 3 (* main_~i~0 2)))} is VALID [2022-04-15 13:21:18,045 INFO L290 TraceCheckUtils]: 17: Hoare triple {5136#(<= (div (+ (- 1) (div (+ 5 main_~sum~0) 2) main_~i~0) (- 2)) (+ main_~i~0 3))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5132#(<= (div (+ (* (- 1) (div (+ (- 2) main_~sum~0 main_~i~0) (- 2))) 4) (- 2)) (+ main_~i~0 1))} is VALID [2022-04-15 13:21:18,047 INFO L290 TraceCheckUtils]: 16: Hoare triple {5140#(<= (div (+ (* (- 1) (div (+ main_~sum~0 main_~i~0 1) (- 2))) main_~i~0) (- 2)) (+ 5 main_~i~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5136#(<= (div (+ (- 1) (div (+ 5 main_~sum~0) 2) main_~i~0) (- 2)) (+ main_~i~0 3))} is VALID [2022-04-15 13:21:18,057 INFO L290 TraceCheckUtils]: 15: Hoare triple {5144#(forall ((aux_mod_aux_div_v_main_~sum~0_319_51_70 Int) (aux_div_aux_div_v_main_~sum~0_319_51_70 Int) (v_main_~i~0_302 Int)) (or (<= (+ (* aux_mod_aux_div_v_main_~sum~0_319_51_70 2) 1) (+ (* aux_div_aux_div_v_main_~sum~0_319_51_70 4) main_~sum~0 main_~i~0 (* 3 v_main_~i~0_302))) (>= aux_mod_aux_div_v_main_~sum~0_319_51_70 2) (not (<= (+ main_~i~0 1) v_main_~i~0_302)) (<= aux_div_aux_div_v_main_~sum~0_319_51_70 (+ 5 v_main_~i~0_302)) (> 0 aux_mod_aux_div_v_main_~sum~0_319_51_70)))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5140#(<= (div (+ (* (- 1) (div (+ main_~sum~0 main_~i~0 1) (- 2))) main_~i~0) (- 2)) (+ 5 main_~i~0))} is VALID [2022-04-15 13:21:18,061 INFO L290 TraceCheckUtils]: 14: Hoare triple {5148#(forall ((aux_mod_aux_div_v_main_~sum~0_319_51_70 Int) (aux_div_aux_div_v_main_~sum~0_319_51_70 Int) (v_main_~i~0_302 Int)) (or (<= (* aux_mod_aux_div_v_main_~sum~0_319_51_70 2) (+ (* aux_div_aux_div_v_main_~sum~0_319_51_70 4) main_~sum~0 (* 3 v_main_~i~0_302) (* main_~i~0 2))) (< v_main_~i~0_302 (+ main_~i~0 2)) (>= aux_mod_aux_div_v_main_~sum~0_319_51_70 2) (<= aux_div_aux_div_v_main_~sum~0_319_51_70 (+ 5 v_main_~i~0_302)) (> 0 aux_mod_aux_div_v_main_~sum~0_319_51_70)))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5144#(forall ((aux_mod_aux_div_v_main_~sum~0_319_51_70 Int) (aux_div_aux_div_v_main_~sum~0_319_51_70 Int) (v_main_~i~0_302 Int)) (or (<= (+ (* aux_mod_aux_div_v_main_~sum~0_319_51_70 2) 1) (+ (* aux_div_aux_div_v_main_~sum~0_319_51_70 4) main_~sum~0 main_~i~0 (* 3 v_main_~i~0_302))) (>= aux_mod_aux_div_v_main_~sum~0_319_51_70 2) (not (<= (+ main_~i~0 1) v_main_~i~0_302)) (<= aux_div_aux_div_v_main_~sum~0_319_51_70 (+ 5 v_main_~i~0_302)) (> 0 aux_mod_aux_div_v_main_~sum~0_319_51_70)))} is VALID [2022-04-15 13:21:18,294 INFO L290 TraceCheckUtils]: 13: Hoare triple {5152#(forall ((aux_mod_aux_div_v_main_~sum~0_319_51_70 Int) (v_main_~i~0_304 Int) (aux_div_aux_div_v_main_~sum~0_319_51_70 Int) (v_main_~i~0_302 Int)) (or (not (<= (+ main_~i~0 1) v_main_~i~0_304)) (>= aux_mod_aux_div_v_main_~sum~0_319_51_70 2) (< v_main_~i~0_302 (+ 2 v_main_~i~0_304)) (<= aux_div_aux_div_v_main_~sum~0_319_51_70 (+ 5 v_main_~i~0_302)) (<= (* aux_mod_aux_div_v_main_~sum~0_319_51_70 2) (+ (* aux_div_aux_div_v_main_~sum~0_319_51_70 4) main_~sum~0 main_~i~0 (* 3 v_main_~i~0_302) (* 2 v_main_~i~0_304))) (> 0 aux_mod_aux_div_v_main_~sum~0_319_51_70)))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5148#(forall ((aux_mod_aux_div_v_main_~sum~0_319_51_70 Int) (aux_div_aux_div_v_main_~sum~0_319_51_70 Int) (v_main_~i~0_302 Int)) (or (<= (* aux_mod_aux_div_v_main_~sum~0_319_51_70 2) (+ (* aux_div_aux_div_v_main_~sum~0_319_51_70 4) main_~sum~0 (* 3 v_main_~i~0_302) (* main_~i~0 2))) (< v_main_~i~0_302 (+ main_~i~0 2)) (>= aux_mod_aux_div_v_main_~sum~0_319_51_70 2) (<= aux_div_aux_div_v_main_~sum~0_319_51_70 (+ 5 v_main_~i~0_302)) (> 0 aux_mod_aux_div_v_main_~sum~0_319_51_70)))} is VALID [2022-04-15 13:21:18,298 INFO L290 TraceCheckUtils]: 12: Hoare triple {5156#(forall ((aux_mod_aux_div_v_main_~sum~0_319_51_70 Int) (v_main_~i~0_304 Int) (aux_div_aux_div_v_main_~sum~0_319_51_70 Int) (v_main_~i~0_302 Int)) (or (< v_main_~i~0_304 (+ main_~i~0 2)) (>= aux_mod_aux_div_v_main_~sum~0_319_51_70 2) (< v_main_~i~0_302 (+ 2 v_main_~i~0_304)) (<= aux_div_aux_div_v_main_~sum~0_319_51_70 (+ 5 v_main_~i~0_302)) (> 0 aux_mod_aux_div_v_main_~sum~0_319_51_70) (<= (* aux_mod_aux_div_v_main_~sum~0_319_51_70 2) (+ (* aux_div_aux_div_v_main_~sum~0_319_51_70 4) main_~sum~0 (* 3 v_main_~i~0_302) (* main_~i~0 2) (* 2 v_main_~i~0_304) 1))))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5152#(forall ((aux_mod_aux_div_v_main_~sum~0_319_51_70 Int) (v_main_~i~0_304 Int) (aux_div_aux_div_v_main_~sum~0_319_51_70 Int) (v_main_~i~0_302 Int)) (or (not (<= (+ main_~i~0 1) v_main_~i~0_304)) (>= aux_mod_aux_div_v_main_~sum~0_319_51_70 2) (< v_main_~i~0_302 (+ 2 v_main_~i~0_304)) (<= aux_div_aux_div_v_main_~sum~0_319_51_70 (+ 5 v_main_~i~0_302)) (<= (* aux_mod_aux_div_v_main_~sum~0_319_51_70 2) (+ (* aux_div_aux_div_v_main_~sum~0_319_51_70 4) main_~sum~0 main_~i~0 (* 3 v_main_~i~0_302) (* 2 v_main_~i~0_304))) (> 0 aux_mod_aux_div_v_main_~sum~0_319_51_70)))} is VALID [2022-04-15 13:21:18,300 INFO L290 TraceCheckUtils]: 11: Hoare triple {5160#(forall ((aux_mod_aux_div_v_main_~sum~0_319_51_70 Int) (v_main_~i~0_306 Int) (v_main_~i~0_304 Int) (aux_div_aux_div_v_main_~sum~0_319_51_70 Int) (v_main_~i~0_302 Int)) (or (<= (* aux_mod_aux_div_v_main_~sum~0_319_51_70 2) (+ (* aux_div_aux_div_v_main_~sum~0_319_51_70 4) (* 2 v_main_~i~0_306) main_~sum~0 main_~i~0 (* 3 v_main_~i~0_302) (* 2 v_main_~i~0_304) 1)) (>= aux_mod_aux_div_v_main_~sum~0_319_51_70 2) (< v_main_~i~0_302 (+ 2 v_main_~i~0_304)) (<= aux_div_aux_div_v_main_~sum~0_319_51_70 (+ 5 v_main_~i~0_302)) (not (<= (+ main_~i~0 1) v_main_~i~0_306)) (< v_main_~i~0_304 (+ 2 v_main_~i~0_306)) (> 0 aux_mod_aux_div_v_main_~sum~0_319_51_70)))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5156#(forall ((aux_mod_aux_div_v_main_~sum~0_319_51_70 Int) (v_main_~i~0_304 Int) (aux_div_aux_div_v_main_~sum~0_319_51_70 Int) (v_main_~i~0_302 Int)) (or (< v_main_~i~0_304 (+ main_~i~0 2)) (>= aux_mod_aux_div_v_main_~sum~0_319_51_70 2) (< v_main_~i~0_302 (+ 2 v_main_~i~0_304)) (<= aux_div_aux_div_v_main_~sum~0_319_51_70 (+ 5 v_main_~i~0_302)) (> 0 aux_mod_aux_div_v_main_~sum~0_319_51_70) (<= (* aux_mod_aux_div_v_main_~sum~0_319_51_70 2) (+ (* aux_div_aux_div_v_main_~sum~0_319_51_70 4) main_~sum~0 (* 3 v_main_~i~0_302) (* main_~i~0 2) (* 2 v_main_~i~0_304) 1))))} is VALID [2022-04-15 13:21:20,319 WARN L290 TraceCheckUtils]: 10: Hoare triple {5164#(forall ((aux_mod_aux_div_v_main_~sum~0_319_51_70 Int) (v_main_~i~0_306 Int) (v_main_~i~0_304 Int) (aux_div_aux_div_v_main_~sum~0_319_51_70 Int) (v_main_~i~0_302 Int)) (or (>= aux_mod_aux_div_v_main_~sum~0_319_51_70 2) (< v_main_~i~0_306 (+ main_~i~0 2)) (< v_main_~i~0_302 (+ 2 v_main_~i~0_304)) (<= aux_div_aux_div_v_main_~sum~0_319_51_70 (+ 5 v_main_~i~0_302)) (<= (* aux_mod_aux_div_v_main_~sum~0_319_51_70 2) (+ (* aux_div_aux_div_v_main_~sum~0_319_51_70 4) (* 2 v_main_~i~0_306) main_~sum~0 2 (* 3 v_main_~i~0_302) (* main_~i~0 2) (* 2 v_main_~i~0_304))) (< v_main_~i~0_304 (+ 2 v_main_~i~0_306)) (> 0 aux_mod_aux_div_v_main_~sum~0_319_51_70)))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5160#(forall ((aux_mod_aux_div_v_main_~sum~0_319_51_70 Int) (v_main_~i~0_306 Int) (v_main_~i~0_304 Int) (aux_div_aux_div_v_main_~sum~0_319_51_70 Int) (v_main_~i~0_302 Int)) (or (<= (* aux_mod_aux_div_v_main_~sum~0_319_51_70 2) (+ (* aux_div_aux_div_v_main_~sum~0_319_51_70 4) (* 2 v_main_~i~0_306) main_~sum~0 main_~i~0 (* 3 v_main_~i~0_302) (* 2 v_main_~i~0_304) 1)) (>= aux_mod_aux_div_v_main_~sum~0_319_51_70 2) (< v_main_~i~0_302 (+ 2 v_main_~i~0_304)) (<= aux_div_aux_div_v_main_~sum~0_319_51_70 (+ 5 v_main_~i~0_302)) (not (<= (+ main_~i~0 1) v_main_~i~0_306)) (< v_main_~i~0_304 (+ 2 v_main_~i~0_306)) (> 0 aux_mod_aux_div_v_main_~sum~0_319_51_70)))} is UNKNOWN [2022-04-15 13:21:22,349 WARN L290 TraceCheckUtils]: 9: Hoare triple {5168#(forall ((v_main_~i~0_308 Int) (aux_mod_aux_div_v_main_~sum~0_319_51_70 Int) (v_main_~i~0_306 Int) (v_main_~i~0_304 Int) (aux_div_aux_div_v_main_~sum~0_319_51_70 Int) (v_main_~i~0_302 Int)) (or (< v_main_~i~0_306 (+ 2 v_main_~i~0_308)) (>= aux_mod_aux_div_v_main_~sum~0_319_51_70 2) (< v_main_~i~0_302 (+ 2 v_main_~i~0_304)) (<= aux_div_aux_div_v_main_~sum~0_319_51_70 (+ 5 v_main_~i~0_302)) (<= (* aux_mod_aux_div_v_main_~sum~0_319_51_70 2) (+ (* aux_div_aux_div_v_main_~sum~0_319_51_70 4) (* 2 v_main_~i~0_306) main_~sum~0 main_~i~0 2 (* 3 v_main_~i~0_302) (* 2 v_main_~i~0_308) (* 2 v_main_~i~0_304))) (< v_main_~i~0_304 (+ 2 v_main_~i~0_306)) (not (<= (+ main_~i~0 1) v_main_~i~0_308)) (> 0 aux_mod_aux_div_v_main_~sum~0_319_51_70)))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5164#(forall ((aux_mod_aux_div_v_main_~sum~0_319_51_70 Int) (v_main_~i~0_306 Int) (v_main_~i~0_304 Int) (aux_div_aux_div_v_main_~sum~0_319_51_70 Int) (v_main_~i~0_302 Int)) (or (>= aux_mod_aux_div_v_main_~sum~0_319_51_70 2) (< v_main_~i~0_306 (+ main_~i~0 2)) (< v_main_~i~0_302 (+ 2 v_main_~i~0_304)) (<= aux_div_aux_div_v_main_~sum~0_319_51_70 (+ 5 v_main_~i~0_302)) (<= (* aux_mod_aux_div_v_main_~sum~0_319_51_70 2) (+ (* aux_div_aux_div_v_main_~sum~0_319_51_70 4) (* 2 v_main_~i~0_306) main_~sum~0 2 (* 3 v_main_~i~0_302) (* main_~i~0 2) (* 2 v_main_~i~0_304))) (< v_main_~i~0_304 (+ 2 v_main_~i~0_306)) (> 0 aux_mod_aux_div_v_main_~sum~0_319_51_70)))} is UNKNOWN [2022-04-15 13:21:22,389 INFO L290 TraceCheckUtils]: 8: Hoare triple {5172#(forall ((v_main_~i~0_308 Int) (aux_mod_aux_div_v_main_~sum~0_319_51_70 Int) (v_main_~i~0_306 Int) (v_main_~i~0_304 Int) (aux_div_aux_div_v_main_~sum~0_319_51_70 Int) (v_main_~i~0_302 Int)) (or (<= (* aux_mod_aux_div_v_main_~sum~0_319_51_70 2) (+ (* aux_div_aux_div_v_main_~sum~0_319_51_70 4) (* 2 v_main_~i~0_306) main_~sum~0 3 (* 3 v_main_~i~0_302) (* main_~i~0 2) (* 2 v_main_~i~0_308) (* 2 v_main_~i~0_304))) (< v_main_~i~0_306 (+ 2 v_main_~i~0_308)) (>= aux_mod_aux_div_v_main_~sum~0_319_51_70 2) (< v_main_~i~0_302 (+ 2 v_main_~i~0_304)) (<= aux_div_aux_div_v_main_~sum~0_319_51_70 (+ 5 v_main_~i~0_302)) (< v_main_~i~0_308 (+ main_~i~0 2)) (< v_main_~i~0_304 (+ 2 v_main_~i~0_306)) (> 0 aux_mod_aux_div_v_main_~sum~0_319_51_70)))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5168#(forall ((v_main_~i~0_308 Int) (aux_mod_aux_div_v_main_~sum~0_319_51_70 Int) (v_main_~i~0_306 Int) (v_main_~i~0_304 Int) (aux_div_aux_div_v_main_~sum~0_319_51_70 Int) (v_main_~i~0_302 Int)) (or (< v_main_~i~0_306 (+ 2 v_main_~i~0_308)) (>= aux_mod_aux_div_v_main_~sum~0_319_51_70 2) (< v_main_~i~0_302 (+ 2 v_main_~i~0_304)) (<= aux_div_aux_div_v_main_~sum~0_319_51_70 (+ 5 v_main_~i~0_302)) (<= (* aux_mod_aux_div_v_main_~sum~0_319_51_70 2) (+ (* aux_div_aux_div_v_main_~sum~0_319_51_70 4) (* 2 v_main_~i~0_306) main_~sum~0 main_~i~0 2 (* 3 v_main_~i~0_302) (* 2 v_main_~i~0_308) (* 2 v_main_~i~0_304))) (< v_main_~i~0_304 (+ 2 v_main_~i~0_306)) (not (<= (+ main_~i~0 1) v_main_~i~0_308)) (> 0 aux_mod_aux_div_v_main_~sum~0_319_51_70)))} is VALID [2022-04-15 13:21:23,245 INFO L290 TraceCheckUtils]: 7: Hoare triple {5176#(forall ((v_main_~i~0_310 Int) (v_main_~i~0_308 Int) (aux_mod_aux_div_v_main_~sum~0_319_51_70 Int) (v_main_~i~0_306 Int) (v_main_~i~0_304 Int) (aux_div_aux_div_v_main_~sum~0_319_51_70 Int) (v_main_~i~0_302 Int)) (or (< v_main_~i~0_308 (+ 2 v_main_~i~0_310)) (not (<= (+ main_~i~0 1) v_main_~i~0_310)) (< v_main_~i~0_306 (+ 2 v_main_~i~0_308)) (>= aux_mod_aux_div_v_main_~sum~0_319_51_70 2) (< v_main_~i~0_302 (+ 2 v_main_~i~0_304)) (<= aux_div_aux_div_v_main_~sum~0_319_51_70 (+ 5 v_main_~i~0_302)) (<= (* aux_mod_aux_div_v_main_~sum~0_319_51_70 2) (+ (* 2 v_main_~i~0_310) (* aux_div_aux_div_v_main_~sum~0_319_51_70 4) (* 2 v_main_~i~0_306) main_~sum~0 main_~i~0 3 (* 3 v_main_~i~0_302) (* 2 v_main_~i~0_308) (* 2 v_main_~i~0_304))) (< v_main_~i~0_304 (+ 2 v_main_~i~0_306)) (> 0 aux_mod_aux_div_v_main_~sum~0_319_51_70)))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5172#(forall ((v_main_~i~0_308 Int) (aux_mod_aux_div_v_main_~sum~0_319_51_70 Int) (v_main_~i~0_306 Int) (v_main_~i~0_304 Int) (aux_div_aux_div_v_main_~sum~0_319_51_70 Int) (v_main_~i~0_302 Int)) (or (<= (* aux_mod_aux_div_v_main_~sum~0_319_51_70 2) (+ (* aux_div_aux_div_v_main_~sum~0_319_51_70 4) (* 2 v_main_~i~0_306) main_~sum~0 3 (* 3 v_main_~i~0_302) (* main_~i~0 2) (* 2 v_main_~i~0_308) (* 2 v_main_~i~0_304))) (< v_main_~i~0_306 (+ 2 v_main_~i~0_308)) (>= aux_mod_aux_div_v_main_~sum~0_319_51_70 2) (< v_main_~i~0_302 (+ 2 v_main_~i~0_304)) (<= aux_div_aux_div_v_main_~sum~0_319_51_70 (+ 5 v_main_~i~0_302)) (< v_main_~i~0_308 (+ main_~i~0 2)) (< v_main_~i~0_304 (+ 2 v_main_~i~0_306)) (> 0 aux_mod_aux_div_v_main_~sum~0_319_51_70)))} is VALID [2022-04-15 13:21:23,277 INFO L290 TraceCheckUtils]: 6: Hoare triple {4973#true} assume !!(((0 == ~i~0 && ~n~0 >= 0) && ~n~0 <= 100) && 0 == ~sum~0); {5176#(forall ((v_main_~i~0_310 Int) (v_main_~i~0_308 Int) (aux_mod_aux_div_v_main_~sum~0_319_51_70 Int) (v_main_~i~0_306 Int) (v_main_~i~0_304 Int) (aux_div_aux_div_v_main_~sum~0_319_51_70 Int) (v_main_~i~0_302 Int)) (or (< v_main_~i~0_308 (+ 2 v_main_~i~0_310)) (not (<= (+ main_~i~0 1) v_main_~i~0_310)) (< v_main_~i~0_306 (+ 2 v_main_~i~0_308)) (>= aux_mod_aux_div_v_main_~sum~0_319_51_70 2) (< v_main_~i~0_302 (+ 2 v_main_~i~0_304)) (<= aux_div_aux_div_v_main_~sum~0_319_51_70 (+ 5 v_main_~i~0_302)) (<= (* aux_mod_aux_div_v_main_~sum~0_319_51_70 2) (+ (* 2 v_main_~i~0_310) (* aux_div_aux_div_v_main_~sum~0_319_51_70 4) (* 2 v_main_~i~0_306) main_~sum~0 main_~i~0 3 (* 3 v_main_~i~0_302) (* 2 v_main_~i~0_308) (* 2 v_main_~i~0_304))) (< v_main_~i~0_304 (+ 2 v_main_~i~0_306)) (> 0 aux_mod_aux_div_v_main_~sum~0_319_51_70)))} is VALID [2022-04-15 13:21:23,278 INFO L290 TraceCheckUtils]: 5: Hoare triple {4973#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~i~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~n~0 := #t~nondet2;havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~sum~0 := #t~nondet3;havoc #t~nondet3; {4973#true} is VALID [2022-04-15 13:21:23,278 INFO L272 TraceCheckUtils]: 4: Hoare triple {4973#true} call #t~ret5 := main(); {4973#true} is VALID [2022-04-15 13:21:23,278 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4973#true} {4973#true} #45#return; {4973#true} is VALID [2022-04-15 13:21:23,278 INFO L290 TraceCheckUtils]: 2: Hoare triple {4973#true} assume true; {4973#true} is VALID [2022-04-15 13:21:23,278 INFO L290 TraceCheckUtils]: 1: Hoare triple {4973#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(26, 2); {4973#true} is VALID [2022-04-15 13:21:23,278 INFO L272 TraceCheckUtils]: 0: Hoare triple {4973#true} call ULTIMATE.init(); {4973#true} is VALID [2022-04-15 13:21:23,278 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 13:21:23,279 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1766477232] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 13:21:23,279 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 13:21:23,279 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 21, 21] total 57 [2022-04-15 13:21:23,279 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 13:21:23,279 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [539494862] [2022-04-15 13:21:23,279 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [539494862] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:21:23,279 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:21:23,279 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2022-04-15 13:21:23,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1459561811] [2022-04-15 13:21:23,279 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 13:21:23,280 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 1.0909090909090908) internal successors, (24), 20 states have internal predecessors, (24), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 28 [2022-04-15 13:21:23,280 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 13:21:23,280 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 22 states, 22 states have (on average 1.0909090909090908) internal successors, (24), 20 states have internal predecessors, (24), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:21:23,305 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:21:23,305 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-04-15 13:21:23,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 13:21:23,305 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-04-15 13:21:23,306 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=658, Invalid=2534, Unknown=0, NotChecked=0, Total=3192 [2022-04-15 13:21:23,306 INFO L87 Difference]: Start difference. First operand 29 states and 29 transitions. Second operand has 22 states, 22 states have (on average 1.0909090909090908) internal successors, (24), 20 states have internal predecessors, (24), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:21:27,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:21:27,370 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2022-04-15 13:21:27,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-04-15 13:21:27,370 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 1.0909090909090908) internal successors, (24), 20 states have internal predecessors, (24), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 28 [2022-04-15 13:21:27,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 13:21:27,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 22 states have (on average 1.0909090909090908) internal successors, (24), 20 states have internal predecessors, (24), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:21:27,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 35 transitions. [2022-04-15 13:21:27,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 22 states have (on average 1.0909090909090908) internal successors, (24), 20 states have internal predecessors, (24), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:21:27,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 35 transitions. [2022-04-15 13:21:27,372 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 22 states and 35 transitions. [2022-04-15 13:21:27,406 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:21:27,406 INFO L225 Difference]: With dead ends: 35 [2022-04-15 13:21:27,406 INFO L226 Difference]: Without dead ends: 30 [2022-04-15 13:21:27,408 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 22 SyntacticMatches, 1 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1256 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=753, Invalid=4947, Unknown=0, NotChecked=0, Total=5700 [2022-04-15 13:21:27,408 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 10 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 458 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 478 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 458 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-04-15 13:21:27,408 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 108 Invalid, 478 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 458 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-04-15 13:21:27,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2022-04-15 13:21:27,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2022-04-15 13:21:27,470 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 13:21:27,470 INFO L82 GeneralOperation]: Start isEquivalent. First operand 30 states. Second operand has 30 states, 25 states have (on average 1.04) internal successors, (26), 25 states have internal predecessors, (26), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:21:27,470 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand has 30 states, 25 states have (on average 1.04) internal successors, (26), 25 states have internal predecessors, (26), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:21:27,470 INFO L87 Difference]: Start difference. First operand 30 states. Second operand has 30 states, 25 states have (on average 1.04) internal successors, (26), 25 states have internal predecessors, (26), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:21:27,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:21:27,471 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2022-04-15 13:21:27,471 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2022-04-15 13:21:27,471 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:21:27,471 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:21:27,471 INFO L74 IsIncluded]: Start isIncluded. First operand has 30 states, 25 states have (on average 1.04) internal successors, (26), 25 states have internal predecessors, (26), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 30 states. [2022-04-15 13:21:27,471 INFO L87 Difference]: Start difference. First operand has 30 states, 25 states have (on average 1.04) internal successors, (26), 25 states have internal predecessors, (26), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 30 states. [2022-04-15 13:21:27,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:21:27,472 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2022-04-15 13:21:27,472 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2022-04-15 13:21:27,472 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:21:27,472 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:21:27,472 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 13:21:27,472 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 13:21:27,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 25 states have (on average 1.04) internal successors, (26), 25 states have internal predecessors, (26), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:21:27,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 30 transitions. [2022-04-15 13:21:27,473 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 30 transitions. Word has length 28 [2022-04-15 13:21:27,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 13:21:27,473 INFO L478 AbstractCegarLoop]: Abstraction has 30 states and 30 transitions. [2022-04-15 13:21:27,473 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 1.0909090909090908) internal successors, (24), 20 states have internal predecessors, (24), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:21:27,473 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 30 states and 30 transitions. [2022-04-15 13:21:27,544 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:21:27,544 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2022-04-15 13:21:27,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-15 13:21:27,545 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 13:21:27,545 INFO L499 BasicCegarLoop]: trace histogram [17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 13:21:27,560 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2022-04-15 13:21:27,747 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable32 [2022-04-15 13:21:27,747 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 13:21:27,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 13:21:27,748 INFO L85 PathProgramCache]: Analyzing trace with hash 1947810310, now seen corresponding path program 33 times [2022-04-15 13:21:27,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 13:21:27,748 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [76633801] [2022-04-15 13:21:27,998 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 13:21:27,999 INFO L85 PathProgramCache]: Analyzing trace with hash 974649127, now seen corresponding path program 1 times [2022-04-15 13:21:28,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:21:28,000 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [730361730] [2022-04-15 13:21:28,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:21:28,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:21:28,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 13:21:28,005 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 13:21:28,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 13:21:28,020 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 13:21:28,020 INFO L85 PathProgramCache]: Analyzing trace with hash 1947810310, now seen corresponding path program 34 times [2022-04-15 13:21:28,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:21:28,020 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1125011657] [2022-04-15 13:21:28,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:21:28,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:21:28,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:21:28,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 13:21:28,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:21:28,736 INFO L290 TraceCheckUtils]: 0: Hoare triple {5453#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(26, 2); {5428#true} is VALID [2022-04-15 13:21:28,736 INFO L290 TraceCheckUtils]: 1: Hoare triple {5428#true} assume true; {5428#true} is VALID [2022-04-15 13:21:28,737 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {5428#true} {5428#true} #45#return; {5428#true} is VALID [2022-04-15 13:21:28,737 INFO L272 TraceCheckUtils]: 0: Hoare triple {5428#true} call ULTIMATE.init(); {5453#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 13:21:28,737 INFO L290 TraceCheckUtils]: 1: Hoare triple {5453#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(26, 2); {5428#true} is VALID [2022-04-15 13:21:28,737 INFO L290 TraceCheckUtils]: 2: Hoare triple {5428#true} assume true; {5428#true} is VALID [2022-04-15 13:21:28,737 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5428#true} {5428#true} #45#return; {5428#true} is VALID [2022-04-15 13:21:28,737 INFO L272 TraceCheckUtils]: 4: Hoare triple {5428#true} call #t~ret5 := main(); {5428#true} is VALID [2022-04-15 13:21:28,737 INFO L290 TraceCheckUtils]: 5: Hoare triple {5428#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~i~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~n~0 := #t~nondet2;havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~sum~0 := #t~nondet3;havoc #t~nondet3; {5428#true} is VALID [2022-04-15 13:21:28,738 INFO L290 TraceCheckUtils]: 6: Hoare triple {5428#true} assume !!(((0 == ~i~0 && ~n~0 >= 0) && ~n~0 <= 100) && 0 == ~sum~0); {5433#(<= 0 (+ main_~sum~0 (* main_~i~0 17)))} is VALID [2022-04-15 13:21:28,741 INFO L290 TraceCheckUtils]: 7: Hoare triple {5433#(<= 0 (+ main_~sum~0 (* main_~i~0 17)))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5434#(<= 16 (+ main_~sum~0 (* main_~i~0 16)))} is VALID [2022-04-15 13:21:28,743 INFO L290 TraceCheckUtils]: 8: Hoare triple {5434#(<= 16 (+ main_~sum~0 (* main_~i~0 16)))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5435#(<= 31 (+ main_~sum~0 (* main_~i~0 15)))} is VALID [2022-04-15 13:21:28,744 INFO L290 TraceCheckUtils]: 9: Hoare triple {5435#(<= 31 (+ main_~sum~0 (* main_~i~0 15)))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5436#(<= 45 (+ main_~sum~0 (* main_~i~0 14)))} is VALID [2022-04-15 13:21:28,745 INFO L290 TraceCheckUtils]: 10: Hoare triple {5436#(<= 45 (+ main_~sum~0 (* main_~i~0 14)))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5437#(<= 58 (+ (* main_~i~0 13) main_~sum~0))} is VALID [2022-04-15 13:21:28,747 INFO L290 TraceCheckUtils]: 11: Hoare triple {5437#(<= 58 (+ (* main_~i~0 13) main_~sum~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5438#(<= 70 (+ main_~sum~0 (* main_~i~0 12)))} is VALID [2022-04-15 13:21:28,748 INFO L290 TraceCheckUtils]: 12: Hoare triple {5438#(<= 70 (+ main_~sum~0 (* main_~i~0 12)))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5439#(<= 81 (+ main_~sum~0 (* main_~i~0 11)))} is VALID [2022-04-15 13:21:28,750 INFO L290 TraceCheckUtils]: 13: Hoare triple {5439#(<= 81 (+ main_~sum~0 (* main_~i~0 11)))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5440#(<= 91 (+ main_~sum~0 (* main_~i~0 10)))} is VALID [2022-04-15 13:21:28,752 INFO L290 TraceCheckUtils]: 14: Hoare triple {5440#(<= 91 (+ main_~sum~0 (* main_~i~0 10)))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5441#(<= 100 (+ (* main_~i~0 9) main_~sum~0))} is VALID [2022-04-15 13:21:28,753 INFO L290 TraceCheckUtils]: 15: Hoare triple {5441#(<= 100 (+ (* main_~i~0 9) main_~sum~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5442#(<= 108 (+ main_~sum~0 (* main_~i~0 8)))} is VALID [2022-04-15 13:21:28,755 INFO L290 TraceCheckUtils]: 16: Hoare triple {5442#(<= 108 (+ main_~sum~0 (* main_~i~0 8)))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5443#(<= 115 (+ (* 7 main_~i~0) main_~sum~0))} is VALID [2022-04-15 13:21:28,757 INFO L290 TraceCheckUtils]: 17: Hoare triple {5443#(<= 115 (+ (* 7 main_~i~0) main_~sum~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5444#(<= 121 (+ (* main_~i~0 6) main_~sum~0))} is VALID [2022-04-15 13:21:28,758 INFO L290 TraceCheckUtils]: 18: Hoare triple {5444#(<= 121 (+ (* main_~i~0 6) main_~sum~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5445#(<= 126 (+ (* 5 main_~i~0) main_~sum~0))} is VALID [2022-04-15 13:21:28,760 INFO L290 TraceCheckUtils]: 19: Hoare triple {5445#(<= 126 (+ (* 5 main_~i~0) main_~sum~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5446#(<= 130 (+ main_~sum~0 (* main_~i~0 4)))} is VALID [2022-04-15 13:21:28,762 INFO L290 TraceCheckUtils]: 20: Hoare triple {5446#(<= 130 (+ main_~sum~0 (* main_~i~0 4)))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5447#(<= 133 (+ main_~sum~0 (* main_~i~0 3)))} is VALID [2022-04-15 13:21:28,763 INFO L290 TraceCheckUtils]: 21: Hoare triple {5447#(<= 133 (+ main_~sum~0 (* main_~i~0 3)))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5448#(<= 135 (+ main_~sum~0 (* main_~i~0 2)))} is VALID [2022-04-15 13:21:28,765 INFO L290 TraceCheckUtils]: 22: Hoare triple {5448#(<= 135 (+ main_~sum~0 (* main_~i~0 2)))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5449#(<= 136 (+ main_~sum~0 main_~i~0))} is VALID [2022-04-15 13:21:28,767 INFO L290 TraceCheckUtils]: 23: Hoare triple {5449#(<= 136 (+ main_~sum~0 main_~i~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5450#(<= 136 main_~sum~0)} is VALID [2022-04-15 13:21:28,768 INFO L290 TraceCheckUtils]: 24: Hoare triple {5450#(<= 136 main_~sum~0)} assume !(~i~0 < ~n~0); {5450#(<= 136 main_~sum~0)} is VALID [2022-04-15 13:21:28,768 INFO L272 TraceCheckUtils]: 25: Hoare triple {5450#(<= 136 main_~sum~0)} call __VERIFIER_assert((if ~sum~0 >= 0 then 1 else 0)); {5451#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 13:21:28,769 INFO L290 TraceCheckUtils]: 26: Hoare triple {5451#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {5452#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 13:21:28,769 INFO L290 TraceCheckUtils]: 27: Hoare triple {5452#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {5429#false} is VALID [2022-04-15 13:21:28,769 INFO L290 TraceCheckUtils]: 28: Hoare triple {5429#false} assume !false; {5429#false} is VALID [2022-04-15 13:21:28,769 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 13:21:28,769 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 13:21:28,769 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1125011657] [2022-04-15 13:21:28,769 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1125011657] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 13:21:28,769 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [268729281] [2022-04-15 13:21:28,770 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 13:21:28,770 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 13:21:28,770 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 13:21:28,770 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 13:21:28,771 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-04-15 13:21:28,808 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 13:21:28,809 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 13:21:28,809 INFO L263 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 38 conjunts are in the unsatisfiable core [2022-04-15 13:21:28,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:21:28,828 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 13:21:30,391 INFO L272 TraceCheckUtils]: 0: Hoare triple {5428#true} call ULTIMATE.init(); {5428#true} is VALID [2022-04-15 13:21:30,391 INFO L290 TraceCheckUtils]: 1: Hoare triple {5428#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(26, 2); {5428#true} is VALID [2022-04-15 13:21:30,392 INFO L290 TraceCheckUtils]: 2: Hoare triple {5428#true} assume true; {5428#true} is VALID [2022-04-15 13:21:30,392 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5428#true} {5428#true} #45#return; {5428#true} is VALID [2022-04-15 13:21:30,392 INFO L272 TraceCheckUtils]: 4: Hoare triple {5428#true} call #t~ret5 := main(); {5428#true} is VALID [2022-04-15 13:21:30,392 INFO L290 TraceCheckUtils]: 5: Hoare triple {5428#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~i~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~n~0 := #t~nondet2;havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~sum~0 := #t~nondet3;havoc #t~nondet3; {5428#true} is VALID [2022-04-15 13:21:30,392 INFO L290 TraceCheckUtils]: 6: Hoare triple {5428#true} assume !!(((0 == ~i~0 && ~n~0 >= 0) && ~n~0 <= 100) && 0 == ~sum~0); {5475#(and (<= 0 main_~i~0) (<= 0 main_~sum~0))} is VALID [2022-04-15 13:21:30,395 INFO L290 TraceCheckUtils]: 7: Hoare triple {5475#(and (<= 0 main_~i~0) (<= 0 main_~sum~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5479#(and (<= 0 main_~sum~0) (<= 1 main_~i~0))} is VALID [2022-04-15 13:21:30,397 INFO L290 TraceCheckUtils]: 8: Hoare triple {5479#(and (<= 0 main_~sum~0) (<= 1 main_~i~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5483#(and (<= 2 main_~i~0) (<= 1 main_~sum~0))} is VALID [2022-04-15 13:21:30,398 INFO L290 TraceCheckUtils]: 9: Hoare triple {5483#(and (<= 2 main_~i~0) (<= 1 main_~sum~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5487#(and (<= 3 main_~sum~0) (<= 3 main_~i~0))} is VALID [2022-04-15 13:21:30,400 INFO L290 TraceCheckUtils]: 10: Hoare triple {5487#(and (<= 3 main_~sum~0) (<= 3 main_~i~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5491#(and (<= 6 main_~sum~0) (<= 4 main_~i~0))} is VALID [2022-04-15 13:21:30,401 INFO L290 TraceCheckUtils]: 11: Hoare triple {5491#(and (<= 6 main_~sum~0) (<= 4 main_~i~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5495#(and (<= 10 main_~sum~0) (<= 5 main_~i~0))} is VALID [2022-04-15 13:21:30,403 INFO L290 TraceCheckUtils]: 12: Hoare triple {5495#(and (<= 10 main_~sum~0) (<= 5 main_~i~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5499#(and (<= 15 main_~sum~0) (<= 6 main_~i~0))} is VALID [2022-04-15 13:21:30,404 INFO L290 TraceCheckUtils]: 13: Hoare triple {5499#(and (<= 15 main_~sum~0) (<= 6 main_~i~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5503#(and (<= 21 main_~sum~0) (<= 7 main_~i~0))} is VALID [2022-04-15 13:21:30,405 INFO L290 TraceCheckUtils]: 14: Hoare triple {5503#(and (<= 21 main_~sum~0) (<= 7 main_~i~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5507#(and (<= 8 main_~i~0) (<= 28 main_~sum~0))} is VALID [2022-04-15 13:21:30,406 INFO L290 TraceCheckUtils]: 15: Hoare triple {5507#(and (<= 8 main_~i~0) (<= 28 main_~sum~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5511#(and (<= 9 main_~i~0) (<= 36 main_~sum~0))} is VALID [2022-04-15 13:21:30,407 INFO L290 TraceCheckUtils]: 16: Hoare triple {5511#(and (<= 9 main_~i~0) (<= 36 main_~sum~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5515#(and (<= 10 main_~i~0) (<= 45 main_~sum~0))} is VALID [2022-04-15 13:21:30,408 INFO L290 TraceCheckUtils]: 17: Hoare triple {5515#(and (<= 10 main_~i~0) (<= 45 main_~sum~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5519#(and (<= 55 main_~sum~0) (<= 11 main_~i~0))} is VALID [2022-04-15 13:21:30,409 INFO L290 TraceCheckUtils]: 18: Hoare triple {5519#(and (<= 55 main_~sum~0) (<= 11 main_~i~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5523#(and (<= 66 main_~sum~0) (<= 12 main_~i~0))} is VALID [2022-04-15 13:21:30,410 INFO L290 TraceCheckUtils]: 19: Hoare triple {5523#(and (<= 66 main_~sum~0) (<= 12 main_~i~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5527#(and (<= 13 main_~i~0) (<= 78 main_~sum~0))} is VALID [2022-04-15 13:21:30,411 INFO L290 TraceCheckUtils]: 20: Hoare triple {5527#(and (<= 13 main_~i~0) (<= 78 main_~sum~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5531#(and (<= 14 main_~i~0) (<= 91 main_~sum~0))} is VALID [2022-04-15 13:21:30,413 INFO L290 TraceCheckUtils]: 21: Hoare triple {5531#(and (<= 14 main_~i~0) (<= 91 main_~sum~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5535#(and (<= 15 main_~i~0) (<= 105 main_~sum~0))} is VALID [2022-04-15 13:21:30,414 INFO L290 TraceCheckUtils]: 22: Hoare triple {5535#(and (<= 15 main_~i~0) (<= 105 main_~sum~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5539#(and (<= 16 main_~i~0) (<= 120 main_~sum~0))} is VALID [2022-04-15 13:21:30,415 INFO L290 TraceCheckUtils]: 23: Hoare triple {5539#(and (<= 16 main_~i~0) (<= 120 main_~sum~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5450#(<= 136 main_~sum~0)} is VALID [2022-04-15 13:21:30,416 INFO L290 TraceCheckUtils]: 24: Hoare triple {5450#(<= 136 main_~sum~0)} assume !(~i~0 < ~n~0); {5450#(<= 136 main_~sum~0)} is VALID [2022-04-15 13:21:30,416 INFO L272 TraceCheckUtils]: 25: Hoare triple {5450#(<= 136 main_~sum~0)} call __VERIFIER_assert((if ~sum~0 >= 0 then 1 else 0)); {5549#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 13:21:30,416 INFO L290 TraceCheckUtils]: 26: Hoare triple {5549#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {5553#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 13:21:30,417 INFO L290 TraceCheckUtils]: 27: Hoare triple {5553#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {5429#false} is VALID [2022-04-15 13:21:30,417 INFO L290 TraceCheckUtils]: 28: Hoare triple {5429#false} assume !false; {5429#false} is VALID [2022-04-15 13:21:30,417 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 136 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 13:21:30,417 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 13:21:59,379 INFO L290 TraceCheckUtils]: 28: Hoare triple {5429#false} assume !false; {5429#false} is VALID [2022-04-15 13:21:59,380 INFO L290 TraceCheckUtils]: 27: Hoare triple {5553#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {5429#false} is VALID [2022-04-15 13:21:59,380 INFO L290 TraceCheckUtils]: 26: Hoare triple {5549#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {5553#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 13:21:59,380 INFO L272 TraceCheckUtils]: 25: Hoare triple {5569#(<= 0 main_~sum~0)} call __VERIFIER_assert((if ~sum~0 >= 0 then 1 else 0)); {5549#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 13:21:59,381 INFO L290 TraceCheckUtils]: 24: Hoare triple {5569#(<= 0 main_~sum~0)} assume !(~i~0 < ~n~0); {5569#(<= 0 main_~sum~0)} is VALID [2022-04-15 13:21:59,385 INFO L290 TraceCheckUtils]: 23: Hoare triple {5576#(<= 0 (+ main_~sum~0 main_~i~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5569#(<= 0 main_~sum~0)} is VALID [2022-04-15 13:21:59,387 INFO L290 TraceCheckUtils]: 22: Hoare triple {5580#(<= 0 (+ main_~sum~0 (* main_~i~0 2) 1))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5576#(<= 0 (+ main_~sum~0 main_~i~0))} is VALID [2022-04-15 13:21:59,388 INFO L290 TraceCheckUtils]: 21: Hoare triple {5584#(<= (div (+ main_~sum~0 main_~i~0 1) (- 2)) (+ main_~i~0 1))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5580#(<= 0 (+ main_~sum~0 (* main_~i~0 2) 1))} is VALID [2022-04-15 13:21:59,390 INFO L290 TraceCheckUtils]: 20: Hoare triple {5588#(<= (div main_~sum~0 (- 2)) (+ 3 (* main_~i~0 2)))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5584#(<= (div (+ main_~sum~0 main_~i~0 1) (- 2)) (+ main_~i~0 1))} is VALID [2022-04-15 13:21:59,392 INFO L290 TraceCheckUtils]: 19: Hoare triple {5592#(<= (div (+ (* (- 1) (div (+ (- 2) main_~sum~0 main_~i~0) (- 2))) 4) (- 2)) (+ main_~i~0 1))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5588#(<= (div main_~sum~0 (- 2)) (+ 3 (* main_~i~0 2)))} is VALID [2022-04-15 13:21:59,394 INFO L290 TraceCheckUtils]: 18: Hoare triple {5596#(<= (div (+ (- 1) (div (+ 5 main_~sum~0) 2) main_~i~0) (- 2)) (+ main_~i~0 3))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5592#(<= (div (+ (* (- 1) (div (+ (- 2) main_~sum~0 main_~i~0) (- 2))) 4) (- 2)) (+ main_~i~0 1))} is VALID [2022-04-15 13:21:59,396 INFO L290 TraceCheckUtils]: 17: Hoare triple {5600#(<= (div (+ (* (- 1) (div (+ main_~sum~0 main_~i~0 1) (- 2))) main_~i~0) (- 2)) (+ 5 main_~i~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5596#(<= (div (+ (- 1) (div (+ 5 main_~sum~0) 2) main_~i~0) (- 2)) (+ main_~i~0 3))} is VALID [2022-04-15 13:21:59,408 INFO L290 TraceCheckUtils]: 16: Hoare triple {5604#(forall ((v_main_~i~0_337 Int) (aux_div_aux_div_v_main_~sum~0_355_51_70 Int)) (or (<= aux_div_aux_div_v_main_~sum~0_355_51_70 (+ 5 v_main_~i~0_337)) (<= 1 (+ (div (+ (- 1) main_~sum~0 main_~i~0 (* 3 v_main_~i~0_337)) 2) (* aux_div_aux_div_v_main_~sum~0_355_51_70 2))) (not (<= (+ main_~i~0 1) v_main_~i~0_337))))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5600#(<= (div (+ (* (- 1) (div (+ main_~sum~0 main_~i~0 1) (- 2))) main_~i~0) (- 2)) (+ 5 main_~i~0))} is VALID [2022-04-15 13:22:00,709 WARN L290 TraceCheckUtils]: 15: Hoare triple {5608#(forall ((aux_mod_aux_div_v_main_~sum~0_356_73_50 Int) (v_main_~i~0_337 Int) (aux_div_aux_div_v_main_~sum~0_356_73_50 Int)) (or (> 0 aux_mod_aux_div_v_main_~sum~0_356_73_50) (<= (+ (* aux_mod_aux_div_v_main_~sum~0_356_73_50 2) 4) (+ main_~sum~0 (* aux_div_aux_div_v_main_~sum~0_356_73_50 4) (* main_~i~0 2) (* 3 v_main_~i~0_337))) (>= aux_mod_aux_div_v_main_~sum~0_356_73_50 2) (<= aux_div_aux_div_v_main_~sum~0_356_73_50 (+ 6 v_main_~i~0_337)) (< v_main_~i~0_337 (+ main_~i~0 2))))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5604#(forall ((v_main_~i~0_337 Int) (aux_div_aux_div_v_main_~sum~0_355_51_70 Int)) (or (<= aux_div_aux_div_v_main_~sum~0_355_51_70 (+ 5 v_main_~i~0_337)) (<= 1 (+ (div (+ (- 1) main_~sum~0 main_~i~0 (* 3 v_main_~i~0_337)) 2) (* aux_div_aux_div_v_main_~sum~0_355_51_70 2))) (not (<= (+ main_~i~0 1) v_main_~i~0_337))))} is UNKNOWN [2022-04-15 13:22:00,713 INFO L290 TraceCheckUtils]: 14: Hoare triple {5612#(forall ((aux_mod_aux_div_v_main_~sum~0_356_73_50 Int) (v_main_~i~0_339 Int) (v_main_~i~0_337 Int) (aux_div_aux_div_v_main_~sum~0_356_73_50 Int)) (or (<= (+ (* aux_mod_aux_div_v_main_~sum~0_356_73_50 2) 4) (+ (* 2 v_main_~i~0_339) main_~sum~0 main_~i~0 (* aux_div_aux_div_v_main_~sum~0_356_73_50 4) (* 3 v_main_~i~0_337))) (> 0 aux_mod_aux_div_v_main_~sum~0_356_73_50) (>= aux_mod_aux_div_v_main_~sum~0_356_73_50 2) (< v_main_~i~0_337 (+ 2 v_main_~i~0_339)) (<= aux_div_aux_div_v_main_~sum~0_356_73_50 (+ 6 v_main_~i~0_337)) (not (<= (+ main_~i~0 1) v_main_~i~0_339))))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5608#(forall ((aux_mod_aux_div_v_main_~sum~0_356_73_50 Int) (v_main_~i~0_337 Int) (aux_div_aux_div_v_main_~sum~0_356_73_50 Int)) (or (> 0 aux_mod_aux_div_v_main_~sum~0_356_73_50) (<= (+ (* aux_mod_aux_div_v_main_~sum~0_356_73_50 2) 4) (+ main_~sum~0 (* aux_div_aux_div_v_main_~sum~0_356_73_50 4) (* main_~i~0 2) (* 3 v_main_~i~0_337))) (>= aux_mod_aux_div_v_main_~sum~0_356_73_50 2) (<= aux_div_aux_div_v_main_~sum~0_356_73_50 (+ 6 v_main_~i~0_337)) (< v_main_~i~0_337 (+ main_~i~0 2))))} is VALID [2022-04-15 13:22:00,737 INFO L290 TraceCheckUtils]: 13: Hoare triple {5616#(forall ((aux_mod_aux_div_v_main_~sum~0_356_73_50 Int) (v_main_~i~0_339 Int) (v_main_~i~0_337 Int) (aux_div_aux_div_v_main_~sum~0_356_73_50 Int)) (or (< v_main_~i~0_339 (+ main_~i~0 2)) (<= (+ (* aux_mod_aux_div_v_main_~sum~0_356_73_50 2) 3) (+ (* 2 v_main_~i~0_339) main_~sum~0 (* aux_div_aux_div_v_main_~sum~0_356_73_50 4) (* main_~i~0 2) (* 3 v_main_~i~0_337))) (> 0 aux_mod_aux_div_v_main_~sum~0_356_73_50) (>= aux_mod_aux_div_v_main_~sum~0_356_73_50 2) (< v_main_~i~0_337 (+ 2 v_main_~i~0_339)) (<= aux_div_aux_div_v_main_~sum~0_356_73_50 (+ 6 v_main_~i~0_337))))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5612#(forall ((aux_mod_aux_div_v_main_~sum~0_356_73_50 Int) (v_main_~i~0_339 Int) (v_main_~i~0_337 Int) (aux_div_aux_div_v_main_~sum~0_356_73_50 Int)) (or (<= (+ (* aux_mod_aux_div_v_main_~sum~0_356_73_50 2) 4) (+ (* 2 v_main_~i~0_339) main_~sum~0 main_~i~0 (* aux_div_aux_div_v_main_~sum~0_356_73_50 4) (* 3 v_main_~i~0_337))) (> 0 aux_mod_aux_div_v_main_~sum~0_356_73_50) (>= aux_mod_aux_div_v_main_~sum~0_356_73_50 2) (< v_main_~i~0_337 (+ 2 v_main_~i~0_339)) (<= aux_div_aux_div_v_main_~sum~0_356_73_50 (+ 6 v_main_~i~0_337)) (not (<= (+ main_~i~0 1) v_main_~i~0_339))))} is VALID [2022-04-15 13:22:00,742 INFO L290 TraceCheckUtils]: 12: Hoare triple {5620#(forall ((aux_mod_aux_div_v_main_~sum~0_356_73_50 Int) (v_main_~i~0_341 Int) (v_main_~i~0_339 Int) (v_main_~i~0_337 Int) (aux_div_aux_div_v_main_~sum~0_356_73_50 Int)) (or (< v_main_~i~0_339 (+ 2 v_main_~i~0_341)) (> 0 aux_mod_aux_div_v_main_~sum~0_356_73_50) (>= aux_mod_aux_div_v_main_~sum~0_356_73_50 2) (< v_main_~i~0_337 (+ 2 v_main_~i~0_339)) (<= (+ (* aux_mod_aux_div_v_main_~sum~0_356_73_50 2) 3) (+ (* 2 v_main_~i~0_341) (* 2 v_main_~i~0_339) main_~sum~0 main_~i~0 (* aux_div_aux_div_v_main_~sum~0_356_73_50 4) (* 3 v_main_~i~0_337))) (<= aux_div_aux_div_v_main_~sum~0_356_73_50 (+ 6 v_main_~i~0_337)) (not (<= (+ main_~i~0 1) v_main_~i~0_341))))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5616#(forall ((aux_mod_aux_div_v_main_~sum~0_356_73_50 Int) (v_main_~i~0_339 Int) (v_main_~i~0_337 Int) (aux_div_aux_div_v_main_~sum~0_356_73_50 Int)) (or (< v_main_~i~0_339 (+ main_~i~0 2)) (<= (+ (* aux_mod_aux_div_v_main_~sum~0_356_73_50 2) 3) (+ (* 2 v_main_~i~0_339) main_~sum~0 (* aux_div_aux_div_v_main_~sum~0_356_73_50 4) (* main_~i~0 2) (* 3 v_main_~i~0_337))) (> 0 aux_mod_aux_div_v_main_~sum~0_356_73_50) (>= aux_mod_aux_div_v_main_~sum~0_356_73_50 2) (< v_main_~i~0_337 (+ 2 v_main_~i~0_339)) (<= aux_div_aux_div_v_main_~sum~0_356_73_50 (+ 6 v_main_~i~0_337))))} is VALID [2022-04-15 13:22:00,746 INFO L290 TraceCheckUtils]: 11: Hoare triple {5624#(forall ((aux_mod_aux_div_v_main_~sum~0_356_73_50 Int) (v_main_~i~0_341 Int) (v_main_~i~0_339 Int) (v_main_~i~0_337 Int) (aux_div_aux_div_v_main_~sum~0_356_73_50 Int)) (or (< v_main_~i~0_341 (+ main_~i~0 2)) (< v_main_~i~0_339 (+ 2 v_main_~i~0_341)) (<= (+ (* aux_mod_aux_div_v_main_~sum~0_356_73_50 2) 2) (+ (* 2 v_main_~i~0_341) (* 2 v_main_~i~0_339) main_~sum~0 (* aux_div_aux_div_v_main_~sum~0_356_73_50 4) (* main_~i~0 2) (* 3 v_main_~i~0_337))) (> 0 aux_mod_aux_div_v_main_~sum~0_356_73_50) (>= aux_mod_aux_div_v_main_~sum~0_356_73_50 2) (< v_main_~i~0_337 (+ 2 v_main_~i~0_339)) (<= aux_div_aux_div_v_main_~sum~0_356_73_50 (+ 6 v_main_~i~0_337))))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5620#(forall ((aux_mod_aux_div_v_main_~sum~0_356_73_50 Int) (v_main_~i~0_341 Int) (v_main_~i~0_339 Int) (v_main_~i~0_337 Int) (aux_div_aux_div_v_main_~sum~0_356_73_50 Int)) (or (< v_main_~i~0_339 (+ 2 v_main_~i~0_341)) (> 0 aux_mod_aux_div_v_main_~sum~0_356_73_50) (>= aux_mod_aux_div_v_main_~sum~0_356_73_50 2) (< v_main_~i~0_337 (+ 2 v_main_~i~0_339)) (<= (+ (* aux_mod_aux_div_v_main_~sum~0_356_73_50 2) 3) (+ (* 2 v_main_~i~0_341) (* 2 v_main_~i~0_339) main_~sum~0 main_~i~0 (* aux_div_aux_div_v_main_~sum~0_356_73_50 4) (* 3 v_main_~i~0_337))) (<= aux_div_aux_div_v_main_~sum~0_356_73_50 (+ 6 v_main_~i~0_337)) (not (<= (+ main_~i~0 1) v_main_~i~0_341))))} is VALID [2022-04-15 13:22:00,759 INFO L290 TraceCheckUtils]: 10: Hoare triple {5628#(forall ((aux_mod_aux_div_v_main_~sum~0_356_73_50 Int) (v_main_~i~0_343 Int) (v_main_~i~0_341 Int) (v_main_~i~0_339 Int) (v_main_~i~0_337 Int) (aux_div_aux_div_v_main_~sum~0_356_73_50 Int)) (or (< v_main_~i~0_339 (+ 2 v_main_~i~0_341)) (> 0 aux_mod_aux_div_v_main_~sum~0_356_73_50) (<= (+ (* aux_mod_aux_div_v_main_~sum~0_356_73_50 2) 2) (+ (* 2 v_main_~i~0_341) (* 2 v_main_~i~0_339) main_~sum~0 main_~i~0 (* aux_div_aux_div_v_main_~sum~0_356_73_50 4) (* 2 v_main_~i~0_343) (* 3 v_main_~i~0_337))) (not (<= (+ main_~i~0 1) v_main_~i~0_343)) (>= aux_mod_aux_div_v_main_~sum~0_356_73_50 2) (< v_main_~i~0_337 (+ 2 v_main_~i~0_339)) (<= aux_div_aux_div_v_main_~sum~0_356_73_50 (+ 6 v_main_~i~0_337)) (< v_main_~i~0_341 (+ 2 v_main_~i~0_343))))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5624#(forall ((aux_mod_aux_div_v_main_~sum~0_356_73_50 Int) (v_main_~i~0_341 Int) (v_main_~i~0_339 Int) (v_main_~i~0_337 Int) (aux_div_aux_div_v_main_~sum~0_356_73_50 Int)) (or (< v_main_~i~0_341 (+ main_~i~0 2)) (< v_main_~i~0_339 (+ 2 v_main_~i~0_341)) (<= (+ (* aux_mod_aux_div_v_main_~sum~0_356_73_50 2) 2) (+ (* 2 v_main_~i~0_341) (* 2 v_main_~i~0_339) main_~sum~0 (* aux_div_aux_div_v_main_~sum~0_356_73_50 4) (* main_~i~0 2) (* 3 v_main_~i~0_337))) (> 0 aux_mod_aux_div_v_main_~sum~0_356_73_50) (>= aux_mod_aux_div_v_main_~sum~0_356_73_50 2) (< v_main_~i~0_337 (+ 2 v_main_~i~0_339)) (<= aux_div_aux_div_v_main_~sum~0_356_73_50 (+ 6 v_main_~i~0_337))))} is VALID [2022-04-15 13:22:02,779 WARN L290 TraceCheckUtils]: 9: Hoare triple {5632#(forall ((aux_mod_aux_div_v_main_~sum~0_356_73_50 Int) (v_main_~i~0_343 Int) (v_main_~i~0_341 Int) (v_main_~i~0_339 Int) (v_main_~i~0_337 Int) (aux_div_aux_div_v_main_~sum~0_356_73_50 Int)) (or (< v_main_~i~0_339 (+ 2 v_main_~i~0_341)) (<= (+ (* aux_mod_aux_div_v_main_~sum~0_356_73_50 2) 1) (+ (* 2 v_main_~i~0_341) (* 2 v_main_~i~0_339) main_~sum~0 (* aux_div_aux_div_v_main_~sum~0_356_73_50 4) (* 2 v_main_~i~0_343) (* main_~i~0 2) (* 3 v_main_~i~0_337))) (> 0 aux_mod_aux_div_v_main_~sum~0_356_73_50) (< v_main_~i~0_343 (+ main_~i~0 2)) (>= aux_mod_aux_div_v_main_~sum~0_356_73_50 2) (< v_main_~i~0_337 (+ 2 v_main_~i~0_339)) (<= aux_div_aux_div_v_main_~sum~0_356_73_50 (+ 6 v_main_~i~0_337)) (< v_main_~i~0_341 (+ 2 v_main_~i~0_343))))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5628#(forall ((aux_mod_aux_div_v_main_~sum~0_356_73_50 Int) (v_main_~i~0_343 Int) (v_main_~i~0_341 Int) (v_main_~i~0_339 Int) (v_main_~i~0_337 Int) (aux_div_aux_div_v_main_~sum~0_356_73_50 Int)) (or (< v_main_~i~0_339 (+ 2 v_main_~i~0_341)) (> 0 aux_mod_aux_div_v_main_~sum~0_356_73_50) (<= (+ (* aux_mod_aux_div_v_main_~sum~0_356_73_50 2) 2) (+ (* 2 v_main_~i~0_341) (* 2 v_main_~i~0_339) main_~sum~0 main_~i~0 (* aux_div_aux_div_v_main_~sum~0_356_73_50 4) (* 2 v_main_~i~0_343) (* 3 v_main_~i~0_337))) (not (<= (+ main_~i~0 1) v_main_~i~0_343)) (>= aux_mod_aux_div_v_main_~sum~0_356_73_50 2) (< v_main_~i~0_337 (+ 2 v_main_~i~0_339)) (<= aux_div_aux_div_v_main_~sum~0_356_73_50 (+ 6 v_main_~i~0_337)) (< v_main_~i~0_341 (+ 2 v_main_~i~0_343))))} is UNKNOWN [2022-04-15 13:22:02,888 INFO L290 TraceCheckUtils]: 8: Hoare triple {5636#(forall ((aux_mod_aux_div_v_main_~sum~0_356_73_50 Int) (v_main_~i~0_345 Int) (v_main_~i~0_343 Int) (v_main_~i~0_341 Int) (v_main_~i~0_339 Int) (v_main_~i~0_337 Int) (aux_div_aux_div_v_main_~sum~0_356_73_50 Int)) (or (< v_main_~i~0_339 (+ 2 v_main_~i~0_341)) (> 0 aux_mod_aux_div_v_main_~sum~0_356_73_50) (not (<= (+ main_~i~0 1) v_main_~i~0_345)) (>= aux_mod_aux_div_v_main_~sum~0_356_73_50 2) (< v_main_~i~0_337 (+ 2 v_main_~i~0_339)) (<= aux_div_aux_div_v_main_~sum~0_356_73_50 (+ 6 v_main_~i~0_337)) (< v_main_~i~0_343 (+ 2 v_main_~i~0_345)) (< v_main_~i~0_341 (+ 2 v_main_~i~0_343)) (<= (+ (* aux_mod_aux_div_v_main_~sum~0_356_73_50 2) 1) (+ (* 2 v_main_~i~0_341) (* 2 v_main_~i~0_339) main_~sum~0 main_~i~0 (* 2 v_main_~i~0_345) (* aux_div_aux_div_v_main_~sum~0_356_73_50 4) (* 2 v_main_~i~0_343) (* 3 v_main_~i~0_337)))))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5632#(forall ((aux_mod_aux_div_v_main_~sum~0_356_73_50 Int) (v_main_~i~0_343 Int) (v_main_~i~0_341 Int) (v_main_~i~0_339 Int) (v_main_~i~0_337 Int) (aux_div_aux_div_v_main_~sum~0_356_73_50 Int)) (or (< v_main_~i~0_339 (+ 2 v_main_~i~0_341)) (<= (+ (* aux_mod_aux_div_v_main_~sum~0_356_73_50 2) 1) (+ (* 2 v_main_~i~0_341) (* 2 v_main_~i~0_339) main_~sum~0 (* aux_div_aux_div_v_main_~sum~0_356_73_50 4) (* 2 v_main_~i~0_343) (* main_~i~0 2) (* 3 v_main_~i~0_337))) (> 0 aux_mod_aux_div_v_main_~sum~0_356_73_50) (< v_main_~i~0_343 (+ main_~i~0 2)) (>= aux_mod_aux_div_v_main_~sum~0_356_73_50 2) (< v_main_~i~0_337 (+ 2 v_main_~i~0_339)) (<= aux_div_aux_div_v_main_~sum~0_356_73_50 (+ 6 v_main_~i~0_337)) (< v_main_~i~0_341 (+ 2 v_main_~i~0_343))))} is VALID [2022-04-15 13:22:04,948 WARN L290 TraceCheckUtils]: 7: Hoare triple {5640#(forall ((aux_mod_aux_div_v_main_~sum~0_356_73_50 Int) (v_main_~i~0_345 Int) (v_main_~i~0_343 Int) (v_main_~i~0_341 Int) (v_main_~i~0_339 Int) (v_main_~i~0_337 Int) (aux_div_aux_div_v_main_~sum~0_356_73_50 Int)) (or (< v_main_~i~0_339 (+ 2 v_main_~i~0_341)) (> 0 aux_mod_aux_div_v_main_~sum~0_356_73_50) (<= (* aux_mod_aux_div_v_main_~sum~0_356_73_50 2) (+ (* 2 v_main_~i~0_341) (* 2 v_main_~i~0_339) main_~sum~0 (* 2 v_main_~i~0_345) (* aux_div_aux_div_v_main_~sum~0_356_73_50 4) (* 2 v_main_~i~0_343) (* main_~i~0 2) (* 3 v_main_~i~0_337))) (>= aux_mod_aux_div_v_main_~sum~0_356_73_50 2) (< v_main_~i~0_337 (+ 2 v_main_~i~0_339)) (<= aux_div_aux_div_v_main_~sum~0_356_73_50 (+ 6 v_main_~i~0_337)) (< v_main_~i~0_343 (+ 2 v_main_~i~0_345)) (< v_main_~i~0_341 (+ 2 v_main_~i~0_343)) (< v_main_~i~0_345 (+ main_~i~0 2))))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5636#(forall ((aux_mod_aux_div_v_main_~sum~0_356_73_50 Int) (v_main_~i~0_345 Int) (v_main_~i~0_343 Int) (v_main_~i~0_341 Int) (v_main_~i~0_339 Int) (v_main_~i~0_337 Int) (aux_div_aux_div_v_main_~sum~0_356_73_50 Int)) (or (< v_main_~i~0_339 (+ 2 v_main_~i~0_341)) (> 0 aux_mod_aux_div_v_main_~sum~0_356_73_50) (not (<= (+ main_~i~0 1) v_main_~i~0_345)) (>= aux_mod_aux_div_v_main_~sum~0_356_73_50 2) (< v_main_~i~0_337 (+ 2 v_main_~i~0_339)) (<= aux_div_aux_div_v_main_~sum~0_356_73_50 (+ 6 v_main_~i~0_337)) (< v_main_~i~0_343 (+ 2 v_main_~i~0_345)) (< v_main_~i~0_341 (+ 2 v_main_~i~0_343)) (<= (+ (* aux_mod_aux_div_v_main_~sum~0_356_73_50 2) 1) (+ (* 2 v_main_~i~0_341) (* 2 v_main_~i~0_339) main_~sum~0 main_~i~0 (* 2 v_main_~i~0_345) (* aux_div_aux_div_v_main_~sum~0_356_73_50 4) (* 2 v_main_~i~0_343) (* 3 v_main_~i~0_337)))))} is UNKNOWN [2022-04-15 13:22:04,998 INFO L290 TraceCheckUtils]: 6: Hoare triple {5428#true} assume !!(((0 == ~i~0 && ~n~0 >= 0) && ~n~0 <= 100) && 0 == ~sum~0); {5640#(forall ((aux_mod_aux_div_v_main_~sum~0_356_73_50 Int) (v_main_~i~0_345 Int) (v_main_~i~0_343 Int) (v_main_~i~0_341 Int) (v_main_~i~0_339 Int) (v_main_~i~0_337 Int) (aux_div_aux_div_v_main_~sum~0_356_73_50 Int)) (or (< v_main_~i~0_339 (+ 2 v_main_~i~0_341)) (> 0 aux_mod_aux_div_v_main_~sum~0_356_73_50) (<= (* aux_mod_aux_div_v_main_~sum~0_356_73_50 2) (+ (* 2 v_main_~i~0_341) (* 2 v_main_~i~0_339) main_~sum~0 (* 2 v_main_~i~0_345) (* aux_div_aux_div_v_main_~sum~0_356_73_50 4) (* 2 v_main_~i~0_343) (* main_~i~0 2) (* 3 v_main_~i~0_337))) (>= aux_mod_aux_div_v_main_~sum~0_356_73_50 2) (< v_main_~i~0_337 (+ 2 v_main_~i~0_339)) (<= aux_div_aux_div_v_main_~sum~0_356_73_50 (+ 6 v_main_~i~0_337)) (< v_main_~i~0_343 (+ 2 v_main_~i~0_345)) (< v_main_~i~0_341 (+ 2 v_main_~i~0_343)) (< v_main_~i~0_345 (+ main_~i~0 2))))} is VALID [2022-04-15 13:22:04,998 INFO L290 TraceCheckUtils]: 5: Hoare triple {5428#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~i~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~n~0 := #t~nondet2;havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~sum~0 := #t~nondet3;havoc #t~nondet3; {5428#true} is VALID [2022-04-15 13:22:04,998 INFO L272 TraceCheckUtils]: 4: Hoare triple {5428#true} call #t~ret5 := main(); {5428#true} is VALID [2022-04-15 13:22:04,998 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5428#true} {5428#true} #45#return; {5428#true} is VALID [2022-04-15 13:22:04,999 INFO L290 TraceCheckUtils]: 2: Hoare triple {5428#true} assume true; {5428#true} is VALID [2022-04-15 13:22:04,999 INFO L290 TraceCheckUtils]: 1: Hoare triple {5428#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(26, 2); {5428#true} is VALID [2022-04-15 13:22:04,999 INFO L272 TraceCheckUtils]: 0: Hoare triple {5428#true} call ULTIMATE.init(); {5428#true} is VALID [2022-04-15 13:22:04,999 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 13:22:04,999 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [268729281] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 13:22:04,999 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 13:22:04,999 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 22, 22] total 60 [2022-04-15 13:22:04,999 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 13:22:05,000 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [76633801] [2022-04-15 13:22:05,000 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [76633801] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:22:05,000 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:22:05,000 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2022-04-15 13:22:05,000 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1674172347] [2022-04-15 13:22:05,000 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 13:22:05,000 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 1.0869565217391304) internal successors, (25), 21 states have internal predecessors, (25), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 29 [2022-04-15 13:22:05,000 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 13:22:05,000 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 23 states, 23 states have (on average 1.0869565217391304) internal successors, (25), 21 states have internal predecessors, (25), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:22:05,031 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:22:05,032 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-04-15 13:22:05,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 13:22:05,032 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-04-15 13:22:05,032 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=732, Invalid=2807, Unknown=1, NotChecked=0, Total=3540 [2022-04-15 13:22:05,033 INFO L87 Difference]: Start difference. First operand 30 states and 30 transitions. Second operand has 23 states, 23 states have (on average 1.0869565217391304) internal successors, (25), 21 states have internal predecessors, (25), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:22:09,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:22:09,841 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions. [2022-04-15 13:22:09,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-04-15 13:22:09,841 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 1.0869565217391304) internal successors, (25), 21 states have internal predecessors, (25), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 29 [2022-04-15 13:22:09,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 13:22:09,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 23 states have (on average 1.0869565217391304) internal successors, (25), 21 states have internal predecessors, (25), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:22:09,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 36 transitions. [2022-04-15 13:22:09,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 23 states have (on average 1.0869565217391304) internal successors, (25), 21 states have internal predecessors, (25), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:22:09,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 36 transitions. [2022-04-15 13:22:09,842 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 23 states and 36 transitions. [2022-04-15 13:22:09,895 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:22:09,896 INFO L225 Difference]: With dead ends: 36 [2022-04-15 13:22:09,896 INFO L226 Difference]: Without dead ends: 31 [2022-04-15 13:22:09,896 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 22 SyntacticMatches, 1 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1402 ImplicationChecksByTransitivity, 7.3s TimeCoverageRelationStatistics Valid=832, Invalid=5487, Unknown=1, NotChecked=0, Total=6320 [2022-04-15 13:22:09,897 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 10 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 502 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 523 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 502 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-04-15 13:22:09,897 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 113 Invalid, 523 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 502 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-04-15 13:22:09,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-04-15 13:22:09,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2022-04-15 13:22:09,975 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 13:22:09,975 INFO L82 GeneralOperation]: Start isEquivalent. First operand 31 states. Second operand has 31 states, 26 states have (on average 1.0384615384615385) internal successors, (27), 26 states have internal predecessors, (27), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:22:09,975 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand has 31 states, 26 states have (on average 1.0384615384615385) internal successors, (27), 26 states have internal predecessors, (27), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:22:09,976 INFO L87 Difference]: Start difference. First operand 31 states. Second operand has 31 states, 26 states have (on average 1.0384615384615385) internal successors, (27), 26 states have internal predecessors, (27), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:22:09,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:22:09,976 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2022-04-15 13:22:09,976 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2022-04-15 13:22:09,976 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:22:09,976 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:22:09,976 INFO L74 IsIncluded]: Start isIncluded. First operand has 31 states, 26 states have (on average 1.0384615384615385) internal successors, (27), 26 states have internal predecessors, (27), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 31 states. [2022-04-15 13:22:09,977 INFO L87 Difference]: Start difference. First operand has 31 states, 26 states have (on average 1.0384615384615385) internal successors, (27), 26 states have internal predecessors, (27), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 31 states. [2022-04-15 13:22:09,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:22:09,977 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2022-04-15 13:22:09,977 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2022-04-15 13:22:09,977 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:22:09,977 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:22:09,977 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 13:22:09,977 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 13:22:09,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 26 states have (on average 1.0384615384615385) internal successors, (27), 26 states have internal predecessors, (27), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:22:09,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 31 transitions. [2022-04-15 13:22:09,978 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 31 transitions. Word has length 29 [2022-04-15 13:22:09,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 13:22:09,978 INFO L478 AbstractCegarLoop]: Abstraction has 31 states and 31 transitions. [2022-04-15 13:22:09,978 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 1.0869565217391304) internal successors, (25), 21 states have internal predecessors, (25), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:22:09,978 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 31 states and 31 transitions. [2022-04-15 13:22:10,077 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:22:10,078 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2022-04-15 13:22:10,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-04-15 13:22:10,078 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 13:22:10,078 INFO L499 BasicCegarLoop]: trace histogram [18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 13:22:10,096 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2022-04-15 13:22:10,278 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33,SelfDestructingSolverStorable34,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 13:22:10,281 INFO L403 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 13:22:10,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 13:22:10,281 INFO L85 PathProgramCache]: Analyzing trace with hash 287966296, now seen corresponding path program 35 times [2022-04-15 13:22:10,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 13:22:10,281 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1824007627] [2022-04-15 13:22:10,537 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 13:22:10,538 INFO L85 PathProgramCache]: Analyzing trace with hash 1033754471, now seen corresponding path program 1 times [2022-04-15 13:22:10,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:22:10,539 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [456574949] [2022-04-15 13:22:10,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:22:10,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:22:10,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 13:22:10,544 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 13:22:10,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 13:22:10,547 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 13:22:10,547 INFO L85 PathProgramCache]: Analyzing trace with hash 287966296, now seen corresponding path program 36 times [2022-04-15 13:22:10,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:22:10,547 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [904493458] [2022-04-15 13:22:10,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:22:10,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:22:10,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:22:11,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 13:22:11,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:22:11,339 INFO L290 TraceCheckUtils]: 0: Hoare triple {5926#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(26, 2); {5900#true} is VALID [2022-04-15 13:22:11,339 INFO L290 TraceCheckUtils]: 1: Hoare triple {5900#true} assume true; {5900#true} is VALID [2022-04-15 13:22:11,339 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {5900#true} {5900#true} #45#return; {5900#true} is VALID [2022-04-15 13:22:11,339 INFO L272 TraceCheckUtils]: 0: Hoare triple {5900#true} call ULTIMATE.init(); {5926#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 13:22:11,339 INFO L290 TraceCheckUtils]: 1: Hoare triple {5926#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(26, 2); {5900#true} is VALID [2022-04-15 13:22:11,339 INFO L290 TraceCheckUtils]: 2: Hoare triple {5900#true} assume true; {5900#true} is VALID [2022-04-15 13:22:11,339 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5900#true} {5900#true} #45#return; {5900#true} is VALID [2022-04-15 13:22:11,339 INFO L272 TraceCheckUtils]: 4: Hoare triple {5900#true} call #t~ret5 := main(); {5900#true} is VALID [2022-04-15 13:22:11,340 INFO L290 TraceCheckUtils]: 5: Hoare triple {5900#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~i~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~n~0 := #t~nondet2;havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~sum~0 := #t~nondet3;havoc #t~nondet3; {5900#true} is VALID [2022-04-15 13:22:11,340 INFO L290 TraceCheckUtils]: 6: Hoare triple {5900#true} assume !!(((0 == ~i~0 && ~n~0 >= 0) && ~n~0 <= 100) && 0 == ~sum~0); {5905#(<= 0 (+ main_~sum~0 (* main_~i~0 18)))} is VALID [2022-04-15 13:22:11,344 INFO L290 TraceCheckUtils]: 7: Hoare triple {5905#(<= 0 (+ main_~sum~0 (* main_~i~0 18)))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5906#(<= 17 (+ main_~sum~0 (* main_~i~0 17)))} is VALID [2022-04-15 13:22:11,345 INFO L290 TraceCheckUtils]: 8: Hoare triple {5906#(<= 17 (+ main_~sum~0 (* main_~i~0 17)))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5907#(<= 33 (+ main_~sum~0 (* main_~i~0 16)))} is VALID [2022-04-15 13:22:11,346 INFO L290 TraceCheckUtils]: 9: Hoare triple {5907#(<= 33 (+ main_~sum~0 (* main_~i~0 16)))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5908#(<= 48 (+ main_~sum~0 (* main_~i~0 15)))} is VALID [2022-04-15 13:22:11,347 INFO L290 TraceCheckUtils]: 10: Hoare triple {5908#(<= 48 (+ main_~sum~0 (* main_~i~0 15)))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5909#(<= 62 (+ main_~sum~0 (* main_~i~0 14)))} is VALID [2022-04-15 13:22:11,348 INFO L290 TraceCheckUtils]: 11: Hoare triple {5909#(<= 62 (+ main_~sum~0 (* main_~i~0 14)))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5910#(<= 75 (+ (* main_~i~0 13) main_~sum~0))} is VALID [2022-04-15 13:22:11,350 INFO L290 TraceCheckUtils]: 12: Hoare triple {5910#(<= 75 (+ (* main_~i~0 13) main_~sum~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5911#(<= 87 (+ main_~sum~0 (* main_~i~0 12)))} is VALID [2022-04-15 13:22:11,351 INFO L290 TraceCheckUtils]: 13: Hoare triple {5911#(<= 87 (+ main_~sum~0 (* main_~i~0 12)))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5912#(<= 98 (+ main_~sum~0 (* main_~i~0 11)))} is VALID [2022-04-15 13:22:11,353 INFO L290 TraceCheckUtils]: 14: Hoare triple {5912#(<= 98 (+ main_~sum~0 (* main_~i~0 11)))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5913#(<= 108 (+ main_~sum~0 (* main_~i~0 10)))} is VALID [2022-04-15 13:22:11,355 INFO L290 TraceCheckUtils]: 15: Hoare triple {5913#(<= 108 (+ main_~sum~0 (* main_~i~0 10)))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5914#(<= 117 (+ (* main_~i~0 9) main_~sum~0))} is VALID [2022-04-15 13:22:11,357 INFO L290 TraceCheckUtils]: 16: Hoare triple {5914#(<= 117 (+ (* main_~i~0 9) main_~sum~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5915#(<= 125 (+ main_~sum~0 (* main_~i~0 8)))} is VALID [2022-04-15 13:22:11,358 INFO L290 TraceCheckUtils]: 17: Hoare triple {5915#(<= 125 (+ main_~sum~0 (* main_~i~0 8)))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5916#(<= 132 (+ (* 7 main_~i~0) main_~sum~0))} is VALID [2022-04-15 13:22:11,359 INFO L290 TraceCheckUtils]: 18: Hoare triple {5916#(<= 132 (+ (* 7 main_~i~0) main_~sum~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5917#(<= 138 (+ (* main_~i~0 6) main_~sum~0))} is VALID [2022-04-15 13:22:11,360 INFO L290 TraceCheckUtils]: 19: Hoare triple {5917#(<= 138 (+ (* main_~i~0 6) main_~sum~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5918#(<= 143 (+ (* 5 main_~i~0) main_~sum~0))} is VALID [2022-04-15 13:22:11,362 INFO L290 TraceCheckUtils]: 20: Hoare triple {5918#(<= 143 (+ (* 5 main_~i~0) main_~sum~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5919#(<= 147 (+ main_~sum~0 (* main_~i~0 4)))} is VALID [2022-04-15 13:22:11,363 INFO L290 TraceCheckUtils]: 21: Hoare triple {5919#(<= 147 (+ main_~sum~0 (* main_~i~0 4)))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5920#(<= 150 (+ main_~sum~0 (* main_~i~0 3)))} is VALID [2022-04-15 13:22:11,365 INFO L290 TraceCheckUtils]: 22: Hoare triple {5920#(<= 150 (+ main_~sum~0 (* main_~i~0 3)))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5921#(<= 152 (+ main_~sum~0 (* main_~i~0 2)))} is VALID [2022-04-15 13:22:11,368 INFO L290 TraceCheckUtils]: 23: Hoare triple {5921#(<= 152 (+ main_~sum~0 (* main_~i~0 2)))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5922#(<= 153 (+ main_~sum~0 main_~i~0))} is VALID [2022-04-15 13:22:11,387 INFO L290 TraceCheckUtils]: 24: Hoare triple {5922#(<= 153 (+ main_~sum~0 main_~i~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5923#(<= 153 main_~sum~0)} is VALID [2022-04-15 13:22:11,387 INFO L290 TraceCheckUtils]: 25: Hoare triple {5923#(<= 153 main_~sum~0)} assume !(~i~0 < ~n~0); {5923#(<= 153 main_~sum~0)} is VALID [2022-04-15 13:22:11,388 INFO L272 TraceCheckUtils]: 26: Hoare triple {5923#(<= 153 main_~sum~0)} call __VERIFIER_assert((if ~sum~0 >= 0 then 1 else 0)); {5924#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 13:22:11,388 INFO L290 TraceCheckUtils]: 27: Hoare triple {5924#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {5925#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 13:22:11,388 INFO L290 TraceCheckUtils]: 28: Hoare triple {5925#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {5901#false} is VALID [2022-04-15 13:22:11,389 INFO L290 TraceCheckUtils]: 29: Hoare triple {5901#false} assume !false; {5901#false} is VALID [2022-04-15 13:22:11,389 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 13:22:11,389 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 13:22:11,389 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [904493458] [2022-04-15 13:22:11,389 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [904493458] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 13:22:11,389 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1738495761] [2022-04-15 13:22:11,389 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 13:22:11,389 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 13:22:11,389 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 13:22:11,391 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 13:22:11,393 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-04-15 13:22:11,432 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 10 check-sat command(s) [2022-04-15 13:22:11,432 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 13:22:11,433 INFO L263 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 40 conjunts are in the unsatisfiable core [2022-04-15 13:22:11,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:22:11,451 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 13:22:13,132 INFO L272 TraceCheckUtils]: 0: Hoare triple {5900#true} call ULTIMATE.init(); {5900#true} is VALID [2022-04-15 13:22:13,132 INFO L290 TraceCheckUtils]: 1: Hoare triple {5900#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(26, 2); {5900#true} is VALID [2022-04-15 13:22:13,132 INFO L290 TraceCheckUtils]: 2: Hoare triple {5900#true} assume true; {5900#true} is VALID [2022-04-15 13:22:13,132 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5900#true} {5900#true} #45#return; {5900#true} is VALID [2022-04-15 13:22:13,132 INFO L272 TraceCheckUtils]: 4: Hoare triple {5900#true} call #t~ret5 := main(); {5900#true} is VALID [2022-04-15 13:22:13,132 INFO L290 TraceCheckUtils]: 5: Hoare triple {5900#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~i~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~n~0 := #t~nondet2;havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~sum~0 := #t~nondet3;havoc #t~nondet3; {5900#true} is VALID [2022-04-15 13:22:13,133 INFO L290 TraceCheckUtils]: 6: Hoare triple {5900#true} assume !!(((0 == ~i~0 && ~n~0 >= 0) && ~n~0 <= 100) && 0 == ~sum~0); {5948#(and (<= 0 main_~i~0) (<= 0 main_~sum~0))} is VALID [2022-04-15 13:22:13,137 INFO L290 TraceCheckUtils]: 7: Hoare triple {5948#(and (<= 0 main_~i~0) (<= 0 main_~sum~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5952#(and (<= 0 main_~sum~0) (<= 1 main_~i~0))} is VALID [2022-04-15 13:22:13,138 INFO L290 TraceCheckUtils]: 8: Hoare triple {5952#(and (<= 0 main_~sum~0) (<= 1 main_~i~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5956#(and (<= 2 main_~i~0) (<= 1 main_~sum~0))} is VALID [2022-04-15 13:22:13,140 INFO L290 TraceCheckUtils]: 9: Hoare triple {5956#(and (<= 2 main_~i~0) (<= 1 main_~sum~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5960#(and (<= 3 main_~sum~0) (<= 3 main_~i~0))} is VALID [2022-04-15 13:22:13,141 INFO L290 TraceCheckUtils]: 10: Hoare triple {5960#(and (<= 3 main_~sum~0) (<= 3 main_~i~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5964#(and (<= 6 main_~sum~0) (<= 4 main_~i~0))} is VALID [2022-04-15 13:22:13,143 INFO L290 TraceCheckUtils]: 11: Hoare triple {5964#(and (<= 6 main_~sum~0) (<= 4 main_~i~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5968#(and (<= 10 main_~sum~0) (<= 5 main_~i~0))} is VALID [2022-04-15 13:22:13,145 INFO L290 TraceCheckUtils]: 12: Hoare triple {5968#(and (<= 10 main_~sum~0) (<= 5 main_~i~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5972#(and (<= 15 main_~sum~0) (<= 6 main_~i~0))} is VALID [2022-04-15 13:22:13,146 INFO L290 TraceCheckUtils]: 13: Hoare triple {5972#(and (<= 15 main_~sum~0) (<= 6 main_~i~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5976#(and (<= 21 main_~sum~0) (<= 7 main_~i~0))} is VALID [2022-04-15 13:22:13,147 INFO L290 TraceCheckUtils]: 14: Hoare triple {5976#(and (<= 21 main_~sum~0) (<= 7 main_~i~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5980#(and (<= 8 main_~i~0) (<= 28 main_~sum~0))} is VALID [2022-04-15 13:22:13,148 INFO L290 TraceCheckUtils]: 15: Hoare triple {5980#(and (<= 8 main_~i~0) (<= 28 main_~sum~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5984#(and (<= 9 main_~i~0) (<= 36 main_~sum~0))} is VALID [2022-04-15 13:22:13,150 INFO L290 TraceCheckUtils]: 16: Hoare triple {5984#(and (<= 9 main_~i~0) (<= 36 main_~sum~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5988#(and (<= 10 main_~i~0) (<= 45 main_~sum~0))} is VALID [2022-04-15 13:22:13,151 INFO L290 TraceCheckUtils]: 17: Hoare triple {5988#(and (<= 10 main_~i~0) (<= 45 main_~sum~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5992#(and (<= 55 main_~sum~0) (<= 11 main_~i~0))} is VALID [2022-04-15 13:22:13,152 INFO L290 TraceCheckUtils]: 18: Hoare triple {5992#(and (<= 55 main_~sum~0) (<= 11 main_~i~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5996#(and (<= 66 main_~sum~0) (<= 12 main_~i~0))} is VALID [2022-04-15 13:22:13,153 INFO L290 TraceCheckUtils]: 19: Hoare triple {5996#(and (<= 66 main_~sum~0) (<= 12 main_~i~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6000#(and (<= 13 main_~i~0) (<= 78 main_~sum~0))} is VALID [2022-04-15 13:22:13,154 INFO L290 TraceCheckUtils]: 20: Hoare triple {6000#(and (<= 13 main_~i~0) (<= 78 main_~sum~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6004#(and (<= 14 main_~i~0) (<= 91 main_~sum~0))} is VALID [2022-04-15 13:22:13,156 INFO L290 TraceCheckUtils]: 21: Hoare triple {6004#(and (<= 14 main_~i~0) (<= 91 main_~sum~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6008#(and (<= 15 main_~i~0) (<= 105 main_~sum~0))} is VALID [2022-04-15 13:22:13,158 INFO L290 TraceCheckUtils]: 22: Hoare triple {6008#(and (<= 15 main_~i~0) (<= 105 main_~sum~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6012#(and (<= 16 main_~i~0) (<= 120 main_~sum~0))} is VALID [2022-04-15 13:22:13,159 INFO L290 TraceCheckUtils]: 23: Hoare triple {6012#(and (<= 16 main_~i~0) (<= 120 main_~sum~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6016#(and (<= 17 main_~i~0) (<= 136 main_~sum~0))} is VALID [2022-04-15 13:22:13,161 INFO L290 TraceCheckUtils]: 24: Hoare triple {6016#(and (<= 17 main_~i~0) (<= 136 main_~sum~0))} assume !!(~i~0 < ~n~0);~sum~0 := ~sum~0 + ~i~0;#t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5923#(<= 153 main_~sum~0)} is VALID [2022-04-15 13:22:13,161 INFO L290 TraceCheckUtils]: 25: Hoare triple {5923#(<= 153 main_~sum~0)} assume !(~i~0 < ~n~0); {5923#(<= 153 main_~sum~0)} is VALID [2022-04-15 13:22:13,161 INFO L272 TraceCheckUtils]: 26: Hoare triple {5923#(<= 153 main_~sum~0)} call __VERIFIER_assert((if ~sum~0 >= 0 then 1 else 0)); {6026#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 13:22:13,162 INFO L290 TraceCheckUtils]: 27: Hoare triple {6026#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {6030#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 13:22:13,162 INFO L290 TraceCheckUtils]: 28: Hoare triple {6030#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {5901#false} is VALID [2022-04-15 13:22:13,162 INFO L290 TraceCheckUtils]: 29: Hoare triple {5901#false} assume !false; {5901#false} is VALID [2022-04-15 13:22:13,162 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 153 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 13:22:13,162 INFO L328 TraceCheckSpWp]: Computing backward predicates...