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_Default.epf -i ../../../trunk/examples/svcomp/loop-lit/cggmp2005b_true-unreach-call_true-termination.c.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-61f4311 [2018-11-23 13:12:18,554 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 13:12:18,558 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 13:12:18,571 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 13:12:18,572 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 13:12:18,574 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 13:12:18,576 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 13:12:18,579 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 13:12:18,580 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 13:12:18,582 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 13:12:18,584 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 13:12:18,585 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 13:12:18,586 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 13:12:18,587 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 13:12:18,588 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 13:12:18,589 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 13:12:18,589 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 13:12:18,591 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 13:12:18,593 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 13:12:18,595 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 13:12:18,596 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 13:12:18,597 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 13:12:18,600 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 13:12:18,600 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 13:12:18,600 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 13:12:18,601 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 13:12:18,603 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 13:12:18,604 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 13:12:18,605 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 13:12:18,606 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 13:12:18,606 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 13:12:18,610 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 13:12:18,610 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 13:12:18,610 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 13:12:18,611 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 13:12:18,613 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 13:12:18,614 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-23 13:12:18,638 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 13:12:18,639 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 13:12:18,640 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 13:12:18,640 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 13:12:18,641 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 13:12:18,641 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 13:12:18,641 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 13:12:18,642 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 13:12:18,643 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 13:12:18,643 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 13:12:18,643 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 13:12:18,643 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 13:12:18,643 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 13:12:18,644 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 13:12:18,644 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 13:12:18,644 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 13:12:18,644 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 13:12:18,644 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 13:12:18,645 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 13:12:18,645 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 13:12:18,645 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 13:12:18,645 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 13:12:18,645 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 13:12:18,646 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 13:12:18,646 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 13:12:18,646 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 13:12:18,646 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 13:12:18,646 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 13:12:18,647 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 13:12:18,648 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 13:12:18,649 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 13:12:18,712 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 13:12:18,724 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 13:12:18,731 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 13:12:18,732 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 13:12:18,733 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 13:12:18,734 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-lit/cggmp2005b_true-unreach-call_true-termination.c.i [2018-11-23 13:12:18,798 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8730bae72/7a91f1c39c5d437999a5300e87146ad2/FLAG452ae77d2 [2018-11-23 13:12:19,234 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 13:12:19,235 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-lit/cggmp2005b_true-unreach-call_true-termination.c.i [2018-11-23 13:12:19,241 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8730bae72/7a91f1c39c5d437999a5300e87146ad2/FLAG452ae77d2 [2018-11-23 13:12:19,619 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8730bae72/7a91f1c39c5d437999a5300e87146ad2 [2018-11-23 13:12:19,630 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 13:12:19,632 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 13:12:19,633 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 13:12:19,633 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 13:12:19,638 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 13:12:19,640 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 01:12:19" (1/1) ... [2018-11-23 13:12:19,643 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@31990919 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:12:19, skipping insertion in model container [2018-11-23 13:12:19,643 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 01:12:19" (1/1) ... [2018-11-23 13:12:19,654 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 13:12:19,686 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 13:12:19,940 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 13:12:19,947 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 13:12:19,970 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 13:12:19,984 INFO L195 MainTranslator]: Completed translation [2018-11-23 13:12:19,985 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:12:19 WrapperNode [2018-11-23 13:12:19,985 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 13:12:19,986 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 13:12:19,986 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 13:12:19,986 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 13:12:19,996 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:12:19" (1/1) ... [2018-11-23 13:12:20,000 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:12:19" (1/1) ... [2018-11-23 13:12:20,006 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 13:12:20,006 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 13:12:20,007 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 13:12:20,007 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 13:12:20,015 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:12:19" (1/1) ... [2018-11-23 13:12:20,015 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:12:19" (1/1) ... [2018-11-23 13:12:20,015 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:12:19" (1/1) ... [2018-11-23 13:12:20,016 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:12:19" (1/1) ... [2018-11-23 13:12:20,021 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:12:19" (1/1) ... [2018-11-23 13:12:20,028 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:12:19" (1/1) ... [2018-11-23 13:12:20,029 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:12:19" (1/1) ... [2018-11-23 13:12:20,031 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 13:12:20,031 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 13:12:20,031 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 13:12:20,032 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 13:12:20,033 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:12:19" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 13:12:20,163 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 13:12:20,163 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 13:12:20,163 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 13:12:20,163 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 13:12:20,163 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 13:12:20,164 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 13:12:20,164 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-23 13:12:20,164 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-23 13:12:20,647 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 13:12:20,647 INFO L280 CfgBuilder]: Removed 3 assue(true) statements. [2018-11-23 13:12:20,648 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:12:20 BoogieIcfgContainer [2018-11-23 13:12:20,648 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 13:12:20,649 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 13:12:20,649 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 13:12:20,652 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 13:12:20,653 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 01:12:19" (1/3) ... [2018-11-23 13:12:20,654 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6070ab8a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 01:12:20, skipping insertion in model container [2018-11-23 13:12:20,654 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:12:19" (2/3) ... [2018-11-23 13:12:20,655 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6070ab8a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 01:12:20, skipping insertion in model container [2018-11-23 13:12:20,655 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:12:20" (3/3) ... [2018-11-23 13:12:20,657 INFO L112 eAbstractionObserver]: Analyzing ICFG cggmp2005b_true-unreach-call_true-termination.c.i [2018-11-23 13:12:20,666 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 13:12:20,675 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 13:12:20,693 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 13:12:20,727 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 13:12:20,728 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 13:12:20,728 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 13:12:20,728 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 13:12:20,730 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 13:12:20,730 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 13:12:20,730 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 13:12:20,730 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 13:12:20,731 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 13:12:20,750 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states. [2018-11-23 13:12:20,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-11-23 13:12:20,756 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:12:20,757 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:12:20,760 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:12:20,769 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:12:20,770 INFO L82 PathProgramCache]: Analyzing trace with hash 728031169, now seen corresponding path program 1 times [2018-11-23 13:12:20,772 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:12:20,773 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:12:20,825 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:12:20,825 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:12:20,825 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:12:20,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:12:20,930 INFO L256 TraceCheckUtils]: 0: Hoare triple {24#true} call ULTIMATE.init(); {24#true} is VALID [2018-11-23 13:12:20,934 INFO L273 TraceCheckUtils]: 1: Hoare triple {24#true} assume true; {24#true} is VALID [2018-11-23 13:12:20,935 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {24#true} {24#true} #57#return; {24#true} is VALID [2018-11-23 13:12:20,935 INFO L256 TraceCheckUtils]: 3: Hoare triple {24#true} call #t~ret1 := main(); {24#true} is VALID [2018-11-23 13:12:20,936 INFO L273 TraceCheckUtils]: 4: Hoare triple {24#true} havoc ~i~0;havoc ~j~0;havoc ~k~0;~i~0 := 0;~k~0 := 9;~j~0 := -100; {24#true} is VALID [2018-11-23 13:12:20,938 INFO L273 TraceCheckUtils]: 5: Hoare triple {24#true} assume !true; {25#false} is VALID [2018-11-23 13:12:20,938 INFO L256 TraceCheckUtils]: 6: Hoare triple {25#false} call __VERIFIER_assert((if 4 == ~k~0 then 1 else 0)); {25#false} is VALID [2018-11-23 13:12:20,938 INFO L273 TraceCheckUtils]: 7: Hoare triple {25#false} ~cond := #in~cond; {25#false} is VALID [2018-11-23 13:12:20,939 INFO L273 TraceCheckUtils]: 8: Hoare triple {25#false} assume 0 == ~cond; {25#false} is VALID [2018-11-23 13:12:20,939 INFO L273 TraceCheckUtils]: 9: Hoare triple {25#false} assume !false; {25#false} is VALID [2018-11-23 13:12:20,942 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 13:12:20,944 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 13:12:20,944 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 13:12:20,949 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2018-11-23 13:12:20,952 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:12:20,955 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-23 13:12:21,005 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 13:12:21,005 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-23 13:12:21,014 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 13:12:21,015 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 13:12:21,017 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 2 states. [2018-11-23 13:12:21,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:12:21,110 INFO L93 Difference]: Finished difference Result 37 states and 50 transitions. [2018-11-23 13:12:21,110 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 13:12:21,110 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2018-11-23 13:12:21,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:12:21,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 13:12:21,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 50 transitions. [2018-11-23 13:12:21,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 13:12:21,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 50 transitions. [2018-11-23 13:12:21,127 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 50 transitions. [2018-11-23 13:12:21,474 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:12:21,485 INFO L225 Difference]: With dead ends: 37 [2018-11-23 13:12:21,485 INFO L226 Difference]: Without dead ends: 14 [2018-11-23 13:12:21,489 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 13:12:21,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2018-11-23 13:12:21,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2018-11-23 13:12:21,531 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:12:21,532 INFO L82 GeneralOperation]: Start isEquivalent. First operand 14 states. Second operand 14 states. [2018-11-23 13:12:21,532 INFO L74 IsIncluded]: Start isIncluded. First operand 14 states. Second operand 14 states. [2018-11-23 13:12:21,532 INFO L87 Difference]: Start difference. First operand 14 states. Second operand 14 states. [2018-11-23 13:12:21,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:12:21,535 INFO L93 Difference]: Finished difference Result 14 states and 16 transitions. [2018-11-23 13:12:21,536 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 16 transitions. [2018-11-23 13:12:21,536 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:12:21,536 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:12:21,536 INFO L74 IsIncluded]: Start isIncluded. First operand 14 states. Second operand 14 states. [2018-11-23 13:12:21,536 INFO L87 Difference]: Start difference. First operand 14 states. Second operand 14 states. [2018-11-23 13:12:21,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:12:21,539 INFO L93 Difference]: Finished difference Result 14 states and 16 transitions. [2018-11-23 13:12:21,540 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 16 transitions. [2018-11-23 13:12:21,540 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:12:21,540 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:12:21,540 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:12:21,541 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:12:21,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-23 13:12:21,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 16 transitions. [2018-11-23 13:12:21,544 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 16 transitions. Word has length 10 [2018-11-23 13:12:21,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:12:21,545 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 16 transitions. [2018-11-23 13:12:21,545 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-23 13:12:21,545 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 16 transitions. [2018-11-23 13:12:21,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-11-23 13:12:21,546 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:12:21,546 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:12:21,546 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:12:21,547 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:12:21,547 INFO L82 PathProgramCache]: Analyzing trace with hash 701249060, now seen corresponding path program 1 times [2018-11-23 13:12:21,547 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:12:21,547 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:12:21,548 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:12:21,548 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:12:21,548 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:12:21,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:12:21,635 INFO L256 TraceCheckUtils]: 0: Hoare triple {130#true} call ULTIMATE.init(); {130#true} is VALID [2018-11-23 13:12:21,636 INFO L273 TraceCheckUtils]: 1: Hoare triple {130#true} assume true; {130#true} is VALID [2018-11-23 13:12:21,636 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {130#true} {130#true} #57#return; {130#true} is VALID [2018-11-23 13:12:21,636 INFO L256 TraceCheckUtils]: 3: Hoare triple {130#true} call #t~ret1 := main(); {130#true} is VALID [2018-11-23 13:12:21,654 INFO L273 TraceCheckUtils]: 4: Hoare triple {130#true} havoc ~i~0;havoc ~j~0;havoc ~k~0;~i~0 := 0;~k~0 := 9;~j~0 := -100; {132#(<= main_~i~0 0)} is VALID [2018-11-23 13:12:21,662 INFO L273 TraceCheckUtils]: 5: Hoare triple {132#(<= main_~i~0 0)} assume !(~i~0 <= 100); {131#false} is VALID [2018-11-23 13:12:21,662 INFO L256 TraceCheckUtils]: 6: Hoare triple {131#false} call __VERIFIER_assert((if 4 == ~k~0 then 1 else 0)); {131#false} is VALID [2018-11-23 13:12:21,663 INFO L273 TraceCheckUtils]: 7: Hoare triple {131#false} ~cond := #in~cond; {131#false} is VALID [2018-11-23 13:12:21,663 INFO L273 TraceCheckUtils]: 8: Hoare triple {131#false} assume 0 == ~cond; {131#false} is VALID [2018-11-23 13:12:21,663 INFO L273 TraceCheckUtils]: 9: Hoare triple {131#false} assume !false; {131#false} is VALID [2018-11-23 13:12:21,664 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 13:12:21,664 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 13:12:21,664 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 13:12:21,666 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2018-11-23 13:12:21,666 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:12:21,667 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 13:12:21,746 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 13:12:21,746 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 13:12:21,747 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 13:12:21,747 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 13:12:21,747 INFO L87 Difference]: Start difference. First operand 14 states and 16 transitions. Second operand 3 states. [2018-11-23 13:12:21,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:12:21,909 INFO L93 Difference]: Finished difference Result 20 states and 22 transitions. [2018-11-23 13:12:21,913 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 13:12:21,914 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2018-11-23 13:12:21,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:12:21,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 13:12:21,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 22 transitions. [2018-11-23 13:12:21,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 13:12:21,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 22 transitions. [2018-11-23 13:12:21,918 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 22 transitions. [2018-11-23 13:12:21,988 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:12:21,989 INFO L225 Difference]: With dead ends: 20 [2018-11-23 13:12:21,989 INFO L226 Difference]: Without dead ends: 15 [2018-11-23 13:12:21,990 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 13:12:21,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2018-11-23 13:12:22,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2018-11-23 13:12:22,018 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:12:22,018 INFO L82 GeneralOperation]: Start isEquivalent. First operand 15 states. Second operand 15 states. [2018-11-23 13:12:22,018 INFO L74 IsIncluded]: Start isIncluded. First operand 15 states. Second operand 15 states. [2018-11-23 13:12:22,018 INFO L87 Difference]: Start difference. First operand 15 states. Second operand 15 states. [2018-11-23 13:12:22,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:12:22,020 INFO L93 Difference]: Finished difference Result 15 states and 17 transitions. [2018-11-23 13:12:22,020 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 17 transitions. [2018-11-23 13:12:22,021 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:12:22,021 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:12:22,021 INFO L74 IsIncluded]: Start isIncluded. First operand 15 states. Second operand 15 states. [2018-11-23 13:12:22,022 INFO L87 Difference]: Start difference. First operand 15 states. Second operand 15 states. [2018-11-23 13:12:22,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:12:22,023 INFO L93 Difference]: Finished difference Result 15 states and 17 transitions. [2018-11-23 13:12:22,024 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 17 transitions. [2018-11-23 13:12:22,024 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:12:22,024 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:12:22,024 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:12:22,024 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:12:22,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-23 13:12:22,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 17 transitions. [2018-11-23 13:12:22,026 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 17 transitions. Word has length 10 [2018-11-23 13:12:22,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:12:22,027 INFO L480 AbstractCegarLoop]: Abstraction has 15 states and 17 transitions. [2018-11-23 13:12:22,027 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 13:12:22,027 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 17 transitions. [2018-11-23 13:12:22,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-11-23 13:12:22,028 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:12:22,028 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:12:22,028 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:12:22,029 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:12:22,029 INFO L82 PathProgramCache]: Analyzing trace with hash 1130211510, now seen corresponding path program 1 times [2018-11-23 13:12:22,029 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:12:22,029 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:12:22,031 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:12:22,031 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:12:22,031 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:12:22,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:12:22,268 INFO L256 TraceCheckUtils]: 0: Hoare triple {222#true} call ULTIMATE.init(); {222#true} is VALID [2018-11-23 13:12:22,269 INFO L273 TraceCheckUtils]: 1: Hoare triple {222#true} assume true; {222#true} is VALID [2018-11-23 13:12:22,269 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {222#true} {222#true} #57#return; {222#true} is VALID [2018-11-23 13:12:22,270 INFO L256 TraceCheckUtils]: 3: Hoare triple {222#true} call #t~ret1 := main(); {222#true} is VALID [2018-11-23 13:12:22,289 INFO L273 TraceCheckUtils]: 4: Hoare triple {222#true} havoc ~i~0;havoc ~j~0;havoc ~k~0;~i~0 := 0;~k~0 := 9;~j~0 := -100; {224#(<= (+ main_~j~0 100) 0)} is VALID [2018-11-23 13:12:22,298 INFO L273 TraceCheckUtils]: 5: Hoare triple {224#(<= (+ main_~j~0 100) 0)} assume !!(~i~0 <= 100);~i~0 := 1 + ~i~0; {224#(<= (+ main_~j~0 100) 0)} is VALID [2018-11-23 13:12:22,311 INFO L273 TraceCheckUtils]: 6: Hoare triple {224#(<= (+ main_~j~0 100) 0)} assume !(~j~0 < 20); {223#false} is VALID [2018-11-23 13:12:22,312 INFO L273 TraceCheckUtils]: 7: Hoare triple {223#false} ~k~0 := 4; {223#false} is VALID [2018-11-23 13:12:22,312 INFO L273 TraceCheckUtils]: 8: Hoare triple {223#false} assume !(~k~0 <= 3); {223#false} is VALID [2018-11-23 13:12:22,312 INFO L273 TraceCheckUtils]: 9: Hoare triple {223#false} assume !(~i~0 <= 100); {223#false} is VALID [2018-11-23 13:12:22,313 INFO L256 TraceCheckUtils]: 10: Hoare triple {223#false} call __VERIFIER_assert((if 4 == ~k~0 then 1 else 0)); {223#false} is VALID [2018-11-23 13:12:22,313 INFO L273 TraceCheckUtils]: 11: Hoare triple {223#false} ~cond := #in~cond; {223#false} is VALID [2018-11-23 13:12:22,313 INFO L273 TraceCheckUtils]: 12: Hoare triple {223#false} assume 0 == ~cond; {223#false} is VALID [2018-11-23 13:12:22,313 INFO L273 TraceCheckUtils]: 13: Hoare triple {223#false} assume !false; {223#false} is VALID [2018-11-23 13:12:22,315 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:12:22,315 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 13:12:22,315 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 13:12:22,316 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2018-11-23 13:12:22,316 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:12:22,316 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 13:12:22,390 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:12:22,390 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 13:12:22,391 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 13:12:22,391 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 13:12:22,392 INFO L87 Difference]: Start difference. First operand 15 states and 17 transitions. Second operand 3 states. [2018-11-23 13:12:22,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:12:22,466 INFO L93 Difference]: Finished difference Result 25 states and 30 transitions. [2018-11-23 13:12:22,466 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 13:12:22,466 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2018-11-23 13:12:22,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:12:22,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 13:12:22,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 30 transitions. [2018-11-23 13:12:22,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 13:12:22,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 30 transitions. [2018-11-23 13:12:22,471 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 30 transitions. [2018-11-23 13:12:22,717 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-23 13:12:22,719 INFO L225 Difference]: With dead ends: 25 [2018-11-23 13:12:22,719 INFO L226 Difference]: Without dead ends: 16 [2018-11-23 13:12:22,719 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 13:12:22,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2018-11-23 13:12:22,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2018-11-23 13:12:22,874 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:12:22,874 INFO L82 GeneralOperation]: Start isEquivalent. First operand 16 states. Second operand 16 states. [2018-11-23 13:12:22,874 INFO L74 IsIncluded]: Start isIncluded. First operand 16 states. Second operand 16 states. [2018-11-23 13:12:22,875 INFO L87 Difference]: Start difference. First operand 16 states. Second operand 16 states. [2018-11-23 13:12:22,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:12:22,877 INFO L93 Difference]: Finished difference Result 16 states and 18 transitions. [2018-11-23 13:12:22,877 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 18 transitions. [2018-11-23 13:12:22,878 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:12:22,878 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:12:22,878 INFO L74 IsIncluded]: Start isIncluded. First operand 16 states. Second operand 16 states. [2018-11-23 13:12:22,878 INFO L87 Difference]: Start difference. First operand 16 states. Second operand 16 states. [2018-11-23 13:12:22,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:12:22,880 INFO L93 Difference]: Finished difference Result 16 states and 18 transitions. [2018-11-23 13:12:22,880 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 18 transitions. [2018-11-23 13:12:22,880 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:12:22,881 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:12:22,881 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:12:22,881 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:12:22,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-23 13:12:22,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 18 transitions. [2018-11-23 13:12:22,883 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 18 transitions. Word has length 14 [2018-11-23 13:12:22,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:12:22,883 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 18 transitions. [2018-11-23 13:12:22,883 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 13:12:22,884 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 18 transitions. [2018-11-23 13:12:22,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-23 13:12:22,884 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:12:22,884 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:12:22,885 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:12:22,885 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:12:22,885 INFO L82 PathProgramCache]: Analyzing trace with hash -1842576314, now seen corresponding path program 1 times [2018-11-23 13:12:22,885 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:12:22,885 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:12:22,886 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:12:22,887 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:12:22,887 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:12:22,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:12:22,955 INFO L256 TraceCheckUtils]: 0: Hoare triple {327#true} call ULTIMATE.init(); {327#true} is VALID [2018-11-23 13:12:22,955 INFO L273 TraceCheckUtils]: 1: Hoare triple {327#true} assume true; {327#true} is VALID [2018-11-23 13:12:22,956 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {327#true} {327#true} #57#return; {327#true} is VALID [2018-11-23 13:12:22,956 INFO L256 TraceCheckUtils]: 3: Hoare triple {327#true} call #t~ret1 := main(); {327#true} is VALID [2018-11-23 13:12:22,956 INFO L273 TraceCheckUtils]: 4: Hoare triple {327#true} havoc ~i~0;havoc ~j~0;havoc ~k~0;~i~0 := 0;~k~0 := 9;~j~0 := -100; {329#(<= main_~i~0 0)} is VALID [2018-11-23 13:12:22,958 INFO L273 TraceCheckUtils]: 5: Hoare triple {329#(<= main_~i~0 0)} assume !!(~i~0 <= 100);~i~0 := 1 + ~i~0; {330#(<= main_~i~0 1)} is VALID [2018-11-23 13:12:22,959 INFO L273 TraceCheckUtils]: 6: Hoare triple {330#(<= main_~i~0 1)} assume !!(~j~0 < 20);~j~0 := ~i~0 + ~j~0; {330#(<= main_~i~0 1)} is VALID [2018-11-23 13:12:22,961 INFO L273 TraceCheckUtils]: 7: Hoare triple {330#(<= main_~i~0 1)} assume !(~j~0 < 20); {330#(<= main_~i~0 1)} is VALID [2018-11-23 13:12:22,961 INFO L273 TraceCheckUtils]: 8: Hoare triple {330#(<= main_~i~0 1)} ~k~0 := 4; {330#(<= main_~i~0 1)} is VALID [2018-11-23 13:12:22,964 INFO L273 TraceCheckUtils]: 9: Hoare triple {330#(<= main_~i~0 1)} assume !(~k~0 <= 3); {330#(<= main_~i~0 1)} is VALID [2018-11-23 13:12:22,965 INFO L273 TraceCheckUtils]: 10: Hoare triple {330#(<= main_~i~0 1)} assume !(~i~0 <= 100); {328#false} is VALID [2018-11-23 13:12:22,965 INFO L256 TraceCheckUtils]: 11: Hoare triple {328#false} call __VERIFIER_assert((if 4 == ~k~0 then 1 else 0)); {328#false} is VALID [2018-11-23 13:12:22,966 INFO L273 TraceCheckUtils]: 12: Hoare triple {328#false} ~cond := #in~cond; {328#false} is VALID [2018-11-23 13:12:22,966 INFO L273 TraceCheckUtils]: 13: Hoare triple {328#false} assume 0 == ~cond; {328#false} is VALID [2018-11-23 13:12:22,966 INFO L273 TraceCheckUtils]: 14: Hoare triple {328#false} assume !false; {328#false} is VALID [2018-11-23 13:12:22,968 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 13:12:22,968 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:12:22,968 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-23 13:12:22,981 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:12:22,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:12:23,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:12:23,012 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:12:23,111 INFO L256 TraceCheckUtils]: 0: Hoare triple {327#true} call ULTIMATE.init(); {327#true} is VALID [2018-11-23 13:12:23,112 INFO L273 TraceCheckUtils]: 1: Hoare triple {327#true} assume true; {327#true} is VALID [2018-11-23 13:12:23,112 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {327#true} {327#true} #57#return; {327#true} is VALID [2018-11-23 13:12:23,112 INFO L256 TraceCheckUtils]: 3: Hoare triple {327#true} call #t~ret1 := main(); {327#true} is VALID [2018-11-23 13:12:23,116 INFO L273 TraceCheckUtils]: 4: Hoare triple {327#true} havoc ~i~0;havoc ~j~0;havoc ~k~0;~i~0 := 0;~k~0 := 9;~j~0 := -100; {329#(<= main_~i~0 0)} is VALID [2018-11-23 13:12:23,117 INFO L273 TraceCheckUtils]: 5: Hoare triple {329#(<= main_~i~0 0)} assume !!(~i~0 <= 100);~i~0 := 1 + ~i~0; {330#(<= main_~i~0 1)} is VALID [2018-11-23 13:12:23,119 INFO L273 TraceCheckUtils]: 6: Hoare triple {330#(<= main_~i~0 1)} assume !!(~j~0 < 20);~j~0 := ~i~0 + ~j~0; {330#(<= main_~i~0 1)} is VALID [2018-11-23 13:12:23,122 INFO L273 TraceCheckUtils]: 7: Hoare triple {330#(<= main_~i~0 1)} assume !(~j~0 < 20); {330#(<= main_~i~0 1)} is VALID [2018-11-23 13:12:23,122 INFO L273 TraceCheckUtils]: 8: Hoare triple {330#(<= main_~i~0 1)} ~k~0 := 4; {330#(<= main_~i~0 1)} is VALID [2018-11-23 13:12:23,123 INFO L273 TraceCheckUtils]: 9: Hoare triple {330#(<= main_~i~0 1)} assume !(~k~0 <= 3); {330#(<= main_~i~0 1)} is VALID [2018-11-23 13:12:23,124 INFO L273 TraceCheckUtils]: 10: Hoare triple {330#(<= main_~i~0 1)} assume !(~i~0 <= 100); {328#false} is VALID [2018-11-23 13:12:23,124 INFO L256 TraceCheckUtils]: 11: Hoare triple {328#false} call __VERIFIER_assert((if 4 == ~k~0 then 1 else 0)); {328#false} is VALID [2018-11-23 13:12:23,124 INFO L273 TraceCheckUtils]: 12: Hoare triple {328#false} ~cond := #in~cond; {328#false} is VALID [2018-11-23 13:12:23,124 INFO L273 TraceCheckUtils]: 13: Hoare triple {328#false} assume 0 == ~cond; {328#false} is VALID [2018-11-23 13:12:23,125 INFO L273 TraceCheckUtils]: 14: Hoare triple {328#false} assume !false; {328#false} is VALID [2018-11-23 13:12:23,126 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 13:12:23,146 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:12:23,146 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2018-11-23 13:12:23,147 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2018-11-23 13:12:23,147 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:12:23,147 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2018-11-23 13:12:23,166 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:12:23,166 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 13:12:23,167 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 13:12:23,167 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-23 13:12:23,167 INFO L87 Difference]: Start difference. First operand 16 states and 18 transitions. Second operand 4 states. [2018-11-23 13:12:23,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:12:23,367 INFO L93 Difference]: Finished difference Result 25 states and 29 transitions. [2018-11-23 13:12:23,367 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 13:12:23,368 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2018-11-23 13:12:23,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:12:23,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 13:12:23,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 28 transitions. [2018-11-23 13:12:23,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 13:12:23,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 28 transitions. [2018-11-23 13:12:23,372 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 28 transitions. [2018-11-23 13:12:23,552 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:12:23,553 INFO L225 Difference]: With dead ends: 25 [2018-11-23 13:12:23,553 INFO L226 Difference]: Without dead ends: 20 [2018-11-23 13:12:23,556 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-23 13:12:23,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2018-11-23 13:12:23,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2018-11-23 13:12:23,606 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:12:23,606 INFO L82 GeneralOperation]: Start isEquivalent. First operand 20 states. Second operand 20 states. [2018-11-23 13:12:23,606 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states. Second operand 20 states. [2018-11-23 13:12:23,607 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 20 states. [2018-11-23 13:12:23,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:12:23,610 INFO L93 Difference]: Finished difference Result 20 states and 24 transitions. [2018-11-23 13:12:23,610 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 24 transitions. [2018-11-23 13:12:23,610 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:12:23,610 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:12:23,611 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states. Second operand 20 states. [2018-11-23 13:12:23,611 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 20 states. [2018-11-23 13:12:23,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:12:23,613 INFO L93 Difference]: Finished difference Result 20 states and 24 transitions. [2018-11-23 13:12:23,613 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 24 transitions. [2018-11-23 13:12:23,614 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:12:23,614 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:12:23,614 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:12:23,614 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:12:23,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-23 13:12:23,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 24 transitions. [2018-11-23 13:12:23,616 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 24 transitions. Word has length 15 [2018-11-23 13:12:23,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:12:23,616 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 24 transitions. [2018-11-23 13:12:23,617 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 13:12:23,617 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 24 transitions. [2018-11-23 13:12:23,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-23 13:12:23,618 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:12:23,618 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:12:23,618 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:12:23,618 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:12:23,619 INFO L82 PathProgramCache]: Analyzing trace with hash -926542376, now seen corresponding path program 2 times [2018-11-23 13:12:23,619 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:12:23,619 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:12:23,622 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:12:23,623 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:12:23,623 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:12:23,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:12:23,769 INFO L256 TraceCheckUtils]: 0: Hoare triple {490#true} call ULTIMATE.init(); {490#true} is VALID [2018-11-23 13:12:23,769 INFO L273 TraceCheckUtils]: 1: Hoare triple {490#true} assume true; {490#true} is VALID [2018-11-23 13:12:23,770 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {490#true} {490#true} #57#return; {490#true} is VALID [2018-11-23 13:12:23,770 INFO L256 TraceCheckUtils]: 3: Hoare triple {490#true} call #t~ret1 := main(); {490#true} is VALID [2018-11-23 13:12:23,771 INFO L273 TraceCheckUtils]: 4: Hoare triple {490#true} havoc ~i~0;havoc ~j~0;havoc ~k~0;~i~0 := 0;~k~0 := 9;~j~0 := -100; {492#(<= (+ main_~j~0 100) 0)} is VALID [2018-11-23 13:12:23,771 INFO L273 TraceCheckUtils]: 5: Hoare triple {492#(<= (+ main_~j~0 100) 0)} assume !!(~i~0 <= 100);~i~0 := 1 + ~i~0; {492#(<= (+ main_~j~0 100) 0)} is VALID [2018-11-23 13:12:23,772 INFO L273 TraceCheckUtils]: 6: Hoare triple {492#(<= (+ main_~j~0 100) 0)} assume !!(~j~0 < 20);~j~0 := ~i~0 + ~j~0; {493#(<= (+ main_~j~0 100) main_~i~0)} is VALID [2018-11-23 13:12:23,773 INFO L273 TraceCheckUtils]: 7: Hoare triple {493#(<= (+ main_~j~0 100) main_~i~0)} assume !(~j~0 < 20); {494#(<= 120 main_~i~0)} is VALID [2018-11-23 13:12:23,773 INFO L273 TraceCheckUtils]: 8: Hoare triple {494#(<= 120 main_~i~0)} ~k~0 := 4; {494#(<= 120 main_~i~0)} is VALID [2018-11-23 13:12:23,774 INFO L273 TraceCheckUtils]: 9: Hoare triple {494#(<= 120 main_~i~0)} assume !(~k~0 <= 3); {494#(<= 120 main_~i~0)} is VALID [2018-11-23 13:12:23,775 INFO L273 TraceCheckUtils]: 10: Hoare triple {494#(<= 120 main_~i~0)} assume !!(~i~0 <= 100);~i~0 := 1 + ~i~0; {491#false} is VALID [2018-11-23 13:12:23,775 INFO L273 TraceCheckUtils]: 11: Hoare triple {491#false} assume !(~j~0 < 20); {491#false} is VALID [2018-11-23 13:12:23,776 INFO L273 TraceCheckUtils]: 12: Hoare triple {491#false} ~k~0 := 4; {491#false} is VALID [2018-11-23 13:12:23,776 INFO L273 TraceCheckUtils]: 13: Hoare triple {491#false} assume !(~k~0 <= 3); {491#false} is VALID [2018-11-23 13:12:23,776 INFO L273 TraceCheckUtils]: 14: Hoare triple {491#false} assume !(~i~0 <= 100); {491#false} is VALID [2018-11-23 13:12:23,777 INFO L256 TraceCheckUtils]: 15: Hoare triple {491#false} call __VERIFIER_assert((if 4 == ~k~0 then 1 else 0)); {491#false} is VALID [2018-11-23 13:12:23,777 INFO L273 TraceCheckUtils]: 16: Hoare triple {491#false} ~cond := #in~cond; {491#false} is VALID [2018-11-23 13:12:23,778 INFO L273 TraceCheckUtils]: 17: Hoare triple {491#false} assume 0 == ~cond; {491#false} is VALID [2018-11-23 13:12:23,778 INFO L273 TraceCheckUtils]: 18: Hoare triple {491#false} assume !false; {491#false} is VALID [2018-11-23 13:12:23,779 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:12:23,780 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:12:23,780 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-23 13:12:23,795 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 13:12:23,836 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 13:12:23,836 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:12:23,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:12:23,852 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:12:24,016 INFO L256 TraceCheckUtils]: 0: Hoare triple {490#true} call ULTIMATE.init(); {490#true} is VALID [2018-11-23 13:12:24,017 INFO L273 TraceCheckUtils]: 1: Hoare triple {490#true} assume true; {490#true} is VALID [2018-11-23 13:12:24,017 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {490#true} {490#true} #57#return; {490#true} is VALID [2018-11-23 13:12:24,017 INFO L256 TraceCheckUtils]: 3: Hoare triple {490#true} call #t~ret1 := main(); {490#true} is VALID [2018-11-23 13:12:24,022 INFO L273 TraceCheckUtils]: 4: Hoare triple {490#true} havoc ~i~0;havoc ~j~0;havoc ~k~0;~i~0 := 0;~k~0 := 9;~j~0 := -100; {492#(<= (+ main_~j~0 100) 0)} is VALID [2018-11-23 13:12:24,023 INFO L273 TraceCheckUtils]: 5: Hoare triple {492#(<= (+ main_~j~0 100) 0)} assume !!(~i~0 <= 100);~i~0 := 1 + ~i~0; {513#(and (<= (+ main_~j~0 100) 0) (<= main_~i~0 101))} is VALID [2018-11-23 13:12:24,024 INFO L273 TraceCheckUtils]: 6: Hoare triple {513#(and (<= (+ main_~j~0 100) 0) (<= main_~i~0 101))} assume !!(~j~0 < 20);~j~0 := ~i~0 + ~j~0; {517#(<= main_~j~0 1)} is VALID [2018-11-23 13:12:24,024 INFO L273 TraceCheckUtils]: 7: Hoare triple {517#(<= main_~j~0 1)} assume !(~j~0 < 20); {491#false} is VALID [2018-11-23 13:12:24,025 INFO L273 TraceCheckUtils]: 8: Hoare triple {491#false} ~k~0 := 4; {491#false} is VALID [2018-11-23 13:12:24,025 INFO L273 TraceCheckUtils]: 9: Hoare triple {491#false} assume !(~k~0 <= 3); {491#false} is VALID [2018-11-23 13:12:24,025 INFO L273 TraceCheckUtils]: 10: Hoare triple {491#false} assume !!(~i~0 <= 100);~i~0 := 1 + ~i~0; {491#false} is VALID [2018-11-23 13:12:24,025 INFO L273 TraceCheckUtils]: 11: Hoare triple {491#false} assume !(~j~0 < 20); {491#false} is VALID [2018-11-23 13:12:24,025 INFO L273 TraceCheckUtils]: 12: Hoare triple {491#false} ~k~0 := 4; {491#false} is VALID [2018-11-23 13:12:24,026 INFO L273 TraceCheckUtils]: 13: Hoare triple {491#false} assume !(~k~0 <= 3); {491#false} is VALID [2018-11-23 13:12:24,026 INFO L273 TraceCheckUtils]: 14: Hoare triple {491#false} assume !(~i~0 <= 100); {491#false} is VALID [2018-11-23 13:12:24,026 INFO L256 TraceCheckUtils]: 15: Hoare triple {491#false} call __VERIFIER_assert((if 4 == ~k~0 then 1 else 0)); {491#false} is VALID [2018-11-23 13:12:24,026 INFO L273 TraceCheckUtils]: 16: Hoare triple {491#false} ~cond := #in~cond; {491#false} is VALID [2018-11-23 13:12:24,027 INFO L273 TraceCheckUtils]: 17: Hoare triple {491#false} assume 0 == ~cond; {491#false} is VALID [2018-11-23 13:12:24,027 INFO L273 TraceCheckUtils]: 18: Hoare triple {491#false} assume !false; {491#false} is VALID [2018-11-23 13:12:24,028 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-23 13:12:24,048 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:12:24,048 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2018-11-23 13:12:24,048 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2018-11-23 13:12:24,049 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:12:24,049 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2018-11-23 13:12:24,130 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 13:12:24,130 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-23 13:12:24,130 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-23 13:12:24,130 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-11-23 13:12:24,131 INFO L87 Difference]: Start difference. First operand 20 states and 24 transitions. Second operand 7 states. [2018-11-23 13:12:24,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:12:24,376 INFO L93 Difference]: Finished difference Result 33 states and 41 transitions. [2018-11-23 13:12:24,376 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 13:12:24,376 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2018-11-23 13:12:24,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:12:24,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-23 13:12:24,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 31 transitions. [2018-11-23 13:12:24,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-23 13:12:24,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 31 transitions. [2018-11-23 13:12:24,380 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 31 transitions. [2018-11-23 13:12:24,474 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:12:24,474 INFO L225 Difference]: With dead ends: 33 [2018-11-23 13:12:24,475 INFO L226 Difference]: Without dead ends: 21 [2018-11-23 13:12:24,475 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2018-11-23 13:12:24,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2018-11-23 13:12:24,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2018-11-23 13:12:24,503 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:12:24,503 INFO L82 GeneralOperation]: Start isEquivalent. First operand 21 states. Second operand 21 states. [2018-11-23 13:12:24,503 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states. Second operand 21 states. [2018-11-23 13:12:24,503 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 21 states. [2018-11-23 13:12:24,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:12:24,505 INFO L93 Difference]: Finished difference Result 21 states and 25 transitions. [2018-11-23 13:12:24,505 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2018-11-23 13:12:24,506 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:12:24,506 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:12:24,506 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states. Second operand 21 states. [2018-11-23 13:12:24,506 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 21 states. [2018-11-23 13:12:24,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:12:24,508 INFO L93 Difference]: Finished difference Result 21 states and 25 transitions. [2018-11-23 13:12:24,508 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2018-11-23 13:12:24,509 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:12:24,509 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:12:24,509 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:12:24,509 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:12:24,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-23 13:12:24,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2018-11-23 13:12:24,511 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 25 transitions. Word has length 19 [2018-11-23 13:12:24,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:12:24,511 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 25 transitions. [2018-11-23 13:12:24,512 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-23 13:12:24,512 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2018-11-23 13:12:24,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-23 13:12:24,513 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:12:24,513 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:12:24,513 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:12:24,513 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:12:24,514 INFO L82 PathProgramCache]: Analyzing trace with hash 901903432, now seen corresponding path program 3 times [2018-11-23 13:12:24,514 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:12:24,514 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:12:24,515 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:12:24,515 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:12:24,515 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:12:24,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:12:24,677 INFO L256 TraceCheckUtils]: 0: Hoare triple {690#true} call ULTIMATE.init(); {690#true} is VALID [2018-11-23 13:12:24,678 INFO L273 TraceCheckUtils]: 1: Hoare triple {690#true} assume true; {690#true} is VALID [2018-11-23 13:12:24,678 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {690#true} {690#true} #57#return; {690#true} is VALID [2018-11-23 13:12:24,678 INFO L256 TraceCheckUtils]: 3: Hoare triple {690#true} call #t~ret1 := main(); {690#true} is VALID [2018-11-23 13:12:24,679 INFO L273 TraceCheckUtils]: 4: Hoare triple {690#true} havoc ~i~0;havoc ~j~0;havoc ~k~0;~i~0 := 0;~k~0 := 9;~j~0 := -100; {690#true} is VALID [2018-11-23 13:12:24,679 INFO L273 TraceCheckUtils]: 5: Hoare triple {690#true} assume !!(~i~0 <= 100);~i~0 := 1 + ~i~0; {690#true} is VALID [2018-11-23 13:12:24,680 INFO L273 TraceCheckUtils]: 6: Hoare triple {690#true} assume !!(~j~0 < 20);~j~0 := ~i~0 + ~j~0; {690#true} is VALID [2018-11-23 13:12:24,680 INFO L273 TraceCheckUtils]: 7: Hoare triple {690#true} assume !!(~j~0 < 20);~j~0 := ~i~0 + ~j~0; {690#true} is VALID [2018-11-23 13:12:24,681 INFO L273 TraceCheckUtils]: 8: Hoare triple {690#true} assume !(~j~0 < 20); {690#true} is VALID [2018-11-23 13:12:24,681 INFO L273 TraceCheckUtils]: 9: Hoare triple {690#true} ~k~0 := 4; {690#true} is VALID [2018-11-23 13:12:24,681 INFO L273 TraceCheckUtils]: 10: Hoare triple {690#true} assume !(~k~0 <= 3); {690#true} is VALID [2018-11-23 13:12:24,682 INFO L273 TraceCheckUtils]: 11: Hoare triple {690#true} assume !!(~i~0 <= 100);~i~0 := 1 + ~i~0; {690#true} is VALID [2018-11-23 13:12:24,682 INFO L273 TraceCheckUtils]: 12: Hoare triple {690#true} assume !(~j~0 < 20); {690#true} is VALID [2018-11-23 13:12:24,685 INFO L273 TraceCheckUtils]: 13: Hoare triple {690#true} ~k~0 := 4; {692#(= main_~k~0 4)} is VALID [2018-11-23 13:12:24,686 INFO L273 TraceCheckUtils]: 14: Hoare triple {692#(= main_~k~0 4)} assume !(~k~0 <= 3); {692#(= main_~k~0 4)} is VALID [2018-11-23 13:12:24,686 INFO L273 TraceCheckUtils]: 15: Hoare triple {692#(= main_~k~0 4)} assume !(~i~0 <= 100); {692#(= main_~k~0 4)} is VALID [2018-11-23 13:12:24,687 INFO L256 TraceCheckUtils]: 16: Hoare triple {692#(= main_~k~0 4)} call __VERIFIER_assert((if 4 == ~k~0 then 1 else 0)); {693#(= |__VERIFIER_assert_#in~cond| 1)} is VALID [2018-11-23 13:12:24,688 INFO L273 TraceCheckUtils]: 17: Hoare triple {693#(= |__VERIFIER_assert_#in~cond| 1)} ~cond := #in~cond; {694#(= __VERIFIER_assert_~cond 1)} is VALID [2018-11-23 13:12:24,688 INFO L273 TraceCheckUtils]: 18: Hoare triple {694#(= __VERIFIER_assert_~cond 1)} assume 0 == ~cond; {691#false} is VALID [2018-11-23 13:12:24,688 INFO L273 TraceCheckUtils]: 19: Hoare triple {691#false} assume !false; {691#false} is VALID [2018-11-23 13:12:24,690 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-11-23 13:12:24,690 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 13:12:24,690 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 13:12:24,691 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2018-11-23 13:12:24,691 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:12:24,691 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-23 13:12:24,728 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:12:24,728 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 13:12:24,729 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 13:12:24,729 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 13:12:24,729 INFO L87 Difference]: Start difference. First operand 21 states and 25 transitions. Second operand 5 states. [2018-11-23 13:12:24,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:12:24,857 INFO L93 Difference]: Finished difference Result 30 states and 38 transitions. [2018-11-23 13:12:24,858 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 13:12:24,858 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2018-11-23 13:12:24,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:12:24,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 13:12:24,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 30 transitions. [2018-11-23 13:12:24,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 13:12:24,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 30 transitions. [2018-11-23 13:12:24,863 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 30 transitions. [2018-11-23 13:12:24,959 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-23 13:12:24,959 INFO L225 Difference]: With dead ends: 30 [2018-11-23 13:12:24,959 INFO L226 Difference]: Without dead ends: 0 [2018-11-23 13:12:24,960 INFO L631 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-23 13:12:24,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-23 13:12:24,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-23 13:12:24,961 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:12:24,961 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2018-11-23 13:12:24,961 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2018-11-23 13:12:24,961 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2018-11-23 13:12:24,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:12:24,962 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2018-11-23 13:12:24,962 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-23 13:12:24,962 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:12:24,962 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:12:24,962 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2018-11-23 13:12:24,962 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2018-11-23 13:12:24,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:12:24,963 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2018-11-23 13:12:24,963 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-23 13:12:24,963 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:12:24,963 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:12:24,963 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:12:24,963 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:12:24,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-23 13:12:24,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-23 13:12:24,964 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 20 [2018-11-23 13:12:24,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:12:24,964 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 13:12:24,964 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 13:12:24,964 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-23 13:12:24,964 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:12:24,969 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-23 13:12:25,080 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2018-11-23 13:12:25,080 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-23 13:12:25,080 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-23 13:12:25,080 INFO L451 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-11-23 13:12:25,081 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-23 13:12:25,081 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-23 13:12:25,081 INFO L448 ceAbstractionStarter]: For program point L25(line 25) no Hoare annotation was computed. [2018-11-23 13:12:25,081 INFO L448 ceAbstractionStarter]: For program point mainEXIT(lines 10 27) no Hoare annotation was computed. [2018-11-23 13:12:25,081 INFO L444 ceAbstractionStarter]: At program point L21-2(lines 21 23) the Hoare annotation is: (= main_~k~0 4) [2018-11-23 13:12:25,082 INFO L444 ceAbstractionStarter]: At program point L21-3(lines 15 24) the Hoare annotation is: (or (= main_~k~0 4) (and (<= (+ main_~j~0 100) main_~i~0) (<= main_~i~0 0))) [2018-11-23 13:12:25,082 INFO L444 ceAbstractionStarter]: At program point L17-2(lines 17 19) the Hoare annotation is: (or (= main_~k~0 4) (<= main_~i~0 1)) [2018-11-23 13:12:25,082 INFO L448 ceAbstractionStarter]: For program point L17-3(lines 17 19) no Hoare annotation was computed. [2018-11-23 13:12:25,082 INFO L444 ceAbstractionStarter]: At program point L15-2(lines 15 24) the Hoare annotation is: (= main_~k~0 4) [2018-11-23 13:12:25,083 INFO L448 ceAbstractionStarter]: For program point mainFINAL(lines 10 27) no Hoare annotation was computed. [2018-11-23 13:12:25,083 INFO L451 ceAbstractionStarter]: At program point mainENTRY(lines 10 27) the Hoare annotation is: true [2018-11-23 13:12:25,083 INFO L451 ceAbstractionStarter]: At program point __VERIFIER_assertENTRY(lines 3 8) the Hoare annotation is: true [2018-11-23 13:12:25,083 INFO L448 ceAbstractionStarter]: For program point __VERIFIER_assertEXIT(lines 3 8) no Hoare annotation was computed. [2018-11-23 13:12:25,083 INFO L448 ceAbstractionStarter]: For program point L5(line 5) no Hoare annotation was computed. [2018-11-23 13:12:25,083 INFO L448 ceAbstractionStarter]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2018-11-23 13:12:25,083 INFO L448 ceAbstractionStarter]: For program point L4(lines 4 6) no Hoare annotation was computed. [2018-11-23 13:12:25,084 INFO L448 ceAbstractionStarter]: For program point L4-2(lines 3 8) no Hoare annotation was computed. [2018-11-23 13:12:25,085 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2018-11-23 13:12:25,092 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2018-11-23 13:12:25,092 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2018-11-23 13:12:25,093 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2018-11-23 13:12:25,099 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2018-11-23 13:12:25,099 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2018-11-23 13:12:25,099 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2018-11-23 13:12:25,099 WARN L170 areAnnotationChecker]: L25 has no Hoare annotation [2018-11-23 13:12:25,099 WARN L170 areAnnotationChecker]: L17-3 has no Hoare annotation [2018-11-23 13:12:25,099 WARN L170 areAnnotationChecker]: L17-3 has no Hoare annotation [2018-11-23 13:12:25,100 WARN L170 areAnnotationChecker]: L5 has no Hoare annotation [2018-11-23 13:12:25,100 WARN L170 areAnnotationChecker]: L5 has no Hoare annotation [2018-11-23 13:12:25,100 WARN L170 areAnnotationChecker]: L4-2 has no Hoare annotation [2018-11-23 13:12:25,100 WARN L170 areAnnotationChecker]: L25 has no Hoare annotation [2018-11-23 13:12:25,100 WARN L170 areAnnotationChecker]: L17-3 has no Hoare annotation [2018-11-23 13:12:25,101 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2018-11-23 13:12:25,101 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2018-11-23 13:12:25,104 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2018-11-23 13:12:25,104 INFO L163 areAnnotationChecker]: CFG has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2018-11-23 13:12:25,116 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 01:12:25 BoogieIcfgContainer [2018-11-23 13:12:25,116 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-23 13:12:25,116 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 13:12:25,117 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 13:12:25,117 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 13:12:25,117 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:12:20" (3/4) ... [2018-11-23 13:12:25,121 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-23 13:12:25,127 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-23 13:12:25,127 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-23 13:12:25,127 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2018-11-23 13:12:25,132 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2018-11-23 13:12:25,132 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2018-11-23 13:12:25,132 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-11-23 13:12:25,186 INFO L145 WitnessManager]: Wrote witness to /storage/repos/svcomp/c/loop-lit/cggmp2005b_true-unreach-call_true-termination.c.i-witness.graphml [2018-11-23 13:12:25,187 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 13:12:25,188 INFO L168 Benchmark]: Toolchain (without parser) took 5557.66 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 715.1 MB). Free memory was 1.4 GB in the beginning and 1.9 GB in the end (delta: -510.1 MB). Peak memory consumption was 205.1 MB. Max. memory is 7.1 GB. [2018-11-23 13:12:25,190 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-23 13:12:25,191 INFO L168 Benchmark]: CACSL2BoogieTranslator took 352.96 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 13:12:25,192 INFO L168 Benchmark]: Boogie Procedure Inliner took 20.18 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 13:12:25,194 INFO L168 Benchmark]: Boogie Preprocessor took 24.42 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 13:12:25,194 INFO L168 Benchmark]: RCFGBuilder took 617.02 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 715.1 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -764.8 MB). Peak memory consumption was 26.5 MB. Max. memory is 7.1 GB. [2018-11-23 13:12:25,200 INFO L168 Benchmark]: TraceAbstraction took 4467.06 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: 244.2 MB). Peak memory consumption was 244.2 MB. Max. memory is 7.1 GB. [2018-11-23 13:12:25,201 INFO L168 Benchmark]: Witness Printer took 70.22 ms. Allocated memory is still 2.2 GB. Free memory is still 1.9 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-23 13:12:25,204 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - GenericResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.24 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 352.96 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 20.18 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 24.42 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 617.02 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 715.1 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -764.8 MB). Peak memory consumption was 26.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 4467.06 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: 244.2 MB). Peak memory consumption was 244.2 MB. Max. memory is 7.1 GB. * Witness Printer took 70.22 ms. Allocated memory is still 2.2 GB. Free memory is still 1.9 GB. There was no memory consumed. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.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: 15]: Loop Invariant Derived loop invariant: k == 4 || (j + 100 <= i && i <= 0) - InvariantResult [Line: 21]: Loop Invariant Derived loop invariant: k == 4 - InvariantResult [Line: 17]: Loop Invariant Derived loop invariant: k == 4 || i <= 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 21 locations, 1 error locations. SAFE Result, 4.3s OverallTime, 6 OverallIterations, 2 TraceHistogramMax, 2.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.1s HoareAnnotationTime, HoareTripleCheckerStatistics: 96 SDtfs, 5 SDslu, 133 SDs, 0 SdLazy, 38 SolverSat, 6 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 57 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=21occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 6 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 9 LocationsWithAnnotation, 15 PreInvPairs, 25 NumberOfFragments, 31 HoareAnnotationTreeSize, 15 FomulaSimplifications, 44 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 9 FomulaSimplificationsInter, 8 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 122 NumberOfCodeBlocks, 122 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 114 ConstructedInterpolants, 0 QuantifiedInterpolants, 2956 SizeOfPredicates, 3 NumberOfNonLiveVariables, 79 ConjunctsInSsa, 8 ConjunctsInUnsatCore, 8 InterpolantComputations, 4 PerfectInterpolantSequences, 27/32 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...