/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf -i ../../../trunk/examples/svcomp/loops/sum01-2.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-8fc6572 [2020-07-10 20:21:58,675 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-10 20:21:58,677 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-10 20:21:58,693 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-10 20:21:58,694 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-10 20:21:58,695 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-10 20:21:58,696 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-10 20:21:58,698 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-10 20:21:58,700 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-10 20:21:58,700 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-10 20:21:58,701 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-10 20:21:58,703 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-10 20:21:58,703 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-10 20:21:58,704 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-10 20:21:58,705 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-10 20:21:58,706 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-10 20:21:58,707 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-10 20:21:58,707 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-10 20:21:58,709 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-10 20:21:58,711 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-10 20:21:58,712 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-10 20:21:58,713 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-10 20:21:58,714 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-10 20:21:58,715 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-10 20:21:58,717 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-10 20:21:58,718 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-10 20:21:58,718 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-10 20:21:58,719 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-10 20:21:58,719 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-10 20:21:58,720 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-10 20:21:58,720 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-10 20:21:58,721 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-10 20:21:58,721 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-10 20:21:58,722 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-10 20:21:58,723 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-10 20:21:58,723 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-10 20:21:58,724 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-10 20:21:58,724 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-10 20:21:58,724 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-10 20:21:58,725 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-10 20:21:58,726 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-10 20:21:58,727 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf [2020-07-10 20:21:58,736 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-10 20:21:58,736 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-10 20:21:58,737 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-10 20:21:58,737 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-10 20:21:58,738 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-10 20:21:58,738 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-10 20:21:58,738 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-10 20:21:58,738 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-10 20:21:58,738 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-10 20:21:58,739 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-10 20:21:58,739 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-10 20:21:58,739 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-10 20:21:58,739 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-10 20:21:58,739 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-10 20:21:58,740 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-10 20:21:58,740 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-07-10 20:21:58,740 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-10 20:21:58,740 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-10 20:21:58,740 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-10 20:21:58,741 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-10 20:21:58,741 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-07-10 20:21:58,741 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-10 20:21:58,741 INFO L138 SettingsManager]: * Use separate solver for trace checks=false [2020-07-10 20:21:59,031 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-10 20:21:59,048 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-10 20:21:59,050 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-10 20:21:59,051 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-10 20:21:59,052 INFO L275 PluginConnector]: CDTParser initialized [2020-07-10 20:21:59,052 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops/sum01-2.i [2020-07-10 20:21:59,119 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2a91350af/2b8ea97a36e042ce8623ea85f4cc8e54/FLAG31d098df2 [2020-07-10 20:21:59,558 INFO L306 CDTParser]: Found 1 translation units. [2020-07-10 20:21:59,559 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/sum01-2.i [2020-07-10 20:21:59,565 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2a91350af/2b8ea97a36e042ce8623ea85f4cc8e54/FLAG31d098df2 [2020-07-10 20:21:59,972 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2a91350af/2b8ea97a36e042ce8623ea85f4cc8e54 [2020-07-10 20:21:59,983 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-10 20:21:59,985 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-10 20:21:59,986 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-10 20:21:59,986 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-10 20:21:59,990 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-10 20:21:59,991 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.07 08:21:59" (1/1) ... [2020-07-10 20:21:59,994 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@77eacc4d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:21:59, skipping insertion in model container [2020-07-10 20:21:59,994 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.07 08:21:59" (1/1) ... [2020-07-10 20:22:00,003 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-10 20:22:00,020 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-10 20:22:00,210 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-10 20:22:00,215 INFO L203 MainTranslator]: Completed pre-run [2020-07-10 20:22:00,234 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-10 20:22:00,250 INFO L208 MainTranslator]: Completed translation [2020-07-10 20:22:00,251 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:22:00 WrapperNode [2020-07-10 20:22:00,251 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-10 20:22:00,252 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-10 20:22:00,252 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-10 20:22:00,252 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-10 20:22:00,263 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:22:00" (1/1) ... [2020-07-10 20:22:00,264 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:22:00" (1/1) ... [2020-07-10 20:22:00,268 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:22:00" (1/1) ... [2020-07-10 20:22:00,268 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:22:00" (1/1) ... [2020-07-10 20:22:00,357 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:22:00" (1/1) ... [2020-07-10 20:22:00,363 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:22:00" (1/1) ... [2020-07-10 20:22:00,364 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:22:00" (1/1) ... [2020-07-10 20:22:00,366 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-10 20:22:00,366 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-10 20:22:00,367 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-10 20:22:00,367 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-10 20:22:00,368 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:22:00" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-10 20:22:00,434 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-10 20:22:00,434 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-10 20:22:00,434 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2020-07-10 20:22:00,434 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-10 20:22:00,434 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-10 20:22:00,434 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2020-07-10 20:22:00,435 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-10 20:22:00,435 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-10 20:22:00,435 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-10 20:22:00,435 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-10 20:22:00,678 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-10 20:22:00,679 INFO L295 CfgBuilder]: Removed 1 assume(true) statements. [2020-07-10 20:22:00,685 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.07 08:22:00 BoogieIcfgContainer [2020-07-10 20:22:00,685 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-10 20:22:00,687 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-10 20:22:00,688 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-10 20:22:00,691 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-10 20:22:00,691 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.07 08:21:59" (1/3) ... [2020-07-10 20:22:00,692 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b0dc451 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.07 08:22:00, skipping insertion in model container [2020-07-10 20:22:00,692 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:22:00" (2/3) ... [2020-07-10 20:22:00,693 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b0dc451 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.07 08:22:00, skipping insertion in model container [2020-07-10 20:22:00,693 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.07 08:22:00" (3/3) ... [2020-07-10 20:22:00,695 INFO L109 eAbstractionObserver]: Analyzing ICFG sum01-2.i [2020-07-10 20:22:00,710 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:AcceleratedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-07-10 20:22:00,720 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-10 20:22:00,739 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-10 20:22:00,765 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-10 20:22:00,766 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-10 20:22:00,766 INFO L377 AbstractCegarLoop]: Compute interpolants for AcceleratedInterpolation [2020-07-10 20:22:00,766 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-10 20:22:00,766 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-10 20:22:00,766 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-10 20:22:00,767 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-10 20:22:00,767 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-10 20:22:00,796 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states. [2020-07-10 20:22:00,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-07-10 20:22:00,821 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 20:22:00,822 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 20:22:00,822 INFO L427 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 20:22:00,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 20:22:00,835 INFO L82 PathProgramCache]: Analyzing trace with hash 2078788022, now seen corresponding path program 1 times [2020-07-10 20:22:00,846 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 20:22:00,847 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1584170857] [2020-07-10 20:22:00,847 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 20:22:00,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:22:01,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:22:01,102 INFO L280 TraceCheckUtils]: 0: Hoare triple {31#true} assume true; {31#true} is VALID [2020-07-10 20:22:01,102 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {31#true} {31#true} #45#return; {31#true} is VALID [2020-07-10 20:22:01,105 INFO L263 TraceCheckUtils]: 0: Hoare triple {31#true} call ULTIMATE.init(); {31#true} is VALID [2020-07-10 20:22:01,105 INFO L280 TraceCheckUtils]: 1: Hoare triple {31#true} assume true; {31#true} is VALID [2020-07-10 20:22:01,106 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {31#true} {31#true} #45#return; {31#true} is VALID [2020-07-10 20:22:01,106 INFO L263 TraceCheckUtils]: 3: Hoare triple {31#true} call #t~ret2 := main(); {31#true} is VALID [2020-07-10 20:22:01,107 INFO L280 TraceCheckUtils]: 4: Hoare triple {31#true} havoc ~i~0; {31#true} is VALID [2020-07-10 20:22:01,107 INFO L280 TraceCheckUtils]: 5: Hoare triple {31#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {31#true} is VALID [2020-07-10 20:22:01,108 INFO L280 TraceCheckUtils]: 6: Hoare triple {31#true} ~n~0 := #t~nondet0; {31#true} is VALID [2020-07-10 20:22:01,108 INFO L280 TraceCheckUtils]: 7: Hoare triple {31#true} havoc #t~nondet0; {31#true} is VALID [2020-07-10 20:22:01,113 INFO L280 TraceCheckUtils]: 8: Hoare triple {31#true} ~sn~0 := 0; {35#(= 0 main_~sn~0)} is VALID [2020-07-10 20:22:01,116 INFO L280 TraceCheckUtils]: 9: Hoare triple {35#(= 0 main_~sn~0)} assume !!(~n~0 < 1000 && ~n~0 >= -1000); {35#(= 0 main_~sn~0)} is VALID [2020-07-10 20:22:01,117 INFO L280 TraceCheckUtils]: 10: Hoare triple {35#(= 0 main_~sn~0)} ~i~0 := 1; {35#(= 0 main_~sn~0)} is VALID [2020-07-10 20:22:01,120 INFO L280 TraceCheckUtils]: 11: Hoare triple {35#(= 0 main_~sn~0)} assume !(~i~0 <= ~n~0); {35#(= 0 main_~sn~0)} is VALID [2020-07-10 20:22:01,124 INFO L263 TraceCheckUtils]: 12: Hoare triple {35#(= 0 main_~sn~0)} call __VERIFIER_assert((if ~sn~0 == 2 * ~n~0 || 0 == ~sn~0 then 1 else 0)); {36#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-10 20:22:01,126 INFO L280 TraceCheckUtils]: 13: Hoare triple {36#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {37#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-10 20:22:01,128 INFO L280 TraceCheckUtils]: 14: Hoare triple {37#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {32#false} is VALID [2020-07-10 20:22:01,129 INFO L280 TraceCheckUtils]: 15: Hoare triple {32#false} assume !false; {32#false} is VALID [2020-07-10 20:22:01,132 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 20:22:01,132 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-10 20:22:01,136 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1584170857] [2020-07-10 20:22:01,142 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 20:22:01,142 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-10 20:22:01,143 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [935848018] [2020-07-10 20:22:01,150 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2020-07-10 20:22:01,153 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 20:22:01,156 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-10 20:22:01,195 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:22:01,196 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-10 20:22:01,196 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-10 20:22:01,205 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-10 20:22:01,206 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-10 20:22:01,209 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 5 states. [2020-07-10 20:22:01,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:22:01,492 INFO L93 Difference]: Finished difference Result 48 states and 56 transitions. [2020-07-10 20:22:01,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-10 20:22:01,492 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2020-07-10 20:22:01,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 20:22:01,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-10 20:22:01,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 56 transitions. [2020-07-10 20:22:01,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-10 20:22:01,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 56 transitions. [2020-07-10 20:22:01,511 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 56 transitions. [2020-07-10 20:22:01,611 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:22:01,623 INFO L225 Difference]: With dead ends: 48 [2020-07-10 20:22:01,623 INFO L226 Difference]: Without dead ends: 23 [2020-07-10 20:22:01,627 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-07-10 20:22:01,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2020-07-10 20:22:01,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 22. [2020-07-10 20:22:01,691 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 20:22:01,692 INFO L82 GeneralOperation]: Start isEquivalent. First operand 23 states. Second operand 22 states. [2020-07-10 20:22:01,692 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand 22 states. [2020-07-10 20:22:01,692 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 22 states. [2020-07-10 20:22:01,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:22:01,698 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2020-07-10 20:22:01,698 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2020-07-10 20:22:01,700 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:22:01,700 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:22:01,701 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand 23 states. [2020-07-10 20:22:01,701 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 23 states. [2020-07-10 20:22:01,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:22:01,710 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2020-07-10 20:22:01,711 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2020-07-10 20:22:01,711 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:22:01,712 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:22:01,712 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 20:22:01,712 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 20:22:01,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2020-07-10 20:22:01,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 22 transitions. [2020-07-10 20:22:01,720 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 22 transitions. Word has length 16 [2020-07-10 20:22:01,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 20:22:01,721 INFO L479 AbstractCegarLoop]: Abstraction has 22 states and 22 transitions. [2020-07-10 20:22:01,721 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-10 20:22:01,721 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 22 states and 22 transitions. [2020-07-10 20:22:01,763 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:22:01,763 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2020-07-10 20:22:01,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-07-10 20:22:01,765 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 20:22:01,765 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 20:22:01,765 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-10 20:22:01,766 INFO L427 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 20:22:01,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 20:22:01,767 INFO L82 PathProgramCache]: Analyzing trace with hash 493290783, now seen corresponding path program 1 times [2020-07-10 20:22:01,767 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 20:22:01,767 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [174695252] [2020-07-10 20:22:01,768 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Garbage collection #1: 11 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 11 to 19 Garbage collection #2: 19 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 19 to 37 Garbage collection #3: 37 nodes / 0 free / 0.001s / 0.001s total Resizing node table from 37 to 73 [2020-07-10 20:22:04,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:22:04,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:22:04,491 INFO L280 TraceCheckUtils]: 0: Hoare triple {228#true} assume true; {228#true} is VALID [2020-07-10 20:22:04,491 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {228#true} {228#true} #45#return; {228#true} is VALID [2020-07-10 20:22:04,492 INFO L263 TraceCheckUtils]: 0: Hoare triple {228#true} call ULTIMATE.init(); {228#true} is VALID [2020-07-10 20:22:04,492 INFO L280 TraceCheckUtils]: 1: Hoare triple {228#true} assume true; {228#true} is VALID [2020-07-10 20:22:04,492 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {228#true} {228#true} #45#return; {228#true} is VALID [2020-07-10 20:22:04,493 INFO L263 TraceCheckUtils]: 3: Hoare triple {228#true} call #t~ret2 := main(); {228#true} is VALID [2020-07-10 20:22:04,493 INFO L280 TraceCheckUtils]: 4: Hoare triple {228#true} havoc ~i~0; {228#true} is VALID [2020-07-10 20:22:04,493 INFO L280 TraceCheckUtils]: 5: Hoare triple {228#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {228#true} is VALID [2020-07-10 20:22:04,493 INFO L280 TraceCheckUtils]: 6: Hoare triple {228#true} ~n~0 := #t~nondet0; {228#true} is VALID [2020-07-10 20:22:04,494 INFO L280 TraceCheckUtils]: 7: Hoare triple {228#true} havoc #t~nondet0; {228#true} is VALID [2020-07-10 20:22:04,494 INFO L280 TraceCheckUtils]: 8: Hoare triple {228#true} ~sn~0 := 0; {232#(and (<= main_~sn~0 0) (<= 0 main_~sn~0))} is VALID [2020-07-10 20:22:04,495 INFO L280 TraceCheckUtils]: 9: Hoare triple {232#(and (<= main_~sn~0 0) (<= 0 main_~sn~0))} assume !!(~n~0 < 1000 && ~n~0 >= -1000); {232#(and (<= main_~sn~0 0) (<= 0 main_~sn~0))} is VALID [2020-07-10 20:22:04,498 INFO L280 TraceCheckUtils]: 10: Hoare triple {232#(and (<= main_~sn~0 0) (<= 0 main_~sn~0))} ~i~0 := 1; {233#(and (<= (+ main_~sn~0 2) (* 2 main_~i~0)) (<= (* 2 main_~i~0) (+ main_~sn~0 2)))} is VALID [2020-07-10 20:22:04,502 INFO L280 TraceCheckUtils]: 11: Hoare triple {233#(and (<= (+ main_~sn~0 2) (* 2 main_~i~0)) (<= (* 2 main_~i~0) (+ main_~sn~0 2)))} [51] L14-6-->L14-7_primed: Formula: (let ((.cse6 (div (+ v_oct_main_~sn~0_in_1 (* v_oct_main_~sn~0_out_1 (- 1)) 4) (- 2))) (.cse5 (div (+ (* v_oct_main_~sn~0_in_1 (- 1)) v_oct_main_~sn~0_out_1 (- 4)) 2))) (let ((.cse0 (<= v_oct_main_~n~0_in_1 v_oct_main_~n~0_out_1)) (.cse2 (<= v_oct_main_~n~0_out_1 v_oct_main_~n~0_in_1)) (.cse7 (+ v_oct_main_~i~0_in_1 .cse5 2)) (.cse4 (+ .cse6 v_oct_main_~i~0_in_1 2))) (or (let ((.cse1 (+ v_oct_main_~i~0_in_1 1)) (.cse3 (+ v_oct_main_~sn~0_in_1 2))) (and .cse0 (<= .cse1 v_oct_main_~i~0_out_1) .cse2 (<= v_oct_main_~i~0_in_1 v_oct_main_~n~0_in_1) (<= v_oct_main_~i~0_out_1 .cse1) (<= v_oct_main_~sn~0_out_1 .cse3) (or (< v_oct_main_~i~0_out_1 .cse4) (not .cse2) (< .cse5 0) (< v_oct_main_~n~0_in_1 (+ .cse6 v_oct_main_~i~0_in_1 1)) (not .cse0) (< .cse7 v_oct_main_~i~0_out_1)) (<= .cse3 v_oct_main_~sn~0_out_1))) (and .cse0 .cse2 (<= v_oct_main_~i~0_out_1 .cse7) (<= 0 .cse5) (<= v_oct_main_~i~0_out_1 (+ v_oct_main_~n~0_in_1 1)) (<= .cse4 v_oct_main_~i~0_out_1))))) InVars {main_~i~0=v_oct_main_~i~0_in_1, main_~n~0=v_oct_main_~n~0_in_1, main_~sn~0=v_oct_main_~sn~0_in_1} OutVars{main_~i~0=v_oct_main_~i~0_out_1, main_~n~0=v_oct_main_~n~0_out_1, main_~sn~0=v_oct_main_~sn~0_out_1, main_#t~post1=|v_oct_main_#t~post1_out_1|} AuxVars[] AssignedVars[main_~sn~0, main_#t~post1, main_~i~0, main_~n~0] {234#(and (<= main_~sn~0 (* 2 main_~n~0)) (or (<= (* 2 main_~i~0) (+ main_~sn~0 2)) (< (* 2 main_~n~0) (+ main_~sn~0 1))))} is VALID [2020-07-10 20:22:04,503 INFO L280 TraceCheckUtils]: 12: Hoare triple {234#(and (<= main_~sn~0 (* 2 main_~n~0)) (or (<= (* 2 main_~i~0) (+ main_~sn~0 2)) (< (* 2 main_~n~0) (+ main_~sn~0 1))))} [50] L14-7_primed-->L14-7: Formula: (not (<= v_main_~i~0_3 v_main_~n~0_4)) InVars {main_~i~0=v_main_~i~0_3, main_~n~0=v_main_~n~0_4} OutVars{main_~i~0=v_main_~i~0_3, main_~n~0=v_main_~n~0_4} AuxVars[] AssignedVars[] {235#(and (<= main_~sn~0 (* 2 main_~n~0)) (< (* 2 main_~n~0) (+ main_~sn~0 1)))} is VALID [2020-07-10 20:22:04,504 INFO L263 TraceCheckUtils]: 13: Hoare triple {235#(and (<= main_~sn~0 (* 2 main_~n~0)) (< (* 2 main_~n~0) (+ main_~sn~0 1)))} call __VERIFIER_assert((if ~sn~0 == 2 * ~n~0 || 0 == ~sn~0 then 1 else 0)); {236#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-10 20:22:04,506 INFO L280 TraceCheckUtils]: 14: Hoare triple {236#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {237#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-10 20:22:04,507 INFO L280 TraceCheckUtils]: 15: Hoare triple {237#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {229#false} is VALID [2020-07-10 20:22:04,508 INFO L280 TraceCheckUtils]: 16: Hoare triple {229#false} assume !false; {229#false} is VALID [2020-07-10 20:22:04,509 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 20:22:04,723 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-10 20:22:04,724 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [174695252] [2020-07-10 20:22:04,724 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 20:22:04,724 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-07-10 20:22:04,724 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [953952391] [2020-07-10 20:22:04,725 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 21 [2020-07-10 20:22:04,726 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 20:22:04,726 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2020-07-10 20:22:04,756 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:22:04,756 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-07-10 20:22:04,757 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-10 20:22:04,757 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-07-10 20:22:04,758 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2020-07-10 20:22:04,758 INFO L87 Difference]: Start difference. First operand 22 states and 22 transitions. Second operand 12 states. [2020-07-10 20:22:05,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:22:05,195 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2020-07-10 20:22:05,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-07-10 20:22:05,196 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 21 [2020-07-10 20:22:05,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 20:22:05,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2020-07-10 20:22:05,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 23 transitions. [2020-07-10 20:22:05,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2020-07-10 20:22:05,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 23 transitions. [2020-07-10 20:22:05,209 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states and 23 transitions. [2020-07-10 20:22:05,257 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:22:05,258 INFO L225 Difference]: With dead ends: 23 [2020-07-10 20:22:05,258 INFO L226 Difference]: Without dead ends: 0 [2020-07-10 20:22:05,261 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=57, Invalid=215, Unknown=0, NotChecked=0, Total=272 [2020-07-10 20:22:05,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-07-10 20:22:05,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-07-10 20:22:05,261 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 20:22:05,262 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2020-07-10 20:22:05,262 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-10 20:22:05,262 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-10 20:22:05,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:22:05,262 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-10 20:22:05,262 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-10 20:22:05,262 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:22:05,263 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:22:05,263 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-10 20:22:05,263 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-10 20:22:05,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:22:05,265 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-10 20:22:05,265 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-10 20:22:05,266 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:22:05,266 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:22:05,266 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 20:22:05,266 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 20:22:05,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-07-10 20:22:05,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-07-10 20:22:05,267 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 21 [2020-07-10 20:22:05,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 20:22:05,267 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-10 20:22:05,267 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-07-10 20:22:05,268 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 0 states and 0 transitions. [2020-07-10 20:22:05,268 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:22:05,268 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-10 20:22:05,268 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:22:05,270 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-10 20:22:05,272 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-07-10 20:22:05,560 INFO L271 CegarLoopResult]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2020-07-10 20:22:05,561 INFO L271 CegarLoopResult]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2020-07-10 20:22:05,561 INFO L271 CegarLoopResult]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2020-07-10 20:22:05,561 INFO L271 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-07-10 20:22:05,561 INFO L271 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-07-10 20:22:05,561 INFO L271 CegarLoopResult]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2020-07-10 20:22:05,561 INFO L271 CegarLoopResult]: At program point mainEXIT(lines 11 18) the Hoare annotation is: true [2020-07-10 20:22:05,562 INFO L264 CegarLoopResult]: At program point L15(line 15) the Hoare annotation is: (let ((.cse1 (* 2 main_~i~0)) (.cse0 (+ main_~sn~0 2))) (and (<= .cse0 .cse1) (<= main_~i~0 main_~n~0) (<= .cse1 .cse0))) [2020-07-10 20:22:05,562 INFO L264 CegarLoopResult]: At program point L13(line 13) the Hoare annotation is: (= 0 main_~sn~0) [2020-07-10 20:22:05,562 INFO L271 CegarLoopResult]: At program point mainFINAL(lines 11 18) the Hoare annotation is: true [2020-07-10 20:22:05,562 INFO L264 CegarLoopResult]: At program point L13-1(line 13) the Hoare annotation is: (= 0 main_~sn~0) [2020-07-10 20:22:05,565 INFO L271 CegarLoopResult]: At program point mainENTRY(lines 11 18) the Hoare annotation is: true [2020-07-10 20:22:05,566 INFO L264 CegarLoopResult]: At program point L14(line 14) the Hoare annotation is: (= 0 main_~sn~0) [2020-07-10 20:22:05,566 INFO L271 CegarLoopResult]: At program point L12(line 12) the Hoare annotation is: true [2020-07-10 20:22:05,566 INFO L271 CegarLoopResult]: At program point L12-1(line 12) the Hoare annotation is: true [2020-07-10 20:22:05,566 INFO L264 CegarLoopResult]: At program point L14-3(lines 14 16) the Hoare annotation is: (let ((.cse0 (* 2 main_~i~0))) (and (<= main_~sn~0 .cse0) (<= main_~i~0 main_~n~0) (<= .cse0 main_~sn~0))) [2020-07-10 20:22:05,566 INFO L271 CegarLoopResult]: At program point L12-2(line 12) the Hoare annotation is: true [2020-07-10 20:22:05,567 INFO L264 CegarLoopResult]: At program point L14-4(line 14) the Hoare annotation is: (let ((.cse0 (* 2 main_~i~0))) (and (<= main_~sn~0 .cse0) (<= main_~i~0 main_~n~0) (<= .cse0 main_~sn~0) (= |main_#t~post1| main_~i~0))) [2020-07-10 20:22:05,567 INFO L271 CegarLoopResult]: At program point L12-3(line 12) the Hoare annotation is: true [2020-07-10 20:22:05,567 INFO L264 CegarLoopResult]: At program point L14-5(line 14) the Hoare annotation is: (let ((.cse0 (* 2 |main_#t~post1|))) (and (= main_~i~0 (+ |main_#t~post1| 1)) (<= main_~sn~0 .cse0) (<= .cse0 main_~sn~0) (<= |main_#t~post1| main_~n~0))) [2020-07-10 20:22:05,567 INFO L264 CegarLoopResult]: At program point L14-6(lines 14 16) the Hoare annotation is: (let ((.cse3 (+ main_~sn~0 2)) (.cse2 (* 2 main_~i~0))) (let ((.cse0 (<= .cse3 .cse2)) (.cse1 (<= .cse2 .cse3))) (or (and .cse0 .cse1 (= 0 main_~sn~0)) (and (<= main_~i~0 (+ main_~n~0 1)) .cse0 .cse1)))) [2020-07-10 20:22:05,568 INFO L264 CegarLoopResult]: At program point L14-7(lines 14 16) the Hoare annotation is: (or (let ((.cse1 (* 2 main_~i~0)) (.cse0 (+ main_~sn~0 2))) (and (<= main_~i~0 (+ main_~n~0 1)) (<= .cse0 .cse1) (<= .cse1 .cse0) (< main_~n~0 main_~i~0))) (= 0 main_~sn~0)) [2020-07-10 20:22:05,569 INFO L271 CegarLoopResult]: At program point __VERIFIER_assertENTRY(lines 4 9) the Hoare annotation is: true [2020-07-10 20:22:05,569 INFO L264 CegarLoopResult]: At program point __VERIFIER_assertEXIT(lines 4 9) the Hoare annotation is: (or (= 0 |__VERIFIER_assert_#in~cond|) (not (= 0 __VERIFIER_assert_~cond))) [2020-07-10 20:22:05,569 INFO L264 CegarLoopResult]: At program point L6(line 6) the Hoare annotation is: (= 0 |__VERIFIER_assert_#in~cond|) [2020-07-10 20:22:05,569 INFO L264 CegarLoopResult]: At program point L5(lines 5 7) the Hoare annotation is: (or (= 0 |__VERIFIER_assert_#in~cond|) (not (= 0 __VERIFIER_assert_~cond))) [2020-07-10 20:22:05,569 INFO L264 CegarLoopResult]: At program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 6) the Hoare annotation is: (= 0 |__VERIFIER_assert_#in~cond|) [2020-07-10 20:22:05,570 INFO L264 CegarLoopResult]: At program point L5-2(lines 4 9) the Hoare annotation is: (or (= 0 |__VERIFIER_assert_#in~cond|) (not (= 0 __VERIFIER_assert_~cond))) [2020-07-10 20:22:05,584 INFO L163 areAnnotationChecker]: CFG has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2020-07-10 20:22:05,604 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.07 08:22:05 BoogieIcfgContainer [2020-07-10 20:22:05,605 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-10 20:22:05,608 INFO L168 Benchmark]: Toolchain (without parser) took 5622.97 ms. Allocated memory was 135.8 MB in the beginning and 253.8 MB in the end (delta: 118.0 MB). Free memory was 99.6 MB in the beginning and 157.1 MB in the end (delta: -57.5 MB). Peak memory consumption was 60.4 MB. Max. memory is 7.1 GB. [2020-07-10 20:22:05,609 INFO L168 Benchmark]: CDTParser took 0.83 ms. Allocated memory is still 135.8 MB. Free memory was 118.0 MB in the beginning and 117.7 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2020-07-10 20:22:05,610 INFO L168 Benchmark]: CACSL2BoogieTranslator took 265.45 ms. Allocated memory is still 135.8 MB. Free memory was 99.3 MB in the beginning and 89.5 MB in the end (delta: 9.8 MB). Peak memory consumption was 9.8 MB. Max. memory is 7.1 GB. [2020-07-10 20:22:05,611 INFO L168 Benchmark]: Boogie Preprocessor took 114.50 ms. Allocated memory was 135.8 MB in the beginning and 199.8 MB in the end (delta: 64.0 MB). Free memory was 89.5 MB in the beginning and 178.8 MB in the end (delta: -89.3 MB). Peak memory consumption was 15.0 MB. Max. memory is 7.1 GB. [2020-07-10 20:22:05,612 INFO L168 Benchmark]: RCFGBuilder took 319.18 ms. Allocated memory is still 199.8 MB. Free memory was 178.8 MB in the beginning and 162.3 MB in the end (delta: 16.5 MB). Peak memory consumption was 16.5 MB. Max. memory is 7.1 GB. [2020-07-10 20:22:05,613 INFO L168 Benchmark]: TraceAbstraction took 4917.31 ms. Allocated memory was 199.8 MB in the beginning and 253.8 MB in the end (delta: 54.0 MB). Free memory was 161.6 MB in the beginning and 157.1 MB in the end (delta: 4.6 MB). Peak memory consumption was 58.6 MB. Max. memory is 7.1 GB. [2020-07-10 20:22:05,617 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.83 ms. Allocated memory is still 135.8 MB. Free memory was 118.0 MB in the beginning and 117.7 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 265.45 ms. Allocated memory is still 135.8 MB. Free memory was 99.3 MB in the beginning and 89.5 MB in the end (delta: 9.8 MB). Peak memory consumption was 9.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 114.50 ms. Allocated memory was 135.8 MB in the beginning and 199.8 MB in the end (delta: 64.0 MB). Free memory was 89.5 MB in the beginning and 178.8 MB in the end (delta: -89.3 MB). Peak memory consumption was 15.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 319.18 ms. Allocated memory is still 199.8 MB. Free memory was 178.8 MB in the beginning and 162.3 MB in the end (delta: 16.5 MB). Peak memory consumption was 16.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 4917.31 ms. Allocated memory was 199.8 MB in the beginning and 253.8 MB in the end (delta: 54.0 MB). Free memory was 161.6 MB in the beginning and 157.1 MB in the end (delta: 4.6 MB). Peak memory consumption was 58.6 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 6]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 14]: Loop Invariant Derived loop invariant: ((sn + 2 <= 2 * i && 2 * i <= sn + 2) && 0 == sn) || ((i <= n + 1 && sn + 2 <= 2 * i) && 2 * i <= sn + 2) - ProcedureContractResult [Line: 11]: Procedure Contract for main Derived contract for procedure main: 1 - ProcedureContractResult [Line: 4]: Procedure Contract for __VERIFIER_assert Derived contract for procedure __VERIFIER_assert: 0 == \old(cond) || !(0 == cond) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 28 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 4.5s, OverallIterations: 2, TraceHistogramMax: 1, AutomataDifference: 0.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.2s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 39 SDtfs, 17 SDslu, 155 SDs, 0 SdLazy, 98 SolverSat, 3 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 30 GetRequests, 10 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=28occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 1 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 28 LocationsWithAnnotation, 40 PreInvPairs, 54 NumberOfFragments, 187 HoareAnnotationTreeSize, 40 FomulaSimplifications, 25 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 28 FomulaSimplificationsInter, 53 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: No data available, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...