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.epf -i ../../../trunk/examples/svcomp/loop-lit/css2003_true-unreach-call_true-termination.c.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-18e5b2d-m [2018-11-18 22:29:18,234 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-18 22:29:18,237 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-18 22:29:18,249 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-18 22:29:18,249 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-18 22:29:18,250 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-18 22:29:18,252 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-18 22:29:18,254 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-18 22:29:18,255 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-18 22:29:18,256 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-18 22:29:18,257 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-18 22:29:18,257 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-18 22:29:18,258 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-18 22:29:18,259 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-18 22:29:18,261 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-18 22:29:18,261 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-18 22:29:18,262 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-18 22:29:18,264 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-18 22:29:18,266 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-18 22:29:18,268 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-18 22:29:18,269 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-18 22:29:18,270 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-18 22:29:18,272 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-18 22:29:18,273 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-18 22:29:18,273 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-18 22:29:18,274 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-18 22:29:18,275 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-18 22:29:18,276 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-18 22:29:18,277 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-18 22:29:18,278 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-18 22:29:18,278 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-18 22:29:18,279 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-18 22:29:18,279 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-18 22:29:18,279 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-18 22:29:18,280 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-18 22:29:18,281 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-18 22:29:18,281 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf [2018-11-18 22:29:18,297 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-18 22:29:18,297 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-18 22:29:18,298 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-18 22:29:18,298 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-18 22:29:18,300 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-18 22:29:18,300 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-18 22:29:18,300 INFO L133 SettingsManager]: * Use SBE=true [2018-11-18 22:29:18,301 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-18 22:29:18,301 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-18 22:29:18,301 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-18 22:29:18,301 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-18 22:29:18,301 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-18 22:29:18,301 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-18 22:29:18,303 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-18 22:29:18,303 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-18 22:29:18,303 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-18 22:29:18,303 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-18 22:29:18,303 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-18 22:29:18,305 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-18 22:29:18,305 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-18 22:29:18,305 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-18 22:29:18,305 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-18 22:29:18,306 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-18 22:29:18,306 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-18 22:29:18,306 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-18 22:29:18,306 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-18 22:29:18,306 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-18 22:29:18,307 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-18 22:29:18,307 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-11-18 22:29:18,308 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-18 22:29:18,308 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-18 22:29:18,308 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-18 22:29:18,308 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-18 22:29:18,373 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-18 22:29:18,391 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-18 22:29:18,396 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-18 22:29:18,397 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-18 22:29:18,398 INFO L276 PluginConnector]: CDTParser initialized [2018-11-18 22:29:18,399 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-lit/css2003_true-unreach-call_true-termination.c.i [2018-11-18 22:29:18,466 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6a6e6fec6/5db3aca7fc604284b2b4b4e4c1df7ec3/FLAG9abedf986 [2018-11-18 22:29:18,913 INFO L307 CDTParser]: Found 1 translation units. [2018-11-18 22:29:18,914 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-lit/css2003_true-unreach-call_true-termination.c.i [2018-11-18 22:29:18,921 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6a6e6fec6/5db3aca7fc604284b2b4b4e4c1df7ec3/FLAG9abedf986 [2018-11-18 22:29:19,272 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6a6e6fec6/5db3aca7fc604284b2b4b4e4c1df7ec3 [2018-11-18 22:29:19,285 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-18 22:29:19,286 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-11-18 22:29:19,287 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-18 22:29:19,287 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-18 22:29:19,293 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-18 22:29:19,295 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 10:29:19" (1/1) ... [2018-11-18 22:29:19,298 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@27f3c78e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:29:19, skipping insertion in model container [2018-11-18 22:29:19,298 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 10:29:19" (1/1) ... [2018-11-18 22:29:19,309 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-18 22:29:19,336 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-18 22:29:19,611 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 22:29:19,616 INFO L191 MainTranslator]: Completed pre-run [2018-11-18 22:29:19,638 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 22:29:19,656 INFO L195 MainTranslator]: Completed translation [2018-11-18 22:29:19,657 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:29:19 WrapperNode [2018-11-18 22:29:19,657 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-18 22:29:19,658 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-18 22:29:19,658 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-18 22:29:19,658 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-18 22:29:19,676 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:29:19" (1/1) ... [2018-11-18 22:29:19,676 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:29:19" (1/1) ... [2018-11-18 22:29:19,683 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:29:19" (1/1) ... [2018-11-18 22:29:19,684 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:29:19" (1/1) ... [2018-11-18 22:29:19,691 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:29:19" (1/1) ... [2018-11-18 22:29:19,697 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:29:19" (1/1) ... [2018-11-18 22:29:19,700 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:29:19" (1/1) ... [2018-11-18 22:29:19,708 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-18 22:29:19,708 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-18 22:29:19,709 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-18 22:29:19,709 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-18 22:29:19,710 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:29:19" (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-18 22:29:19,892 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-18 22:29:19,892 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-18 22:29:19,893 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-18 22:29:19,893 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-18 22:29:19,893 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-18 22:29:19,893 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2018-11-18 22:29:19,893 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-18 22:29:19,897 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-11-18 22:29:19,897 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-18 22:29:19,897 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-18 22:29:19,897 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-18 22:29:20,341 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-18 22:29:20,342 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 10:29:20 BoogieIcfgContainer [2018-11-18 22:29:20,342 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-18 22:29:20,343 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-18 22:29:20,343 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-18 22:29:20,346 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-18 22:29:20,347 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 10:29:19" (1/3) ... [2018-11-18 22:29:20,347 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@208dce32 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 10:29:20, skipping insertion in model container [2018-11-18 22:29:20,348 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:29:19" (2/3) ... [2018-11-18 22:29:20,348 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@208dce32 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 10:29:20, skipping insertion in model container [2018-11-18 22:29:20,348 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 10:29:20" (3/3) ... [2018-11-18 22:29:20,350 INFO L112 eAbstractionObserver]: Analyzing ICFG css2003_true-unreach-call_true-termination.c.i [2018-11-18 22:29:20,360 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-18 22:29:20,369 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-18 22:29:20,387 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-18 22:29:20,419 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-18 22:29:20,420 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-18 22:29:20,420 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-18 22:29:20,420 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-18 22:29:20,420 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-18 22:29:20,420 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-18 22:29:20,421 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-18 22:29:20,421 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-18 22:29:20,421 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-18 22:29:20,440 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states. [2018-11-18 22:29:20,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-11-18 22:29:20,446 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:29:20,447 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:29:20,450 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:29:20,456 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:29:20,456 INFO L82 PathProgramCache]: Analyzing trace with hash -1333459013, now seen corresponding path program 1 times [2018-11-18 22:29:20,461 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 22:29:20,462 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-18 22:29:20,488 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 22:29:20,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:29:20,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:29:20,558 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:29:21,243 INFO L256 TraceCheckUtils]: 0: Hoare triple {23#true} call ULTIMATE.init(); {23#true} is VALID [2018-11-18 22:29:21,247 INFO L273 TraceCheckUtils]: 1: Hoare triple {23#true} assume true; {23#true} is VALID [2018-11-18 22:29:21,247 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {23#true} {23#true} #37#return; {23#true} is VALID [2018-11-18 22:29:21,248 INFO L256 TraceCheckUtils]: 3: Hoare triple {23#true} call #t~ret2 := main(); {23#true} is VALID [2018-11-18 22:29:21,260 INFO L273 TraceCheckUtils]: 4: Hoare triple {23#true} havoc ~i~0;havoc ~j~0;havoc ~k~0;~i~0 := 1bv32;~j~0 := 1bv32;~k~0 := #t~nondet1;havoc #t~nondet1; {40#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-18 22:29:21,265 INFO L273 TraceCheckUtils]: 5: Hoare triple {40#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} assume !!(~bvsle32(0bv32, ~k~0) && ~bvsle32(~k~0, 1bv32)); {44#(and (bvsle (_ bv0 32) main_~k~0) (bvsle main_~k~0 (_ bv1 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-18 22:29:21,266 INFO L273 TraceCheckUtils]: 6: Hoare triple {44#(and (bvsle (_ bv0 32) main_~k~0) (bvsle main_~k~0 (_ bv1 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} assume true; {44#(and (bvsle (_ bv0 32) main_~k~0) (bvsle main_~k~0 (_ bv1 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-18 22:29:21,269 INFO L273 TraceCheckUtils]: 7: Hoare triple {44#(and (bvsle (_ bv0 32) main_~k~0) (bvsle main_~k~0 (_ bv1 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} assume !!~bvslt32(~i~0, 1000000bv32);~i~0 := ~bvadd32(1bv32, ~i~0);~j~0 := ~bvadd32(~j~0, ~k~0);~k~0 := ~bvsub32(~k~0, 1bv32); {51#(and (bvsle (bvadd main_~k~0 (_ bv1 32)) (_ bv1 32)) (= (bvadd main_~i~0 (_ bv4294967294 32)) (_ bv0 32)) (bvsle (_ bv0 32) (bvadd main_~k~0 (_ bv1 32))))} is VALID [2018-11-18 22:29:21,280 INFO L256 TraceCheckUtils]: 8: Hoare triple {51#(and (bvsle (bvadd main_~k~0 (_ bv1 32)) (_ bv1 32)) (= (bvadd main_~i~0 (_ bv4294967294 32)) (_ bv0 32)) (bvsle (_ bv0 32) (bvadd main_~k~0 (_ bv1 32))))} call __VERIFIER_assert((if (~bvsle32(1bv32, ~bvadd32(~i~0, ~k~0)) && ~bvsle32(~bvadd32(~i~0, ~k~0), 2bv32)) && ~bvsge32(~i~0, 1bv32) then 1bv32 else 0bv32)); {55#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-18 22:29:21,281 INFO L273 TraceCheckUtils]: 9: Hoare triple {55#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} ~cond := #in~cond; {59#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-18 22:29:21,283 INFO L273 TraceCheckUtils]: 10: Hoare triple {59#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == ~cond; {24#false} is VALID [2018-11-18 22:29:21,283 INFO L273 TraceCheckUtils]: 11: Hoare triple {24#false} assume !false; {24#false} is VALID [2018-11-18 22:29:21,288 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-18 22:29:21,288 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 22:29:21,292 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 22:29:21,292 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-18 22:29:21,297 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 12 [2018-11-18 22:29:21,300 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:29:21,303 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2018-11-18 22:29:21,362 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:29:21,362 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-18 22:29:21,370 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-18 22:29:21,371 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-11-18 22:29:21,373 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 7 states. [2018-11-18 22:29:22,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:29:22,244 INFO L93 Difference]: Finished difference Result 45 states and 57 transitions. [2018-11-18 22:29:22,244 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-18 22:29:22,244 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 12 [2018-11-18 22:29:22,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:29:22,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-18 22:29:22,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 57 transitions. [2018-11-18 22:29:22,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-18 22:29:22,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 57 transitions. [2018-11-18 22:29:22,264 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 57 transitions. [2018-11-18 22:29:22,697 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:29:22,714 INFO L225 Difference]: With dead ends: 45 [2018-11-18 22:29:22,715 INFO L226 Difference]: Without dead ends: 24 [2018-11-18 22:29:22,721 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-11-18 22:29:22,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2018-11-18 22:29:22,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 22. [2018-11-18 22:29:22,836 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:29:22,837 INFO L82 GeneralOperation]: Start isEquivalent. First operand 24 states. Second operand 22 states. [2018-11-18 22:29:22,838 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand 22 states. [2018-11-18 22:29:22,838 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 22 states. [2018-11-18 22:29:22,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:29:22,842 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2018-11-18 22:29:22,842 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2018-11-18 22:29:22,843 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:29:22,843 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:29:22,843 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand 24 states. [2018-11-18 22:29:22,844 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 24 states. [2018-11-18 22:29:22,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:29:22,848 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2018-11-18 22:29:22,849 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2018-11-18 22:29:22,849 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:29:22,849 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:29:22,850 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:29:22,850 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:29:22,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-18 22:29:22,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 22 transitions. [2018-11-18 22:29:22,854 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 22 transitions. Word has length 12 [2018-11-18 22:29:22,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:29:22,855 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 22 transitions. [2018-11-18 22:29:22,855 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-18 22:29:22,855 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2018-11-18 22:29:22,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-18 22:29:22,856 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:29:22,857 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:29:22,857 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:29:22,857 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:29:22,858 INFO L82 PathProgramCache]: Analyzing trace with hash 615958375, now seen corresponding path program 1 times [2018-11-18 22:29:22,858 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 22:29:22,858 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-18 22:29:22,886 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 22:29:22,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:29:22,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:29:22,941 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:29:23,366 INFO L256 TraceCheckUtils]: 0: Hoare triple {206#true} call ULTIMATE.init(); {206#true} is VALID [2018-11-18 22:29:23,367 INFO L273 TraceCheckUtils]: 1: Hoare triple {206#true} assume true; {206#true} is VALID [2018-11-18 22:29:23,367 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {206#true} {206#true} #37#return; {206#true} is VALID [2018-11-18 22:29:23,367 INFO L256 TraceCheckUtils]: 3: Hoare triple {206#true} call #t~ret2 := main(); {206#true} is VALID [2018-11-18 22:29:23,385 INFO L273 TraceCheckUtils]: 4: Hoare triple {206#true} havoc ~i~0;havoc ~j~0;havoc ~k~0;~i~0 := 1bv32;~j~0 := 1bv32;~k~0 := #t~nondet1;havoc #t~nondet1; {223#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-18 22:29:23,400 INFO L273 TraceCheckUtils]: 5: Hoare triple {223#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} assume !!(~bvsle32(0bv32, ~k~0) && ~bvsle32(~k~0, 1bv32)); {227#(and (bvsle (_ bv0 32) main_~k~0) (bvsle main_~k~0 (_ bv1 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-18 22:29:23,414 INFO L273 TraceCheckUtils]: 6: Hoare triple {227#(and (bvsle (_ bv0 32) main_~k~0) (bvsle main_~k~0 (_ bv1 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} assume true; {227#(and (bvsle (_ bv0 32) main_~k~0) (bvsle main_~k~0 (_ bv1 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-18 22:29:23,427 INFO L273 TraceCheckUtils]: 7: Hoare triple {227#(and (bvsle (_ bv0 32) main_~k~0) (bvsle main_~k~0 (_ bv1 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} assume !!~bvslt32(~i~0, 1000000bv32);~i~0 := ~bvadd32(1bv32, ~i~0);~j~0 := ~bvadd32(~j~0, ~k~0);~k~0 := ~bvsub32(~k~0, 1bv32); {234#(and (bvsle (bvadd main_~k~0 (_ bv1 32)) (_ bv1 32)) (bvsle (_ bv0 32) (bvadd main_~k~0 (_ bv1 32))) (= (_ bv2 32) main_~i~0))} is VALID [2018-11-18 22:29:23,427 INFO L256 TraceCheckUtils]: 8: Hoare triple {234#(and (bvsle (bvadd main_~k~0 (_ bv1 32)) (_ bv1 32)) (bvsle (_ bv0 32) (bvadd main_~k~0 (_ bv1 32))) (= (_ bv2 32) main_~i~0))} call __VERIFIER_assert((if (~bvsle32(1bv32, ~bvadd32(~i~0, ~k~0)) && ~bvsle32(~bvadd32(~i~0, ~k~0), 2bv32)) && ~bvsge32(~i~0, 1bv32) then 1bv32 else 0bv32)); {206#true} is VALID [2018-11-18 22:29:23,428 INFO L273 TraceCheckUtils]: 9: Hoare triple {206#true} ~cond := #in~cond; {241#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2018-11-18 22:29:23,432 INFO L273 TraceCheckUtils]: 10: Hoare triple {241#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0bv32 == ~cond); {245#(not (= |__VERIFIER_assert_#in~cond| (_ bv0 32)))} is VALID [2018-11-18 22:29:23,432 INFO L273 TraceCheckUtils]: 11: Hoare triple {245#(not (= |__VERIFIER_assert_#in~cond| (_ bv0 32)))} assume true; {245#(not (= |__VERIFIER_assert_#in~cond| (_ bv0 32)))} is VALID [2018-11-18 22:29:23,433 INFO L268 TraceCheckUtils]: 12: Hoare quadruple {245#(not (= |__VERIFIER_assert_#in~cond| (_ bv0 32)))} {234#(and (bvsle (bvadd main_~k~0 (_ bv1 32)) (_ bv1 32)) (bvsle (_ bv0 32) (bvadd main_~k~0 (_ bv1 32))) (= (_ bv2 32) main_~i~0))} #41#return; {234#(and (bvsle (bvadd main_~k~0 (_ bv1 32)) (_ bv1 32)) (bvsle (_ bv0 32) (bvadd main_~k~0 (_ bv1 32))) (= (_ bv2 32) main_~i~0))} is VALID [2018-11-18 22:29:23,437 INFO L273 TraceCheckUtils]: 13: Hoare triple {234#(and (bvsle (bvadd main_~k~0 (_ bv1 32)) (_ bv1 32)) (bvsle (_ bv0 32) (bvadd main_~k~0 (_ bv1 32))) (= (_ bv2 32) main_~i~0))} assume true; {234#(and (bvsle (bvadd main_~k~0 (_ bv1 32)) (_ bv1 32)) (bvsle (_ bv0 32) (bvadd main_~k~0 (_ bv1 32))) (= (_ bv2 32) main_~i~0))} is VALID [2018-11-18 22:29:23,441 INFO L273 TraceCheckUtils]: 14: Hoare triple {234#(and (bvsle (bvadd main_~k~0 (_ bv1 32)) (_ bv1 32)) (bvsle (_ bv0 32) (bvadd main_~k~0 (_ bv1 32))) (= (_ bv2 32) main_~i~0))} assume !!~bvslt32(~i~0, 1000000bv32);~i~0 := ~bvadd32(1bv32, ~i~0);~j~0 := ~bvadd32(~j~0, ~k~0);~k~0 := ~bvsub32(~k~0, 1bv32); {258#(and (bvsle (bvadd main_~k~0 (_ bv2 32)) (_ bv1 32)) (= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32)) (bvsle (_ bv0 32) (bvadd main_~k~0 (_ bv2 32))))} is VALID [2018-11-18 22:29:23,443 INFO L256 TraceCheckUtils]: 15: Hoare triple {258#(and (bvsle (bvadd main_~k~0 (_ bv2 32)) (_ bv1 32)) (= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32)) (bvsle (_ bv0 32) (bvadd main_~k~0 (_ bv2 32))))} call __VERIFIER_assert((if (~bvsle32(1bv32, ~bvadd32(~i~0, ~k~0)) && ~bvsle32(~bvadd32(~i~0, ~k~0), 2bv32)) && ~bvsge32(~i~0, 1bv32) then 1bv32 else 0bv32)); {262#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-18 22:29:23,444 INFO L273 TraceCheckUtils]: 16: Hoare triple {262#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} ~cond := #in~cond; {266#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-18 22:29:23,445 INFO L273 TraceCheckUtils]: 17: Hoare triple {266#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == ~cond; {207#false} is VALID [2018-11-18 22:29:23,446 INFO L273 TraceCheckUtils]: 18: Hoare triple {207#false} assume !false; {207#false} is VALID [2018-11-18 22:29:23,449 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 22:29:23,449 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 22:29:25,121 INFO L273 TraceCheckUtils]: 18: Hoare triple {207#false} assume !false; {207#false} is VALID [2018-11-18 22:29:25,122 INFO L273 TraceCheckUtils]: 17: Hoare triple {276#(not (= (_ bv0 32) __VERIFIER_assert_~cond))} assume 0bv32 == ~cond; {207#false} is VALID [2018-11-18 22:29:25,123 INFO L273 TraceCheckUtils]: 16: Hoare triple {245#(not (= |__VERIFIER_assert_#in~cond| (_ bv0 32)))} ~cond := #in~cond; {276#(not (= (_ bv0 32) __VERIFIER_assert_~cond))} is VALID [2018-11-18 22:29:25,124 INFO L256 TraceCheckUtils]: 15: Hoare triple {283#(and (bvsle (_ bv1 32) (bvadd main_~i~0 main_~k~0)) (bvsge main_~i~0 (_ bv1 32)) (bvsle (bvadd main_~i~0 main_~k~0) (_ bv2 32)))} call __VERIFIER_assert((if (~bvsle32(1bv32, ~bvadd32(~i~0, ~k~0)) && ~bvsle32(~bvadd32(~i~0, ~k~0), 2bv32)) && ~bvsge32(~i~0, 1bv32) then 1bv32 else 0bv32)); {245#(not (= |__VERIFIER_assert_#in~cond| (_ bv0 32)))} is VALID [2018-11-18 22:29:25,173 INFO L273 TraceCheckUtils]: 14: Hoare triple {287#(and (bvsge (bvadd main_~i~0 (_ bv1 32)) (_ bv1 32)) (bvsle (_ bv1 32) (bvadd main_~i~0 main_~k~0)) (bvsle (bvadd main_~i~0 main_~k~0) (_ bv2 32)))} assume !!~bvslt32(~i~0, 1000000bv32);~i~0 := ~bvadd32(1bv32, ~i~0);~j~0 := ~bvadd32(~j~0, ~k~0);~k~0 := ~bvsub32(~k~0, 1bv32); {283#(and (bvsle (_ bv1 32) (bvadd main_~i~0 main_~k~0)) (bvsge main_~i~0 (_ bv1 32)) (bvsle (bvadd main_~i~0 main_~k~0) (_ bv2 32)))} is VALID [2018-11-18 22:29:25,174 INFO L273 TraceCheckUtils]: 13: Hoare triple {287#(and (bvsge (bvadd main_~i~0 (_ bv1 32)) (_ bv1 32)) (bvsle (_ bv1 32) (bvadd main_~i~0 main_~k~0)) (bvsle (bvadd main_~i~0 main_~k~0) (_ bv2 32)))} assume true; {287#(and (bvsge (bvadd main_~i~0 (_ bv1 32)) (_ bv1 32)) (bvsle (_ bv1 32) (bvadd main_~i~0 main_~k~0)) (bvsle (bvadd main_~i~0 main_~k~0) (_ bv2 32)))} is VALID [2018-11-18 22:29:25,179 INFO L268 TraceCheckUtils]: 12: Hoare quadruple {245#(not (= |__VERIFIER_assert_#in~cond| (_ bv0 32)))} {294#(or (not (bvsge main_~i~0 (_ bv1 32))) (not (bvsle (bvadd main_~i~0 main_~k~0) (_ bv2 32))) (bvsge (bvadd main_~i~0 (_ bv1 32)) (_ bv1 32)) (not (bvsle (_ bv1 32) (bvadd main_~i~0 main_~k~0))))} #41#return; {287#(and (bvsge (bvadd main_~i~0 (_ bv1 32)) (_ bv1 32)) (bvsle (_ bv1 32) (bvadd main_~i~0 main_~k~0)) (bvsle (bvadd main_~i~0 main_~k~0) (_ bv2 32)))} is VALID [2018-11-18 22:29:25,180 INFO L273 TraceCheckUtils]: 11: Hoare triple {245#(not (= |__VERIFIER_assert_#in~cond| (_ bv0 32)))} assume true; {245#(not (= |__VERIFIER_assert_#in~cond| (_ bv0 32)))} is VALID [2018-11-18 22:29:25,181 INFO L273 TraceCheckUtils]: 10: Hoare triple {304#(or (= (_ bv0 32) __VERIFIER_assert_~cond) (not (= |__VERIFIER_assert_#in~cond| (_ bv0 32))))} assume !(0bv32 == ~cond); {245#(not (= |__VERIFIER_assert_#in~cond| (_ bv0 32)))} is VALID [2018-11-18 22:29:25,181 INFO L273 TraceCheckUtils]: 9: Hoare triple {206#true} ~cond := #in~cond; {304#(or (= (_ bv0 32) __VERIFIER_assert_~cond) (not (= |__VERIFIER_assert_#in~cond| (_ bv0 32))))} is VALID [2018-11-18 22:29:25,182 INFO L256 TraceCheckUtils]: 8: Hoare triple {294#(or (not (bvsge main_~i~0 (_ bv1 32))) (not (bvsle (bvadd main_~i~0 main_~k~0) (_ bv2 32))) (bvsge (bvadd main_~i~0 (_ bv1 32)) (_ bv1 32)) (not (bvsle (_ bv1 32) (bvadd main_~i~0 main_~k~0))))} call __VERIFIER_assert((if (~bvsle32(1bv32, ~bvadd32(~i~0, ~k~0)) && ~bvsle32(~bvadd32(~i~0, ~k~0), 2bv32)) && ~bvsge32(~i~0, 1bv32) then 1bv32 else 0bv32)); {206#true} is VALID [2018-11-18 22:29:25,189 INFO L273 TraceCheckUtils]: 7: Hoare triple {311#(or (not (bvsle (bvadd main_~i~0 main_~k~0) (_ bv2 32))) (not (bvsge (bvadd main_~i~0 (_ bv1 32)) (_ bv1 32))) (not (bvsle (_ bv1 32) (bvadd main_~i~0 main_~k~0))) (bvsge (bvadd main_~i~0 (_ bv2 32)) (_ bv1 32)))} assume !!~bvslt32(~i~0, 1000000bv32);~i~0 := ~bvadd32(1bv32, ~i~0);~j~0 := ~bvadd32(~j~0, ~k~0);~k~0 := ~bvsub32(~k~0, 1bv32); {294#(or (not (bvsge main_~i~0 (_ bv1 32))) (not (bvsle (bvadd main_~i~0 main_~k~0) (_ bv2 32))) (bvsge (bvadd main_~i~0 (_ bv1 32)) (_ bv1 32)) (not (bvsle (_ bv1 32) (bvadd main_~i~0 main_~k~0))))} is VALID [2018-11-18 22:29:25,190 INFO L273 TraceCheckUtils]: 6: Hoare triple {311#(or (not (bvsle (bvadd main_~i~0 main_~k~0) (_ bv2 32))) (not (bvsge (bvadd main_~i~0 (_ bv1 32)) (_ bv1 32))) (not (bvsle (_ bv1 32) (bvadd main_~i~0 main_~k~0))) (bvsge (bvadd main_~i~0 (_ bv2 32)) (_ bv1 32)))} assume true; {311#(or (not (bvsle (bvadd main_~i~0 main_~k~0) (_ bv2 32))) (not (bvsge (bvadd main_~i~0 (_ bv1 32)) (_ bv1 32))) (not (bvsle (_ bv1 32) (bvadd main_~i~0 main_~k~0))) (bvsge (bvadd main_~i~0 (_ bv2 32)) (_ bv1 32)))} is VALID [2018-11-18 22:29:25,205 INFO L273 TraceCheckUtils]: 5: Hoare triple {206#true} assume !!(~bvsle32(0bv32, ~k~0) && ~bvsle32(~k~0, 1bv32)); {311#(or (not (bvsle (bvadd main_~i~0 main_~k~0) (_ bv2 32))) (not (bvsge (bvadd main_~i~0 (_ bv1 32)) (_ bv1 32))) (not (bvsle (_ bv1 32) (bvadd main_~i~0 main_~k~0))) (bvsge (bvadd main_~i~0 (_ bv2 32)) (_ bv1 32)))} is VALID [2018-11-18 22:29:25,206 INFO L273 TraceCheckUtils]: 4: Hoare triple {206#true} havoc ~i~0;havoc ~j~0;havoc ~k~0;~i~0 := 1bv32;~j~0 := 1bv32;~k~0 := #t~nondet1;havoc #t~nondet1; {206#true} is VALID [2018-11-18 22:29:25,206 INFO L256 TraceCheckUtils]: 3: Hoare triple {206#true} call #t~ret2 := main(); {206#true} is VALID [2018-11-18 22:29:25,206 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {206#true} {206#true} #37#return; {206#true} is VALID [2018-11-18 22:29:25,206 INFO L273 TraceCheckUtils]: 1: Hoare triple {206#true} assume true; {206#true} is VALID [2018-11-18 22:29:25,207 INFO L256 TraceCheckUtils]: 0: Hoare triple {206#true} call ULTIMATE.init(); {206#true} is VALID [2018-11-18 22:29:25,208 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 22:29:25,210 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 22:29:25,210 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 16 [2018-11-18 22:29:25,212 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 19 [2018-11-18 22:29:25,214 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:29:25,214 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states. [2018-11-18 22:29:25,351 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:29:25,351 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-11-18 22:29:25,351 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-11-18 22:29:25,352 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=190, Unknown=0, NotChecked=0, Total=240 [2018-11-18 22:29:25,352 INFO L87 Difference]: Start difference. First operand 22 states and 22 transitions. Second operand 16 states. [2018-11-18 22:29:26,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:29:26,671 INFO L93 Difference]: Finished difference Result 27 states and 28 transitions. [2018-11-18 22:29:26,671 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-18 22:29:26,672 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 19 [2018-11-18 22:29:26,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:29:26,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-18 22:29:26,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 25 transitions. [2018-11-18 22:29:26,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-18 22:29:26,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 25 transitions. [2018-11-18 22:29:26,679 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 25 transitions. [2018-11-18 22:29:27,039 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-18 22:29:27,040 INFO L225 Difference]: With dead ends: 27 [2018-11-18 22:29:27,040 INFO L226 Difference]: Without dead ends: 0 [2018-11-18 22:29:27,042 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 21 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=67, Invalid=239, Unknown=0, NotChecked=0, Total=306 [2018-11-18 22:29:27,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-18 22:29:27,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-18 22:29:27,043 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:29:27,043 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2018-11-18 22:29:27,043 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2018-11-18 22:29:27,043 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2018-11-18 22:29:27,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:29:27,044 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2018-11-18 22:29:27,044 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-18 22:29:27,044 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:29:27,044 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:29:27,044 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2018-11-18 22:29:27,044 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2018-11-18 22:29:27,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:29:27,045 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2018-11-18 22:29:27,045 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-18 22:29:27,045 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:29:27,045 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:29:27,046 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:29:27,046 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:29:27,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-18 22:29:27,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-18 22:29:27,046 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 19 [2018-11-18 22:29:27,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:29:27,047 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-18 22:29:27,047 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-11-18 22:29:27,047 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-18 22:29:27,047 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:29:27,051 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-18 22:29:27,335 WARN L180 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 11 [2018-11-18 22:29:27,448 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2018-11-18 22:29:27,448 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-18 22:29:27,448 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-18 22:29:27,449 INFO L428 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-11-18 22:29:27,449 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-18 22:29:27,449 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-18 22:29:27,449 INFO L428 ceAbstractionStarter]: At program point mainENTRY(lines 10 23) the Hoare annotation is: true [2018-11-18 22:29:27,449 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 10 23) no Hoare annotation was computed. [2018-11-18 22:29:27,449 INFO L421 ceAbstractionStarter]: At program point L20(line 20) the Hoare annotation is: (let ((.cse0 (bvadd main_~i~0 main_~k~0))) (and (bvsle (_ bv1 32) .cse0) (bvsge (bvadd main_~i~0 (_ bv2 32)) (_ bv1 32)) (bvsge main_~i~0 (_ bv1 32)) (bvsle .cse0 (_ bv2 32)))) [2018-11-18 22:29:27,450 INFO L421 ceAbstractionStarter]: At program point L20-1(lines 16 21) the Hoare annotation is: (let ((.cse0 (bvadd main_~i~0 main_~k~0))) (and (bvsle (_ bv1 32) .cse0) (bvsge (bvadd main_~i~0 (_ bv2 32)) (_ bv1 32)) (bvsge main_~i~0 (_ bv1 32)) (bvsle .cse0 (_ bv2 32)))) [2018-11-18 22:29:27,450 INFO L425 ceAbstractionStarter]: For program point L15(line 15) no Hoare annotation was computed. [2018-11-18 22:29:27,450 INFO L425 ceAbstractionStarter]: For program point L16-1(lines 16 21) no Hoare annotation was computed. [2018-11-18 22:29:27,450 INFO L425 ceAbstractionStarter]: For program point L16-3(lines 16 21) no Hoare annotation was computed. [2018-11-18 22:29:27,450 INFO L425 ceAbstractionStarter]: For program point mainFINAL(lines 10 23) no Hoare annotation was computed. [2018-11-18 22:29:27,450 INFO L425 ceAbstractionStarter]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2018-11-18 22:29:27,451 INFO L428 ceAbstractionStarter]: At program point __VERIFIER_assertENTRY(lines 3 8) the Hoare annotation is: true [2018-11-18 22:29:27,451 INFO L425 ceAbstractionStarter]: For program point __VERIFIER_assertEXIT(lines 3 8) no Hoare annotation was computed. [2018-11-18 22:29:27,451 INFO L425 ceAbstractionStarter]: For program point L5(line 5) no Hoare annotation was computed. [2018-11-18 22:29:27,451 INFO L425 ceAbstractionStarter]: For program point L4(lines 4 6) no Hoare annotation was computed. [2018-11-18 22:29:27,451 INFO L425 ceAbstractionStarter]: For program point L4-2(lines 3 8) no Hoare annotation was computed. [2018-11-18 22:29:27,453 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2018-11-18 22:29:27,453 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2018-11-18 22:29:27,453 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2018-11-18 22:29:27,454 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2018-11-18 22:29:27,454 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2018-11-18 22:29:27,454 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2018-11-18 22:29:27,454 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2018-11-18 22:29:27,454 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2018-11-18 22:29:27,454 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2018-11-18 22:29:27,454 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2018-11-18 22:29:27,454 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2018-11-18 22:29:27,455 WARN L170 areAnnotationChecker]: L16-1 has no Hoare annotation [2018-11-18 22:29:27,455 WARN L170 areAnnotationChecker]: L16-3 has no Hoare annotation [2018-11-18 22:29:27,455 WARN L170 areAnnotationChecker]: L5 has no Hoare annotation [2018-11-18 22:29:27,455 WARN L170 areAnnotationChecker]: L5 has no Hoare annotation [2018-11-18 22:29:27,455 WARN L170 areAnnotationChecker]: L4-2 has no Hoare annotation [2018-11-18 22:29:27,455 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2018-11-18 22:29:27,455 WARN L170 areAnnotationChecker]: L16-1 has no Hoare annotation [2018-11-18 22:29:27,456 WARN L170 areAnnotationChecker]: L16-1 has no Hoare annotation [2018-11-18 22:29:27,456 WARN L170 areAnnotationChecker]: L16-3 has no Hoare annotation [2018-11-18 22:29:27,456 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2018-11-18 22:29:27,456 INFO L163 areAnnotationChecker]: CFG has 3 edges. 3 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2018-11-18 22:29:27,465 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.11 10:29:27 BoogieIcfgContainer [2018-11-18 22:29:27,465 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-18 22:29:27,467 INFO L168 Benchmark]: Toolchain (without parser) took 8181.39 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 728.2 MB). Free memory was 1.4 GB in the beginning and 1.9 GB in the end (delta: -479.5 MB). Peak memory consumption was 248.7 MB. Max. memory is 7.1 GB. [2018-11-18 22:29:27,468 INFO L168 Benchmark]: CDTParser took 0.22 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-18 22:29:27,469 INFO L168 Benchmark]: CACSL2BoogieTranslator took 370.44 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-18 22:29:27,469 INFO L168 Benchmark]: Boogie Preprocessor took 49.99 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-18 22:29:27,470 INFO L168 Benchmark]: RCFGBuilder took 633.65 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 728.2 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -775.9 MB). Peak memory consumption was 26.2 MB. Max. memory is 7.1 GB. [2018-11-18 22:29:27,471 INFO L168 Benchmark]: TraceAbstraction took 7122.32 ms. Allocated memory is still 2.2 GB. Free memory was 2.2 GB in the beginning and 1.9 GB in the end (delta: 285.9 MB). Peak memory consumption was 285.9 MB. Max. memory is 7.1 GB. [2018-11-18 22:29:27,475 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.22 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. * CACSL2BoogieTranslator took 370.44 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 49.99 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 633.65 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 728.2 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -775.9 MB). Peak memory consumption was 26.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 7122.32 ms. Allocated memory is still 2.2 GB. Free memory was 2.2 GB in the beginning and 1.9 GB in the end (delta: 285.9 MB). Peak memory consumption was 285.9 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 5]: 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: 16]: Loop Invariant Derived loop invariant: ((~bvsle32(1bv32, ~bvadd64(i, k)) && ~bvsge32(~bvadd64(i, 2bv32), 1bv32)) && ~bvsge32(i, 1bv32)) && ~bvsle32(~bvadd64(i, k), 2bv32) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 20 locations, 1 error locations. SAFE Result, 7.0s OverallTime, 2 OverallIterations, 2 TraceHistogramMax, 3.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.3s HoareAnnotationTime, HoareTripleCheckerStatistics: 31 SDtfs, 27 SDslu, 149 SDs, 0 SdLazy, 102 SolverSat, 23 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 51 GetRequests, 27 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 1.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=22occurred in iteration=1, 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, 2 MinimizatonAttempts, 2 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 10 PreInvPairs, 17 NumberOfFragments, 43 HoareAnnotationTreeSize, 10 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 79 FormulaSimplificationTreeSizeReductionInter, 0.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 3.0s InterpolantComputationTime, 31 NumberOfCodeBlocks, 31 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 47 ConstructedInterpolants, 0 QuantifiedInterpolants, 5358 SizeOfPredicates, 6 NumberOfNonLiveVariables, 64 ConjunctsInSsa, 21 ConjunctsInUnsatCore, 3 InterpolantComputations, 1 PerfectInterpolantSequences, 2/10 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...