java -ea -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/loop-invgen/nested9_true-unreach-call_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-370d6ab [2018-11-14 17:34:09,759 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-14 17:34:09,761 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-14 17:34:09,777 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-14 17:34:09,777 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-14 17:34:09,778 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-14 17:34:09,780 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-14 17:34:09,783 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-14 17:34:09,786 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-14 17:34:09,787 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-14 17:34:09,795 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-14 17:34:09,795 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-14 17:34:09,797 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-14 17:34:09,798 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-14 17:34:09,800 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-14 17:34:09,803 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-14 17:34:09,804 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-14 17:34:09,809 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-14 17:34:09,814 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-14 17:34:09,817 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-14 17:34:09,818 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-14 17:34:09,820 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-14 17:34:09,822 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-14 17:34:09,826 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-14 17:34:09,826 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-14 17:34:09,827 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-14 17:34:09,829 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-14 17:34:09,830 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-14 17:34:09,830 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-14 17:34:09,833 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-14 17:34:09,835 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-14 17:34:09,836 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-14 17:34:09,836 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-14 17:34:09,836 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-14 17:34:09,838 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-14 17:34:09,839 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-14 17:34:09,840 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-14 17:34:09,866 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-14 17:34:09,867 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-14 17:34:09,868 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-14 17:34:09,868 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-14 17:34:09,868 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-14 17:34:09,868 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-14 17:34:09,869 INFO L133 SettingsManager]: * Use SBE=true [2018-11-14 17:34:09,869 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-14 17:34:09,869 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-14 17:34:09,869 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-14 17:34:09,869 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-14 17:34:09,872 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-14 17:34:09,872 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-14 17:34:09,872 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-14 17:34:09,873 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-14 17:34:09,873 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-14 17:34:09,873 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-14 17:34:09,873 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-14 17:34:09,873 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-14 17:34:09,873 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-14 17:34:09,874 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-14 17:34:09,874 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-14 17:34:09,874 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-14 17:34:09,874 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-14 17:34:09,874 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-14 17:34:09,876 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-14 17:34:09,876 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-14 17:34:09,876 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-14 17:34:09,876 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-14 17:34:09,876 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-14 17:34:09,928 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-14 17:34:09,940 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-14 17:34:09,945 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-14 17:34:09,946 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-14 17:34:09,947 INFO L276 PluginConnector]: CDTParser initialized [2018-11-14 17:34:09,948 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-invgen/nested9_true-unreach-call_true-termination.i [2018-11-14 17:34:10,013 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/279ddd5c9/6e3928e54cd044eaa281b32f54c49d26/FLAGfa4725288 [2018-11-14 17:34:10,425 INFO L298 CDTParser]: Found 1 translation units. [2018-11-14 17:34:10,426 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/nested9_true-unreach-call_true-termination.i [2018-11-14 17:34:10,433 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/279ddd5c9/6e3928e54cd044eaa281b32f54c49d26/FLAGfa4725288 [2018-11-14 17:34:10,447 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/279ddd5c9/6e3928e54cd044eaa281b32f54c49d26 [2018-11-14 17:34:10,460 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-14 17:34:10,462 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-11-14 17:34:10,463 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-14 17:34:10,463 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-14 17:34:10,467 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-14 17:34:10,468 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 05:34:10" (1/1) ... [2018-11-14 17:34:10,471 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7f7c9eb9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:34:10, skipping insertion in model container [2018-11-14 17:34:10,471 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 05:34:10" (1/1) ... [2018-11-14 17:34:10,481 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-14 17:34:10,501 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-14 17:34:10,744 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-14 17:34:10,753 INFO L191 MainTranslator]: Completed pre-run [2018-11-14 17:34:10,777 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-14 17:34:10,792 INFO L195 MainTranslator]: Completed translation [2018-11-14 17:34:10,793 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:34:10 WrapperNode [2018-11-14 17:34:10,793 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-14 17:34:10,794 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-14 17:34:10,794 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-14 17:34:10,794 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-14 17:34:10,806 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:34:10" (1/1) ... [2018-11-14 17:34:10,806 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:34:10" (1/1) ... [2018-11-14 17:34:10,812 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:34:10" (1/1) ... [2018-11-14 17:34:10,812 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:34:10" (1/1) ... [2018-11-14 17:34:10,817 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:34:10" (1/1) ... [2018-11-14 17:34:10,825 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:34:10" (1/1) ... [2018-11-14 17:34:10,826 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:34:10" (1/1) ... [2018-11-14 17:34:10,828 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-14 17:34:10,828 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-14 17:34:10,829 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-14 17:34:10,829 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-14 17:34:10,830 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:34:10" (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-14 17:34:10,953 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-14 17:34:10,953 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-14 17:34:10,954 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-14 17:34:10,954 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-14 17:34:10,954 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-14 17:34:10,954 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2018-11-14 17:34:10,954 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-14 17:34:10,954 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-11-14 17:34:10,955 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-14 17:34:10,955 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-14 17:34:10,955 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-14 17:34:11,546 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-14 17:34:11,547 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 05:34:11 BoogieIcfgContainer [2018-11-14 17:34:11,547 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-14 17:34:11,548 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-14 17:34:11,548 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-14 17:34:11,551 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-14 17:34:11,552 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.11 05:34:10" (1/3) ... [2018-11-14 17:34:11,553 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@460f8e04 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 05:34:11, skipping insertion in model container [2018-11-14 17:34:11,553 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:34:10" (2/3) ... [2018-11-14 17:34:11,553 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@460f8e04 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 05:34:11, skipping insertion in model container [2018-11-14 17:34:11,554 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 05:34:11" (3/3) ... [2018-11-14 17:34:11,556 INFO L112 eAbstractionObserver]: Analyzing ICFG nested9_true-unreach-call_true-termination.i [2018-11-14 17:34:11,566 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-14 17:34:11,573 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-14 17:34:11,589 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-14 17:34:11,620 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-14 17:34:11,621 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-14 17:34:11,621 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-14 17:34:11,621 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-14 17:34:11,621 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-14 17:34:11,622 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-14 17:34:11,622 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-14 17:34:11,622 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-14 17:34:11,622 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-14 17:34:11,641 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states. [2018-11-14 17:34:11,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-14 17:34:11,648 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:34:11,649 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:34:11,651 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:34:11,655 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:34:11,656 INFO L82 PathProgramCache]: Analyzing trace with hash 1899131806, now seen corresponding path program 1 times [2018-11-14 17:34:11,658 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:34:11,658 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:34:11,707 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:34:11,707 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:34:11,708 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:34:11,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:34:11,982 INFO L256 TraceCheckUtils]: 0: Hoare triple {35#true} call ULTIMATE.init(); {35#true} is VALID [2018-11-14 17:34:11,986 INFO L273 TraceCheckUtils]: 1: Hoare triple {35#true} ~__BLAST_NONDET~0 := 0; {35#true} is VALID [2018-11-14 17:34:11,986 INFO L273 TraceCheckUtils]: 2: Hoare triple {35#true} assume true; {35#true} is VALID [2018-11-14 17:34:11,987 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {35#true} {35#true} #80#return; {35#true} is VALID [2018-11-14 17:34:11,987 INFO L256 TraceCheckUtils]: 4: Hoare triple {35#true} call #t~ret7 := main(); {35#true} is VALID [2018-11-14 17:34:11,987 INFO L273 TraceCheckUtils]: 5: Hoare triple {35#true} havoc ~i~0;havoc ~j~0;havoc ~k~0;havoc ~n~0;havoc ~l~0;havoc ~m~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~m~0 := #t~nondet2;havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~l~0 := #t~nondet3;havoc #t~nondet3; {35#true} is VALID [2018-11-14 17:34:11,988 INFO L273 TraceCheckUtils]: 6: Hoare triple {35#true} assume !!(-1000000 < ~n~0 && ~n~0 < 1000000); {35#true} is VALID [2018-11-14 17:34:11,988 INFO L273 TraceCheckUtils]: 7: Hoare triple {35#true} assume !!(-1000000 < ~m~0 && ~m~0 < 1000000); {35#true} is VALID [2018-11-14 17:34:11,988 INFO L273 TraceCheckUtils]: 8: Hoare triple {35#true} assume !!(-1000000 < ~l~0 && ~l~0 < 1000000); {35#true} is VALID [2018-11-14 17:34:11,989 INFO L273 TraceCheckUtils]: 9: Hoare triple {35#true} assume 3 * ~n~0 <= ~m~0 + ~l~0; {35#true} is VALID [2018-11-14 17:34:11,990 INFO L273 TraceCheckUtils]: 10: Hoare triple {35#true} ~i~0 := 0; {37#(<= main_~i~0 0)} is VALID [2018-11-14 17:34:12,002 INFO L273 TraceCheckUtils]: 11: Hoare triple {37#(<= main_~i~0 0)} assume true; {37#(<= main_~i~0 0)} is VALID [2018-11-14 17:34:12,007 INFO L273 TraceCheckUtils]: 12: Hoare triple {37#(<= main_~i~0 0)} assume !!(~i~0 < ~n~0);~j~0 := 2 * ~i~0; {38#(<= (* 3 main_~i~0) main_~j~0)} is VALID [2018-11-14 17:34:12,008 INFO L273 TraceCheckUtils]: 13: Hoare triple {38#(<= (* 3 main_~i~0) main_~j~0)} assume true; {38#(<= (* 3 main_~i~0) main_~j~0)} is VALID [2018-11-14 17:34:12,010 INFO L273 TraceCheckUtils]: 14: Hoare triple {38#(<= (* 3 main_~i~0) main_~j~0)} assume !!(~j~0 < 3 * ~i~0);~k~0 := ~i~0; {36#false} is VALID [2018-11-14 17:34:12,010 INFO L273 TraceCheckUtils]: 15: Hoare triple {36#false} assume true; {36#false} is VALID [2018-11-14 17:34:12,010 INFO L273 TraceCheckUtils]: 16: Hoare triple {36#false} assume !!(~k~0 < ~j~0); {36#false} is VALID [2018-11-14 17:34:12,011 INFO L256 TraceCheckUtils]: 17: Hoare triple {36#false} call __VERIFIER_assert((if ~k~0 - ~i~0 <= 2 * ~n~0 then 1 else 0)); {36#false} is VALID [2018-11-14 17:34:12,011 INFO L273 TraceCheckUtils]: 18: Hoare triple {36#false} ~cond := #in~cond; {36#false} is VALID [2018-11-14 17:34:12,011 INFO L273 TraceCheckUtils]: 19: Hoare triple {36#false} assume ~cond == 0; {36#false} is VALID [2018-11-14 17:34:12,012 INFO L273 TraceCheckUtils]: 20: Hoare triple {36#false} assume !false; {36#false} is VALID [2018-11-14 17:34:12,016 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-14 17:34:12,019 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 17:34:12,020 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-14 17:34:12,025 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 21 [2018-11-14 17:34:12,029 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:34:12,032 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2018-11-14 17:34:12,150 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:34:12,150 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-14 17:34:12,158 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-14 17:34:12,159 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-14 17:34:12,162 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 4 states. [2018-11-14 17:34:12,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:34:12,774 INFO L93 Difference]: Finished difference Result 61 states and 82 transitions. [2018-11-14 17:34:12,774 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-14 17:34:12,775 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 21 [2018-11-14 17:34:12,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:34:12,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-14 17:34:12,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 82 transitions. [2018-11-14 17:34:12,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-14 17:34:12,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 82 transitions. [2018-11-14 17:34:12,796 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 82 transitions. [2018-11-14 17:34:13,300 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 82 edges. 82 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:34:13,312 INFO L225 Difference]: With dead ends: 61 [2018-11-14 17:34:13,312 INFO L226 Difference]: Without dead ends: 32 [2018-11-14 17:34:13,316 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-14 17:34:13,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-11-14 17:34:13,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 31. [2018-11-14 17:34:13,362 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:34:13,362 INFO L82 GeneralOperation]: Start isEquivalent. First operand 32 states. Second operand 31 states. [2018-11-14 17:34:13,363 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand 31 states. [2018-11-14 17:34:13,363 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 31 states. [2018-11-14 17:34:13,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:34:13,368 INFO L93 Difference]: Finished difference Result 32 states and 34 transitions. [2018-11-14 17:34:13,368 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 34 transitions. [2018-11-14 17:34:13,369 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:34:13,369 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:34:13,369 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand 32 states. [2018-11-14 17:34:13,369 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 32 states. [2018-11-14 17:34:13,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:34:13,374 INFO L93 Difference]: Finished difference Result 32 states and 34 transitions. [2018-11-14 17:34:13,374 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 34 transitions. [2018-11-14 17:34:13,375 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:34:13,375 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:34:13,376 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:34:13,376 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:34:13,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-11-14 17:34:13,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 33 transitions. [2018-11-14 17:34:13,381 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 33 transitions. Word has length 21 [2018-11-14 17:34:13,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:34:13,381 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 33 transitions. [2018-11-14 17:34:13,381 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-14 17:34:13,382 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 33 transitions. [2018-11-14 17:34:13,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-14 17:34:13,383 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:34:13,383 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:34:13,384 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:34:13,384 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:34:13,384 INFO L82 PathProgramCache]: Analyzing trace with hash 1651874812, now seen corresponding path program 1 times [2018-11-14 17:34:13,384 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:34:13,385 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:34:13,386 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:34:13,386 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:34:13,386 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:34:13,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:34:13,730 INFO L256 TraceCheckUtils]: 0: Hoare triple {229#true} call ULTIMATE.init(); {229#true} is VALID [2018-11-14 17:34:13,731 INFO L273 TraceCheckUtils]: 1: Hoare triple {229#true} ~__BLAST_NONDET~0 := 0; {229#true} is VALID [2018-11-14 17:34:13,731 INFO L273 TraceCheckUtils]: 2: Hoare triple {229#true} assume true; {229#true} is VALID [2018-11-14 17:34:13,731 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {229#true} {229#true} #80#return; {229#true} is VALID [2018-11-14 17:34:13,731 INFO L256 TraceCheckUtils]: 4: Hoare triple {229#true} call #t~ret7 := main(); {229#true} is VALID [2018-11-14 17:34:13,732 INFO L273 TraceCheckUtils]: 5: Hoare triple {229#true} havoc ~i~0;havoc ~j~0;havoc ~k~0;havoc ~n~0;havoc ~l~0;havoc ~m~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~m~0 := #t~nondet2;havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~l~0 := #t~nondet3;havoc #t~nondet3; {229#true} is VALID [2018-11-14 17:34:13,732 INFO L273 TraceCheckUtils]: 6: Hoare triple {229#true} assume !!(-1000000 < ~n~0 && ~n~0 < 1000000); {229#true} is VALID [2018-11-14 17:34:13,732 INFO L273 TraceCheckUtils]: 7: Hoare triple {229#true} assume !!(-1000000 < ~m~0 && ~m~0 < 1000000); {229#true} is VALID [2018-11-14 17:34:13,733 INFO L273 TraceCheckUtils]: 8: Hoare triple {229#true} assume !!(-1000000 < ~l~0 && ~l~0 < 1000000); {229#true} is VALID [2018-11-14 17:34:13,733 INFO L273 TraceCheckUtils]: 9: Hoare triple {229#true} assume 3 * ~n~0 <= ~m~0 + ~l~0; {229#true} is VALID [2018-11-14 17:34:13,734 INFO L273 TraceCheckUtils]: 10: Hoare triple {229#true} ~i~0 := 0; {231#(<= 0 main_~i~0)} is VALID [2018-11-14 17:34:13,736 INFO L273 TraceCheckUtils]: 11: Hoare triple {231#(<= 0 main_~i~0)} assume true; {231#(<= 0 main_~i~0)} is VALID [2018-11-14 17:34:13,737 INFO L273 TraceCheckUtils]: 12: Hoare triple {231#(<= 0 main_~i~0)} assume !!(~i~0 < ~n~0);~j~0 := 2 * ~i~0; {231#(<= 0 main_~i~0)} is VALID [2018-11-14 17:34:13,738 INFO L273 TraceCheckUtils]: 13: Hoare triple {231#(<= 0 main_~i~0)} assume true; {231#(<= 0 main_~i~0)} is VALID [2018-11-14 17:34:13,738 INFO L273 TraceCheckUtils]: 14: Hoare triple {231#(<= 0 main_~i~0)} assume !(~j~0 < 3 * ~i~0); {231#(<= 0 main_~i~0)} is VALID [2018-11-14 17:34:13,740 INFO L273 TraceCheckUtils]: 15: Hoare triple {231#(<= 0 main_~i~0)} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {232#(<= 1 main_~i~0)} is VALID [2018-11-14 17:34:13,741 INFO L273 TraceCheckUtils]: 16: Hoare triple {232#(<= 1 main_~i~0)} assume true; {232#(<= 1 main_~i~0)} is VALID [2018-11-14 17:34:13,742 INFO L273 TraceCheckUtils]: 17: Hoare triple {232#(<= 1 main_~i~0)} assume !!(~i~0 < ~n~0);~j~0 := 2 * ~i~0; {233#(<= 2 main_~n~0)} is VALID [2018-11-14 17:34:13,744 INFO L273 TraceCheckUtils]: 18: Hoare triple {233#(<= 2 main_~n~0)} assume true; {233#(<= 2 main_~n~0)} is VALID [2018-11-14 17:34:13,745 INFO L273 TraceCheckUtils]: 19: Hoare triple {233#(<= 2 main_~n~0)} assume !!(~j~0 < 3 * ~i~0);~k~0 := ~i~0; {234#(<= (+ main_~k~0 4) (+ main_~i~0 (* 2 main_~n~0)))} is VALID [2018-11-14 17:34:13,746 INFO L273 TraceCheckUtils]: 20: Hoare triple {234#(<= (+ main_~k~0 4) (+ main_~i~0 (* 2 main_~n~0)))} assume true; {234#(<= (+ main_~k~0 4) (+ main_~i~0 (* 2 main_~n~0)))} is VALID [2018-11-14 17:34:13,747 INFO L273 TraceCheckUtils]: 21: Hoare triple {234#(<= (+ main_~k~0 4) (+ main_~i~0 (* 2 main_~n~0)))} assume !!(~k~0 < ~j~0); {234#(<= (+ main_~k~0 4) (+ main_~i~0 (* 2 main_~n~0)))} is VALID [2018-11-14 17:34:13,748 INFO L256 TraceCheckUtils]: 22: Hoare triple {234#(<= (+ main_~k~0 4) (+ main_~i~0 (* 2 main_~n~0)))} call __VERIFIER_assert((if ~k~0 - ~i~0 <= 2 * ~n~0 then 1 else 0)); {235#(= |__VERIFIER_assert_#in~cond| 1)} is VALID [2018-11-14 17:34:13,749 INFO L273 TraceCheckUtils]: 23: Hoare triple {235#(= |__VERIFIER_assert_#in~cond| 1)} ~cond := #in~cond; {236#(= __VERIFIER_assert_~cond 1)} is VALID [2018-11-14 17:34:13,769 INFO L273 TraceCheckUtils]: 24: Hoare triple {236#(= __VERIFIER_assert_~cond 1)} assume ~cond == 0; {230#false} is VALID [2018-11-14 17:34:13,769 INFO L273 TraceCheckUtils]: 25: Hoare triple {230#false} assume !false; {230#false} is VALID [2018-11-14 17:34:13,772 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 17:34:13,773 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 17:34:13,773 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-14 17:34:13,795 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:34:13,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:34:13,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:34:13,871 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:34:14,520 INFO L256 TraceCheckUtils]: 0: Hoare triple {229#true} call ULTIMATE.init(); {229#true} is VALID [2018-11-14 17:34:14,520 INFO L273 TraceCheckUtils]: 1: Hoare triple {229#true} ~__BLAST_NONDET~0 := 0; {229#true} is VALID [2018-11-14 17:34:14,520 INFO L273 TraceCheckUtils]: 2: Hoare triple {229#true} assume true; {229#true} is VALID [2018-11-14 17:34:14,521 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {229#true} {229#true} #80#return; {229#true} is VALID [2018-11-14 17:34:14,521 INFO L256 TraceCheckUtils]: 4: Hoare triple {229#true} call #t~ret7 := main(); {229#true} is VALID [2018-11-14 17:34:14,521 INFO L273 TraceCheckUtils]: 5: Hoare triple {229#true} havoc ~i~0;havoc ~j~0;havoc ~k~0;havoc ~n~0;havoc ~l~0;havoc ~m~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~m~0 := #t~nondet2;havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~l~0 := #t~nondet3;havoc #t~nondet3; {229#true} is VALID [2018-11-14 17:34:14,522 INFO L273 TraceCheckUtils]: 6: Hoare triple {229#true} assume !!(-1000000 < ~n~0 && ~n~0 < 1000000); {229#true} is VALID [2018-11-14 17:34:14,522 INFO L273 TraceCheckUtils]: 7: Hoare triple {229#true} assume !!(-1000000 < ~m~0 && ~m~0 < 1000000); {229#true} is VALID [2018-11-14 17:34:14,522 INFO L273 TraceCheckUtils]: 8: Hoare triple {229#true} assume !!(-1000000 < ~l~0 && ~l~0 < 1000000); {229#true} is VALID [2018-11-14 17:34:14,523 INFO L273 TraceCheckUtils]: 9: Hoare triple {229#true} assume 3 * ~n~0 <= ~m~0 + ~l~0; {229#true} is VALID [2018-11-14 17:34:14,523 INFO L273 TraceCheckUtils]: 10: Hoare triple {229#true} ~i~0 := 0; {231#(<= 0 main_~i~0)} is VALID [2018-11-14 17:34:14,527 INFO L273 TraceCheckUtils]: 11: Hoare triple {231#(<= 0 main_~i~0)} assume true; {231#(<= 0 main_~i~0)} is VALID [2018-11-14 17:34:14,527 INFO L273 TraceCheckUtils]: 12: Hoare triple {231#(<= 0 main_~i~0)} assume !!(~i~0 < ~n~0);~j~0 := 2 * ~i~0; {231#(<= 0 main_~i~0)} is VALID [2018-11-14 17:34:14,528 INFO L273 TraceCheckUtils]: 13: Hoare triple {231#(<= 0 main_~i~0)} assume true; {231#(<= 0 main_~i~0)} is VALID [2018-11-14 17:34:14,528 INFO L273 TraceCheckUtils]: 14: Hoare triple {231#(<= 0 main_~i~0)} assume !(~j~0 < 3 * ~i~0); {231#(<= 0 main_~i~0)} is VALID [2018-11-14 17:34:14,530 INFO L273 TraceCheckUtils]: 15: Hoare triple {231#(<= 0 main_~i~0)} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {232#(<= 1 main_~i~0)} is VALID [2018-11-14 17:34:14,531 INFO L273 TraceCheckUtils]: 16: Hoare triple {232#(<= 1 main_~i~0)} assume true; {232#(<= 1 main_~i~0)} is VALID [2018-11-14 17:34:14,533 INFO L273 TraceCheckUtils]: 17: Hoare triple {232#(<= 1 main_~i~0)} assume !!(~i~0 < ~n~0);~j~0 := 2 * ~i~0; {291#(and (<= 1 main_~i~0) (< main_~i~0 main_~n~0))} is VALID [2018-11-14 17:34:14,533 INFO L273 TraceCheckUtils]: 18: Hoare triple {291#(and (<= 1 main_~i~0) (< main_~i~0 main_~n~0))} assume true; {291#(and (<= 1 main_~i~0) (< main_~i~0 main_~n~0))} is VALID [2018-11-14 17:34:14,553 INFO L273 TraceCheckUtils]: 19: Hoare triple {291#(and (<= 1 main_~i~0) (< main_~i~0 main_~n~0))} assume !!(~j~0 < 3 * ~i~0);~k~0 := ~i~0; {298#(and (<= 1 main_~i~0) (< main_~i~0 main_~n~0) (<= main_~k~0 main_~i~0))} is VALID [2018-11-14 17:34:14,559 INFO L273 TraceCheckUtils]: 20: Hoare triple {298#(and (<= 1 main_~i~0) (< main_~i~0 main_~n~0) (<= main_~k~0 main_~i~0))} assume true; {298#(and (<= 1 main_~i~0) (< main_~i~0 main_~n~0) (<= main_~k~0 main_~i~0))} is VALID [2018-11-14 17:34:14,561 INFO L273 TraceCheckUtils]: 21: Hoare triple {298#(and (<= 1 main_~i~0) (< main_~i~0 main_~n~0) (<= main_~k~0 main_~i~0))} assume !!(~k~0 < ~j~0); {298#(and (<= 1 main_~i~0) (< main_~i~0 main_~n~0) (<= main_~k~0 main_~i~0))} is VALID [2018-11-14 17:34:14,562 INFO L256 TraceCheckUtils]: 22: Hoare triple {298#(and (<= 1 main_~i~0) (< main_~i~0 main_~n~0) (<= main_~k~0 main_~i~0))} call __VERIFIER_assert((if ~k~0 - ~i~0 <= 2 * ~n~0 then 1 else 0)); {235#(= |__VERIFIER_assert_#in~cond| 1)} is VALID [2018-11-14 17:34:14,563 INFO L273 TraceCheckUtils]: 23: Hoare triple {235#(= |__VERIFIER_assert_#in~cond| 1)} ~cond := #in~cond; {236#(= __VERIFIER_assert_~cond 1)} is VALID [2018-11-14 17:34:14,569 INFO L273 TraceCheckUtils]: 24: Hoare triple {236#(= __VERIFIER_assert_~cond 1)} assume ~cond == 0; {230#false} is VALID [2018-11-14 17:34:14,569 INFO L273 TraceCheckUtils]: 25: Hoare triple {230#false} assume !false; {230#false} is VALID [2018-11-14 17:34:14,571 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 17:34:14,596 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-14 17:34:14,596 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [8] total 10 [2018-11-14 17:34:14,597 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 26 [2018-11-14 17:34:14,598 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:34:14,598 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2018-11-14 17:34:14,685 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:34:14,685 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-14 17:34:14,686 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-14 17:34:14,686 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2018-11-14 17:34:14,686 INFO L87 Difference]: Start difference. First operand 31 states and 33 transitions. Second operand 10 states. [2018-11-14 17:34:15,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:34:15,416 INFO L93 Difference]: Finished difference Result 53 states and 58 transitions. [2018-11-14 17:34:15,416 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-14 17:34:15,416 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 26 [2018-11-14 17:34:15,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:34:15,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-14 17:34:15,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 58 transitions. [2018-11-14 17:34:15,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-14 17:34:15,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 58 transitions. [2018-11-14 17:34:15,424 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 58 transitions. [2018-11-14 17:34:15,564 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:34:15,568 INFO L225 Difference]: With dead ends: 53 [2018-11-14 17:34:15,568 INFO L226 Difference]: Without dead ends: 51 [2018-11-14 17:34:15,570 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 24 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2018-11-14 17:34:15,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-11-14 17:34:15,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 38. [2018-11-14 17:34:15,625 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:34:15,625 INFO L82 GeneralOperation]: Start isEquivalent. First operand 51 states. Second operand 38 states. [2018-11-14 17:34:15,625 INFO L74 IsIncluded]: Start isIncluded. First operand 51 states. Second operand 38 states. [2018-11-14 17:34:15,625 INFO L87 Difference]: Start difference. First operand 51 states. Second operand 38 states. [2018-11-14 17:34:15,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:34:15,630 INFO L93 Difference]: Finished difference Result 51 states and 56 transitions. [2018-11-14 17:34:15,630 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 56 transitions. [2018-11-14 17:34:15,631 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:34:15,631 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:34:15,632 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand 51 states. [2018-11-14 17:34:15,632 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 51 states. [2018-11-14 17:34:15,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:34:15,636 INFO L93 Difference]: Finished difference Result 51 states and 56 transitions. [2018-11-14 17:34:15,636 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 56 transitions. [2018-11-14 17:34:15,637 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:34:15,637 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:34:15,637 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:34:15,637 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:34:15,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-11-14 17:34:15,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 41 transitions. [2018-11-14 17:34:15,641 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 41 transitions. Word has length 26 [2018-11-14 17:34:15,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:34:15,641 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 41 transitions. [2018-11-14 17:34:15,641 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-14 17:34:15,641 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 41 transitions. [2018-11-14 17:34:15,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-11-14 17:34:15,643 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:34:15,643 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:34:15,643 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:34:15,643 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:34:15,644 INFO L82 PathProgramCache]: Analyzing trace with hash -1162553418, now seen corresponding path program 1 times [2018-11-14 17:34:15,644 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:34:15,644 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:34:15,645 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:34:15,645 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:34:15,645 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:34:15,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:34:15,800 INFO L256 TraceCheckUtils]: 0: Hoare triple {549#true} call ULTIMATE.init(); {549#true} is VALID [2018-11-14 17:34:15,800 INFO L273 TraceCheckUtils]: 1: Hoare triple {549#true} ~__BLAST_NONDET~0 := 0; {549#true} is VALID [2018-11-14 17:34:15,800 INFO L273 TraceCheckUtils]: 2: Hoare triple {549#true} assume true; {549#true} is VALID [2018-11-14 17:34:15,801 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {549#true} {549#true} #80#return; {549#true} is VALID [2018-11-14 17:34:15,801 INFO L256 TraceCheckUtils]: 4: Hoare triple {549#true} call #t~ret7 := main(); {549#true} is VALID [2018-11-14 17:34:15,801 INFO L273 TraceCheckUtils]: 5: Hoare triple {549#true} havoc ~i~0;havoc ~j~0;havoc ~k~0;havoc ~n~0;havoc ~l~0;havoc ~m~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~m~0 := #t~nondet2;havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~l~0 := #t~nondet3;havoc #t~nondet3; {549#true} is VALID [2018-11-14 17:34:15,801 INFO L273 TraceCheckUtils]: 6: Hoare triple {549#true} assume !!(-1000000 < ~n~0 && ~n~0 < 1000000); {549#true} is VALID [2018-11-14 17:34:15,802 INFO L273 TraceCheckUtils]: 7: Hoare triple {549#true} assume !!(-1000000 < ~m~0 && ~m~0 < 1000000); {549#true} is VALID [2018-11-14 17:34:15,802 INFO L273 TraceCheckUtils]: 8: Hoare triple {549#true} assume !!(-1000000 < ~l~0 && ~l~0 < 1000000); {549#true} is VALID [2018-11-14 17:34:15,802 INFO L273 TraceCheckUtils]: 9: Hoare triple {549#true} assume 3 * ~n~0 <= ~m~0 + ~l~0; {549#true} is VALID [2018-11-14 17:34:15,809 INFO L273 TraceCheckUtils]: 10: Hoare triple {549#true} ~i~0 := 0; {551#(<= main_~i~0 0)} is VALID [2018-11-14 17:34:15,810 INFO L273 TraceCheckUtils]: 11: Hoare triple {551#(<= main_~i~0 0)} assume true; {551#(<= main_~i~0 0)} is VALID [2018-11-14 17:34:15,810 INFO L273 TraceCheckUtils]: 12: Hoare triple {551#(<= main_~i~0 0)} assume !!(~i~0 < ~n~0);~j~0 := 2 * ~i~0; {551#(<= main_~i~0 0)} is VALID [2018-11-14 17:34:15,815 INFO L273 TraceCheckUtils]: 13: Hoare triple {551#(<= main_~i~0 0)} assume true; {551#(<= main_~i~0 0)} is VALID [2018-11-14 17:34:15,815 INFO L273 TraceCheckUtils]: 14: Hoare triple {551#(<= main_~i~0 0)} assume !(~j~0 < 3 * ~i~0); {551#(<= main_~i~0 0)} is VALID [2018-11-14 17:34:15,817 INFO L273 TraceCheckUtils]: 15: Hoare triple {551#(<= main_~i~0 0)} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {552#(<= main_~i~0 1)} is VALID [2018-11-14 17:34:15,818 INFO L273 TraceCheckUtils]: 16: Hoare triple {552#(<= main_~i~0 1)} assume true; {552#(<= main_~i~0 1)} is VALID [2018-11-14 17:34:15,819 INFO L273 TraceCheckUtils]: 17: Hoare triple {552#(<= main_~i~0 1)} assume !!(~i~0 < ~n~0);~j~0 := 2 * ~i~0; {553#(<= main_~j~0 (+ main_~i~0 1))} is VALID [2018-11-14 17:34:15,820 INFO L273 TraceCheckUtils]: 18: Hoare triple {553#(<= main_~j~0 (+ main_~i~0 1))} assume true; {553#(<= main_~j~0 (+ main_~i~0 1))} is VALID [2018-11-14 17:34:15,821 INFO L273 TraceCheckUtils]: 19: Hoare triple {553#(<= main_~j~0 (+ main_~i~0 1))} assume !!(~j~0 < 3 * ~i~0);~k~0 := ~i~0; {554#(<= main_~j~0 (+ main_~k~0 1))} is VALID [2018-11-14 17:34:15,831 INFO L273 TraceCheckUtils]: 20: Hoare triple {554#(<= main_~j~0 (+ main_~k~0 1))} assume true; {554#(<= main_~j~0 (+ main_~k~0 1))} is VALID [2018-11-14 17:34:15,832 INFO L273 TraceCheckUtils]: 21: Hoare triple {554#(<= main_~j~0 (+ main_~k~0 1))} assume !!(~k~0 < ~j~0); {554#(<= main_~j~0 (+ main_~k~0 1))} is VALID [2018-11-14 17:34:15,832 INFO L256 TraceCheckUtils]: 22: Hoare triple {554#(<= main_~j~0 (+ main_~k~0 1))} call __VERIFIER_assert((if ~k~0 - ~i~0 <= 2 * ~n~0 then 1 else 0)); {549#true} is VALID [2018-11-14 17:34:15,832 INFO L273 TraceCheckUtils]: 23: Hoare triple {549#true} ~cond := #in~cond; {549#true} is VALID [2018-11-14 17:34:15,832 INFO L273 TraceCheckUtils]: 24: Hoare triple {549#true} assume !(~cond == 0); {549#true} is VALID [2018-11-14 17:34:15,833 INFO L273 TraceCheckUtils]: 25: Hoare triple {549#true} assume true; {549#true} is VALID [2018-11-14 17:34:15,834 INFO L268 TraceCheckUtils]: 26: Hoare quadruple {549#true} {554#(<= main_~j~0 (+ main_~k~0 1))} #84#return; {554#(<= main_~j~0 (+ main_~k~0 1))} is VALID [2018-11-14 17:34:15,837 INFO L273 TraceCheckUtils]: 27: Hoare triple {554#(<= main_~j~0 (+ main_~k~0 1))} #t~post6 := ~k~0;~k~0 := #t~post6 + 1;havoc #t~post6; {555#(<= main_~j~0 main_~k~0)} is VALID [2018-11-14 17:34:15,839 INFO L273 TraceCheckUtils]: 28: Hoare triple {555#(<= main_~j~0 main_~k~0)} assume true; {555#(<= main_~j~0 main_~k~0)} is VALID [2018-11-14 17:34:15,839 INFO L273 TraceCheckUtils]: 29: Hoare triple {555#(<= main_~j~0 main_~k~0)} assume !!(~k~0 < ~j~0); {550#false} is VALID [2018-11-14 17:34:15,839 INFO L256 TraceCheckUtils]: 30: Hoare triple {550#false} call __VERIFIER_assert((if ~k~0 - ~i~0 <= 2 * ~n~0 then 1 else 0)); {550#false} is VALID [2018-11-14 17:34:15,840 INFO L273 TraceCheckUtils]: 31: Hoare triple {550#false} ~cond := #in~cond; {550#false} is VALID [2018-11-14 17:34:15,840 INFO L273 TraceCheckUtils]: 32: Hoare triple {550#false} assume ~cond == 0; {550#false} is VALID [2018-11-14 17:34:15,840 INFO L273 TraceCheckUtils]: 33: Hoare triple {550#false} assume !false; {550#false} is VALID [2018-11-14 17:34:15,843 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 17:34:15,844 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 17:34:15,844 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-14 17:34:15,863 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:34:15,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:34:15,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:34:15,893 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:34:16,194 INFO L256 TraceCheckUtils]: 0: Hoare triple {549#true} call ULTIMATE.init(); {549#true} is VALID [2018-11-14 17:34:16,195 INFO L273 TraceCheckUtils]: 1: Hoare triple {549#true} ~__BLAST_NONDET~0 := 0; {549#true} is VALID [2018-11-14 17:34:16,195 INFO L273 TraceCheckUtils]: 2: Hoare triple {549#true} assume true; {549#true} is VALID [2018-11-14 17:34:16,196 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {549#true} {549#true} #80#return; {549#true} is VALID [2018-11-14 17:34:16,196 INFO L256 TraceCheckUtils]: 4: Hoare triple {549#true} call #t~ret7 := main(); {549#true} is VALID [2018-11-14 17:34:16,197 INFO L273 TraceCheckUtils]: 5: Hoare triple {549#true} havoc ~i~0;havoc ~j~0;havoc ~k~0;havoc ~n~0;havoc ~l~0;havoc ~m~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~m~0 := #t~nondet2;havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~l~0 := #t~nondet3;havoc #t~nondet3; {549#true} is VALID [2018-11-14 17:34:16,197 INFO L273 TraceCheckUtils]: 6: Hoare triple {549#true} assume !!(-1000000 < ~n~0 && ~n~0 < 1000000); {549#true} is VALID [2018-11-14 17:34:16,197 INFO L273 TraceCheckUtils]: 7: Hoare triple {549#true} assume !!(-1000000 < ~m~0 && ~m~0 < 1000000); {549#true} is VALID [2018-11-14 17:34:16,198 INFO L273 TraceCheckUtils]: 8: Hoare triple {549#true} assume !!(-1000000 < ~l~0 && ~l~0 < 1000000); {549#true} is VALID [2018-11-14 17:34:16,198 INFO L273 TraceCheckUtils]: 9: Hoare triple {549#true} assume 3 * ~n~0 <= ~m~0 + ~l~0; {549#true} is VALID [2018-11-14 17:34:16,198 INFO L273 TraceCheckUtils]: 10: Hoare triple {549#true} ~i~0 := 0; {551#(<= main_~i~0 0)} is VALID [2018-11-14 17:34:16,200 INFO L273 TraceCheckUtils]: 11: Hoare triple {551#(<= main_~i~0 0)} assume true; {551#(<= main_~i~0 0)} is VALID [2018-11-14 17:34:16,200 INFO L273 TraceCheckUtils]: 12: Hoare triple {551#(<= main_~i~0 0)} assume !!(~i~0 < ~n~0);~j~0 := 2 * ~i~0; {551#(<= main_~i~0 0)} is VALID [2018-11-14 17:34:16,201 INFO L273 TraceCheckUtils]: 13: Hoare triple {551#(<= main_~i~0 0)} assume true; {551#(<= main_~i~0 0)} is VALID [2018-11-14 17:34:16,214 INFO L273 TraceCheckUtils]: 14: Hoare triple {551#(<= main_~i~0 0)} assume !(~j~0 < 3 * ~i~0); {551#(<= main_~i~0 0)} is VALID [2018-11-14 17:34:16,216 INFO L273 TraceCheckUtils]: 15: Hoare triple {551#(<= main_~i~0 0)} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {552#(<= main_~i~0 1)} is VALID [2018-11-14 17:34:16,220 INFO L273 TraceCheckUtils]: 16: Hoare triple {552#(<= main_~i~0 1)} assume true; {552#(<= main_~i~0 1)} is VALID [2018-11-14 17:34:16,222 INFO L273 TraceCheckUtils]: 17: Hoare triple {552#(<= main_~i~0 1)} assume !!(~i~0 < ~n~0);~j~0 := 2 * ~i~0; {610#(and (<= main_~j~0 (* 2 main_~i~0)) (<= main_~i~0 1))} is VALID [2018-11-14 17:34:16,223 INFO L273 TraceCheckUtils]: 18: Hoare triple {610#(and (<= main_~j~0 (* 2 main_~i~0)) (<= main_~i~0 1))} assume true; {610#(and (<= main_~j~0 (* 2 main_~i~0)) (<= main_~i~0 1))} is VALID [2018-11-14 17:34:16,225 INFO L273 TraceCheckUtils]: 19: Hoare triple {610#(and (<= main_~j~0 (* 2 main_~i~0)) (<= main_~i~0 1))} assume !!(~j~0 < 3 * ~i~0);~k~0 := ~i~0; {617#(exists ((main_~i~0 Int)) (and (<= main_~j~0 (* 2 main_~i~0)) (<= main_~i~0 1) (<= main_~i~0 main_~k~0)))} is VALID [2018-11-14 17:34:16,227 INFO L273 TraceCheckUtils]: 20: Hoare triple {617#(exists ((main_~i~0 Int)) (and (<= main_~j~0 (* 2 main_~i~0)) (<= main_~i~0 1) (<= main_~i~0 main_~k~0)))} assume true; {617#(exists ((main_~i~0 Int)) (and (<= main_~j~0 (* 2 main_~i~0)) (<= main_~i~0 1) (<= main_~i~0 main_~k~0)))} is VALID [2018-11-14 17:34:16,230 INFO L273 TraceCheckUtils]: 21: Hoare triple {617#(exists ((main_~i~0 Int)) (and (<= main_~j~0 (* 2 main_~i~0)) (<= main_~i~0 1) (<= main_~i~0 main_~k~0)))} assume !!(~k~0 < ~j~0); {617#(exists ((main_~i~0 Int)) (and (<= main_~j~0 (* 2 main_~i~0)) (<= main_~i~0 1) (<= main_~i~0 main_~k~0)))} is VALID [2018-11-14 17:34:16,230 INFO L256 TraceCheckUtils]: 22: Hoare triple {617#(exists ((main_~i~0 Int)) (and (<= main_~j~0 (* 2 main_~i~0)) (<= main_~i~0 1) (<= main_~i~0 main_~k~0)))} call __VERIFIER_assert((if ~k~0 - ~i~0 <= 2 * ~n~0 then 1 else 0)); {549#true} is VALID [2018-11-14 17:34:16,231 INFO L273 TraceCheckUtils]: 23: Hoare triple {549#true} ~cond := #in~cond; {549#true} is VALID [2018-11-14 17:34:16,231 INFO L273 TraceCheckUtils]: 24: Hoare triple {549#true} assume !(~cond == 0); {549#true} is VALID [2018-11-14 17:34:16,231 INFO L273 TraceCheckUtils]: 25: Hoare triple {549#true} assume true; {549#true} is VALID [2018-11-14 17:34:16,236 INFO L268 TraceCheckUtils]: 26: Hoare quadruple {549#true} {617#(exists ((main_~i~0 Int)) (and (<= main_~j~0 (* 2 main_~i~0)) (<= main_~i~0 1) (<= main_~i~0 main_~k~0)))} #84#return; {617#(exists ((main_~i~0 Int)) (and (<= main_~j~0 (* 2 main_~i~0)) (<= main_~i~0 1) (<= main_~i~0 main_~k~0)))} is VALID [2018-11-14 17:34:16,240 INFO L273 TraceCheckUtils]: 27: Hoare triple {617#(exists ((main_~i~0 Int)) (and (<= main_~j~0 (* 2 main_~i~0)) (<= main_~i~0 1) (<= main_~i~0 main_~k~0)))} #t~post6 := ~k~0;~k~0 := #t~post6 + 1;havoc #t~post6; {642#(exists ((main_~i~0 Int)) (and (<= main_~j~0 (* 2 main_~i~0)) (<= main_~i~0 1) (<= (+ main_~i~0 1) main_~k~0)))} is VALID [2018-11-14 17:34:16,241 INFO L273 TraceCheckUtils]: 28: Hoare triple {642#(exists ((main_~i~0 Int)) (and (<= main_~j~0 (* 2 main_~i~0)) (<= main_~i~0 1) (<= (+ main_~i~0 1) main_~k~0)))} assume true; {642#(exists ((main_~i~0 Int)) (and (<= main_~j~0 (* 2 main_~i~0)) (<= main_~i~0 1) (<= (+ main_~i~0 1) main_~k~0)))} is VALID [2018-11-14 17:34:16,241 INFO L273 TraceCheckUtils]: 29: Hoare triple {642#(exists ((main_~i~0 Int)) (and (<= main_~j~0 (* 2 main_~i~0)) (<= main_~i~0 1) (<= (+ main_~i~0 1) main_~k~0)))} assume !!(~k~0 < ~j~0); {550#false} is VALID [2018-11-14 17:34:16,242 INFO L256 TraceCheckUtils]: 30: Hoare triple {550#false} call __VERIFIER_assert((if ~k~0 - ~i~0 <= 2 * ~n~0 then 1 else 0)); {550#false} is VALID [2018-11-14 17:34:16,242 INFO L273 TraceCheckUtils]: 31: Hoare triple {550#false} ~cond := #in~cond; {550#false} is VALID [2018-11-14 17:34:16,242 INFO L273 TraceCheckUtils]: 32: Hoare triple {550#false} assume ~cond == 0; {550#false} is VALID [2018-11-14 17:34:16,242 INFO L273 TraceCheckUtils]: 33: Hoare triple {550#false} assume !false; {550#false} is VALID [2018-11-14 17:34:16,246 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 17:34:16,268 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 17:34:16,268 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2018-11-14 17:34:16,269 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 34 [2018-11-14 17:34:16,269 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:34:16,269 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2018-11-14 17:34:16,456 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:34:16,457 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-14 17:34:16,457 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-14 17:34:16,457 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-11-14 17:34:16,458 INFO L87 Difference]: Start difference. First operand 38 states and 41 transitions. Second operand 10 states. [2018-11-14 17:34:17,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:34:17,547 INFO L93 Difference]: Finished difference Result 82 states and 94 transitions. [2018-11-14 17:34:17,547 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-14 17:34:17,548 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 34 [2018-11-14 17:34:17,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:34:17,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-14 17:34:17,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 78 transitions. [2018-11-14 17:34:17,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-14 17:34:17,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 78 transitions. [2018-11-14 17:34:17,562 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 78 transitions. [2018-11-14 17:34:17,695 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 78 edges. 78 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:34:17,698 INFO L225 Difference]: With dead ends: 82 [2018-11-14 17:34:17,699 INFO L226 Difference]: Without dead ends: 59 [2018-11-14 17:34:17,699 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=65, Invalid=145, Unknown=0, NotChecked=0, Total=210 [2018-11-14 17:34:17,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-11-14 17:34:17,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 52. [2018-11-14 17:34:17,790 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:34:17,790 INFO L82 GeneralOperation]: Start isEquivalent. First operand 59 states. Second operand 52 states. [2018-11-14 17:34:17,790 INFO L74 IsIncluded]: Start isIncluded. First operand 59 states. Second operand 52 states. [2018-11-14 17:34:17,790 INFO L87 Difference]: Start difference. First operand 59 states. Second operand 52 states. [2018-11-14 17:34:17,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:34:17,795 INFO L93 Difference]: Finished difference Result 59 states and 67 transitions. [2018-11-14 17:34:17,795 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 67 transitions. [2018-11-14 17:34:17,796 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:34:17,797 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:34:17,797 INFO L74 IsIncluded]: Start isIncluded. First operand 52 states. Second operand 59 states. [2018-11-14 17:34:17,797 INFO L87 Difference]: Start difference. First operand 52 states. Second operand 59 states. [2018-11-14 17:34:17,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:34:17,802 INFO L93 Difference]: Finished difference Result 59 states and 67 transitions. [2018-11-14 17:34:17,802 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 67 transitions. [2018-11-14 17:34:17,804 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:34:17,804 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:34:17,804 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:34:17,804 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:34:17,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-11-14 17:34:17,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 59 transitions. [2018-11-14 17:34:17,808 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 59 transitions. Word has length 34 [2018-11-14 17:34:17,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:34:17,808 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 59 transitions. [2018-11-14 17:34:17,808 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-14 17:34:17,809 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 59 transitions. [2018-11-14 17:34:17,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-11-14 17:34:17,810 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:34:17,810 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:34:17,811 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:34:17,811 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:34:17,811 INFO L82 PathProgramCache]: Analyzing trace with hash -1325122332, now seen corresponding path program 1 times [2018-11-14 17:34:17,811 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:34:17,811 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:34:17,812 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:34:17,813 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:34:17,813 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:34:17,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:34:17,988 INFO L256 TraceCheckUtils]: 0: Hoare triple {972#true} call ULTIMATE.init(); {972#true} is VALID [2018-11-14 17:34:17,988 INFO L273 TraceCheckUtils]: 1: Hoare triple {972#true} ~__BLAST_NONDET~0 := 0; {972#true} is VALID [2018-11-14 17:34:17,989 INFO L273 TraceCheckUtils]: 2: Hoare triple {972#true} assume true; {972#true} is VALID [2018-11-14 17:34:17,989 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {972#true} {972#true} #80#return; {972#true} is VALID [2018-11-14 17:34:17,989 INFO L256 TraceCheckUtils]: 4: Hoare triple {972#true} call #t~ret7 := main(); {972#true} is VALID [2018-11-14 17:34:17,989 INFO L273 TraceCheckUtils]: 5: Hoare triple {972#true} havoc ~i~0;havoc ~j~0;havoc ~k~0;havoc ~n~0;havoc ~l~0;havoc ~m~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~m~0 := #t~nondet2;havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~l~0 := #t~nondet3;havoc #t~nondet3; {972#true} is VALID [2018-11-14 17:34:17,989 INFO L273 TraceCheckUtils]: 6: Hoare triple {972#true} assume !!(-1000000 < ~n~0 && ~n~0 < 1000000); {972#true} is VALID [2018-11-14 17:34:17,990 INFO L273 TraceCheckUtils]: 7: Hoare triple {972#true} assume !!(-1000000 < ~m~0 && ~m~0 < 1000000); {972#true} is VALID [2018-11-14 17:34:17,990 INFO L273 TraceCheckUtils]: 8: Hoare triple {972#true} assume !!(-1000000 < ~l~0 && ~l~0 < 1000000); {972#true} is VALID [2018-11-14 17:34:17,991 INFO L273 TraceCheckUtils]: 9: Hoare triple {972#true} assume 3 * ~n~0 <= ~m~0 + ~l~0; {972#true} is VALID [2018-11-14 17:34:17,993 INFO L273 TraceCheckUtils]: 10: Hoare triple {972#true} ~i~0 := 0; {974#(<= 0 main_~i~0)} is VALID [2018-11-14 17:34:17,994 INFO L273 TraceCheckUtils]: 11: Hoare triple {974#(<= 0 main_~i~0)} assume true; {974#(<= 0 main_~i~0)} is VALID [2018-11-14 17:34:17,995 INFO L273 TraceCheckUtils]: 12: Hoare triple {974#(<= 0 main_~i~0)} assume !!(~i~0 < ~n~0);~j~0 := 2 * ~i~0; {974#(<= 0 main_~i~0)} is VALID [2018-11-14 17:34:17,995 INFO L273 TraceCheckUtils]: 13: Hoare triple {974#(<= 0 main_~i~0)} assume true; {974#(<= 0 main_~i~0)} is VALID [2018-11-14 17:34:17,996 INFO L273 TraceCheckUtils]: 14: Hoare triple {974#(<= 0 main_~i~0)} assume !(~j~0 < 3 * ~i~0); {974#(<= 0 main_~i~0)} is VALID [2018-11-14 17:34:17,997 INFO L273 TraceCheckUtils]: 15: Hoare triple {974#(<= 0 main_~i~0)} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {975#(<= 1 main_~i~0)} is VALID [2018-11-14 17:34:17,998 INFO L273 TraceCheckUtils]: 16: Hoare triple {975#(<= 1 main_~i~0)} assume true; {975#(<= 1 main_~i~0)} is VALID [2018-11-14 17:34:17,998 INFO L273 TraceCheckUtils]: 17: Hoare triple {975#(<= 1 main_~i~0)} assume !!(~i~0 < ~n~0);~j~0 := 2 * ~i~0; {975#(<= 1 main_~i~0)} is VALID [2018-11-14 17:34:17,999 INFO L273 TraceCheckUtils]: 18: Hoare triple {975#(<= 1 main_~i~0)} assume true; {975#(<= 1 main_~i~0)} is VALID [2018-11-14 17:34:18,000 INFO L273 TraceCheckUtils]: 19: Hoare triple {975#(<= 1 main_~i~0)} assume !!(~j~0 < 3 * ~i~0);~k~0 := ~i~0; {976#(<= (+ main_~k~0 2) (* 3 main_~i~0))} is VALID [2018-11-14 17:34:18,001 INFO L273 TraceCheckUtils]: 20: Hoare triple {976#(<= (+ main_~k~0 2) (* 3 main_~i~0))} assume true; {976#(<= (+ main_~k~0 2) (* 3 main_~i~0))} is VALID [2018-11-14 17:34:18,002 INFO L273 TraceCheckUtils]: 21: Hoare triple {976#(<= (+ main_~k~0 2) (* 3 main_~i~0))} assume !(~k~0 < ~j~0); {977#(<= (+ main_~j~0 2) (* 3 main_~i~0))} is VALID [2018-11-14 17:34:18,003 INFO L273 TraceCheckUtils]: 22: Hoare triple {977#(<= (+ main_~j~0 2) (* 3 main_~i~0))} #t~post5 := ~j~0;~j~0 := #t~post5 + 1;havoc #t~post5; {978#(<= (+ main_~j~0 1) (* 3 main_~i~0))} is VALID [2018-11-14 17:34:18,004 INFO L273 TraceCheckUtils]: 23: Hoare triple {978#(<= (+ main_~j~0 1) (* 3 main_~i~0))} assume true; {978#(<= (+ main_~j~0 1) (* 3 main_~i~0))} is VALID [2018-11-14 17:34:18,005 INFO L273 TraceCheckUtils]: 24: Hoare triple {978#(<= (+ main_~j~0 1) (* 3 main_~i~0))} assume !(~j~0 < 3 * ~i~0); {973#false} is VALID [2018-11-14 17:34:18,005 INFO L273 TraceCheckUtils]: 25: Hoare triple {973#false} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {973#false} is VALID [2018-11-14 17:34:18,006 INFO L273 TraceCheckUtils]: 26: Hoare triple {973#false} assume true; {973#false} is VALID [2018-11-14 17:34:18,006 INFO L273 TraceCheckUtils]: 27: Hoare triple {973#false} assume !!(~i~0 < ~n~0);~j~0 := 2 * ~i~0; {973#false} is VALID [2018-11-14 17:34:18,006 INFO L273 TraceCheckUtils]: 28: Hoare triple {973#false} assume true; {973#false} is VALID [2018-11-14 17:34:18,007 INFO L273 TraceCheckUtils]: 29: Hoare triple {973#false} assume !!(~j~0 < 3 * ~i~0);~k~0 := ~i~0; {973#false} is VALID [2018-11-14 17:34:18,007 INFO L273 TraceCheckUtils]: 30: Hoare triple {973#false} assume true; {973#false} is VALID [2018-11-14 17:34:18,007 INFO L273 TraceCheckUtils]: 31: Hoare triple {973#false} assume !!(~k~0 < ~j~0); {973#false} is VALID [2018-11-14 17:34:18,008 INFO L256 TraceCheckUtils]: 32: Hoare triple {973#false} call __VERIFIER_assert((if ~k~0 - ~i~0 <= 2 * ~n~0 then 1 else 0)); {972#true} is VALID [2018-11-14 17:34:18,008 INFO L273 TraceCheckUtils]: 33: Hoare triple {972#true} ~cond := #in~cond; {972#true} is VALID [2018-11-14 17:34:18,008 INFO L273 TraceCheckUtils]: 34: Hoare triple {972#true} assume !(~cond == 0); {972#true} is VALID [2018-11-14 17:34:18,009 INFO L273 TraceCheckUtils]: 35: Hoare triple {972#true} assume true; {972#true} is VALID [2018-11-14 17:34:18,009 INFO L268 TraceCheckUtils]: 36: Hoare quadruple {972#true} {973#false} #84#return; {973#false} is VALID [2018-11-14 17:34:18,009 INFO L273 TraceCheckUtils]: 37: Hoare triple {973#false} #t~post6 := ~k~0;~k~0 := #t~post6 + 1;havoc #t~post6; {973#false} is VALID [2018-11-14 17:34:18,009 INFO L273 TraceCheckUtils]: 38: Hoare triple {973#false} assume true; {973#false} is VALID [2018-11-14 17:34:18,009 INFO L273 TraceCheckUtils]: 39: Hoare triple {973#false} assume !!(~k~0 < ~j~0); {973#false} is VALID [2018-11-14 17:34:18,010 INFO L256 TraceCheckUtils]: 40: Hoare triple {973#false} call __VERIFIER_assert((if ~k~0 - ~i~0 <= 2 * ~n~0 then 1 else 0)); {973#false} is VALID [2018-11-14 17:34:18,010 INFO L273 TraceCheckUtils]: 41: Hoare triple {973#false} ~cond := #in~cond; {973#false} is VALID [2018-11-14 17:34:18,010 INFO L273 TraceCheckUtils]: 42: Hoare triple {973#false} assume ~cond == 0; {973#false} is VALID [2018-11-14 17:34:18,010 INFO L273 TraceCheckUtils]: 43: Hoare triple {973#false} assume !false; {973#false} is VALID [2018-11-14 17:34:18,013 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 21 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-14 17:34:18,013 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 17:34:18,013 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 17:34:18,034 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:34:18,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:34:18,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:34:18,065 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:34:18,213 INFO L256 TraceCheckUtils]: 0: Hoare triple {972#true} call ULTIMATE.init(); {972#true} is VALID [2018-11-14 17:34:18,213 INFO L273 TraceCheckUtils]: 1: Hoare triple {972#true} ~__BLAST_NONDET~0 := 0; {972#true} is VALID [2018-11-14 17:34:18,214 INFO L273 TraceCheckUtils]: 2: Hoare triple {972#true} assume true; {972#true} is VALID [2018-11-14 17:34:18,214 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {972#true} {972#true} #80#return; {972#true} is VALID [2018-11-14 17:34:18,214 INFO L256 TraceCheckUtils]: 4: Hoare triple {972#true} call #t~ret7 := main(); {972#true} is VALID [2018-11-14 17:34:18,215 INFO L273 TraceCheckUtils]: 5: Hoare triple {972#true} havoc ~i~0;havoc ~j~0;havoc ~k~0;havoc ~n~0;havoc ~l~0;havoc ~m~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~m~0 := #t~nondet2;havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~l~0 := #t~nondet3;havoc #t~nondet3; {972#true} is VALID [2018-11-14 17:34:18,215 INFO L273 TraceCheckUtils]: 6: Hoare triple {972#true} assume !!(-1000000 < ~n~0 && ~n~0 < 1000000); {972#true} is VALID [2018-11-14 17:34:18,215 INFO L273 TraceCheckUtils]: 7: Hoare triple {972#true} assume !!(-1000000 < ~m~0 && ~m~0 < 1000000); {972#true} is VALID [2018-11-14 17:34:18,216 INFO L273 TraceCheckUtils]: 8: Hoare triple {972#true} assume !!(-1000000 < ~l~0 && ~l~0 < 1000000); {972#true} is VALID [2018-11-14 17:34:18,216 INFO L273 TraceCheckUtils]: 9: Hoare triple {972#true} assume 3 * ~n~0 <= ~m~0 + ~l~0; {972#true} is VALID [2018-11-14 17:34:18,217 INFO L273 TraceCheckUtils]: 10: Hoare triple {972#true} ~i~0 := 0; {974#(<= 0 main_~i~0)} is VALID [2018-11-14 17:34:18,217 INFO L273 TraceCheckUtils]: 11: Hoare triple {974#(<= 0 main_~i~0)} assume true; {974#(<= 0 main_~i~0)} is VALID [2018-11-14 17:34:18,217 INFO L273 TraceCheckUtils]: 12: Hoare triple {974#(<= 0 main_~i~0)} assume !!(~i~0 < ~n~0);~j~0 := 2 * ~i~0; {974#(<= 0 main_~i~0)} is VALID [2018-11-14 17:34:18,218 INFO L273 TraceCheckUtils]: 13: Hoare triple {974#(<= 0 main_~i~0)} assume true; {974#(<= 0 main_~i~0)} is VALID [2018-11-14 17:34:18,218 INFO L273 TraceCheckUtils]: 14: Hoare triple {974#(<= 0 main_~i~0)} assume !(~j~0 < 3 * ~i~0); {974#(<= 0 main_~i~0)} is VALID [2018-11-14 17:34:18,219 INFO L273 TraceCheckUtils]: 15: Hoare triple {974#(<= 0 main_~i~0)} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {975#(<= 1 main_~i~0)} is VALID [2018-11-14 17:34:18,220 INFO L273 TraceCheckUtils]: 16: Hoare triple {975#(<= 1 main_~i~0)} assume true; {975#(<= 1 main_~i~0)} is VALID [2018-11-14 17:34:18,220 INFO L273 TraceCheckUtils]: 17: Hoare triple {975#(<= 1 main_~i~0)} assume !!(~i~0 < ~n~0);~j~0 := 2 * ~i~0; {1033#(and (<= 1 main_~i~0) (<= (* 2 main_~i~0) main_~j~0))} is VALID [2018-11-14 17:34:18,226 INFO L273 TraceCheckUtils]: 18: Hoare triple {1033#(and (<= 1 main_~i~0) (<= (* 2 main_~i~0) main_~j~0))} assume true; {1033#(and (<= 1 main_~i~0) (<= (* 2 main_~i~0) main_~j~0))} is VALID [2018-11-14 17:34:18,228 INFO L273 TraceCheckUtils]: 19: Hoare triple {1033#(and (<= 1 main_~i~0) (<= (* 2 main_~i~0) main_~j~0))} assume !!(~j~0 < 3 * ~i~0);~k~0 := ~i~0; {1040#(exists ((main_~i~0 Int)) (and (<= 1 main_~i~0) (<= (* 2 main_~i~0) main_~j~0) (<= main_~k~0 main_~i~0)))} is VALID [2018-11-14 17:34:18,229 INFO L273 TraceCheckUtils]: 20: Hoare triple {1040#(exists ((main_~i~0 Int)) (and (<= 1 main_~i~0) (<= (* 2 main_~i~0) main_~j~0) (<= main_~k~0 main_~i~0)))} assume true; {1040#(exists ((main_~i~0 Int)) (and (<= 1 main_~i~0) (<= (* 2 main_~i~0) main_~j~0) (<= main_~k~0 main_~i~0)))} is VALID [2018-11-14 17:34:18,230 INFO L273 TraceCheckUtils]: 21: Hoare triple {1040#(exists ((main_~i~0 Int)) (and (<= 1 main_~i~0) (<= (* 2 main_~i~0) main_~j~0) (<= main_~k~0 main_~i~0)))} assume !(~k~0 < ~j~0); {973#false} is VALID [2018-11-14 17:34:18,230 INFO L273 TraceCheckUtils]: 22: Hoare triple {973#false} #t~post5 := ~j~0;~j~0 := #t~post5 + 1;havoc #t~post5; {973#false} is VALID [2018-11-14 17:34:18,231 INFO L273 TraceCheckUtils]: 23: Hoare triple {973#false} assume true; {973#false} is VALID [2018-11-14 17:34:18,231 INFO L273 TraceCheckUtils]: 24: Hoare triple {973#false} assume !(~j~0 < 3 * ~i~0); {973#false} is VALID [2018-11-14 17:34:18,232 INFO L273 TraceCheckUtils]: 25: Hoare triple {973#false} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {973#false} is VALID [2018-11-14 17:34:18,232 INFO L273 TraceCheckUtils]: 26: Hoare triple {973#false} assume true; {973#false} is VALID [2018-11-14 17:34:18,233 INFO L273 TraceCheckUtils]: 27: Hoare triple {973#false} assume !!(~i~0 < ~n~0);~j~0 := 2 * ~i~0; {973#false} is VALID [2018-11-14 17:34:18,233 INFO L273 TraceCheckUtils]: 28: Hoare triple {973#false} assume true; {973#false} is VALID [2018-11-14 17:34:18,233 INFO L273 TraceCheckUtils]: 29: Hoare triple {973#false} assume !!(~j~0 < 3 * ~i~0);~k~0 := ~i~0; {973#false} is VALID [2018-11-14 17:34:18,234 INFO L273 TraceCheckUtils]: 30: Hoare triple {973#false} assume true; {973#false} is VALID [2018-11-14 17:34:18,234 INFO L273 TraceCheckUtils]: 31: Hoare triple {973#false} assume !!(~k~0 < ~j~0); {973#false} is VALID [2018-11-14 17:34:18,234 INFO L256 TraceCheckUtils]: 32: Hoare triple {973#false} call __VERIFIER_assert((if ~k~0 - ~i~0 <= 2 * ~n~0 then 1 else 0)); {973#false} is VALID [2018-11-14 17:34:18,234 INFO L273 TraceCheckUtils]: 33: Hoare triple {973#false} ~cond := #in~cond; {973#false} is VALID [2018-11-14 17:34:18,235 INFO L273 TraceCheckUtils]: 34: Hoare triple {973#false} assume !(~cond == 0); {973#false} is VALID [2018-11-14 17:34:18,235 INFO L273 TraceCheckUtils]: 35: Hoare triple {973#false} assume true; {973#false} is VALID [2018-11-14 17:34:18,235 INFO L268 TraceCheckUtils]: 36: Hoare quadruple {973#false} {973#false} #84#return; {973#false} is VALID [2018-11-14 17:34:18,235 INFO L273 TraceCheckUtils]: 37: Hoare triple {973#false} #t~post6 := ~k~0;~k~0 := #t~post6 + 1;havoc #t~post6; {973#false} is VALID [2018-11-14 17:34:18,236 INFO L273 TraceCheckUtils]: 38: Hoare triple {973#false} assume true; {973#false} is VALID [2018-11-14 17:34:18,236 INFO L273 TraceCheckUtils]: 39: Hoare triple {973#false} assume !!(~k~0 < ~j~0); {973#false} is VALID [2018-11-14 17:34:18,236 INFO L256 TraceCheckUtils]: 40: Hoare triple {973#false} call __VERIFIER_assert((if ~k~0 - ~i~0 <= 2 * ~n~0 then 1 else 0)); {973#false} is VALID [2018-11-14 17:34:18,236 INFO L273 TraceCheckUtils]: 41: Hoare triple {973#false} ~cond := #in~cond; {973#false} is VALID [2018-11-14 17:34:18,237 INFO L273 TraceCheckUtils]: 42: Hoare triple {973#false} assume ~cond == 0; {973#false} is VALID [2018-11-14 17:34:18,237 INFO L273 TraceCheckUtils]: 43: Hoare triple {973#false} assume !false; {973#false} is VALID [2018-11-14 17:34:18,240 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-14 17:34:18,260 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-14 17:34:18,260 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 9 [2018-11-14 17:34:18,261 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 44 [2018-11-14 17:34:18,261 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:34:18,262 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2018-11-14 17:34:18,329 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:34:18,329 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-14 17:34:18,329 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-14 17:34:18,330 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-11-14 17:34:18,330 INFO L87 Difference]: Start difference. First operand 52 states and 59 transitions. Second operand 9 states. [2018-11-14 17:34:19,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:34:19,303 INFO L93 Difference]: Finished difference Result 92 states and 107 transitions. [2018-11-14 17:34:19,304 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-14 17:34:19,304 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 44 [2018-11-14 17:34:19,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:34:19,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-14 17:34:19,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 61 transitions. [2018-11-14 17:34:19,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-14 17:34:19,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 61 transitions. [2018-11-14 17:34:19,310 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 61 transitions. [2018-11-14 17:34:19,414 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 61 edges. 61 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:34:19,416 INFO L225 Difference]: With dead ends: 92 [2018-11-14 17:34:19,417 INFO L226 Difference]: Without dead ends: 55 [2018-11-14 17:34:19,418 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2018-11-14 17:34:19,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-11-14 17:34:19,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 54. [2018-11-14 17:34:19,575 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:34:19,575 INFO L82 GeneralOperation]: Start isEquivalent. First operand 55 states. Second operand 54 states. [2018-11-14 17:34:19,576 INFO L74 IsIncluded]: Start isIncluded. First operand 55 states. Second operand 54 states. [2018-11-14 17:34:19,576 INFO L87 Difference]: Start difference. First operand 55 states. Second operand 54 states. [2018-11-14 17:34:19,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:34:19,580 INFO L93 Difference]: Finished difference Result 55 states and 59 transitions. [2018-11-14 17:34:19,580 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 59 transitions. [2018-11-14 17:34:19,580 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:34:19,581 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:34:19,581 INFO L74 IsIncluded]: Start isIncluded. First operand 54 states. Second operand 55 states. [2018-11-14 17:34:19,581 INFO L87 Difference]: Start difference. First operand 54 states. Second operand 55 states. [2018-11-14 17:34:19,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:34:19,584 INFO L93 Difference]: Finished difference Result 55 states and 59 transitions. [2018-11-14 17:34:19,584 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 59 transitions. [2018-11-14 17:34:19,585 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:34:19,585 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:34:19,585 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:34:19,586 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:34:19,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-11-14 17:34:19,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 58 transitions. [2018-11-14 17:34:19,589 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 58 transitions. Word has length 44 [2018-11-14 17:34:19,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:34:19,589 INFO L480 AbstractCegarLoop]: Abstraction has 54 states and 58 transitions. [2018-11-14 17:34:19,589 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-14 17:34:19,589 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 58 transitions. [2018-11-14 17:34:19,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-11-14 17:34:19,593 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:34:19,593 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:34:19,593 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:34:19,593 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:34:19,594 INFO L82 PathProgramCache]: Analyzing trace with hash -908739042, now seen corresponding path program 2 times [2018-11-14 17:34:19,594 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:34:19,594 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:34:19,595 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:34:19,595 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:34:19,595 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:34:19,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:34:19,838 INFO L256 TraceCheckUtils]: 0: Hoare triple {1430#true} call ULTIMATE.init(); {1430#true} is VALID [2018-11-14 17:34:19,839 INFO L273 TraceCheckUtils]: 1: Hoare triple {1430#true} ~__BLAST_NONDET~0 := 0; {1430#true} is VALID [2018-11-14 17:34:19,839 INFO L273 TraceCheckUtils]: 2: Hoare triple {1430#true} assume true; {1430#true} is VALID [2018-11-14 17:34:19,839 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1430#true} {1430#true} #80#return; {1430#true} is VALID [2018-11-14 17:34:19,840 INFO L256 TraceCheckUtils]: 4: Hoare triple {1430#true} call #t~ret7 := main(); {1430#true} is VALID [2018-11-14 17:34:19,840 INFO L273 TraceCheckUtils]: 5: Hoare triple {1430#true} havoc ~i~0;havoc ~j~0;havoc ~k~0;havoc ~n~0;havoc ~l~0;havoc ~m~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~m~0 := #t~nondet2;havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~l~0 := #t~nondet3;havoc #t~nondet3; {1430#true} is VALID [2018-11-14 17:34:19,840 INFO L273 TraceCheckUtils]: 6: Hoare triple {1430#true} assume !!(-1000000 < ~n~0 && ~n~0 < 1000000); {1430#true} is VALID [2018-11-14 17:34:19,840 INFO L273 TraceCheckUtils]: 7: Hoare triple {1430#true} assume !!(-1000000 < ~m~0 && ~m~0 < 1000000); {1430#true} is VALID [2018-11-14 17:34:19,841 INFO L273 TraceCheckUtils]: 8: Hoare triple {1430#true} assume !!(-1000000 < ~l~0 && ~l~0 < 1000000); {1430#true} is VALID [2018-11-14 17:34:19,841 INFO L273 TraceCheckUtils]: 9: Hoare triple {1430#true} assume 3 * ~n~0 <= ~m~0 + ~l~0; {1430#true} is VALID [2018-11-14 17:34:19,841 INFO L273 TraceCheckUtils]: 10: Hoare triple {1430#true} ~i~0 := 0; {1432#(<= 0 main_~i~0)} is VALID [2018-11-14 17:34:19,842 INFO L273 TraceCheckUtils]: 11: Hoare triple {1432#(<= 0 main_~i~0)} assume true; {1432#(<= 0 main_~i~0)} is VALID [2018-11-14 17:34:19,842 INFO L273 TraceCheckUtils]: 12: Hoare triple {1432#(<= 0 main_~i~0)} assume !!(~i~0 < ~n~0);~j~0 := 2 * ~i~0; {1432#(<= 0 main_~i~0)} is VALID [2018-11-14 17:34:19,843 INFO L273 TraceCheckUtils]: 13: Hoare triple {1432#(<= 0 main_~i~0)} assume true; {1432#(<= 0 main_~i~0)} is VALID [2018-11-14 17:34:19,843 INFO L273 TraceCheckUtils]: 14: Hoare triple {1432#(<= 0 main_~i~0)} assume !(~j~0 < 3 * ~i~0); {1432#(<= 0 main_~i~0)} is VALID [2018-11-14 17:34:19,844 INFO L273 TraceCheckUtils]: 15: Hoare triple {1432#(<= 0 main_~i~0)} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {1433#(<= 1 main_~i~0)} is VALID [2018-11-14 17:34:19,844 INFO L273 TraceCheckUtils]: 16: Hoare triple {1433#(<= 1 main_~i~0)} assume true; {1433#(<= 1 main_~i~0)} is VALID [2018-11-14 17:34:19,844 INFO L273 TraceCheckUtils]: 17: Hoare triple {1433#(<= 1 main_~i~0)} assume !!(~i~0 < ~n~0);~j~0 := 2 * ~i~0; {1433#(<= 1 main_~i~0)} is VALID [2018-11-14 17:34:19,845 INFO L273 TraceCheckUtils]: 18: Hoare triple {1433#(<= 1 main_~i~0)} assume true; {1433#(<= 1 main_~i~0)} is VALID [2018-11-14 17:34:19,846 INFO L273 TraceCheckUtils]: 19: Hoare triple {1433#(<= 1 main_~i~0)} assume !!(~j~0 < 3 * ~i~0);~k~0 := ~i~0; {1433#(<= 1 main_~i~0)} is VALID [2018-11-14 17:34:19,848 INFO L273 TraceCheckUtils]: 20: Hoare triple {1433#(<= 1 main_~i~0)} assume true; {1433#(<= 1 main_~i~0)} is VALID [2018-11-14 17:34:19,849 INFO L273 TraceCheckUtils]: 21: Hoare triple {1433#(<= 1 main_~i~0)} assume !!(~k~0 < ~j~0); {1433#(<= 1 main_~i~0)} is VALID [2018-11-14 17:34:19,849 INFO L256 TraceCheckUtils]: 22: Hoare triple {1433#(<= 1 main_~i~0)} call __VERIFIER_assert((if ~k~0 - ~i~0 <= 2 * ~n~0 then 1 else 0)); {1430#true} is VALID [2018-11-14 17:34:19,850 INFO L273 TraceCheckUtils]: 23: Hoare triple {1430#true} ~cond := #in~cond; {1434#(= __VERIFIER_assert_~cond |__VERIFIER_assert_#in~cond|)} is VALID [2018-11-14 17:34:19,851 INFO L273 TraceCheckUtils]: 24: Hoare triple {1434#(= __VERIFIER_assert_~cond |__VERIFIER_assert_#in~cond|)} assume !(~cond == 0); {1435#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2018-11-14 17:34:19,854 INFO L273 TraceCheckUtils]: 25: Hoare triple {1435#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {1435#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2018-11-14 17:34:19,858 INFO L268 TraceCheckUtils]: 26: Hoare quadruple {1435#(not (= |__VERIFIER_assert_#in~cond| 0))} {1433#(<= 1 main_~i~0)} #84#return; {1433#(<= 1 main_~i~0)} is VALID [2018-11-14 17:34:19,859 INFO L273 TraceCheckUtils]: 27: Hoare triple {1433#(<= 1 main_~i~0)} #t~post6 := ~k~0;~k~0 := #t~post6 + 1;havoc #t~post6; {1433#(<= 1 main_~i~0)} is VALID [2018-11-14 17:34:19,860 INFO L273 TraceCheckUtils]: 28: Hoare triple {1433#(<= 1 main_~i~0)} assume true; {1433#(<= 1 main_~i~0)} is VALID [2018-11-14 17:34:19,860 INFO L273 TraceCheckUtils]: 29: Hoare triple {1433#(<= 1 main_~i~0)} assume !(~k~0 < ~j~0); {1433#(<= 1 main_~i~0)} is VALID [2018-11-14 17:34:19,862 INFO L273 TraceCheckUtils]: 30: Hoare triple {1433#(<= 1 main_~i~0)} #t~post5 := ~j~0;~j~0 := #t~post5 + 1;havoc #t~post5; {1433#(<= 1 main_~i~0)} is VALID [2018-11-14 17:34:19,862 INFO L273 TraceCheckUtils]: 31: Hoare triple {1433#(<= 1 main_~i~0)} assume true; {1433#(<= 1 main_~i~0)} is VALID [2018-11-14 17:34:19,864 INFO L273 TraceCheckUtils]: 32: Hoare triple {1433#(<= 1 main_~i~0)} assume !(~j~0 < 3 * ~i~0); {1433#(<= 1 main_~i~0)} is VALID [2018-11-14 17:34:19,883 INFO L273 TraceCheckUtils]: 33: Hoare triple {1433#(<= 1 main_~i~0)} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {1436#(<= 2 main_~i~0)} is VALID [2018-11-14 17:34:19,892 INFO L273 TraceCheckUtils]: 34: Hoare triple {1436#(<= 2 main_~i~0)} assume true; {1436#(<= 2 main_~i~0)} is VALID [2018-11-14 17:34:19,902 INFO L273 TraceCheckUtils]: 35: Hoare triple {1436#(<= 2 main_~i~0)} assume !!(~i~0 < ~n~0);~j~0 := 2 * ~i~0; {1437#(<= 3 main_~n~0)} is VALID [2018-11-14 17:34:19,903 INFO L273 TraceCheckUtils]: 36: Hoare triple {1437#(<= 3 main_~n~0)} assume true; {1437#(<= 3 main_~n~0)} is VALID [2018-11-14 17:34:19,907 INFO L273 TraceCheckUtils]: 37: Hoare triple {1437#(<= 3 main_~n~0)} assume !!(~j~0 < 3 * ~i~0);~k~0 := ~i~0; {1438#(<= (+ main_~k~0 6) (+ main_~i~0 (* 2 main_~n~0)))} is VALID [2018-11-14 17:34:19,907 INFO L273 TraceCheckUtils]: 38: Hoare triple {1438#(<= (+ main_~k~0 6) (+ main_~i~0 (* 2 main_~n~0)))} assume true; {1438#(<= (+ main_~k~0 6) (+ main_~i~0 (* 2 main_~n~0)))} is VALID [2018-11-14 17:34:19,909 INFO L273 TraceCheckUtils]: 39: Hoare triple {1438#(<= (+ main_~k~0 6) (+ main_~i~0 (* 2 main_~n~0)))} assume !!(~k~0 < ~j~0); {1438#(<= (+ main_~k~0 6) (+ main_~i~0 (* 2 main_~n~0)))} is VALID [2018-11-14 17:34:19,909 INFO L256 TraceCheckUtils]: 40: Hoare triple {1438#(<= (+ main_~k~0 6) (+ main_~i~0 (* 2 main_~n~0)))} call __VERIFIER_assert((if ~k~0 - ~i~0 <= 2 * ~n~0 then 1 else 0)); {1430#true} is VALID [2018-11-14 17:34:19,909 INFO L273 TraceCheckUtils]: 41: Hoare triple {1430#true} ~cond := #in~cond; {1430#true} is VALID [2018-11-14 17:34:19,909 INFO L273 TraceCheckUtils]: 42: Hoare triple {1430#true} assume !(~cond == 0); {1430#true} is VALID [2018-11-14 17:34:19,910 INFO L273 TraceCheckUtils]: 43: Hoare triple {1430#true} assume true; {1430#true} is VALID [2018-11-14 17:34:19,913 INFO L268 TraceCheckUtils]: 44: Hoare quadruple {1430#true} {1438#(<= (+ main_~k~0 6) (+ main_~i~0 (* 2 main_~n~0)))} #84#return; {1438#(<= (+ main_~k~0 6) (+ main_~i~0 (* 2 main_~n~0)))} is VALID [2018-11-14 17:34:19,915 INFO L273 TraceCheckUtils]: 45: Hoare triple {1438#(<= (+ main_~k~0 6) (+ main_~i~0 (* 2 main_~n~0)))} #t~post6 := ~k~0;~k~0 := #t~post6 + 1;havoc #t~post6; {1439#(<= (+ main_~k~0 5) (+ main_~i~0 (* 2 main_~n~0)))} is VALID [2018-11-14 17:34:19,915 INFO L273 TraceCheckUtils]: 46: Hoare triple {1439#(<= (+ main_~k~0 5) (+ main_~i~0 (* 2 main_~n~0)))} assume true; {1439#(<= (+ main_~k~0 5) (+ main_~i~0 (* 2 main_~n~0)))} is VALID [2018-11-14 17:34:19,916 INFO L273 TraceCheckUtils]: 47: Hoare triple {1439#(<= (+ main_~k~0 5) (+ main_~i~0 (* 2 main_~n~0)))} assume !!(~k~0 < ~j~0); {1439#(<= (+ main_~k~0 5) (+ main_~i~0 (* 2 main_~n~0)))} is VALID [2018-11-14 17:34:19,917 INFO L256 TraceCheckUtils]: 48: Hoare triple {1439#(<= (+ main_~k~0 5) (+ main_~i~0 (* 2 main_~n~0)))} call __VERIFIER_assert((if ~k~0 - ~i~0 <= 2 * ~n~0 then 1 else 0)); {1435#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2018-11-14 17:34:19,917 INFO L273 TraceCheckUtils]: 49: Hoare triple {1435#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {1440#(not (= __VERIFIER_assert_~cond 0))} is VALID [2018-11-14 17:34:19,918 INFO L273 TraceCheckUtils]: 50: Hoare triple {1440#(not (= __VERIFIER_assert_~cond 0))} assume ~cond == 0; {1431#false} is VALID [2018-11-14 17:34:19,918 INFO L273 TraceCheckUtils]: 51: Hoare triple {1431#false} assume !false; {1431#false} is VALID [2018-11-14 17:34:19,924 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 14 proven. 24 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-14 17:34:19,924 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 17:34:19,924 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 17:34:19,957 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-14 17:34:19,982 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2018-11-14 17:34:19,982 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 17:34:20,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:34:20,023 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:34:20,254 INFO L256 TraceCheckUtils]: 0: Hoare triple {1430#true} call ULTIMATE.init(); {1430#true} is VALID [2018-11-14 17:34:20,254 INFO L273 TraceCheckUtils]: 1: Hoare triple {1430#true} ~__BLAST_NONDET~0 := 0; {1430#true} is VALID [2018-11-14 17:34:20,255 INFO L273 TraceCheckUtils]: 2: Hoare triple {1430#true} assume true; {1430#true} is VALID [2018-11-14 17:34:20,255 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1430#true} {1430#true} #80#return; {1430#true} is VALID [2018-11-14 17:34:20,255 INFO L256 TraceCheckUtils]: 4: Hoare triple {1430#true} call #t~ret7 := main(); {1430#true} is VALID [2018-11-14 17:34:20,256 INFO L273 TraceCheckUtils]: 5: Hoare triple {1430#true} havoc ~i~0;havoc ~j~0;havoc ~k~0;havoc ~n~0;havoc ~l~0;havoc ~m~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~m~0 := #t~nondet2;havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~l~0 := #t~nondet3;havoc #t~nondet3; {1430#true} is VALID [2018-11-14 17:34:20,256 INFO L273 TraceCheckUtils]: 6: Hoare triple {1430#true} assume !!(-1000000 < ~n~0 && ~n~0 < 1000000); {1430#true} is VALID [2018-11-14 17:34:20,256 INFO L273 TraceCheckUtils]: 7: Hoare triple {1430#true} assume !!(-1000000 < ~m~0 && ~m~0 < 1000000); {1430#true} is VALID [2018-11-14 17:34:20,257 INFO L273 TraceCheckUtils]: 8: Hoare triple {1430#true} assume !!(-1000000 < ~l~0 && ~l~0 < 1000000); {1430#true} is VALID [2018-11-14 17:34:20,257 INFO L273 TraceCheckUtils]: 9: Hoare triple {1430#true} assume 3 * ~n~0 <= ~m~0 + ~l~0; {1430#true} is VALID [2018-11-14 17:34:20,257 INFO L273 TraceCheckUtils]: 10: Hoare triple {1430#true} ~i~0 := 0; {1430#true} is VALID [2018-11-14 17:34:20,257 INFO L273 TraceCheckUtils]: 11: Hoare triple {1430#true} assume true; {1430#true} is VALID [2018-11-14 17:34:20,257 INFO L273 TraceCheckUtils]: 12: Hoare triple {1430#true} assume !!(~i~0 < ~n~0);~j~0 := 2 * ~i~0; {1430#true} is VALID [2018-11-14 17:34:20,258 INFO L273 TraceCheckUtils]: 13: Hoare triple {1430#true} assume true; {1430#true} is VALID [2018-11-14 17:34:20,258 INFO L273 TraceCheckUtils]: 14: Hoare triple {1430#true} assume !(~j~0 < 3 * ~i~0); {1430#true} is VALID [2018-11-14 17:34:20,258 INFO L273 TraceCheckUtils]: 15: Hoare triple {1430#true} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {1430#true} is VALID [2018-11-14 17:34:20,258 INFO L273 TraceCheckUtils]: 16: Hoare triple {1430#true} assume true; {1430#true} is VALID [2018-11-14 17:34:20,258 INFO L273 TraceCheckUtils]: 17: Hoare triple {1430#true} assume !!(~i~0 < ~n~0);~j~0 := 2 * ~i~0; {1430#true} is VALID [2018-11-14 17:34:20,259 INFO L273 TraceCheckUtils]: 18: Hoare triple {1430#true} assume true; {1430#true} is VALID [2018-11-14 17:34:20,259 INFO L273 TraceCheckUtils]: 19: Hoare triple {1430#true} assume !!(~j~0 < 3 * ~i~0);~k~0 := ~i~0; {1430#true} is VALID [2018-11-14 17:34:20,259 INFO L273 TraceCheckUtils]: 20: Hoare triple {1430#true} assume true; {1430#true} is VALID [2018-11-14 17:34:20,259 INFO L273 TraceCheckUtils]: 21: Hoare triple {1430#true} assume !!(~k~0 < ~j~0); {1430#true} is VALID [2018-11-14 17:34:20,259 INFO L256 TraceCheckUtils]: 22: Hoare triple {1430#true} call __VERIFIER_assert((if ~k~0 - ~i~0 <= 2 * ~n~0 then 1 else 0)); {1430#true} is VALID [2018-11-14 17:34:20,260 INFO L273 TraceCheckUtils]: 23: Hoare triple {1430#true} ~cond := #in~cond; {1430#true} is VALID [2018-11-14 17:34:20,260 INFO L273 TraceCheckUtils]: 24: Hoare triple {1430#true} assume !(~cond == 0); {1430#true} is VALID [2018-11-14 17:34:20,260 INFO L273 TraceCheckUtils]: 25: Hoare triple {1430#true} assume true; {1430#true} is VALID [2018-11-14 17:34:20,260 INFO L268 TraceCheckUtils]: 26: Hoare quadruple {1430#true} {1430#true} #84#return; {1430#true} is VALID [2018-11-14 17:34:20,260 INFO L273 TraceCheckUtils]: 27: Hoare triple {1430#true} #t~post6 := ~k~0;~k~0 := #t~post6 + 1;havoc #t~post6; {1430#true} is VALID [2018-11-14 17:34:20,261 INFO L273 TraceCheckUtils]: 28: Hoare triple {1430#true} assume true; {1430#true} is VALID [2018-11-14 17:34:20,261 INFO L273 TraceCheckUtils]: 29: Hoare triple {1430#true} assume !(~k~0 < ~j~0); {1430#true} is VALID [2018-11-14 17:34:20,261 INFO L273 TraceCheckUtils]: 30: Hoare triple {1430#true} #t~post5 := ~j~0;~j~0 := #t~post5 + 1;havoc #t~post5; {1430#true} is VALID [2018-11-14 17:34:20,261 INFO L273 TraceCheckUtils]: 31: Hoare triple {1430#true} assume true; {1430#true} is VALID [2018-11-14 17:34:20,261 INFO L273 TraceCheckUtils]: 32: Hoare triple {1430#true} assume !(~j~0 < 3 * ~i~0); {1430#true} is VALID [2018-11-14 17:34:20,261 INFO L273 TraceCheckUtils]: 33: Hoare triple {1430#true} #t~post4 := ~i~0;~i~0 := #t~post4 + 1;havoc #t~post4; {1430#true} is VALID [2018-11-14 17:34:20,262 INFO L273 TraceCheckUtils]: 34: Hoare triple {1430#true} assume true; {1430#true} is VALID [2018-11-14 17:34:20,262 INFO L273 TraceCheckUtils]: 35: Hoare triple {1430#true} assume !!(~i~0 < ~n~0);~j~0 := 2 * ~i~0; {1549#(< main_~i~0 main_~n~0)} is VALID [2018-11-14 17:34:20,262 INFO L273 TraceCheckUtils]: 36: Hoare triple {1549#(< main_~i~0 main_~n~0)} assume true; {1549#(< main_~i~0 main_~n~0)} is VALID [2018-11-14 17:34:20,263 INFO L273 TraceCheckUtils]: 37: Hoare triple {1549#(< main_~i~0 main_~n~0)} assume !!(~j~0 < 3 * ~i~0);~k~0 := ~i~0; {1556#(and (< main_~j~0 (* 3 main_~i~0)) (< main_~i~0 main_~n~0))} is VALID [2018-11-14 17:34:20,263 INFO L273 TraceCheckUtils]: 38: Hoare triple {1556#(and (< main_~j~0 (* 3 main_~i~0)) (< main_~i~0 main_~n~0))} assume true; {1556#(and (< main_~j~0 (* 3 main_~i~0)) (< main_~i~0 main_~n~0))} is VALID [2018-11-14 17:34:20,264 INFO L273 TraceCheckUtils]: 39: Hoare triple {1556#(and (< main_~j~0 (* 3 main_~i~0)) (< main_~i~0 main_~n~0))} assume !!(~k~0 < ~j~0); {1556#(and (< main_~j~0 (* 3 main_~i~0)) (< main_~i~0 main_~n~0))} is VALID [2018-11-14 17:34:20,264 INFO L256 TraceCheckUtils]: 40: Hoare triple {1556#(and (< main_~j~0 (* 3 main_~i~0)) (< main_~i~0 main_~n~0))} call __VERIFIER_assert((if ~k~0 - ~i~0 <= 2 * ~n~0 then 1 else 0)); {1430#true} is VALID [2018-11-14 17:34:20,264 INFO L273 TraceCheckUtils]: 41: Hoare triple {1430#true} ~cond := #in~cond; {1430#true} is VALID [2018-11-14 17:34:20,264 INFO L273 TraceCheckUtils]: 42: Hoare triple {1430#true} assume !(~cond == 0); {1430#true} is VALID [2018-11-14 17:34:20,265 INFO L273 TraceCheckUtils]: 43: Hoare triple {1430#true} assume true; {1430#true} is VALID [2018-11-14 17:34:20,265 INFO L268 TraceCheckUtils]: 44: Hoare quadruple {1430#true} {1556#(and (< main_~j~0 (* 3 main_~i~0)) (< main_~i~0 main_~n~0))} #84#return; {1556#(and (< main_~j~0 (* 3 main_~i~0)) (< main_~i~0 main_~n~0))} is VALID [2018-11-14 17:34:20,266 INFO L273 TraceCheckUtils]: 45: Hoare triple {1556#(and (< main_~j~0 (* 3 main_~i~0)) (< main_~i~0 main_~n~0))} #t~post6 := ~k~0;~k~0 := #t~post6 + 1;havoc #t~post6; {1556#(and (< main_~j~0 (* 3 main_~i~0)) (< main_~i~0 main_~n~0))} is VALID [2018-11-14 17:34:20,266 INFO L273 TraceCheckUtils]: 46: Hoare triple {1556#(and (< main_~j~0 (* 3 main_~i~0)) (< main_~i~0 main_~n~0))} assume true; {1556#(and (< main_~j~0 (* 3 main_~i~0)) (< main_~i~0 main_~n~0))} is VALID [2018-11-14 17:34:20,267 INFO L273 TraceCheckUtils]: 47: Hoare triple {1556#(and (< main_~j~0 (* 3 main_~i~0)) (< main_~i~0 main_~n~0))} assume !!(~k~0 < ~j~0); {1587#(and (< main_~i~0 main_~n~0) (<= (+ main_~k~0 2) (* 3 main_~i~0)))} is VALID [2018-11-14 17:34:20,269 INFO L256 TraceCheckUtils]: 48: Hoare triple {1587#(and (< main_~i~0 main_~n~0) (<= (+ main_~k~0 2) (* 3 main_~i~0)))} call __VERIFIER_assert((if ~k~0 - ~i~0 <= 2 * ~n~0 then 1 else 0)); {1591#(= |__VERIFIER_assert_#in~cond| 1)} is VALID [2018-11-14 17:34:20,269 INFO L273 TraceCheckUtils]: 49: Hoare triple {1591#(= |__VERIFIER_assert_#in~cond| 1)} ~cond := #in~cond; {1595#(= 1 __VERIFIER_assert_~cond)} is VALID [2018-11-14 17:34:20,270 INFO L273 TraceCheckUtils]: 50: Hoare triple {1595#(= 1 __VERIFIER_assert_~cond)} assume ~cond == 0; {1431#false} is VALID [2018-11-14 17:34:20,270 INFO L273 TraceCheckUtils]: 51: Hoare triple {1431#false} assume !false; {1431#false} is VALID [2018-11-14 17:34:20,273 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 21 proven. 1 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-11-14 17:34:20,293 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 17:34:20,294 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 7] total 16 [2018-11-14 17:34:20,294 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 52 [2018-11-14 17:34:20,295 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:34:20,295 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states. [2018-11-14 17:34:20,370 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 76 edges. 76 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:34:20,370 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-11-14 17:34:20,371 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-11-14 17:34:20,371 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2018-11-14 17:34:20,372 INFO L87 Difference]: Start difference. First operand 54 states and 58 transitions. Second operand 16 states. [2018-11-14 17:34:21,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:34:21,991 INFO L93 Difference]: Finished difference Result 70 states and 77 transitions. [2018-11-14 17:34:21,991 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-11-14 17:34:21,991 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 52 [2018-11-14 17:34:21,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:34:21,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-14 17:34:21,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 74 transitions. [2018-11-14 17:34:21,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-14 17:34:21,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 74 transitions. [2018-11-14 17:34:21,998 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 21 states and 74 transitions. [2018-11-14 17:34:22,126 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 74 edges. 74 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:34:22,127 INFO L225 Difference]: With dead ends: 70 [2018-11-14 17:34:22,127 INFO L226 Difference]: Without dead ends: 0 [2018-11-14 17:34:22,129 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 154 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=217, Invalid=713, Unknown=0, NotChecked=0, Total=930 [2018-11-14 17:34:22,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-14 17:34:22,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-14 17:34:22,129 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:34:22,129 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2018-11-14 17:34:22,130 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2018-11-14 17:34:22,130 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2018-11-14 17:34:22,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:34:22,130 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2018-11-14 17:34:22,130 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-14 17:34:22,130 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:34:22,130 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:34:22,130 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2018-11-14 17:34:22,131 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2018-11-14 17:34:22,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:34:22,131 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2018-11-14 17:34:22,131 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-14 17:34:22,131 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:34:22,131 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:34:22,131 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:34:22,131 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:34:22,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-14 17:34:22,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-14 17:34:22,132 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 52 [2018-11-14 17:34:22,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:34:22,132 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-14 17:34:22,132 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-11-14 17:34:22,132 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-14 17:34:22,132 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:34:22,136 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-14 17:34:22,356 WARN L179 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 26 [2018-11-14 17:34:22,632 WARN L179 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 33 [2018-11-14 17:34:22,692 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-11-14 17:34:22,693 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: true [2018-11-14 17:34:22,693 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-14 17:34:22,693 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-14 17:34:22,693 INFO L428 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-11-14 17:34:22,693 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-14 17:34:22,693 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-14 17:34:22,693 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 11 26) no Hoare annotation was computed. [2018-11-14 17:34:22,694 INFO L421 ceAbstractionStarter]: At program point L23(line 23) the Hoare annotation is: (let ((.cse2 (* 3 main_~i~0))) (let ((.cse0 (< main_~i~0 main_~n~0)) (.cse1 (<= (+ main_~k~0 2) .cse2))) (or (and (exists ((main_~i~0 Int)) (and (<= main_~j~0 (* 2 main_~i~0)) (<= main_~i~0 1) (<= main_~i~0 main_~k~0))) .cse0 (exists ((main_~i~0 Int)) (and (<= 1 main_~i~0) (<= (* 2 main_~i~0) main_~j~0) (<= main_~k~0 main_~i~0))) (<= main_~i~0 1) .cse1) (and (<= 2 main_~i~0) .cse0 (<= (* 2 main_~i~0) main_~j~0) (<= (+ main_~j~0 1) .cse2) .cse1)))) [2018-11-14 17:34:22,694 INFO L425 ceAbstractionStarter]: For program point L23-1(lines 22 23) no Hoare annotation was computed. [2018-11-14 17:34:22,694 INFO L425 ceAbstractionStarter]: For program point L19(line 19) no Hoare annotation was computed. [2018-11-14 17:34:22,694 INFO L425 ceAbstractionStarter]: For program point L19-1(line 19) no Hoare annotation was computed. [2018-11-14 17:34:22,694 INFO L428 ceAbstractionStarter]: At program point L24(lines 11 26) the Hoare annotation is: true [2018-11-14 17:34:22,694 INFO L425 ceAbstractionStarter]: For program point L20-1(lines 20 23) no Hoare annotation was computed. [2018-11-14 17:34:22,694 INFO L425 ceAbstractionStarter]: For program point L20-3(lines 20 23) no Hoare annotation was computed. [2018-11-14 17:34:22,695 INFO L425 ceAbstractionStarter]: For program point L16(line 16) no Hoare annotation was computed. [2018-11-14 17:34:22,695 INFO L421 ceAbstractionStarter]: At program point L20-4(lines 20 23) the Hoare annotation is: (or (and (<= 1 main_~i~0) (<= main_~j~0 (* 2 main_~i~0))) (<= 2 main_~i~0) (and (<= 0 main_~i~0) (<= main_~i~0 0))) [2018-11-14 17:34:22,695 INFO L425 ceAbstractionStarter]: For program point L21-1(lines 21 23) no Hoare annotation was computed. [2018-11-14 17:34:22,695 INFO L425 ceAbstractionStarter]: For program point L21-3(lines 21 23) no Hoare annotation was computed. [2018-11-14 17:34:22,695 INFO L425 ceAbstractionStarter]: For program point L17(line 17) no Hoare annotation was computed. [2018-11-14 17:34:22,695 INFO L421 ceAbstractionStarter]: At program point L21-4(lines 21 23) the Hoare annotation is: (let ((.cse3 (* 2 main_~i~0))) (let ((.cse2 (* 3 main_~i~0)) (.cse0 (< main_~i~0 main_~n~0)) (.cse1 (<= .cse3 main_~j~0))) (or (and .cse0 .cse1 (<= (+ main_~j~0 1) .cse2)) (and (<= 1 main_~i~0) (<= main_~j~0 (+ main_~k~0 1)) .cse0 .cse1) (and (<= .cse2 main_~j~0) (<= 0 main_~i~0) .cse0 (<= main_~j~0 .cse3)) (and (<= 2 main_~i~0) .cse0 .cse1)))) [2018-11-14 17:34:22,695 INFO L425 ceAbstractionStarter]: For program point mainFINAL(lines 11 26) no Hoare annotation was computed. [2018-11-14 17:34:22,695 INFO L428 ceAbstractionStarter]: At program point mainENTRY(lines 11 26) the Hoare annotation is: true [2018-11-14 17:34:22,695 INFO L425 ceAbstractionStarter]: For program point L22-1(lines 22 23) no Hoare annotation was computed. [2018-11-14 17:34:22,696 INFO L421 ceAbstractionStarter]: At program point L22-3(lines 22 23) the Hoare annotation is: (let ((.cse3 (* 3 main_~i~0))) (let ((.cse0 (< main_~i~0 main_~n~0)) (.cse1 (<= (* 2 main_~i~0) main_~j~0)) (.cse2 (<= (+ main_~j~0 1) .cse3))) (or (and (exists ((main_~i~0 Int)) (and (<= main_~j~0 (* 2 main_~i~0)) (<= main_~i~0 1) (<= (+ main_~i~0 1) main_~k~0))) .cse0 .cse1 .cse2) (and (exists ((main_~i~0 Int)) (and (<= main_~j~0 (* 2 main_~i~0)) (<= main_~i~0 1) (<= main_~i~0 main_~k~0))) .cse0 (exists ((main_~i~0 Int)) (and (<= 1 main_~i~0) (<= (* 2 main_~i~0) main_~j~0) (<= main_~k~0 main_~i~0))) (<= main_~i~0 1) (<= (+ main_~k~0 2) .cse3)) (and (<= 2 main_~i~0) .cse0 .cse1 .cse2)))) [2018-11-14 17:34:22,696 INFO L425 ceAbstractionStarter]: For program point L18(line 18) no Hoare annotation was computed. [2018-11-14 17:34:22,696 INFO L425 ceAbstractionStarter]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2018-11-14 17:34:22,696 INFO L428 ceAbstractionStarter]: At program point __VERIFIER_assertENTRY(lines 3 8) the Hoare annotation is: true [2018-11-14 17:34:22,696 INFO L425 ceAbstractionStarter]: For program point __VERIFIER_assertEXIT(lines 3 8) no Hoare annotation was computed. [2018-11-14 17:34:22,697 INFO L425 ceAbstractionStarter]: For program point L5(line 5) no Hoare annotation was computed. [2018-11-14 17:34:22,697 INFO L425 ceAbstractionStarter]: For program point L4(lines 4 6) no Hoare annotation was computed. [2018-11-14 17:34:22,697 INFO L425 ceAbstractionStarter]: For program point L4-2(lines 3 8) no Hoare annotation was computed. [2018-11-14 17:34:22,699 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2018-11-14 17:34:22,699 WARN L170 areAnnotationChecker]: L16 has no Hoare annotation [2018-11-14 17:34:22,699 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2018-11-14 17:34:22,699 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2018-11-14 17:34:22,699 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2018-11-14 17:34:22,699 WARN L170 areAnnotationChecker]: L16 has no Hoare annotation [2018-11-14 17:34:22,699 WARN L170 areAnnotationChecker]: L16 has no Hoare annotation [2018-11-14 17:34:22,699 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2018-11-14 17:34:22,700 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2018-11-14 17:34:22,700 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2018-11-14 17:34:22,700 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2018-11-14 17:34:22,700 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2018-11-14 17:34:22,700 WARN L170 areAnnotationChecker]: L17 has no Hoare annotation [2018-11-14 17:34:22,700 WARN L170 areAnnotationChecker]: L17 has no Hoare annotation [2018-11-14 17:34:22,700 WARN L170 areAnnotationChecker]: L5 has no Hoare annotation [2018-11-14 17:34:22,700 WARN L170 areAnnotationChecker]: L5 has no Hoare annotation [2018-11-14 17:34:22,700 WARN L170 areAnnotationChecker]: L4-2 has no Hoare annotation [2018-11-14 17:34:22,701 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2018-11-14 17:34:22,701 WARN L170 areAnnotationChecker]: L18 has no Hoare annotation [2018-11-14 17:34:22,701 WARN L170 areAnnotationChecker]: L18 has no Hoare annotation [2018-11-14 17:34:22,701 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2018-11-14 17:34:22,701 WARN L170 areAnnotationChecker]: L19 has no Hoare annotation [2018-11-14 17:34:22,701 WARN L170 areAnnotationChecker]: L19 has no Hoare annotation [2018-11-14 17:34:22,701 WARN L170 areAnnotationChecker]: L23-1 has no Hoare annotation [2018-11-14 17:34:22,701 WARN L170 areAnnotationChecker]: L19-1 has no Hoare annotation [2018-11-14 17:34:22,701 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2018-11-14 17:34:22,701 WARN L170 areAnnotationChecker]: L22-1 has no Hoare annotation [2018-11-14 17:34:22,701 WARN L170 areAnnotationChecker]: L21-3 has no Hoare annotation [2018-11-14 17:34:22,701 WARN L170 areAnnotationChecker]: L20-1 has no Hoare annotation [2018-11-14 17:34:22,702 WARN L170 areAnnotationChecker]: L22-1 has no Hoare annotation [2018-11-14 17:34:22,702 WARN L170 areAnnotationChecker]: L22-1 has no Hoare annotation [2018-11-14 17:34:22,702 WARN L170 areAnnotationChecker]: L21-3 has no Hoare annotation [2018-11-14 17:34:22,702 WARN L170 areAnnotationChecker]: L20-1 has no Hoare annotation [2018-11-14 17:34:22,702 WARN L170 areAnnotationChecker]: L20-1 has no Hoare annotation [2018-11-14 17:34:22,702 WARN L170 areAnnotationChecker]: L23-1 has no Hoare annotation [2018-11-14 17:34:22,702 WARN L170 areAnnotationChecker]: L21-1 has no Hoare annotation [2018-11-14 17:34:22,702 WARN L170 areAnnotationChecker]: L20-3 has no Hoare annotation [2018-11-14 17:34:22,702 WARN L170 areAnnotationChecker]: L21-1 has no Hoare annotation [2018-11-14 17:34:22,702 WARN L170 areAnnotationChecker]: L21-1 has no Hoare annotation [2018-11-14 17:34:22,702 WARN L170 areAnnotationChecker]: L20-3 has no Hoare annotation [2018-11-14 17:34:22,702 INFO L163 areAnnotationChecker]: CFG has 4 edges. 4 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2018-11-14 17:34:22,713 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~i~0,QUANTIFIED] [2018-11-14 17:34:22,714 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~i~0,QUANTIFIED] [2018-11-14 17:34:22,714 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~i~0,QUANTIFIED] [2018-11-14 17:34:22,715 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~i~0,QUANTIFIED] [2018-11-14 17:34:22,715 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~i~0,QUANTIFIED] [2018-11-14 17:34:22,715 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~i~0,QUANTIFIED] [2018-11-14 17:34:22,715 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~i~0,QUANTIFIED] [2018-11-14 17:34:22,715 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~i~0,QUANTIFIED] [2018-11-14 17:34:22,716 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~i~0,QUANTIFIED] [2018-11-14 17:34:22,717 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~i~0,QUANTIFIED] [2018-11-14 17:34:22,717 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~i~0,QUANTIFIED] [2018-11-14 17:34:22,717 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~i~0,QUANTIFIED] [2018-11-14 17:34:22,717 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~i~0,QUANTIFIED] [2018-11-14 17:34:22,717 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~i~0,QUANTIFIED] [2018-11-14 17:34:22,718 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~i~0,QUANTIFIED] [2018-11-14 17:34:22,718 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~i~0,QUANTIFIED] [2018-11-14 17:34:22,718 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~i~0,QUANTIFIED] [2018-11-14 17:34:22,718 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~i~0,QUANTIFIED] [2018-11-14 17:34:22,721 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.11 05:34:22 BoogieIcfgContainer [2018-11-14 17:34:22,721 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-14 17:34:22,723 INFO L168 Benchmark]: Toolchain (without parser) took 12261.87 ms. Allocated memory was 1.5 GB in the beginning and 2.4 GB in the end (delta: 866.1 MB). Free memory was 1.4 GB in the beginning and 2.0 GB in the end (delta: -556.9 MB). Peak memory consumption was 309.2 MB. Max. memory is 7.1 GB. [2018-11-14 17:34:22,724 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-14 17:34:22,724 INFO L168 Benchmark]: CACSL2BoogieTranslator took 330.95 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-14 17:34:22,725 INFO L168 Benchmark]: Boogie Preprocessor took 34.00 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-14 17:34:22,726 INFO L168 Benchmark]: RCFGBuilder took 718.65 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 738.2 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -758.6 MB). Peak memory consumption was 26.2 MB. Max. memory is 7.1 GB. [2018-11-14 17:34:22,727 INFO L168 Benchmark]: TraceAbstraction took 11173.74 ms. Allocated memory was 2.3 GB in the beginning and 2.4 GB in the end (delta: 127.9 MB). Free memory was 2.2 GB in the beginning and 2.0 GB in the end (delta: 191.1 MB). Peak memory consumption was 319.0 MB. Max. memory is 7.1 GB. [2018-11-14 17:34:22,731 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - GenericResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 330.95 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 34.00 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 718.65 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 738.2 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -758.6 MB). Peak memory consumption was 26.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 11173.74 ms. Allocated memory was 2.3 GB in the beginning and 2.4 GB in the end (delta: 127.9 MB). Free memory was 2.2 GB in the beginning and 2.0 GB in the end (delta: 191.1 MB). Peak memory consumption was 319.0 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~i~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~i~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~i~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~i~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~i~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~i~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~i~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~i~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~i~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~i~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~i~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~i~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~i~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~i~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~i~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~i~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~i~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~i~0,QUANTIFIED] * 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: 21]: Loop Invariant Derived loop invariant: ((((i < n && 2 * i <= j) && j + 1 <= 3 * i) || (((1 <= i && j <= k + 1) && i < n) && 2 * i <= j)) || (((3 * i <= j && 0 <= i) && i < n) && j <= 2 * i)) || ((2 <= i && i < n) && 2 * i <= j) - InvariantResult [Line: 11]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 22]: Loop Invariant [2018-11-14 17:34:22,742 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~i~0,QUANTIFIED] [2018-11-14 17:34:22,742 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~i~0,QUANTIFIED] [2018-11-14 17:34:22,742 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~i~0,QUANTIFIED] [2018-11-14 17:34:22,742 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~i~0,QUANTIFIED] [2018-11-14 17:34:22,742 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~i~0,QUANTIFIED] [2018-11-14 17:34:22,743 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~i~0,QUANTIFIED] [2018-11-14 17:34:22,743 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~i~0,QUANTIFIED] [2018-11-14 17:34:22,743 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~i~0,QUANTIFIED] [2018-11-14 17:34:22,743 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~i~0,QUANTIFIED] [2018-11-14 17:34:22,744 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~i~0,QUANTIFIED] [2018-11-14 17:34:22,744 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~i~0,QUANTIFIED] [2018-11-14 17:34:22,744 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~i~0,QUANTIFIED] [2018-11-14 17:34:22,744 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~i~0,QUANTIFIED] [2018-11-14 17:34:22,744 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~i~0,QUANTIFIED] [2018-11-14 17:34:22,744 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~i~0,QUANTIFIED] [2018-11-14 17:34:22,745 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~i~0,QUANTIFIED] [2018-11-14 17:34:22,745 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~i~0,QUANTIFIED] [2018-11-14 17:34:22,745 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~i~0,QUANTIFIED] Derived loop invariant: (((((\exists main_~i~0 : int :: (j <= 2 * main_~i~0 && main_~i~0 <= 1) && main_~i~0 + 1 <= k) && i < n) && 2 * i <= j) && j + 1 <= 3 * i) || (((((\exists main_~i~0 : int :: (j <= 2 * main_~i~0 && main_~i~0 <= 1) && main_~i~0 <= k) && i < n) && (\exists main_~i~0 : int :: (1 <= main_~i~0 && 2 * main_~i~0 <= j) && k <= main_~i~0)) && i <= 1) && k + 2 <= 3 * i)) || (((2 <= i && i < n) && 2 * i <= j) && j + 1 <= 3 * i) - InvariantResult [Line: 20]: Loop Invariant Derived loop invariant: ((1 <= i && j <= 2 * i) || 2 <= i) || (0 <= i && i <= 0) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 32 locations, 1 error locations. SAFE Result, 11.0s OverallTime, 5 OverallIterations, 4 TraceHistogramMax, 6.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.5s HoareAnnotationTime, HoareTripleCheckerStatistics: 138 SDtfs, 135 SDslu, 639 SDs, 0 SdLazy, 549 SolverSat, 87 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 219 GetRequests, 151 SyntacticMatches, 1 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 201 ImplicationChecksByTransitivity, 1.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=54occurred in iteration=4, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 5 MinimizatonAttempts, 22 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 10 LocationsWithAnnotation, 19 PreInvPairs, 42 NumberOfFragments, 247 HoareAnnotationTreeSize, 19 FomulaSimplifications, 869 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 10 FomulaSimplificationsInter, 120 FormulaSimplificationTreeSizeReductionInter, 0.4s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 2.8s InterpolantComputationTime, 333 NumberOfCodeBlocks, 302 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 324 ConstructedInterpolants, 8 QuantifiedInterpolants, 34095 SizeOfPredicates, 11 NumberOfNonLiveVariables, 282 ConjunctsInSsa, 30 ConjunctsInUnsatCore, 9 InterpolantComputations, 3 PerfectInterpolantSequences, 129/168 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...