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_variant_true-unreach-call_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-61f4311 [2018-11-23 11:41:56,552 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 11:41:56,556 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 11:41:56,573 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 11:41:56,574 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 11:41:56,576 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 11:41:56,577 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 11:41:56,580 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 11:41:56,583 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 11:41:56,583 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 11:41:56,587 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 11:41:56,587 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 11:41:56,588 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 11:41:56,590 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 11:41:56,591 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 11:41:56,598 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 11:41:56,599 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 11:41:56,603 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 11:41:56,607 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 11:41:56,611 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 11:41:56,612 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 11:41:56,614 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 11:41:56,615 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 11:41:56,616 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 11:41:56,616 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 11:41:56,617 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 11:41:56,620 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 11:41:56,621 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 11:41:56,621 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 11:41:56,622 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 11:41:56,624 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 11:41:56,624 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 11:41:56,624 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 11:41:56,625 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 11:41:56,627 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 11:41:56,628 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 11:41:56,629 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:56,655 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 11:41:56,655 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 11:41:56,656 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 11:41:56,656 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 11:41:56,661 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 11:41:56,661 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 11:41:56,661 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 11:41:56,661 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 11:41:56,661 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 11:41:56,662 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 11:41:56,663 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 11:41:56,663 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 11:41:56,663 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 11:41:56,663 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 11:41:56,663 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-23 11:41:56,663 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-23 11:41:56,664 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 11:41:56,664 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 11:41:56,664 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 11:41:56,664 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 11:41:56,664 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 11:41:56,666 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 11:41:56,666 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 11:41:56,666 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 11:41:56,666 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 11:41:56,667 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 11:41:56,667 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 11:41:56,667 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 11:41:56,667 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-11-23 11:41:56,667 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 11:41:56,668 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-23 11:41:56,668 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-23 11:41:56,668 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 11:41:56,725 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 11:41:56,738 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 11:41:56,743 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 11:41:56,745 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 11:41:56,745 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 11:41:56,746 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-new/count_by_1_variant_true-unreach-call_true-termination.i [2018-11-23 11:41:56,800 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6d8faf1b1/64e294aaba974fa3a1f9fc8468439a5a/FLAGc5133fd4a [2018-11-23 11:41:57,214 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 11:41:57,215 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-new/count_by_1_variant_true-unreach-call_true-termination.i [2018-11-23 11:41:57,221 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6d8faf1b1/64e294aaba974fa3a1f9fc8468439a5a/FLAGc5133fd4a [2018-11-23 11:41:57,603 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6d8faf1b1/64e294aaba974fa3a1f9fc8468439a5a [2018-11-23 11:41:57,614 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 11:41:57,615 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 11:41:57,616 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 11:41:57,616 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 11:41:57,620 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 11:41:57,621 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:41:57" (1/1) ... [2018-11-23 11:41:57,624 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@13ed2a58 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:41:57, skipping insertion in model container [2018-11-23 11:41:57,624 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:41:57" (1/1) ... [2018-11-23 11:41:57,635 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 11:41:57,659 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 11:41:57,861 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 11:41:57,866 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 11:41:57,884 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 11:41:57,902 INFO L195 MainTranslator]: Completed translation [2018-11-23 11:41:57,903 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:41:57 WrapperNode [2018-11-23 11:41:57,903 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 11:41:57,904 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 11:41:57,904 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 11:41:57,904 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 11:41:57,915 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:57" (1/1) ... [2018-11-23 11:41:57,922 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:57" (1/1) ... [2018-11-23 11:41:57,929 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 11:41:57,930 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 11:41:57,930 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 11:41:57,930 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 11:41:57,942 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:57" (1/1) ... [2018-11-23 11:41:57,942 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:57" (1/1) ... [2018-11-23 11:41:57,943 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:57" (1/1) ... [2018-11-23 11:41:57,944 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:57" (1/1) ... [2018-11-23 11:41:57,952 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:57" (1/1) ... [2018-11-23 11:41:57,957 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:57" (1/1) ... [2018-11-23 11:41:57,958 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:57" (1/1) ... [2018-11-23 11:41:57,960 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 11:41:57,961 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 11:41:57,961 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 11:41:57,961 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 11:41:57,962 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:41:57" (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:58,096 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 11:41:58,097 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 11:41:58,097 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 11:41:58,097 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 11:41:58,097 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 11:41:58,097 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 11:41:58,097 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-23 11:41:58,098 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-23 11:41:58,504 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 11:41:58,504 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-11-23 11:41:58,505 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:41:58 BoogieIcfgContainer [2018-11-23 11:41:58,505 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 11:41:58,506 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 11:41:58,506 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 11:41:58,509 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 11:41:58,510 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 11:41:57" (1/3) ... [2018-11-23 11:41:58,510 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7cc258e4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:41:58, skipping insertion in model container [2018-11-23 11:41:58,511 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:41:57" (2/3) ... [2018-11-23 11:41:58,511 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7cc258e4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:41:58, skipping insertion in model container [2018-11-23 11:41:58,511 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:41:58" (3/3) ... [2018-11-23 11:41:58,513 INFO L112 eAbstractionObserver]: Analyzing ICFG count_by_1_variant_true-unreach-call_true-termination.i [2018-11-23 11:41:58,523 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 11:41:58,531 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 11:41:58,551 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 11:41:58,585 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 11:41:58,586 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 11:41:58,586 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 11:41:58,586 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 11:41:58,586 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 11:41:58,587 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 11:41:58,587 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 11:41:58,587 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 11:41:58,587 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 11:41:58,606 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states. [2018-11-23 11:41:58,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-11-23 11:41:58,613 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:41:58,614 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:41:58,616 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:41:58,623 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:41:58,623 INFO L82 PathProgramCache]: Analyzing trace with hash -1875203651, now seen corresponding path program 1 times [2018-11-23 11:41:58,628 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:41:58,629 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:58,652 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:41:58,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:41:58,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:41:58,700 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:41:58,918 INFO L256 TraceCheckUtils]: 0: Hoare triple {22#true} call ULTIMATE.init(); {22#true} is VALID [2018-11-23 11:41:58,925 INFO L273 TraceCheckUtils]: 1: Hoare triple {22#true} assume true; {22#true} is VALID [2018-11-23 11:41:58,925 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {22#true} {22#true} #33#return; {22#true} is VALID [2018-11-23 11:41:58,926 INFO L256 TraceCheckUtils]: 3: Hoare triple {22#true} call #t~ret2 := main(); {22#true} is VALID [2018-11-23 11:41:58,941 INFO L273 TraceCheckUtils]: 4: Hoare triple {22#true} havoc ~i~0;~i~0 := 0bv32; {39#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-23 11:41:58,954 INFO L273 TraceCheckUtils]: 5: Hoare triple {39#(= main_~i~0 (_ bv0 32))} assume !!(1000000bv32 != ~i~0); {39#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-23 11:41:58,968 INFO L256 TraceCheckUtils]: 6: Hoare triple {39#(= main_~i~0 (_ bv0 32))} call __VERIFIER_assert((if ~bvsle32(~i~0, 1000000bv32) then 1bv32 else 0bv32)); {46#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:41:58,975 INFO L273 TraceCheckUtils]: 7: Hoare triple {46#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} ~cond := #in~cond; {50#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:41:58,976 INFO L273 TraceCheckUtils]: 8: Hoare triple {50#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == ~cond; {23#false} is VALID [2018-11-23 11:41:58,976 INFO L273 TraceCheckUtils]: 9: Hoare triple {23#false} assume !false; {23#false} is VALID [2018-11-23 11:41:58,979 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:58,979 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 11:41:58,983 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:41:58,983 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 11:41:58,989 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 10 [2018-11-23 11:41:58,992 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:41:58,996 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-23 11:41:59,054 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:59,054 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 11:41:59,062 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 11:41:59,063 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 11:41:59,065 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 5 states. [2018-11-23 11:41:59,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:41:59,668 INFO L93 Difference]: Finished difference Result 40 states and 49 transitions. [2018-11-23 11:41:59,668 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 11:41:59,668 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 10 [2018-11-23 11:41:59,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:41:59,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 11:41:59,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 49 transitions. [2018-11-23 11:41:59,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 11:41:59,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 49 transitions. [2018-11-23 11:41:59,686 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 49 transitions. [2018-11-23 11:41:59,873 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:41:59,884 INFO L225 Difference]: With dead ends: 40 [2018-11-23 11:41:59,885 INFO L226 Difference]: Without dead ends: 21 [2018-11-23 11:41:59,888 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-23 11:41:59,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2018-11-23 11:41:59,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 20. [2018-11-23 11:41:59,940 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:41:59,940 INFO L82 GeneralOperation]: Start isEquivalent. First operand 21 states. Second operand 20 states. [2018-11-23 11:41:59,941 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states. Second operand 20 states. [2018-11-23 11:41:59,941 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 20 states. [2018-11-23 11:41:59,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:41:59,945 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2018-11-23 11:41:59,945 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2018-11-23 11:41:59,946 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:41:59,946 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:41:59,947 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states. Second operand 21 states. [2018-11-23 11:41:59,947 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 21 states. [2018-11-23 11:41:59,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:41:59,950 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2018-11-23 11:41:59,951 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2018-11-23 11:41:59,951 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:41:59,951 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:41:59,952 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:41:59,952 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:41:59,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-23 11:41:59,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 20 transitions. [2018-11-23 11:41:59,957 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 20 transitions. Word has length 10 [2018-11-23 11:41:59,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:41:59,957 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 20 transitions. [2018-11-23 11:41:59,957 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 11:41:59,957 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2018-11-23 11:41:59,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-23 11:41:59,958 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:41:59,959 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:41:59,959 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:41:59,959 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:41:59,960 INFO L82 PathProgramCache]: Analyzing trace with hash -1632080392, now seen corresponding path program 1 times [2018-11-23 11:41:59,960 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:41:59,960 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:59,985 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:42:00,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:42:00,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:42:00,014 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:42:00,272 INFO L256 TraceCheckUtils]: 0: Hoare triple {183#true} call ULTIMATE.init(); {183#true} is VALID [2018-11-23 11:42:00,273 INFO L273 TraceCheckUtils]: 1: Hoare triple {183#true} assume true; {183#true} is VALID [2018-11-23 11:42:00,273 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {183#true} {183#true} #33#return; {183#true} is VALID [2018-11-23 11:42:00,274 INFO L256 TraceCheckUtils]: 3: Hoare triple {183#true} call #t~ret2 := main(); {183#true} is VALID [2018-11-23 11:42:00,289 INFO L273 TraceCheckUtils]: 4: Hoare triple {183#true} havoc ~i~0;~i~0 := 0bv32; {200#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-23 11:42:00,299 INFO L273 TraceCheckUtils]: 5: Hoare triple {200#(= main_~i~0 (_ bv0 32))} assume !!(1000000bv32 != ~i~0); {200#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-23 11:42:00,300 INFO L256 TraceCheckUtils]: 6: Hoare triple {200#(= main_~i~0 (_ bv0 32))} call __VERIFIER_assert((if ~bvsle32(~i~0, 1000000bv32) then 1bv32 else 0bv32)); {183#true} is VALID [2018-11-23 11:42:00,300 INFO L273 TraceCheckUtils]: 7: Hoare triple {183#true} ~cond := #in~cond; {183#true} is VALID [2018-11-23 11:42:00,301 INFO L273 TraceCheckUtils]: 8: Hoare triple {183#true} assume !(0bv32 == ~cond); {183#true} is VALID [2018-11-23 11:42:00,301 INFO L273 TraceCheckUtils]: 9: Hoare triple {183#true} assume true; {183#true} is VALID [2018-11-23 11:42:00,314 INFO L268 TraceCheckUtils]: 10: Hoare quadruple {183#true} {200#(= main_~i~0 (_ bv0 32))} #37#return; {200#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-23 11:42:00,333 INFO L273 TraceCheckUtils]: 11: Hoare triple {200#(= main_~i~0 (_ bv0 32))} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {222#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:42:00,342 INFO L273 TraceCheckUtils]: 12: Hoare triple {222#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} assume !!(1000000bv32 != ~i~0); {222#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:42:00,356 INFO L256 TraceCheckUtils]: 13: Hoare triple {222#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} call __VERIFIER_assert((if ~bvsle32(~i~0, 1000000bv32) then 1bv32 else 0bv32)); {229#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:42:00,369 INFO L273 TraceCheckUtils]: 14: Hoare triple {229#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} ~cond := #in~cond; {233#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:42:00,382 INFO L273 TraceCheckUtils]: 15: Hoare triple {233#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == ~cond; {184#false} is VALID [2018-11-23 11:42:00,383 INFO L273 TraceCheckUtils]: 16: Hoare triple {184#false} assume !false; {184#false} is VALID [2018-11-23 11:42:00,385 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:42:00,385 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 11:42:00,940 INFO L273 TraceCheckUtils]: 16: Hoare triple {184#false} assume !false; {184#false} is VALID [2018-11-23 11:42:00,941 INFO L273 TraceCheckUtils]: 15: Hoare triple {243#(not (= (_ bv0 32) __VERIFIER_assert_~cond))} assume 0bv32 == ~cond; {184#false} is VALID [2018-11-23 11:42:00,942 INFO L273 TraceCheckUtils]: 14: Hoare triple {247#(not (= |__VERIFIER_assert_#in~cond| (_ bv0 32)))} ~cond := #in~cond; {243#(not (= (_ bv0 32) __VERIFIER_assert_~cond))} is VALID [2018-11-23 11:42:00,944 INFO L256 TraceCheckUtils]: 13: Hoare triple {251#(bvsle main_~i~0 (_ bv1000000 32))} call __VERIFIER_assert((if ~bvsle32(~i~0, 1000000bv32) then 1bv32 else 0bv32)); {247#(not (= |__VERIFIER_assert_#in~cond| (_ bv0 32)))} is VALID [2018-11-23 11:42:00,945 INFO L273 TraceCheckUtils]: 12: Hoare triple {251#(bvsle main_~i~0 (_ bv1000000 32))} assume !!(1000000bv32 != ~i~0); {251#(bvsle main_~i~0 (_ bv1000000 32))} is VALID [2018-11-23 11:42:00,946 INFO L273 TraceCheckUtils]: 11: Hoare triple {258#(bvsle (bvadd main_~i~0 (_ bv1 32)) (_ bv1000000 32))} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {251#(bvsle main_~i~0 (_ bv1000000 32))} is VALID [2018-11-23 11:42:00,947 INFO L268 TraceCheckUtils]: 10: Hoare quadruple {183#true} {258#(bvsle (bvadd main_~i~0 (_ bv1 32)) (_ bv1000000 32))} #37#return; {258#(bvsle (bvadd main_~i~0 (_ bv1 32)) (_ bv1000000 32))} is VALID [2018-11-23 11:42:00,948 INFO L273 TraceCheckUtils]: 9: Hoare triple {183#true} assume true; {183#true} is VALID [2018-11-23 11:42:00,948 INFO L273 TraceCheckUtils]: 8: Hoare triple {183#true} assume !(0bv32 == ~cond); {183#true} is VALID [2018-11-23 11:42:00,949 INFO L273 TraceCheckUtils]: 7: Hoare triple {183#true} ~cond := #in~cond; {183#true} is VALID [2018-11-23 11:42:00,949 INFO L256 TraceCheckUtils]: 6: Hoare triple {258#(bvsle (bvadd main_~i~0 (_ bv1 32)) (_ bv1000000 32))} call __VERIFIER_assert((if ~bvsle32(~i~0, 1000000bv32) then 1bv32 else 0bv32)); {183#true} is VALID [2018-11-23 11:42:00,968 INFO L273 TraceCheckUtils]: 5: Hoare triple {258#(bvsle (bvadd main_~i~0 (_ bv1 32)) (_ bv1000000 32))} assume !!(1000000bv32 != ~i~0); {258#(bvsle (bvadd main_~i~0 (_ bv1 32)) (_ bv1000000 32))} is VALID [2018-11-23 11:42:00,983 INFO L273 TraceCheckUtils]: 4: Hoare triple {183#true} havoc ~i~0;~i~0 := 0bv32; {258#(bvsle (bvadd main_~i~0 (_ bv1 32)) (_ bv1000000 32))} is VALID [2018-11-23 11:42:00,983 INFO L256 TraceCheckUtils]: 3: Hoare triple {183#true} call #t~ret2 := main(); {183#true} is VALID [2018-11-23 11:42:00,984 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {183#true} {183#true} #33#return; {183#true} is VALID [2018-11-23 11:42:00,984 INFO L273 TraceCheckUtils]: 1: Hoare triple {183#true} assume true; {183#true} is VALID [2018-11-23 11:42:00,984 INFO L256 TraceCheckUtils]: 0: Hoare triple {183#true} call ULTIMATE.init(); {183#true} is VALID [2018-11-23 11:42:00,986 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:42:00,988 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:42:00,988 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2018-11-23 11:42:00,990 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-11-23 11:42:00,990 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:42:00,990 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2018-11-23 11:42:01,039 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:42:01,039 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-23 11:42:01,040 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-23 11:42:01,040 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2018-11-23 11:42:01,040 INFO L87 Difference]: Start difference. First operand 20 states and 20 transitions. Second operand 10 states. [2018-11-23 11:42:01,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:42:01,524 INFO L93 Difference]: Finished difference Result 25 states and 26 transitions. [2018-11-23 11:42:01,524 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-23 11:42:01,525 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-11-23 11:42:01,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:42:01,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-23 11:42:01,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 23 transitions. [2018-11-23 11:42:01,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-23 11:42:01,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 23 transitions. [2018-11-23 11:42:01,531 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 23 transitions. [2018-11-23 11:42:01,599 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:42:01,600 INFO L225 Difference]: With dead ends: 25 [2018-11-23 11:42:01,600 INFO L226 Difference]: Without dead ends: 0 [2018-11-23 11:42:01,602 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2018-11-23 11:42:01,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-23 11:42:01,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-23 11:42:01,603 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:42:01,603 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2018-11-23 11:42:01,603 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2018-11-23 11:42:01,603 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2018-11-23 11:42:01,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:42:01,604 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2018-11-23 11:42:01,604 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-23 11:42:01,604 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:42:01,604 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:42:01,604 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2018-11-23 11:42:01,605 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2018-11-23 11:42:01,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:42:01,605 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2018-11-23 11:42:01,605 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-23 11:42:01,605 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:42:01,605 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:42:01,606 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:42:01,606 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:42:01,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-23 11:42:01,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-23 11:42:01,606 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 17 [2018-11-23 11:42:01,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:42:01,607 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 11:42:01,607 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-23 11:42:01,607 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-23 11:42:01,607 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:42:01,612 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-23 11:42:02,161 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2018-11-23 11:42:02,161 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-23 11:42:02,161 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-23 11:42:02,161 INFO L451 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-11-23 11:42:02,161 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-23 11:42:02,161 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-23 11:42:02,162 INFO L451 ceAbstractionStarter]: At program point mainENTRY(lines 10 16) the Hoare annotation is: true [2018-11-23 11:42:02,162 INFO L448 ceAbstractionStarter]: For program point mainEXIT(lines 10 16) no Hoare annotation was computed. [2018-11-23 11:42:02,162 INFO L444 ceAbstractionStarter]: At program point L13(line 13) the Hoare annotation is: (and (bvsle main_~i~0 (_ bv1000000 32)) (bvsle (bvadd main_~i~0 (_ bv1 32)) (_ bv1000000 32))) [2018-11-23 11:42:02,162 INFO L448 ceAbstractionStarter]: For program point mainFINAL(lines 10 16) no Hoare annotation was computed. [2018-11-23 11:42:02,162 INFO L448 ceAbstractionStarter]: For program point L13-1(lines 12 14) no Hoare annotation was computed. [2018-11-23 11:42:02,162 INFO L444 ceAbstractionStarter]: At program point L12-2(lines 12 14) the Hoare annotation is: (bvsle main_~i~0 (_ bv1000000 32)) [2018-11-23 11:42:02,163 INFO L448 ceAbstractionStarter]: For program point L12-3(lines 12 14) no Hoare annotation was computed. [2018-11-23 11:42:02,163 INFO L451 ceAbstractionStarter]: At program point __VERIFIER_assertENTRY(lines 3 8) the Hoare annotation is: true [2018-11-23 11:42:02,163 INFO L448 ceAbstractionStarter]: For program point __VERIFIER_assertEXIT(lines 3 8) no Hoare annotation was computed. [2018-11-23 11:42:02,163 INFO L448 ceAbstractionStarter]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2018-11-23 11:42:02,163 INFO L448 ceAbstractionStarter]: For program point L5(line 5) no Hoare annotation was computed. [2018-11-23 11:42:02,163 INFO L448 ceAbstractionStarter]: For program point L4(lines 4 6) no Hoare annotation was computed. [2018-11-23 11:42:02,164 INFO L448 ceAbstractionStarter]: For program point L4-2(lines 3 8) no Hoare annotation was computed. [2018-11-23 11:42:02,165 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2018-11-23 11:42:02,166 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2018-11-23 11:42:02,166 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2018-11-23 11:42:02,167 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2018-11-23 11:42:02,167 WARN L170 areAnnotationChecker]: L12-3 has no Hoare annotation [2018-11-23 11:42:02,167 WARN L170 areAnnotationChecker]: L12-3 has no Hoare annotation [2018-11-23 11:42:02,168 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2018-11-23 11:42:02,169 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2018-11-23 11:42:02,169 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2018-11-23 11:42:02,169 WARN L170 areAnnotationChecker]: L12-3 has no Hoare annotation [2018-11-23 11:42:02,169 WARN L170 areAnnotationChecker]: L13-1 has no Hoare annotation [2018-11-23 11:42:02,169 WARN L170 areAnnotationChecker]: L5 has no Hoare annotation [2018-11-23 11:42:02,169 WARN L170 areAnnotationChecker]: L5 has no Hoare annotation [2018-11-23 11:42:02,170 WARN L170 areAnnotationChecker]: L4-2 has no Hoare annotation [2018-11-23 11:42:02,170 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2018-11-23 11:42:02,170 WARN L170 areAnnotationChecker]: L13-1 has no Hoare annotation [2018-11-23 11:42:02,170 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2018-11-23 11:42:02,171 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2018-11-23 11:42:02,171 INFO L163 areAnnotationChecker]: CFG has 5 edges. 5 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2018-11-23 11:42:02,176 WARN L1272 BoogieBacktranslator]: Unfinished Backtranslation cannot identify Boogie2SMT function ~bvsle32 [2018-11-23 11:42:02,177 WARN L1272 BoogieBacktranslator]: Unfinished Backtranslation cannot identify Boogie2SMT function ~bvsle32 [2018-11-23 11:42:02,179 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 11:42:02 BoogieIcfgContainer [2018-11-23 11:42:02,179 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-23 11:42:02,180 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 11:42:02,180 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 11:42:02,180 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 11:42:02,181 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:58" (3/4) ... [2018-11-23 11:42:02,185 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-23 11:42:02,192 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-23 11:42:02,193 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-23 11:42:02,193 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2018-11-23 11:42:02,198 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2018-11-23 11:42:02,198 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2018-11-23 11:42:02,198 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-11-23 11:42:02,243 INFO L145 WitnessManager]: Wrote witness to /storage/repos/svcomp/c/loop-new/count_by_1_variant_true-unreach-call_true-termination.i-witness.graphml [2018-11-23 11:42:02,244 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 11:42:02,244 INFO L168 Benchmark]: Toolchain (without parser) took 4630.34 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 709.4 MB). Free memory was 1.4 GB in the beginning and 2.0 GB in the end (delta: -590.3 MB). Peak memory consumption was 119.1 MB. Max. memory is 7.1 GB. [2018-11-23 11:42:02,247 INFO L168 Benchmark]: CDTParser took 0.21 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:42:02,247 INFO L168 Benchmark]: CACSL2BoogieTranslator took 287.92 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:42:02,248 INFO L168 Benchmark]: Boogie Procedure Inliner took 25.51 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:42:02,248 INFO L168 Benchmark]: Boogie Preprocessor took 30.32 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:42:02,249 INFO L168 Benchmark]: RCFGBuilder took 544.67 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 709.4 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -766.6 MB). Peak memory consumption was 26.2 MB. Max. memory is 7.1 GB. [2018-11-23 11:42:02,250 INFO L168 Benchmark]: TraceAbstraction took 3673.63 ms. Allocated memory is still 2.2 GB. Free memory was 2.2 GB in the beginning and 2.0 GB in the end (delta: 152.3 MB). Peak memory consumption was 152.3 MB. Max. memory is 7.1 GB. [2018-11-23 11:42:02,251 INFO L168 Benchmark]: Witness Printer took 63.69 ms. Allocated memory is still 2.2 GB. Free memory was 2.0 GB in the beginning and 2.0 GB in the end (delta: 13.5 MB). Peak memory consumption was 13.5 MB. Max. memory is 7.1 GB. [2018-11-23 11:42:02,256 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.21 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 287.92 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 25.51 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 30.32 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 544.67 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 709.4 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -766.6 MB). Peak memory consumption was 26.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 3673.63 ms. Allocated memory is still 2.2 GB. Free memory was 2.2 GB in the beginning and 2.0 GB in the end (delta: 152.3 MB). Peak memory consumption was 152.3 MB. Max. memory is 7.1 GB. * Witness Printer took 63.69 ms. Allocated memory is still 2.2 GB. Free memory was 2.0 GB in the beginning and 2.0 GB in the end (delta: 13.5 MB). Peak memory consumption was 13.5 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation cannot identify Boogie2SMT function ~bvsle32 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation cannot identify Boogie2SMT function ~bvsle32 * 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:42:02,265 WARN L1272 BoogieBacktranslator]: Unfinished Backtranslation cannot identify Boogie2SMT function ~bvsle32 [2018-11-23 11:42:02,265 WARN L1272 BoogieBacktranslator]: Unfinished Backtranslation cannot identify Boogie2SMT function ~bvsle32 Derived loop invariant: NULL - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 19 locations, 1 error locations. SAFE Result, 3.5s OverallTime, 2 OverallIterations, 2 TraceHistogramMax, 1.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.5s HoareAnnotationTime, HoareTripleCheckerStatistics: 23 SDtfs, 12 SDslu, 73 SDs, 0 SdLazy, 66 SolverSat, 10 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 45 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=20occurred 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.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 1 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 10 PreInvPairs, 17 NumberOfFragments, 17 HoareAnnotationTreeSize, 10 FomulaSimplifications, 9 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 18 FormulaSimplificationTreeSizeReductionInter, 0.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 27 NumberOfCodeBlocks, 27 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 41 ConstructedInterpolants, 0 QuantifiedInterpolants, 1405 SizeOfPredicates, 4 NumberOfNonLiveVariables, 45 ConjunctsInSsa, 9 ConjunctsInUnsatCore, 3 InterpolantComputations, 1 PerfectInterpolantSequences, 4/8 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...