java -ea -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector-Const.epf -i ../../../trunk/examples/svcomp/loops/n.c11_true-unreach-call_false-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-370d6ab [2018-11-14 18:26:58,098 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-14 18:26:58,100 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-14 18:26:58,113 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-14 18:26:58,113 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-14 18:26:58,115 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-14 18:26:58,116 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-14 18:26:58,118 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-14 18:26:58,119 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-14 18:26:58,120 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-14 18:26:58,121 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-14 18:26:58,121 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-14 18:26:58,122 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-14 18:26:58,123 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-14 18:26:58,125 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-14 18:26:58,125 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-14 18:26:58,126 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-14 18:26:58,129 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-14 18:26:58,131 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-14 18:26:58,132 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-14 18:26:58,133 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-14 18:26:58,135 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-14 18:26:58,137 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-14 18:26:58,138 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-14 18:26:58,138 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-14 18:26:58,139 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-14 18:26:58,140 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-14 18:26:58,141 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-14 18:26:58,142 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-14 18:26:58,144 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-14 18:26:58,144 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-14 18:26:58,145 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-14 18:26:58,146 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-14 18:26:58,146 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-14 18:26:58,147 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-14 18:26:58,148 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-14 18:26:58,148 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector-Const.epf [2018-11-14 18:26:58,176 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-14 18:26:58,176 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-14 18:26:58,179 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-14 18:26:58,179 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-14 18:26:58,180 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-14 18:26:58,180 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-14 18:26:58,180 INFO L133 SettingsManager]: * Use SBE=true [2018-11-14 18:26:58,182 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-14 18:26:58,182 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-14 18:26:58,182 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-14 18:26:58,182 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-14 18:26:58,182 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-14 18:26:58,183 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-14 18:26:58,183 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-14 18:26:58,183 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-14 18:26:58,183 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-14 18:26:58,183 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-14 18:26:58,184 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-14 18:26:58,185 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-14 18:26:58,185 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-14 18:26:58,185 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-14 18:26:58,186 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-14 18:26:58,186 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-14 18:26:58,186 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-14 18:26:58,186 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-14 18:26:58,186 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-14 18:26:58,186 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-14 18:26:58,187 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-14 18:26:58,187 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-11-14 18:26:58,188 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-14 18:26:58,188 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-14 18:26:58,188 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-14 18:26:58,188 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-14 18:26:58,260 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-14 18:26:58,281 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-14 18:26:58,286 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-14 18:26:58,288 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-14 18:26:58,289 INFO L276 PluginConnector]: CDTParser initialized [2018-11-14 18:26:58,289 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops/n.c11_true-unreach-call_false-termination.i [2018-11-14 18:26:58,352 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d9cf60f98/211cfb4380f84fce99c0b293f80efbe8/FLAGad2ecd806 [2018-11-14 18:26:58,796 INFO L298 CDTParser]: Found 1 translation units. [2018-11-14 18:26:58,796 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/n.c11_true-unreach-call_false-termination.i [2018-11-14 18:26:58,802 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d9cf60f98/211cfb4380f84fce99c0b293f80efbe8/FLAGad2ecd806 [2018-11-14 18:26:58,816 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d9cf60f98/211cfb4380f84fce99c0b293f80efbe8 [2018-11-14 18:26:58,827 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-14 18:26:58,828 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-11-14 18:26:58,829 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-14 18:26:58,829 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-14 18:26:58,833 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-14 18:26:58,835 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 06:26:58" (1/1) ... [2018-11-14 18:26:58,838 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@49326289 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:26:58, skipping insertion in model container [2018-11-14 18:26:58,838 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 06:26:58" (1/1) ... [2018-11-14 18:26:58,848 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-14 18:26:58,868 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-14 18:26:59,108 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-14 18:26:59,113 INFO L191 MainTranslator]: Completed pre-run [2018-11-14 18:26:59,132 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-14 18:26:59,148 INFO L195 MainTranslator]: Completed translation [2018-11-14 18:26:59,149 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:26:59 WrapperNode [2018-11-14 18:26:59,149 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-14 18:26:59,150 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-14 18:26:59,150 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-14 18:26:59,150 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-14 18:26:59,164 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:26:59" (1/1) ... [2018-11-14 18:26:59,165 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:26:59" (1/1) ... [2018-11-14 18:26:59,171 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:26:59" (1/1) ... [2018-11-14 18:26:59,172 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:26:59" (1/1) ... [2018-11-14 18:26:59,179 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:26:59" (1/1) ... [2018-11-14 18:26:59,185 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:26:59" (1/1) ... [2018-11-14 18:26:59,186 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:26:59" (1/1) ... [2018-11-14 18:26:59,188 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-14 18:26:59,188 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-14 18:26:59,188 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-14 18:26:59,189 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-14 18:26:59,189 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:26:59" (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 [2018-11-14 18:26:59,310 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-14 18:26:59,310 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-14 18:26:59,310 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-14 18:26:59,310 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-14 18:26:59,310 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-14 18:26:59,311 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-14 18:26:59,311 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2018-11-14 18:26:59,311 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-14 18:26:59,311 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-14 18:26:59,311 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-14 18:26:59,749 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-14 18:26:59,750 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 06:26:59 BoogieIcfgContainer [2018-11-14 18:26:59,750 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-14 18:26:59,751 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-14 18:26:59,751 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-14 18:26:59,754 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-14 18:26:59,755 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.11 06:26:58" (1/3) ... [2018-11-14 18:26:59,756 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d9e717d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 06:26:59, skipping insertion in model container [2018-11-14 18:26:59,756 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:26:59" (2/3) ... [2018-11-14 18:26:59,757 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d9e717d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 06:26:59, skipping insertion in model container [2018-11-14 18:26:59,757 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 06:26:59" (3/3) ... [2018-11-14 18:26:59,759 INFO L112 eAbstractionObserver]: Analyzing ICFG n.c11_true-unreach-call_false-termination.i [2018-11-14 18:26:59,767 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-14 18:26:59,775 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-14 18:26:59,792 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-14 18:26:59,825 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-14 18:26:59,826 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-14 18:26:59,826 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-14 18:26:59,827 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-14 18:26:59,827 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-14 18:26:59,827 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-14 18:26:59,827 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-14 18:26:59,827 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-14 18:26:59,827 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-14 18:26:59,848 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states. [2018-11-14 18:26:59,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-11-14 18:26:59,854 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:26:59,855 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:26:59,858 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:26:59,864 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:26:59,864 INFO L82 PathProgramCache]: Analyzing trace with hash -2008095039, now seen corresponding path program 1 times [2018-11-14 18:26:59,869 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 18:26:59,870 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 2 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-14 18:26:59,888 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:26:59,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:26:59,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:26:59,934 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:26:59,992 INFO L256 TraceCheckUtils]: 0: Hoare triple {24#true} call ULTIMATE.init(); {24#true} is VALID [2018-11-14 18:26:59,995 INFO L273 TraceCheckUtils]: 1: Hoare triple {24#true} assume true; {24#true} is VALID [2018-11-14 18:26:59,996 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {24#true} {24#true} #40#return; {24#true} is VALID [2018-11-14 18:26:59,996 INFO L256 TraceCheckUtils]: 3: Hoare triple {24#true} call #t~ret2 := main(); {24#true} is VALID [2018-11-14 18:26:59,997 INFO L273 TraceCheckUtils]: 4: Hoare triple {24#true} havoc ~a~0;~len~0 := 0bv32;havoc ~i~0; {24#true} is VALID [2018-11-14 18:26:59,998 INFO L273 TraceCheckUtils]: 5: Hoare triple {24#true} assume !true; {25#false} is VALID [2018-11-14 18:26:59,998 INFO L256 TraceCheckUtils]: 6: Hoare triple {25#false} call __VERIFIER_assert((if ~bvuge32(~len~0, 0bv32) && ~bvult32(~len~0, 5bv32) then 1bv32 else 0bv32)); {25#false} is VALID [2018-11-14 18:26:59,999 INFO L273 TraceCheckUtils]: 7: Hoare triple {25#false} ~cond := #in~cond; {25#false} is VALID [2018-11-14 18:26:59,999 INFO L273 TraceCheckUtils]: 8: Hoare triple {25#false} assume ~cond == 0bv32; {25#false} is VALID [2018-11-14 18:26:59,999 INFO L273 TraceCheckUtils]: 9: Hoare triple {25#false} assume !false; {25#false} is VALID [2018-11-14 18:27:00,002 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 18:27:00,002 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 18:27:00,005 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 18:27:00,005 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-14 18:27:00,010 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2018-11-14 18:27:00,014 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:27:00,017 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-14 18:27:00,045 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 10 edges. 10 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:27:00,045 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-14 18:27:00,054 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-14 18:27:00,055 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-14 18:27:00,057 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 2 states. [2018-11-14 18:27:00,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:27:00,184 INFO L93 Difference]: Finished difference Result 33 states and 37 transitions. [2018-11-14 18:27:00,184 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-14 18:27:00,184 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2018-11-14 18:27:00,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:27:00,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-14 18:27:00,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 37 transitions. [2018-11-14 18:27:00,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-14 18:27:00,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 37 transitions. [2018-11-14 18:27:00,211 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 37 transitions. [2018-11-14 18:27:00,552 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:27:00,561 INFO L225 Difference]: With dead ends: 33 [2018-11-14 18:27:00,561 INFO L226 Difference]: Without dead ends: 14 [2018-11-14 18:27:00,565 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-14 18:27:00,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2018-11-14 18:27:00,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2018-11-14 18:27:00,648 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:27:00,648 INFO L82 GeneralOperation]: Start isEquivalent. First operand 14 states. Second operand 14 states. [2018-11-14 18:27:00,649 INFO L74 IsIncluded]: Start isIncluded. First operand 14 states. Second operand 14 states. [2018-11-14 18:27:00,649 INFO L87 Difference]: Start difference. First operand 14 states. Second operand 14 states. [2018-11-14 18:27:00,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:27:00,653 INFO L93 Difference]: Finished difference Result 14 states and 15 transitions. [2018-11-14 18:27:00,654 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2018-11-14 18:27:00,654 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:27:00,654 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:27:00,655 INFO L74 IsIncluded]: Start isIncluded. First operand 14 states. Second operand 14 states. [2018-11-14 18:27:00,655 INFO L87 Difference]: Start difference. First operand 14 states. Second operand 14 states. [2018-11-14 18:27:00,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:27:00,658 INFO L93 Difference]: Finished difference Result 14 states and 15 transitions. [2018-11-14 18:27:00,658 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2018-11-14 18:27:00,659 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:27:00,659 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:27:00,659 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:27:00,660 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:27:00,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-14 18:27:00,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 15 transitions. [2018-11-14 18:27:00,664 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 15 transitions. Word has length 10 [2018-11-14 18:27:00,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:27:00,664 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 15 transitions. [2018-11-14 18:27:00,664 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-14 18:27:00,665 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2018-11-14 18:27:00,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-11-14 18:27:00,666 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:27:00,666 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:27:00,666 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:27:00,667 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:27:00,667 INFO L82 PathProgramCache]: Analyzing trace with hash 1715940768, now seen corresponding path program 1 times [2018-11-14 18:27:00,667 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 18:27:00,667 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 3 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-14 18:27:00,688 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:27:00,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:27:00,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:27:00,716 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:27:00,884 INFO L256 TraceCheckUtils]: 0: Hoare triple {146#true} call ULTIMATE.init(); {146#true} is VALID [2018-11-14 18:27:00,885 INFO L273 TraceCheckUtils]: 1: Hoare triple {146#true} assume true; {146#true} is VALID [2018-11-14 18:27:00,885 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {146#true} {146#true} #40#return; {146#true} is VALID [2018-11-14 18:27:00,886 INFO L256 TraceCheckUtils]: 3: Hoare triple {146#true} call #t~ret2 := main(); {146#true} is VALID [2018-11-14 18:27:00,887 INFO L273 TraceCheckUtils]: 4: Hoare triple {146#true} havoc ~a~0;~len~0 := 0bv32;havoc ~i~0; {163#(= main_~len~0 (_ bv0 32))} is VALID [2018-11-14 18:27:00,888 INFO L273 TraceCheckUtils]: 5: Hoare triple {163#(= main_~len~0 (_ bv0 32))} assume true; {163#(= main_~len~0 (_ bv0 32))} is VALID [2018-11-14 18:27:00,888 INFO L273 TraceCheckUtils]: 6: Hoare triple {163#(= main_~len~0 (_ bv0 32))} assume !(#t~nondet0 != 0bv8);havoc #t~nondet0; {163#(= main_~len~0 (_ bv0 32))} is VALID [2018-11-14 18:27:00,890 INFO L256 TraceCheckUtils]: 7: Hoare triple {163#(= main_~len~0 (_ bv0 32))} call __VERIFIER_assert((if ~bvuge32(~len~0, 0bv32) && ~bvult32(~len~0, 5bv32) then 1bv32 else 0bv32)); {173#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:27:00,891 INFO L273 TraceCheckUtils]: 8: Hoare triple {173#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} ~cond := #in~cond; {177#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:27:00,893 INFO L273 TraceCheckUtils]: 9: Hoare triple {177#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} assume ~cond == 0bv32; {147#false} is VALID [2018-11-14 18:27:00,893 INFO L273 TraceCheckUtils]: 10: Hoare triple {147#false} assume !false; {147#false} is VALID [2018-11-14 18:27:00,894 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 18:27:00,895 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [MP cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (3)] Exception during sending of exit command (exit): Broken pipe [2018-11-14 18:27:00,900 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 18:27:00,900 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-14 18:27:00,902 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2018-11-14 18:27:00,902 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:27:00,902 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-14 18:27:00,943 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:27:00,943 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-14 18:27:00,943 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-14 18:27:00,944 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-14 18:27:00,944 INFO L87 Difference]: Start difference. First operand 14 states and 15 transitions. Second operand 5 states. [2018-11-14 18:27:01,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:27:01,209 INFO L93 Difference]: Finished difference Result 30 states and 34 transitions. [2018-11-14 18:27:01,210 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-14 18:27:01,210 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2018-11-14 18:27:01,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:27:01,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-14 18:27:01,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 34 transitions. [2018-11-14 18:27:01,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-14 18:27:01,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 34 transitions. [2018-11-14 18:27:01,218 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 34 transitions. [2018-11-14 18:27:01,320 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:27:01,323 INFO L225 Difference]: With dead ends: 30 [2018-11-14 18:27:01,323 INFO L226 Difference]: Without dead ends: 18 [2018-11-14 18:27:01,325 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-14 18:27:01,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2018-11-14 18:27:01,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 17. [2018-11-14 18:27:01,414 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:27:01,415 INFO L82 GeneralOperation]: Start isEquivalent. First operand 18 states. Second operand 17 states. [2018-11-14 18:27:01,415 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states. Second operand 17 states. [2018-11-14 18:27:01,415 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 17 states. [2018-11-14 18:27:01,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:27:01,418 INFO L93 Difference]: Finished difference Result 18 states and 19 transitions. [2018-11-14 18:27:01,418 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 19 transitions. [2018-11-14 18:27:01,419 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:27:01,419 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:27:01,419 INFO L74 IsIncluded]: Start isIncluded. First operand 17 states. Second operand 18 states. [2018-11-14 18:27:01,419 INFO L87 Difference]: Start difference. First operand 17 states. Second operand 18 states. [2018-11-14 18:27:01,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:27:01,421 INFO L93 Difference]: Finished difference Result 18 states and 19 transitions. [2018-11-14 18:27:01,421 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 19 transitions. [2018-11-14 18:27:01,422 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:27:01,422 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:27:01,422 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:27:01,423 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:27:01,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-14 18:27:01,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 18 transitions. [2018-11-14 18:27:01,425 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 18 transitions. Word has length 11 [2018-11-14 18:27:01,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:27:01,425 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 18 transitions. [2018-11-14 18:27:01,425 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-14 18:27:01,425 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2018-11-14 18:27:01,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-14 18:27:01,426 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:27:01,426 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:27:01,427 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:27:01,427 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:27:01,427 INFO L82 PathProgramCache]: Analyzing trace with hash 1048902920, now seen corresponding path program 1 times [2018-11-14 18:27:01,428 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 18:27:01,428 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 4 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-14 18:27:01,459 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:27:01,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:27:01,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:27:01,507 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:27:01,813 INFO L256 TraceCheckUtils]: 0: Hoare triple {289#true} call ULTIMATE.init(); {289#true} is VALID [2018-11-14 18:27:01,814 INFO L273 TraceCheckUtils]: 1: Hoare triple {289#true} assume true; {289#true} is VALID [2018-11-14 18:27:01,814 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {289#true} {289#true} #40#return; {289#true} is VALID [2018-11-14 18:27:01,815 INFO L256 TraceCheckUtils]: 3: Hoare triple {289#true} call #t~ret2 := main(); {289#true} is VALID [2018-11-14 18:27:01,817 INFO L273 TraceCheckUtils]: 4: Hoare triple {289#true} havoc ~a~0;~len~0 := 0bv32;havoc ~i~0; {306#(= main_~len~0 (_ bv0 32))} is VALID [2018-11-14 18:27:01,835 INFO L273 TraceCheckUtils]: 5: Hoare triple {306#(= main_~len~0 (_ bv0 32))} assume true; {306#(= main_~len~0 (_ bv0 32))} is VALID [2018-11-14 18:27:01,839 INFO L273 TraceCheckUtils]: 6: Hoare triple {306#(= main_~len~0 (_ bv0 32))} assume !!(#t~nondet0 != 0bv8);havoc #t~nondet0; {306#(= main_~len~0 (_ bv0 32))} is VALID [2018-11-14 18:27:01,845 INFO L273 TraceCheckUtils]: 7: Hoare triple {306#(= main_~len~0 (_ bv0 32))} assume !(~len~0 == 4bv32); {306#(= main_~len~0 (_ bv0 32))} is VALID [2018-11-14 18:27:01,846 INFO L273 TraceCheckUtils]: 8: Hoare triple {306#(= main_~len~0 (_ bv0 32))} ~a~0 := ~a~0[~len~0 := 0bv32];#t~post1 := ~len~0;~len~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {319#(= (bvadd main_~len~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:27:01,855 INFO L273 TraceCheckUtils]: 9: Hoare triple {319#(= (bvadd main_~len~0 (_ bv4294967295 32)) (_ bv0 32))} assume true; {319#(= (bvadd main_~len~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:27:01,859 INFO L273 TraceCheckUtils]: 10: Hoare triple {319#(= (bvadd main_~len~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(#t~nondet0 != 0bv8);havoc #t~nondet0; {319#(= (bvadd main_~len~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:27:01,860 INFO L256 TraceCheckUtils]: 11: Hoare triple {319#(= (bvadd main_~len~0 (_ bv4294967295 32)) (_ bv0 32))} call __VERIFIER_assert((if ~bvuge32(~len~0, 0bv32) && ~bvult32(~len~0, 5bv32) then 1bv32 else 0bv32)); {329#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:27:01,863 INFO L273 TraceCheckUtils]: 12: Hoare triple {329#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} ~cond := #in~cond; {333#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:27:01,865 INFO L273 TraceCheckUtils]: 13: Hoare triple {333#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} assume ~cond == 0bv32; {290#false} is VALID [2018-11-14 18:27:01,865 INFO L273 TraceCheckUtils]: 14: Hoare triple {290#false} assume !false; {290#false} is VALID [2018-11-14 18:27:01,867 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 18:27:01,867 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-14 18:27:02,227 INFO L273 TraceCheckUtils]: 14: Hoare triple {290#false} assume !false; {290#false} is VALID [2018-11-14 18:27:02,228 INFO L273 TraceCheckUtils]: 13: Hoare triple {343#(not (= (_ bv0 32) __VERIFIER_assert_~cond))} assume ~cond == 0bv32; {290#false} is VALID [2018-11-14 18:27:02,229 INFO L273 TraceCheckUtils]: 12: Hoare triple {347#(not (= |__VERIFIER_assert_#in~cond| (_ bv0 32)))} ~cond := #in~cond; {343#(not (= (_ bv0 32) __VERIFIER_assert_~cond))} is VALID [2018-11-14 18:27:02,230 INFO L256 TraceCheckUtils]: 11: Hoare triple {351#(bvult main_~len~0 (_ bv5 32))} call __VERIFIER_assert((if ~bvuge32(~len~0, 0bv32) && ~bvult32(~len~0, 5bv32) then 1bv32 else 0bv32)); {347#(not (= |__VERIFIER_assert_#in~cond| (_ bv0 32)))} is VALID [2018-11-14 18:27:02,231 INFO L273 TraceCheckUtils]: 10: Hoare triple {351#(bvult main_~len~0 (_ bv5 32))} assume !(#t~nondet0 != 0bv8);havoc #t~nondet0; {351#(bvult main_~len~0 (_ bv5 32))} is VALID [2018-11-14 18:27:02,232 INFO L273 TraceCheckUtils]: 9: Hoare triple {351#(bvult main_~len~0 (_ bv5 32))} assume true; {351#(bvult main_~len~0 (_ bv5 32))} is VALID [2018-11-14 18:27:02,239 INFO L273 TraceCheckUtils]: 8: Hoare triple {361#(bvult (bvadd main_~len~0 (_ bv1 32)) (_ bv5 32))} ~a~0 := ~a~0[~len~0 := 0bv32];#t~post1 := ~len~0;~len~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {351#(bvult main_~len~0 (_ bv5 32))} is VALID [2018-11-14 18:27:02,240 INFO L273 TraceCheckUtils]: 7: Hoare triple {361#(bvult (bvadd main_~len~0 (_ bv1 32)) (_ bv5 32))} assume !(~len~0 == 4bv32); {361#(bvult (bvadd main_~len~0 (_ bv1 32)) (_ bv5 32))} is VALID [2018-11-14 18:27:02,241 INFO L273 TraceCheckUtils]: 6: Hoare triple {361#(bvult (bvadd main_~len~0 (_ bv1 32)) (_ bv5 32))} assume !!(#t~nondet0 != 0bv8);havoc #t~nondet0; {361#(bvult (bvadd main_~len~0 (_ bv1 32)) (_ bv5 32))} is VALID [2018-11-14 18:27:02,242 INFO L273 TraceCheckUtils]: 5: Hoare triple {361#(bvult (bvadd main_~len~0 (_ bv1 32)) (_ bv5 32))} assume true; {361#(bvult (bvadd main_~len~0 (_ bv1 32)) (_ bv5 32))} is VALID [2018-11-14 18:27:02,243 INFO L273 TraceCheckUtils]: 4: Hoare triple {289#true} havoc ~a~0;~len~0 := 0bv32;havoc ~i~0; {361#(bvult (bvadd main_~len~0 (_ bv1 32)) (_ bv5 32))} is VALID [2018-11-14 18:27:02,243 INFO L256 TraceCheckUtils]: 3: Hoare triple {289#true} call #t~ret2 := main(); {289#true} is VALID [2018-11-14 18:27:02,243 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {289#true} {289#true} #40#return; {289#true} is VALID [2018-11-14 18:27:02,244 INFO L273 TraceCheckUtils]: 1: Hoare triple {289#true} assume true; {289#true} is VALID [2018-11-14 18:27:02,244 INFO L256 TraceCheckUtils]: 0: Hoare triple {289#true} call ULTIMATE.init(); {289#true} is VALID [2018-11-14 18:27:02,246 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 18:27:02,250 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 18:27:02,250 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2018-11-14 18:27:02,251 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 15 [2018-11-14 18:27:02,251 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:27:02,251 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2018-11-14 18:27:02,308 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:27:02,308 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-14 18:27:02,309 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-14 18:27:02,309 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2018-11-14 18:27:02,310 INFO L87 Difference]: Start difference. First operand 17 states and 18 transitions. Second operand 10 states. [2018-11-14 18:27:02,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:27:02,744 INFO L93 Difference]: Finished difference Result 34 states and 41 transitions. [2018-11-14 18:27:02,744 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-14 18:27:02,744 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 15 [2018-11-14 18:27:02,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:27:02,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-14 18:27:02,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 41 transitions. [2018-11-14 18:27:02,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-14 18:27:02,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 41 transitions. [2018-11-14 18:27:02,753 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 41 transitions. [2018-11-14 18:27:02,834 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:27:02,835 INFO L225 Difference]: With dead ends: 34 [2018-11-14 18:27:02,835 INFO L226 Difference]: Without dead ends: 0 [2018-11-14 18:27:02,836 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2018-11-14 18:27:02,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-14 18:27:02,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-14 18:27:02,837 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:27:02,837 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2018-11-14 18:27:02,837 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2018-11-14 18:27:02,838 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2018-11-14 18:27:02,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:27:02,838 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2018-11-14 18:27:02,838 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-14 18:27:02,839 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:27:02,839 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:27:02,839 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2018-11-14 18:27:02,839 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2018-11-14 18:27:02,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:27:02,840 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2018-11-14 18:27:02,840 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-14 18:27:02,840 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:27:02,840 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:27:02,841 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:27:02,841 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:27:02,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-14 18:27:02,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-14 18:27:02,841 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 15 [2018-11-14 18:27:02,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:27:02,842 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-14 18:27:02,842 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-14 18:27:02,842 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-14 18:27:02,842 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:27:02,847 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-14 18:27:03,275 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2018-11-14 18:27:03,276 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-14 18:27:03,276 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-14 18:27:03,276 INFO L428 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-11-14 18:27:03,276 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-14 18:27:03,276 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-14 18:27:03,277 INFO L428 ceAbstractionStarter]: At program point mainENTRY(lines 9 21) the Hoare annotation is: true [2018-11-14 18:27:03,277 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 9 21) no Hoare annotation was computed. [2018-11-14 18:27:03,277 INFO L425 ceAbstractionStarter]: For program point L19(line 19) no Hoare annotation was computed. [2018-11-14 18:27:03,277 INFO L425 ceAbstractionStarter]: For program point L14(lines 14 15) no Hoare annotation was computed. [2018-11-14 18:27:03,277 INFO L425 ceAbstractionStarter]: For program point mainFINAL(lines 9 21) no Hoare annotation was computed. [2018-11-14 18:27:03,277 INFO L425 ceAbstractionStarter]: For program point L13-1(lines 13 18) no Hoare annotation was computed. [2018-11-14 18:27:03,277 INFO L425 ceAbstractionStarter]: For program point L14-2(lines 14 15) no Hoare annotation was computed. [2018-11-14 18:27:03,278 INFO L421 ceAbstractionStarter]: At program point L13-3(lines 13 18) the Hoare annotation is: (bvult main_~len~0 (_ bv5 32)) [2018-11-14 18:27:03,278 INFO L421 ceAbstractionStarter]: At program point L13-4(lines 13 18) the Hoare annotation is: (bvult main_~len~0 (_ bv5 32)) [2018-11-14 18:27:03,278 INFO L425 ceAbstractionStarter]: For program point L3-2(lines 2 7) no Hoare annotation was computed. [2018-11-14 18:27:03,278 INFO L428 ceAbstractionStarter]: At program point __VERIFIER_assertENTRY(lines 2 7) the Hoare annotation is: true [2018-11-14 18:27:03,278 INFO L425 ceAbstractionStarter]: For program point __VERIFIER_assertEXIT(lines 2 7) no Hoare annotation was computed. [2018-11-14 18:27:03,279 INFO L425 ceAbstractionStarter]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 4) no Hoare annotation was computed. [2018-11-14 18:27:03,279 INFO L425 ceAbstractionStarter]: For program point L4(line 4) no Hoare annotation was computed. [2018-11-14 18:27:03,279 INFO L425 ceAbstractionStarter]: For program point L3(lines 3 5) no Hoare annotation was computed. [2018-11-14 18:27:03,281 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2018-11-14 18:27:03,281 WARN L170 areAnnotationChecker]: L3 has no Hoare annotation [2018-11-14 18:27:03,282 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2018-11-14 18:27:03,282 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2018-11-14 18:27:03,282 WARN L170 areAnnotationChecker]: L13-1 has no Hoare annotation [2018-11-14 18:27:03,282 WARN L170 areAnnotationChecker]: L3 has no Hoare annotation [2018-11-14 18:27:03,282 WARN L170 areAnnotationChecker]: L3 has no Hoare annotation [2018-11-14 18:27:03,283 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2018-11-14 18:27:03,283 WARN L170 areAnnotationChecker]: L13-1 has no Hoare annotation [2018-11-14 18:27:03,283 WARN L170 areAnnotationChecker]: L13-1 has no Hoare annotation [2018-11-14 18:27:03,283 WARN L170 areAnnotationChecker]: L19 has no Hoare annotation [2018-11-14 18:27:03,283 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2018-11-14 18:27:03,283 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2018-11-14 18:27:03,283 WARN L170 areAnnotationChecker]: L3-2 has no Hoare annotation [2018-11-14 18:27:03,283 WARN L170 areAnnotationChecker]: L14 has no Hoare annotation [2018-11-14 18:27:03,284 WARN L170 areAnnotationChecker]: L14 has no Hoare annotation [2018-11-14 18:27:03,284 WARN L170 areAnnotationChecker]: L19 has no Hoare annotation [2018-11-14 18:27:03,284 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2018-11-14 18:27:03,284 WARN L170 areAnnotationChecker]: L14-2 has no Hoare annotation [2018-11-14 18:27:03,284 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2018-11-14 18:27:03,284 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2018-11-14 18:27:03,284 INFO L163 areAnnotationChecker]: CFG has 5 edges. 5 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2018-11-14 18:27:03,289 WARN L1239 BoogieBacktranslator]: Unfinished Backtranslation cannot identify Boogie2SMT function ~bvult32 [2018-11-14 18:27:03,290 WARN L1239 BoogieBacktranslator]: Unfinished Backtranslation cannot identify Boogie2SMT function ~bvult32 [2018-11-14 18:27:03,291 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.11 06:27:03 BoogieIcfgContainer [2018-11-14 18:27:03,291 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-14 18:27:03,292 INFO L168 Benchmark]: Toolchain (without parser) took 4464.96 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 747.1 MB). Free memory was 1.4 GB in the beginning and 2.0 GB in the end (delta: -608.4 MB). Peak memory consumption was 138.8 MB. Max. memory is 7.1 GB. [2018-11-14 18:27:03,294 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-14 18:27:03,294 INFO L168 Benchmark]: CACSL2BoogieTranslator took 320.17 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. [2018-11-14 18:27:03,295 INFO L168 Benchmark]: Boogie Preprocessor took 38.28 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-14 18:27:03,296 INFO L168 Benchmark]: RCFGBuilder took 561.83 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 747.1 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -794.5 MB). Peak memory consumption was 26.2 MB. Max. memory is 7.1 GB. [2018-11-14 18:27:03,296 INFO L168 Benchmark]: TraceAbstraction took 3540.60 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.0 GB in the end (delta: 175.5 MB). Peak memory consumption was 175.5 MB. Max. memory is 7.1 GB. [2018-11-14 18:27:03,300 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - GenericResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.24 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 320.17 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 38.28 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 561.83 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 747.1 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -794.5 MB). Peak memory consumption was 26.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 3540.60 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.0 GB in the end (delta: 175.5 MB). Peak memory consumption was 175.5 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation cannot identify Boogie2SMT function ~bvult32 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation cannot identify Boogie2SMT function ~bvult32 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 4]: 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: 13]: Loop Invariant [2018-11-14 18:27:03,312 WARN L1239 BoogieBacktranslator]: Unfinished Backtranslation cannot identify Boogie2SMT function ~bvult32 [2018-11-14 18:27:03,313 WARN L1239 BoogieBacktranslator]: Unfinished Backtranslation cannot identify Boogie2SMT function ~bvult32 Derived loop invariant: NULL - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 21 locations, 1 error locations. SAFE Result, 3.4s OverallTime, 3 OverallIterations, 2 TraceHistogramMax, 1.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.4s HoareAnnotationTime, HoareTripleCheckerStatistics: 45 SDtfs, 14 SDslu, 87 SDs, 0 SdLazy, 46 SolverSat, 11 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 51 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=21occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 3 MinimizatonAttempts, 1 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 13 PreInvPairs, 21 NumberOfFragments, 11 HoareAnnotationTreeSize, 13 FomulaSimplifications, 18 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 18 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 36 NumberOfCodeBlocks, 36 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 47 ConstructedInterpolants, 0 QuantifiedInterpolants, 1497 SizeOfPredicates, 4 NumberOfNonLiveVariables, 61 ConjunctsInSsa, 10 ConjunctsInUnsatCore, 4 InterpolantComputations, 2 PerfectInterpolantSequences, 0/4 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...