java -ea -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/loop-new/count_by_1_variant_true-unreach-call_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-18e5b2d-m [2018-11-19 00:07:36,004 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-19 00:07:36,006 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-19 00:07:36,021 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-19 00:07:36,022 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-19 00:07:36,023 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-19 00:07:36,024 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-19 00:07:36,026 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-19 00:07:36,028 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-19 00:07:36,029 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-19 00:07:36,030 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-19 00:07:36,030 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-19 00:07:36,031 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-19 00:07:36,032 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-19 00:07:36,033 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-19 00:07:36,034 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-19 00:07:36,036 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-19 00:07:36,043 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-19 00:07:36,045 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-19 00:07:36,049 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-19 00:07:36,050 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-19 00:07:36,053 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-19 00:07:36,058 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-19 00:07:36,058 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-19 00:07:36,058 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-19 00:07:36,059 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-19 00:07:36,061 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-19 00:07:36,061 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-19 00:07:36,062 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-19 00:07:36,067 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-19 00:07:36,067 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-19 00:07:36,069 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-19 00:07:36,069 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-19 00:07:36,069 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-19 00:07:36,070 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-19 00:07:36,071 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-19 00:07:36,072 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-19 00:07:36,100 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-19 00:07:36,100 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-19 00:07:36,101 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-19 00:07:36,101 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-19 00:07:36,102 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-19 00:07:36,103 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-19 00:07:36,103 INFO L133 SettingsManager]: * Use SBE=true [2018-11-19 00:07:36,103 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-19 00:07:36,103 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-19 00:07:36,103 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-19 00:07:36,104 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-19 00:07:36,104 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-19 00:07:36,104 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-19 00:07:36,104 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-19 00:07:36,104 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-19 00:07:36,105 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-19 00:07:36,106 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-19 00:07:36,106 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-19 00:07:36,106 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-19 00:07:36,107 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-19 00:07:36,107 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-19 00:07:36,107 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-19 00:07:36,107 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-19 00:07:36,107 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-19 00:07:36,107 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-19 00:07:36,108 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-19 00:07:36,108 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-19 00:07:36,108 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-19 00:07:36,108 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-19 00:07:36,109 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-19 00:07:36,109 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-19 00:07:36,177 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-19 00:07:36,190 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-19 00:07:36,194 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-19 00:07:36,195 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-19 00:07:36,196 INFO L276 PluginConnector]: CDTParser initialized [2018-11-19 00:07:36,197 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-19 00:07:36,266 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dc54b2126/91a00f699791461d83b35266c4313cd1/FLAG4406afd7d [2018-11-19 00:07:36,737 INFO L307 CDTParser]: Found 1 translation units. [2018-11-19 00:07:36,738 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-new/count_by_1_variant_true-unreach-call_true-termination.i [2018-11-19 00:07:36,748 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dc54b2126/91a00f699791461d83b35266c4313cd1/FLAG4406afd7d [2018-11-19 00:07:37,070 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dc54b2126/91a00f699791461d83b35266c4313cd1 [2018-11-19 00:07:37,081 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-19 00:07:37,082 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-11-19 00:07:37,084 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-19 00:07:37,084 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-19 00:07:37,089 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-19 00:07:37,090 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 12:07:37" (1/1) ... [2018-11-19 00:07:37,093 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2d18da53 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:07:37, skipping insertion in model container [2018-11-19 00:07:37,094 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 12:07:37" (1/1) ... [2018-11-19 00:07:37,104 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-19 00:07:37,129 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-19 00:07:37,339 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-19 00:07:37,344 INFO L191 MainTranslator]: Completed pre-run [2018-11-19 00:07:37,361 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-19 00:07:37,378 INFO L195 MainTranslator]: Completed translation [2018-11-19 00:07:37,379 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:07:37 WrapperNode [2018-11-19 00:07:37,379 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-19 00:07:37,381 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-19 00:07:37,381 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-19 00:07:37,381 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-19 00:07:37,396 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:07:37" (1/1) ... [2018-11-19 00:07:37,397 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:07:37" (1/1) ... [2018-11-19 00:07:37,401 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:07:37" (1/1) ... [2018-11-19 00:07:37,401 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:07:37" (1/1) ... [2018-11-19 00:07:37,406 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:07:37" (1/1) ... [2018-11-19 00:07:37,412 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:07:37" (1/1) ... [2018-11-19 00:07:37,414 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:07:37" (1/1) ... [2018-11-19 00:07:37,416 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-19 00:07:37,416 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-19 00:07:37,416 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-19 00:07:37,416 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-19 00:07:37,417 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:07:37" (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-19 00:07:37,548 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-19 00:07:37,549 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-19 00:07:37,549 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-19 00:07:37,549 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-19 00:07:37,549 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-19 00:07:37,549 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2018-11-19 00:07:37,550 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-19 00:07:37,550 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-11-19 00:07:37,550 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-19 00:07:37,550 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-19 00:07:37,550 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-19 00:07:38,066 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-19 00:07:38,067 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 12:07:38 BoogieIcfgContainer [2018-11-19 00:07:38,067 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-19 00:07:38,068 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-19 00:07:38,069 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-19 00:07:38,072 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-19 00:07:38,073 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 12:07:37" (1/3) ... [2018-11-19 00:07:38,074 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6546545f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 12:07:38, skipping insertion in model container [2018-11-19 00:07:38,074 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:07:37" (2/3) ... [2018-11-19 00:07:38,074 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6546545f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 12:07:38, skipping insertion in model container [2018-11-19 00:07:38,074 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 12:07:38" (3/3) ... [2018-11-19 00:07:38,079 INFO L112 eAbstractionObserver]: Analyzing ICFG count_by_1_variant_true-unreach-call_true-termination.i [2018-11-19 00:07:38,089 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-19 00:07:38,100 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-19 00:07:38,115 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-19 00:07:38,145 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-19 00:07:38,146 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-19 00:07:38,146 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-19 00:07:38,146 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-19 00:07:38,146 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-19 00:07:38,146 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-19 00:07:38,147 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-19 00:07:38,147 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-19 00:07:38,147 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-19 00:07:38,166 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states. [2018-11-19 00:07:38,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-11-19 00:07:38,172 INFO L367 BasicCegarLoop]: Found error trace [2018-11-19 00:07:38,173 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-19 00:07:38,176 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-19 00:07:38,181 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-19 00:07:38,181 INFO L82 PathProgramCache]: Analyzing trace with hash 1350619, now seen corresponding path program 1 times [2018-11-19 00:07:38,183 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-19 00:07:38,183 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-19 00:07:38,234 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-19 00:07:38,234 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-19 00:07:38,234 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-19 00:07:38,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-19 00:07:38,475 INFO L256 TraceCheckUtils]: 0: Hoare triple {23#true} call ULTIMATE.init(); {23#true} is VALID [2018-11-19 00:07:38,479 INFO L273 TraceCheckUtils]: 1: Hoare triple {23#true} assume true; {23#true} is VALID [2018-11-19 00:07:38,479 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {23#true} {23#true} #34#return; {23#true} is VALID [2018-11-19 00:07:38,480 INFO L256 TraceCheckUtils]: 3: Hoare triple {23#true} call #t~ret2 := main(); {23#true} is VALID [2018-11-19 00:07:38,481 INFO L273 TraceCheckUtils]: 4: Hoare triple {23#true} havoc ~i~0;~i~0 := 0; {25#(<= main_~i~0 0)} is VALID [2018-11-19 00:07:38,482 INFO L273 TraceCheckUtils]: 5: Hoare triple {25#(<= main_~i~0 0)} assume true; {25#(<= main_~i~0 0)} is VALID [2018-11-19 00:07:38,486 INFO L273 TraceCheckUtils]: 6: Hoare triple {25#(<= main_~i~0 0)} assume !!(1000000 != ~i~0); {25#(<= main_~i~0 0)} is VALID [2018-11-19 00:07:38,489 INFO L256 TraceCheckUtils]: 7: Hoare triple {25#(<= main_~i~0 0)} call __VERIFIER_assert((if ~i~0 <= 1000000 then 1 else 0)); {26#(= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2018-11-19 00:07:38,491 INFO L273 TraceCheckUtils]: 8: Hoare triple {26#(= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {27#(= 1 __VERIFIER_assert_~cond)} is VALID [2018-11-19 00:07:38,493 INFO L273 TraceCheckUtils]: 9: Hoare triple {27#(= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {24#false} is VALID [2018-11-19 00:07:38,493 INFO L273 TraceCheckUtils]: 10: Hoare triple {24#false} assume !false; {24#false} is VALID [2018-11-19 00:07:38,496 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-19 00:07:38,498 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-19 00:07:38,499 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-19 00:07:38,503 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2018-11-19 00:07:38,506 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-19 00:07:38,510 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-19 00:07:38,544 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-19 00:07:38,545 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-19 00:07:38,553 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-19 00:07:38,553 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-19 00:07:38,556 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 5 states. [2018-11-19 00:07:39,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-19 00:07:39,139 INFO L93 Difference]: Finished difference Result 43 states and 52 transitions. [2018-11-19 00:07:39,139 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-19 00:07:39,139 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2018-11-19 00:07:39,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-19 00:07:39,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-19 00:07:39,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 52 transitions. [2018-11-19 00:07:39,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-19 00:07:39,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 52 transitions. [2018-11-19 00:07:39,158 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 52 transitions. [2018-11-19 00:07:39,393 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-19 00:07:39,405 INFO L225 Difference]: With dead ends: 43 [2018-11-19 00:07:39,406 INFO L226 Difference]: Without dead ends: 23 [2018-11-19 00:07:39,409 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 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-19 00:07:39,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2018-11-19 00:07:39,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 22. [2018-11-19 00:07:39,458 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-19 00:07:39,459 INFO L82 GeneralOperation]: Start isEquivalent. First operand 23 states. Second operand 22 states. [2018-11-19 00:07:39,459 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand 22 states. [2018-11-19 00:07:39,460 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 22 states. [2018-11-19 00:07:39,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-19 00:07:39,464 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2018-11-19 00:07:39,464 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2018-11-19 00:07:39,465 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-19 00:07:39,465 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-19 00:07:39,466 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand 23 states. [2018-11-19 00:07:39,466 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 23 states. [2018-11-19 00:07:39,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-19 00:07:39,470 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2018-11-19 00:07:39,470 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2018-11-19 00:07:39,471 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-19 00:07:39,471 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-19 00:07:39,471 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-19 00:07:39,471 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-19 00:07:39,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-19 00:07:39,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 22 transitions. [2018-11-19 00:07:39,476 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 22 transitions. Word has length 11 [2018-11-19 00:07:39,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-19 00:07:39,477 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 22 transitions. [2018-11-19 00:07:39,477 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-19 00:07:39,477 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2018-11-19 00:07:39,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-19 00:07:39,478 INFO L367 BasicCegarLoop]: Found error trace [2018-11-19 00:07:39,479 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-19 00:07:39,479 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-19 00:07:39,479 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-19 00:07:39,480 INFO L82 PathProgramCache]: Analyzing trace with hash 1691970717, now seen corresponding path program 1 times [2018-11-19 00:07:39,480 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-19 00:07:39,480 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-19 00:07:39,481 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-19 00:07:39,482 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-19 00:07:39,482 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-19 00:07:39,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-19 00:07:39,769 INFO L256 TraceCheckUtils]: 0: Hoare triple {166#true} call ULTIMATE.init(); {166#true} is VALID [2018-11-19 00:07:39,770 INFO L273 TraceCheckUtils]: 1: Hoare triple {166#true} assume true; {166#true} is VALID [2018-11-19 00:07:39,770 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {166#true} {166#true} #34#return; {166#true} is VALID [2018-11-19 00:07:39,771 INFO L256 TraceCheckUtils]: 3: Hoare triple {166#true} call #t~ret2 := main(); {166#true} is VALID [2018-11-19 00:07:39,788 INFO L273 TraceCheckUtils]: 4: Hoare triple {166#true} havoc ~i~0;~i~0 := 0; {168#(<= main_~i~0 0)} is VALID [2018-11-19 00:07:39,797 INFO L273 TraceCheckUtils]: 5: Hoare triple {168#(<= main_~i~0 0)} assume true; {168#(<= main_~i~0 0)} is VALID [2018-11-19 00:07:39,810 INFO L273 TraceCheckUtils]: 6: Hoare triple {168#(<= main_~i~0 0)} assume !!(1000000 != ~i~0); {168#(<= main_~i~0 0)} is VALID [2018-11-19 00:07:39,810 INFO L256 TraceCheckUtils]: 7: Hoare triple {168#(<= main_~i~0 0)} call __VERIFIER_assert((if ~i~0 <= 1000000 then 1 else 0)); {166#true} is VALID [2018-11-19 00:07:39,820 INFO L273 TraceCheckUtils]: 8: Hoare triple {166#true} ~cond := #in~cond; {169#(= __VERIFIER_assert_~cond |__VERIFIER_assert_#in~cond|)} is VALID [2018-11-19 00:07:39,833 INFO L273 TraceCheckUtils]: 9: Hoare triple {169#(= __VERIFIER_assert_~cond |__VERIFIER_assert_#in~cond|)} assume !(0 == ~cond); {170#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2018-11-19 00:07:39,851 INFO L273 TraceCheckUtils]: 10: Hoare triple {170#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {170#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2018-11-19 00:07:39,860 INFO L268 TraceCheckUtils]: 11: Hoare quadruple {170#(not (= |__VERIFIER_assert_#in~cond| 0))} {168#(<= main_~i~0 0)} #38#return; {168#(<= main_~i~0 0)} is VALID [2018-11-19 00:07:39,874 INFO L273 TraceCheckUtils]: 12: Hoare triple {168#(<= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {171#(<= main_~i~0 1)} is VALID [2018-11-19 00:07:39,891 INFO L273 TraceCheckUtils]: 13: Hoare triple {171#(<= main_~i~0 1)} assume true; {171#(<= main_~i~0 1)} is VALID [2018-11-19 00:07:39,904 INFO L273 TraceCheckUtils]: 14: Hoare triple {171#(<= main_~i~0 1)} assume !!(1000000 != ~i~0); {171#(<= main_~i~0 1)} is VALID [2018-11-19 00:07:39,918 INFO L256 TraceCheckUtils]: 15: Hoare triple {171#(<= main_~i~0 1)} call __VERIFIER_assert((if ~i~0 <= 1000000 then 1 else 0)); {170#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2018-11-19 00:07:39,932 INFO L273 TraceCheckUtils]: 16: Hoare triple {170#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {172#(not (= __VERIFIER_assert_~cond 0))} is VALID [2018-11-19 00:07:39,945 INFO L273 TraceCheckUtils]: 17: Hoare triple {172#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {167#false} is VALID [2018-11-19 00:07:39,946 INFO L273 TraceCheckUtils]: 18: Hoare triple {167#false} assume !false; {167#false} is VALID [2018-11-19 00:07:39,950 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-19 00:07:39,950 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-19 00:07:39,954 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-19 00:07:39,972 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-19 00:07:40,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-19 00:07:40,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-19 00:07:40,027 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-19 00:07:40,247 INFO L256 TraceCheckUtils]: 0: Hoare triple {166#true} call ULTIMATE.init(); {166#true} is VALID [2018-11-19 00:07:40,247 INFO L273 TraceCheckUtils]: 1: Hoare triple {166#true} assume true; {166#true} is VALID [2018-11-19 00:07:40,247 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {166#true} {166#true} #34#return; {166#true} is VALID [2018-11-19 00:07:40,247 INFO L256 TraceCheckUtils]: 3: Hoare triple {166#true} call #t~ret2 := main(); {166#true} is VALID [2018-11-19 00:07:40,248 INFO L273 TraceCheckUtils]: 4: Hoare triple {166#true} havoc ~i~0;~i~0 := 0; {168#(<= main_~i~0 0)} is VALID [2018-11-19 00:07:40,250 INFO L273 TraceCheckUtils]: 5: Hoare triple {168#(<= main_~i~0 0)} assume true; {168#(<= main_~i~0 0)} is VALID [2018-11-19 00:07:40,250 INFO L273 TraceCheckUtils]: 6: Hoare triple {168#(<= main_~i~0 0)} assume !!(1000000 != ~i~0); {168#(<= main_~i~0 0)} is VALID [2018-11-19 00:07:40,250 INFO L256 TraceCheckUtils]: 7: Hoare triple {168#(<= main_~i~0 0)} call __VERIFIER_assert((if ~i~0 <= 1000000 then 1 else 0)); {166#true} is VALID [2018-11-19 00:07:40,251 INFO L273 TraceCheckUtils]: 8: Hoare triple {166#true} ~cond := #in~cond; {166#true} is VALID [2018-11-19 00:07:40,251 INFO L273 TraceCheckUtils]: 9: Hoare triple {166#true} assume !(0 == ~cond); {166#true} is VALID [2018-11-19 00:07:40,251 INFO L273 TraceCheckUtils]: 10: Hoare triple {166#true} assume true; {166#true} is VALID [2018-11-19 00:07:40,259 INFO L268 TraceCheckUtils]: 11: Hoare quadruple {166#true} {168#(<= main_~i~0 0)} #38#return; {168#(<= main_~i~0 0)} is VALID [2018-11-19 00:07:40,259 INFO L273 TraceCheckUtils]: 12: Hoare triple {168#(<= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {171#(<= main_~i~0 1)} is VALID [2018-11-19 00:07:40,260 INFO L273 TraceCheckUtils]: 13: Hoare triple {171#(<= main_~i~0 1)} assume true; {171#(<= main_~i~0 1)} is VALID [2018-11-19 00:07:40,260 INFO L273 TraceCheckUtils]: 14: Hoare triple {171#(<= main_~i~0 1)} assume !!(1000000 != ~i~0); {171#(<= main_~i~0 1)} is VALID [2018-11-19 00:07:40,261 INFO L256 TraceCheckUtils]: 15: Hoare triple {171#(<= main_~i~0 1)} call __VERIFIER_assert((if ~i~0 <= 1000000 then 1 else 0)); {221#(= |__VERIFIER_assert_#in~cond| 1)} is VALID [2018-11-19 00:07:40,262 INFO L273 TraceCheckUtils]: 16: Hoare triple {221#(= |__VERIFIER_assert_#in~cond| 1)} ~cond := #in~cond; {225#(= 1 __VERIFIER_assert_~cond)} is VALID [2018-11-19 00:07:40,263 INFO L273 TraceCheckUtils]: 17: Hoare triple {225#(= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {167#false} is VALID [2018-11-19 00:07:40,264 INFO L273 TraceCheckUtils]: 18: Hoare triple {167#false} assume !false; {167#false} is VALID [2018-11-19 00:07:40,266 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-19 00:07:40,287 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-19 00:07:40,287 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 9 [2018-11-19 00:07:40,288 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 19 [2018-11-19 00:07:40,289 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-19 00:07:40,289 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2018-11-19 00:07:40,373 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-19 00:07:40,373 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-19 00:07:40,373 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-19 00:07:40,373 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-11-19 00:07:40,374 INFO L87 Difference]: Start difference. First operand 22 states and 22 transitions. Second operand 9 states. [2018-11-19 00:07:41,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-19 00:07:41,003 INFO L93 Difference]: Finished difference Result 33 states and 33 transitions. [2018-11-19 00:07:41,003 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-19 00:07:41,004 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 19 [2018-11-19 00:07:41,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-19 00:07:41,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-19 00:07:41,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 30 transitions. [2018-11-19 00:07:41,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-19 00:07:41,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 30 transitions. [2018-11-19 00:07:41,013 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 30 transitions. [2018-11-19 00:07:41,133 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-19 00:07:41,135 INFO L225 Difference]: With dead ends: 33 [2018-11-19 00:07:41,135 INFO L226 Difference]: Without dead ends: 31 [2018-11-19 00:07:41,136 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2018-11-19 00:07:41,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-11-19 00:07:41,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 30. [2018-11-19 00:07:41,161 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-19 00:07:41,161 INFO L82 GeneralOperation]: Start isEquivalent. First operand 31 states. Second operand 30 states. [2018-11-19 00:07:41,162 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand 30 states. [2018-11-19 00:07:41,162 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 30 states. [2018-11-19 00:07:41,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-19 00:07:41,164 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2018-11-19 00:07:41,165 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2018-11-19 00:07:41,165 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-19 00:07:41,165 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-19 00:07:41,166 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand 31 states. [2018-11-19 00:07:41,166 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 31 states. [2018-11-19 00:07:41,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-19 00:07:41,169 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2018-11-19 00:07:41,169 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2018-11-19 00:07:41,170 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-19 00:07:41,170 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-19 00:07:41,170 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-19 00:07:41,170 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-19 00:07:41,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-19 00:07:41,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 30 transitions. [2018-11-19 00:07:41,173 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 30 transitions. Word has length 19 [2018-11-19 00:07:41,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-19 00:07:41,173 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 30 transitions. [2018-11-19 00:07:41,174 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-19 00:07:41,174 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2018-11-19 00:07:41,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-19 00:07:41,175 INFO L367 BasicCegarLoop]: Found error trace [2018-11-19 00:07:41,175 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-11-19 00:07:41,175 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-19 00:07:41,176 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-19 00:07:41,176 INFO L82 PathProgramCache]: Analyzing trace with hash -1146463393, now seen corresponding path program 2 times [2018-11-19 00:07:41,176 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-19 00:07:41,176 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-19 00:07:41,177 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-19 00:07:41,177 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-19 00:07:41,178 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-19 00:07:41,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-19 00:07:41,414 INFO L256 TraceCheckUtils]: 0: Hoare triple {386#true} call ULTIMATE.init(); {386#true} is VALID [2018-11-19 00:07:41,415 INFO L273 TraceCheckUtils]: 1: Hoare triple {386#true} assume true; {386#true} is VALID [2018-11-19 00:07:41,415 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {386#true} {386#true} #34#return; {386#true} is VALID [2018-11-19 00:07:41,416 INFO L256 TraceCheckUtils]: 3: Hoare triple {386#true} call #t~ret2 := main(); {386#true} is VALID [2018-11-19 00:07:41,420 INFO L273 TraceCheckUtils]: 4: Hoare triple {386#true} havoc ~i~0;~i~0 := 0; {388#(<= main_~i~0 0)} is VALID [2018-11-19 00:07:41,421 INFO L273 TraceCheckUtils]: 5: Hoare triple {388#(<= main_~i~0 0)} assume true; {388#(<= main_~i~0 0)} is VALID [2018-11-19 00:07:41,422 INFO L273 TraceCheckUtils]: 6: Hoare triple {388#(<= main_~i~0 0)} assume !!(1000000 != ~i~0); {388#(<= main_~i~0 0)} is VALID [2018-11-19 00:07:41,422 INFO L256 TraceCheckUtils]: 7: Hoare triple {388#(<= main_~i~0 0)} call __VERIFIER_assert((if ~i~0 <= 1000000 then 1 else 0)); {386#true} is VALID [2018-11-19 00:07:41,422 INFO L273 TraceCheckUtils]: 8: Hoare triple {386#true} ~cond := #in~cond; {389#(= __VERIFIER_assert_~cond |__VERIFIER_assert_#in~cond|)} is VALID [2018-11-19 00:07:41,423 INFO L273 TraceCheckUtils]: 9: Hoare triple {389#(= __VERIFIER_assert_~cond |__VERIFIER_assert_#in~cond|)} assume !(0 == ~cond); {390#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2018-11-19 00:07:41,424 INFO L273 TraceCheckUtils]: 10: Hoare triple {390#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {390#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2018-11-19 00:07:41,424 INFO L268 TraceCheckUtils]: 11: Hoare quadruple {390#(not (= |__VERIFIER_assert_#in~cond| 0))} {388#(<= main_~i~0 0)} #38#return; {386#true} is VALID [2018-11-19 00:07:41,425 INFO L273 TraceCheckUtils]: 12: Hoare triple {386#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {386#true} is VALID [2018-11-19 00:07:41,425 INFO L273 TraceCheckUtils]: 13: Hoare triple {386#true} assume true; {386#true} is VALID [2018-11-19 00:07:41,428 INFO L273 TraceCheckUtils]: 14: Hoare triple {386#true} assume !!(1000000 != ~i~0); {391#(not (= main_~i~0 1000000))} is VALID [2018-11-19 00:07:41,429 INFO L256 TraceCheckUtils]: 15: Hoare triple {391#(not (= main_~i~0 1000000))} call __VERIFIER_assert((if ~i~0 <= 1000000 then 1 else 0)); {386#true} is VALID [2018-11-19 00:07:41,433 INFO L273 TraceCheckUtils]: 16: Hoare triple {386#true} ~cond := #in~cond; {389#(= __VERIFIER_assert_~cond |__VERIFIER_assert_#in~cond|)} is VALID [2018-11-19 00:07:41,433 INFO L273 TraceCheckUtils]: 17: Hoare triple {389#(= __VERIFIER_assert_~cond |__VERIFIER_assert_#in~cond|)} assume !(0 == ~cond); {390#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2018-11-19 00:07:41,434 INFO L273 TraceCheckUtils]: 18: Hoare triple {390#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {390#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2018-11-19 00:07:41,435 INFO L268 TraceCheckUtils]: 19: Hoare quadruple {390#(not (= |__VERIFIER_assert_#in~cond| 0))} {391#(not (= main_~i~0 1000000))} #38#return; {392#(<= main_~i~0 999999)} is VALID [2018-11-19 00:07:41,435 INFO L273 TraceCheckUtils]: 20: Hoare triple {392#(<= main_~i~0 999999)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {393#(<= main_~i~0 1000000)} is VALID [2018-11-19 00:07:41,436 INFO L273 TraceCheckUtils]: 21: Hoare triple {393#(<= main_~i~0 1000000)} assume true; {393#(<= main_~i~0 1000000)} is VALID [2018-11-19 00:07:41,437 INFO L273 TraceCheckUtils]: 22: Hoare triple {393#(<= main_~i~0 1000000)} assume !!(1000000 != ~i~0); {393#(<= main_~i~0 1000000)} is VALID [2018-11-19 00:07:41,438 INFO L256 TraceCheckUtils]: 23: Hoare triple {393#(<= main_~i~0 1000000)} call __VERIFIER_assert((if ~i~0 <= 1000000 then 1 else 0)); {390#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2018-11-19 00:07:41,439 INFO L273 TraceCheckUtils]: 24: Hoare triple {390#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {394#(not (= __VERIFIER_assert_~cond 0))} is VALID [2018-11-19 00:07:41,440 INFO L273 TraceCheckUtils]: 25: Hoare triple {394#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {387#false} is VALID [2018-11-19 00:07:41,440 INFO L273 TraceCheckUtils]: 26: Hoare triple {387#false} assume !false; {387#false} is VALID [2018-11-19 00:07:41,442 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 5 proven. 9 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-19 00:07:41,442 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-19 00:07:41,442 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-19 00:07:41,451 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-19 00:07:41,486 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-19 00:07:41,486 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-19 00:07:41,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-19 00:07:41,505 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-19 00:07:41,662 INFO L256 TraceCheckUtils]: 0: Hoare triple {386#true} call ULTIMATE.init(); {386#true} is VALID [2018-11-19 00:07:41,662 INFO L273 TraceCheckUtils]: 1: Hoare triple {386#true} assume true; {386#true} is VALID [2018-11-19 00:07:41,663 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {386#true} {386#true} #34#return; {386#true} is VALID [2018-11-19 00:07:41,663 INFO L256 TraceCheckUtils]: 3: Hoare triple {386#true} call #t~ret2 := main(); {386#true} is VALID [2018-11-19 00:07:41,664 INFO L273 TraceCheckUtils]: 4: Hoare triple {386#true} havoc ~i~0;~i~0 := 0; {388#(<= main_~i~0 0)} is VALID [2018-11-19 00:07:41,665 INFO L273 TraceCheckUtils]: 5: Hoare triple {388#(<= main_~i~0 0)} assume true; {388#(<= main_~i~0 0)} is VALID [2018-11-19 00:07:41,665 INFO L273 TraceCheckUtils]: 6: Hoare triple {388#(<= main_~i~0 0)} assume !!(1000000 != ~i~0); {388#(<= main_~i~0 0)} is VALID [2018-11-19 00:07:41,666 INFO L256 TraceCheckUtils]: 7: Hoare triple {388#(<= main_~i~0 0)} call __VERIFIER_assert((if ~i~0 <= 1000000 then 1 else 0)); {386#true} is VALID [2018-11-19 00:07:41,666 INFO L273 TraceCheckUtils]: 8: Hoare triple {386#true} ~cond := #in~cond; {386#true} is VALID [2018-11-19 00:07:41,666 INFO L273 TraceCheckUtils]: 9: Hoare triple {386#true} assume !(0 == ~cond); {386#true} is VALID [2018-11-19 00:07:41,667 INFO L273 TraceCheckUtils]: 10: Hoare triple {386#true} assume true; {386#true} is VALID [2018-11-19 00:07:41,667 INFO L268 TraceCheckUtils]: 11: Hoare quadruple {386#true} {388#(<= main_~i~0 0)} #38#return; {388#(<= main_~i~0 0)} is VALID [2018-11-19 00:07:41,668 INFO L273 TraceCheckUtils]: 12: Hoare triple {388#(<= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {434#(<= main_~i~0 1)} is VALID [2018-11-19 00:07:41,669 INFO L273 TraceCheckUtils]: 13: Hoare triple {434#(<= main_~i~0 1)} assume true; {434#(<= main_~i~0 1)} is VALID [2018-11-19 00:07:41,669 INFO L273 TraceCheckUtils]: 14: Hoare triple {434#(<= main_~i~0 1)} assume !!(1000000 != ~i~0); {434#(<= main_~i~0 1)} is VALID [2018-11-19 00:07:41,669 INFO L256 TraceCheckUtils]: 15: Hoare triple {434#(<= main_~i~0 1)} call __VERIFIER_assert((if ~i~0 <= 1000000 then 1 else 0)); {386#true} is VALID [2018-11-19 00:07:41,670 INFO L273 TraceCheckUtils]: 16: Hoare triple {386#true} ~cond := #in~cond; {386#true} is VALID [2018-11-19 00:07:41,670 INFO L273 TraceCheckUtils]: 17: Hoare triple {386#true} assume !(0 == ~cond); {386#true} is VALID [2018-11-19 00:07:41,670 INFO L273 TraceCheckUtils]: 18: Hoare triple {386#true} assume true; {386#true} is VALID [2018-11-19 00:07:41,671 INFO L268 TraceCheckUtils]: 19: Hoare quadruple {386#true} {434#(<= main_~i~0 1)} #38#return; {434#(<= main_~i~0 1)} is VALID [2018-11-19 00:07:41,671 INFO L273 TraceCheckUtils]: 20: Hoare triple {434#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {459#(<= main_~i~0 2)} is VALID [2018-11-19 00:07:41,672 INFO L273 TraceCheckUtils]: 21: Hoare triple {459#(<= main_~i~0 2)} assume true; {459#(<= main_~i~0 2)} is VALID [2018-11-19 00:07:41,673 INFO L273 TraceCheckUtils]: 22: Hoare triple {459#(<= main_~i~0 2)} assume !!(1000000 != ~i~0); {459#(<= main_~i~0 2)} is VALID [2018-11-19 00:07:41,674 INFO L256 TraceCheckUtils]: 23: Hoare triple {459#(<= main_~i~0 2)} call __VERIFIER_assert((if ~i~0 <= 1000000 then 1 else 0)); {469#(= |__VERIFIER_assert_#in~cond| 1)} is VALID [2018-11-19 00:07:41,675 INFO L273 TraceCheckUtils]: 24: Hoare triple {469#(= |__VERIFIER_assert_#in~cond| 1)} ~cond := #in~cond; {473#(= 1 __VERIFIER_assert_~cond)} is VALID [2018-11-19 00:07:41,676 INFO L273 TraceCheckUtils]: 25: Hoare triple {473#(= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {387#false} is VALID [2018-11-19 00:07:41,676 INFO L273 TraceCheckUtils]: 26: Hoare triple {387#false} assume !false; {387#false} is VALID [2018-11-19 00:07:41,679 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-19 00:07:41,699 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-19 00:07:41,700 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7] total 13 [2018-11-19 00:07:41,700 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 27 [2018-11-19 00:07:41,701 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-19 00:07:41,701 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states. [2018-11-19 00:07:41,747 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-19 00:07:41,747 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-19 00:07:41,748 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-19 00:07:41,748 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2018-11-19 00:07:41,749 INFO L87 Difference]: Start difference. First operand 30 states and 30 transitions. Second operand 13 states. [2018-11-19 00:07:42,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-19 00:07:42,159 INFO L93 Difference]: Finished difference Result 37 states and 38 transitions. [2018-11-19 00:07:42,159 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-19 00:07:42,159 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 27 [2018-11-19 00:07:42,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-19 00:07:42,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-19 00:07:42,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 32 transitions. [2018-11-19 00:07:42,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-19 00:07:42,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 32 transitions. [2018-11-19 00:07:42,167 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 32 transitions. [2018-11-19 00:07:42,268 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-19 00:07:42,269 INFO L225 Difference]: With dead ends: 37 [2018-11-19 00:07:42,269 INFO L226 Difference]: Without dead ends: 0 [2018-11-19 00:07:42,270 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2018-11-19 00:07:42,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-19 00:07:42,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-19 00:07:42,271 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-19 00:07:42,271 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2018-11-19 00:07:42,271 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2018-11-19 00:07:42,272 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2018-11-19 00:07:42,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-19 00:07:42,272 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2018-11-19 00:07:42,272 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-19 00:07:42,273 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-19 00:07:42,273 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-19 00:07:42,273 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2018-11-19 00:07:42,273 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2018-11-19 00:07:42,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-19 00:07:42,274 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2018-11-19 00:07:42,274 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-19 00:07:42,274 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-19 00:07:42,274 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-19 00:07:42,274 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-19 00:07:42,275 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-19 00:07:42,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-19 00:07:42,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-19 00:07:42,275 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 27 [2018-11-19 00:07:42,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-19 00:07:42,276 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-19 00:07:42,276 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-19 00:07:42,276 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-19 00:07:42,276 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-19 00:07:42,281 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-19 00:07:42,361 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2018-11-19 00:07:42,361 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-19 00:07:42,361 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-19 00:07:42,361 INFO L428 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-11-19 00:07:42,361 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-19 00:07:42,361 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-19 00:07:42,361 INFO L428 ceAbstractionStarter]: At program point mainENTRY(lines 10 16) the Hoare annotation is: true [2018-11-19 00:07:42,361 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 10 16) no Hoare annotation was computed. [2018-11-19 00:07:42,362 INFO L421 ceAbstractionStarter]: At program point L13(line 13) the Hoare annotation is: (<= main_~i~0 999999) [2018-11-19 00:07:42,362 INFO L425 ceAbstractionStarter]: For program point mainFINAL(lines 10 16) no Hoare annotation was computed. [2018-11-19 00:07:42,362 INFO L425 ceAbstractionStarter]: For program point L13-1(lines 12 14) no Hoare annotation was computed. [2018-11-19 00:07:42,362 INFO L425 ceAbstractionStarter]: For program point L12-1(lines 12 14) no Hoare annotation was computed. [2018-11-19 00:07:42,362 INFO L421 ceAbstractionStarter]: At program point L12-3(lines 12 14) the Hoare annotation is: (<= main_~i~0 1000000) [2018-11-19 00:07:42,362 INFO L425 ceAbstractionStarter]: For program point L12-4(lines 12 14) no Hoare annotation was computed. [2018-11-19 00:07:42,362 INFO L425 ceAbstractionStarter]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2018-11-19 00:07:42,362 INFO L428 ceAbstractionStarter]: At program point __VERIFIER_assertENTRY(lines 3 8) the Hoare annotation is: true [2018-11-19 00:07:42,363 INFO L425 ceAbstractionStarter]: For program point __VERIFIER_assertEXIT(lines 3 8) no Hoare annotation was computed. [2018-11-19 00:07:42,363 INFO L425 ceAbstractionStarter]: For program point L5(line 5) no Hoare annotation was computed. [2018-11-19 00:07:42,363 INFO L425 ceAbstractionStarter]: For program point L4(lines 4 6) no Hoare annotation was computed. [2018-11-19 00:07:42,363 INFO L425 ceAbstractionStarter]: For program point L4-2(lines 3 8) no Hoare annotation was computed. [2018-11-19 00:07:42,364 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2018-11-19 00:07:42,365 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2018-11-19 00:07:42,365 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2018-11-19 00:07:42,365 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2018-11-19 00:07:42,365 WARN L170 areAnnotationChecker]: L12-1 has no Hoare annotation [2018-11-19 00:07:42,365 WARN L170 areAnnotationChecker]: L12-4 has no Hoare annotation [2018-11-19 00:07:42,366 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2018-11-19 00:07:42,366 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2018-11-19 00:07:42,366 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2018-11-19 00:07:42,366 WARN L170 areAnnotationChecker]: L12-1 has no Hoare annotation [2018-11-19 00:07:42,366 WARN L170 areAnnotationChecker]: L12-1 has no Hoare annotation [2018-11-19 00:07:42,366 WARN L170 areAnnotationChecker]: L12-4 has no Hoare annotation [2018-11-19 00:07:42,366 WARN L170 areAnnotationChecker]: L5 has no Hoare annotation [2018-11-19 00:07:42,366 WARN L170 areAnnotationChecker]: L5 has no Hoare annotation [2018-11-19 00:07:42,366 WARN L170 areAnnotationChecker]: L4-2 has no Hoare annotation [2018-11-19 00:07:42,366 WARN L170 areAnnotationChecker]: L13-1 has no Hoare annotation [2018-11-19 00:07:42,367 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2018-11-19 00:07:42,367 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2018-11-19 00:07:42,367 WARN L170 areAnnotationChecker]: L13-1 has no Hoare annotation [2018-11-19 00:07:42,367 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2018-11-19 00:07:42,367 INFO L163 areAnnotationChecker]: CFG has 4 edges. 4 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2018-11-19 00:07:42,374 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 12:07:42 BoogieIcfgContainer [2018-11-19 00:07:42,374 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-19 00:07:42,375 INFO L168 Benchmark]: Toolchain (without parser) took 5294.07 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 718.3 MB). Free memory was 1.4 GB in the beginning and 1.9 GB in the end (delta: -490.0 MB). Peak memory consumption was 228.3 MB. Max. memory is 7.1 GB. [2018-11-19 00:07:42,377 INFO L168 Benchmark]: CDTParser took 0.20 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-19 00:07:42,378 INFO L168 Benchmark]: CACSL2BoogieTranslator took 296.98 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-19 00:07:42,379 INFO L168 Benchmark]: Boogie Preprocessor took 34.95 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-19 00:07:42,380 INFO L168 Benchmark]: RCFGBuilder took 650.77 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 718.3 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -768.7 MB). Peak memory consumption was 26.1 MB. Max. memory is 7.1 GB. [2018-11-19 00:07:42,381 INFO L168 Benchmark]: TraceAbstraction took 4306.50 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: 268.1 MB). Peak memory consumption was 268.1 MB. Max. memory is 7.1 GB. [2018-11-19 00:07:42,385 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.20 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.98 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 34.95 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 650.77 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 718.3 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -768.7 MB). Peak memory consumption was 26.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 4306.50 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: 268.1 MB). Peak memory consumption was 268.1 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 5]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 12]: Loop Invariant Derived loop invariant: i <= 1000000 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 20 locations, 1 error locations. SAFE Result, 4.2s OverallTime, 3 OverallIterations, 3 TraceHistogramMax, 2.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 33 SDtfs, 37 SDslu, 146 SDs, 0 SdLazy, 128 SolverSat, 23 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 75 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=30occurred in iteration=2, 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, 3 MinimizatonAttempts, 2 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 11 PreInvPairs, 20 NumberOfFragments, 11 HoareAnnotationTreeSize, 11 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 23 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 103 NumberOfCodeBlocks, 103 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 98 ConstructedInterpolants, 0 QuantifiedInterpolants, 4718 SizeOfPredicates, 4 NumberOfNonLiveVariables, 85 ConjunctsInSsa, 17 ConjunctsInUnsatCore, 5 InterpolantComputations, 1 PerfectInterpolantSequences, 20/46 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...