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/afnp2014_true-unreach-call_true-termination.c.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-61f4311 [2018-11-23 13:12:12,654 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 13:12:12,656 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 13:12:12,669 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 13:12:12,670 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 13:12:12,671 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 13:12:12,673 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 13:12:12,677 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 13:12:12,678 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 13:12:12,679 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 13:12:12,680 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 13:12:12,681 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 13:12:12,682 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 13:12:12,683 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 13:12:12,684 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 13:12:12,685 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 13:12:12,686 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 13:12:12,687 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 13:12:12,690 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 13:12:12,691 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 13:12:12,692 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 13:12:12,695 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 13:12:12,698 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 13:12:12,698 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 13:12:12,699 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 13:12:12,700 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 13:12:12,704 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 13:12:12,707 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 13:12:12,708 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 13:12:12,710 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 13:12:12,710 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 13:12:12,710 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 13:12:12,712 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 13:12:12,712 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 13:12:12,713 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 13:12:12,715 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 13:12:12,716 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:12,742 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 13:12:12,742 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 13:12:12,744 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 13:12:12,744 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 13:12:12,748 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 13:12:12,748 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 13:12:12,749 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 13:12:12,749 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 13:12:12,749 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 13:12:12,749 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 13:12:12,750 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 13:12:12,750 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 13:12:12,750 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 13:12:12,750 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 13:12:12,750 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 13:12:12,750 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 13:12:12,751 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 13:12:12,751 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 13:12:12,751 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 13:12:12,751 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 13:12:12,751 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 13:12:12,752 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 13:12:12,752 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 13:12:12,752 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 13:12:12,752 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 13:12:12,752 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 13:12:12,753 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 13:12:12,753 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 13:12:12,753 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 13:12:12,753 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 13:12:12,753 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 13:12:12,798 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 13:12:12,814 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 13:12:12,819 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 13:12:12,821 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 13:12:12,821 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 13:12:12,822 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-lit/afnp2014_true-unreach-call_true-termination.c.i [2018-11-23 13:12:12,883 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/11219abd1/81ac863e739149a7a8695d285e3253ee/FLAG35d5d88fd [2018-11-23 13:12:13,343 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 13:12:13,344 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-lit/afnp2014_true-unreach-call_true-termination.c.i [2018-11-23 13:12:13,350 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/11219abd1/81ac863e739149a7a8695d285e3253ee/FLAG35d5d88fd [2018-11-23 13:12:13,725 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/11219abd1/81ac863e739149a7a8695d285e3253ee [2018-11-23 13:12:13,736 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 13:12:13,738 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 13:12:13,739 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 13:12:13,739 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 13:12:13,743 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 13:12:13,745 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 01:12:13" (1/1) ... [2018-11-23 13:12:13,748 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@42c5f6e0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:12:13, skipping insertion in model container [2018-11-23 13:12:13,748 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 01:12:13" (1/1) ... [2018-11-23 13:12:13,759 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 13:12:13,784 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 13:12:14,007 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 13:12:14,012 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 13:12:14,034 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 13:12:14,052 INFO L195 MainTranslator]: Completed translation [2018-11-23 13:12:14,052 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:12:14 WrapperNode [2018-11-23 13:12:14,053 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 13:12:14,053 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 13:12:14,054 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 13:12:14,054 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 13:12:14,063 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:14" (1/1) ... [2018-11-23 13:12:14,068 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:14" (1/1) ... [2018-11-23 13:12:14,074 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 13:12:14,075 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 13:12:14,075 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 13:12:14,075 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 13:12:14,086 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:14" (1/1) ... [2018-11-23 13:12:14,086 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:14" (1/1) ... [2018-11-23 13:12:14,087 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:14" (1/1) ... [2018-11-23 13:12:14,087 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:14" (1/1) ... [2018-11-23 13:12:14,092 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:14" (1/1) ... [2018-11-23 13:12:14,097 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:14" (1/1) ... [2018-11-23 13:12:14,098 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:14" (1/1) ... [2018-11-23 13:12:14,100 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 13:12:14,100 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 13:12:14,100 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 13:12:14,101 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 13:12:14,102 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:12:14" (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:14,233 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 13:12:14,234 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 13:12:14,234 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 13:12:14,234 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 13:12:14,234 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 13:12:14,234 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 13:12:14,234 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-23 13:12:14,235 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-23 13:12:14,664 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 13:12:14,664 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-11-23 13:12:14,665 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:12:14 BoogieIcfgContainer [2018-11-23 13:12:14,665 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 13:12:14,666 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 13:12:14,666 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 13:12:14,669 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 13:12:14,669 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 01:12:13" (1/3) ... [2018-11-23 13:12:14,670 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@28a21e63 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 01:12:14, skipping insertion in model container [2018-11-23 13:12:14,671 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:12:14" (2/3) ... [2018-11-23 13:12:14,671 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@28a21e63 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 01:12:14, skipping insertion in model container [2018-11-23 13:12:14,671 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:12:14" (3/3) ... [2018-11-23 13:12:14,673 INFO L112 eAbstractionObserver]: Analyzing ICFG afnp2014_true-unreach-call_true-termination.c.i [2018-11-23 13:12:14,684 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 13:12:14,691 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 13:12:14,708 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 13:12:14,741 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 13:12:14,742 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 13:12:14,743 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 13:12:14,743 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 13:12:14,744 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 13:12:14,744 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 13:12:14,744 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 13:12:14,745 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 13:12:14,745 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 13:12:14,764 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states. [2018-11-23 13:12:14,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-11-23 13:12:14,771 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:12:14,772 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:12:14,775 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:12:14,781 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:12:14,781 INFO L82 PathProgramCache]: Analyzing trace with hash -147882559, now seen corresponding path program 1 times [2018-11-23 13:12:14,784 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:12:14,784 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:12:14,831 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:12:14,831 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:12:14,832 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:12:14,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:12:14,897 INFO L256 TraceCheckUtils]: 0: Hoare triple {23#true} call ULTIMATE.init(); {23#true} is VALID [2018-11-23 13:12:14,900 INFO L273 TraceCheckUtils]: 1: Hoare triple {23#true} assume true; {23#true} is VALID [2018-11-23 13:12:14,901 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {23#true} {23#true} #39#return; {23#true} is VALID [2018-11-23 13:12:14,902 INFO L256 TraceCheckUtils]: 3: Hoare triple {23#true} call #t~ret3 := main(); {23#true} is VALID [2018-11-23 13:12:14,902 INFO L273 TraceCheckUtils]: 4: Hoare triple {23#true} ~x~0 := 1;~y~0 := 0; {23#true} is VALID [2018-11-23 13:12:14,922 INFO L273 TraceCheckUtils]: 5: Hoare triple {23#true} assume !true; {24#false} is VALID [2018-11-23 13:12:14,923 INFO L256 TraceCheckUtils]: 6: Hoare triple {24#false} call __VERIFIER_assert((if ~x~0 >= ~y~0 then 1 else 0)); {24#false} is VALID [2018-11-23 13:12:14,923 INFO L273 TraceCheckUtils]: 7: Hoare triple {24#false} ~cond := #in~cond; {24#false} is VALID [2018-11-23 13:12:14,924 INFO L273 TraceCheckUtils]: 8: Hoare triple {24#false} assume 0 == ~cond; {24#false} is VALID [2018-11-23 13:12:14,924 INFO L273 TraceCheckUtils]: 9: Hoare triple {24#false} assume !false; {24#false} is VALID [2018-11-23 13:12:14,926 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:14,929 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 13:12:14,929 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 13:12:14,935 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2018-11-23 13:12:14,939 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:12:14,943 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-23 13:12:15,003 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:15,003 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-23 13:12:15,012 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 13:12:15,012 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 13:12:15,015 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 2 states. [2018-11-23 13:12:15,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:12:15,131 INFO L93 Difference]: Finished difference Result 32 states and 36 transitions. [2018-11-23 13:12:15,132 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 13:12:15,132 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2018-11-23 13:12:15,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:12:15,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 13:12:15,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 36 transitions. [2018-11-23 13:12:15,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 13:12:15,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 36 transitions. [2018-11-23 13:12:15,149 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 36 transitions. [2018-11-23 13:12:15,418 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:12:15,431 INFO L225 Difference]: With dead ends: 32 [2018-11-23 13:12:15,432 INFO L226 Difference]: Without dead ends: 13 [2018-11-23 13:12:15,437 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:15,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2018-11-23 13:12:15,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-11-23 13:12:15,514 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:12:15,514 INFO L82 GeneralOperation]: Start isEquivalent. First operand 13 states. Second operand 13 states. [2018-11-23 13:12:15,515 INFO L74 IsIncluded]: Start isIncluded. First operand 13 states. Second operand 13 states. [2018-11-23 13:12:15,515 INFO L87 Difference]: Start difference. First operand 13 states. Second operand 13 states. [2018-11-23 13:12:15,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:12:15,518 INFO L93 Difference]: Finished difference Result 13 states and 14 transitions. [2018-11-23 13:12:15,518 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 14 transitions. [2018-11-23 13:12:15,519 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:12:15,519 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:12:15,519 INFO L74 IsIncluded]: Start isIncluded. First operand 13 states. Second operand 13 states. [2018-11-23 13:12:15,519 INFO L87 Difference]: Start difference. First operand 13 states. Second operand 13 states. [2018-11-23 13:12:15,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:12:15,523 INFO L93 Difference]: Finished difference Result 13 states and 14 transitions. [2018-11-23 13:12:15,523 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 14 transitions. [2018-11-23 13:12:15,523 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:12:15,523 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:12:15,524 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:12:15,524 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:12:15,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-23 13:12:15,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 14 transitions. [2018-11-23 13:12:15,528 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 14 transitions. Word has length 10 [2018-11-23 13:12:15,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:12:15,528 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 14 transitions. [2018-11-23 13:12:15,528 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-23 13:12:15,528 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 14 transitions. [2018-11-23 13:12:15,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-11-23 13:12:15,529 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:12:15,529 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:12:15,530 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:12:15,530 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:12:15,530 INFO L82 PathProgramCache]: Analyzing trace with hash 99303034, now seen corresponding path program 1 times [2018-11-23 13:12:15,531 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:12:15,531 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:12:15,532 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:12:15,532 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:12:15,532 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:12:15,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:12:15,752 INFO L256 TraceCheckUtils]: 0: Hoare triple {114#true} call ULTIMATE.init(); {114#true} is VALID [2018-11-23 13:12:15,752 INFO L273 TraceCheckUtils]: 1: Hoare triple {114#true} assume true; {114#true} is VALID [2018-11-23 13:12:15,753 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {114#true} {114#true} #39#return; {114#true} is VALID [2018-11-23 13:12:15,753 INFO L256 TraceCheckUtils]: 3: Hoare triple {114#true} call #t~ret3 := main(); {114#true} is VALID [2018-11-23 13:12:15,758 INFO L273 TraceCheckUtils]: 4: Hoare triple {114#true} ~x~0 := 1;~y~0 := 0; {116#(<= (+ main_~y~0 1) main_~x~0)} is VALID [2018-11-23 13:12:15,762 INFO L273 TraceCheckUtils]: 5: Hoare triple {116#(<= (+ main_~y~0 1) main_~x~0)} #t~short2 := ~y~0 < 1000; {116#(<= (+ main_~y~0 1) main_~x~0)} is VALID [2018-11-23 13:12:15,765 INFO L273 TraceCheckUtils]: 6: Hoare triple {116#(<= (+ main_~y~0 1) main_~x~0)} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {116#(<= (+ main_~y~0 1) main_~x~0)} is VALID [2018-11-23 13:12:15,765 INFO L273 TraceCheckUtils]: 7: Hoare triple {116#(<= (+ main_~y~0 1) main_~x~0)} assume !#t~short2;havoc #t~short2;havoc #t~nondet1; {116#(<= (+ main_~y~0 1) main_~x~0)} is VALID [2018-11-23 13:12:15,768 INFO L256 TraceCheckUtils]: 8: Hoare triple {116#(<= (+ main_~y~0 1) main_~x~0)} call __VERIFIER_assert((if ~x~0 >= ~y~0 then 1 else 0)); {117#(= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2018-11-23 13:12:15,770 INFO L273 TraceCheckUtils]: 9: Hoare triple {117#(= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {118#(= 1 __VERIFIER_assert_~cond)} is VALID [2018-11-23 13:12:15,773 INFO L273 TraceCheckUtils]: 10: Hoare triple {118#(= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {115#false} is VALID [2018-11-23 13:12:15,773 INFO L273 TraceCheckUtils]: 11: Hoare triple {115#false} assume !false; {115#false} is VALID [2018-11-23 13:12:15,775 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:15,775 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 13:12:15,775 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 13:12:15,777 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2018-11-23 13:12:15,777 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:12:15,777 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-23 13:12:15,864 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:12:15,864 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 13:12:15,865 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 13:12:15,865 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 13:12:15,866 INFO L87 Difference]: Start difference. First operand 13 states and 14 transitions. Second operand 5 states. [2018-11-23 13:12:16,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:12:16,162 INFO L93 Difference]: Finished difference Result 21 states and 23 transitions. [2018-11-23 13:12:16,162 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 13:12:16,162 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2018-11-23 13:12:16,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:12:16,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 13:12:16,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 23 transitions. [2018-11-23 13:12:16,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 13:12:16,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 23 transitions. [2018-11-23 13:12:16,168 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 23 transitions. [2018-11-23 13:12:16,211 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:16,213 INFO L225 Difference]: With dead ends: 21 [2018-11-23 13:12:16,213 INFO L226 Difference]: Without dead ends: 16 [2018-11-23 13:12:16,214 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:16,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2018-11-23 13:12:16,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2018-11-23 13:12:16,234 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:12:16,234 INFO L82 GeneralOperation]: Start isEquivalent. First operand 16 states. Second operand 16 states. [2018-11-23 13:12:16,234 INFO L74 IsIncluded]: Start isIncluded. First operand 16 states. Second operand 16 states. [2018-11-23 13:12:16,234 INFO L87 Difference]: Start difference. First operand 16 states. Second operand 16 states. [2018-11-23 13:12:16,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:12:16,237 INFO L93 Difference]: Finished difference Result 16 states and 18 transitions. [2018-11-23 13:12:16,237 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 18 transitions. [2018-11-23 13:12:16,238 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:12:16,238 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:12:16,238 INFO L74 IsIncluded]: Start isIncluded. First operand 16 states. Second operand 16 states. [2018-11-23 13:12:16,238 INFO L87 Difference]: Start difference. First operand 16 states. Second operand 16 states. [2018-11-23 13:12:16,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:12:16,240 INFO L93 Difference]: Finished difference Result 16 states and 18 transitions. [2018-11-23 13:12:16,241 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 18 transitions. [2018-11-23 13:12:16,241 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:12:16,241 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:12:16,241 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:12:16,242 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:12:16,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-23 13:12:16,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 18 transitions. [2018-11-23 13:12:16,244 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 18 transitions. Word has length 12 [2018-11-23 13:12:16,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:12:16,244 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 18 transitions. [2018-11-23 13:12:16,244 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 13:12:16,244 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 18 transitions. [2018-11-23 13:12:16,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-23 13:12:16,245 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:12:16,245 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:12:16,246 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:12:16,246 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:12:16,246 INFO L82 PathProgramCache]: Analyzing trace with hash -1368172775, now seen corresponding path program 1 times [2018-11-23 13:12:16,246 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:12:16,246 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:12:16,247 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:12:16,248 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:12:16,248 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:12:16,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:12:16,507 INFO L256 TraceCheckUtils]: 0: Hoare triple {210#true} call ULTIMATE.init(); {210#true} is VALID [2018-11-23 13:12:16,507 INFO L273 TraceCheckUtils]: 1: Hoare triple {210#true} assume true; {210#true} is VALID [2018-11-23 13:12:16,508 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {210#true} {210#true} #39#return; {210#true} is VALID [2018-11-23 13:12:16,509 INFO L256 TraceCheckUtils]: 3: Hoare triple {210#true} call #t~ret3 := main(); {210#true} is VALID [2018-11-23 13:12:16,524 INFO L273 TraceCheckUtils]: 4: Hoare triple {210#true} ~x~0 := 1;~y~0 := 0; {212#(<= 1 main_~x~0)} is VALID [2018-11-23 13:12:16,540 INFO L273 TraceCheckUtils]: 5: Hoare triple {212#(<= 1 main_~x~0)} #t~short2 := ~y~0 < 1000; {212#(<= 1 main_~x~0)} is VALID [2018-11-23 13:12:16,549 INFO L273 TraceCheckUtils]: 6: Hoare triple {212#(<= 1 main_~x~0)} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {212#(<= 1 main_~x~0)} is VALID [2018-11-23 13:12:16,565 INFO L273 TraceCheckUtils]: 7: Hoare triple {212#(<= 1 main_~x~0)} assume !!#t~short2;havoc #t~short2;havoc #t~nondet1;~x~0 := ~x~0 + ~y~0;~y~0 := 1 + ~y~0; {213#(<= main_~y~0 main_~x~0)} is VALID [2018-11-23 13:12:16,574 INFO L273 TraceCheckUtils]: 8: Hoare triple {213#(<= main_~y~0 main_~x~0)} #t~short2 := ~y~0 < 1000; {213#(<= main_~y~0 main_~x~0)} is VALID [2018-11-23 13:12:16,588 INFO L273 TraceCheckUtils]: 9: Hoare triple {213#(<= main_~y~0 main_~x~0)} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {213#(<= main_~y~0 main_~x~0)} is VALID [2018-11-23 13:12:16,597 INFO L273 TraceCheckUtils]: 10: Hoare triple {213#(<= main_~y~0 main_~x~0)} assume !#t~short2;havoc #t~short2;havoc #t~nondet1; {213#(<= main_~y~0 main_~x~0)} is VALID [2018-11-23 13:12:16,613 INFO L256 TraceCheckUtils]: 11: Hoare triple {213#(<= main_~y~0 main_~x~0)} call __VERIFIER_assert((if ~x~0 >= ~y~0 then 1 else 0)); {214#(= |__VERIFIER_assert_#in~cond| 1)} is VALID [2018-11-23 13:12:16,628 INFO L273 TraceCheckUtils]: 12: Hoare triple {214#(= |__VERIFIER_assert_#in~cond| 1)} ~cond := #in~cond; {215#(= __VERIFIER_assert_~cond 1)} is VALID [2018-11-23 13:12:16,637 INFO L273 TraceCheckUtils]: 13: Hoare triple {215#(= __VERIFIER_assert_~cond 1)} assume 0 == ~cond; {211#false} is VALID [2018-11-23 13:12:16,637 INFO L273 TraceCheckUtils]: 14: Hoare triple {211#false} assume !false; {211#false} is VALID [2018-11-23 13:12:16,639 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:12:16,639 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:12:16,639 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:16,666 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:12:16,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:12:16,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:12:16,724 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:12:17,108 INFO L256 TraceCheckUtils]: 0: Hoare triple {210#true} call ULTIMATE.init(); {210#true} is VALID [2018-11-23 13:12:17,108 INFO L273 TraceCheckUtils]: 1: Hoare triple {210#true} assume true; {210#true} is VALID [2018-11-23 13:12:17,109 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {210#true} {210#true} #39#return; {210#true} is VALID [2018-11-23 13:12:17,109 INFO L256 TraceCheckUtils]: 3: Hoare triple {210#true} call #t~ret3 := main(); {210#true} is VALID [2018-11-23 13:12:17,123 INFO L273 TraceCheckUtils]: 4: Hoare triple {210#true} ~x~0 := 1;~y~0 := 0; {212#(<= 1 main_~x~0)} is VALID [2018-11-23 13:12:17,138 INFO L273 TraceCheckUtils]: 5: Hoare triple {212#(<= 1 main_~x~0)} #t~short2 := ~y~0 < 1000; {212#(<= 1 main_~x~0)} is VALID [2018-11-23 13:12:17,147 INFO L273 TraceCheckUtils]: 6: Hoare triple {212#(<= 1 main_~x~0)} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {212#(<= 1 main_~x~0)} is VALID [2018-11-23 13:12:17,162 INFO L273 TraceCheckUtils]: 7: Hoare triple {212#(<= 1 main_~x~0)} assume !!#t~short2;havoc #t~short2;havoc #t~nondet1;~x~0 := ~x~0 + ~y~0;~y~0 := 1 + ~y~0; {213#(<= main_~y~0 main_~x~0)} is VALID [2018-11-23 13:12:17,171 INFO L273 TraceCheckUtils]: 8: Hoare triple {213#(<= main_~y~0 main_~x~0)} #t~short2 := ~y~0 < 1000; {213#(<= main_~y~0 main_~x~0)} is VALID [2018-11-23 13:12:17,187 INFO L273 TraceCheckUtils]: 9: Hoare triple {213#(<= main_~y~0 main_~x~0)} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {213#(<= main_~y~0 main_~x~0)} is VALID [2018-11-23 13:12:17,203 INFO L273 TraceCheckUtils]: 10: Hoare triple {213#(<= main_~y~0 main_~x~0)} assume !#t~short2;havoc #t~short2;havoc #t~nondet1; {213#(<= main_~y~0 main_~x~0)} is VALID [2018-11-23 13:12:17,212 INFO L256 TraceCheckUtils]: 11: Hoare triple {213#(<= main_~y~0 main_~x~0)} call __VERIFIER_assert((if ~x~0 >= ~y~0 then 1 else 0)); {214#(= |__VERIFIER_assert_#in~cond| 1)} is VALID [2018-11-23 13:12:17,225 INFO L273 TraceCheckUtils]: 12: Hoare triple {214#(= |__VERIFIER_assert_#in~cond| 1)} ~cond := #in~cond; {215#(= __VERIFIER_assert_~cond 1)} is VALID [2018-11-23 13:12:17,238 INFO L273 TraceCheckUtils]: 13: Hoare triple {215#(= __VERIFIER_assert_~cond 1)} assume 0 == ~cond; {211#false} is VALID [2018-11-23 13:12:17,239 INFO L273 TraceCheckUtils]: 14: Hoare triple {211#false} assume !false; {211#false} is VALID [2018-11-23 13:12:17,243 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:12:17,271 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:12:17,271 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-11-23 13:12:17,272 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2018-11-23 13:12:17,272 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:12:17,272 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-23 13:12:17,300 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:17,300 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 13:12:17,301 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 13:12:17,301 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-23 13:12:17,302 INFO L87 Difference]: Start difference. First operand 16 states and 18 transitions. Second operand 6 states. [2018-11-23 13:12:17,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:12:17,694 INFO L93 Difference]: Finished difference Result 24 states and 27 transitions. [2018-11-23 13:12:17,695 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 13:12:17,695 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2018-11-23 13:12:17,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:12:17,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 13:12:17,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 27 transitions. [2018-11-23 13:12:17,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 13:12:17,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 27 transitions. [2018-11-23 13:12:17,700 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 27 transitions. [2018-11-23 13:12:17,768 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:12:17,770 INFO L225 Difference]: With dead ends: 24 [2018-11-23 13:12:17,770 INFO L226 Difference]: Without dead ends: 19 [2018-11-23 13:12:17,771 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-11-23 13:12:17,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2018-11-23 13:12:17,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2018-11-23 13:12:17,783 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:12:17,784 INFO L82 GeneralOperation]: Start isEquivalent. First operand 19 states. Second operand 19 states. [2018-11-23 13:12:17,784 INFO L74 IsIncluded]: Start isIncluded. First operand 19 states. Second operand 19 states. [2018-11-23 13:12:17,784 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 19 states. [2018-11-23 13:12:17,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:12:17,787 INFO L93 Difference]: Finished difference Result 19 states and 22 transitions. [2018-11-23 13:12:17,787 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 22 transitions. [2018-11-23 13:12:17,787 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:12:17,787 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:12:17,788 INFO L74 IsIncluded]: Start isIncluded. First operand 19 states. Second operand 19 states. [2018-11-23 13:12:17,788 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 19 states. [2018-11-23 13:12:17,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:12:17,791 INFO L93 Difference]: Finished difference Result 19 states and 22 transitions. [2018-11-23 13:12:17,791 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 22 transitions. [2018-11-23 13:12:17,791 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:12:17,792 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:12:17,792 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:12:17,792 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:12:17,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-23 13:12:17,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 22 transitions. [2018-11-23 13:12:17,794 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 22 transitions. Word has length 15 [2018-11-23 13:12:17,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:12:17,794 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 22 transitions. [2018-11-23 13:12:17,794 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 13:12:17,795 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 22 transitions. [2018-11-23 13:12:17,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-23 13:12:17,795 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:12:17,795 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:12:17,796 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:12:17,796 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:12:17,796 INFO L82 PathProgramCache]: Analyzing trace with hash -467892710, now seen corresponding path program 2 times [2018-11-23 13:12:17,796 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:12:17,796 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:12:17,797 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:12:17,797 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:12:17,798 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:12:17,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:12:17,990 INFO L256 TraceCheckUtils]: 0: Hoare triple {365#true} call ULTIMATE.init(); {365#true} is VALID [2018-11-23 13:12:17,990 INFO L273 TraceCheckUtils]: 1: Hoare triple {365#true} assume true; {365#true} is VALID [2018-11-23 13:12:17,991 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {365#true} {365#true} #39#return; {365#true} is VALID [2018-11-23 13:12:17,991 INFO L256 TraceCheckUtils]: 3: Hoare triple {365#true} call #t~ret3 := main(); {365#true} is VALID [2018-11-23 13:12:17,997 INFO L273 TraceCheckUtils]: 4: Hoare triple {365#true} ~x~0 := 1;~y~0 := 0; {367#(<= 1 (+ main_~x~0 main_~y~0))} is VALID [2018-11-23 13:12:17,998 INFO L273 TraceCheckUtils]: 5: Hoare triple {367#(<= 1 (+ main_~x~0 main_~y~0))} #t~short2 := ~y~0 < 1000; {367#(<= 1 (+ main_~x~0 main_~y~0))} is VALID [2018-11-23 13:12:17,999 INFO L273 TraceCheckUtils]: 6: Hoare triple {367#(<= 1 (+ main_~x~0 main_~y~0))} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {367#(<= 1 (+ main_~x~0 main_~y~0))} is VALID [2018-11-23 13:12:18,000 INFO L273 TraceCheckUtils]: 7: Hoare triple {367#(<= 1 (+ main_~x~0 main_~y~0))} assume !!#t~short2;havoc #t~short2;havoc #t~nondet1;~x~0 := ~x~0 + ~y~0;~y~0 := 1 + ~y~0; {368#(<= 1 main_~x~0)} is VALID [2018-11-23 13:12:18,000 INFO L273 TraceCheckUtils]: 8: Hoare triple {368#(<= 1 main_~x~0)} #t~short2 := ~y~0 < 1000; {368#(<= 1 main_~x~0)} is VALID [2018-11-23 13:12:18,001 INFO L273 TraceCheckUtils]: 9: Hoare triple {368#(<= 1 main_~x~0)} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {368#(<= 1 main_~x~0)} is VALID [2018-11-23 13:12:18,004 INFO L273 TraceCheckUtils]: 10: Hoare triple {368#(<= 1 main_~x~0)} assume !!#t~short2;havoc #t~short2;havoc #t~nondet1;~x~0 := ~x~0 + ~y~0;~y~0 := 1 + ~y~0; {369#(<= main_~y~0 main_~x~0)} is VALID [2018-11-23 13:12:18,005 INFO L273 TraceCheckUtils]: 11: Hoare triple {369#(<= main_~y~0 main_~x~0)} #t~short2 := ~y~0 < 1000; {369#(<= main_~y~0 main_~x~0)} is VALID [2018-11-23 13:12:18,005 INFO L273 TraceCheckUtils]: 12: Hoare triple {369#(<= main_~y~0 main_~x~0)} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {369#(<= main_~y~0 main_~x~0)} is VALID [2018-11-23 13:12:18,014 INFO L273 TraceCheckUtils]: 13: Hoare triple {369#(<= main_~y~0 main_~x~0)} assume !#t~short2;havoc #t~short2;havoc #t~nondet1; {369#(<= main_~y~0 main_~x~0)} is VALID [2018-11-23 13:12:18,015 INFO L256 TraceCheckUtils]: 14: Hoare triple {369#(<= main_~y~0 main_~x~0)} call __VERIFIER_assert((if ~x~0 >= ~y~0 then 1 else 0)); {370#(= |__VERIFIER_assert_#in~cond| 1)} is VALID [2018-11-23 13:12:18,016 INFO L273 TraceCheckUtils]: 15: Hoare triple {370#(= |__VERIFIER_assert_#in~cond| 1)} ~cond := #in~cond; {371#(= __VERIFIER_assert_~cond 1)} is VALID [2018-11-23 13:12:18,017 INFO L273 TraceCheckUtils]: 16: Hoare triple {371#(= __VERIFIER_assert_~cond 1)} assume 0 == ~cond; {366#false} is VALID [2018-11-23 13:12:18,017 INFO L273 TraceCheckUtils]: 17: Hoare triple {366#false} assume !false; {366#false} is VALID [2018-11-23 13:12:18,018 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:12:18,018 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:12:18,018 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:18,029 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 13:12:18,063 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 13:12:18,063 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:12:18,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:12:18,085 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:12:18,287 INFO L256 TraceCheckUtils]: 0: Hoare triple {365#true} call ULTIMATE.init(); {365#true} is VALID [2018-11-23 13:12:18,287 INFO L273 TraceCheckUtils]: 1: Hoare triple {365#true} assume true; {365#true} is VALID [2018-11-23 13:12:18,288 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {365#true} {365#true} #39#return; {365#true} is VALID [2018-11-23 13:12:18,288 INFO L256 TraceCheckUtils]: 3: Hoare triple {365#true} call #t~ret3 := main(); {365#true} is VALID [2018-11-23 13:12:18,288 INFO L273 TraceCheckUtils]: 4: Hoare triple {365#true} ~x~0 := 1;~y~0 := 0; {387#(and (<= 0 main_~y~0) (<= 1 main_~x~0))} is VALID [2018-11-23 13:12:18,289 INFO L273 TraceCheckUtils]: 5: Hoare triple {387#(and (<= 0 main_~y~0) (<= 1 main_~x~0))} #t~short2 := ~y~0 < 1000; {387#(and (<= 0 main_~y~0) (<= 1 main_~x~0))} is VALID [2018-11-23 13:12:18,290 INFO L273 TraceCheckUtils]: 6: Hoare triple {387#(and (<= 0 main_~y~0) (<= 1 main_~x~0))} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {387#(and (<= 0 main_~y~0) (<= 1 main_~x~0))} is VALID [2018-11-23 13:12:18,291 INFO L273 TraceCheckUtils]: 7: Hoare triple {387#(and (<= 0 main_~y~0) (<= 1 main_~x~0))} assume !!#t~short2;havoc #t~short2;havoc #t~nondet1;~x~0 := ~x~0 + ~y~0;~y~0 := 1 + ~y~0; {368#(<= 1 main_~x~0)} is VALID [2018-11-23 13:12:18,292 INFO L273 TraceCheckUtils]: 8: Hoare triple {368#(<= 1 main_~x~0)} #t~short2 := ~y~0 < 1000; {368#(<= 1 main_~x~0)} is VALID [2018-11-23 13:12:18,293 INFO L273 TraceCheckUtils]: 9: Hoare triple {368#(<= 1 main_~x~0)} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {368#(<= 1 main_~x~0)} is VALID [2018-11-23 13:12:18,295 INFO L273 TraceCheckUtils]: 10: Hoare triple {368#(<= 1 main_~x~0)} assume !!#t~short2;havoc #t~short2;havoc #t~nondet1;~x~0 := ~x~0 + ~y~0;~y~0 := 1 + ~y~0; {369#(<= main_~y~0 main_~x~0)} is VALID [2018-11-23 13:12:18,296 INFO L273 TraceCheckUtils]: 11: Hoare triple {369#(<= main_~y~0 main_~x~0)} #t~short2 := ~y~0 < 1000; {369#(<= main_~y~0 main_~x~0)} is VALID [2018-11-23 13:12:18,297 INFO L273 TraceCheckUtils]: 12: Hoare triple {369#(<= main_~y~0 main_~x~0)} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := 0 != #t~nondet1; {369#(<= main_~y~0 main_~x~0)} is VALID [2018-11-23 13:12:18,297 INFO L273 TraceCheckUtils]: 13: Hoare triple {369#(<= main_~y~0 main_~x~0)} assume !#t~short2;havoc #t~short2;havoc #t~nondet1; {369#(<= main_~y~0 main_~x~0)} is VALID [2018-11-23 13:12:18,299 INFO L256 TraceCheckUtils]: 14: Hoare triple {369#(<= main_~y~0 main_~x~0)} call __VERIFIER_assert((if ~x~0 >= ~y~0 then 1 else 0)); {370#(= |__VERIFIER_assert_#in~cond| 1)} is VALID [2018-11-23 13:12:18,300 INFO L273 TraceCheckUtils]: 15: Hoare triple {370#(= |__VERIFIER_assert_#in~cond| 1)} ~cond := #in~cond; {371#(= __VERIFIER_assert_~cond 1)} is VALID [2018-11-23 13:12:18,303 INFO L273 TraceCheckUtils]: 16: Hoare triple {371#(= __VERIFIER_assert_~cond 1)} assume 0 == ~cond; {366#false} is VALID [2018-11-23 13:12:18,304 INFO L273 TraceCheckUtils]: 17: Hoare triple {366#false} assume !false; {366#false} is VALID [2018-11-23 13:12:18,305 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:12:18,323 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:12:18,324 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2018-11-23 13:12:18,324 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 18 [2018-11-23 13:12:18,324 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:12:18,324 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2018-11-23 13:12:18,350 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:18,350 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-23 13:12:18,351 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-23 13:12:18,351 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-11-23 13:12:18,352 INFO L87 Difference]: Start difference. First operand 19 states and 22 transitions. Second operand 8 states. [2018-11-23 13:12:18,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:12:18,541 INFO L93 Difference]: Finished difference Result 19 states and 22 transitions. [2018-11-23 13:12:18,541 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 13:12:18,541 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 18 [2018-11-23 13:12:18,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:12:18,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 13:12:18,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 14 transitions. [2018-11-23 13:12:18,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 13:12:18,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 14 transitions. [2018-11-23 13:12:18,545 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 14 transitions. [2018-11-23 13:12:18,560 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:18,561 INFO L225 Difference]: With dead ends: 19 [2018-11-23 13:12:18,561 INFO L226 Difference]: Without dead ends: 0 [2018-11-23 13:12:18,562 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-11-23 13:12:18,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-23 13:12:18,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-23 13:12:18,563 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:12:18,563 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2018-11-23 13:12:18,563 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2018-11-23 13:12:18,563 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2018-11-23 13:12:18,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:12:18,564 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2018-11-23 13:12:18,564 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-23 13:12:18,564 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:12:18,564 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:12:18,564 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2018-11-23 13:12:18,565 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2018-11-23 13:12:18,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:12:18,565 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2018-11-23 13:12:18,565 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-23 13:12:18,565 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:12:18,565 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:12:18,565 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:12:18,566 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:12:18,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-23 13:12:18,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-23 13:12:18,566 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 18 [2018-11-23 13:12:18,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:12:18,566 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 13:12:18,566 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-23 13:12:18,567 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-23 13:12:18,567 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:12:18,571 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-23 13:12:18,658 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2018-11-23 13:12:18,658 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-23 13:12:18,658 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-23 13:12:18,659 INFO L451 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-11-23 13:12:18,659 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-23 13:12:18,659 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-23 13:12:18,659 INFO L451 ceAbstractionStarter]: At program point mainENTRY(lines 10 19) the Hoare annotation is: true [2018-11-23 13:12:18,659 INFO L448 ceAbstractionStarter]: For program point mainEXIT(lines 10 19) no Hoare annotation was computed. [2018-11-23 13:12:18,659 INFO L448 ceAbstractionStarter]: For program point L17(line 17) no Hoare annotation was computed. [2018-11-23 13:12:18,660 INFO L448 ceAbstractionStarter]: For program point mainFINAL(lines 10 19) no Hoare annotation was computed. [2018-11-23 13:12:18,660 INFO L448 ceAbstractionStarter]: For program point L13-1(line 13) no Hoare annotation was computed. [2018-11-23 13:12:18,660 INFO L448 ceAbstractionStarter]: For program point L13-3(lines 13 16) no Hoare annotation was computed. [2018-11-23 13:12:18,660 INFO L444 ceAbstractionStarter]: At program point L13-5(lines 13 16) the Hoare annotation is: (and (<= main_~y~0 main_~x~0) (<= 0 main_~y~0) (<= 1 main_~x~0)) [2018-11-23 13:12:18,660 INFO L444 ceAbstractionStarter]: At program point L13-6(lines 13 16) the Hoare annotation is: (<= main_~y~0 main_~x~0) [2018-11-23 13:12:18,660 INFO L448 ceAbstractionStarter]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2018-11-23 13:12:18,661 INFO L451 ceAbstractionStarter]: At program point __VERIFIER_assertENTRY(lines 3 8) the Hoare annotation is: true [2018-11-23 13:12:18,661 INFO L448 ceAbstractionStarter]: For program point __VERIFIER_assertEXIT(lines 3 8) no Hoare annotation was computed. [2018-11-23 13:12:18,661 INFO L448 ceAbstractionStarter]: For program point L5(line 5) no Hoare annotation was computed. [2018-11-23 13:12:18,661 INFO L448 ceAbstractionStarter]: For program point L4(lines 4 6) no Hoare annotation was computed. [2018-11-23 13:12:18,661 INFO L448 ceAbstractionStarter]: For program point L4-2(lines 3 8) no Hoare annotation was computed. [2018-11-23 13:12:18,663 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2018-11-23 13:12:18,667 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2018-11-23 13:12:18,668 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2018-11-23 13:12:18,668 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2018-11-23 13:12:18,668 WARN L170 areAnnotationChecker]: L13-1 has no Hoare annotation [2018-11-23 13:12:18,668 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2018-11-23 13:12:18,668 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2018-11-23 13:12:18,669 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2018-11-23 13:12:18,669 WARN L170 areAnnotationChecker]: L17 has no Hoare annotation [2018-11-23 13:12:18,669 WARN L170 areAnnotationChecker]: L13-1 has no Hoare annotation [2018-11-23 13:12:18,669 WARN L170 areAnnotationChecker]: L13-1 has no Hoare annotation [2018-11-23 13:12:18,669 WARN L170 areAnnotationChecker]: L5 has no Hoare annotation [2018-11-23 13:12:18,669 WARN L170 areAnnotationChecker]: L5 has no Hoare annotation [2018-11-23 13:12:18,669 WARN L170 areAnnotationChecker]: L4-2 has no Hoare annotation [2018-11-23 13:12:18,669 WARN L170 areAnnotationChecker]: L17 has no Hoare annotation [2018-11-23 13:12:18,669 WARN L170 areAnnotationChecker]: L13-3 has no Hoare annotation [2018-11-23 13:12:18,670 WARN L170 areAnnotationChecker]: L13-3 has no Hoare annotation [2018-11-23 13:12:18,670 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2018-11-23 13:12:18,670 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2018-11-23 13:12:18,670 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2018-11-23 13:12:18,670 INFO L163 areAnnotationChecker]: CFG has 5 edges. 5 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2018-11-23 13:12:18,680 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 01:12:18 BoogieIcfgContainer [2018-11-23 13:12:18,680 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-23 13:12:18,680 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 13:12:18,680 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 13:12:18,681 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 13:12:18,681 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:14" (3/4) ... [2018-11-23 13:12:18,684 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-23 13:12:18,690 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-23 13:12:18,691 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-23 13:12:18,691 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2018-11-23 13:12:18,695 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2018-11-23 13:12:18,695 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2018-11-23 13:12:18,695 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-11-23 13:12:18,745 INFO L145 WitnessManager]: Wrote witness to /storage/repos/svcomp/c/loop-lit/afnp2014_true-unreach-call_true-termination.c.i-witness.graphml [2018-11-23 13:12:18,745 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 13:12:18,746 INFO L168 Benchmark]: Toolchain (without parser) took 5009.64 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 739.2 MB). Free memory was 1.4 GB in the beginning and 2.0 GB in the end (delta: -579.0 MB). Peak memory consumption was 160.3 MB. Max. memory is 7.1 GB. [2018-11-23 13:12:18,748 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-23 13:12:18,749 INFO L168 Benchmark]: CACSL2BoogieTranslator took 314.16 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:18,749 INFO L168 Benchmark]: Boogie Procedure Inliner took 21.19 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:18,753 INFO L168 Benchmark]: Boogie Preprocessor took 24.97 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:18,754 INFO L168 Benchmark]: RCFGBuilder took 564.72 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 739.2 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -790.0 MB). Peak memory consumption was 26.2 MB. Max. memory is 7.1 GB. [2018-11-23 13:12:18,755 INFO L168 Benchmark]: TraceAbstraction took 4014.34 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.0 GB in the end (delta: 200.4 MB). Peak memory consumption was 200.4 MB. Max. memory is 7.1 GB. [2018-11-23 13:12:18,755 INFO L168 Benchmark]: Witness Printer took 64.71 ms. Allocated memory is still 2.3 GB. Free memory is still 2.0 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-23 13:12:18,759 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - GenericResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 314.16 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 21.19 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.97 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 564.72 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 739.2 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -790.0 MB). Peak memory consumption was 26.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 4014.34 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.0 GB in the end (delta: 200.4 MB). Peak memory consumption was 200.4 MB. Max. memory is 7.1 GB. * Witness Printer took 64.71 ms. Allocated memory is still 2.3 GB. Free memory is still 2.0 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: 13]: Loop Invariant Derived loop invariant: (y <= x && 0 <= y) && 1 <= x - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 20 locations, 1 error locations. SAFE Result, 3.9s OverallTime, 4 OverallIterations, 3 TraceHistogramMax, 1.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 52 SDtfs, 12 SDslu, 102 SDs, 0 SdLazy, 41 SolverSat, 4 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 56 GetRequests, 36 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=20occurred 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.1s AutomataMinimizationTime, 4 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 10 PreInvPairs, 14 NumberOfFragments, 18 HoareAnnotationTreeSize, 10 FomulaSimplifications, 26 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 6 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 88 NumberOfCodeBlocks, 88 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 82 ConstructedInterpolants, 0 QuantifiedInterpolants, 3018 SizeOfPredicates, 4 NumberOfNonLiveVariables, 88 ConjunctsInSsa, 20 ConjunctsInUnsatCore, 6 InterpolantComputations, 2 PerfectInterpolantSequences, 0/24 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...