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/AutomizerCInline_WitnessPrinter.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf -i ../../../trunk/examples/svcomp/loop-new/count_by_1_true-unreach-call_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-61f4311 [2018-11-23 11:41:47,237 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 11:41:47,239 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 11:41:47,251 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 11:41:47,251 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 11:41:47,252 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 11:41:47,254 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 11:41:47,256 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 11:41:47,257 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 11:41:47,258 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 11:41:47,259 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 11:41:47,259 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 11:41:47,260 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 11:41:47,261 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 11:41:47,265 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 11:41:47,265 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 11:41:47,266 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 11:41:47,268 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 11:41:47,270 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 11:41:47,272 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 11:41:47,273 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 11:41:47,274 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 11:41:47,277 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 11:41:47,277 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 11:41:47,277 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 11:41:47,278 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 11:41:47,279 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 11:41:47,280 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 11:41:47,281 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 11:41:47,282 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 11:41:47,282 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 11:41:47,283 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 11:41:47,283 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 11:41:47,284 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 11:41:47,285 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 11:41:47,285 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 11:41:47,286 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-23 11:41:47,301 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 11:41:47,301 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 11:41:47,302 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 11:41:47,302 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 11:41:47,303 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 11:41:47,303 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 11:41:47,303 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 11:41:47,304 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 11:41:47,304 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 11:41:47,304 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 11:41:47,304 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 11:41:47,304 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 11:41:47,305 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 11:41:47,305 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 11:41:47,305 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-23 11:41:47,305 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-23 11:41:47,305 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 11:41:47,306 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 11:41:47,306 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 11:41:47,306 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 11:41:47,306 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 11:41:47,306 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 11:41:47,307 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 11:41:47,307 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 11:41:47,307 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 11:41:47,307 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 11:41:47,307 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 11:41:47,308 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 11:41:47,308 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-11-23 11:41:47,308 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 11:41:47,308 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-23 11:41:47,308 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-23 11:41:47,308 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 11:41:47,351 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 11:41:47,366 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 11:41:47,370 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 11:41:47,372 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 11:41:47,372 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 11:41:47,373 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-new/count_by_1_true-unreach-call_true-termination.i [2018-11-23 11:41:47,432 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9c750ff0d/26a799414c654f8fa420fe8388e60cd9/FLAG1dbc5b50f [2018-11-23 11:41:47,919 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 11:41:47,920 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-new/count_by_1_true-unreach-call_true-termination.i [2018-11-23 11:41:47,927 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9c750ff0d/26a799414c654f8fa420fe8388e60cd9/FLAG1dbc5b50f [2018-11-23 11:41:48,264 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9c750ff0d/26a799414c654f8fa420fe8388e60cd9 [2018-11-23 11:41:48,274 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 11:41:48,275 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 11:41:48,276 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 11:41:48,279 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 11:41:48,283 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 11:41:48,284 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:41:48" (1/1) ... [2018-11-23 11:41:48,287 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@48968727 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:41:48, skipping insertion in model container [2018-11-23 11:41:48,287 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:41:48" (1/1) ... [2018-11-23 11:41:48,298 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 11:41:48,315 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 11:41:48,524 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 11:41:48,531 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 11:41:48,552 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 11:41:48,572 INFO L195 MainTranslator]: Completed translation [2018-11-23 11:41:48,572 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:41:48 WrapperNode [2018-11-23 11:41:48,573 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 11:41:48,574 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 11:41:48,574 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 11:41:48,574 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 11:41:48,585 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:41:48" (1/1) ... [2018-11-23 11:41:48,593 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:41:48" (1/1) ... [2018-11-23 11:41:48,601 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 11:41:48,602 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 11:41:48,603 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 11:41:48,603 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 11:41:48,615 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:41:48" (1/1) ... [2018-11-23 11:41:48,615 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:41:48" (1/1) ... [2018-11-23 11:41:48,616 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:41:48" (1/1) ... [2018-11-23 11:41:48,616 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:41:48" (1/1) ... [2018-11-23 11:41:48,626 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:41:48" (1/1) ... [2018-11-23 11:41:48,633 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:41:48" (1/1) ... [2018-11-23 11:41:48,634 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:41:48" (1/1) ... [2018-11-23 11:41:48,636 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 11:41:48,636 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 11:41:48,636 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 11:41:48,636 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 11:41:48,639 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:41:48" (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-23 11:41:48,792 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 11:41:48,792 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 11:41:48,793 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 11:41:48,793 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 11:41:48,793 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 11:41:48,793 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 11:41:48,793 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-23 11:41:48,793 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-23 11:41:49,270 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 11:41:49,270 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-11-23 11:41:49,271 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:41:49 BoogieIcfgContainer [2018-11-23 11:41:49,271 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 11:41:49,272 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 11:41:49,272 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 11:41:49,275 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 11:41:49,275 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 11:41:48" (1/3) ... [2018-11-23 11:41:49,276 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@314d8f8d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:41:49, skipping insertion in model container [2018-11-23 11:41:49,276 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:41:48" (2/3) ... [2018-11-23 11:41:49,276 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@314d8f8d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:41:49, skipping insertion in model container [2018-11-23 11:41:49,276 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:41:49" (3/3) ... [2018-11-23 11:41:49,278 INFO L112 eAbstractionObserver]: Analyzing ICFG count_by_1_true-unreach-call_true-termination.i [2018-11-23 11:41:49,287 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 11:41:49,294 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 11:41:49,312 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 11:41:49,344 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 11:41:49,345 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 11:41:49,345 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 11:41:49,346 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 11:41:49,347 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 11:41:49,347 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 11:41:49,347 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 11:41:49,347 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 11:41:49,348 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 11:41:49,365 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states. [2018-11-23 11:41:49,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-11-23 11:41:49,371 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:41:49,372 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:41:49,375 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:41:49,381 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:41:49,381 INFO L82 PathProgramCache]: Analyzing trace with hash -1871509567, now seen corresponding path program 1 times [2018-11-23 11:41:49,385 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:41:49,386 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-23 11:41:49,404 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:41:49,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:41:49,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:41:49,452 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:41:49,523 INFO L256 TraceCheckUtils]: 0: Hoare triple {22#true} call ULTIMATE.init(); {22#true} is VALID [2018-11-23 11:41:49,526 INFO L273 TraceCheckUtils]: 1: Hoare triple {22#true} assume true; {22#true} is VALID [2018-11-23 11:41:49,527 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {22#true} {22#true} #33#return; {22#true} is VALID [2018-11-23 11:41:49,528 INFO L256 TraceCheckUtils]: 3: Hoare triple {22#true} call #t~ret2 := main(); {22#true} is VALID [2018-11-23 11:41:49,528 INFO L273 TraceCheckUtils]: 4: Hoare triple {22#true} havoc ~i~0;~i~0 := 0bv32; {22#true} is VALID [2018-11-23 11:41:49,529 INFO L273 TraceCheckUtils]: 5: Hoare triple {22#true} assume !true; {23#false} is VALID [2018-11-23 11:41:49,530 INFO L256 TraceCheckUtils]: 6: Hoare triple {23#false} call __VERIFIER_assert((if 1000000bv32 == ~i~0 then 1bv32 else 0bv32)); {23#false} is VALID [2018-11-23 11:41:49,530 INFO L273 TraceCheckUtils]: 7: Hoare triple {23#false} ~cond := #in~cond; {23#false} is VALID [2018-11-23 11:41:49,531 INFO L273 TraceCheckUtils]: 8: Hoare triple {23#false} assume 0bv32 == ~cond; {23#false} is VALID [2018-11-23 11:41:49,531 INFO L273 TraceCheckUtils]: 9: Hoare triple {23#false} assume !false; {23#false} is VALID [2018-11-23 11:41:49,534 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-23 11:41:49,534 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 11:41:49,541 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:41:49,541 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 11:41:49,548 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2018-11-23 11:41:49,552 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:41:49,556 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-23 11:41:49,599 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-23 11:41:49,600 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-23 11:41:49,609 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 11:41:49,610 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 11:41:49,613 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 2 states. [2018-11-23 11:41:49,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:41:49,693 INFO L93 Difference]: Finished difference Result 31 states and 34 transitions. [2018-11-23 11:41:49,693 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 11:41:49,693 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2018-11-23 11:41:49,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:41:49,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 11:41:49,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 34 transitions. [2018-11-23 11:41:49,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 11:41:49,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 34 transitions. [2018-11-23 11:41:49,712 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 34 transitions. [2018-11-23 11:41:50,025 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-23 11:41:50,035 INFO L225 Difference]: With dead ends: 31 [2018-11-23 11:41:50,036 INFO L226 Difference]: Without dead ends: 12 [2018-11-23 11:41:50,039 INFO L631 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-23 11:41:50,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2018-11-23 11:41:50,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2018-11-23 11:41:50,113 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:41:50,114 INFO L82 GeneralOperation]: Start isEquivalent. First operand 12 states. Second operand 12 states. [2018-11-23 11:41:50,114 INFO L74 IsIncluded]: Start isIncluded. First operand 12 states. Second operand 12 states. [2018-11-23 11:41:50,115 INFO L87 Difference]: Start difference. First operand 12 states. Second operand 12 states. [2018-11-23 11:41:50,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:41:50,118 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2018-11-23 11:41:50,118 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2018-11-23 11:41:50,119 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:41:50,119 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:41:50,119 INFO L74 IsIncluded]: Start isIncluded. First operand 12 states. Second operand 12 states. [2018-11-23 11:41:50,119 INFO L87 Difference]: Start difference. First operand 12 states. Second operand 12 states. [2018-11-23 11:41:50,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:41:50,122 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2018-11-23 11:41:50,123 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2018-11-23 11:41:50,123 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:41:50,123 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:41:50,123 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:41:50,124 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:41:50,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 11:41:50,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2018-11-23 11:41:50,127 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 10 [2018-11-23 11:41:50,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:41:50,128 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2018-11-23 11:41:50,128 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-23 11:41:50,128 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2018-11-23 11:41:50,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-11-23 11:41:50,129 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:41:50,129 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:41:50,129 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:41:50,130 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:41:50,130 INFO L82 PathProgramCache]: Analyzing trace with hash -1877050693, now seen corresponding path program 1 times [2018-11-23 11:41:50,130 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:41:50,130 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-23 11:41:50,157 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:41:50,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:41:50,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:41:50,186 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:41:50,262 INFO L256 TraceCheckUtils]: 0: Hoare triple {136#true} call ULTIMATE.init(); {136#true} is VALID [2018-11-23 11:41:50,262 INFO L273 TraceCheckUtils]: 1: Hoare triple {136#true} assume true; {136#true} is VALID [2018-11-23 11:41:50,263 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {136#true} {136#true} #33#return; {136#true} is VALID [2018-11-23 11:41:50,263 INFO L256 TraceCheckUtils]: 3: Hoare triple {136#true} call #t~ret2 := main(); {136#true} is VALID [2018-11-23 11:41:50,264 INFO L273 TraceCheckUtils]: 4: Hoare triple {136#true} havoc ~i~0;~i~0 := 0bv32; {153#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-23 11:41:50,266 INFO L273 TraceCheckUtils]: 5: Hoare triple {153#(= main_~i~0 (_ bv0 32))} assume !~bvslt32(~i~0, 1000000bv32); {137#false} is VALID [2018-11-23 11:41:50,266 INFO L256 TraceCheckUtils]: 6: Hoare triple {137#false} call __VERIFIER_assert((if 1000000bv32 == ~i~0 then 1bv32 else 0bv32)); {137#false} is VALID [2018-11-23 11:41:50,267 INFO L273 TraceCheckUtils]: 7: Hoare triple {137#false} ~cond := #in~cond; {137#false} is VALID [2018-11-23 11:41:50,267 INFO L273 TraceCheckUtils]: 8: Hoare triple {137#false} assume 0bv32 == ~cond; {137#false} is VALID [2018-11-23 11:41:50,267 INFO L273 TraceCheckUtils]: 9: Hoare triple {137#false} assume !false; {137#false} is VALID [2018-11-23 11:41:50,268 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-23 11:41:50,268 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 11:41:50,272 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:41:50,272 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 11:41:50,274 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2018-11-23 11:41:50,274 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:41:50,276 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 11:41:50,332 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-23 11:41:50,332 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 11:41:50,333 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 11:41:50,333 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 11:41:50,333 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand 3 states. [2018-11-23 11:41:50,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:41:50,431 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2018-11-23 11:41:50,431 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 11:41:50,431 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2018-11-23 11:41:50,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:41:50,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 11:41:50,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 19 transitions. [2018-11-23 11:41:50,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 11:41:50,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 19 transitions. [2018-11-23 11:41:50,436 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 19 transitions. [2018-11-23 11:41:50,499 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:41:50,500 INFO L225 Difference]: With dead ends: 19 [2018-11-23 11:41:50,501 INFO L226 Difference]: Without dead ends: 14 [2018-11-23 11:41:50,502 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 11:41:50,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2018-11-23 11:41:50,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 13. [2018-11-23 11:41:50,600 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:41:50,600 INFO L82 GeneralOperation]: Start isEquivalent. First operand 14 states. Second operand 13 states. [2018-11-23 11:41:50,600 INFO L74 IsIncluded]: Start isIncluded. First operand 14 states. Second operand 13 states. [2018-11-23 11:41:50,601 INFO L87 Difference]: Start difference. First operand 14 states. Second operand 13 states. [2018-11-23 11:41:50,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:41:50,603 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2018-11-23 11:41:50,603 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2018-11-23 11:41:50,603 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:41:50,604 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:41:50,604 INFO L74 IsIncluded]: Start isIncluded. First operand 13 states. Second operand 14 states. [2018-11-23 11:41:50,604 INFO L87 Difference]: Start difference. First operand 13 states. Second operand 14 states. [2018-11-23 11:41:50,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:41:50,606 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2018-11-23 11:41:50,606 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2018-11-23 11:41:50,607 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:41:50,607 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:41:50,607 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:41:50,607 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:41:50,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-23 11:41:50,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2018-11-23 11:41:50,609 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 10 [2018-11-23 11:41:50,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:41:50,610 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2018-11-23 11:41:50,610 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 11:41:50,610 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2018-11-23 11:41:50,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-11-23 11:41:50,611 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:41:50,611 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:41:50,611 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:41:50,611 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:41:50,612 INFO L82 PathProgramCache]: Analyzing trace with hash 1175909113, now seen corresponding path program 1 times [2018-11-23 11:41:50,612 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:41:50,612 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-23 11:41:50,631 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:41:50,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:41:50,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:41:50,650 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:41:50,706 INFO L256 TraceCheckUtils]: 0: Hoare triple {246#true} call ULTIMATE.init(); {246#true} is VALID [2018-11-23 11:41:50,707 INFO L273 TraceCheckUtils]: 1: Hoare triple {246#true} assume true; {246#true} is VALID [2018-11-23 11:41:50,707 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {246#true} {246#true} #33#return; {246#true} is VALID [2018-11-23 11:41:50,707 INFO L256 TraceCheckUtils]: 3: Hoare triple {246#true} call #t~ret2 := main(); {246#true} is VALID [2018-11-23 11:41:50,709 INFO L273 TraceCheckUtils]: 4: Hoare triple {246#true} havoc ~i~0;~i~0 := 0bv32; {263#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-23 11:41:50,709 INFO L273 TraceCheckUtils]: 5: Hoare triple {263#(= main_~i~0 (_ bv0 32))} assume !!~bvslt32(~i~0, 1000000bv32); {263#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-23 11:41:50,712 INFO L273 TraceCheckUtils]: 6: Hoare triple {263#(= main_~i~0 (_ bv0 32))} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {270#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:41:50,712 INFO L273 TraceCheckUtils]: 7: Hoare triple {270#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} assume !~bvslt32(~i~0, 1000000bv32); {247#false} is VALID [2018-11-23 11:41:50,713 INFO L256 TraceCheckUtils]: 8: Hoare triple {247#false} call __VERIFIER_assert((if 1000000bv32 == ~i~0 then 1bv32 else 0bv32)); {247#false} is VALID [2018-11-23 11:41:50,713 INFO L273 TraceCheckUtils]: 9: Hoare triple {247#false} ~cond := #in~cond; {247#false} is VALID [2018-11-23 11:41:50,713 INFO L273 TraceCheckUtils]: 10: Hoare triple {247#false} assume 0bv32 == ~cond; {247#false} is VALID [2018-11-23 11:41:50,714 INFO L273 TraceCheckUtils]: 11: Hoare triple {247#false} assume !false; {247#false} is VALID [2018-11-23 11:41:50,715 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:41:50,715 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 11:41:50,835 INFO L273 TraceCheckUtils]: 11: Hoare triple {247#false} assume !false; {247#false} is VALID [2018-11-23 11:41:50,835 INFO L273 TraceCheckUtils]: 10: Hoare triple {247#false} assume 0bv32 == ~cond; {247#false} is VALID [2018-11-23 11:41:50,836 INFO L273 TraceCheckUtils]: 9: Hoare triple {247#false} ~cond := #in~cond; {247#false} is VALID [2018-11-23 11:41:50,836 INFO L256 TraceCheckUtils]: 8: Hoare triple {247#false} call __VERIFIER_assert((if 1000000bv32 == ~i~0 then 1bv32 else 0bv32)); {247#false} is VALID [2018-11-23 11:41:50,836 INFO L273 TraceCheckUtils]: 7: Hoare triple {298#(bvslt main_~i~0 (_ bv1000000 32))} assume !~bvslt32(~i~0, 1000000bv32); {247#false} is VALID [2018-11-23 11:41:50,841 INFO L273 TraceCheckUtils]: 6: Hoare triple {302#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv1000000 32))} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {298#(bvslt main_~i~0 (_ bv1000000 32))} is VALID [2018-11-23 11:41:50,846 INFO L273 TraceCheckUtils]: 5: Hoare triple {302#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv1000000 32))} assume !!~bvslt32(~i~0, 1000000bv32); {302#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv1000000 32))} is VALID [2018-11-23 11:41:50,847 INFO L273 TraceCheckUtils]: 4: Hoare triple {246#true} havoc ~i~0;~i~0 := 0bv32; {302#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv1000000 32))} is VALID [2018-11-23 11:41:50,848 INFO L256 TraceCheckUtils]: 3: Hoare triple {246#true} call #t~ret2 := main(); {246#true} is VALID [2018-11-23 11:41:50,848 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {246#true} {246#true} #33#return; {246#true} is VALID [2018-11-23 11:41:50,848 INFO L273 TraceCheckUtils]: 1: Hoare triple {246#true} assume true; {246#true} is VALID [2018-11-23 11:41:50,848 INFO L256 TraceCheckUtils]: 0: Hoare triple {246#true} call ULTIMATE.init(); {246#true} is VALID [2018-11-23 11:41:50,849 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:41:50,852 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:41:50,853 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2018-11-23 11:41:50,853 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 12 [2018-11-23 11:41:50,854 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:41:50,854 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-23 11:41:50,927 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:41:50,927 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 11:41:50,928 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 11:41:50,928 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-11-23 11:41:50,928 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand 6 states. [2018-11-23 11:41:51,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:41:51,405 INFO L93 Difference]: Finished difference Result 24 states and 26 transitions. [2018-11-23 11:41:51,405 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 11:41:51,405 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 12 [2018-11-23 11:41:51,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:41:51,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 11:41:51,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 26 transitions. [2018-11-23 11:41:51,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 11:41:51,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 26 transitions. [2018-11-23 11:41:51,410 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 26 transitions. [2018-11-23 11:41:51,451 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:41:51,452 INFO L225 Difference]: With dead ends: 24 [2018-11-23 11:41:51,453 INFO L226 Difference]: Without dead ends: 19 [2018-11-23 11:41:51,453 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2018-11-23 11:41:51,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2018-11-23 11:41:51,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2018-11-23 11:41:51,478 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:41:51,478 INFO L82 GeneralOperation]: Start isEquivalent. First operand 19 states. Second operand 19 states. [2018-11-23 11:41:51,479 INFO L74 IsIncluded]: Start isIncluded. First operand 19 states. Second operand 19 states. [2018-11-23 11:41:51,479 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 19 states. [2018-11-23 11:41:51,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:41:51,482 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2018-11-23 11:41:51,482 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2018-11-23 11:41:51,483 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:41:51,483 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:41:51,483 INFO L74 IsIncluded]: Start isIncluded. First operand 19 states. Second operand 19 states. [2018-11-23 11:41:51,483 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 19 states. [2018-11-23 11:41:51,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:41:51,485 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2018-11-23 11:41:51,486 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2018-11-23 11:41:51,486 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:41:51,486 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:41:51,486 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:41:51,487 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:41:51,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-23 11:41:51,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2018-11-23 11:41:51,489 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 12 [2018-11-23 11:41:51,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:41:51,489 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 19 transitions. [2018-11-23 11:41:51,489 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 11:41:51,489 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2018-11-23 11:41:51,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-23 11:41:51,490 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:41:51,490 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:41:51,491 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:41:51,491 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:41:51,491 INFO L82 PathProgramCache]: Analyzing trace with hash 263802547, now seen corresponding path program 2 times [2018-11-23 11:41:51,491 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:41:51,492 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 5 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 5 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 11:41:51,512 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-11-23 11:41:51,539 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 11:41:51,539 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:41:51,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:41:51,567 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:41:51,700 INFO L256 TraceCheckUtils]: 0: Hoare triple {430#true} call ULTIMATE.init(); {430#true} is VALID [2018-11-23 11:41:51,701 INFO L273 TraceCheckUtils]: 1: Hoare triple {430#true} assume true; {430#true} is VALID [2018-11-23 11:41:51,701 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {430#true} {430#true} #33#return; {430#true} is VALID [2018-11-23 11:41:51,702 INFO L256 TraceCheckUtils]: 3: Hoare triple {430#true} call #t~ret2 := main(); {430#true} is VALID [2018-11-23 11:41:51,702 INFO L273 TraceCheckUtils]: 4: Hoare triple {430#true} havoc ~i~0;~i~0 := 0bv32; {447#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-23 11:41:51,703 INFO L273 TraceCheckUtils]: 5: Hoare triple {447#(= main_~i~0 (_ bv0 32))} assume !!~bvslt32(~i~0, 1000000bv32); {447#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-23 11:41:51,706 INFO L273 TraceCheckUtils]: 6: Hoare triple {447#(= main_~i~0 (_ bv0 32))} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {454#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:41:51,712 INFO L273 TraceCheckUtils]: 7: Hoare triple {454#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 1000000bv32); {454#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:41:51,729 INFO L273 TraceCheckUtils]: 8: Hoare triple {454#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {461#(= (_ bv2 32) main_~i~0)} is VALID [2018-11-23 11:41:51,744 INFO L273 TraceCheckUtils]: 9: Hoare triple {461#(= (_ bv2 32) main_~i~0)} assume !!~bvslt32(~i~0, 1000000bv32); {461#(= (_ bv2 32) main_~i~0)} is VALID [2018-11-23 11:41:51,759 INFO L273 TraceCheckUtils]: 10: Hoare triple {461#(= (_ bv2 32) main_~i~0)} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {468#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-23 11:41:51,774 INFO L273 TraceCheckUtils]: 11: Hoare triple {468#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 1000000bv32); {468#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-23 11:41:51,781 INFO L273 TraceCheckUtils]: 12: Hoare triple {468#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {475#(= (_ bv4 32) main_~i~0)} is VALID [2018-11-23 11:41:51,782 INFO L273 TraceCheckUtils]: 13: Hoare triple {475#(= (_ bv4 32) main_~i~0)} assume !~bvslt32(~i~0, 1000000bv32); {431#false} is VALID [2018-11-23 11:41:51,782 INFO L256 TraceCheckUtils]: 14: Hoare triple {431#false} call __VERIFIER_assert((if 1000000bv32 == ~i~0 then 1bv32 else 0bv32)); {431#false} is VALID [2018-11-23 11:41:51,782 INFO L273 TraceCheckUtils]: 15: Hoare triple {431#false} ~cond := #in~cond; {431#false} is VALID [2018-11-23 11:41:51,782 INFO L273 TraceCheckUtils]: 16: Hoare triple {431#false} assume 0bv32 == ~cond; {431#false} is VALID [2018-11-23 11:41:51,783 INFO L273 TraceCheckUtils]: 17: Hoare triple {431#false} assume !false; {431#false} is VALID [2018-11-23 11:41:51,784 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:41:51,784 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 11:41:52,058 INFO L273 TraceCheckUtils]: 17: Hoare triple {431#false} assume !false; {431#false} is VALID [2018-11-23 11:41:52,059 INFO L273 TraceCheckUtils]: 16: Hoare triple {431#false} assume 0bv32 == ~cond; {431#false} is VALID [2018-11-23 11:41:52,059 INFO L273 TraceCheckUtils]: 15: Hoare triple {431#false} ~cond := #in~cond; {431#false} is VALID [2018-11-23 11:41:52,060 INFO L256 TraceCheckUtils]: 14: Hoare triple {431#false} call __VERIFIER_assert((if 1000000bv32 == ~i~0 then 1bv32 else 0bv32)); {431#false} is VALID [2018-11-23 11:41:52,061 INFO L273 TraceCheckUtils]: 13: Hoare triple {503#(bvslt main_~i~0 (_ bv1000000 32))} assume !~bvslt32(~i~0, 1000000bv32); {431#false} is VALID [2018-11-23 11:41:52,062 INFO L273 TraceCheckUtils]: 12: Hoare triple {507#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv1000000 32))} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {503#(bvslt main_~i~0 (_ bv1000000 32))} is VALID [2018-11-23 11:41:52,063 INFO L273 TraceCheckUtils]: 11: Hoare triple {507#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv1000000 32))} assume !!~bvslt32(~i~0, 1000000bv32); {507#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv1000000 32))} is VALID [2018-11-23 11:41:52,068 INFO L273 TraceCheckUtils]: 10: Hoare triple {514#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv1000000 32))} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {507#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv1000000 32))} is VALID [2018-11-23 11:41:52,068 INFO L273 TraceCheckUtils]: 9: Hoare triple {514#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv1000000 32))} assume !!~bvslt32(~i~0, 1000000bv32); {514#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv1000000 32))} is VALID [2018-11-23 11:41:52,077 INFO L273 TraceCheckUtils]: 8: Hoare triple {521#(bvslt (bvadd main_~i~0 (_ bv3 32)) (_ bv1000000 32))} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {514#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv1000000 32))} is VALID [2018-11-23 11:41:52,078 INFO L273 TraceCheckUtils]: 7: Hoare triple {521#(bvslt (bvadd main_~i~0 (_ bv3 32)) (_ bv1000000 32))} assume !!~bvslt32(~i~0, 1000000bv32); {521#(bvslt (bvadd main_~i~0 (_ bv3 32)) (_ bv1000000 32))} is VALID [2018-11-23 11:41:52,088 INFO L273 TraceCheckUtils]: 6: Hoare triple {528#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv1000000 32))} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {521#(bvslt (bvadd main_~i~0 (_ bv3 32)) (_ bv1000000 32))} is VALID [2018-11-23 11:41:52,088 INFO L273 TraceCheckUtils]: 5: Hoare triple {528#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv1000000 32))} assume !!~bvslt32(~i~0, 1000000bv32); {528#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv1000000 32))} is VALID [2018-11-23 11:41:52,089 INFO L273 TraceCheckUtils]: 4: Hoare triple {430#true} havoc ~i~0;~i~0 := 0bv32; {528#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv1000000 32))} is VALID [2018-11-23 11:41:52,089 INFO L256 TraceCheckUtils]: 3: Hoare triple {430#true} call #t~ret2 := main(); {430#true} is VALID [2018-11-23 11:41:52,090 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {430#true} {430#true} #33#return; {430#true} is VALID [2018-11-23 11:41:52,090 INFO L273 TraceCheckUtils]: 1: Hoare triple {430#true} assume true; {430#true} is VALID [2018-11-23 11:41:52,090 INFO L256 TraceCheckUtils]: 0: Hoare triple {430#true} call ULTIMATE.init(); {430#true} is VALID [2018-11-23 11:41:52,091 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:41:52,097 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:41:52,097 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2018-11-23 11:41:52,098 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 18 [2018-11-23 11:41:52,099 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:41:52,099 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2018-11-23 11:41:52,196 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:41:52,197 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-23 11:41:52,197 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-23 11:41:52,197 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2018-11-23 11:41:52,197 INFO L87 Difference]: Start difference. First operand 19 states and 19 transitions. Second operand 12 states. [2018-11-23 11:41:52,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:41:52,868 INFO L93 Difference]: Finished difference Result 36 states and 41 transitions. [2018-11-23 11:41:52,868 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-23 11:41:52,869 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 18 [2018-11-23 11:41:52,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:41:52,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 11:41:52,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 41 transitions. [2018-11-23 11:41:52,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 11:41:52,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 41 transitions. [2018-11-23 11:41:52,874 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 41 transitions. [2018-11-23 11:41:52,966 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-23 11:41:52,968 INFO L225 Difference]: With dead ends: 36 [2018-11-23 11:41:52,969 INFO L226 Difference]: Without dead ends: 31 [2018-11-23 11:41:52,969 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=94, Invalid=146, Unknown=0, NotChecked=0, Total=240 [2018-11-23 11:41:52,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-11-23 11:41:52,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2018-11-23 11:41:52,989 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:41:52,989 INFO L82 GeneralOperation]: Start isEquivalent. First operand 31 states. Second operand 31 states. [2018-11-23 11:41:52,990 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand 31 states. [2018-11-23 11:41:52,990 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 31 states. [2018-11-23 11:41:52,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:41:52,993 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2018-11-23 11:41:52,993 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2018-11-23 11:41:52,993 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:41:52,994 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:41:52,994 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand 31 states. [2018-11-23 11:41:52,994 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 31 states. [2018-11-23 11:41:52,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:41:52,997 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2018-11-23 11:41:52,997 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2018-11-23 11:41:52,997 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:41:52,998 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:41:52,998 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:41:52,998 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:41:52,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-11-23 11:41:53,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 31 transitions. [2018-11-23 11:41:53,000 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 31 transitions. Word has length 18 [2018-11-23 11:41:53,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:41:53,001 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 31 transitions. [2018-11-23 11:41:53,001 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-23 11:41:53,001 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2018-11-23 11:41:53,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-23 11:41:53,002 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:41:53,002 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:41:53,002 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:41:53,003 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:41:53,003 INFO L82 PathProgramCache]: Analyzing trace with hash 592907175, now seen corresponding path program 3 times [2018-11-23 11:41:53,003 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:41:53,003 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 6 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 6 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 11:41:53,019 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2018-11-23 11:41:53,047 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-11-23 11:41:53,047 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:41:53,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:41:53,063 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:41:53,208 INFO L256 TraceCheckUtils]: 0: Hoare triple {722#true} call ULTIMATE.init(); {722#true} is VALID [2018-11-23 11:41:53,208 INFO L273 TraceCheckUtils]: 1: Hoare triple {722#true} assume true; {722#true} is VALID [2018-11-23 11:41:53,209 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {722#true} {722#true} #33#return; {722#true} is VALID [2018-11-23 11:41:53,209 INFO L256 TraceCheckUtils]: 3: Hoare triple {722#true} call #t~ret2 := main(); {722#true} is VALID [2018-11-23 11:41:53,209 INFO L273 TraceCheckUtils]: 4: Hoare triple {722#true} havoc ~i~0;~i~0 := 0bv32; {722#true} is VALID [2018-11-23 11:41:53,210 INFO L273 TraceCheckUtils]: 5: Hoare triple {722#true} assume !!~bvslt32(~i~0, 1000000bv32); {722#true} is VALID [2018-11-23 11:41:53,211 INFO L273 TraceCheckUtils]: 6: Hoare triple {722#true} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {722#true} is VALID [2018-11-23 11:41:53,211 INFO L273 TraceCheckUtils]: 7: Hoare triple {722#true} assume !!~bvslt32(~i~0, 1000000bv32); {722#true} is VALID [2018-11-23 11:41:53,211 INFO L273 TraceCheckUtils]: 8: Hoare triple {722#true} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {722#true} is VALID [2018-11-23 11:41:53,212 INFO L273 TraceCheckUtils]: 9: Hoare triple {722#true} assume !!~bvslt32(~i~0, 1000000bv32); {722#true} is VALID [2018-11-23 11:41:53,212 INFO L273 TraceCheckUtils]: 10: Hoare triple {722#true} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {722#true} is VALID [2018-11-23 11:41:53,212 INFO L273 TraceCheckUtils]: 11: Hoare triple {722#true} assume !!~bvslt32(~i~0, 1000000bv32); {722#true} is VALID [2018-11-23 11:41:53,213 INFO L273 TraceCheckUtils]: 12: Hoare triple {722#true} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {722#true} is VALID [2018-11-23 11:41:53,213 INFO L273 TraceCheckUtils]: 13: Hoare triple {722#true} assume !!~bvslt32(~i~0, 1000000bv32); {722#true} is VALID [2018-11-23 11:41:53,213 INFO L273 TraceCheckUtils]: 14: Hoare triple {722#true} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {722#true} is VALID [2018-11-23 11:41:53,213 INFO L273 TraceCheckUtils]: 15: Hoare triple {722#true} assume !!~bvslt32(~i~0, 1000000bv32); {722#true} is VALID [2018-11-23 11:41:53,214 INFO L273 TraceCheckUtils]: 16: Hoare triple {722#true} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {722#true} is VALID [2018-11-23 11:41:53,214 INFO L273 TraceCheckUtils]: 17: Hoare triple {722#true} assume !!~bvslt32(~i~0, 1000000bv32); {722#true} is VALID [2018-11-23 11:41:53,214 INFO L273 TraceCheckUtils]: 18: Hoare triple {722#true} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {722#true} is VALID [2018-11-23 11:41:53,214 INFO L273 TraceCheckUtils]: 19: Hoare triple {722#true} assume !!~bvslt32(~i~0, 1000000bv32); {722#true} is VALID [2018-11-23 11:41:53,215 INFO L273 TraceCheckUtils]: 20: Hoare triple {722#true} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {722#true} is VALID [2018-11-23 11:41:53,215 INFO L273 TraceCheckUtils]: 21: Hoare triple {722#true} assume !!~bvslt32(~i~0, 1000000bv32); {722#true} is VALID [2018-11-23 11:41:53,215 INFO L273 TraceCheckUtils]: 22: Hoare triple {722#true} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {722#true} is VALID [2018-11-23 11:41:53,216 INFO L273 TraceCheckUtils]: 23: Hoare triple {722#true} assume !!~bvslt32(~i~0, 1000000bv32); {796#(bvslt main_~i~0 (_ bv1000000 32))} is VALID [2018-11-23 11:41:53,223 INFO L273 TraceCheckUtils]: 24: Hoare triple {796#(bvslt main_~i~0 (_ bv1000000 32))} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {800#(bvslt (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv1000000 32))} is VALID [2018-11-23 11:41:53,227 INFO L273 TraceCheckUtils]: 25: Hoare triple {800#(bvslt (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv1000000 32))} assume !~bvslt32(~i~0, 1000000bv32); {804#(and (not (bvslt main_~i~0 (_ bv1000000 32))) (bvslt (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv1000000 32)))} is VALID [2018-11-23 11:41:53,231 INFO L256 TraceCheckUtils]: 26: Hoare triple {804#(and (not (bvslt main_~i~0 (_ bv1000000 32))) (bvslt (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv1000000 32)))} call __VERIFIER_assert((if 1000000bv32 == ~i~0 then 1bv32 else 0bv32)); {808#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:41:53,232 INFO L273 TraceCheckUtils]: 27: Hoare triple {808#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} ~cond := #in~cond; {812#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:41:53,233 INFO L273 TraceCheckUtils]: 28: Hoare triple {812#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == ~cond; {723#false} is VALID [2018-11-23 11:41:53,233 INFO L273 TraceCheckUtils]: 29: Hoare triple {723#false} assume !false; {723#false} is VALID [2018-11-23 11:41:53,235 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2018-11-23 11:41:53,236 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 11:41:53,238 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:41:53,238 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-23 11:41:53,238 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 30 [2018-11-23 11:41:53,239 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:41:53,239 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2018-11-23 11:41:53,269 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:41:53,269 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-23 11:41:53,269 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-23 11:41:53,269 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-11-23 11:41:53,270 INFO L87 Difference]: Start difference. First operand 31 states and 31 transitions. Second operand 7 states. [2018-11-23 11:41:53,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:41:53,588 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2018-11-23 11:41:53,588 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 11:41:53,588 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 30 [2018-11-23 11:41:53,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:41:53,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-23 11:41:53,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 13 transitions. [2018-11-23 11:41:53,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-23 11:41:53,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 13 transitions. [2018-11-23 11:41:53,591 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 13 transitions. [2018-11-23 11:41:53,627 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:41:53,627 INFO L225 Difference]: With dead ends: 31 [2018-11-23 11:41:53,627 INFO L226 Difference]: Without dead ends: 0 [2018-11-23 11:41:53,628 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2018-11-23 11:41:53,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-23 11:41:53,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-23 11:41:53,629 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:41:53,629 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2018-11-23 11:41:53,629 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2018-11-23 11:41:53,630 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2018-11-23 11:41:53,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:41:53,630 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2018-11-23 11:41:53,630 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-23 11:41:53,631 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:41:53,631 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:41:53,631 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2018-11-23 11:41:53,631 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2018-11-23 11:41:53,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:41:53,631 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2018-11-23 11:41:53,631 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-23 11:41:53,632 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:41:53,632 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:41:53,632 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:41:53,632 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:41:53,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-23 11:41:53,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-23 11:41:53,632 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 30 [2018-11-23 11:41:53,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:41:53,633 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 11:41:53,633 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-23 11:41:53,633 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-23 11:41:53,633 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:41:53,638 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-23 11:41:53,869 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2018-11-23 11:41:53,869 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-23 11:41:53,869 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-23 11:41:53,869 INFO L451 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-11-23 11:41:53,869 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-23 11:41:53,869 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-23 11:41:53,870 INFO L451 ceAbstractionStarter]: At program point mainENTRY(lines 10 15) the Hoare annotation is: true [2018-11-23 11:41:53,870 INFO L448 ceAbstractionStarter]: For program point mainEXIT(lines 10 15) no Hoare annotation was computed. [2018-11-23 11:41:53,870 INFO L448 ceAbstractionStarter]: For program point L13(line 13) no Hoare annotation was computed. [2018-11-23 11:41:53,870 INFO L448 ceAbstractionStarter]: For program point mainFINAL(lines 10 15) no Hoare annotation was computed. [2018-11-23 11:41:53,870 INFO L448 ceAbstractionStarter]: For program point L12-2(line 12) no Hoare annotation was computed. [2018-11-23 11:41:53,870 INFO L444 ceAbstractionStarter]: At program point L12-3(line 12) the Hoare annotation is: (bvslt (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv1000000 32)) [2018-11-23 11:41:53,870 INFO L444 ceAbstractionStarter]: At program point L12-4(line 12) the Hoare annotation is: (and (not (bvslt main_~i~0 (_ bv1000000 32))) (bvslt (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv1000000 32))) [2018-11-23 11:41:53,870 INFO L451 ceAbstractionStarter]: At program point __VERIFIER_assertENTRY(lines 3 8) the Hoare annotation is: true [2018-11-23 11:41:53,871 INFO L448 ceAbstractionStarter]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2018-11-23 11:41:53,871 INFO L448 ceAbstractionStarter]: For program point __VERIFIER_assertEXIT(lines 3 8) no Hoare annotation was computed. [2018-11-23 11:41:53,871 INFO L448 ceAbstractionStarter]: For program point L5(line 5) no Hoare annotation was computed. [2018-11-23 11:41:53,871 INFO L448 ceAbstractionStarter]: For program point L4(lines 4 6) no Hoare annotation was computed. [2018-11-23 11:41:53,871 INFO L448 ceAbstractionStarter]: For program point L4-2(lines 3 8) no Hoare annotation was computed. [2018-11-23 11:41:53,873 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2018-11-23 11:41:53,882 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2018-11-23 11:41:53,882 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2018-11-23 11:41:53,883 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2018-11-23 11:41:53,901 WARN L170 areAnnotationChecker]: L12-2 has no Hoare annotation [2018-11-23 11:41:53,901 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2018-11-23 11:41:53,901 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2018-11-23 11:41:53,901 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2018-11-23 11:41:53,902 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2018-11-23 11:41:53,902 WARN L170 areAnnotationChecker]: L12-2 has no Hoare annotation [2018-11-23 11:41:53,902 WARN L170 areAnnotationChecker]: L5 has no Hoare annotation [2018-11-23 11:41:53,902 WARN L170 areAnnotationChecker]: L5 has no Hoare annotation [2018-11-23 11:41:53,902 WARN L170 areAnnotationChecker]: L4-2 has no Hoare annotation [2018-11-23 11:41:53,902 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2018-11-23 11:41:53,902 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2018-11-23 11:41:53,903 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2018-11-23 11:41:53,903 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2018-11-23 11:41:53,903 INFO L163 areAnnotationChecker]: CFG has 6 edges. 6 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2018-11-23 11:41:53,909 WARN L1272 BoogieBacktranslator]: Unfinished Backtranslation cannot identify Boogie2SMT function ~bvslt32 [2018-11-23 11:41:53,911 WARN L1272 BoogieBacktranslator]: Unfinished Backtranslation cannot identify Boogie2SMT function ~bvslt32 [2018-11-23 11:41:53,913 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 11:41:53 BoogieIcfgContainer [2018-11-23 11:41:53,913 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-23 11:41:53,914 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 11:41:53,914 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 11:41:53,914 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 11:41:53,915 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:41:49" (3/4) ... [2018-11-23 11:41:53,920 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-23 11:41:53,927 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-23 11:41:53,928 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-23 11:41:53,928 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2018-11-23 11:41:53,937 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2018-11-23 11:41:53,937 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2018-11-23 11:41:53,938 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-11-23 11:41:53,981 INFO L145 WitnessManager]: Wrote witness to /storage/repos/svcomp/c/loop-new/count_by_1_true-unreach-call_true-termination.i-witness.graphml [2018-11-23 11:41:53,981 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 11:41:53,982 INFO L168 Benchmark]: Toolchain (without parser) took 5707.17 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 710.4 MB). Free memory was 1.4 GB in the beginning and 1.9 GB in the end (delta: -461.8 MB). Peak memory consumption was 248.6 MB. Max. memory is 7.1 GB. [2018-11-23 11:41:53,983 INFO L168 Benchmark]: CDTParser took 0.22 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-23 11:41:53,984 INFO L168 Benchmark]: CACSL2BoogieTranslator took 296.89 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-23 11:41:53,985 INFO L168 Benchmark]: Boogie Procedure Inliner took 27.73 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-23 11:41:53,985 INFO L168 Benchmark]: Boogie Preprocessor took 33.29 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-23 11:41:53,985 INFO L168 Benchmark]: RCFGBuilder took 635.25 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 710.4 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -759.2 MB). Peak memory consumption was 26.1 MB. Max. memory is 7.1 GB. [2018-11-23 11:41:53,986 INFO L168 Benchmark]: TraceAbstraction took 4641.54 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: 286.8 MB). Peak memory consumption was 286.8 MB. Max. memory is 7.1 GB. [2018-11-23 11:41:53,987 INFO L168 Benchmark]: Witness Printer took 66.94 ms. Allocated memory is still 2.2 GB. Free memory is still 1.9 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-23 11:41:53,991 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.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 296.89 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 Procedure Inliner took 27.73 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. * Boogie Preprocessor took 33.29 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 635.25 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 710.4 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -759.2 MB). Peak memory consumption was 26.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 4641.54 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: 286.8 MB). Peak memory consumption was 286.8 MB. Max. memory is 7.1 GB. * Witness Printer took 66.94 ms. Allocated memory is still 2.2 GB. Free memory is still 1.9 GB. There was no memory consumed. 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 ~bvslt32 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation cannot identify Boogie2SMT function ~bvslt32 * 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: 12]: Loop Invariant [2018-11-23 11:41:53,998 WARN L1272 BoogieBacktranslator]: Unfinished Backtranslation cannot identify Boogie2SMT function ~bvslt32 [2018-11-23 11:41:53,999 WARN L1272 BoogieBacktranslator]: Unfinished Backtranslation cannot identify Boogie2SMT function ~bvslt32 Derived loop invariant: NULL - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 19 locations, 1 error locations. SAFE Result, 4.5s OverallTime, 5 OverallIterations, 10 TraceHistogramMax, 2.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.2s HoareAnnotationTime, HoareTripleCheckerStatistics: 55 SDtfs, 21 SDslu, 93 SDs, 0 SdLazy, 107 SolverSat, 16 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 112 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=31occurred in iteration=4, 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.2s AutomataMinimizationTime, 5 MinimizatonAttempts, 1 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 11 PreInvPairs, 22 NumberOfFragments, 20 HoareAnnotationTreeSize, 11 FomulaSimplifications, 129 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 80 NumberOfCodeBlocks, 64 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 103 ConstructedInterpolants, 0 QuantifiedInterpolants, 3726 SizeOfPredicates, 5 NumberOfNonLiveVariables, 104 ConjunctsInSsa, 18 ConjunctsInUnsatCore, 7 InterpolantComputations, 3 PerfectInterpolantSequences, 100/134 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...