java -ea -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline_WitnessPrinter.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/loop-invgen/seq_true-unreach-call_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-61f4311 [2018-11-23 13:10:32,184 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 13:10:32,186 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 13:10:32,199 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 13:10:32,199 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 13:10:32,200 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 13:10:32,201 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 13:10:32,203 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 13:10:32,205 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 13:10:32,206 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 13:10:32,207 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 13:10:32,207 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 13:10:32,208 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 13:10:32,209 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 13:10:32,210 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 13:10:32,211 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 13:10:32,211 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 13:10:32,213 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 13:10:32,215 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 13:10:32,217 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 13:10:32,218 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 13:10:32,219 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 13:10:32,222 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 13:10:32,222 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 13:10:32,222 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 13:10:32,223 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 13:10:32,224 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 13:10:32,225 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 13:10:32,226 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 13:10:32,227 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 13:10:32,227 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 13:10:32,228 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 13:10:32,228 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 13:10:32,228 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 13:10:32,229 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 13:10:32,230 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 13:10:32,230 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-23 13:10:32,256 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 13:10:32,257 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 13:10:32,258 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 13:10:32,258 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 13:10:32,258 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 13:10:32,259 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 13:10:32,259 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 13:10:32,259 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 13:10:32,259 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 13:10:32,259 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 13:10:32,260 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 13:10:32,260 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 13:10:32,260 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 13:10:32,260 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 13:10:32,260 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 13:10:32,261 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 13:10:32,261 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 13:10:32,261 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 13:10:32,261 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 13:10:32,261 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 13:10:32,262 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 13:10:32,263 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 13:10:32,263 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 13:10:32,263 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 13:10:32,264 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 13:10:32,264 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 13:10:32,264 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 13:10:32,264 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 13:10:32,264 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 13:10:32,264 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 13:10:32,266 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 13:10:32,311 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 13:10:32,326 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 13:10:32,331 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 13:10:32,333 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 13:10:32,333 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 13:10:32,334 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-invgen/seq_true-unreach-call_true-termination.i [2018-11-23 13:10:32,405 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e975cb023/49d4b52b69a8433683cfb150cef966b2/FLAG0c061a7f5 [2018-11-23 13:10:32,911 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 13:10:32,911 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/seq_true-unreach-call_true-termination.i [2018-11-23 13:10:32,917 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e975cb023/49d4b52b69a8433683cfb150cef966b2/FLAG0c061a7f5 [2018-11-23 13:10:33,276 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e975cb023/49d4b52b69a8433683cfb150cef966b2 [2018-11-23 13:10:33,286 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 13:10:33,288 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 13:10:33,289 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 13:10:33,289 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 13:10:33,293 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 13:10:33,294 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 01:10:33" (1/1) ... [2018-11-23 13:10:33,297 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4056e5aa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:10:33, skipping insertion in model container [2018-11-23 13:10:33,298 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 01:10:33" (1/1) ... [2018-11-23 13:10:33,308 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 13:10:33,335 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 13:10:33,574 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 13:10:33,578 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 13:10:33,609 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 13:10:33,633 INFO L195 MainTranslator]: Completed translation [2018-11-23 13:10:33,634 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:10:33 WrapperNode [2018-11-23 13:10:33,634 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 13:10:33,635 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 13:10:33,635 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 13:10:33,635 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 13:10:33,646 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:10:33" (1/1) ... [2018-11-23 13:10:33,653 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:10:33" (1/1) ... [2018-11-23 13:10:33,661 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 13:10:33,661 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 13:10:33,662 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 13:10:33,662 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 13:10:33,674 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:10:33" (1/1) ... [2018-11-23 13:10:33,674 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:10:33" (1/1) ... [2018-11-23 13:10:33,675 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:10:33" (1/1) ... [2018-11-23 13:10:33,675 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:10:33" (1/1) ... [2018-11-23 13:10:33,683 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:10:33" (1/1) ... [2018-11-23 13:10:33,696 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:10:33" (1/1) ... [2018-11-23 13:10:33,698 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:10:33" (1/1) ... [2018-11-23 13:10:33,699 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 13:10:33,704 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 13:10:33,705 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 13:10:33,705 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 13:10:33,707 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:10:33" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 13:10:33,843 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 13:10:33,843 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 13:10:33,843 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 13:10:33,843 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 13:10:33,844 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 13:10:33,844 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 13:10:33,844 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-23 13:10:33,844 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-23 13:10:34,507 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 13:10:34,508 INFO L280 CfgBuilder]: Removed 3 assue(true) statements. [2018-11-23 13:10:34,508 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:10:34 BoogieIcfgContainer [2018-11-23 13:10:34,508 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 13:10:34,509 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 13:10:34,510 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 13:10:34,513 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 13:10:34,513 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 01:10:33" (1/3) ... [2018-11-23 13:10:34,514 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@506418f2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 01:10:34, skipping insertion in model container [2018-11-23 13:10:34,514 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:10:33" (2/3) ... [2018-11-23 13:10:34,515 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@506418f2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 01:10:34, skipping insertion in model container [2018-11-23 13:10:34,515 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:10:34" (3/3) ... [2018-11-23 13:10:34,517 INFO L112 eAbstractionObserver]: Analyzing ICFG seq_true-unreach-call_true-termination.i [2018-11-23 13:10:34,527 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 13:10:34,536 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 13:10:34,552 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 13:10:34,585 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 13:10:34,586 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 13:10:34,586 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 13:10:34,586 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 13:10:34,587 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 13:10:34,587 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 13:10:34,587 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 13:10:34,588 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 13:10:34,588 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 13:10:34,608 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states. [2018-11-23 13:10:34,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-23 13:10:34,615 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:10:34,616 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:10:34,618 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:10:34,625 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:10:34,625 INFO L82 PathProgramCache]: Analyzing trace with hash 2112948751, now seen corresponding path program 1 times [2018-11-23 13:10:34,628 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:10:34,628 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:10:34,684 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:10:34,684 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:10:34,684 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:10:34,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:10:35,123 INFO L256 TraceCheckUtils]: 0: Hoare triple {27#true} call ULTIMATE.init(); {27#true} is VALID [2018-11-23 13:10:35,127 INFO L273 TraceCheckUtils]: 1: Hoare triple {27#true} assume true; {27#true} is VALID [2018-11-23 13:10:35,128 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {27#true} {27#true} #66#return; {27#true} is VALID [2018-11-23 13:10:35,128 INFO L256 TraceCheckUtils]: 3: Hoare triple {27#true} call #t~ret9 := main(); {27#true} is VALID [2018-11-23 13:10:35,129 INFO L273 TraceCheckUtils]: 4: Hoare triple {27#true} havoc ~n0~0;havoc ~n1~0;~i0~0 := 0;~k~0 := 0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n0~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~n1~0 := #t~nondet2;havoc #t~nondet2; {29#(<= main_~i0~0 0)} is VALID [2018-11-23 13:10:35,131 INFO L273 TraceCheckUtils]: 5: Hoare triple {29#(<= main_~i0~0 0)} assume !!(-1000000 <= ~n0~0 && ~n0~0 < 1000000); {29#(<= main_~i0~0 0)} is VALID [2018-11-23 13:10:35,133 INFO L273 TraceCheckUtils]: 6: Hoare triple {29#(<= main_~i0~0 0)} assume !!(-1000000 <= ~n1~0 && ~n1~0 < 1000000); {29#(<= main_~i0~0 0)} is VALID [2018-11-23 13:10:35,137 INFO L273 TraceCheckUtils]: 7: Hoare triple {29#(<= main_~i0~0 0)} assume !(~i0~0 < ~n0~0); {30#(<= main_~n0~0 0)} is VALID [2018-11-23 13:10:35,146 INFO L273 TraceCheckUtils]: 8: Hoare triple {30#(<= main_~n0~0 0)} ~i1~0 := 0; {31#(<= (+ main_~i1~0 main_~n0~0) 0)} is VALID [2018-11-23 13:10:35,147 INFO L273 TraceCheckUtils]: 9: Hoare triple {31#(<= (+ main_~i1~0 main_~n0~0) 0)} assume !(~i1~0 < ~n1~0); {32#(<= (+ main_~n0~0 main_~n1~0) 0)} is VALID [2018-11-23 13:10:35,156 INFO L273 TraceCheckUtils]: 10: Hoare triple {32#(<= (+ main_~n0~0 main_~n1~0) 0)} ~j1~0 := 0; {33#(<= (+ main_~n0~0 main_~n1~0) main_~j1~0)} is VALID [2018-11-23 13:10:35,158 INFO L273 TraceCheckUtils]: 11: Hoare triple {33#(<= (+ main_~n0~0 main_~n1~0) main_~j1~0)} assume !!(~j1~0 < ~n0~0 + ~n1~0); {28#false} is VALID [2018-11-23 13:10:35,158 INFO L256 TraceCheckUtils]: 12: Hoare triple {28#false} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {28#false} is VALID [2018-11-23 13:10:35,158 INFO L273 TraceCheckUtils]: 13: Hoare triple {28#false} ~cond := #in~cond; {28#false} is VALID [2018-11-23 13:10:35,159 INFO L273 TraceCheckUtils]: 14: Hoare triple {28#false} assume 0 == ~cond; {28#false} is VALID [2018-11-23 13:10:35,159 INFO L273 TraceCheckUtils]: 15: Hoare triple {28#false} assume !false; {28#false} is VALID [2018-11-23 13:10:35,164 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:10:35,166 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 13:10:35,167 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-23 13:10:35,173 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2018-11-23 13:10:35,176 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:10:35,180 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2018-11-23 13:10:35,250 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:10:35,250 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-23 13:10:35,260 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-23 13:10:35,260 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-11-23 13:10:35,263 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 7 states. [2018-11-23 13:10:36,308 WARN L180 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2018-11-23 13:10:36,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:10:36,669 INFO L93 Difference]: Finished difference Result 56 states and 81 transitions. [2018-11-23 13:10:36,669 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-23 13:10:36,669 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2018-11-23 13:10:36,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:10:36,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-23 13:10:36,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 81 transitions. [2018-11-23 13:10:36,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-23 13:10:36,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 81 transitions. [2018-11-23 13:10:36,690 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 81 transitions. [2018-11-23 13:10:36,847 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 81 edges. 81 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:10:36,859 INFO L225 Difference]: With dead ends: 56 [2018-11-23 13:10:36,859 INFO L226 Difference]: Without dead ends: 28 [2018-11-23 13:10:36,863 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2018-11-23 13:10:36,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-11-23 13:10:36,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 23. [2018-11-23 13:10:36,952 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:10:36,953 INFO L82 GeneralOperation]: Start isEquivalent. First operand 28 states. Second operand 23 states. [2018-11-23 13:10:36,954 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand 23 states. [2018-11-23 13:10:36,954 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 23 states. [2018-11-23 13:10:36,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:10:36,968 INFO L93 Difference]: Finished difference Result 28 states and 33 transitions. [2018-11-23 13:10:36,968 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 33 transitions. [2018-11-23 13:10:36,969 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:10:36,969 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:10:36,969 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand 28 states. [2018-11-23 13:10:36,970 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 28 states. [2018-11-23 13:10:36,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:10:36,976 INFO L93 Difference]: Finished difference Result 28 states and 33 transitions. [2018-11-23 13:10:36,976 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 33 transitions. [2018-11-23 13:10:36,977 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:10:36,977 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:10:36,977 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:10:36,978 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:10:36,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-23 13:10:36,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 26 transitions. [2018-11-23 13:10:36,984 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 26 transitions. Word has length 16 [2018-11-23 13:10:36,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:10:36,984 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 26 transitions. [2018-11-23 13:10:36,985 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-23 13:10:36,985 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 26 transitions. [2018-11-23 13:10:36,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-23 13:10:36,987 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:10:36,987 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:10:36,987 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:10:36,988 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:10:36,988 INFO L82 PathProgramCache]: Analyzing trace with hash -1040035417, now seen corresponding path program 1 times [2018-11-23 13:10:36,988 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:10:36,989 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:10:36,996 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:10:36,996 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:10:36,996 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:10:37,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:10:37,168 INFO L256 TraceCheckUtils]: 0: Hoare triple {211#true} call ULTIMATE.init(); {211#true} is VALID [2018-11-23 13:10:37,168 INFO L273 TraceCheckUtils]: 1: Hoare triple {211#true} assume true; {211#true} is VALID [2018-11-23 13:10:37,169 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {211#true} {211#true} #66#return; {211#true} is VALID [2018-11-23 13:10:37,169 INFO L256 TraceCheckUtils]: 3: Hoare triple {211#true} call #t~ret9 := main(); {211#true} is VALID [2018-11-23 13:10:37,185 INFO L273 TraceCheckUtils]: 4: Hoare triple {211#true} havoc ~n0~0;havoc ~n1~0;~i0~0 := 0;~k~0 := 0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n0~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~n1~0 := #t~nondet2;havoc #t~nondet2; {213#(<= 0 main_~k~0)} is VALID [2018-11-23 13:10:37,200 INFO L273 TraceCheckUtils]: 5: Hoare triple {213#(<= 0 main_~k~0)} assume !!(-1000000 <= ~n0~0 && ~n0~0 < 1000000); {213#(<= 0 main_~k~0)} is VALID [2018-11-23 13:10:37,215 INFO L273 TraceCheckUtils]: 6: Hoare triple {213#(<= 0 main_~k~0)} assume !!(-1000000 <= ~n1~0 && ~n1~0 < 1000000); {213#(<= 0 main_~k~0)} is VALID [2018-11-23 13:10:37,230 INFO L273 TraceCheckUtils]: 7: Hoare triple {213#(<= 0 main_~k~0)} assume !(~i0~0 < ~n0~0); {213#(<= 0 main_~k~0)} is VALID [2018-11-23 13:10:37,231 INFO L273 TraceCheckUtils]: 8: Hoare triple {213#(<= 0 main_~k~0)} ~i1~0 := 0; {213#(<= 0 main_~k~0)} is VALID [2018-11-23 13:10:37,234 INFO L273 TraceCheckUtils]: 9: Hoare triple {213#(<= 0 main_~k~0)} assume !!(~i1~0 < ~n1~0);#t~post5 := ~i1~0;~i1~0 := 1 + #t~post5;havoc #t~post5;#t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {214#(<= 1 main_~k~0)} is VALID [2018-11-23 13:10:37,236 INFO L273 TraceCheckUtils]: 10: Hoare triple {214#(<= 1 main_~k~0)} assume !(~i1~0 < ~n1~0); {214#(<= 1 main_~k~0)} is VALID [2018-11-23 13:10:37,237 INFO L273 TraceCheckUtils]: 11: Hoare triple {214#(<= 1 main_~k~0)} ~j1~0 := 0; {214#(<= 1 main_~k~0)} is VALID [2018-11-23 13:10:37,242 INFO L273 TraceCheckUtils]: 12: Hoare triple {214#(<= 1 main_~k~0)} assume !!(~j1~0 < ~n0~0 + ~n1~0); {214#(<= 1 main_~k~0)} is VALID [2018-11-23 13:10:37,243 INFO L256 TraceCheckUtils]: 13: Hoare triple {214#(<= 1 main_~k~0)} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {215#(= |__VERIFIER_assert_#in~cond| 1)} is VALID [2018-11-23 13:10:37,247 INFO L273 TraceCheckUtils]: 14: Hoare triple {215#(= |__VERIFIER_assert_#in~cond| 1)} ~cond := #in~cond; {216#(= __VERIFIER_assert_~cond 1)} is VALID [2018-11-23 13:10:37,256 INFO L273 TraceCheckUtils]: 15: Hoare triple {216#(= __VERIFIER_assert_~cond 1)} assume 0 == ~cond; {212#false} is VALID [2018-11-23 13:10:37,257 INFO L273 TraceCheckUtils]: 16: Hoare triple {212#false} assume !false; {212#false} is VALID [2018-11-23 13:10:37,259 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:10:37,259 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 13:10:37,260 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-23 13:10:37,262 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2018-11-23 13:10:37,262 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:10:37,263 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-23 13:10:37,298 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:10:37,299 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 13:10:37,299 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 13:10:37,299 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-11-23 13:10:37,300 INFO L87 Difference]: Start difference. First operand 23 states and 26 transitions. Second operand 6 states. [2018-11-23 13:10:37,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:10:37,572 INFO L93 Difference]: Finished difference Result 35 states and 39 transitions. [2018-11-23 13:10:37,572 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 13:10:37,572 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2018-11-23 13:10:37,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:10:37,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 13:10:37,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 39 transitions. [2018-11-23 13:10:37,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 13:10:37,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 39 transitions. [2018-11-23 13:10:37,579 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 39 transitions. [2018-11-23 13:10:37,630 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:10:37,632 INFO L225 Difference]: With dead ends: 35 [2018-11-23 13:10:37,632 INFO L226 Difference]: Without dead ends: 33 [2018-11-23 13:10:37,633 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-11-23 13:10:37,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-11-23 13:10:37,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 29. [2018-11-23 13:10:37,665 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:10:37,666 INFO L82 GeneralOperation]: Start isEquivalent. First operand 33 states. Second operand 29 states. [2018-11-23 13:10:37,666 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand 29 states. [2018-11-23 13:10:37,666 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 29 states. [2018-11-23 13:10:37,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:10:37,670 INFO L93 Difference]: Finished difference Result 33 states and 37 transitions. [2018-11-23 13:10:37,671 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2018-11-23 13:10:37,671 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:10:37,671 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:10:37,672 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand 33 states. [2018-11-23 13:10:37,672 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 33 states. [2018-11-23 13:10:37,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:10:37,675 INFO L93 Difference]: Finished difference Result 33 states and 37 transitions. [2018-11-23 13:10:37,675 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2018-11-23 13:10:37,676 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:10:37,676 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:10:37,676 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:10:37,677 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:10:37,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-11-23 13:10:37,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 32 transitions. [2018-11-23 13:10:37,679 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 32 transitions. Word has length 17 [2018-11-23 13:10:37,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:10:37,680 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 32 transitions. [2018-11-23 13:10:37,680 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 13:10:37,680 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 32 transitions. [2018-11-23 13:10:37,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-23 13:10:37,681 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:10:37,681 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:10:37,682 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:10:37,682 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:10:37,682 INFO L82 PathProgramCache]: Analyzing trace with hash 349768240, now seen corresponding path program 1 times [2018-11-23 13:10:37,682 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:10:37,682 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:10:37,683 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:10:37,684 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:10:37,684 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:10:37,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:10:37,855 INFO L256 TraceCheckUtils]: 0: Hoare triple {381#true} call ULTIMATE.init(); {381#true} is VALID [2018-11-23 13:10:37,856 INFO L273 TraceCheckUtils]: 1: Hoare triple {381#true} assume true; {381#true} is VALID [2018-11-23 13:10:37,856 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {381#true} {381#true} #66#return; {381#true} is VALID [2018-11-23 13:10:37,857 INFO L256 TraceCheckUtils]: 3: Hoare triple {381#true} call #t~ret9 := main(); {381#true} is VALID [2018-11-23 13:10:37,858 INFO L273 TraceCheckUtils]: 4: Hoare triple {381#true} havoc ~n0~0;havoc ~n1~0;~i0~0 := 0;~k~0 := 0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n0~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~n1~0 := #t~nondet2;havoc #t~nondet2; {383#(<= main_~i0~0 0)} is VALID [2018-11-23 13:10:37,858 INFO L273 TraceCheckUtils]: 5: Hoare triple {383#(<= main_~i0~0 0)} assume !!(-1000000 <= ~n0~0 && ~n0~0 < 1000000); {383#(<= main_~i0~0 0)} is VALID [2018-11-23 13:10:37,859 INFO L273 TraceCheckUtils]: 6: Hoare triple {383#(<= main_~i0~0 0)} assume !!(-1000000 <= ~n1~0 && ~n1~0 < 1000000); {383#(<= main_~i0~0 0)} is VALID [2018-11-23 13:10:37,859 INFO L273 TraceCheckUtils]: 7: Hoare triple {383#(<= main_~i0~0 0)} assume !(~i0~0 < ~n0~0); {384#(<= main_~n0~0 0)} is VALID [2018-11-23 13:10:37,860 INFO L273 TraceCheckUtils]: 8: Hoare triple {384#(<= main_~n0~0 0)} ~i1~0 := 0; {385#(<= (+ main_~i1~0 main_~n0~0) 0)} is VALID [2018-11-23 13:10:37,861 INFO L273 TraceCheckUtils]: 9: Hoare triple {385#(<= (+ main_~i1~0 main_~n0~0) 0)} assume !!(~i1~0 < ~n1~0);#t~post5 := ~i1~0;~i1~0 := 1 + #t~post5;havoc #t~post5;#t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {386#(<= (+ main_~i1~0 main_~n0~0) 1)} is VALID [2018-11-23 13:10:37,862 INFO L273 TraceCheckUtils]: 10: Hoare triple {386#(<= (+ main_~i1~0 main_~n0~0) 1)} assume !(~i1~0 < ~n1~0); {387#(<= (+ main_~n0~0 main_~n1~0) 1)} is VALID [2018-11-23 13:10:37,863 INFO L273 TraceCheckUtils]: 11: Hoare triple {387#(<= (+ main_~n0~0 main_~n1~0) 1)} ~j1~0 := 0; {388#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 1))} is VALID [2018-11-23 13:10:37,864 INFO L273 TraceCheckUtils]: 12: Hoare triple {388#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 1))} assume !!(~j1~0 < ~n0~0 + ~n1~0); {388#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 1))} is VALID [2018-11-23 13:10:37,864 INFO L256 TraceCheckUtils]: 13: Hoare triple {388#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 1))} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {381#true} is VALID [2018-11-23 13:10:37,865 INFO L273 TraceCheckUtils]: 14: Hoare triple {381#true} ~cond := #in~cond; {381#true} is VALID [2018-11-23 13:10:37,865 INFO L273 TraceCheckUtils]: 15: Hoare triple {381#true} assume !(0 == ~cond); {381#true} is VALID [2018-11-23 13:10:37,866 INFO L273 TraceCheckUtils]: 16: Hoare triple {381#true} assume true; {381#true} is VALID [2018-11-23 13:10:37,867 INFO L268 TraceCheckUtils]: 17: Hoare quadruple {381#true} {388#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 1))} #70#return; {388#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 1))} is VALID [2018-11-23 13:10:37,871 INFO L273 TraceCheckUtils]: 18: Hoare triple {388#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 1))} #t~post7 := ~j1~0;~j1~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~k~0;~k~0 := #t~post8 - 1;havoc #t~post8; {389#(<= (+ main_~n0~0 main_~n1~0) main_~j1~0)} is VALID [2018-11-23 13:10:37,873 INFO L273 TraceCheckUtils]: 19: Hoare triple {389#(<= (+ main_~n0~0 main_~n1~0) main_~j1~0)} assume !!(~j1~0 < ~n0~0 + ~n1~0); {382#false} is VALID [2018-11-23 13:10:37,873 INFO L256 TraceCheckUtils]: 20: Hoare triple {382#false} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {382#false} is VALID [2018-11-23 13:10:37,873 INFO L273 TraceCheckUtils]: 21: Hoare triple {382#false} ~cond := #in~cond; {382#false} is VALID [2018-11-23 13:10:37,873 INFO L273 TraceCheckUtils]: 22: Hoare triple {382#false} assume 0 == ~cond; {382#false} is VALID [2018-11-23 13:10:37,874 INFO L273 TraceCheckUtils]: 23: Hoare triple {382#false} assume !false; {382#false} is VALID [2018-11-23 13:10:37,876 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:10:37,876 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:10:37,876 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:10:37,889 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:10:37,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:10:37,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:10:37,959 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:10:38,471 WARN L180 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2018-11-23 13:10:38,684 INFO L256 TraceCheckUtils]: 0: Hoare triple {381#true} call ULTIMATE.init(); {381#true} is VALID [2018-11-23 13:10:38,685 INFO L273 TraceCheckUtils]: 1: Hoare triple {381#true} assume true; {381#true} is VALID [2018-11-23 13:10:38,685 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {381#true} {381#true} #66#return; {381#true} is VALID [2018-11-23 13:10:38,685 INFO L256 TraceCheckUtils]: 3: Hoare triple {381#true} call #t~ret9 := main(); {381#true} is VALID [2018-11-23 13:10:38,690 INFO L273 TraceCheckUtils]: 4: Hoare triple {381#true} havoc ~n0~0;havoc ~n1~0;~i0~0 := 0;~k~0 := 0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n0~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~n1~0 := #t~nondet2;havoc #t~nondet2; {383#(<= main_~i0~0 0)} is VALID [2018-11-23 13:10:38,692 INFO L273 TraceCheckUtils]: 5: Hoare triple {383#(<= main_~i0~0 0)} assume !!(-1000000 <= ~n0~0 && ~n0~0 < 1000000); {383#(<= main_~i0~0 0)} is VALID [2018-11-23 13:10:38,693 INFO L273 TraceCheckUtils]: 6: Hoare triple {383#(<= main_~i0~0 0)} assume !!(-1000000 <= ~n1~0 && ~n1~0 < 1000000); {383#(<= main_~i0~0 0)} is VALID [2018-11-23 13:10:38,694 INFO L273 TraceCheckUtils]: 7: Hoare triple {383#(<= main_~i0~0 0)} assume !(~i0~0 < ~n0~0); {384#(<= main_~n0~0 0)} is VALID [2018-11-23 13:10:38,694 INFO L273 TraceCheckUtils]: 8: Hoare triple {384#(<= main_~n0~0 0)} ~i1~0 := 0; {417#(and (<= main_~i1~0 0) (<= main_~n0~0 0))} is VALID [2018-11-23 13:10:38,696 INFO L273 TraceCheckUtils]: 9: Hoare triple {417#(and (<= main_~i1~0 0) (<= main_~n0~0 0))} assume !!(~i1~0 < ~n1~0);#t~post5 := ~i1~0;~i1~0 := 1 + #t~post5;havoc #t~post5;#t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {421#(and (<= main_~i1~0 1) (<= main_~n0~0 0))} is VALID [2018-11-23 13:10:38,697 INFO L273 TraceCheckUtils]: 10: Hoare triple {421#(and (<= main_~i1~0 1) (<= main_~n0~0 0))} assume !(~i1~0 < ~n1~0); {425#(and (<= main_~n1~0 1) (<= main_~n0~0 0))} is VALID [2018-11-23 13:10:38,699 INFO L273 TraceCheckUtils]: 11: Hoare triple {425#(and (<= main_~n1~0 1) (<= main_~n0~0 0))} ~j1~0 := 0; {429#(and (<= main_~n1~0 1) (<= 0 main_~j1~0) (<= main_~n0~0 0))} is VALID [2018-11-23 13:10:38,699 INFO L273 TraceCheckUtils]: 12: Hoare triple {429#(and (<= main_~n1~0 1) (<= 0 main_~j1~0) (<= main_~n0~0 0))} assume !!(~j1~0 < ~n0~0 + ~n1~0); {429#(and (<= main_~n1~0 1) (<= 0 main_~j1~0) (<= main_~n0~0 0))} is VALID [2018-11-23 13:10:38,700 INFO L256 TraceCheckUtils]: 13: Hoare triple {429#(and (<= main_~n1~0 1) (<= 0 main_~j1~0) (<= main_~n0~0 0))} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {381#true} is VALID [2018-11-23 13:10:38,700 INFO L273 TraceCheckUtils]: 14: Hoare triple {381#true} ~cond := #in~cond; {381#true} is VALID [2018-11-23 13:10:38,700 INFO L273 TraceCheckUtils]: 15: Hoare triple {381#true} assume !(0 == ~cond); {381#true} is VALID [2018-11-23 13:10:38,701 INFO L273 TraceCheckUtils]: 16: Hoare triple {381#true} assume true; {381#true} is VALID [2018-11-23 13:10:38,702 INFO L268 TraceCheckUtils]: 17: Hoare quadruple {381#true} {429#(and (<= main_~n1~0 1) (<= 0 main_~j1~0) (<= main_~n0~0 0))} #70#return; {429#(and (<= main_~n1~0 1) (<= 0 main_~j1~0) (<= main_~n0~0 0))} is VALID [2018-11-23 13:10:38,703 INFO L273 TraceCheckUtils]: 18: Hoare triple {429#(and (<= main_~n1~0 1) (<= 0 main_~j1~0) (<= main_~n0~0 0))} #t~post7 := ~j1~0;~j1~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~k~0;~k~0 := #t~post8 - 1;havoc #t~post8; {451#(and (<= main_~n1~0 1) (<= 1 main_~j1~0) (<= main_~n0~0 0))} is VALID [2018-11-23 13:10:38,703 INFO L273 TraceCheckUtils]: 19: Hoare triple {451#(and (<= main_~n1~0 1) (<= 1 main_~j1~0) (<= main_~n0~0 0))} assume !!(~j1~0 < ~n0~0 + ~n1~0); {382#false} is VALID [2018-11-23 13:10:38,704 INFO L256 TraceCheckUtils]: 20: Hoare triple {382#false} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {382#false} is VALID [2018-11-23 13:10:38,704 INFO L273 TraceCheckUtils]: 21: Hoare triple {382#false} ~cond := #in~cond; {382#false} is VALID [2018-11-23 13:10:38,705 INFO L273 TraceCheckUtils]: 22: Hoare triple {382#false} assume 0 == ~cond; {382#false} is VALID [2018-11-23 13:10:38,705 INFO L273 TraceCheckUtils]: 23: Hoare triple {382#false} assume !false; {382#false} is VALID [2018-11-23 13:10:38,708 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:10:38,732 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:10:38,733 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 14 [2018-11-23 13:10:38,733 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 24 [2018-11-23 13:10:38,734 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:10:38,735 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states. [2018-11-23 13:10:38,816 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:10:38,817 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-23 13:10:38,817 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-23 13:10:38,817 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2018-11-23 13:10:38,818 INFO L87 Difference]: Start difference. First operand 29 states and 32 transitions. Second operand 14 states. [2018-11-23 13:10:39,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:10:39,561 INFO L93 Difference]: Finished difference Result 51 states and 59 transitions. [2018-11-23 13:10:39,561 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-23 13:10:39,561 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 24 [2018-11-23 13:10:39,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:10:39,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-23 13:10:39,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 50 transitions. [2018-11-23 13:10:39,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-23 13:10:39,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 50 transitions. [2018-11-23 13:10:39,568 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 50 transitions. [2018-11-23 13:10:39,678 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:10:39,680 INFO L225 Difference]: With dead ends: 51 [2018-11-23 13:10:39,680 INFO L226 Difference]: Without dead ends: 37 [2018-11-23 13:10:39,681 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=105, Invalid=275, Unknown=0, NotChecked=0, Total=380 [2018-11-23 13:10:39,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-11-23 13:10:39,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 30. [2018-11-23 13:10:39,720 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:10:39,720 INFO L82 GeneralOperation]: Start isEquivalent. First operand 37 states. Second operand 30 states. [2018-11-23 13:10:39,720 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand 30 states. [2018-11-23 13:10:39,721 INFO L87 Difference]: Start difference. First operand 37 states. Second operand 30 states. [2018-11-23 13:10:39,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:10:39,725 INFO L93 Difference]: Finished difference Result 37 states and 43 transitions. [2018-11-23 13:10:39,725 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 43 transitions. [2018-11-23 13:10:39,726 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:10:39,726 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:10:39,727 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand 37 states. [2018-11-23 13:10:39,727 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 37 states. [2018-11-23 13:10:39,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:10:39,731 INFO L93 Difference]: Finished difference Result 37 states and 43 transitions. [2018-11-23 13:10:39,731 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 43 transitions. [2018-11-23 13:10:39,732 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:10:39,732 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:10:39,732 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:10:39,732 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:10:39,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-23 13:10:39,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 33 transitions. [2018-11-23 13:10:39,736 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 33 transitions. Word has length 24 [2018-11-23 13:10:39,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:10:39,736 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 33 transitions. [2018-11-23 13:10:39,736 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-23 13:10:39,738 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 33 transitions. [2018-11-23 13:10:39,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-23 13:10:39,739 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:10:39,740 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:10:39,740 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:10:39,740 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:10:39,740 INFO L82 PathProgramCache]: Analyzing trace with hash 1141561007, now seen corresponding path program 1 times [2018-11-23 13:10:39,740 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:10:39,743 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:10:39,743 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:10:39,744 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:10:39,744 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:10:39,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:10:39,997 INFO L256 TraceCheckUtils]: 0: Hoare triple {674#true} call ULTIMATE.init(); {674#true} is VALID [2018-11-23 13:10:39,997 INFO L273 TraceCheckUtils]: 1: Hoare triple {674#true} assume true; {674#true} is VALID [2018-11-23 13:10:39,997 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {674#true} {674#true} #66#return; {674#true} is VALID [2018-11-23 13:10:39,997 INFO L256 TraceCheckUtils]: 3: Hoare triple {674#true} call #t~ret9 := main(); {674#true} is VALID [2018-11-23 13:10:39,998 INFO L273 TraceCheckUtils]: 4: Hoare triple {674#true} havoc ~n0~0;havoc ~n1~0;~i0~0 := 0;~k~0 := 0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n0~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~n1~0 := #t~nondet2;havoc #t~nondet2; {676#(<= main_~i0~0 0)} is VALID [2018-11-23 13:10:39,999 INFO L273 TraceCheckUtils]: 5: Hoare triple {676#(<= main_~i0~0 0)} assume !!(-1000000 <= ~n0~0 && ~n0~0 < 1000000); {676#(<= main_~i0~0 0)} is VALID [2018-11-23 13:10:39,999 INFO L273 TraceCheckUtils]: 6: Hoare triple {676#(<= main_~i0~0 0)} assume !!(-1000000 <= ~n1~0 && ~n1~0 < 1000000); {676#(<= main_~i0~0 0)} is VALID [2018-11-23 13:10:40,000 INFO L273 TraceCheckUtils]: 7: Hoare triple {676#(<= main_~i0~0 0)} assume !!(~i0~0 < ~n0~0);#t~post3 := ~i0~0;~i0~0 := 1 + #t~post3;havoc #t~post3;#t~post4 := ~k~0;~k~0 := 1 + #t~post4;havoc #t~post4; {677#(<= main_~i0~0 1)} is VALID [2018-11-23 13:10:40,001 INFO L273 TraceCheckUtils]: 8: Hoare triple {677#(<= main_~i0~0 1)} assume !(~i0~0 < ~n0~0); {678#(<= main_~n0~0 1)} is VALID [2018-11-23 13:10:40,001 INFO L273 TraceCheckUtils]: 9: Hoare triple {678#(<= main_~n0~0 1)} ~i1~0 := 0; {679#(<= (+ main_~i1~0 main_~n0~0) 1)} is VALID [2018-11-23 13:10:40,002 INFO L273 TraceCheckUtils]: 10: Hoare triple {679#(<= (+ main_~i1~0 main_~n0~0) 1)} assume !(~i1~0 < ~n1~0); {680#(<= (+ main_~n0~0 main_~n1~0) 1)} is VALID [2018-11-23 13:10:40,003 INFO L273 TraceCheckUtils]: 11: Hoare triple {680#(<= (+ main_~n0~0 main_~n1~0) 1)} ~j1~0 := 0; {681#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 1))} is VALID [2018-11-23 13:10:40,003 INFO L273 TraceCheckUtils]: 12: Hoare triple {681#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 1))} assume !!(~j1~0 < ~n0~0 + ~n1~0); {681#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 1))} is VALID [2018-11-23 13:10:40,004 INFO L256 TraceCheckUtils]: 13: Hoare triple {681#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 1))} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {674#true} is VALID [2018-11-23 13:10:40,004 INFO L273 TraceCheckUtils]: 14: Hoare triple {674#true} ~cond := #in~cond; {674#true} is VALID [2018-11-23 13:10:40,005 INFO L273 TraceCheckUtils]: 15: Hoare triple {674#true} assume !(0 == ~cond); {674#true} is VALID [2018-11-23 13:10:40,005 INFO L273 TraceCheckUtils]: 16: Hoare triple {674#true} assume true; {674#true} is VALID [2018-11-23 13:10:40,006 INFO L268 TraceCheckUtils]: 17: Hoare quadruple {674#true} {681#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 1))} #70#return; {681#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 1))} is VALID [2018-11-23 13:10:40,025 INFO L273 TraceCheckUtils]: 18: Hoare triple {681#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 1))} #t~post7 := ~j1~0;~j1~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~k~0;~k~0 := #t~post8 - 1;havoc #t~post8; {682#(<= (+ main_~n0~0 main_~n1~0) main_~j1~0)} is VALID [2018-11-23 13:10:40,034 INFO L273 TraceCheckUtils]: 19: Hoare triple {682#(<= (+ main_~n0~0 main_~n1~0) main_~j1~0)} assume !!(~j1~0 < ~n0~0 + ~n1~0); {675#false} is VALID [2018-11-23 13:10:40,034 INFO L256 TraceCheckUtils]: 20: Hoare triple {675#false} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {675#false} is VALID [2018-11-23 13:10:40,035 INFO L273 TraceCheckUtils]: 21: Hoare triple {675#false} ~cond := #in~cond; {675#false} is VALID [2018-11-23 13:10:40,035 INFO L273 TraceCheckUtils]: 22: Hoare triple {675#false} assume 0 == ~cond; {675#false} is VALID [2018-11-23 13:10:40,035 INFO L273 TraceCheckUtils]: 23: Hoare triple {675#false} assume !false; {675#false} is VALID [2018-11-23 13:10:40,037 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:10:40,037 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:10:40,037 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:10:40,057 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:10:40,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:10:40,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:10:40,086 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:10:40,305 INFO L256 TraceCheckUtils]: 0: Hoare triple {674#true} call ULTIMATE.init(); {674#true} is VALID [2018-11-23 13:10:40,305 INFO L273 TraceCheckUtils]: 1: Hoare triple {674#true} assume true; {674#true} is VALID [2018-11-23 13:10:40,306 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {674#true} {674#true} #66#return; {674#true} is VALID [2018-11-23 13:10:40,306 INFO L256 TraceCheckUtils]: 3: Hoare triple {674#true} call #t~ret9 := main(); {674#true} is VALID [2018-11-23 13:10:40,307 INFO L273 TraceCheckUtils]: 4: Hoare triple {674#true} havoc ~n0~0;havoc ~n1~0;~i0~0 := 0;~k~0 := 0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n0~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~n1~0 := #t~nondet2;havoc #t~nondet2; {676#(<= main_~i0~0 0)} is VALID [2018-11-23 13:10:40,307 INFO L273 TraceCheckUtils]: 5: Hoare triple {676#(<= main_~i0~0 0)} assume !!(-1000000 <= ~n0~0 && ~n0~0 < 1000000); {676#(<= main_~i0~0 0)} is VALID [2018-11-23 13:10:40,309 INFO L273 TraceCheckUtils]: 6: Hoare triple {676#(<= main_~i0~0 0)} assume !!(-1000000 <= ~n1~0 && ~n1~0 < 1000000); {676#(<= main_~i0~0 0)} is VALID [2018-11-23 13:10:40,310 INFO L273 TraceCheckUtils]: 7: Hoare triple {676#(<= main_~i0~0 0)} assume !!(~i0~0 < ~n0~0);#t~post3 := ~i0~0;~i0~0 := 1 + #t~post3;havoc #t~post3;#t~post4 := ~k~0;~k~0 := 1 + #t~post4;havoc #t~post4; {677#(<= main_~i0~0 1)} is VALID [2018-11-23 13:10:40,311 INFO L273 TraceCheckUtils]: 8: Hoare triple {677#(<= main_~i0~0 1)} assume !(~i0~0 < ~n0~0); {678#(<= main_~n0~0 1)} is VALID [2018-11-23 13:10:40,312 INFO L273 TraceCheckUtils]: 9: Hoare triple {678#(<= main_~n0~0 1)} ~i1~0 := 0; {713#(and (<= main_~i1~0 0) (<= main_~n0~0 1))} is VALID [2018-11-23 13:10:40,313 INFO L273 TraceCheckUtils]: 10: Hoare triple {713#(and (<= main_~i1~0 0) (<= main_~n0~0 1))} assume !(~i1~0 < ~n1~0); {717#(and (<= main_~n1~0 0) (<= main_~n0~0 1))} is VALID [2018-11-23 13:10:40,314 INFO L273 TraceCheckUtils]: 11: Hoare triple {717#(and (<= main_~n1~0 0) (<= main_~n0~0 1))} ~j1~0 := 0; {721#(and (<= main_~n1~0 0) (<= 0 main_~j1~0) (<= main_~n0~0 1))} is VALID [2018-11-23 13:10:40,315 INFO L273 TraceCheckUtils]: 12: Hoare triple {721#(and (<= main_~n1~0 0) (<= 0 main_~j1~0) (<= main_~n0~0 1))} assume !!(~j1~0 < ~n0~0 + ~n1~0); {721#(and (<= main_~n1~0 0) (<= 0 main_~j1~0) (<= main_~n0~0 1))} is VALID [2018-11-23 13:10:40,315 INFO L256 TraceCheckUtils]: 13: Hoare triple {721#(and (<= main_~n1~0 0) (<= 0 main_~j1~0) (<= main_~n0~0 1))} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {674#true} is VALID [2018-11-23 13:10:40,315 INFO L273 TraceCheckUtils]: 14: Hoare triple {674#true} ~cond := #in~cond; {674#true} is VALID [2018-11-23 13:10:40,316 INFO L273 TraceCheckUtils]: 15: Hoare triple {674#true} assume !(0 == ~cond); {674#true} is VALID [2018-11-23 13:10:40,316 INFO L273 TraceCheckUtils]: 16: Hoare triple {674#true} assume true; {674#true} is VALID [2018-11-23 13:10:40,332 INFO L268 TraceCheckUtils]: 17: Hoare quadruple {674#true} {721#(and (<= main_~n1~0 0) (<= 0 main_~j1~0) (<= main_~n0~0 1))} #70#return; {721#(and (<= main_~n1~0 0) (<= 0 main_~j1~0) (<= main_~n0~0 1))} is VALID [2018-11-23 13:10:40,335 INFO L273 TraceCheckUtils]: 18: Hoare triple {721#(and (<= main_~n1~0 0) (<= 0 main_~j1~0) (<= main_~n0~0 1))} #t~post7 := ~j1~0;~j1~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~k~0;~k~0 := #t~post8 - 1;havoc #t~post8; {743#(and (<= main_~n1~0 0) (<= 1 main_~j1~0) (<= main_~n0~0 1))} is VALID [2018-11-23 13:10:40,338 INFO L273 TraceCheckUtils]: 19: Hoare triple {743#(and (<= main_~n1~0 0) (<= 1 main_~j1~0) (<= main_~n0~0 1))} assume !!(~j1~0 < ~n0~0 + ~n1~0); {675#false} is VALID [2018-11-23 13:10:40,338 INFO L256 TraceCheckUtils]: 20: Hoare triple {675#false} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {675#false} is VALID [2018-11-23 13:10:40,338 INFO L273 TraceCheckUtils]: 21: Hoare triple {675#false} ~cond := #in~cond; {675#false} is VALID [2018-11-23 13:10:40,338 INFO L273 TraceCheckUtils]: 22: Hoare triple {675#false} assume 0 == ~cond; {675#false} is VALID [2018-11-23 13:10:40,339 INFO L273 TraceCheckUtils]: 23: Hoare triple {675#false} assume !false; {675#false} is VALID [2018-11-23 13:10:40,340 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:10:40,360 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:10:40,360 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 13 [2018-11-23 13:10:40,361 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 24 [2018-11-23 13:10:40,361 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:10:40,361 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states. [2018-11-23 13:10:40,402 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-23 13:10:40,402 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-23 13:10:40,403 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-23 13:10:40,403 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2018-11-23 13:10:40,404 INFO L87 Difference]: Start difference. First operand 30 states and 33 transitions. Second operand 13 states. [2018-11-23 13:10:41,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:10:41,028 INFO L93 Difference]: Finished difference Result 61 states and 73 transitions. [2018-11-23 13:10:41,028 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-23 13:10:41,028 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 24 [2018-11-23 13:10:41,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:10:41,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-23 13:10:41,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 60 transitions. [2018-11-23 13:10:41,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-23 13:10:41,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 60 transitions. [2018-11-23 13:10:41,035 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 60 transitions. [2018-11-23 13:10:41,240 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 60 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:10:41,242 INFO L225 Difference]: With dead ends: 61 [2018-11-23 13:10:41,242 INFO L226 Difference]: Without dead ends: 47 [2018-11-23 13:10:41,243 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=105, Invalid=275, Unknown=0, NotChecked=0, Total=380 [2018-11-23 13:10:41,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-11-23 13:10:41,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 32. [2018-11-23 13:10:41,312 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:10:41,312 INFO L82 GeneralOperation]: Start isEquivalent. First operand 47 states. Second operand 32 states. [2018-11-23 13:10:41,312 INFO L74 IsIncluded]: Start isIncluded. First operand 47 states. Second operand 32 states. [2018-11-23 13:10:41,312 INFO L87 Difference]: Start difference. First operand 47 states. Second operand 32 states. [2018-11-23 13:10:41,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:10:41,316 INFO L93 Difference]: Finished difference Result 47 states and 57 transitions. [2018-11-23 13:10:41,316 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 57 transitions. [2018-11-23 13:10:41,317 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:10:41,317 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:10:41,318 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand 47 states. [2018-11-23 13:10:41,318 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 47 states. [2018-11-23 13:10:41,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:10:41,321 INFO L93 Difference]: Finished difference Result 47 states and 57 transitions. [2018-11-23 13:10:41,321 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 57 transitions. [2018-11-23 13:10:41,322 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:10:41,322 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:10:41,322 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:10:41,323 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:10:41,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-11-23 13:10:41,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 36 transitions. [2018-11-23 13:10:41,324 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 36 transitions. Word has length 24 [2018-11-23 13:10:41,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:10:41,325 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 36 transitions. [2018-11-23 13:10:41,325 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-23 13:10:41,325 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2018-11-23 13:10:41,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-23 13:10:41,326 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:10:41,326 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:10:41,326 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:10:41,326 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:10:41,327 INFO L82 PathProgramCache]: Analyzing trace with hash -1152042552, now seen corresponding path program 2 times [2018-11-23 13:10:41,327 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:10:41,327 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:10:41,328 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:10:41,328 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:10:41,328 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:10:41,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:10:41,475 INFO L256 TraceCheckUtils]: 0: Hoare triple {1008#true} call ULTIMATE.init(); {1008#true} is VALID [2018-11-23 13:10:41,475 INFO L273 TraceCheckUtils]: 1: Hoare triple {1008#true} assume true; {1008#true} is VALID [2018-11-23 13:10:41,476 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {1008#true} {1008#true} #66#return; {1008#true} is VALID [2018-11-23 13:10:41,476 INFO L256 TraceCheckUtils]: 3: Hoare triple {1008#true} call #t~ret9 := main(); {1008#true} is VALID [2018-11-23 13:10:41,477 INFO L273 TraceCheckUtils]: 4: Hoare triple {1008#true} havoc ~n0~0;havoc ~n1~0;~i0~0 := 0;~k~0 := 0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n0~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~n1~0 := #t~nondet2;havoc #t~nondet2; {1010#(<= 0 main_~k~0)} is VALID [2018-11-23 13:10:41,478 INFO L273 TraceCheckUtils]: 5: Hoare triple {1010#(<= 0 main_~k~0)} assume !!(-1000000 <= ~n0~0 && ~n0~0 < 1000000); {1010#(<= 0 main_~k~0)} is VALID [2018-11-23 13:10:41,478 INFO L273 TraceCheckUtils]: 6: Hoare triple {1010#(<= 0 main_~k~0)} assume !!(-1000000 <= ~n1~0 && ~n1~0 < 1000000); {1010#(<= 0 main_~k~0)} is VALID [2018-11-23 13:10:41,479 INFO L273 TraceCheckUtils]: 7: Hoare triple {1010#(<= 0 main_~k~0)} assume !(~i0~0 < ~n0~0); {1010#(<= 0 main_~k~0)} is VALID [2018-11-23 13:10:41,480 INFO L273 TraceCheckUtils]: 8: Hoare triple {1010#(<= 0 main_~k~0)} ~i1~0 := 0; {1010#(<= 0 main_~k~0)} is VALID [2018-11-23 13:10:41,481 INFO L273 TraceCheckUtils]: 9: Hoare triple {1010#(<= 0 main_~k~0)} assume !!(~i1~0 < ~n1~0);#t~post5 := ~i1~0;~i1~0 := 1 + #t~post5;havoc #t~post5;#t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {1011#(<= 1 main_~k~0)} is VALID [2018-11-23 13:10:41,485 INFO L273 TraceCheckUtils]: 10: Hoare triple {1011#(<= 1 main_~k~0)} assume !!(~i1~0 < ~n1~0);#t~post5 := ~i1~0;~i1~0 := 1 + #t~post5;havoc #t~post5;#t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {1012#(<= 2 main_~k~0)} is VALID [2018-11-23 13:10:41,486 INFO L273 TraceCheckUtils]: 11: Hoare triple {1012#(<= 2 main_~k~0)} assume !(~i1~0 < ~n1~0); {1012#(<= 2 main_~k~0)} is VALID [2018-11-23 13:10:41,486 INFO L273 TraceCheckUtils]: 12: Hoare triple {1012#(<= 2 main_~k~0)} ~j1~0 := 0; {1012#(<= 2 main_~k~0)} is VALID [2018-11-23 13:10:41,486 INFO L273 TraceCheckUtils]: 13: Hoare triple {1012#(<= 2 main_~k~0)} assume !!(~j1~0 < ~n0~0 + ~n1~0); {1012#(<= 2 main_~k~0)} is VALID [2018-11-23 13:10:41,487 INFO L256 TraceCheckUtils]: 14: Hoare triple {1012#(<= 2 main_~k~0)} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {1008#true} is VALID [2018-11-23 13:10:41,487 INFO L273 TraceCheckUtils]: 15: Hoare triple {1008#true} ~cond := #in~cond; {1013#(= __VERIFIER_assert_~cond |__VERIFIER_assert_#in~cond|)} is VALID [2018-11-23 13:10:41,488 INFO L273 TraceCheckUtils]: 16: Hoare triple {1013#(= __VERIFIER_assert_~cond |__VERIFIER_assert_#in~cond|)} assume !(0 == ~cond); {1014#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2018-11-23 13:10:41,488 INFO L273 TraceCheckUtils]: 17: Hoare triple {1014#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {1014#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2018-11-23 13:10:41,489 INFO L268 TraceCheckUtils]: 18: Hoare quadruple {1014#(not (= |__VERIFIER_assert_#in~cond| 0))} {1012#(<= 2 main_~k~0)} #70#return; {1012#(<= 2 main_~k~0)} is VALID [2018-11-23 13:10:41,491 INFO L273 TraceCheckUtils]: 19: Hoare triple {1012#(<= 2 main_~k~0)} #t~post7 := ~j1~0;~j1~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~k~0;~k~0 := #t~post8 - 1;havoc #t~post8; {1011#(<= 1 main_~k~0)} is VALID [2018-11-23 13:10:41,491 INFO L273 TraceCheckUtils]: 20: Hoare triple {1011#(<= 1 main_~k~0)} assume !!(~j1~0 < ~n0~0 + ~n1~0); {1011#(<= 1 main_~k~0)} is VALID [2018-11-23 13:10:41,493 INFO L256 TraceCheckUtils]: 21: Hoare triple {1011#(<= 1 main_~k~0)} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {1014#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2018-11-23 13:10:41,493 INFO L273 TraceCheckUtils]: 22: Hoare triple {1014#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {1015#(not (= __VERIFIER_assert_~cond 0))} is VALID [2018-11-23 13:10:41,494 INFO L273 TraceCheckUtils]: 23: Hoare triple {1015#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {1009#false} is VALID [2018-11-23 13:10:41,494 INFO L273 TraceCheckUtils]: 24: Hoare triple {1009#false} assume !false; {1009#false} is VALID [2018-11-23 13:10:41,497 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:10:41,497 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:10:41,497 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-23 13:10:41,506 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 13:10:41,522 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 13:10:41,522 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:10:41,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:10:41,534 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:10:41,782 INFO L256 TraceCheckUtils]: 0: Hoare triple {1008#true} call ULTIMATE.init(); {1008#true} is VALID [2018-11-23 13:10:41,783 INFO L273 TraceCheckUtils]: 1: Hoare triple {1008#true} assume true; {1008#true} is VALID [2018-11-23 13:10:41,783 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {1008#true} {1008#true} #66#return; {1008#true} is VALID [2018-11-23 13:10:41,783 INFO L256 TraceCheckUtils]: 3: Hoare triple {1008#true} call #t~ret9 := main(); {1008#true} is VALID [2018-11-23 13:10:41,785 INFO L273 TraceCheckUtils]: 4: Hoare triple {1008#true} havoc ~n0~0;havoc ~n1~0;~i0~0 := 0;~k~0 := 0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n0~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~n1~0 := #t~nondet2;havoc #t~nondet2; {1010#(<= 0 main_~k~0)} is VALID [2018-11-23 13:10:41,786 INFO L273 TraceCheckUtils]: 5: Hoare triple {1010#(<= 0 main_~k~0)} assume !!(-1000000 <= ~n0~0 && ~n0~0 < 1000000); {1010#(<= 0 main_~k~0)} is VALID [2018-11-23 13:10:41,786 INFO L273 TraceCheckUtils]: 6: Hoare triple {1010#(<= 0 main_~k~0)} assume !!(-1000000 <= ~n1~0 && ~n1~0 < 1000000); {1010#(<= 0 main_~k~0)} is VALID [2018-11-23 13:10:41,788 INFO L273 TraceCheckUtils]: 7: Hoare triple {1010#(<= 0 main_~k~0)} assume !(~i0~0 < ~n0~0); {1010#(<= 0 main_~k~0)} is VALID [2018-11-23 13:10:41,788 INFO L273 TraceCheckUtils]: 8: Hoare triple {1010#(<= 0 main_~k~0)} ~i1~0 := 0; {1010#(<= 0 main_~k~0)} is VALID [2018-11-23 13:10:41,790 INFO L273 TraceCheckUtils]: 9: Hoare triple {1010#(<= 0 main_~k~0)} assume !!(~i1~0 < ~n1~0);#t~post5 := ~i1~0;~i1~0 := 1 + #t~post5;havoc #t~post5;#t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {1011#(<= 1 main_~k~0)} is VALID [2018-11-23 13:10:41,791 INFO L273 TraceCheckUtils]: 10: Hoare triple {1011#(<= 1 main_~k~0)} assume !!(~i1~0 < ~n1~0);#t~post5 := ~i1~0;~i1~0 := 1 + #t~post5;havoc #t~post5;#t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {1012#(<= 2 main_~k~0)} is VALID [2018-11-23 13:10:41,791 INFO L273 TraceCheckUtils]: 11: Hoare triple {1012#(<= 2 main_~k~0)} assume !(~i1~0 < ~n1~0); {1012#(<= 2 main_~k~0)} is VALID [2018-11-23 13:10:41,792 INFO L273 TraceCheckUtils]: 12: Hoare triple {1012#(<= 2 main_~k~0)} ~j1~0 := 0; {1012#(<= 2 main_~k~0)} is VALID [2018-11-23 13:10:41,793 INFO L273 TraceCheckUtils]: 13: Hoare triple {1012#(<= 2 main_~k~0)} assume !!(~j1~0 < ~n0~0 + ~n1~0); {1012#(<= 2 main_~k~0)} is VALID [2018-11-23 13:10:41,793 INFO L256 TraceCheckUtils]: 14: Hoare triple {1012#(<= 2 main_~k~0)} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {1008#true} is VALID [2018-11-23 13:10:41,794 INFO L273 TraceCheckUtils]: 15: Hoare triple {1008#true} ~cond := #in~cond; {1008#true} is VALID [2018-11-23 13:10:41,794 INFO L273 TraceCheckUtils]: 16: Hoare triple {1008#true} assume !(0 == ~cond); {1008#true} is VALID [2018-11-23 13:10:41,794 INFO L273 TraceCheckUtils]: 17: Hoare triple {1008#true} assume true; {1008#true} is VALID [2018-11-23 13:10:41,795 INFO L268 TraceCheckUtils]: 18: Hoare quadruple {1008#true} {1012#(<= 2 main_~k~0)} #70#return; {1012#(<= 2 main_~k~0)} is VALID [2018-11-23 13:10:41,796 INFO L273 TraceCheckUtils]: 19: Hoare triple {1012#(<= 2 main_~k~0)} #t~post7 := ~j1~0;~j1~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~k~0;~k~0 := #t~post8 - 1;havoc #t~post8; {1011#(<= 1 main_~k~0)} is VALID [2018-11-23 13:10:41,796 INFO L273 TraceCheckUtils]: 20: Hoare triple {1011#(<= 1 main_~k~0)} assume !!(~j1~0 < ~n0~0 + ~n1~0); {1011#(<= 1 main_~k~0)} is VALID [2018-11-23 13:10:41,797 INFO L256 TraceCheckUtils]: 21: Hoare triple {1011#(<= 1 main_~k~0)} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {1082#(= |__VERIFIER_assert_#in~cond| 1)} is VALID [2018-11-23 13:10:41,798 INFO L273 TraceCheckUtils]: 22: Hoare triple {1082#(= |__VERIFIER_assert_#in~cond| 1)} ~cond := #in~cond; {1086#(= 1 __VERIFIER_assert_~cond)} is VALID [2018-11-23 13:10:41,798 INFO L273 TraceCheckUtils]: 23: Hoare triple {1086#(= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1009#false} is VALID [2018-11-23 13:10:41,798 INFO L273 TraceCheckUtils]: 24: Hoare triple {1009#false} assume !false; {1009#false} is VALID [2018-11-23 13:10:41,800 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:10:41,819 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:10:41,819 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 10 [2018-11-23 13:10:41,820 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2018-11-23 13:10:41,820 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:10:41,820 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2018-11-23 13:10:41,856 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-23 13:10:41,856 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-23 13:10:41,857 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-23 13:10:41,857 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2018-11-23 13:10:41,857 INFO L87 Difference]: Start difference. First operand 32 states and 36 transitions. Second operand 10 states. [2018-11-23 13:10:42,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:10:42,272 INFO L93 Difference]: Finished difference Result 41 states and 45 transitions. [2018-11-23 13:10:42,272 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-23 13:10:42,272 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2018-11-23 13:10:42,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:10:42,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-23 13:10:42,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 42 transitions. [2018-11-23 13:10:42,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-23 13:10:42,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 42 transitions. [2018-11-23 13:10:42,277 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 42 transitions. [2018-11-23 13:10:42,331 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:10:42,333 INFO L225 Difference]: With dead ends: 41 [2018-11-23 13:10:42,333 INFO L226 Difference]: Without dead ends: 39 [2018-11-23 13:10:42,334 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2018-11-23 13:10:42,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-11-23 13:10:42,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2018-11-23 13:10:42,437 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:10:42,437 INFO L82 GeneralOperation]: Start isEquivalent. First operand 39 states. Second operand 39 states. [2018-11-23 13:10:42,438 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand 39 states. [2018-11-23 13:10:42,438 INFO L87 Difference]: Start difference. First operand 39 states. Second operand 39 states. [2018-11-23 13:10:42,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:10:42,441 INFO L93 Difference]: Finished difference Result 39 states and 43 transitions. [2018-11-23 13:10:42,441 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2018-11-23 13:10:42,441 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:10:42,442 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:10:42,442 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand 39 states. [2018-11-23 13:10:42,442 INFO L87 Difference]: Start difference. First operand 39 states. Second operand 39 states. [2018-11-23 13:10:42,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:10:42,444 INFO L93 Difference]: Finished difference Result 39 states and 43 transitions. [2018-11-23 13:10:42,444 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2018-11-23 13:10:42,447 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:10:42,447 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:10:42,447 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:10:42,447 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:10:42,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-11-23 13:10:42,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 43 transitions. [2018-11-23 13:10:42,452 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 43 transitions. Word has length 25 [2018-11-23 13:10:42,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:10:42,452 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 43 transitions. [2018-11-23 13:10:42,452 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-23 13:10:42,452 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2018-11-23 13:10:42,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-11-23 13:10:42,455 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:10:42,456 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:10:42,456 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:10:42,456 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:10:42,456 INFO L82 PathProgramCache]: Analyzing trace with hash -805836049, now seen corresponding path program 3 times [2018-11-23 13:10:42,456 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:10:42,456 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:10:42,457 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:10:42,457 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:10:42,457 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:10:42,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:10:42,665 INFO L256 TraceCheckUtils]: 0: Hoare triple {1292#true} call ULTIMATE.init(); {1292#true} is VALID [2018-11-23 13:10:42,666 INFO L273 TraceCheckUtils]: 1: Hoare triple {1292#true} assume true; {1292#true} is VALID [2018-11-23 13:10:42,666 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {1292#true} {1292#true} #66#return; {1292#true} is VALID [2018-11-23 13:10:42,666 INFO L256 TraceCheckUtils]: 3: Hoare triple {1292#true} call #t~ret9 := main(); {1292#true} is VALID [2018-11-23 13:10:42,667 INFO L273 TraceCheckUtils]: 4: Hoare triple {1292#true} havoc ~n0~0;havoc ~n1~0;~i0~0 := 0;~k~0 := 0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n0~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~n1~0 := #t~nondet2;havoc #t~nondet2; {1294#(<= main_~i0~0 0)} is VALID [2018-11-23 13:10:42,668 INFO L273 TraceCheckUtils]: 5: Hoare triple {1294#(<= main_~i0~0 0)} assume !!(-1000000 <= ~n0~0 && ~n0~0 < 1000000); {1294#(<= main_~i0~0 0)} is VALID [2018-11-23 13:10:42,668 INFO L273 TraceCheckUtils]: 6: Hoare triple {1294#(<= main_~i0~0 0)} assume !!(-1000000 <= ~n1~0 && ~n1~0 < 1000000); {1294#(<= main_~i0~0 0)} is VALID [2018-11-23 13:10:42,669 INFO L273 TraceCheckUtils]: 7: Hoare triple {1294#(<= main_~i0~0 0)} assume !(~i0~0 < ~n0~0); {1295#(<= main_~n0~0 0)} is VALID [2018-11-23 13:10:42,669 INFO L273 TraceCheckUtils]: 8: Hoare triple {1295#(<= main_~n0~0 0)} ~i1~0 := 0; {1296#(<= (+ main_~i1~0 main_~n0~0) 0)} is VALID [2018-11-23 13:10:42,670 INFO L273 TraceCheckUtils]: 9: Hoare triple {1296#(<= (+ main_~i1~0 main_~n0~0) 0)} assume !!(~i1~0 < ~n1~0);#t~post5 := ~i1~0;~i1~0 := 1 + #t~post5;havoc #t~post5;#t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {1297#(<= (+ main_~i1~0 main_~n0~0) 1)} is VALID [2018-11-23 13:10:42,671 INFO L273 TraceCheckUtils]: 10: Hoare triple {1297#(<= (+ main_~i1~0 main_~n0~0) 1)} assume !!(~i1~0 < ~n1~0);#t~post5 := ~i1~0;~i1~0 := 1 + #t~post5;havoc #t~post5;#t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {1298#(<= (+ main_~i1~0 main_~n0~0) 2)} is VALID [2018-11-23 13:10:42,672 INFO L273 TraceCheckUtils]: 11: Hoare triple {1298#(<= (+ main_~i1~0 main_~n0~0) 2)} assume !(~i1~0 < ~n1~0); {1299#(<= (+ main_~n0~0 main_~n1~0) 2)} is VALID [2018-11-23 13:10:42,672 INFO L273 TraceCheckUtils]: 12: Hoare triple {1299#(<= (+ main_~n0~0 main_~n1~0) 2)} ~j1~0 := 0; {1300#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 2))} is VALID [2018-11-23 13:10:42,674 INFO L273 TraceCheckUtils]: 13: Hoare triple {1300#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 2))} assume !!(~j1~0 < ~n0~0 + ~n1~0); {1300#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 2))} is VALID [2018-11-23 13:10:42,675 INFO L256 TraceCheckUtils]: 14: Hoare triple {1300#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 2))} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {1292#true} is VALID [2018-11-23 13:10:42,675 INFO L273 TraceCheckUtils]: 15: Hoare triple {1292#true} ~cond := #in~cond; {1292#true} is VALID [2018-11-23 13:10:42,675 INFO L273 TraceCheckUtils]: 16: Hoare triple {1292#true} assume !(0 == ~cond); {1292#true} is VALID [2018-11-23 13:10:42,675 INFO L273 TraceCheckUtils]: 17: Hoare triple {1292#true} assume true; {1292#true} is VALID [2018-11-23 13:10:42,676 INFO L268 TraceCheckUtils]: 18: Hoare quadruple {1292#true} {1300#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 2))} #70#return; {1300#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 2))} is VALID [2018-11-23 13:10:42,677 INFO L273 TraceCheckUtils]: 19: Hoare triple {1300#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 2))} #t~post7 := ~j1~0;~j1~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~k~0;~k~0 := #t~post8 - 1;havoc #t~post8; {1301#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 1))} is VALID [2018-11-23 13:10:42,678 INFO L273 TraceCheckUtils]: 20: Hoare triple {1301#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 1))} assume !!(~j1~0 < ~n0~0 + ~n1~0); {1301#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 1))} is VALID [2018-11-23 13:10:42,678 INFO L256 TraceCheckUtils]: 21: Hoare triple {1301#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 1))} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {1292#true} is VALID [2018-11-23 13:10:42,678 INFO L273 TraceCheckUtils]: 22: Hoare triple {1292#true} ~cond := #in~cond; {1292#true} is VALID [2018-11-23 13:10:42,679 INFO L273 TraceCheckUtils]: 23: Hoare triple {1292#true} assume !(0 == ~cond); {1292#true} is VALID [2018-11-23 13:10:42,679 INFO L273 TraceCheckUtils]: 24: Hoare triple {1292#true} assume true; {1292#true} is VALID [2018-11-23 13:10:42,686 INFO L268 TraceCheckUtils]: 25: Hoare quadruple {1292#true} {1301#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 1))} #70#return; {1301#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 1))} is VALID [2018-11-23 13:10:42,687 INFO L273 TraceCheckUtils]: 26: Hoare triple {1301#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 1))} #t~post7 := ~j1~0;~j1~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~k~0;~k~0 := #t~post8 - 1;havoc #t~post8; {1302#(<= (+ main_~n0~0 main_~n1~0) main_~j1~0)} is VALID [2018-11-23 13:10:42,688 INFO L273 TraceCheckUtils]: 27: Hoare triple {1302#(<= (+ main_~n0~0 main_~n1~0) main_~j1~0)} assume !!(~j1~0 < ~n0~0 + ~n1~0); {1293#false} is VALID [2018-11-23 13:10:42,688 INFO L256 TraceCheckUtils]: 28: Hoare triple {1293#false} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {1293#false} is VALID [2018-11-23 13:10:42,688 INFO L273 TraceCheckUtils]: 29: Hoare triple {1293#false} ~cond := #in~cond; {1293#false} is VALID [2018-11-23 13:10:42,688 INFO L273 TraceCheckUtils]: 30: Hoare triple {1293#false} assume 0 == ~cond; {1293#false} is VALID [2018-11-23 13:10:42,688 INFO L273 TraceCheckUtils]: 31: Hoare triple {1293#false} assume !false; {1293#false} is VALID [2018-11-23 13:10:42,691 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 11 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-23 13:10:42,691 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:10:42,691 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-23 13:10:42,702 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 13:10:42,726 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-11-23 13:10:42,726 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:10:42,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:10:42,760 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:10:43,136 INFO L256 TraceCheckUtils]: 0: Hoare triple {1292#true} call ULTIMATE.init(); {1292#true} is VALID [2018-11-23 13:10:43,136 INFO L273 TraceCheckUtils]: 1: Hoare triple {1292#true} assume true; {1292#true} is VALID [2018-11-23 13:10:43,136 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {1292#true} {1292#true} #66#return; {1292#true} is VALID [2018-11-23 13:10:43,137 INFO L256 TraceCheckUtils]: 3: Hoare triple {1292#true} call #t~ret9 := main(); {1292#true} is VALID [2018-11-23 13:10:43,138 INFO L273 TraceCheckUtils]: 4: Hoare triple {1292#true} havoc ~n0~0;havoc ~n1~0;~i0~0 := 0;~k~0 := 0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n0~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~n1~0 := #t~nondet2;havoc #t~nondet2; {1294#(<= main_~i0~0 0)} is VALID [2018-11-23 13:10:43,139 INFO L273 TraceCheckUtils]: 5: Hoare triple {1294#(<= main_~i0~0 0)} assume !!(-1000000 <= ~n0~0 && ~n0~0 < 1000000); {1294#(<= main_~i0~0 0)} is VALID [2018-11-23 13:10:43,139 INFO L273 TraceCheckUtils]: 6: Hoare triple {1294#(<= main_~i0~0 0)} assume !!(-1000000 <= ~n1~0 && ~n1~0 < 1000000); {1294#(<= main_~i0~0 0)} is VALID [2018-11-23 13:10:43,139 INFO L273 TraceCheckUtils]: 7: Hoare triple {1294#(<= main_~i0~0 0)} assume !(~i0~0 < ~n0~0); {1295#(<= main_~n0~0 0)} is VALID [2018-11-23 13:10:43,140 INFO L273 TraceCheckUtils]: 8: Hoare triple {1295#(<= main_~n0~0 0)} ~i1~0 := 0; {1330#(and (<= main_~i1~0 0) (<= main_~n0~0 0))} is VALID [2018-11-23 13:10:43,141 INFO L273 TraceCheckUtils]: 9: Hoare triple {1330#(and (<= main_~i1~0 0) (<= main_~n0~0 0))} assume !!(~i1~0 < ~n1~0);#t~post5 := ~i1~0;~i1~0 := 1 + #t~post5;havoc #t~post5;#t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {1334#(and (<= main_~i1~0 1) (<= main_~n0~0 0))} is VALID [2018-11-23 13:10:43,142 INFO L273 TraceCheckUtils]: 10: Hoare triple {1334#(and (<= main_~i1~0 1) (<= main_~n0~0 0))} assume !!(~i1~0 < ~n1~0);#t~post5 := ~i1~0;~i1~0 := 1 + #t~post5;havoc #t~post5;#t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {1338#(and (<= main_~i1~0 2) (<= main_~n0~0 0))} is VALID [2018-11-23 13:10:43,143 INFO L273 TraceCheckUtils]: 11: Hoare triple {1338#(and (<= main_~i1~0 2) (<= main_~n0~0 0))} assume !(~i1~0 < ~n1~0); {1342#(and (<= main_~n1~0 2) (<= main_~n0~0 0))} is VALID [2018-11-23 13:10:43,143 INFO L273 TraceCheckUtils]: 12: Hoare triple {1342#(and (<= main_~n1~0 2) (<= main_~n0~0 0))} ~j1~0 := 0; {1346#(and (<= main_~n1~0 2) (<= 0 main_~j1~0) (<= main_~n0~0 0))} is VALID [2018-11-23 13:10:43,144 INFO L273 TraceCheckUtils]: 13: Hoare triple {1346#(and (<= main_~n1~0 2) (<= 0 main_~j1~0) (<= main_~n0~0 0))} assume !!(~j1~0 < ~n0~0 + ~n1~0); {1346#(and (<= main_~n1~0 2) (<= 0 main_~j1~0) (<= main_~n0~0 0))} is VALID [2018-11-23 13:10:43,144 INFO L256 TraceCheckUtils]: 14: Hoare triple {1346#(and (<= main_~n1~0 2) (<= 0 main_~j1~0) (<= main_~n0~0 0))} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {1292#true} is VALID [2018-11-23 13:10:43,144 INFO L273 TraceCheckUtils]: 15: Hoare triple {1292#true} ~cond := #in~cond; {1292#true} is VALID [2018-11-23 13:10:43,145 INFO L273 TraceCheckUtils]: 16: Hoare triple {1292#true} assume !(0 == ~cond); {1292#true} is VALID [2018-11-23 13:10:43,145 INFO L273 TraceCheckUtils]: 17: Hoare triple {1292#true} assume true; {1292#true} is VALID [2018-11-23 13:10:43,146 INFO L268 TraceCheckUtils]: 18: Hoare quadruple {1292#true} {1346#(and (<= main_~n1~0 2) (<= 0 main_~j1~0) (<= main_~n0~0 0))} #70#return; {1346#(and (<= main_~n1~0 2) (<= 0 main_~j1~0) (<= main_~n0~0 0))} is VALID [2018-11-23 13:10:43,147 INFO L273 TraceCheckUtils]: 19: Hoare triple {1346#(and (<= main_~n1~0 2) (<= 0 main_~j1~0) (<= main_~n0~0 0))} #t~post7 := ~j1~0;~j1~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~k~0;~k~0 := #t~post8 - 1;havoc #t~post8; {1368#(and (<= 1 main_~j1~0) (<= main_~n1~0 2) (<= main_~n0~0 0))} is VALID [2018-11-23 13:10:43,149 INFO L273 TraceCheckUtils]: 20: Hoare triple {1368#(and (<= 1 main_~j1~0) (<= main_~n1~0 2) (<= main_~n0~0 0))} assume !!(~j1~0 < ~n0~0 + ~n1~0); {1368#(and (<= 1 main_~j1~0) (<= main_~n1~0 2) (<= main_~n0~0 0))} is VALID [2018-11-23 13:10:43,149 INFO L256 TraceCheckUtils]: 21: Hoare triple {1368#(and (<= 1 main_~j1~0) (<= main_~n1~0 2) (<= main_~n0~0 0))} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {1292#true} is VALID [2018-11-23 13:10:43,149 INFO L273 TraceCheckUtils]: 22: Hoare triple {1292#true} ~cond := #in~cond; {1292#true} is VALID [2018-11-23 13:10:43,149 INFO L273 TraceCheckUtils]: 23: Hoare triple {1292#true} assume !(0 == ~cond); {1292#true} is VALID [2018-11-23 13:10:43,149 INFO L273 TraceCheckUtils]: 24: Hoare triple {1292#true} assume true; {1292#true} is VALID [2018-11-23 13:10:43,152 INFO L268 TraceCheckUtils]: 25: Hoare quadruple {1292#true} {1368#(and (<= 1 main_~j1~0) (<= main_~n1~0 2) (<= main_~n0~0 0))} #70#return; {1368#(and (<= 1 main_~j1~0) (<= main_~n1~0 2) (<= main_~n0~0 0))} is VALID [2018-11-23 13:10:43,152 INFO L273 TraceCheckUtils]: 26: Hoare triple {1368#(and (<= 1 main_~j1~0) (<= main_~n1~0 2) (<= main_~n0~0 0))} #t~post7 := ~j1~0;~j1~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~k~0;~k~0 := #t~post8 - 1;havoc #t~post8; {1390#(and (<= main_~n1~0 2) (<= main_~n0~0 0) (<= 2 main_~j1~0))} is VALID [2018-11-23 13:10:43,153 INFO L273 TraceCheckUtils]: 27: Hoare triple {1390#(and (<= main_~n1~0 2) (<= main_~n0~0 0) (<= 2 main_~j1~0))} assume !!(~j1~0 < ~n0~0 + ~n1~0); {1293#false} is VALID [2018-11-23 13:10:43,153 INFO L256 TraceCheckUtils]: 28: Hoare triple {1293#false} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {1293#false} is VALID [2018-11-23 13:10:43,153 INFO L273 TraceCheckUtils]: 29: Hoare triple {1293#false} ~cond := #in~cond; {1293#false} is VALID [2018-11-23 13:10:43,153 INFO L273 TraceCheckUtils]: 30: Hoare triple {1293#false} assume 0 == ~cond; {1293#false} is VALID [2018-11-23 13:10:43,154 INFO L273 TraceCheckUtils]: 31: Hoare triple {1293#false} assume !false; {1293#false} is VALID [2018-11-23 13:10:43,155 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 11 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-23 13:10:43,184 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:10:43,185 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 18 [2018-11-23 13:10:43,185 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 32 [2018-11-23 13:10:43,185 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:10:43,186 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 18 states. [2018-11-23 13:10:43,227 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:10:43,228 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-11-23 13:10:43,228 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-11-23 13:10:43,228 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=235, Unknown=0, NotChecked=0, Total=306 [2018-11-23 13:10:43,229 INFO L87 Difference]: Start difference. First operand 39 states and 43 transitions. Second operand 18 states. [2018-11-23 13:10:44,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:10:44,240 INFO L93 Difference]: Finished difference Result 68 states and 79 transitions. [2018-11-23 13:10:44,240 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-23 13:10:44,240 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 32 [2018-11-23 13:10:44,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:10:44,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-23 13:10:44,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 55 transitions. [2018-11-23 13:10:44,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-23 13:10:44,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 55 transitions. [2018-11-23 13:10:44,244 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 55 transitions. [2018-11-23 13:10:44,294 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:10:44,296 INFO L225 Difference]: With dead ends: 68 [2018-11-23 13:10:44,296 INFO L226 Difference]: Without dead ends: 51 [2018-11-23 13:10:44,297 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=163, Invalid=487, Unknown=0, NotChecked=0, Total=650 [2018-11-23 13:10:44,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-11-23 13:10:44,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 40. [2018-11-23 13:10:44,348 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:10:44,349 INFO L82 GeneralOperation]: Start isEquivalent. First operand 51 states. Second operand 40 states. [2018-11-23 13:10:44,349 INFO L74 IsIncluded]: Start isIncluded. First operand 51 states. Second operand 40 states. [2018-11-23 13:10:44,349 INFO L87 Difference]: Start difference. First operand 51 states. Second operand 40 states. [2018-11-23 13:10:44,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:10:44,353 INFO L93 Difference]: Finished difference Result 51 states and 59 transitions. [2018-11-23 13:10:44,353 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 59 transitions. [2018-11-23 13:10:44,354 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:10:44,354 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:10:44,354 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand 51 states. [2018-11-23 13:10:44,354 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 51 states. [2018-11-23 13:10:44,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:10:44,357 INFO L93 Difference]: Finished difference Result 51 states and 59 transitions. [2018-11-23 13:10:44,358 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 59 transitions. [2018-11-23 13:10:44,358 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:10:44,358 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:10:44,358 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:10:44,359 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:10:44,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-11-23 13:10:44,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 44 transitions. [2018-11-23 13:10:44,361 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 44 transitions. Word has length 32 [2018-11-23 13:10:44,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:10:44,361 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 44 transitions. [2018-11-23 13:10:44,361 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-11-23 13:10:44,361 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 44 transitions. [2018-11-23 13:10:44,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-11-23 13:10:44,362 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:10:44,362 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:10:44,363 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:10:44,363 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:10:44,363 INFO L82 PathProgramCache]: Analyzing trace with hash 1418774638, now seen corresponding path program 1 times [2018-11-23 13:10:44,363 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:10:44,364 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:10:44,364 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:10:44,365 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:10:44,365 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:10:44,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:10:44,532 INFO L256 TraceCheckUtils]: 0: Hoare triple {1687#true} call ULTIMATE.init(); {1687#true} is VALID [2018-11-23 13:10:44,533 INFO L273 TraceCheckUtils]: 1: Hoare triple {1687#true} assume true; {1687#true} is VALID [2018-11-23 13:10:44,533 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {1687#true} {1687#true} #66#return; {1687#true} is VALID [2018-11-23 13:10:44,533 INFO L256 TraceCheckUtils]: 3: Hoare triple {1687#true} call #t~ret9 := main(); {1687#true} is VALID [2018-11-23 13:10:44,534 INFO L273 TraceCheckUtils]: 4: Hoare triple {1687#true} havoc ~n0~0;havoc ~n1~0;~i0~0 := 0;~k~0 := 0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n0~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~n1~0 := #t~nondet2;havoc #t~nondet2; {1689#(<= main_~i0~0 0)} is VALID [2018-11-23 13:10:44,535 INFO L273 TraceCheckUtils]: 5: Hoare triple {1689#(<= main_~i0~0 0)} assume !!(-1000000 <= ~n0~0 && ~n0~0 < 1000000); {1689#(<= main_~i0~0 0)} is VALID [2018-11-23 13:10:44,535 INFO L273 TraceCheckUtils]: 6: Hoare triple {1689#(<= main_~i0~0 0)} assume !!(-1000000 <= ~n1~0 && ~n1~0 < 1000000); {1689#(<= main_~i0~0 0)} is VALID [2018-11-23 13:10:44,537 INFO L273 TraceCheckUtils]: 7: Hoare triple {1689#(<= main_~i0~0 0)} assume !!(~i0~0 < ~n0~0);#t~post3 := ~i0~0;~i0~0 := 1 + #t~post3;havoc #t~post3;#t~post4 := ~k~0;~k~0 := 1 + #t~post4;havoc #t~post4; {1690#(<= main_~i0~0 1)} is VALID [2018-11-23 13:10:44,537 INFO L273 TraceCheckUtils]: 8: Hoare triple {1690#(<= main_~i0~0 1)} assume !(~i0~0 < ~n0~0); {1691#(<= main_~n0~0 1)} is VALID [2018-11-23 13:10:44,538 INFO L273 TraceCheckUtils]: 9: Hoare triple {1691#(<= main_~n0~0 1)} ~i1~0 := 0; {1692#(<= (+ main_~i1~0 main_~n0~0) 1)} is VALID [2018-11-23 13:10:44,540 INFO L273 TraceCheckUtils]: 10: Hoare triple {1692#(<= (+ main_~i1~0 main_~n0~0) 1)} assume !!(~i1~0 < ~n1~0);#t~post5 := ~i1~0;~i1~0 := 1 + #t~post5;havoc #t~post5;#t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {1693#(<= (+ main_~i1~0 main_~n0~0) 2)} is VALID [2018-11-23 13:10:44,544 INFO L273 TraceCheckUtils]: 11: Hoare triple {1693#(<= (+ main_~i1~0 main_~n0~0) 2)} assume !(~i1~0 < ~n1~0); {1694#(<= (+ main_~n0~0 main_~n1~0) 2)} is VALID [2018-11-23 13:10:44,547 INFO L273 TraceCheckUtils]: 12: Hoare triple {1694#(<= (+ main_~n0~0 main_~n1~0) 2)} ~j1~0 := 0; {1695#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 2))} is VALID [2018-11-23 13:10:44,549 INFO L273 TraceCheckUtils]: 13: Hoare triple {1695#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 2))} assume !!(~j1~0 < ~n0~0 + ~n1~0); {1695#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 2))} is VALID [2018-11-23 13:10:44,549 INFO L256 TraceCheckUtils]: 14: Hoare triple {1695#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 2))} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {1687#true} is VALID [2018-11-23 13:10:44,549 INFO L273 TraceCheckUtils]: 15: Hoare triple {1687#true} ~cond := #in~cond; {1687#true} is VALID [2018-11-23 13:10:44,550 INFO L273 TraceCheckUtils]: 16: Hoare triple {1687#true} assume !(0 == ~cond); {1687#true} is VALID [2018-11-23 13:10:44,550 INFO L273 TraceCheckUtils]: 17: Hoare triple {1687#true} assume true; {1687#true} is VALID [2018-11-23 13:10:44,550 INFO L268 TraceCheckUtils]: 18: Hoare quadruple {1687#true} {1695#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 2))} #70#return; {1695#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 2))} is VALID [2018-11-23 13:10:44,551 INFO L273 TraceCheckUtils]: 19: Hoare triple {1695#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 2))} #t~post7 := ~j1~0;~j1~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~k~0;~k~0 := #t~post8 - 1;havoc #t~post8; {1696#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 1))} is VALID [2018-11-23 13:10:44,552 INFO L273 TraceCheckUtils]: 20: Hoare triple {1696#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 1))} assume !!(~j1~0 < ~n0~0 + ~n1~0); {1696#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 1))} is VALID [2018-11-23 13:10:44,552 INFO L256 TraceCheckUtils]: 21: Hoare triple {1696#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 1))} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {1687#true} is VALID [2018-11-23 13:10:44,552 INFO L273 TraceCheckUtils]: 22: Hoare triple {1687#true} ~cond := #in~cond; {1687#true} is VALID [2018-11-23 13:10:44,552 INFO L273 TraceCheckUtils]: 23: Hoare triple {1687#true} assume !(0 == ~cond); {1687#true} is VALID [2018-11-23 13:10:44,552 INFO L273 TraceCheckUtils]: 24: Hoare triple {1687#true} assume true; {1687#true} is VALID [2018-11-23 13:10:44,553 INFO L268 TraceCheckUtils]: 25: Hoare quadruple {1687#true} {1696#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 1))} #70#return; {1696#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 1))} is VALID [2018-11-23 13:10:44,554 INFO L273 TraceCheckUtils]: 26: Hoare triple {1696#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 1))} #t~post7 := ~j1~0;~j1~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~k~0;~k~0 := #t~post8 - 1;havoc #t~post8; {1697#(<= (+ main_~n0~0 main_~n1~0) main_~j1~0)} is VALID [2018-11-23 13:10:44,555 INFO L273 TraceCheckUtils]: 27: Hoare triple {1697#(<= (+ main_~n0~0 main_~n1~0) main_~j1~0)} assume !!(~j1~0 < ~n0~0 + ~n1~0); {1688#false} is VALID [2018-11-23 13:10:44,555 INFO L256 TraceCheckUtils]: 28: Hoare triple {1688#false} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {1688#false} is VALID [2018-11-23 13:10:44,555 INFO L273 TraceCheckUtils]: 29: Hoare triple {1688#false} ~cond := #in~cond; {1688#false} is VALID [2018-11-23 13:10:44,556 INFO L273 TraceCheckUtils]: 30: Hoare triple {1688#false} assume 0 == ~cond; {1688#false} is VALID [2018-11-23 13:10:44,556 INFO L273 TraceCheckUtils]: 31: Hoare triple {1688#false} assume !false; {1688#false} is VALID [2018-11-23 13:10:44,559 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 11 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-23 13:10:44,559 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:10:44,559 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:10:44,568 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:10:44,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:10:44,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:10:44,596 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:10:44,909 INFO L256 TraceCheckUtils]: 0: Hoare triple {1687#true} call ULTIMATE.init(); {1687#true} is VALID [2018-11-23 13:10:44,909 INFO L273 TraceCheckUtils]: 1: Hoare triple {1687#true} assume true; {1687#true} is VALID [2018-11-23 13:10:44,910 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {1687#true} {1687#true} #66#return; {1687#true} is VALID [2018-11-23 13:10:44,910 INFO L256 TraceCheckUtils]: 3: Hoare triple {1687#true} call #t~ret9 := main(); {1687#true} is VALID [2018-11-23 13:10:44,911 INFO L273 TraceCheckUtils]: 4: Hoare triple {1687#true} havoc ~n0~0;havoc ~n1~0;~i0~0 := 0;~k~0 := 0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n0~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~n1~0 := #t~nondet2;havoc #t~nondet2; {1689#(<= main_~i0~0 0)} is VALID [2018-11-23 13:10:44,911 INFO L273 TraceCheckUtils]: 5: Hoare triple {1689#(<= main_~i0~0 0)} assume !!(-1000000 <= ~n0~0 && ~n0~0 < 1000000); {1689#(<= main_~i0~0 0)} is VALID [2018-11-23 13:10:44,911 INFO L273 TraceCheckUtils]: 6: Hoare triple {1689#(<= main_~i0~0 0)} assume !!(-1000000 <= ~n1~0 && ~n1~0 < 1000000); {1689#(<= main_~i0~0 0)} is VALID [2018-11-23 13:10:44,912 INFO L273 TraceCheckUtils]: 7: Hoare triple {1689#(<= main_~i0~0 0)} assume !!(~i0~0 < ~n0~0);#t~post3 := ~i0~0;~i0~0 := 1 + #t~post3;havoc #t~post3;#t~post4 := ~k~0;~k~0 := 1 + #t~post4;havoc #t~post4; {1690#(<= main_~i0~0 1)} is VALID [2018-11-23 13:10:44,912 INFO L273 TraceCheckUtils]: 8: Hoare triple {1690#(<= main_~i0~0 1)} assume !(~i0~0 < ~n0~0); {1691#(<= main_~n0~0 1)} is VALID [2018-11-23 13:10:44,913 INFO L273 TraceCheckUtils]: 9: Hoare triple {1691#(<= main_~n0~0 1)} ~i1~0 := 0; {1728#(and (<= main_~i1~0 0) (<= main_~n0~0 1))} is VALID [2018-11-23 13:10:44,914 INFO L273 TraceCheckUtils]: 10: Hoare triple {1728#(and (<= main_~i1~0 0) (<= main_~n0~0 1))} assume !!(~i1~0 < ~n1~0);#t~post5 := ~i1~0;~i1~0 := 1 + #t~post5;havoc #t~post5;#t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {1732#(and (<= main_~i1~0 1) (<= main_~n0~0 1))} is VALID [2018-11-23 13:10:44,914 INFO L273 TraceCheckUtils]: 11: Hoare triple {1732#(and (<= main_~i1~0 1) (<= main_~n0~0 1))} assume !(~i1~0 < ~n1~0); {1736#(and (<= main_~n1~0 1) (<= main_~n0~0 1))} is VALID [2018-11-23 13:10:44,916 INFO L273 TraceCheckUtils]: 12: Hoare triple {1736#(and (<= main_~n1~0 1) (<= main_~n0~0 1))} ~j1~0 := 0; {1740#(and (<= main_~n1~0 1) (<= 0 main_~j1~0) (<= main_~n0~0 1))} is VALID [2018-11-23 13:10:44,917 INFO L273 TraceCheckUtils]: 13: Hoare triple {1740#(and (<= main_~n1~0 1) (<= 0 main_~j1~0) (<= main_~n0~0 1))} assume !!(~j1~0 < ~n0~0 + ~n1~0); {1740#(and (<= main_~n1~0 1) (<= 0 main_~j1~0) (<= main_~n0~0 1))} is VALID [2018-11-23 13:10:44,917 INFO L256 TraceCheckUtils]: 14: Hoare triple {1740#(and (<= main_~n1~0 1) (<= 0 main_~j1~0) (<= main_~n0~0 1))} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {1687#true} is VALID [2018-11-23 13:10:44,917 INFO L273 TraceCheckUtils]: 15: Hoare triple {1687#true} ~cond := #in~cond; {1687#true} is VALID [2018-11-23 13:10:44,917 INFO L273 TraceCheckUtils]: 16: Hoare triple {1687#true} assume !(0 == ~cond); {1687#true} is VALID [2018-11-23 13:10:44,918 INFO L273 TraceCheckUtils]: 17: Hoare triple {1687#true} assume true; {1687#true} is VALID [2018-11-23 13:10:44,919 INFO L268 TraceCheckUtils]: 18: Hoare quadruple {1687#true} {1740#(and (<= main_~n1~0 1) (<= 0 main_~j1~0) (<= main_~n0~0 1))} #70#return; {1740#(and (<= main_~n1~0 1) (<= 0 main_~j1~0) (<= main_~n0~0 1))} is VALID [2018-11-23 13:10:44,920 INFO L273 TraceCheckUtils]: 19: Hoare triple {1740#(and (<= main_~n1~0 1) (<= 0 main_~j1~0) (<= main_~n0~0 1))} #t~post7 := ~j1~0;~j1~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~k~0;~k~0 := #t~post8 - 1;havoc #t~post8; {1762#(and (<= main_~n1~0 1) (<= 1 main_~j1~0) (<= main_~n0~0 1))} is VALID [2018-11-23 13:10:44,921 INFO L273 TraceCheckUtils]: 20: Hoare triple {1762#(and (<= main_~n1~0 1) (<= 1 main_~j1~0) (<= main_~n0~0 1))} assume !!(~j1~0 < ~n0~0 + ~n1~0); {1762#(and (<= main_~n1~0 1) (<= 1 main_~j1~0) (<= main_~n0~0 1))} is VALID [2018-11-23 13:10:44,921 INFO L256 TraceCheckUtils]: 21: Hoare triple {1762#(and (<= main_~n1~0 1) (<= 1 main_~j1~0) (<= main_~n0~0 1))} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {1687#true} is VALID [2018-11-23 13:10:44,921 INFO L273 TraceCheckUtils]: 22: Hoare triple {1687#true} ~cond := #in~cond; {1687#true} is VALID [2018-11-23 13:10:44,921 INFO L273 TraceCheckUtils]: 23: Hoare triple {1687#true} assume !(0 == ~cond); {1687#true} is VALID [2018-11-23 13:10:44,922 INFO L273 TraceCheckUtils]: 24: Hoare triple {1687#true} assume true; {1687#true} is VALID [2018-11-23 13:10:44,923 INFO L268 TraceCheckUtils]: 25: Hoare quadruple {1687#true} {1762#(and (<= main_~n1~0 1) (<= 1 main_~j1~0) (<= main_~n0~0 1))} #70#return; {1762#(and (<= main_~n1~0 1) (<= 1 main_~j1~0) (<= main_~n0~0 1))} is VALID [2018-11-23 13:10:44,924 INFO L273 TraceCheckUtils]: 26: Hoare triple {1762#(and (<= main_~n1~0 1) (<= 1 main_~j1~0) (<= main_~n0~0 1))} #t~post7 := ~j1~0;~j1~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~k~0;~k~0 := #t~post8 - 1;havoc #t~post8; {1784#(and (<= main_~n1~0 1) (<= main_~n0~0 1) (<= 2 main_~j1~0))} is VALID [2018-11-23 13:10:44,924 INFO L273 TraceCheckUtils]: 27: Hoare triple {1784#(and (<= main_~n1~0 1) (<= main_~n0~0 1) (<= 2 main_~j1~0))} assume !!(~j1~0 < ~n0~0 + ~n1~0); {1688#false} is VALID [2018-11-23 13:10:44,924 INFO L256 TraceCheckUtils]: 28: Hoare triple {1688#false} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {1688#false} is VALID [2018-11-23 13:10:44,924 INFO L273 TraceCheckUtils]: 29: Hoare triple {1688#false} ~cond := #in~cond; {1688#false} is VALID [2018-11-23 13:10:44,925 INFO L273 TraceCheckUtils]: 30: Hoare triple {1688#false} assume 0 == ~cond; {1688#false} is VALID [2018-11-23 13:10:44,925 INFO L273 TraceCheckUtils]: 31: Hoare triple {1688#false} assume !false; {1688#false} is VALID [2018-11-23 13:10:44,926 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 11 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-23 13:10:44,945 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:10:44,946 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 17 [2018-11-23 13:10:44,946 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 32 [2018-11-23 13:10:44,946 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:10:44,947 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states. [2018-11-23 13:10:44,993 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:10:44,993 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-23 13:10:44,993 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-23 13:10:44,994 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=210, Unknown=0, NotChecked=0, Total=272 [2018-11-23 13:10:44,994 INFO L87 Difference]: Start difference. First operand 40 states and 44 transitions. Second operand 17 states. [2018-11-23 13:10:45,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:10:45,865 INFO L93 Difference]: Finished difference Result 79 states and 94 transitions. [2018-11-23 13:10:45,865 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-23 13:10:45,865 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 32 [2018-11-23 13:10:45,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:10:45,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-23 13:10:45,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 66 transitions. [2018-11-23 13:10:45,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-23 13:10:45,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 66 transitions. [2018-11-23 13:10:45,870 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states and 66 transitions. [2018-11-23 13:10:45,958 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:10:45,960 INFO L225 Difference]: With dead ends: 79 [2018-11-23 13:10:45,961 INFO L226 Difference]: Without dead ends: 62 [2018-11-23 13:10:45,962 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 127 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=171, Invalid=531, Unknown=0, NotChecked=0, Total=702 [2018-11-23 13:10:45,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2018-11-23 13:10:46,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 40. [2018-11-23 13:10:46,103 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:10:46,103 INFO L82 GeneralOperation]: Start isEquivalent. First operand 62 states. Second operand 40 states. [2018-11-23 13:10:46,104 INFO L74 IsIncluded]: Start isIncluded. First operand 62 states. Second operand 40 states. [2018-11-23 13:10:46,104 INFO L87 Difference]: Start difference. First operand 62 states. Second operand 40 states. [2018-11-23 13:10:46,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:10:46,107 INFO L93 Difference]: Finished difference Result 62 states and 74 transitions. [2018-11-23 13:10:46,107 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 74 transitions. [2018-11-23 13:10:46,108 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:10:46,108 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:10:46,108 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand 62 states. [2018-11-23 13:10:46,108 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 62 states. [2018-11-23 13:10:46,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:10:46,111 INFO L93 Difference]: Finished difference Result 62 states and 74 transitions. [2018-11-23 13:10:46,111 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 74 transitions. [2018-11-23 13:10:46,112 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:10:46,112 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:10:46,112 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:10:46,112 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:10:46,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-11-23 13:10:46,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 44 transitions. [2018-11-23 13:10:46,114 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 44 transitions. Word has length 32 [2018-11-23 13:10:46,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:10:46,114 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 44 transitions. [2018-11-23 13:10:46,114 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-23 13:10:46,114 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 44 transitions. [2018-11-23 13:10:46,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-11-23 13:10:46,115 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:10:46,115 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:10:46,116 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:10:46,116 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:10:46,116 INFO L82 PathProgramCache]: Analyzing trace with hash -726221041, now seen corresponding path program 2 times [2018-11-23 13:10:46,116 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:10:46,116 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:10:46,117 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:10:46,117 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:10:46,117 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:10:46,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:10:46,428 INFO L256 TraceCheckUtils]: 0: Hoare triple {2126#true} call ULTIMATE.init(); {2126#true} is VALID [2018-11-23 13:10:46,429 INFO L273 TraceCheckUtils]: 1: Hoare triple {2126#true} assume true; {2126#true} is VALID [2018-11-23 13:10:46,429 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {2126#true} {2126#true} #66#return; {2126#true} is VALID [2018-11-23 13:10:46,429 INFO L256 TraceCheckUtils]: 3: Hoare triple {2126#true} call #t~ret9 := main(); {2126#true} is VALID [2018-11-23 13:10:46,430 INFO L273 TraceCheckUtils]: 4: Hoare triple {2126#true} havoc ~n0~0;havoc ~n1~0;~i0~0 := 0;~k~0 := 0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n0~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~n1~0 := #t~nondet2;havoc #t~nondet2; {2128#(<= main_~i0~0 0)} is VALID [2018-11-23 13:10:46,431 INFO L273 TraceCheckUtils]: 5: Hoare triple {2128#(<= main_~i0~0 0)} assume !!(-1000000 <= ~n0~0 && ~n0~0 < 1000000); {2128#(<= main_~i0~0 0)} is VALID [2018-11-23 13:10:46,431 INFO L273 TraceCheckUtils]: 6: Hoare triple {2128#(<= main_~i0~0 0)} assume !!(-1000000 <= ~n1~0 && ~n1~0 < 1000000); {2128#(<= main_~i0~0 0)} is VALID [2018-11-23 13:10:46,432 INFO L273 TraceCheckUtils]: 7: Hoare triple {2128#(<= main_~i0~0 0)} assume !!(~i0~0 < ~n0~0);#t~post3 := ~i0~0;~i0~0 := 1 + #t~post3;havoc #t~post3;#t~post4 := ~k~0;~k~0 := 1 + #t~post4;havoc #t~post4; {2129#(<= main_~i0~0 1)} is VALID [2018-11-23 13:10:46,432 INFO L273 TraceCheckUtils]: 8: Hoare triple {2129#(<= main_~i0~0 1)} assume !!(~i0~0 < ~n0~0);#t~post3 := ~i0~0;~i0~0 := 1 + #t~post3;havoc #t~post3;#t~post4 := ~k~0;~k~0 := 1 + #t~post4;havoc #t~post4; {2130#(<= main_~i0~0 2)} is VALID [2018-11-23 13:10:46,433 INFO L273 TraceCheckUtils]: 9: Hoare triple {2130#(<= main_~i0~0 2)} assume !(~i0~0 < ~n0~0); {2131#(<= main_~n0~0 2)} is VALID [2018-11-23 13:10:46,433 INFO L273 TraceCheckUtils]: 10: Hoare triple {2131#(<= main_~n0~0 2)} ~i1~0 := 0; {2132#(<= (+ main_~i1~0 main_~n0~0) 2)} is VALID [2018-11-23 13:10:46,434 INFO L273 TraceCheckUtils]: 11: Hoare triple {2132#(<= (+ main_~i1~0 main_~n0~0) 2)} assume !(~i1~0 < ~n1~0); {2133#(<= (+ main_~n0~0 main_~n1~0) 2)} is VALID [2018-11-23 13:10:46,435 INFO L273 TraceCheckUtils]: 12: Hoare triple {2133#(<= (+ main_~n0~0 main_~n1~0) 2)} ~j1~0 := 0; {2134#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 2))} is VALID [2018-11-23 13:10:46,435 INFO L273 TraceCheckUtils]: 13: Hoare triple {2134#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 2))} assume !!(~j1~0 < ~n0~0 + ~n1~0); {2134#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 2))} is VALID [2018-11-23 13:10:46,436 INFO L256 TraceCheckUtils]: 14: Hoare triple {2134#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 2))} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {2126#true} is VALID [2018-11-23 13:10:46,436 INFO L273 TraceCheckUtils]: 15: Hoare triple {2126#true} ~cond := #in~cond; {2126#true} is VALID [2018-11-23 13:10:46,436 INFO L273 TraceCheckUtils]: 16: Hoare triple {2126#true} assume !(0 == ~cond); {2126#true} is VALID [2018-11-23 13:10:46,436 INFO L273 TraceCheckUtils]: 17: Hoare triple {2126#true} assume true; {2126#true} is VALID [2018-11-23 13:10:46,437 INFO L268 TraceCheckUtils]: 18: Hoare quadruple {2126#true} {2134#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 2))} #70#return; {2134#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 2))} is VALID [2018-11-23 13:10:46,438 INFO L273 TraceCheckUtils]: 19: Hoare triple {2134#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 2))} #t~post7 := ~j1~0;~j1~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~k~0;~k~0 := #t~post8 - 1;havoc #t~post8; {2135#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 1))} is VALID [2018-11-23 13:10:46,439 INFO L273 TraceCheckUtils]: 20: Hoare triple {2135#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 1))} assume !!(~j1~0 < ~n0~0 + ~n1~0); {2135#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 1))} is VALID [2018-11-23 13:10:46,439 INFO L256 TraceCheckUtils]: 21: Hoare triple {2135#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 1))} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {2126#true} is VALID [2018-11-23 13:10:46,439 INFO L273 TraceCheckUtils]: 22: Hoare triple {2126#true} ~cond := #in~cond; {2126#true} is VALID [2018-11-23 13:10:46,439 INFO L273 TraceCheckUtils]: 23: Hoare triple {2126#true} assume !(0 == ~cond); {2126#true} is VALID [2018-11-23 13:10:46,439 INFO L273 TraceCheckUtils]: 24: Hoare triple {2126#true} assume true; {2126#true} is VALID [2018-11-23 13:10:46,440 INFO L268 TraceCheckUtils]: 25: Hoare quadruple {2126#true} {2135#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 1))} #70#return; {2135#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 1))} is VALID [2018-11-23 13:10:46,440 INFO L273 TraceCheckUtils]: 26: Hoare triple {2135#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 1))} #t~post7 := ~j1~0;~j1~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~k~0;~k~0 := #t~post8 - 1;havoc #t~post8; {2136#(<= (+ main_~n0~0 main_~n1~0) main_~j1~0)} is VALID [2018-11-23 13:10:46,441 INFO L273 TraceCheckUtils]: 27: Hoare triple {2136#(<= (+ main_~n0~0 main_~n1~0) main_~j1~0)} assume !!(~j1~0 < ~n0~0 + ~n1~0); {2127#false} is VALID [2018-11-23 13:10:46,441 INFO L256 TraceCheckUtils]: 28: Hoare triple {2127#false} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {2127#false} is VALID [2018-11-23 13:10:46,441 INFO L273 TraceCheckUtils]: 29: Hoare triple {2127#false} ~cond := #in~cond; {2127#false} is VALID [2018-11-23 13:10:46,441 INFO L273 TraceCheckUtils]: 30: Hoare triple {2127#false} assume 0 == ~cond; {2127#false} is VALID [2018-11-23 13:10:46,441 INFO L273 TraceCheckUtils]: 31: Hoare triple {2127#false} assume !false; {2127#false} is VALID [2018-11-23 13:10:46,443 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 11 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-23 13:10:46,443 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:10:46,443 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:10:46,454 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 13:10:46,469 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 13:10:46,469 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:10:46,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:10:46,477 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:10:46,804 INFO L256 TraceCheckUtils]: 0: Hoare triple {2126#true} call ULTIMATE.init(); {2126#true} is VALID [2018-11-23 13:10:46,804 INFO L273 TraceCheckUtils]: 1: Hoare triple {2126#true} assume true; {2126#true} is VALID [2018-11-23 13:10:46,804 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {2126#true} {2126#true} #66#return; {2126#true} is VALID [2018-11-23 13:10:46,805 INFO L256 TraceCheckUtils]: 3: Hoare triple {2126#true} call #t~ret9 := main(); {2126#true} is VALID [2018-11-23 13:10:46,807 INFO L273 TraceCheckUtils]: 4: Hoare triple {2126#true} havoc ~n0~0;havoc ~n1~0;~i0~0 := 0;~k~0 := 0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n0~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~n1~0 := #t~nondet2;havoc #t~nondet2; {2128#(<= main_~i0~0 0)} is VALID [2018-11-23 13:10:46,807 INFO L273 TraceCheckUtils]: 5: Hoare triple {2128#(<= main_~i0~0 0)} assume !!(-1000000 <= ~n0~0 && ~n0~0 < 1000000); {2128#(<= main_~i0~0 0)} is VALID [2018-11-23 13:10:46,815 INFO L273 TraceCheckUtils]: 6: Hoare triple {2128#(<= main_~i0~0 0)} assume !!(-1000000 <= ~n1~0 && ~n1~0 < 1000000); {2128#(<= main_~i0~0 0)} is VALID [2018-11-23 13:10:46,816 INFO L273 TraceCheckUtils]: 7: Hoare triple {2128#(<= main_~i0~0 0)} assume !!(~i0~0 < ~n0~0);#t~post3 := ~i0~0;~i0~0 := 1 + #t~post3;havoc #t~post3;#t~post4 := ~k~0;~k~0 := 1 + #t~post4;havoc #t~post4; {2129#(<= main_~i0~0 1)} is VALID [2018-11-23 13:10:46,816 INFO L273 TraceCheckUtils]: 8: Hoare triple {2129#(<= main_~i0~0 1)} assume !!(~i0~0 < ~n0~0);#t~post3 := ~i0~0;~i0~0 := 1 + #t~post3;havoc #t~post3;#t~post4 := ~k~0;~k~0 := 1 + #t~post4;havoc #t~post4; {2130#(<= main_~i0~0 2)} is VALID [2018-11-23 13:10:46,817 INFO L273 TraceCheckUtils]: 9: Hoare triple {2130#(<= main_~i0~0 2)} assume !(~i0~0 < ~n0~0); {2131#(<= main_~n0~0 2)} is VALID [2018-11-23 13:10:46,823 INFO L273 TraceCheckUtils]: 10: Hoare triple {2131#(<= main_~n0~0 2)} ~i1~0 := 0; {2170#(and (<= main_~n0~0 2) (<= main_~i1~0 0))} is VALID [2018-11-23 13:10:46,824 INFO L273 TraceCheckUtils]: 11: Hoare triple {2170#(and (<= main_~n0~0 2) (<= main_~i1~0 0))} assume !(~i1~0 < ~n1~0); {2174#(and (<= main_~n1~0 0) (<= main_~n0~0 2))} is VALID [2018-11-23 13:10:46,825 INFO L273 TraceCheckUtils]: 12: Hoare triple {2174#(and (<= main_~n1~0 0) (<= main_~n0~0 2))} ~j1~0 := 0; {2178#(and (<= main_~n1~0 0) (<= main_~n0~0 2) (<= 0 main_~j1~0))} is VALID [2018-11-23 13:10:46,825 INFO L273 TraceCheckUtils]: 13: Hoare triple {2178#(and (<= main_~n1~0 0) (<= main_~n0~0 2) (<= 0 main_~j1~0))} assume !!(~j1~0 < ~n0~0 + ~n1~0); {2178#(and (<= main_~n1~0 0) (<= main_~n0~0 2) (<= 0 main_~j1~0))} is VALID [2018-11-23 13:10:46,826 INFO L256 TraceCheckUtils]: 14: Hoare triple {2178#(and (<= main_~n1~0 0) (<= main_~n0~0 2) (<= 0 main_~j1~0))} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {2126#true} is VALID [2018-11-23 13:10:46,826 INFO L273 TraceCheckUtils]: 15: Hoare triple {2126#true} ~cond := #in~cond; {2126#true} is VALID [2018-11-23 13:10:46,826 INFO L273 TraceCheckUtils]: 16: Hoare triple {2126#true} assume !(0 == ~cond); {2126#true} is VALID [2018-11-23 13:10:46,826 INFO L273 TraceCheckUtils]: 17: Hoare triple {2126#true} assume true; {2126#true} is VALID [2018-11-23 13:10:46,827 INFO L268 TraceCheckUtils]: 18: Hoare quadruple {2126#true} {2178#(and (<= main_~n1~0 0) (<= main_~n0~0 2) (<= 0 main_~j1~0))} #70#return; {2178#(and (<= main_~n1~0 0) (<= main_~n0~0 2) (<= 0 main_~j1~0))} is VALID [2018-11-23 13:10:46,828 INFO L273 TraceCheckUtils]: 19: Hoare triple {2178#(and (<= main_~n1~0 0) (<= main_~n0~0 2) (<= 0 main_~j1~0))} #t~post7 := ~j1~0;~j1~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~k~0;~k~0 := #t~post8 - 1;havoc #t~post8; {2200#(and (<= main_~n1~0 0) (<= 1 main_~j1~0) (<= main_~n0~0 2))} is VALID [2018-11-23 13:10:46,828 INFO L273 TraceCheckUtils]: 20: Hoare triple {2200#(and (<= main_~n1~0 0) (<= 1 main_~j1~0) (<= main_~n0~0 2))} assume !!(~j1~0 < ~n0~0 + ~n1~0); {2200#(and (<= main_~n1~0 0) (<= 1 main_~j1~0) (<= main_~n0~0 2))} is VALID [2018-11-23 13:10:46,828 INFO L256 TraceCheckUtils]: 21: Hoare triple {2200#(and (<= main_~n1~0 0) (<= 1 main_~j1~0) (<= main_~n0~0 2))} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {2126#true} is VALID [2018-11-23 13:10:46,828 INFO L273 TraceCheckUtils]: 22: Hoare triple {2126#true} ~cond := #in~cond; {2126#true} is VALID [2018-11-23 13:10:46,829 INFO L273 TraceCheckUtils]: 23: Hoare triple {2126#true} assume !(0 == ~cond); {2126#true} is VALID [2018-11-23 13:10:46,829 INFO L273 TraceCheckUtils]: 24: Hoare triple {2126#true} assume true; {2126#true} is VALID [2018-11-23 13:10:46,829 INFO L268 TraceCheckUtils]: 25: Hoare quadruple {2126#true} {2200#(and (<= main_~n1~0 0) (<= 1 main_~j1~0) (<= main_~n0~0 2))} #70#return; {2200#(and (<= main_~n1~0 0) (<= 1 main_~j1~0) (<= main_~n0~0 2))} is VALID [2018-11-23 13:10:46,830 INFO L273 TraceCheckUtils]: 26: Hoare triple {2200#(and (<= main_~n1~0 0) (<= 1 main_~j1~0) (<= main_~n0~0 2))} #t~post7 := ~j1~0;~j1~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~k~0;~k~0 := #t~post8 - 1;havoc #t~post8; {2222#(and (<= main_~n1~0 0) (<= main_~n0~0 2) (<= 2 main_~j1~0))} is VALID [2018-11-23 13:10:46,831 INFO L273 TraceCheckUtils]: 27: Hoare triple {2222#(and (<= main_~n1~0 0) (<= main_~n0~0 2) (<= 2 main_~j1~0))} assume !!(~j1~0 < ~n0~0 + ~n1~0); {2127#false} is VALID [2018-11-23 13:10:46,831 INFO L256 TraceCheckUtils]: 28: Hoare triple {2127#false} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {2127#false} is VALID [2018-11-23 13:10:46,832 INFO L273 TraceCheckUtils]: 29: Hoare triple {2127#false} ~cond := #in~cond; {2127#false} is VALID [2018-11-23 13:10:46,832 INFO L273 TraceCheckUtils]: 30: Hoare triple {2127#false} assume 0 == ~cond; {2127#false} is VALID [2018-11-23 13:10:46,832 INFO L273 TraceCheckUtils]: 31: Hoare triple {2127#false} assume !false; {2127#false} is VALID [2018-11-23 13:10:46,834 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 11 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-23 13:10:46,853 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:10:46,853 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 16 [2018-11-23 13:10:46,854 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 32 [2018-11-23 13:10:46,854 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:10:46,854 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states. [2018-11-23 13:10:46,889 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:10:46,889 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-11-23 13:10:46,890 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-11-23 13:10:46,890 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2018-11-23 13:10:46,891 INFO L87 Difference]: Start difference. First operand 40 states and 44 transitions. Second operand 16 states. [2018-11-23 13:10:47,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:10:47,843 INFO L93 Difference]: Finished difference Result 92 states and 112 transitions. [2018-11-23 13:10:47,843 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-23 13:10:47,843 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 32 [2018-11-23 13:10:47,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:10:47,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-23 13:10:47,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 75 transitions. [2018-11-23 13:10:47,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-23 13:10:47,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 75 transitions. [2018-11-23 13:10:47,849 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states and 75 transitions. [2018-11-23 13:10:47,948 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 75 edges. 75 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:10:47,950 INFO L225 Difference]: With dead ends: 92 [2018-11-23 13:10:47,950 INFO L226 Difference]: Without dead ends: 75 [2018-11-23 13:10:47,951 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=163, Invalid=487, Unknown=0, NotChecked=0, Total=650 [2018-11-23 13:10:47,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-11-23 13:10:48,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 42. [2018-11-23 13:10:48,045 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:10:48,045 INFO L82 GeneralOperation]: Start isEquivalent. First operand 75 states. Second operand 42 states. [2018-11-23 13:10:48,045 INFO L74 IsIncluded]: Start isIncluded. First operand 75 states. Second operand 42 states. [2018-11-23 13:10:48,045 INFO L87 Difference]: Start difference. First operand 75 states. Second operand 42 states. [2018-11-23 13:10:48,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:10:48,049 INFO L93 Difference]: Finished difference Result 75 states and 92 transitions. [2018-11-23 13:10:48,049 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 92 transitions. [2018-11-23 13:10:48,049 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:10:48,049 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:10:48,050 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand 75 states. [2018-11-23 13:10:48,050 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 75 states. [2018-11-23 13:10:48,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:10:48,054 INFO L93 Difference]: Finished difference Result 75 states and 92 transitions. [2018-11-23 13:10:48,054 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 92 transitions. [2018-11-23 13:10:48,055 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:10:48,055 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:10:48,055 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:10:48,055 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:10:48,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-11-23 13:10:48,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 47 transitions. [2018-11-23 13:10:48,057 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 47 transitions. Word has length 32 [2018-11-23 13:10:48,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:10:48,057 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 47 transitions. [2018-11-23 13:10:48,057 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-11-23 13:10:48,058 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 47 transitions. [2018-11-23 13:10:48,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-11-23 13:10:48,058 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:10:48,059 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:10:48,059 INFO L423 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:10:48,059 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:10:48,059 INFO L82 PathProgramCache]: Analyzing trace with hash -747175289, now seen corresponding path program 4 times [2018-11-23 13:10:48,059 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:10:48,059 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:10:48,060 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:10:48,060 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:10:48,061 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:10:48,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:10:48,247 INFO L256 TraceCheckUtils]: 0: Hoare triple {2615#true} call ULTIMATE.init(); {2615#true} is VALID [2018-11-23 13:10:48,248 INFO L273 TraceCheckUtils]: 1: Hoare triple {2615#true} assume true; {2615#true} is VALID [2018-11-23 13:10:48,248 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {2615#true} {2615#true} #66#return; {2615#true} is VALID [2018-11-23 13:10:48,248 INFO L256 TraceCheckUtils]: 3: Hoare triple {2615#true} call #t~ret9 := main(); {2615#true} is VALID [2018-11-23 13:10:48,249 INFO L273 TraceCheckUtils]: 4: Hoare triple {2615#true} havoc ~n0~0;havoc ~n1~0;~i0~0 := 0;~k~0 := 0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n0~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~n1~0 := #t~nondet2;havoc #t~nondet2; {2617#(<= 0 main_~k~0)} is VALID [2018-11-23 13:10:48,249 INFO L273 TraceCheckUtils]: 5: Hoare triple {2617#(<= 0 main_~k~0)} assume !!(-1000000 <= ~n0~0 && ~n0~0 < 1000000); {2617#(<= 0 main_~k~0)} is VALID [2018-11-23 13:10:48,249 INFO L273 TraceCheckUtils]: 6: Hoare triple {2617#(<= 0 main_~k~0)} assume !!(-1000000 <= ~n1~0 && ~n1~0 < 1000000); {2617#(<= 0 main_~k~0)} is VALID [2018-11-23 13:10:48,251 INFO L273 TraceCheckUtils]: 7: Hoare triple {2617#(<= 0 main_~k~0)} assume !(~i0~0 < ~n0~0); {2617#(<= 0 main_~k~0)} is VALID [2018-11-23 13:10:48,251 INFO L273 TraceCheckUtils]: 8: Hoare triple {2617#(<= 0 main_~k~0)} ~i1~0 := 0; {2617#(<= 0 main_~k~0)} is VALID [2018-11-23 13:10:48,252 INFO L273 TraceCheckUtils]: 9: Hoare triple {2617#(<= 0 main_~k~0)} assume !!(~i1~0 < ~n1~0);#t~post5 := ~i1~0;~i1~0 := 1 + #t~post5;havoc #t~post5;#t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {2618#(<= 1 main_~k~0)} is VALID [2018-11-23 13:10:48,254 INFO L273 TraceCheckUtils]: 10: Hoare triple {2618#(<= 1 main_~k~0)} assume !!(~i1~0 < ~n1~0);#t~post5 := ~i1~0;~i1~0 := 1 + #t~post5;havoc #t~post5;#t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {2619#(<= 2 main_~k~0)} is VALID [2018-11-23 13:10:48,255 INFO L273 TraceCheckUtils]: 11: Hoare triple {2619#(<= 2 main_~k~0)} assume !!(~i1~0 < ~n1~0);#t~post5 := ~i1~0;~i1~0 := 1 + #t~post5;havoc #t~post5;#t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {2620#(<= 3 main_~k~0)} is VALID [2018-11-23 13:10:48,271 INFO L273 TraceCheckUtils]: 12: Hoare triple {2620#(<= 3 main_~k~0)} assume !(~i1~0 < ~n1~0); {2620#(<= 3 main_~k~0)} is VALID [2018-11-23 13:10:48,274 INFO L273 TraceCheckUtils]: 13: Hoare triple {2620#(<= 3 main_~k~0)} ~j1~0 := 0; {2620#(<= 3 main_~k~0)} is VALID [2018-11-23 13:10:48,274 INFO L273 TraceCheckUtils]: 14: Hoare triple {2620#(<= 3 main_~k~0)} assume !!(~j1~0 < ~n0~0 + ~n1~0); {2620#(<= 3 main_~k~0)} is VALID [2018-11-23 13:10:48,274 INFO L256 TraceCheckUtils]: 15: Hoare triple {2620#(<= 3 main_~k~0)} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {2615#true} is VALID [2018-11-23 13:10:48,275 INFO L273 TraceCheckUtils]: 16: Hoare triple {2615#true} ~cond := #in~cond; {2621#(= __VERIFIER_assert_~cond |__VERIFIER_assert_#in~cond|)} is VALID [2018-11-23 13:10:48,275 INFO L273 TraceCheckUtils]: 17: Hoare triple {2621#(= __VERIFIER_assert_~cond |__VERIFIER_assert_#in~cond|)} assume !(0 == ~cond); {2622#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2018-11-23 13:10:48,288 INFO L273 TraceCheckUtils]: 18: Hoare triple {2622#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {2622#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2018-11-23 13:10:48,289 INFO L268 TraceCheckUtils]: 19: Hoare quadruple {2622#(not (= |__VERIFIER_assert_#in~cond| 0))} {2620#(<= 3 main_~k~0)} #70#return; {2620#(<= 3 main_~k~0)} is VALID [2018-11-23 13:10:48,290 INFO L273 TraceCheckUtils]: 20: Hoare triple {2620#(<= 3 main_~k~0)} #t~post7 := ~j1~0;~j1~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~k~0;~k~0 := #t~post8 - 1;havoc #t~post8; {2619#(<= 2 main_~k~0)} is VALID [2018-11-23 13:10:48,290 INFO L273 TraceCheckUtils]: 21: Hoare triple {2619#(<= 2 main_~k~0)} assume !!(~j1~0 < ~n0~0 + ~n1~0); {2619#(<= 2 main_~k~0)} is VALID [2018-11-23 13:10:48,290 INFO L256 TraceCheckUtils]: 22: Hoare triple {2619#(<= 2 main_~k~0)} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {2615#true} is VALID [2018-11-23 13:10:48,290 INFO L273 TraceCheckUtils]: 23: Hoare triple {2615#true} ~cond := #in~cond; {2615#true} is VALID [2018-11-23 13:10:48,291 INFO L273 TraceCheckUtils]: 24: Hoare triple {2615#true} assume !(0 == ~cond); {2615#true} is VALID [2018-11-23 13:10:48,291 INFO L273 TraceCheckUtils]: 25: Hoare triple {2615#true} assume true; {2615#true} is VALID [2018-11-23 13:10:48,291 INFO L268 TraceCheckUtils]: 26: Hoare quadruple {2615#true} {2619#(<= 2 main_~k~0)} #70#return; {2619#(<= 2 main_~k~0)} is VALID [2018-11-23 13:10:48,292 INFO L273 TraceCheckUtils]: 27: Hoare triple {2619#(<= 2 main_~k~0)} #t~post7 := ~j1~0;~j1~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~k~0;~k~0 := #t~post8 - 1;havoc #t~post8; {2618#(<= 1 main_~k~0)} is VALID [2018-11-23 13:10:48,293 INFO L273 TraceCheckUtils]: 28: Hoare triple {2618#(<= 1 main_~k~0)} assume !!(~j1~0 < ~n0~0 + ~n1~0); {2618#(<= 1 main_~k~0)} is VALID [2018-11-23 13:10:48,294 INFO L256 TraceCheckUtils]: 29: Hoare triple {2618#(<= 1 main_~k~0)} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {2622#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2018-11-23 13:10:48,295 INFO L273 TraceCheckUtils]: 30: Hoare triple {2622#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {2623#(not (= __VERIFIER_assert_~cond 0))} is VALID [2018-11-23 13:10:48,295 INFO L273 TraceCheckUtils]: 31: Hoare triple {2623#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {2616#false} is VALID [2018-11-23 13:10:48,296 INFO L273 TraceCheckUtils]: 32: Hoare triple {2616#false} assume !false; {2616#false} is VALID [2018-11-23 13:10:48,300 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 9 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 13:10:48,300 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:10:48,301 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:10:48,329 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 13:10:48,354 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 13:10:48,354 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:10:48,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:10:48,367 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:10:48,482 INFO L256 TraceCheckUtils]: 0: Hoare triple {2615#true} call ULTIMATE.init(); {2615#true} is VALID [2018-11-23 13:10:48,483 INFO L273 TraceCheckUtils]: 1: Hoare triple {2615#true} assume true; {2615#true} is VALID [2018-11-23 13:10:48,483 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {2615#true} {2615#true} #66#return; {2615#true} is VALID [2018-11-23 13:10:48,483 INFO L256 TraceCheckUtils]: 3: Hoare triple {2615#true} call #t~ret9 := main(); {2615#true} is VALID [2018-11-23 13:10:48,484 INFO L273 TraceCheckUtils]: 4: Hoare triple {2615#true} havoc ~n0~0;havoc ~n1~0;~i0~0 := 0;~k~0 := 0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n0~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~n1~0 := #t~nondet2;havoc #t~nondet2; {2617#(<= 0 main_~k~0)} is VALID [2018-11-23 13:10:48,484 INFO L273 TraceCheckUtils]: 5: Hoare triple {2617#(<= 0 main_~k~0)} assume !!(-1000000 <= ~n0~0 && ~n0~0 < 1000000); {2617#(<= 0 main_~k~0)} is VALID [2018-11-23 13:10:48,485 INFO L273 TraceCheckUtils]: 6: Hoare triple {2617#(<= 0 main_~k~0)} assume !!(-1000000 <= ~n1~0 && ~n1~0 < 1000000); {2617#(<= 0 main_~k~0)} is VALID [2018-11-23 13:10:48,485 INFO L273 TraceCheckUtils]: 7: Hoare triple {2617#(<= 0 main_~k~0)} assume !(~i0~0 < ~n0~0); {2617#(<= 0 main_~k~0)} is VALID [2018-11-23 13:10:48,486 INFO L273 TraceCheckUtils]: 8: Hoare triple {2617#(<= 0 main_~k~0)} ~i1~0 := 0; {2617#(<= 0 main_~k~0)} is VALID [2018-11-23 13:10:48,487 INFO L273 TraceCheckUtils]: 9: Hoare triple {2617#(<= 0 main_~k~0)} assume !!(~i1~0 < ~n1~0);#t~post5 := ~i1~0;~i1~0 := 1 + #t~post5;havoc #t~post5;#t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {2618#(<= 1 main_~k~0)} is VALID [2018-11-23 13:10:48,488 INFO L273 TraceCheckUtils]: 10: Hoare triple {2618#(<= 1 main_~k~0)} assume !!(~i1~0 < ~n1~0);#t~post5 := ~i1~0;~i1~0 := 1 + #t~post5;havoc #t~post5;#t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {2619#(<= 2 main_~k~0)} is VALID [2018-11-23 13:10:48,488 INFO L273 TraceCheckUtils]: 11: Hoare triple {2619#(<= 2 main_~k~0)} assume !!(~i1~0 < ~n1~0);#t~post5 := ~i1~0;~i1~0 := 1 + #t~post5;havoc #t~post5;#t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {2620#(<= 3 main_~k~0)} is VALID [2018-11-23 13:10:48,489 INFO L273 TraceCheckUtils]: 12: Hoare triple {2620#(<= 3 main_~k~0)} assume !(~i1~0 < ~n1~0); {2620#(<= 3 main_~k~0)} is VALID [2018-11-23 13:10:48,490 INFO L273 TraceCheckUtils]: 13: Hoare triple {2620#(<= 3 main_~k~0)} ~j1~0 := 0; {2620#(<= 3 main_~k~0)} is VALID [2018-11-23 13:10:48,492 INFO L273 TraceCheckUtils]: 14: Hoare triple {2620#(<= 3 main_~k~0)} assume !!(~j1~0 < ~n0~0 + ~n1~0); {2620#(<= 3 main_~k~0)} is VALID [2018-11-23 13:10:48,492 INFO L256 TraceCheckUtils]: 15: Hoare triple {2620#(<= 3 main_~k~0)} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {2615#true} is VALID [2018-11-23 13:10:48,492 INFO L273 TraceCheckUtils]: 16: Hoare triple {2615#true} ~cond := #in~cond; {2615#true} is VALID [2018-11-23 13:10:48,492 INFO L273 TraceCheckUtils]: 17: Hoare triple {2615#true} assume !(0 == ~cond); {2615#true} is VALID [2018-11-23 13:10:48,492 INFO L273 TraceCheckUtils]: 18: Hoare triple {2615#true} assume true; {2615#true} is VALID [2018-11-23 13:10:48,493 INFO L268 TraceCheckUtils]: 19: Hoare quadruple {2615#true} {2620#(<= 3 main_~k~0)} #70#return; {2620#(<= 3 main_~k~0)} is VALID [2018-11-23 13:10:48,493 INFO L273 TraceCheckUtils]: 20: Hoare triple {2620#(<= 3 main_~k~0)} #t~post7 := ~j1~0;~j1~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~k~0;~k~0 := #t~post8 - 1;havoc #t~post8; {2619#(<= 2 main_~k~0)} is VALID [2018-11-23 13:10:48,494 INFO L273 TraceCheckUtils]: 21: Hoare triple {2619#(<= 2 main_~k~0)} assume !!(~j1~0 < ~n0~0 + ~n1~0); {2619#(<= 2 main_~k~0)} is VALID [2018-11-23 13:10:48,494 INFO L256 TraceCheckUtils]: 22: Hoare triple {2619#(<= 2 main_~k~0)} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {2615#true} is VALID [2018-11-23 13:10:48,494 INFO L273 TraceCheckUtils]: 23: Hoare triple {2615#true} ~cond := #in~cond; {2615#true} is VALID [2018-11-23 13:10:48,494 INFO L273 TraceCheckUtils]: 24: Hoare triple {2615#true} assume !(0 == ~cond); {2615#true} is VALID [2018-11-23 13:10:48,494 INFO L273 TraceCheckUtils]: 25: Hoare triple {2615#true} assume true; {2615#true} is VALID [2018-11-23 13:10:48,497 INFO L268 TraceCheckUtils]: 26: Hoare quadruple {2615#true} {2619#(<= 2 main_~k~0)} #70#return; {2619#(<= 2 main_~k~0)} is VALID [2018-11-23 13:10:48,498 INFO L273 TraceCheckUtils]: 27: Hoare triple {2619#(<= 2 main_~k~0)} #t~post7 := ~j1~0;~j1~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~k~0;~k~0 := #t~post8 - 1;havoc #t~post8; {2618#(<= 1 main_~k~0)} is VALID [2018-11-23 13:10:48,498 INFO L273 TraceCheckUtils]: 28: Hoare triple {2618#(<= 1 main_~k~0)} assume !!(~j1~0 < ~n0~0 + ~n1~0); {2618#(<= 1 main_~k~0)} is VALID [2018-11-23 13:10:48,499 INFO L256 TraceCheckUtils]: 29: Hoare triple {2618#(<= 1 main_~k~0)} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {2714#(= |__VERIFIER_assert_#in~cond| 1)} is VALID [2018-11-23 13:10:48,499 INFO L273 TraceCheckUtils]: 30: Hoare triple {2714#(= |__VERIFIER_assert_#in~cond| 1)} ~cond := #in~cond; {2718#(= 1 __VERIFIER_assert_~cond)} is VALID [2018-11-23 13:10:48,500 INFO L273 TraceCheckUtils]: 31: Hoare triple {2718#(= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2616#false} is VALID [2018-11-23 13:10:48,500 INFO L273 TraceCheckUtils]: 32: Hoare triple {2616#false} assume !false; {2616#false} is VALID [2018-11-23 13:10:48,501 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 10 proven. 7 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-23 13:10:48,520 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:10:48,521 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 11 [2018-11-23 13:10:48,521 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 33 [2018-11-23 13:10:48,521 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:10:48,521 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2018-11-23 13:10:48,552 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:10:48,552 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-23 13:10:48,552 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-23 13:10:48,553 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2018-11-23 13:10:48,553 INFO L87 Difference]: Start difference. First operand 42 states and 47 transitions. Second operand 11 states. [2018-11-23 13:10:49,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:10:49,168 INFO L93 Difference]: Finished difference Result 51 states and 56 transitions. [2018-11-23 13:10:49,168 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-23 13:10:49,168 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 33 [2018-11-23 13:10:49,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:10:49,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-23 13:10:49,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 50 transitions. [2018-11-23 13:10:49,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-23 13:10:49,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 50 transitions. [2018-11-23 13:10:49,171 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 50 transitions. [2018-11-23 13:10:49,217 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:10:49,219 INFO L225 Difference]: With dead ends: 51 [2018-11-23 13:10:49,219 INFO L226 Difference]: Without dead ends: 49 [2018-11-23 13:10:49,220 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2018-11-23 13:10:49,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-11-23 13:10:49,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2018-11-23 13:10:49,365 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:10:49,366 INFO L82 GeneralOperation]: Start isEquivalent. First operand 49 states. Second operand 49 states. [2018-11-23 13:10:49,366 INFO L74 IsIncluded]: Start isIncluded. First operand 49 states. Second operand 49 states. [2018-11-23 13:10:49,366 INFO L87 Difference]: Start difference. First operand 49 states. Second operand 49 states. [2018-11-23 13:10:49,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:10:49,369 INFO L93 Difference]: Finished difference Result 49 states and 54 transitions. [2018-11-23 13:10:49,369 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 54 transitions. [2018-11-23 13:10:49,369 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:10:49,370 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:10:49,370 INFO L74 IsIncluded]: Start isIncluded. First operand 49 states. Second operand 49 states. [2018-11-23 13:10:49,370 INFO L87 Difference]: Start difference. First operand 49 states. Second operand 49 states. [2018-11-23 13:10:49,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:10:49,372 INFO L93 Difference]: Finished difference Result 49 states and 54 transitions. [2018-11-23 13:10:49,372 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 54 transitions. [2018-11-23 13:10:49,373 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:10:49,373 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:10:49,373 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:10:49,373 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:10:49,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-11-23 13:10:49,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 54 transitions. [2018-11-23 13:10:49,375 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 54 transitions. Word has length 33 [2018-11-23 13:10:49,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:10:49,375 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 54 transitions. [2018-11-23 13:10:49,375 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-23 13:10:49,375 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 54 transitions. [2018-11-23 13:10:49,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-11-23 13:10:49,376 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:10:49,376 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:10:49,377 INFO L423 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:10:49,377 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:10:49,377 INFO L82 PathProgramCache]: Analyzing trace with hash -322593456, now seen corresponding path program 5 times [2018-11-23 13:10:49,377 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:10:49,377 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:10:49,378 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:10:49,378 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:10:49,378 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:10:49,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:10:49,574 INFO L256 TraceCheckUtils]: 0: Hoare triple {2974#true} call ULTIMATE.init(); {2974#true} is VALID [2018-11-23 13:10:49,574 INFO L273 TraceCheckUtils]: 1: Hoare triple {2974#true} assume true; {2974#true} is VALID [2018-11-23 13:10:49,574 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {2974#true} {2974#true} #66#return; {2974#true} is VALID [2018-11-23 13:10:49,575 INFO L256 TraceCheckUtils]: 3: Hoare triple {2974#true} call #t~ret9 := main(); {2974#true} is VALID [2018-11-23 13:10:49,575 INFO L273 TraceCheckUtils]: 4: Hoare triple {2974#true} havoc ~n0~0;havoc ~n1~0;~i0~0 := 0;~k~0 := 0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n0~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~n1~0 := #t~nondet2;havoc #t~nondet2; {2976#(<= main_~i0~0 0)} is VALID [2018-11-23 13:10:49,576 INFO L273 TraceCheckUtils]: 5: Hoare triple {2976#(<= main_~i0~0 0)} assume !!(-1000000 <= ~n0~0 && ~n0~0 < 1000000); {2976#(<= main_~i0~0 0)} is VALID [2018-11-23 13:10:49,576 INFO L273 TraceCheckUtils]: 6: Hoare triple {2976#(<= main_~i0~0 0)} assume !!(-1000000 <= ~n1~0 && ~n1~0 < 1000000); {2976#(<= main_~i0~0 0)} is VALID [2018-11-23 13:10:49,577 INFO L273 TraceCheckUtils]: 7: Hoare triple {2976#(<= main_~i0~0 0)} assume !(~i0~0 < ~n0~0); {2977#(<= main_~n0~0 0)} is VALID [2018-11-23 13:10:49,577 INFO L273 TraceCheckUtils]: 8: Hoare triple {2977#(<= main_~n0~0 0)} ~i1~0 := 0; {2978#(<= (+ main_~i1~0 main_~n0~0) 0)} is VALID [2018-11-23 13:10:49,578 INFO L273 TraceCheckUtils]: 9: Hoare triple {2978#(<= (+ main_~i1~0 main_~n0~0) 0)} assume !!(~i1~0 < ~n1~0);#t~post5 := ~i1~0;~i1~0 := 1 + #t~post5;havoc #t~post5;#t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {2979#(<= (+ main_~i1~0 main_~n0~0) 1)} is VALID [2018-11-23 13:10:49,578 INFO L273 TraceCheckUtils]: 10: Hoare triple {2979#(<= (+ main_~i1~0 main_~n0~0) 1)} assume !!(~i1~0 < ~n1~0);#t~post5 := ~i1~0;~i1~0 := 1 + #t~post5;havoc #t~post5;#t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {2980#(<= (+ main_~i1~0 main_~n0~0) 2)} is VALID [2018-11-23 13:10:49,579 INFO L273 TraceCheckUtils]: 11: Hoare triple {2980#(<= (+ main_~i1~0 main_~n0~0) 2)} assume !!(~i1~0 < ~n1~0);#t~post5 := ~i1~0;~i1~0 := 1 + #t~post5;havoc #t~post5;#t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {2981#(<= (+ main_~i1~0 main_~n0~0) 3)} is VALID [2018-11-23 13:10:49,579 INFO L273 TraceCheckUtils]: 12: Hoare triple {2981#(<= (+ main_~i1~0 main_~n0~0) 3)} assume !(~i1~0 < ~n1~0); {2982#(<= (+ main_~n0~0 main_~n1~0) 3)} is VALID [2018-11-23 13:10:49,580 INFO L273 TraceCheckUtils]: 13: Hoare triple {2982#(<= (+ main_~n0~0 main_~n1~0) 3)} ~j1~0 := 0; {2983#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 3))} is VALID [2018-11-23 13:10:49,581 INFO L273 TraceCheckUtils]: 14: Hoare triple {2983#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 3))} assume !!(~j1~0 < ~n0~0 + ~n1~0); {2983#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 3))} is VALID [2018-11-23 13:10:49,581 INFO L256 TraceCheckUtils]: 15: Hoare triple {2983#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 3))} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {2974#true} is VALID [2018-11-23 13:10:49,581 INFO L273 TraceCheckUtils]: 16: Hoare triple {2974#true} ~cond := #in~cond; {2974#true} is VALID [2018-11-23 13:10:49,582 INFO L273 TraceCheckUtils]: 17: Hoare triple {2974#true} assume !(0 == ~cond); {2974#true} is VALID [2018-11-23 13:10:49,582 INFO L273 TraceCheckUtils]: 18: Hoare triple {2974#true} assume true; {2974#true} is VALID [2018-11-23 13:10:49,588 INFO L268 TraceCheckUtils]: 19: Hoare quadruple {2974#true} {2983#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 3))} #70#return; {2983#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 3))} is VALID [2018-11-23 13:10:49,588 INFO L273 TraceCheckUtils]: 20: Hoare triple {2983#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 3))} #t~post7 := ~j1~0;~j1~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~k~0;~k~0 := #t~post8 - 1;havoc #t~post8; {2984#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 2))} is VALID [2018-11-23 13:10:49,589 INFO L273 TraceCheckUtils]: 21: Hoare triple {2984#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 2))} assume !!(~j1~0 < ~n0~0 + ~n1~0); {2984#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 2))} is VALID [2018-11-23 13:10:49,589 INFO L256 TraceCheckUtils]: 22: Hoare triple {2984#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 2))} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {2974#true} is VALID [2018-11-23 13:10:49,589 INFO L273 TraceCheckUtils]: 23: Hoare triple {2974#true} ~cond := #in~cond; {2974#true} is VALID [2018-11-23 13:10:49,589 INFO L273 TraceCheckUtils]: 24: Hoare triple {2974#true} assume !(0 == ~cond); {2974#true} is VALID [2018-11-23 13:10:49,589 INFO L273 TraceCheckUtils]: 25: Hoare triple {2974#true} assume true; {2974#true} is VALID [2018-11-23 13:10:49,590 INFO L268 TraceCheckUtils]: 26: Hoare quadruple {2974#true} {2984#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 2))} #70#return; {2984#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 2))} is VALID [2018-11-23 13:10:49,591 INFO L273 TraceCheckUtils]: 27: Hoare triple {2984#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 2))} #t~post7 := ~j1~0;~j1~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~k~0;~k~0 := #t~post8 - 1;havoc #t~post8; {2985#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 1))} is VALID [2018-11-23 13:10:49,591 INFO L273 TraceCheckUtils]: 28: Hoare triple {2985#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 1))} assume !!(~j1~0 < ~n0~0 + ~n1~0); {2985#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 1))} is VALID [2018-11-23 13:10:49,591 INFO L256 TraceCheckUtils]: 29: Hoare triple {2985#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 1))} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {2974#true} is VALID [2018-11-23 13:10:49,592 INFO L273 TraceCheckUtils]: 30: Hoare triple {2974#true} ~cond := #in~cond; {2974#true} is VALID [2018-11-23 13:10:49,592 INFO L273 TraceCheckUtils]: 31: Hoare triple {2974#true} assume !(0 == ~cond); {2974#true} is VALID [2018-11-23 13:10:49,592 INFO L273 TraceCheckUtils]: 32: Hoare triple {2974#true} assume true; {2974#true} is VALID [2018-11-23 13:10:49,597 INFO L268 TraceCheckUtils]: 33: Hoare quadruple {2974#true} {2985#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 1))} #70#return; {2985#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 1))} is VALID [2018-11-23 13:10:49,597 INFO L273 TraceCheckUtils]: 34: Hoare triple {2985#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 1))} #t~post7 := ~j1~0;~j1~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~k~0;~k~0 := #t~post8 - 1;havoc #t~post8; {2986#(<= (+ main_~n0~0 main_~n1~0) main_~j1~0)} is VALID [2018-11-23 13:10:49,598 INFO L273 TraceCheckUtils]: 35: Hoare triple {2986#(<= (+ main_~n0~0 main_~n1~0) main_~j1~0)} assume !!(~j1~0 < ~n0~0 + ~n1~0); {2975#false} is VALID [2018-11-23 13:10:49,598 INFO L256 TraceCheckUtils]: 36: Hoare triple {2975#false} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {2975#false} is VALID [2018-11-23 13:10:49,598 INFO L273 TraceCheckUtils]: 37: Hoare triple {2975#false} ~cond := #in~cond; {2975#false} is VALID [2018-11-23 13:10:49,598 INFO L273 TraceCheckUtils]: 38: Hoare triple {2975#false} assume 0 == ~cond; {2975#false} is VALID [2018-11-23 13:10:49,598 INFO L273 TraceCheckUtils]: 39: Hoare triple {2975#false} assume !false; {2975#false} is VALID [2018-11-23 13:10:49,600 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 21 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-23 13:10:49,600 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:10:49,600 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:10:49,612 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 13:10:49,636 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2018-11-23 13:10:49,636 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:10:49,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:10:49,657 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:10:50,063 INFO L256 TraceCheckUtils]: 0: Hoare triple {2974#true} call ULTIMATE.init(); {2974#true} is VALID [2018-11-23 13:10:50,063 INFO L273 TraceCheckUtils]: 1: Hoare triple {2974#true} assume true; {2974#true} is VALID [2018-11-23 13:10:50,064 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {2974#true} {2974#true} #66#return; {2974#true} is VALID [2018-11-23 13:10:50,064 INFO L256 TraceCheckUtils]: 3: Hoare triple {2974#true} call #t~ret9 := main(); {2974#true} is VALID [2018-11-23 13:10:50,064 INFO L273 TraceCheckUtils]: 4: Hoare triple {2974#true} havoc ~n0~0;havoc ~n1~0;~i0~0 := 0;~k~0 := 0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n0~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~n1~0 := #t~nondet2;havoc #t~nondet2; {2976#(<= main_~i0~0 0)} is VALID [2018-11-23 13:10:50,065 INFO L273 TraceCheckUtils]: 5: Hoare triple {2976#(<= main_~i0~0 0)} assume !!(-1000000 <= ~n0~0 && ~n0~0 < 1000000); {2976#(<= main_~i0~0 0)} is VALID [2018-11-23 13:10:50,065 INFO L273 TraceCheckUtils]: 6: Hoare triple {2976#(<= main_~i0~0 0)} assume !!(-1000000 <= ~n1~0 && ~n1~0 < 1000000); {2976#(<= main_~i0~0 0)} is VALID [2018-11-23 13:10:50,065 INFO L273 TraceCheckUtils]: 7: Hoare triple {2976#(<= main_~i0~0 0)} assume !(~i0~0 < ~n0~0); {2977#(<= main_~n0~0 0)} is VALID [2018-11-23 13:10:50,066 INFO L273 TraceCheckUtils]: 8: Hoare triple {2977#(<= main_~n0~0 0)} ~i1~0 := 0; {3014#(and (<= main_~i1~0 0) (<= main_~n0~0 0))} is VALID [2018-11-23 13:10:50,066 INFO L273 TraceCheckUtils]: 9: Hoare triple {3014#(and (<= main_~i1~0 0) (<= main_~n0~0 0))} assume !!(~i1~0 < ~n1~0);#t~post5 := ~i1~0;~i1~0 := 1 + #t~post5;havoc #t~post5;#t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {3018#(and (<= main_~i1~0 1) (<= main_~n0~0 0))} is VALID [2018-11-23 13:10:50,067 INFO L273 TraceCheckUtils]: 10: Hoare triple {3018#(and (<= main_~i1~0 1) (<= main_~n0~0 0))} assume !!(~i1~0 < ~n1~0);#t~post5 := ~i1~0;~i1~0 := 1 + #t~post5;havoc #t~post5;#t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {3022#(and (<= main_~i1~0 2) (<= main_~n0~0 0))} is VALID [2018-11-23 13:10:50,068 INFO L273 TraceCheckUtils]: 11: Hoare triple {3022#(and (<= main_~i1~0 2) (<= main_~n0~0 0))} assume !!(~i1~0 < ~n1~0);#t~post5 := ~i1~0;~i1~0 := 1 + #t~post5;havoc #t~post5;#t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {3026#(and (<= main_~n0~0 0) (<= main_~i1~0 3))} is VALID [2018-11-23 13:10:50,069 INFO L273 TraceCheckUtils]: 12: Hoare triple {3026#(and (<= main_~n0~0 0) (<= main_~i1~0 3))} assume !(~i1~0 < ~n1~0); {3030#(and (<= main_~n1~0 3) (<= main_~n0~0 0))} is VALID [2018-11-23 13:10:50,069 INFO L273 TraceCheckUtils]: 13: Hoare triple {3030#(and (<= main_~n1~0 3) (<= main_~n0~0 0))} ~j1~0 := 0; {3034#(and (<= main_~n1~0 3) (<= 0 main_~j1~0) (<= main_~n0~0 0))} is VALID [2018-11-23 13:10:50,070 INFO L273 TraceCheckUtils]: 14: Hoare triple {3034#(and (<= main_~n1~0 3) (<= 0 main_~j1~0) (<= main_~n0~0 0))} assume !!(~j1~0 < ~n0~0 + ~n1~0); {3034#(and (<= main_~n1~0 3) (<= 0 main_~j1~0) (<= main_~n0~0 0))} is VALID [2018-11-23 13:10:50,070 INFO L256 TraceCheckUtils]: 15: Hoare triple {3034#(and (<= main_~n1~0 3) (<= 0 main_~j1~0) (<= main_~n0~0 0))} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {2974#true} is VALID [2018-11-23 13:10:50,071 INFO L273 TraceCheckUtils]: 16: Hoare triple {2974#true} ~cond := #in~cond; {2974#true} is VALID [2018-11-23 13:10:50,071 INFO L273 TraceCheckUtils]: 17: Hoare triple {2974#true} assume !(0 == ~cond); {2974#true} is VALID [2018-11-23 13:10:50,071 INFO L273 TraceCheckUtils]: 18: Hoare triple {2974#true} assume true; {2974#true} is VALID [2018-11-23 13:10:50,072 INFO L268 TraceCheckUtils]: 19: Hoare quadruple {2974#true} {3034#(and (<= main_~n1~0 3) (<= 0 main_~j1~0) (<= main_~n0~0 0))} #70#return; {3034#(and (<= main_~n1~0 3) (<= 0 main_~j1~0) (<= main_~n0~0 0))} is VALID [2018-11-23 13:10:50,073 INFO L273 TraceCheckUtils]: 20: Hoare triple {3034#(and (<= main_~n1~0 3) (<= 0 main_~j1~0) (<= main_~n0~0 0))} #t~post7 := ~j1~0;~j1~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~k~0;~k~0 := #t~post8 - 1;havoc #t~post8; {3056#(and (<= 1 main_~j1~0) (<= main_~n1~0 3) (<= main_~n0~0 0))} is VALID [2018-11-23 13:10:50,074 INFO L273 TraceCheckUtils]: 21: Hoare triple {3056#(and (<= 1 main_~j1~0) (<= main_~n1~0 3) (<= main_~n0~0 0))} assume !!(~j1~0 < ~n0~0 + ~n1~0); {3056#(and (<= 1 main_~j1~0) (<= main_~n1~0 3) (<= main_~n0~0 0))} is VALID [2018-11-23 13:10:50,074 INFO L256 TraceCheckUtils]: 22: Hoare triple {3056#(and (<= 1 main_~j1~0) (<= main_~n1~0 3) (<= main_~n0~0 0))} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {2974#true} is VALID [2018-11-23 13:10:50,074 INFO L273 TraceCheckUtils]: 23: Hoare triple {2974#true} ~cond := #in~cond; {2974#true} is VALID [2018-11-23 13:10:50,074 INFO L273 TraceCheckUtils]: 24: Hoare triple {2974#true} assume !(0 == ~cond); {2974#true} is VALID [2018-11-23 13:10:50,074 INFO L273 TraceCheckUtils]: 25: Hoare triple {2974#true} assume true; {2974#true} is VALID [2018-11-23 13:10:50,075 INFO L268 TraceCheckUtils]: 26: Hoare quadruple {2974#true} {3056#(and (<= 1 main_~j1~0) (<= main_~n1~0 3) (<= main_~n0~0 0))} #70#return; {3056#(and (<= 1 main_~j1~0) (<= main_~n1~0 3) (<= main_~n0~0 0))} is VALID [2018-11-23 13:10:50,076 INFO L273 TraceCheckUtils]: 27: Hoare triple {3056#(and (<= 1 main_~j1~0) (<= main_~n1~0 3) (<= main_~n0~0 0))} #t~post7 := ~j1~0;~j1~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~k~0;~k~0 := #t~post8 - 1;havoc #t~post8; {3078#(and (<= main_~n1~0 3) (<= main_~n0~0 0) (<= 2 main_~j1~0))} is VALID [2018-11-23 13:10:50,077 INFO L273 TraceCheckUtils]: 28: Hoare triple {3078#(and (<= main_~n1~0 3) (<= main_~n0~0 0) (<= 2 main_~j1~0))} assume !!(~j1~0 < ~n0~0 + ~n1~0); {3078#(and (<= main_~n1~0 3) (<= main_~n0~0 0) (<= 2 main_~j1~0))} is VALID [2018-11-23 13:10:50,077 INFO L256 TraceCheckUtils]: 29: Hoare triple {3078#(and (<= main_~n1~0 3) (<= main_~n0~0 0) (<= 2 main_~j1~0))} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {2974#true} is VALID [2018-11-23 13:10:50,077 INFO L273 TraceCheckUtils]: 30: Hoare triple {2974#true} ~cond := #in~cond; {2974#true} is VALID [2018-11-23 13:10:50,077 INFO L273 TraceCheckUtils]: 31: Hoare triple {2974#true} assume !(0 == ~cond); {2974#true} is VALID [2018-11-23 13:10:50,077 INFO L273 TraceCheckUtils]: 32: Hoare triple {2974#true} assume true; {2974#true} is VALID [2018-11-23 13:10:50,078 INFO L268 TraceCheckUtils]: 33: Hoare quadruple {2974#true} {3078#(and (<= main_~n1~0 3) (<= main_~n0~0 0) (<= 2 main_~j1~0))} #70#return; {3078#(and (<= main_~n1~0 3) (<= main_~n0~0 0) (<= 2 main_~j1~0))} is VALID [2018-11-23 13:10:50,078 INFO L273 TraceCheckUtils]: 34: Hoare triple {3078#(and (<= main_~n1~0 3) (<= main_~n0~0 0) (<= 2 main_~j1~0))} #t~post7 := ~j1~0;~j1~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~k~0;~k~0 := #t~post8 - 1;havoc #t~post8; {3100#(and (<= main_~n1~0 3) (<= 3 main_~j1~0) (<= main_~n0~0 0))} is VALID [2018-11-23 13:10:50,095 INFO L273 TraceCheckUtils]: 35: Hoare triple {3100#(and (<= main_~n1~0 3) (<= 3 main_~j1~0) (<= main_~n0~0 0))} assume !!(~j1~0 < ~n0~0 + ~n1~0); {2975#false} is VALID [2018-11-23 13:10:50,095 INFO L256 TraceCheckUtils]: 36: Hoare triple {2975#false} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {2975#false} is VALID [2018-11-23 13:10:50,095 INFO L273 TraceCheckUtils]: 37: Hoare triple {2975#false} ~cond := #in~cond; {2975#false} is VALID [2018-11-23 13:10:50,095 INFO L273 TraceCheckUtils]: 38: Hoare triple {2975#false} assume 0 == ~cond; {2975#false} is VALID [2018-11-23 13:10:50,096 INFO L273 TraceCheckUtils]: 39: Hoare triple {2975#false} assume !false; {2975#false} is VALID [2018-11-23 13:10:50,097 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 21 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-23 13:10:50,116 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:10:50,116 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 22 [2018-11-23 13:10:50,117 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 40 [2018-11-23 13:10:50,117 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:10:50,117 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 22 states. [2018-11-23 13:10:50,162 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:10:50,163 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-11-23 13:10:50,163 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-11-23 13:10:50,164 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=359, Unknown=0, NotChecked=0, Total=462 [2018-11-23 13:10:50,164 INFO L87 Difference]: Start difference. First operand 49 states and 54 transitions. Second operand 22 states. [2018-11-23 13:10:51,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:10:51,221 INFO L93 Difference]: Finished difference Result 85 states and 99 transitions. [2018-11-23 13:10:51,222 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-23 13:10:51,222 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 40 [2018-11-23 13:10:51,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:10:51,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-23 13:10:51,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 60 transitions. [2018-11-23 13:10:51,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-23 13:10:51,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 60 transitions. [2018-11-23 13:10:51,226 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states and 60 transitions. [2018-11-23 13:10:51,319 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 60 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:10:51,320 INFO L225 Difference]: With dead ends: 85 [2018-11-23 13:10:51,321 INFO L226 Difference]: Without dead ends: 65 [2018-11-23 13:10:51,322 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 209 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=233, Invalid=759, Unknown=0, NotChecked=0, Total=992 [2018-11-23 13:10:51,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-11-23 13:10:51,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 50. [2018-11-23 13:10:51,522 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:10:51,523 INFO L82 GeneralOperation]: Start isEquivalent. First operand 65 states. Second operand 50 states. [2018-11-23 13:10:51,523 INFO L74 IsIncluded]: Start isIncluded. First operand 65 states. Second operand 50 states. [2018-11-23 13:10:51,523 INFO L87 Difference]: Start difference. First operand 65 states. Second operand 50 states. [2018-11-23 13:10:51,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:10:51,525 INFO L93 Difference]: Finished difference Result 65 states and 75 transitions. [2018-11-23 13:10:51,525 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 75 transitions. [2018-11-23 13:10:51,525 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:10:51,525 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:10:51,525 INFO L74 IsIncluded]: Start isIncluded. First operand 50 states. Second operand 65 states. [2018-11-23 13:10:51,525 INFO L87 Difference]: Start difference. First operand 50 states. Second operand 65 states. [2018-11-23 13:10:51,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:10:51,527 INFO L93 Difference]: Finished difference Result 65 states and 75 transitions. [2018-11-23 13:10:51,527 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 75 transitions. [2018-11-23 13:10:51,528 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:10:51,528 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:10:51,528 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:10:51,528 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:10:51,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-11-23 13:10:51,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 55 transitions. [2018-11-23 13:10:51,529 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 55 transitions. Word has length 40 [2018-11-23 13:10:51,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:10:51,530 INFO L480 AbstractCegarLoop]: Abstraction has 50 states and 55 transitions. [2018-11-23 13:10:51,530 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-11-23 13:10:51,530 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 55 transitions. [2018-11-23 13:10:51,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-11-23 13:10:51,530 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:10:51,531 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:10:51,531 INFO L423 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:10:51,531 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:10:51,531 INFO L82 PathProgramCache]: Analyzing trace with hash -81490993, now seen corresponding path program 2 times [2018-11-23 13:10:51,531 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:10:51,531 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:10:51,532 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:10:51,532 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:10:51,532 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:10:51,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:10:51,700 INFO L256 TraceCheckUtils]: 0: Hoare triple {3471#true} call ULTIMATE.init(); {3471#true} is VALID [2018-11-23 13:10:51,700 INFO L273 TraceCheckUtils]: 1: Hoare triple {3471#true} assume true; {3471#true} is VALID [2018-11-23 13:10:51,701 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {3471#true} {3471#true} #66#return; {3471#true} is VALID [2018-11-23 13:10:51,701 INFO L256 TraceCheckUtils]: 3: Hoare triple {3471#true} call #t~ret9 := main(); {3471#true} is VALID [2018-11-23 13:10:51,702 INFO L273 TraceCheckUtils]: 4: Hoare triple {3471#true} havoc ~n0~0;havoc ~n1~0;~i0~0 := 0;~k~0 := 0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n0~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~n1~0 := #t~nondet2;havoc #t~nondet2; {3473#(<= main_~i0~0 0)} is VALID [2018-11-23 13:10:51,702 INFO L273 TraceCheckUtils]: 5: Hoare triple {3473#(<= main_~i0~0 0)} assume !!(-1000000 <= ~n0~0 && ~n0~0 < 1000000); {3473#(<= main_~i0~0 0)} is VALID [2018-11-23 13:10:51,703 INFO L273 TraceCheckUtils]: 6: Hoare triple {3473#(<= main_~i0~0 0)} assume !!(-1000000 <= ~n1~0 && ~n1~0 < 1000000); {3473#(<= main_~i0~0 0)} is VALID [2018-11-23 13:10:51,704 INFO L273 TraceCheckUtils]: 7: Hoare triple {3473#(<= main_~i0~0 0)} assume !!(~i0~0 < ~n0~0);#t~post3 := ~i0~0;~i0~0 := 1 + #t~post3;havoc #t~post3;#t~post4 := ~k~0;~k~0 := 1 + #t~post4;havoc #t~post4; {3474#(<= main_~i0~0 1)} is VALID [2018-11-23 13:10:51,704 INFO L273 TraceCheckUtils]: 8: Hoare triple {3474#(<= main_~i0~0 1)} assume !(~i0~0 < ~n0~0); {3475#(<= main_~n0~0 1)} is VALID [2018-11-23 13:10:51,705 INFO L273 TraceCheckUtils]: 9: Hoare triple {3475#(<= main_~n0~0 1)} ~i1~0 := 0; {3476#(<= (+ main_~i1~0 main_~n0~0) 1)} is VALID [2018-11-23 13:10:51,705 INFO L273 TraceCheckUtils]: 10: Hoare triple {3476#(<= (+ main_~i1~0 main_~n0~0) 1)} assume !!(~i1~0 < ~n1~0);#t~post5 := ~i1~0;~i1~0 := 1 + #t~post5;havoc #t~post5;#t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {3477#(<= (+ main_~i1~0 main_~n0~0) 2)} is VALID [2018-11-23 13:10:51,706 INFO L273 TraceCheckUtils]: 11: Hoare triple {3477#(<= (+ main_~i1~0 main_~n0~0) 2)} assume !!(~i1~0 < ~n1~0);#t~post5 := ~i1~0;~i1~0 := 1 + #t~post5;havoc #t~post5;#t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {3478#(<= (+ main_~i1~0 main_~n0~0) 3)} is VALID [2018-11-23 13:10:51,707 INFO L273 TraceCheckUtils]: 12: Hoare triple {3478#(<= (+ main_~i1~0 main_~n0~0) 3)} assume !(~i1~0 < ~n1~0); {3479#(<= (+ main_~n0~0 main_~n1~0) 3)} is VALID [2018-11-23 13:10:51,707 INFO L273 TraceCheckUtils]: 13: Hoare triple {3479#(<= (+ main_~n0~0 main_~n1~0) 3)} ~j1~0 := 0; {3480#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 3))} is VALID [2018-11-23 13:10:51,708 INFO L273 TraceCheckUtils]: 14: Hoare triple {3480#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 3))} assume !!(~j1~0 < ~n0~0 + ~n1~0); {3480#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 3))} is VALID [2018-11-23 13:10:51,708 INFO L256 TraceCheckUtils]: 15: Hoare triple {3480#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 3))} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {3471#true} is VALID [2018-11-23 13:10:51,708 INFO L273 TraceCheckUtils]: 16: Hoare triple {3471#true} ~cond := #in~cond; {3471#true} is VALID [2018-11-23 13:10:51,709 INFO L273 TraceCheckUtils]: 17: Hoare triple {3471#true} assume !(0 == ~cond); {3471#true} is VALID [2018-11-23 13:10:51,709 INFO L273 TraceCheckUtils]: 18: Hoare triple {3471#true} assume true; {3471#true} is VALID [2018-11-23 13:10:51,710 INFO L268 TraceCheckUtils]: 19: Hoare quadruple {3471#true} {3480#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 3))} #70#return; {3480#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 3))} is VALID [2018-11-23 13:10:51,711 INFO L273 TraceCheckUtils]: 20: Hoare triple {3480#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 3))} #t~post7 := ~j1~0;~j1~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~k~0;~k~0 := #t~post8 - 1;havoc #t~post8; {3481#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 2))} is VALID [2018-11-23 13:10:51,711 INFO L273 TraceCheckUtils]: 21: Hoare triple {3481#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 2))} assume !!(~j1~0 < ~n0~0 + ~n1~0); {3481#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 2))} is VALID [2018-11-23 13:10:51,712 INFO L256 TraceCheckUtils]: 22: Hoare triple {3481#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 2))} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {3471#true} is VALID [2018-11-23 13:10:51,712 INFO L273 TraceCheckUtils]: 23: Hoare triple {3471#true} ~cond := #in~cond; {3471#true} is VALID [2018-11-23 13:10:51,712 INFO L273 TraceCheckUtils]: 24: Hoare triple {3471#true} assume !(0 == ~cond); {3471#true} is VALID [2018-11-23 13:10:51,712 INFO L273 TraceCheckUtils]: 25: Hoare triple {3471#true} assume true; {3471#true} is VALID [2018-11-23 13:10:51,713 INFO L268 TraceCheckUtils]: 26: Hoare quadruple {3471#true} {3481#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 2))} #70#return; {3481#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 2))} is VALID [2018-11-23 13:10:51,714 INFO L273 TraceCheckUtils]: 27: Hoare triple {3481#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 2))} #t~post7 := ~j1~0;~j1~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~k~0;~k~0 := #t~post8 - 1;havoc #t~post8; {3482#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 1))} is VALID [2018-11-23 13:10:51,714 INFO L273 TraceCheckUtils]: 28: Hoare triple {3482#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 1))} assume !!(~j1~0 < ~n0~0 + ~n1~0); {3482#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 1))} is VALID [2018-11-23 13:10:51,714 INFO L256 TraceCheckUtils]: 29: Hoare triple {3482#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 1))} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {3471#true} is VALID [2018-11-23 13:10:51,715 INFO L273 TraceCheckUtils]: 30: Hoare triple {3471#true} ~cond := #in~cond; {3471#true} is VALID [2018-11-23 13:10:51,715 INFO L273 TraceCheckUtils]: 31: Hoare triple {3471#true} assume !(0 == ~cond); {3471#true} is VALID [2018-11-23 13:10:51,715 INFO L273 TraceCheckUtils]: 32: Hoare triple {3471#true} assume true; {3471#true} is VALID [2018-11-23 13:10:51,715 INFO L268 TraceCheckUtils]: 33: Hoare quadruple {3471#true} {3482#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 1))} #70#return; {3482#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 1))} is VALID [2018-11-23 13:10:51,716 INFO L273 TraceCheckUtils]: 34: Hoare triple {3482#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 1))} #t~post7 := ~j1~0;~j1~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~k~0;~k~0 := #t~post8 - 1;havoc #t~post8; {3483#(<= (+ main_~n0~0 main_~n1~0) main_~j1~0)} is VALID [2018-11-23 13:10:51,717 INFO L273 TraceCheckUtils]: 35: Hoare triple {3483#(<= (+ main_~n0~0 main_~n1~0) main_~j1~0)} assume !!(~j1~0 < ~n0~0 + ~n1~0); {3472#false} is VALID [2018-11-23 13:10:51,717 INFO L256 TraceCheckUtils]: 36: Hoare triple {3472#false} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {3472#false} is VALID [2018-11-23 13:10:51,717 INFO L273 TraceCheckUtils]: 37: Hoare triple {3472#false} ~cond := #in~cond; {3472#false} is VALID [2018-11-23 13:10:51,717 INFO L273 TraceCheckUtils]: 38: Hoare triple {3472#false} assume 0 == ~cond; {3472#false} is VALID [2018-11-23 13:10:51,718 INFO L273 TraceCheckUtils]: 39: Hoare triple {3472#false} assume !false; {3472#false} is VALID [2018-11-23 13:10:51,720 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 21 proven. 4 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-23 13:10:51,720 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:10:51,720 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:10:51,730 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 13:10:51,745 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 13:10:51,746 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:10:51,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:10:51,761 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:10:52,026 INFO L256 TraceCheckUtils]: 0: Hoare triple {3471#true} call ULTIMATE.init(); {3471#true} is VALID [2018-11-23 13:10:52,027 INFO L273 TraceCheckUtils]: 1: Hoare triple {3471#true} assume true; {3471#true} is VALID [2018-11-23 13:10:52,027 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {3471#true} {3471#true} #66#return; {3471#true} is VALID [2018-11-23 13:10:52,027 INFO L256 TraceCheckUtils]: 3: Hoare triple {3471#true} call #t~ret9 := main(); {3471#true} is VALID [2018-11-23 13:10:52,027 INFO L273 TraceCheckUtils]: 4: Hoare triple {3471#true} havoc ~n0~0;havoc ~n1~0;~i0~0 := 0;~k~0 := 0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n0~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~n1~0 := #t~nondet2;havoc #t~nondet2; {3473#(<= main_~i0~0 0)} is VALID [2018-11-23 13:10:52,028 INFO L273 TraceCheckUtils]: 5: Hoare triple {3473#(<= main_~i0~0 0)} assume !!(-1000000 <= ~n0~0 && ~n0~0 < 1000000); {3473#(<= main_~i0~0 0)} is VALID [2018-11-23 13:10:52,028 INFO L273 TraceCheckUtils]: 6: Hoare triple {3473#(<= main_~i0~0 0)} assume !!(-1000000 <= ~n1~0 && ~n1~0 < 1000000); {3473#(<= main_~i0~0 0)} is VALID [2018-11-23 13:10:52,029 INFO L273 TraceCheckUtils]: 7: Hoare triple {3473#(<= main_~i0~0 0)} assume !!(~i0~0 < ~n0~0);#t~post3 := ~i0~0;~i0~0 := 1 + #t~post3;havoc #t~post3;#t~post4 := ~k~0;~k~0 := 1 + #t~post4;havoc #t~post4; {3474#(<= main_~i0~0 1)} is VALID [2018-11-23 13:10:52,029 INFO L273 TraceCheckUtils]: 8: Hoare triple {3474#(<= main_~i0~0 1)} assume !(~i0~0 < ~n0~0); {3475#(<= main_~n0~0 1)} is VALID [2018-11-23 13:10:52,029 INFO L273 TraceCheckUtils]: 9: Hoare triple {3475#(<= main_~n0~0 1)} ~i1~0 := 0; {3514#(and (<= main_~i1~0 0) (<= main_~n0~0 1))} is VALID [2018-11-23 13:10:52,030 INFO L273 TraceCheckUtils]: 10: Hoare triple {3514#(and (<= main_~i1~0 0) (<= main_~n0~0 1))} assume !!(~i1~0 < ~n1~0);#t~post5 := ~i1~0;~i1~0 := 1 + #t~post5;havoc #t~post5;#t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {3518#(and (<= main_~i1~0 1) (<= main_~n0~0 1))} is VALID [2018-11-23 13:10:52,031 INFO L273 TraceCheckUtils]: 11: Hoare triple {3518#(and (<= main_~i1~0 1) (<= main_~n0~0 1))} assume !!(~i1~0 < ~n1~0);#t~post5 := ~i1~0;~i1~0 := 1 + #t~post5;havoc #t~post5;#t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {3522#(and (<= main_~i1~0 2) (<= main_~n0~0 1))} is VALID [2018-11-23 13:10:52,031 INFO L273 TraceCheckUtils]: 12: Hoare triple {3522#(and (<= main_~i1~0 2) (<= main_~n0~0 1))} assume !(~i1~0 < ~n1~0); {3526#(and (<= main_~n1~0 2) (<= main_~n0~0 1))} is VALID [2018-11-23 13:10:52,032 INFO L273 TraceCheckUtils]: 13: Hoare triple {3526#(and (<= main_~n1~0 2) (<= main_~n0~0 1))} ~j1~0 := 0; {3530#(and (<= main_~n1~0 2) (<= 0 main_~j1~0) (<= main_~n0~0 1))} is VALID [2018-11-23 13:10:52,033 INFO L273 TraceCheckUtils]: 14: Hoare triple {3530#(and (<= main_~n1~0 2) (<= 0 main_~j1~0) (<= main_~n0~0 1))} assume !!(~j1~0 < ~n0~0 + ~n1~0); {3530#(and (<= main_~n1~0 2) (<= 0 main_~j1~0) (<= main_~n0~0 1))} is VALID [2018-11-23 13:10:52,033 INFO L256 TraceCheckUtils]: 15: Hoare triple {3530#(and (<= main_~n1~0 2) (<= 0 main_~j1~0) (<= main_~n0~0 1))} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {3471#true} is VALID [2018-11-23 13:10:52,033 INFO L273 TraceCheckUtils]: 16: Hoare triple {3471#true} ~cond := #in~cond; {3471#true} is VALID [2018-11-23 13:10:52,034 INFO L273 TraceCheckUtils]: 17: Hoare triple {3471#true} assume !(0 == ~cond); {3471#true} is VALID [2018-11-23 13:10:52,034 INFO L273 TraceCheckUtils]: 18: Hoare triple {3471#true} assume true; {3471#true} is VALID [2018-11-23 13:10:52,035 INFO L268 TraceCheckUtils]: 19: Hoare quadruple {3471#true} {3530#(and (<= main_~n1~0 2) (<= 0 main_~j1~0) (<= main_~n0~0 1))} #70#return; {3530#(and (<= main_~n1~0 2) (<= 0 main_~j1~0) (<= main_~n0~0 1))} is VALID [2018-11-23 13:10:52,036 INFO L273 TraceCheckUtils]: 20: Hoare triple {3530#(and (<= main_~n1~0 2) (<= 0 main_~j1~0) (<= main_~n0~0 1))} #t~post7 := ~j1~0;~j1~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~k~0;~k~0 := #t~post8 - 1;havoc #t~post8; {3552#(and (<= 1 main_~j1~0) (<= main_~n1~0 2) (<= main_~n0~0 1))} is VALID [2018-11-23 13:10:52,039 INFO L273 TraceCheckUtils]: 21: Hoare triple {3552#(and (<= 1 main_~j1~0) (<= main_~n1~0 2) (<= main_~n0~0 1))} assume !!(~j1~0 < ~n0~0 + ~n1~0); {3552#(and (<= 1 main_~j1~0) (<= main_~n1~0 2) (<= main_~n0~0 1))} is VALID [2018-11-23 13:10:52,039 INFO L256 TraceCheckUtils]: 22: Hoare triple {3552#(and (<= 1 main_~j1~0) (<= main_~n1~0 2) (<= main_~n0~0 1))} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {3471#true} is VALID [2018-11-23 13:10:52,039 INFO L273 TraceCheckUtils]: 23: Hoare triple {3471#true} ~cond := #in~cond; {3471#true} is VALID [2018-11-23 13:10:52,039 INFO L273 TraceCheckUtils]: 24: Hoare triple {3471#true} assume !(0 == ~cond); {3471#true} is VALID [2018-11-23 13:10:52,040 INFO L273 TraceCheckUtils]: 25: Hoare triple {3471#true} assume true; {3471#true} is VALID [2018-11-23 13:10:52,040 INFO L268 TraceCheckUtils]: 26: Hoare quadruple {3471#true} {3552#(and (<= 1 main_~j1~0) (<= main_~n1~0 2) (<= main_~n0~0 1))} #70#return; {3552#(and (<= 1 main_~j1~0) (<= main_~n1~0 2) (<= main_~n0~0 1))} is VALID [2018-11-23 13:10:52,041 INFO L273 TraceCheckUtils]: 27: Hoare triple {3552#(and (<= 1 main_~j1~0) (<= main_~n1~0 2) (<= main_~n0~0 1))} #t~post7 := ~j1~0;~j1~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~k~0;~k~0 := #t~post8 - 1;havoc #t~post8; {3574#(and (<= main_~n1~0 2) (<= main_~n0~0 1) (<= 2 main_~j1~0))} is VALID [2018-11-23 13:10:52,041 INFO L273 TraceCheckUtils]: 28: Hoare triple {3574#(and (<= main_~n1~0 2) (<= main_~n0~0 1) (<= 2 main_~j1~0))} assume !!(~j1~0 < ~n0~0 + ~n1~0); {3574#(and (<= main_~n1~0 2) (<= main_~n0~0 1) (<= 2 main_~j1~0))} is VALID [2018-11-23 13:10:52,042 INFO L256 TraceCheckUtils]: 29: Hoare triple {3574#(and (<= main_~n1~0 2) (<= main_~n0~0 1) (<= 2 main_~j1~0))} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {3471#true} is VALID [2018-11-23 13:10:52,042 INFO L273 TraceCheckUtils]: 30: Hoare triple {3471#true} ~cond := #in~cond; {3471#true} is VALID [2018-11-23 13:10:52,042 INFO L273 TraceCheckUtils]: 31: Hoare triple {3471#true} assume !(0 == ~cond); {3471#true} is VALID [2018-11-23 13:10:52,042 INFO L273 TraceCheckUtils]: 32: Hoare triple {3471#true} assume true; {3471#true} is VALID [2018-11-23 13:10:52,043 INFO L268 TraceCheckUtils]: 33: Hoare quadruple {3471#true} {3574#(and (<= main_~n1~0 2) (<= main_~n0~0 1) (<= 2 main_~j1~0))} #70#return; {3574#(and (<= main_~n1~0 2) (<= main_~n0~0 1) (<= 2 main_~j1~0))} is VALID [2018-11-23 13:10:52,043 INFO L273 TraceCheckUtils]: 34: Hoare triple {3574#(and (<= main_~n1~0 2) (<= main_~n0~0 1) (<= 2 main_~j1~0))} #t~post7 := ~j1~0;~j1~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~k~0;~k~0 := #t~post8 - 1;havoc #t~post8; {3596#(and (<= main_~n1~0 2) (<= 3 main_~j1~0) (<= main_~n0~0 1))} is VALID [2018-11-23 13:10:52,044 INFO L273 TraceCheckUtils]: 35: Hoare triple {3596#(and (<= main_~n1~0 2) (<= 3 main_~j1~0) (<= main_~n0~0 1))} assume !!(~j1~0 < ~n0~0 + ~n1~0); {3472#false} is VALID [2018-11-23 13:10:52,044 INFO L256 TraceCheckUtils]: 36: Hoare triple {3472#false} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {3472#false} is VALID [2018-11-23 13:10:52,044 INFO L273 TraceCheckUtils]: 37: Hoare triple {3472#false} ~cond := #in~cond; {3472#false} is VALID [2018-11-23 13:10:52,044 INFO L273 TraceCheckUtils]: 38: Hoare triple {3472#false} assume 0 == ~cond; {3472#false} is VALID [2018-11-23 13:10:52,045 INFO L273 TraceCheckUtils]: 39: Hoare triple {3472#false} assume !false; {3472#false} is VALID [2018-11-23 13:10:52,047 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 21 proven. 4 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-23 13:10:52,066 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:10:52,066 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 21 [2018-11-23 13:10:52,067 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 40 [2018-11-23 13:10:52,067 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:10:52,067 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 21 states. [2018-11-23 13:10:52,116 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-23 13:10:52,117 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-11-23 13:10:52,117 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-11-23 13:10:52,117 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=329, Unknown=0, NotChecked=0, Total=420 [2018-11-23 13:10:52,118 INFO L87 Difference]: Start difference. First operand 50 states and 55 transitions. Second operand 21 states. [2018-11-23 13:10:53,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:10:53,201 INFO L93 Difference]: Finished difference Result 100 states and 119 transitions. [2018-11-23 13:10:53,201 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-23 13:10:53,201 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 40 [2018-11-23 13:10:53,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:10:53,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-23 13:10:53,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 72 transitions. [2018-11-23 13:10:53,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-23 13:10:53,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 72 transitions. [2018-11-23 13:10:53,205 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states and 72 transitions. [2018-11-23 13:10:53,288 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 72 edges. 72 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:10:53,291 INFO L225 Difference]: With dead ends: 100 [2018-11-23 13:10:53,291 INFO L226 Difference]: Without dead ends: 80 [2018-11-23 13:10:53,292 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 244 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=253, Invalid=869, Unknown=0, NotChecked=0, Total=1122 [2018-11-23 13:10:53,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-11-23 13:10:53,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 50. [2018-11-23 13:10:53,410 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:10:53,410 INFO L82 GeneralOperation]: Start isEquivalent. First operand 80 states. Second operand 50 states. [2018-11-23 13:10:53,410 INFO L74 IsIncluded]: Start isIncluded. First operand 80 states. Second operand 50 states. [2018-11-23 13:10:53,410 INFO L87 Difference]: Start difference. First operand 80 states. Second operand 50 states. [2018-11-23 13:10:53,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:10:53,413 INFO L93 Difference]: Finished difference Result 80 states and 95 transitions. [2018-11-23 13:10:53,413 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 95 transitions. [2018-11-23 13:10:53,414 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:10:53,414 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:10:53,414 INFO L74 IsIncluded]: Start isIncluded. First operand 50 states. Second operand 80 states. [2018-11-23 13:10:53,414 INFO L87 Difference]: Start difference. First operand 50 states. Second operand 80 states. [2018-11-23 13:10:53,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:10:53,417 INFO L93 Difference]: Finished difference Result 80 states and 95 transitions. [2018-11-23 13:10:53,417 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 95 transitions. [2018-11-23 13:10:53,417 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:10:53,417 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:10:53,417 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:10:53,418 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:10:53,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-11-23 13:10:53,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 55 transitions. [2018-11-23 13:10:53,419 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 55 transitions. Word has length 40 [2018-11-23 13:10:53,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:10:53,419 INFO L480 AbstractCegarLoop]: Abstraction has 50 states and 55 transitions. [2018-11-23 13:10:53,419 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-11-23 13:10:53,419 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 55 transitions. [2018-11-23 13:10:53,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-11-23 13:10:53,420 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:10:53,420 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:10:53,420 INFO L423 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:10:53,420 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:10:53,420 INFO L82 PathProgramCache]: Analyzing trace with hash -2013376144, now seen corresponding path program 3 times [2018-11-23 13:10:53,420 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:10:53,421 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:10:53,421 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:10:53,421 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:10:53,422 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:10:53,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:10:53,778 INFO L256 TraceCheckUtils]: 0: Hoare triple {4029#true} call ULTIMATE.init(); {4029#true} is VALID [2018-11-23 13:10:53,779 INFO L273 TraceCheckUtils]: 1: Hoare triple {4029#true} assume true; {4029#true} is VALID [2018-11-23 13:10:53,779 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {4029#true} {4029#true} #66#return; {4029#true} is VALID [2018-11-23 13:10:53,779 INFO L256 TraceCheckUtils]: 3: Hoare triple {4029#true} call #t~ret9 := main(); {4029#true} is VALID [2018-11-23 13:10:53,780 INFO L273 TraceCheckUtils]: 4: Hoare triple {4029#true} havoc ~n0~0;havoc ~n1~0;~i0~0 := 0;~k~0 := 0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n0~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~n1~0 := #t~nondet2;havoc #t~nondet2; {4031#(<= main_~i0~0 0)} is VALID [2018-11-23 13:10:53,781 INFO L273 TraceCheckUtils]: 5: Hoare triple {4031#(<= main_~i0~0 0)} assume !!(-1000000 <= ~n0~0 && ~n0~0 < 1000000); {4031#(<= main_~i0~0 0)} is VALID [2018-11-23 13:10:53,781 INFO L273 TraceCheckUtils]: 6: Hoare triple {4031#(<= main_~i0~0 0)} assume !!(-1000000 <= ~n1~0 && ~n1~0 < 1000000); {4031#(<= main_~i0~0 0)} is VALID [2018-11-23 13:10:53,782 INFO L273 TraceCheckUtils]: 7: Hoare triple {4031#(<= main_~i0~0 0)} assume !!(~i0~0 < ~n0~0);#t~post3 := ~i0~0;~i0~0 := 1 + #t~post3;havoc #t~post3;#t~post4 := ~k~0;~k~0 := 1 + #t~post4;havoc #t~post4; {4032#(<= main_~i0~0 1)} is VALID [2018-11-23 13:10:53,783 INFO L273 TraceCheckUtils]: 8: Hoare triple {4032#(<= main_~i0~0 1)} assume !!(~i0~0 < ~n0~0);#t~post3 := ~i0~0;~i0~0 := 1 + #t~post3;havoc #t~post3;#t~post4 := ~k~0;~k~0 := 1 + #t~post4;havoc #t~post4; {4033#(<= main_~i0~0 2)} is VALID [2018-11-23 13:10:53,783 INFO L273 TraceCheckUtils]: 9: Hoare triple {4033#(<= main_~i0~0 2)} assume !(~i0~0 < ~n0~0); {4034#(<= main_~n0~0 2)} is VALID [2018-11-23 13:10:53,784 INFO L273 TraceCheckUtils]: 10: Hoare triple {4034#(<= main_~n0~0 2)} ~i1~0 := 0; {4035#(<= (+ main_~i1~0 main_~n0~0) 2)} is VALID [2018-11-23 13:10:53,785 INFO L273 TraceCheckUtils]: 11: Hoare triple {4035#(<= (+ main_~i1~0 main_~n0~0) 2)} assume !!(~i1~0 < ~n1~0);#t~post5 := ~i1~0;~i1~0 := 1 + #t~post5;havoc #t~post5;#t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {4036#(<= (+ main_~i1~0 main_~n0~0) 3)} is VALID [2018-11-23 13:10:53,786 INFO L273 TraceCheckUtils]: 12: Hoare triple {4036#(<= (+ main_~i1~0 main_~n0~0) 3)} assume !(~i1~0 < ~n1~0); {4037#(<= (+ main_~n0~0 main_~n1~0) 3)} is VALID [2018-11-23 13:10:53,787 INFO L273 TraceCheckUtils]: 13: Hoare triple {4037#(<= (+ main_~n0~0 main_~n1~0) 3)} ~j1~0 := 0; {4038#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 3))} is VALID [2018-11-23 13:10:53,787 INFO L273 TraceCheckUtils]: 14: Hoare triple {4038#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 3))} assume !!(~j1~0 < ~n0~0 + ~n1~0); {4038#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 3))} is VALID [2018-11-23 13:10:53,788 INFO L256 TraceCheckUtils]: 15: Hoare triple {4038#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 3))} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {4029#true} is VALID [2018-11-23 13:10:53,788 INFO L273 TraceCheckUtils]: 16: Hoare triple {4029#true} ~cond := #in~cond; {4029#true} is VALID [2018-11-23 13:10:53,788 INFO L273 TraceCheckUtils]: 17: Hoare triple {4029#true} assume !(0 == ~cond); {4029#true} is VALID [2018-11-23 13:10:53,788 INFO L273 TraceCheckUtils]: 18: Hoare triple {4029#true} assume true; {4029#true} is VALID [2018-11-23 13:10:53,790 INFO L268 TraceCheckUtils]: 19: Hoare quadruple {4029#true} {4038#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 3))} #70#return; {4038#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 3))} is VALID [2018-11-23 13:10:53,790 INFO L273 TraceCheckUtils]: 20: Hoare triple {4038#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 3))} #t~post7 := ~j1~0;~j1~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~k~0;~k~0 := #t~post8 - 1;havoc #t~post8; {4039#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 2))} is VALID [2018-11-23 13:10:53,791 INFO L273 TraceCheckUtils]: 21: Hoare triple {4039#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 2))} assume !!(~j1~0 < ~n0~0 + ~n1~0); {4039#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 2))} is VALID [2018-11-23 13:10:53,791 INFO L256 TraceCheckUtils]: 22: Hoare triple {4039#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 2))} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {4029#true} is VALID [2018-11-23 13:10:53,791 INFO L273 TraceCheckUtils]: 23: Hoare triple {4029#true} ~cond := #in~cond; {4029#true} is VALID [2018-11-23 13:10:53,791 INFO L273 TraceCheckUtils]: 24: Hoare triple {4029#true} assume !(0 == ~cond); {4029#true} is VALID [2018-11-23 13:10:53,792 INFO L273 TraceCheckUtils]: 25: Hoare triple {4029#true} assume true; {4029#true} is VALID [2018-11-23 13:10:53,793 INFO L268 TraceCheckUtils]: 26: Hoare quadruple {4029#true} {4039#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 2))} #70#return; {4039#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 2))} is VALID [2018-11-23 13:10:53,794 INFO L273 TraceCheckUtils]: 27: Hoare triple {4039#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 2))} #t~post7 := ~j1~0;~j1~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~k~0;~k~0 := #t~post8 - 1;havoc #t~post8; {4040#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 1))} is VALID [2018-11-23 13:10:53,796 INFO L273 TraceCheckUtils]: 28: Hoare triple {4040#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 1))} assume !!(~j1~0 < ~n0~0 + ~n1~0); {4040#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 1))} is VALID [2018-11-23 13:10:53,796 INFO L256 TraceCheckUtils]: 29: Hoare triple {4040#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 1))} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {4029#true} is VALID [2018-11-23 13:10:53,796 INFO L273 TraceCheckUtils]: 30: Hoare triple {4029#true} ~cond := #in~cond; {4029#true} is VALID [2018-11-23 13:10:53,797 INFO L273 TraceCheckUtils]: 31: Hoare triple {4029#true} assume !(0 == ~cond); {4029#true} is VALID [2018-11-23 13:10:53,797 INFO L273 TraceCheckUtils]: 32: Hoare triple {4029#true} assume true; {4029#true} is VALID [2018-11-23 13:10:53,798 INFO L268 TraceCheckUtils]: 33: Hoare quadruple {4029#true} {4040#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 1))} #70#return; {4040#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 1))} is VALID [2018-11-23 13:10:53,799 INFO L273 TraceCheckUtils]: 34: Hoare triple {4040#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 1))} #t~post7 := ~j1~0;~j1~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~k~0;~k~0 := #t~post8 - 1;havoc #t~post8; {4041#(<= (+ main_~n0~0 main_~n1~0) main_~j1~0)} is VALID [2018-11-23 13:10:53,799 INFO L273 TraceCheckUtils]: 35: Hoare triple {4041#(<= (+ main_~n0~0 main_~n1~0) main_~j1~0)} assume !!(~j1~0 < ~n0~0 + ~n1~0); {4030#false} is VALID [2018-11-23 13:10:53,800 INFO L256 TraceCheckUtils]: 36: Hoare triple {4030#false} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {4030#false} is VALID [2018-11-23 13:10:53,800 INFO L273 TraceCheckUtils]: 37: Hoare triple {4030#false} ~cond := #in~cond; {4030#false} is VALID [2018-11-23 13:10:53,800 INFO L273 TraceCheckUtils]: 38: Hoare triple {4030#false} assume 0 == ~cond; {4030#false} is VALID [2018-11-23 13:10:53,801 INFO L273 TraceCheckUtils]: 39: Hoare triple {4030#false} assume !false; {4030#false} is VALID [2018-11-23 13:10:53,807 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 21 proven. 4 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-23 13:10:53,808 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:10:53,808 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:10:53,825 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 13:10:53,847 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-11-23 13:10:53,848 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:10:53,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:10:53,861 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:10:54,317 INFO L256 TraceCheckUtils]: 0: Hoare triple {4029#true} call ULTIMATE.init(); {4029#true} is VALID [2018-11-23 13:10:54,318 INFO L273 TraceCheckUtils]: 1: Hoare triple {4029#true} assume true; {4029#true} is VALID [2018-11-23 13:10:54,318 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {4029#true} {4029#true} #66#return; {4029#true} is VALID [2018-11-23 13:10:54,318 INFO L256 TraceCheckUtils]: 3: Hoare triple {4029#true} call #t~ret9 := main(); {4029#true} is VALID [2018-11-23 13:10:54,319 INFO L273 TraceCheckUtils]: 4: Hoare triple {4029#true} havoc ~n0~0;havoc ~n1~0;~i0~0 := 0;~k~0 := 0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n0~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~n1~0 := #t~nondet2;havoc #t~nondet2; {4031#(<= main_~i0~0 0)} is VALID [2018-11-23 13:10:54,320 INFO L273 TraceCheckUtils]: 5: Hoare triple {4031#(<= main_~i0~0 0)} assume !!(-1000000 <= ~n0~0 && ~n0~0 < 1000000); {4031#(<= main_~i0~0 0)} is VALID [2018-11-23 13:10:54,320 INFO L273 TraceCheckUtils]: 6: Hoare triple {4031#(<= main_~i0~0 0)} assume !!(-1000000 <= ~n1~0 && ~n1~0 < 1000000); {4031#(<= main_~i0~0 0)} is VALID [2018-11-23 13:10:54,321 INFO L273 TraceCheckUtils]: 7: Hoare triple {4031#(<= main_~i0~0 0)} assume !!(~i0~0 < ~n0~0);#t~post3 := ~i0~0;~i0~0 := 1 + #t~post3;havoc #t~post3;#t~post4 := ~k~0;~k~0 := 1 + #t~post4;havoc #t~post4; {4032#(<= main_~i0~0 1)} is VALID [2018-11-23 13:10:54,322 INFO L273 TraceCheckUtils]: 8: Hoare triple {4032#(<= main_~i0~0 1)} assume !!(~i0~0 < ~n0~0);#t~post3 := ~i0~0;~i0~0 := 1 + #t~post3;havoc #t~post3;#t~post4 := ~k~0;~k~0 := 1 + #t~post4;havoc #t~post4; {4033#(<= main_~i0~0 2)} is VALID [2018-11-23 13:10:54,322 INFO L273 TraceCheckUtils]: 9: Hoare triple {4033#(<= main_~i0~0 2)} assume !(~i0~0 < ~n0~0); {4034#(<= main_~n0~0 2)} is VALID [2018-11-23 13:10:54,323 INFO L273 TraceCheckUtils]: 10: Hoare triple {4034#(<= main_~n0~0 2)} ~i1~0 := 0; {4075#(and (<= main_~n0~0 2) (<= main_~i1~0 0))} is VALID [2018-11-23 13:10:54,324 INFO L273 TraceCheckUtils]: 11: Hoare triple {4075#(and (<= main_~n0~0 2) (<= main_~i1~0 0))} assume !!(~i1~0 < ~n1~0);#t~post5 := ~i1~0;~i1~0 := 1 + #t~post5;havoc #t~post5;#t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {4079#(and (<= main_~n0~0 2) (<= main_~i1~0 1))} is VALID [2018-11-23 13:10:54,325 INFO L273 TraceCheckUtils]: 12: Hoare triple {4079#(and (<= main_~n0~0 2) (<= main_~i1~0 1))} assume !(~i1~0 < ~n1~0); {4083#(and (<= main_~n1~0 1) (<= main_~n0~0 2))} is VALID [2018-11-23 13:10:54,326 INFO L273 TraceCheckUtils]: 13: Hoare triple {4083#(and (<= main_~n1~0 1) (<= main_~n0~0 2))} ~j1~0 := 0; {4087#(and (<= main_~n1~0 1) (<= main_~n0~0 2) (<= 0 main_~j1~0))} is VALID [2018-11-23 13:10:54,326 INFO L273 TraceCheckUtils]: 14: Hoare triple {4087#(and (<= main_~n1~0 1) (<= main_~n0~0 2) (<= 0 main_~j1~0))} assume !!(~j1~0 < ~n0~0 + ~n1~0); {4087#(and (<= main_~n1~0 1) (<= main_~n0~0 2) (<= 0 main_~j1~0))} is VALID [2018-11-23 13:10:54,327 INFO L256 TraceCheckUtils]: 15: Hoare triple {4087#(and (<= main_~n1~0 1) (<= main_~n0~0 2) (<= 0 main_~j1~0))} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {4029#true} is VALID [2018-11-23 13:10:54,327 INFO L273 TraceCheckUtils]: 16: Hoare triple {4029#true} ~cond := #in~cond; {4029#true} is VALID [2018-11-23 13:10:54,327 INFO L273 TraceCheckUtils]: 17: Hoare triple {4029#true} assume !(0 == ~cond); {4029#true} is VALID [2018-11-23 13:10:54,328 INFO L273 TraceCheckUtils]: 18: Hoare triple {4029#true} assume true; {4029#true} is VALID [2018-11-23 13:10:54,348 INFO L268 TraceCheckUtils]: 19: Hoare quadruple {4029#true} {4087#(and (<= main_~n1~0 1) (<= main_~n0~0 2) (<= 0 main_~j1~0))} #70#return; {4087#(and (<= main_~n1~0 1) (<= main_~n0~0 2) (<= 0 main_~j1~0))} is VALID [2018-11-23 13:10:54,353 INFO L273 TraceCheckUtils]: 20: Hoare triple {4087#(and (<= main_~n1~0 1) (<= main_~n0~0 2) (<= 0 main_~j1~0))} #t~post7 := ~j1~0;~j1~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~k~0;~k~0 := #t~post8 - 1;havoc #t~post8; {4109#(and (<= main_~n1~0 1) (<= 1 main_~j1~0) (<= main_~n0~0 2))} is VALID [2018-11-23 13:10:54,354 INFO L273 TraceCheckUtils]: 21: Hoare triple {4109#(and (<= main_~n1~0 1) (<= 1 main_~j1~0) (<= main_~n0~0 2))} assume !!(~j1~0 < ~n0~0 + ~n1~0); {4109#(and (<= main_~n1~0 1) (<= 1 main_~j1~0) (<= main_~n0~0 2))} is VALID [2018-11-23 13:10:54,354 INFO L256 TraceCheckUtils]: 22: Hoare triple {4109#(and (<= main_~n1~0 1) (<= 1 main_~j1~0) (<= main_~n0~0 2))} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {4029#true} is VALID [2018-11-23 13:10:54,354 INFO L273 TraceCheckUtils]: 23: Hoare triple {4029#true} ~cond := #in~cond; {4029#true} is VALID [2018-11-23 13:10:54,354 INFO L273 TraceCheckUtils]: 24: Hoare triple {4029#true} assume !(0 == ~cond); {4029#true} is VALID [2018-11-23 13:10:54,354 INFO L273 TraceCheckUtils]: 25: Hoare triple {4029#true} assume true; {4029#true} is VALID [2018-11-23 13:10:54,355 INFO L268 TraceCheckUtils]: 26: Hoare quadruple {4029#true} {4109#(and (<= main_~n1~0 1) (<= 1 main_~j1~0) (<= main_~n0~0 2))} #70#return; {4109#(and (<= main_~n1~0 1) (<= 1 main_~j1~0) (<= main_~n0~0 2))} is VALID [2018-11-23 13:10:54,356 INFO L273 TraceCheckUtils]: 27: Hoare triple {4109#(and (<= main_~n1~0 1) (<= 1 main_~j1~0) (<= main_~n0~0 2))} #t~post7 := ~j1~0;~j1~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~k~0;~k~0 := #t~post8 - 1;havoc #t~post8; {4131#(and (<= main_~n1~0 1) (<= main_~n0~0 2) (<= 2 main_~j1~0))} is VALID [2018-11-23 13:10:54,357 INFO L273 TraceCheckUtils]: 28: Hoare triple {4131#(and (<= main_~n1~0 1) (<= main_~n0~0 2) (<= 2 main_~j1~0))} assume !!(~j1~0 < ~n0~0 + ~n1~0); {4131#(and (<= main_~n1~0 1) (<= main_~n0~0 2) (<= 2 main_~j1~0))} is VALID [2018-11-23 13:10:54,357 INFO L256 TraceCheckUtils]: 29: Hoare triple {4131#(and (<= main_~n1~0 1) (<= main_~n0~0 2) (<= 2 main_~j1~0))} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {4029#true} is VALID [2018-11-23 13:10:54,357 INFO L273 TraceCheckUtils]: 30: Hoare triple {4029#true} ~cond := #in~cond; {4029#true} is VALID [2018-11-23 13:10:54,357 INFO L273 TraceCheckUtils]: 31: Hoare triple {4029#true} assume !(0 == ~cond); {4029#true} is VALID [2018-11-23 13:10:54,357 INFO L273 TraceCheckUtils]: 32: Hoare triple {4029#true} assume true; {4029#true} is VALID [2018-11-23 13:10:54,358 INFO L268 TraceCheckUtils]: 33: Hoare quadruple {4029#true} {4131#(and (<= main_~n1~0 1) (<= main_~n0~0 2) (<= 2 main_~j1~0))} #70#return; {4131#(and (<= main_~n1~0 1) (<= main_~n0~0 2) (<= 2 main_~j1~0))} is VALID [2018-11-23 13:10:54,359 INFO L273 TraceCheckUtils]: 34: Hoare triple {4131#(and (<= main_~n1~0 1) (<= main_~n0~0 2) (<= 2 main_~j1~0))} #t~post7 := ~j1~0;~j1~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~k~0;~k~0 := #t~post8 - 1;havoc #t~post8; {4153#(and (<= main_~n1~0 1) (<= main_~n0~0 2) (<= 3 main_~j1~0))} is VALID [2018-11-23 13:10:54,360 INFO L273 TraceCheckUtils]: 35: Hoare triple {4153#(and (<= main_~n1~0 1) (<= main_~n0~0 2) (<= 3 main_~j1~0))} assume !!(~j1~0 < ~n0~0 + ~n1~0); {4030#false} is VALID [2018-11-23 13:10:54,361 INFO L256 TraceCheckUtils]: 36: Hoare triple {4030#false} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {4030#false} is VALID [2018-11-23 13:10:54,361 INFO L273 TraceCheckUtils]: 37: Hoare triple {4030#false} ~cond := #in~cond; {4030#false} is VALID [2018-11-23 13:10:54,361 INFO L273 TraceCheckUtils]: 38: Hoare triple {4030#false} assume 0 == ~cond; {4030#false} is VALID [2018-11-23 13:10:54,361 INFO L273 TraceCheckUtils]: 39: Hoare triple {4030#false} assume !false; {4030#false} is VALID [2018-11-23 13:10:54,364 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 21 proven. 4 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-23 13:10:54,383 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:10:54,384 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 20 [2018-11-23 13:10:54,384 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 40 [2018-11-23 13:10:54,384 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:10:54,384 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 20 states. [2018-11-23 13:10:54,465 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:10:54,465 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-11-23 13:10:54,466 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-11-23 13:10:54,466 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=297, Unknown=0, NotChecked=0, Total=380 [2018-11-23 13:10:54,466 INFO L87 Difference]: Start difference. First operand 50 states and 55 transitions. Second operand 20 states. [2018-11-23 13:10:55,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:10:55,734 INFO L93 Difference]: Finished difference Result 114 states and 138 transitions. [2018-11-23 13:10:55,735 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-11-23 13:10:55,735 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 40 [2018-11-23 13:10:55,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:10:55,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-23 13:10:55,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 82 transitions. [2018-11-23 13:10:55,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-23 13:10:55,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 82 transitions. [2018-11-23 13:10:55,739 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 19 states and 82 transitions. [2018-11-23 13:10:55,814 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-23 13:10:55,817 INFO L225 Difference]: With dead ends: 114 [2018-11-23 13:10:55,817 INFO L226 Difference]: Without dead ends: 94 [2018-11-23 13:10:55,818 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 242 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=253, Invalid=869, Unknown=0, NotChecked=0, Total=1122 [2018-11-23 13:10:55,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2018-11-23 13:10:56,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 50. [2018-11-23 13:10:56,558 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:10:56,559 INFO L82 GeneralOperation]: Start isEquivalent. First operand 94 states. Second operand 50 states. [2018-11-23 13:10:56,559 INFO L74 IsIncluded]: Start isIncluded. First operand 94 states. Second operand 50 states. [2018-11-23 13:10:56,559 INFO L87 Difference]: Start difference. First operand 94 states. Second operand 50 states. [2018-11-23 13:10:56,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:10:56,562 INFO L93 Difference]: Finished difference Result 94 states and 114 transitions. [2018-11-23 13:10:56,562 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 114 transitions. [2018-11-23 13:10:56,563 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:10:56,563 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:10:56,563 INFO L74 IsIncluded]: Start isIncluded. First operand 50 states. Second operand 94 states. [2018-11-23 13:10:56,563 INFO L87 Difference]: Start difference. First operand 50 states. Second operand 94 states. [2018-11-23 13:10:56,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:10:56,566 INFO L93 Difference]: Finished difference Result 94 states and 114 transitions. [2018-11-23 13:10:56,566 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 114 transitions. [2018-11-23 13:10:56,567 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:10:56,567 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:10:56,567 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:10:56,567 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:10:56,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-11-23 13:10:56,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 55 transitions. [2018-11-23 13:10:56,569 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 55 transitions. Word has length 40 [2018-11-23 13:10:56,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:10:56,569 INFO L480 AbstractCegarLoop]: Abstraction has 50 states and 55 transitions. [2018-11-23 13:10:56,569 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-11-23 13:10:56,569 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 55 transitions. [2018-11-23 13:10:56,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-11-23 13:10:56,570 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:10:56,570 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:10:56,570 INFO L423 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:10:56,570 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:10:56,570 INFO L82 PathProgramCache]: Analyzing trace with hash 972346287, now seen corresponding path program 3 times [2018-11-23 13:10:56,571 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:10:56,571 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:10:56,571 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:10:56,572 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:10:56,572 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:10:56,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:10:56,732 INFO L256 TraceCheckUtils]: 0: Hoare triple {4640#true} call ULTIMATE.init(); {4640#true} is VALID [2018-11-23 13:10:56,733 INFO L273 TraceCheckUtils]: 1: Hoare triple {4640#true} assume true; {4640#true} is VALID [2018-11-23 13:10:56,733 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {4640#true} {4640#true} #66#return; {4640#true} is VALID [2018-11-23 13:10:56,733 INFO L256 TraceCheckUtils]: 3: Hoare triple {4640#true} call #t~ret9 := main(); {4640#true} is VALID [2018-11-23 13:10:56,734 INFO L273 TraceCheckUtils]: 4: Hoare triple {4640#true} havoc ~n0~0;havoc ~n1~0;~i0~0 := 0;~k~0 := 0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n0~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~n1~0 := #t~nondet2;havoc #t~nondet2; {4642#(<= main_~i0~0 0)} is VALID [2018-11-23 13:10:56,734 INFO L273 TraceCheckUtils]: 5: Hoare triple {4642#(<= main_~i0~0 0)} assume !!(-1000000 <= ~n0~0 && ~n0~0 < 1000000); {4642#(<= main_~i0~0 0)} is VALID [2018-11-23 13:10:56,735 INFO L273 TraceCheckUtils]: 6: Hoare triple {4642#(<= main_~i0~0 0)} assume !!(-1000000 <= ~n1~0 && ~n1~0 < 1000000); {4642#(<= main_~i0~0 0)} is VALID [2018-11-23 13:10:56,735 INFO L273 TraceCheckUtils]: 7: Hoare triple {4642#(<= main_~i0~0 0)} assume !!(~i0~0 < ~n0~0);#t~post3 := ~i0~0;~i0~0 := 1 + #t~post3;havoc #t~post3;#t~post4 := ~k~0;~k~0 := 1 + #t~post4;havoc #t~post4; {4643#(<= main_~i0~0 1)} is VALID [2018-11-23 13:10:56,736 INFO L273 TraceCheckUtils]: 8: Hoare triple {4643#(<= main_~i0~0 1)} assume !!(~i0~0 < ~n0~0);#t~post3 := ~i0~0;~i0~0 := 1 + #t~post3;havoc #t~post3;#t~post4 := ~k~0;~k~0 := 1 + #t~post4;havoc #t~post4; {4644#(<= main_~i0~0 2)} is VALID [2018-11-23 13:10:56,736 INFO L273 TraceCheckUtils]: 9: Hoare triple {4644#(<= main_~i0~0 2)} assume !!(~i0~0 < ~n0~0);#t~post3 := ~i0~0;~i0~0 := 1 + #t~post3;havoc #t~post3;#t~post4 := ~k~0;~k~0 := 1 + #t~post4;havoc #t~post4; {4645#(<= main_~i0~0 3)} is VALID [2018-11-23 13:10:56,737 INFO L273 TraceCheckUtils]: 10: Hoare triple {4645#(<= main_~i0~0 3)} assume !(~i0~0 < ~n0~0); {4646#(<= main_~n0~0 3)} is VALID [2018-11-23 13:10:56,738 INFO L273 TraceCheckUtils]: 11: Hoare triple {4646#(<= main_~n0~0 3)} ~i1~0 := 0; {4647#(<= (+ main_~i1~0 main_~n0~0) 3)} is VALID [2018-11-23 13:10:56,738 INFO L273 TraceCheckUtils]: 12: Hoare triple {4647#(<= (+ main_~i1~0 main_~n0~0) 3)} assume !(~i1~0 < ~n1~0); {4648#(<= (+ main_~n0~0 main_~n1~0) 3)} is VALID [2018-11-23 13:10:56,739 INFO L273 TraceCheckUtils]: 13: Hoare triple {4648#(<= (+ main_~n0~0 main_~n1~0) 3)} ~j1~0 := 0; {4649#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 3))} is VALID [2018-11-23 13:10:56,739 INFO L273 TraceCheckUtils]: 14: Hoare triple {4649#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 3))} assume !!(~j1~0 < ~n0~0 + ~n1~0); {4649#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 3))} is VALID [2018-11-23 13:10:56,740 INFO L256 TraceCheckUtils]: 15: Hoare triple {4649#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 3))} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {4640#true} is VALID [2018-11-23 13:10:56,740 INFO L273 TraceCheckUtils]: 16: Hoare triple {4640#true} ~cond := #in~cond; {4640#true} is VALID [2018-11-23 13:10:56,740 INFO L273 TraceCheckUtils]: 17: Hoare triple {4640#true} assume !(0 == ~cond); {4640#true} is VALID [2018-11-23 13:10:56,740 INFO L273 TraceCheckUtils]: 18: Hoare triple {4640#true} assume true; {4640#true} is VALID [2018-11-23 13:10:56,741 INFO L268 TraceCheckUtils]: 19: Hoare quadruple {4640#true} {4649#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 3))} #70#return; {4649#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 3))} is VALID [2018-11-23 13:10:56,742 INFO L273 TraceCheckUtils]: 20: Hoare triple {4649#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 3))} #t~post7 := ~j1~0;~j1~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~k~0;~k~0 := #t~post8 - 1;havoc #t~post8; {4650#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 2))} is VALID [2018-11-23 13:10:56,743 INFO L273 TraceCheckUtils]: 21: Hoare triple {4650#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 2))} assume !!(~j1~0 < ~n0~0 + ~n1~0); {4650#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 2))} is VALID [2018-11-23 13:10:56,743 INFO L256 TraceCheckUtils]: 22: Hoare triple {4650#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 2))} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {4640#true} is VALID [2018-11-23 13:10:56,743 INFO L273 TraceCheckUtils]: 23: Hoare triple {4640#true} ~cond := #in~cond; {4640#true} is VALID [2018-11-23 13:10:56,743 INFO L273 TraceCheckUtils]: 24: Hoare triple {4640#true} assume !(0 == ~cond); {4640#true} is VALID [2018-11-23 13:10:56,743 INFO L273 TraceCheckUtils]: 25: Hoare triple {4640#true} assume true; {4640#true} is VALID [2018-11-23 13:10:56,744 INFO L268 TraceCheckUtils]: 26: Hoare quadruple {4640#true} {4650#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 2))} #70#return; {4650#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 2))} is VALID [2018-11-23 13:10:56,744 INFO L273 TraceCheckUtils]: 27: Hoare triple {4650#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 2))} #t~post7 := ~j1~0;~j1~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~k~0;~k~0 := #t~post8 - 1;havoc #t~post8; {4651#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 1))} is VALID [2018-11-23 13:10:56,745 INFO L273 TraceCheckUtils]: 28: Hoare triple {4651#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 1))} assume !!(~j1~0 < ~n0~0 + ~n1~0); {4651#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 1))} is VALID [2018-11-23 13:10:56,745 INFO L256 TraceCheckUtils]: 29: Hoare triple {4651#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 1))} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {4640#true} is VALID [2018-11-23 13:10:56,745 INFO L273 TraceCheckUtils]: 30: Hoare triple {4640#true} ~cond := #in~cond; {4640#true} is VALID [2018-11-23 13:10:56,745 INFO L273 TraceCheckUtils]: 31: Hoare triple {4640#true} assume !(0 == ~cond); {4640#true} is VALID [2018-11-23 13:10:56,745 INFO L273 TraceCheckUtils]: 32: Hoare triple {4640#true} assume true; {4640#true} is VALID [2018-11-23 13:10:56,746 INFO L268 TraceCheckUtils]: 33: Hoare quadruple {4640#true} {4651#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 1))} #70#return; {4651#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 1))} is VALID [2018-11-23 13:10:56,747 INFO L273 TraceCheckUtils]: 34: Hoare triple {4651#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 1))} #t~post7 := ~j1~0;~j1~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~k~0;~k~0 := #t~post8 - 1;havoc #t~post8; {4652#(<= (+ main_~n0~0 main_~n1~0) main_~j1~0)} is VALID [2018-11-23 13:10:56,747 INFO L273 TraceCheckUtils]: 35: Hoare triple {4652#(<= (+ main_~n0~0 main_~n1~0) main_~j1~0)} assume !!(~j1~0 < ~n0~0 + ~n1~0); {4641#false} is VALID [2018-11-23 13:10:56,747 INFO L256 TraceCheckUtils]: 36: Hoare triple {4641#false} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {4641#false} is VALID [2018-11-23 13:10:56,748 INFO L273 TraceCheckUtils]: 37: Hoare triple {4641#false} ~cond := #in~cond; {4641#false} is VALID [2018-11-23 13:10:56,748 INFO L273 TraceCheckUtils]: 38: Hoare triple {4641#false} assume 0 == ~cond; {4641#false} is VALID [2018-11-23 13:10:56,748 INFO L273 TraceCheckUtils]: 39: Hoare triple {4641#false} assume !false; {4641#false} is VALID [2018-11-23 13:10:56,750 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 21 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-23 13:10:56,750 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:10:56,750 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:10:56,764 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 13:10:56,777 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-11-23 13:10:56,777 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:10:56,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:10:56,787 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:10:57,019 INFO L256 TraceCheckUtils]: 0: Hoare triple {4640#true} call ULTIMATE.init(); {4640#true} is VALID [2018-11-23 13:10:57,019 INFO L273 TraceCheckUtils]: 1: Hoare triple {4640#true} assume true; {4640#true} is VALID [2018-11-23 13:10:57,019 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {4640#true} {4640#true} #66#return; {4640#true} is VALID [2018-11-23 13:10:57,020 INFO L256 TraceCheckUtils]: 3: Hoare triple {4640#true} call #t~ret9 := main(); {4640#true} is VALID [2018-11-23 13:10:57,020 INFO L273 TraceCheckUtils]: 4: Hoare triple {4640#true} havoc ~n0~0;havoc ~n1~0;~i0~0 := 0;~k~0 := 0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n0~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~n1~0 := #t~nondet2;havoc #t~nondet2; {4642#(<= main_~i0~0 0)} is VALID [2018-11-23 13:10:57,021 INFO L273 TraceCheckUtils]: 5: Hoare triple {4642#(<= main_~i0~0 0)} assume !!(-1000000 <= ~n0~0 && ~n0~0 < 1000000); {4642#(<= main_~i0~0 0)} is VALID [2018-11-23 13:10:57,021 INFO L273 TraceCheckUtils]: 6: Hoare triple {4642#(<= main_~i0~0 0)} assume !!(-1000000 <= ~n1~0 && ~n1~0 < 1000000); {4642#(<= main_~i0~0 0)} is VALID [2018-11-23 13:10:57,021 INFO L273 TraceCheckUtils]: 7: Hoare triple {4642#(<= main_~i0~0 0)} assume !!(~i0~0 < ~n0~0);#t~post3 := ~i0~0;~i0~0 := 1 + #t~post3;havoc #t~post3;#t~post4 := ~k~0;~k~0 := 1 + #t~post4;havoc #t~post4; {4643#(<= main_~i0~0 1)} is VALID [2018-11-23 13:10:57,022 INFO L273 TraceCheckUtils]: 8: Hoare triple {4643#(<= main_~i0~0 1)} assume !!(~i0~0 < ~n0~0);#t~post3 := ~i0~0;~i0~0 := 1 + #t~post3;havoc #t~post3;#t~post4 := ~k~0;~k~0 := 1 + #t~post4;havoc #t~post4; {4644#(<= main_~i0~0 2)} is VALID [2018-11-23 13:10:57,022 INFO L273 TraceCheckUtils]: 9: Hoare triple {4644#(<= main_~i0~0 2)} assume !!(~i0~0 < ~n0~0);#t~post3 := ~i0~0;~i0~0 := 1 + #t~post3;havoc #t~post3;#t~post4 := ~k~0;~k~0 := 1 + #t~post4;havoc #t~post4; {4645#(<= main_~i0~0 3)} is VALID [2018-11-23 13:10:57,023 INFO L273 TraceCheckUtils]: 10: Hoare triple {4645#(<= main_~i0~0 3)} assume !(~i0~0 < ~n0~0); {4646#(<= main_~n0~0 3)} is VALID [2018-11-23 13:10:57,023 INFO L273 TraceCheckUtils]: 11: Hoare triple {4646#(<= main_~n0~0 3)} ~i1~0 := 0; {4689#(and (<= main_~i1~0 0) (<= main_~n0~0 3))} is VALID [2018-11-23 13:10:57,024 INFO L273 TraceCheckUtils]: 12: Hoare triple {4689#(and (<= main_~i1~0 0) (<= main_~n0~0 3))} assume !(~i1~0 < ~n1~0); {4693#(and (<= main_~n1~0 0) (<= main_~n0~0 3))} is VALID [2018-11-23 13:10:57,025 INFO L273 TraceCheckUtils]: 13: Hoare triple {4693#(and (<= main_~n1~0 0) (<= main_~n0~0 3))} ~j1~0 := 0; {4697#(and (<= main_~n1~0 0) (<= main_~n0~0 3) (<= 0 main_~j1~0))} is VALID [2018-11-23 13:10:57,026 INFO L273 TraceCheckUtils]: 14: Hoare triple {4697#(and (<= main_~n1~0 0) (<= main_~n0~0 3) (<= 0 main_~j1~0))} assume !!(~j1~0 < ~n0~0 + ~n1~0); {4697#(and (<= main_~n1~0 0) (<= main_~n0~0 3) (<= 0 main_~j1~0))} is VALID [2018-11-23 13:10:57,026 INFO L256 TraceCheckUtils]: 15: Hoare triple {4697#(and (<= main_~n1~0 0) (<= main_~n0~0 3) (<= 0 main_~j1~0))} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {4640#true} is VALID [2018-11-23 13:10:57,026 INFO L273 TraceCheckUtils]: 16: Hoare triple {4640#true} ~cond := #in~cond; {4640#true} is VALID [2018-11-23 13:10:57,026 INFO L273 TraceCheckUtils]: 17: Hoare triple {4640#true} assume !(0 == ~cond); {4640#true} is VALID [2018-11-23 13:10:57,027 INFO L273 TraceCheckUtils]: 18: Hoare triple {4640#true} assume true; {4640#true} is VALID [2018-11-23 13:10:57,028 INFO L268 TraceCheckUtils]: 19: Hoare quadruple {4640#true} {4697#(and (<= main_~n1~0 0) (<= main_~n0~0 3) (<= 0 main_~j1~0))} #70#return; {4697#(and (<= main_~n1~0 0) (<= main_~n0~0 3) (<= 0 main_~j1~0))} is VALID [2018-11-23 13:10:57,029 INFO L273 TraceCheckUtils]: 20: Hoare triple {4697#(and (<= main_~n1~0 0) (<= main_~n0~0 3) (<= 0 main_~j1~0))} #t~post7 := ~j1~0;~j1~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~k~0;~k~0 := #t~post8 - 1;havoc #t~post8; {4719#(and (<= main_~n1~0 0) (<= 1 main_~j1~0) (<= main_~n0~0 3))} is VALID [2018-11-23 13:10:57,029 INFO L273 TraceCheckUtils]: 21: Hoare triple {4719#(and (<= main_~n1~0 0) (<= 1 main_~j1~0) (<= main_~n0~0 3))} assume !!(~j1~0 < ~n0~0 + ~n1~0); {4719#(and (<= main_~n1~0 0) (<= 1 main_~j1~0) (<= main_~n0~0 3))} is VALID [2018-11-23 13:10:57,030 INFO L256 TraceCheckUtils]: 22: Hoare triple {4719#(and (<= main_~n1~0 0) (<= 1 main_~j1~0) (<= main_~n0~0 3))} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {4640#true} is VALID [2018-11-23 13:10:57,030 INFO L273 TraceCheckUtils]: 23: Hoare triple {4640#true} ~cond := #in~cond; {4640#true} is VALID [2018-11-23 13:10:57,030 INFO L273 TraceCheckUtils]: 24: Hoare triple {4640#true} assume !(0 == ~cond); {4640#true} is VALID [2018-11-23 13:10:57,030 INFO L273 TraceCheckUtils]: 25: Hoare triple {4640#true} assume true; {4640#true} is VALID [2018-11-23 13:10:57,031 INFO L268 TraceCheckUtils]: 26: Hoare quadruple {4640#true} {4719#(and (<= main_~n1~0 0) (<= 1 main_~j1~0) (<= main_~n0~0 3))} #70#return; {4719#(and (<= main_~n1~0 0) (<= 1 main_~j1~0) (<= main_~n0~0 3))} is VALID [2018-11-23 13:10:57,032 INFO L273 TraceCheckUtils]: 27: Hoare triple {4719#(and (<= main_~n1~0 0) (<= 1 main_~j1~0) (<= main_~n0~0 3))} #t~post7 := ~j1~0;~j1~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~k~0;~k~0 := #t~post8 - 1;havoc #t~post8; {4741#(and (<= main_~n1~0 0) (<= main_~n0~0 3) (<= 2 main_~j1~0))} is VALID [2018-11-23 13:10:57,033 INFO L273 TraceCheckUtils]: 28: Hoare triple {4741#(and (<= main_~n1~0 0) (<= main_~n0~0 3) (<= 2 main_~j1~0))} assume !!(~j1~0 < ~n0~0 + ~n1~0); {4741#(and (<= main_~n1~0 0) (<= main_~n0~0 3) (<= 2 main_~j1~0))} is VALID [2018-11-23 13:10:57,033 INFO L256 TraceCheckUtils]: 29: Hoare triple {4741#(and (<= main_~n1~0 0) (<= main_~n0~0 3) (<= 2 main_~j1~0))} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {4640#true} is VALID [2018-11-23 13:10:57,033 INFO L273 TraceCheckUtils]: 30: Hoare triple {4640#true} ~cond := #in~cond; {4640#true} is VALID [2018-11-23 13:10:57,033 INFO L273 TraceCheckUtils]: 31: Hoare triple {4640#true} assume !(0 == ~cond); {4640#true} is VALID [2018-11-23 13:10:57,034 INFO L273 TraceCheckUtils]: 32: Hoare triple {4640#true} assume true; {4640#true} is VALID [2018-11-23 13:10:57,034 INFO L268 TraceCheckUtils]: 33: Hoare quadruple {4640#true} {4741#(and (<= main_~n1~0 0) (<= main_~n0~0 3) (<= 2 main_~j1~0))} #70#return; {4741#(and (<= main_~n1~0 0) (<= main_~n0~0 3) (<= 2 main_~j1~0))} is VALID [2018-11-23 13:10:57,035 INFO L273 TraceCheckUtils]: 34: Hoare triple {4741#(and (<= main_~n1~0 0) (<= main_~n0~0 3) (<= 2 main_~j1~0))} #t~post7 := ~j1~0;~j1~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~k~0;~k~0 := #t~post8 - 1;havoc #t~post8; {4763#(and (<= main_~n1~0 0) (<= main_~n0~0 3) (<= 3 main_~j1~0))} is VALID [2018-11-23 13:10:57,035 INFO L273 TraceCheckUtils]: 35: Hoare triple {4763#(and (<= main_~n1~0 0) (<= main_~n0~0 3) (<= 3 main_~j1~0))} assume !!(~j1~0 < ~n0~0 + ~n1~0); {4641#false} is VALID [2018-11-23 13:10:57,035 INFO L256 TraceCheckUtils]: 36: Hoare triple {4641#false} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {4641#false} is VALID [2018-11-23 13:10:57,036 INFO L273 TraceCheckUtils]: 37: Hoare triple {4641#false} ~cond := #in~cond; {4641#false} is VALID [2018-11-23 13:10:57,036 INFO L273 TraceCheckUtils]: 38: Hoare triple {4641#false} assume 0 == ~cond; {4641#false} is VALID [2018-11-23 13:10:57,036 INFO L273 TraceCheckUtils]: 39: Hoare triple {4641#false} assume !false; {4641#false} is VALID [2018-11-23 13:10:57,039 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 21 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-23 13:10:57,059 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:10:57,059 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 19 [2018-11-23 13:10:57,059 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 40 [2018-11-23 13:10:57,060 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:10:57,060 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 19 states. [2018-11-23 13:10:57,105 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:10:57,105 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-11-23 13:10:57,106 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-11-23 13:10:57,106 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=263, Unknown=0, NotChecked=0, Total=342 [2018-11-23 13:10:57,106 INFO L87 Difference]: Start difference. First operand 50 states and 55 transitions. Second operand 19 states. [2018-11-23 13:10:58,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:10:58,456 INFO L93 Difference]: Finished difference Result 130 states and 160 transitions. [2018-11-23 13:10:58,456 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-11-23 13:10:58,457 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 40 [2018-11-23 13:10:58,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:10:58,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-23 13:10:58,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 90 transitions. [2018-11-23 13:10:58,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-23 13:10:58,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 90 transitions. [2018-11-23 13:10:58,461 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 19 states and 90 transitions. [2018-11-23 13:10:59,086 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 90 edges. 90 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:10:59,088 INFO L225 Difference]: With dead ends: 130 [2018-11-23 13:10:59,088 INFO L226 Difference]: Without dead ends: 110 [2018-11-23 13:10:59,089 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 197 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=233, Invalid=759, Unknown=0, NotChecked=0, Total=992 [2018-11-23 13:10:59,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2018-11-23 13:10:59,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 52. [2018-11-23 13:10:59,334 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:10:59,334 INFO L82 GeneralOperation]: Start isEquivalent. First operand 110 states. Second operand 52 states. [2018-11-23 13:10:59,334 INFO L74 IsIncluded]: Start isIncluded. First operand 110 states. Second operand 52 states. [2018-11-23 13:10:59,335 INFO L87 Difference]: Start difference. First operand 110 states. Second operand 52 states. [2018-11-23 13:10:59,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:10:59,338 INFO L93 Difference]: Finished difference Result 110 states and 136 transitions. [2018-11-23 13:10:59,338 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 136 transitions. [2018-11-23 13:10:59,339 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:10:59,339 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:10:59,339 INFO L74 IsIncluded]: Start isIncluded. First operand 52 states. Second operand 110 states. [2018-11-23 13:10:59,339 INFO L87 Difference]: Start difference. First operand 52 states. Second operand 110 states. [2018-11-23 13:10:59,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:10:59,343 INFO L93 Difference]: Finished difference Result 110 states and 136 transitions. [2018-11-23 13:10:59,343 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 136 transitions. [2018-11-23 13:10:59,343 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:10:59,344 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:10:59,344 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:10:59,344 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:10:59,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-11-23 13:10:59,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 58 transitions. [2018-11-23 13:10:59,345 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 58 transitions. Word has length 40 [2018-11-23 13:10:59,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:10:59,346 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 58 transitions. [2018-11-23 13:10:59,346 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-11-23 13:10:59,346 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 58 transitions. [2018-11-23 13:10:59,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-11-23 13:10:59,346 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:10:59,347 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:10:59,347 INFO L423 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:10:59,347 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:10:59,347 INFO L82 PathProgramCache]: Analyzing trace with hash 803183848, now seen corresponding path program 6 times [2018-11-23 13:10:59,347 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:10:59,348 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:10:59,348 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:10:59,348 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:10:59,348 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:10:59,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:10:59,857 INFO L256 TraceCheckUtils]: 0: Hoare triple {5310#true} call ULTIMATE.init(); {5310#true} is VALID [2018-11-23 13:10:59,857 INFO L273 TraceCheckUtils]: 1: Hoare triple {5310#true} assume true; {5310#true} is VALID [2018-11-23 13:10:59,858 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {5310#true} {5310#true} #66#return; {5310#true} is VALID [2018-11-23 13:10:59,858 INFO L256 TraceCheckUtils]: 3: Hoare triple {5310#true} call #t~ret9 := main(); {5310#true} is VALID [2018-11-23 13:10:59,859 INFO L273 TraceCheckUtils]: 4: Hoare triple {5310#true} havoc ~n0~0;havoc ~n1~0;~i0~0 := 0;~k~0 := 0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n0~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~n1~0 := #t~nondet2;havoc #t~nondet2; {5312#(<= 0 main_~k~0)} is VALID [2018-11-23 13:10:59,859 INFO L273 TraceCheckUtils]: 5: Hoare triple {5312#(<= 0 main_~k~0)} assume !!(-1000000 <= ~n0~0 && ~n0~0 < 1000000); {5312#(<= 0 main_~k~0)} is VALID [2018-11-23 13:10:59,860 INFO L273 TraceCheckUtils]: 6: Hoare triple {5312#(<= 0 main_~k~0)} assume !!(-1000000 <= ~n1~0 && ~n1~0 < 1000000); {5312#(<= 0 main_~k~0)} is VALID [2018-11-23 13:10:59,860 INFO L273 TraceCheckUtils]: 7: Hoare triple {5312#(<= 0 main_~k~0)} assume !(~i0~0 < ~n0~0); {5312#(<= 0 main_~k~0)} is VALID [2018-11-23 13:10:59,860 INFO L273 TraceCheckUtils]: 8: Hoare triple {5312#(<= 0 main_~k~0)} ~i1~0 := 0; {5312#(<= 0 main_~k~0)} is VALID [2018-11-23 13:10:59,861 INFO L273 TraceCheckUtils]: 9: Hoare triple {5312#(<= 0 main_~k~0)} assume !!(~i1~0 < ~n1~0);#t~post5 := ~i1~0;~i1~0 := 1 + #t~post5;havoc #t~post5;#t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {5313#(<= 1 main_~k~0)} is VALID [2018-11-23 13:10:59,861 INFO L273 TraceCheckUtils]: 10: Hoare triple {5313#(<= 1 main_~k~0)} assume !!(~i1~0 < ~n1~0);#t~post5 := ~i1~0;~i1~0 := 1 + #t~post5;havoc #t~post5;#t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {5314#(<= 2 main_~k~0)} is VALID [2018-11-23 13:10:59,862 INFO L273 TraceCheckUtils]: 11: Hoare triple {5314#(<= 2 main_~k~0)} assume !!(~i1~0 < ~n1~0);#t~post5 := ~i1~0;~i1~0 := 1 + #t~post5;havoc #t~post5;#t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {5315#(<= 3 main_~k~0)} is VALID [2018-11-23 13:10:59,863 INFO L273 TraceCheckUtils]: 12: Hoare triple {5315#(<= 3 main_~k~0)} assume !!(~i1~0 < ~n1~0);#t~post5 := ~i1~0;~i1~0 := 1 + #t~post5;havoc #t~post5;#t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {5316#(<= 4 main_~k~0)} is VALID [2018-11-23 13:10:59,864 INFO L273 TraceCheckUtils]: 13: Hoare triple {5316#(<= 4 main_~k~0)} assume !(~i1~0 < ~n1~0); {5316#(<= 4 main_~k~0)} is VALID [2018-11-23 13:10:59,884 INFO L273 TraceCheckUtils]: 14: Hoare triple {5316#(<= 4 main_~k~0)} ~j1~0 := 0; {5316#(<= 4 main_~k~0)} is VALID [2018-11-23 13:10:59,897 INFO L273 TraceCheckUtils]: 15: Hoare triple {5316#(<= 4 main_~k~0)} assume !!(~j1~0 < ~n0~0 + ~n1~0); {5316#(<= 4 main_~k~0)} is VALID [2018-11-23 13:10:59,897 INFO L256 TraceCheckUtils]: 16: Hoare triple {5316#(<= 4 main_~k~0)} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {5310#true} is VALID [2018-11-23 13:10:59,900 INFO L273 TraceCheckUtils]: 17: Hoare triple {5310#true} ~cond := #in~cond; {5317#(= __VERIFIER_assert_~cond |__VERIFIER_assert_#in~cond|)} is VALID [2018-11-23 13:10:59,900 INFO L273 TraceCheckUtils]: 18: Hoare triple {5317#(= __VERIFIER_assert_~cond |__VERIFIER_assert_#in~cond|)} assume !(0 == ~cond); {5318#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2018-11-23 13:10:59,901 INFO L273 TraceCheckUtils]: 19: Hoare triple {5318#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {5318#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2018-11-23 13:10:59,901 INFO L268 TraceCheckUtils]: 20: Hoare quadruple {5318#(not (= |__VERIFIER_assert_#in~cond| 0))} {5316#(<= 4 main_~k~0)} #70#return; {5316#(<= 4 main_~k~0)} is VALID [2018-11-23 13:10:59,920 INFO L273 TraceCheckUtils]: 21: Hoare triple {5316#(<= 4 main_~k~0)} #t~post7 := ~j1~0;~j1~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~k~0;~k~0 := #t~post8 - 1;havoc #t~post8; {5315#(<= 3 main_~k~0)} is VALID [2018-11-23 13:10:59,929 INFO L273 TraceCheckUtils]: 22: Hoare triple {5315#(<= 3 main_~k~0)} assume !!(~j1~0 < ~n0~0 + ~n1~0); {5315#(<= 3 main_~k~0)} is VALID [2018-11-23 13:10:59,929 INFO L256 TraceCheckUtils]: 23: Hoare triple {5315#(<= 3 main_~k~0)} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {5310#true} is VALID [2018-11-23 13:10:59,929 INFO L273 TraceCheckUtils]: 24: Hoare triple {5310#true} ~cond := #in~cond; {5310#true} is VALID [2018-11-23 13:10:59,929 INFO L273 TraceCheckUtils]: 25: Hoare triple {5310#true} assume !(0 == ~cond); {5310#true} is VALID [2018-11-23 13:10:59,930 INFO L273 TraceCheckUtils]: 26: Hoare triple {5310#true} assume true; {5310#true} is VALID [2018-11-23 13:10:59,945 INFO L268 TraceCheckUtils]: 27: Hoare quadruple {5310#true} {5315#(<= 3 main_~k~0)} #70#return; {5315#(<= 3 main_~k~0)} is VALID [2018-11-23 13:10:59,953 INFO L273 TraceCheckUtils]: 28: Hoare triple {5315#(<= 3 main_~k~0)} #t~post7 := ~j1~0;~j1~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~k~0;~k~0 := #t~post8 - 1;havoc #t~post8; {5314#(<= 2 main_~k~0)} is VALID [2018-11-23 13:10:59,967 INFO L273 TraceCheckUtils]: 29: Hoare triple {5314#(<= 2 main_~k~0)} assume !!(~j1~0 < ~n0~0 + ~n1~0); {5314#(<= 2 main_~k~0)} is VALID [2018-11-23 13:10:59,967 INFO L256 TraceCheckUtils]: 30: Hoare triple {5314#(<= 2 main_~k~0)} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {5310#true} is VALID [2018-11-23 13:10:59,967 INFO L273 TraceCheckUtils]: 31: Hoare triple {5310#true} ~cond := #in~cond; {5310#true} is VALID [2018-11-23 13:10:59,967 INFO L273 TraceCheckUtils]: 32: Hoare triple {5310#true} assume !(0 == ~cond); {5310#true} is VALID [2018-11-23 13:10:59,968 INFO L273 TraceCheckUtils]: 33: Hoare triple {5310#true} assume true; {5310#true} is VALID [2018-11-23 13:10:59,973 INFO L268 TraceCheckUtils]: 34: Hoare quadruple {5310#true} {5314#(<= 2 main_~k~0)} #70#return; {5314#(<= 2 main_~k~0)} is VALID [2018-11-23 13:10:59,973 INFO L273 TraceCheckUtils]: 35: Hoare triple {5314#(<= 2 main_~k~0)} #t~post7 := ~j1~0;~j1~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~k~0;~k~0 := #t~post8 - 1;havoc #t~post8; {5313#(<= 1 main_~k~0)} is VALID [2018-11-23 13:10:59,977 INFO L273 TraceCheckUtils]: 36: Hoare triple {5313#(<= 1 main_~k~0)} assume !!(~j1~0 < ~n0~0 + ~n1~0); {5313#(<= 1 main_~k~0)} is VALID [2018-11-23 13:10:59,977 INFO L256 TraceCheckUtils]: 37: Hoare triple {5313#(<= 1 main_~k~0)} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {5318#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2018-11-23 13:10:59,979 INFO L273 TraceCheckUtils]: 38: Hoare triple {5318#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {5319#(not (= __VERIFIER_assert_~cond 0))} is VALID [2018-11-23 13:10:59,979 INFO L273 TraceCheckUtils]: 39: Hoare triple {5319#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {5311#false} is VALID [2018-11-23 13:10:59,979 INFO L273 TraceCheckUtils]: 40: Hoare triple {5311#false} assume !false; {5311#false} is VALID [2018-11-23 13:10:59,980 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 15 proven. 22 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-23 13:10:59,980 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:10:59,981 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:10:59,990 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-23 13:11:00,006 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2018-11-23 13:11:00,006 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:11:00,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:11:00,036 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:11:00,516 INFO L256 TraceCheckUtils]: 0: Hoare triple {5310#true} call ULTIMATE.init(); {5310#true} is VALID [2018-11-23 13:11:00,516 INFO L273 TraceCheckUtils]: 1: Hoare triple {5310#true} assume true; {5310#true} is VALID [2018-11-23 13:11:00,517 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {5310#true} {5310#true} #66#return; {5310#true} is VALID [2018-11-23 13:11:00,517 INFO L256 TraceCheckUtils]: 3: Hoare triple {5310#true} call #t~ret9 := main(); {5310#true} is VALID [2018-11-23 13:11:00,518 INFO L273 TraceCheckUtils]: 4: Hoare triple {5310#true} havoc ~n0~0;havoc ~n1~0;~i0~0 := 0;~k~0 := 0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n0~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~n1~0 := #t~nondet2;havoc #t~nondet2; {5312#(<= 0 main_~k~0)} is VALID [2018-11-23 13:11:00,518 INFO L273 TraceCheckUtils]: 5: Hoare triple {5312#(<= 0 main_~k~0)} assume !!(-1000000 <= ~n0~0 && ~n0~0 < 1000000); {5312#(<= 0 main_~k~0)} is VALID [2018-11-23 13:11:00,519 INFO L273 TraceCheckUtils]: 6: Hoare triple {5312#(<= 0 main_~k~0)} assume !!(-1000000 <= ~n1~0 && ~n1~0 < 1000000); {5312#(<= 0 main_~k~0)} is VALID [2018-11-23 13:11:00,519 INFO L273 TraceCheckUtils]: 7: Hoare triple {5312#(<= 0 main_~k~0)} assume !(~i0~0 < ~n0~0); {5312#(<= 0 main_~k~0)} is VALID [2018-11-23 13:11:00,519 INFO L273 TraceCheckUtils]: 8: Hoare triple {5312#(<= 0 main_~k~0)} ~i1~0 := 0; {5312#(<= 0 main_~k~0)} is VALID [2018-11-23 13:11:00,520 INFO L273 TraceCheckUtils]: 9: Hoare triple {5312#(<= 0 main_~k~0)} assume !!(~i1~0 < ~n1~0);#t~post5 := ~i1~0;~i1~0 := 1 + #t~post5;havoc #t~post5;#t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {5313#(<= 1 main_~k~0)} is VALID [2018-11-23 13:11:00,520 INFO L273 TraceCheckUtils]: 10: Hoare triple {5313#(<= 1 main_~k~0)} assume !!(~i1~0 < ~n1~0);#t~post5 := ~i1~0;~i1~0 := 1 + #t~post5;havoc #t~post5;#t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {5314#(<= 2 main_~k~0)} is VALID [2018-11-23 13:11:00,521 INFO L273 TraceCheckUtils]: 11: Hoare triple {5314#(<= 2 main_~k~0)} assume !!(~i1~0 < ~n1~0);#t~post5 := ~i1~0;~i1~0 := 1 + #t~post5;havoc #t~post5;#t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {5315#(<= 3 main_~k~0)} is VALID [2018-11-23 13:11:00,522 INFO L273 TraceCheckUtils]: 12: Hoare triple {5315#(<= 3 main_~k~0)} assume !!(~i1~0 < ~n1~0);#t~post5 := ~i1~0;~i1~0 := 1 + #t~post5;havoc #t~post5;#t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {5316#(<= 4 main_~k~0)} is VALID [2018-11-23 13:11:00,523 INFO L273 TraceCheckUtils]: 13: Hoare triple {5316#(<= 4 main_~k~0)} assume !(~i1~0 < ~n1~0); {5316#(<= 4 main_~k~0)} is VALID [2018-11-23 13:11:00,523 INFO L273 TraceCheckUtils]: 14: Hoare triple {5316#(<= 4 main_~k~0)} ~j1~0 := 0; {5316#(<= 4 main_~k~0)} is VALID [2018-11-23 13:11:00,524 INFO L273 TraceCheckUtils]: 15: Hoare triple {5316#(<= 4 main_~k~0)} assume !!(~j1~0 < ~n0~0 + ~n1~0); {5316#(<= 4 main_~k~0)} is VALID [2018-11-23 13:11:00,524 INFO L256 TraceCheckUtils]: 16: Hoare triple {5316#(<= 4 main_~k~0)} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {5310#true} is VALID [2018-11-23 13:11:00,524 INFO L273 TraceCheckUtils]: 17: Hoare triple {5310#true} ~cond := #in~cond; {5310#true} is VALID [2018-11-23 13:11:00,524 INFO L273 TraceCheckUtils]: 18: Hoare triple {5310#true} assume !(0 == ~cond); {5310#true} is VALID [2018-11-23 13:11:00,524 INFO L273 TraceCheckUtils]: 19: Hoare triple {5310#true} assume true; {5310#true} is VALID [2018-11-23 13:11:00,525 INFO L268 TraceCheckUtils]: 20: Hoare quadruple {5310#true} {5316#(<= 4 main_~k~0)} #70#return; {5316#(<= 4 main_~k~0)} is VALID [2018-11-23 13:11:00,526 INFO L273 TraceCheckUtils]: 21: Hoare triple {5316#(<= 4 main_~k~0)} #t~post7 := ~j1~0;~j1~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~k~0;~k~0 := #t~post8 - 1;havoc #t~post8; {5315#(<= 3 main_~k~0)} is VALID [2018-11-23 13:11:00,527 INFO L273 TraceCheckUtils]: 22: Hoare triple {5315#(<= 3 main_~k~0)} assume !!(~j1~0 < ~n0~0 + ~n1~0); {5315#(<= 3 main_~k~0)} is VALID [2018-11-23 13:11:00,527 INFO L256 TraceCheckUtils]: 23: Hoare triple {5315#(<= 3 main_~k~0)} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {5310#true} is VALID [2018-11-23 13:11:00,527 INFO L273 TraceCheckUtils]: 24: Hoare triple {5310#true} ~cond := #in~cond; {5310#true} is VALID [2018-11-23 13:11:00,527 INFO L273 TraceCheckUtils]: 25: Hoare triple {5310#true} assume !(0 == ~cond); {5310#true} is VALID [2018-11-23 13:11:00,527 INFO L273 TraceCheckUtils]: 26: Hoare triple {5310#true} assume true; {5310#true} is VALID [2018-11-23 13:11:00,528 INFO L268 TraceCheckUtils]: 27: Hoare quadruple {5310#true} {5315#(<= 3 main_~k~0)} #70#return; {5315#(<= 3 main_~k~0)} is VALID [2018-11-23 13:11:00,529 INFO L273 TraceCheckUtils]: 28: Hoare triple {5315#(<= 3 main_~k~0)} #t~post7 := ~j1~0;~j1~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~k~0;~k~0 := #t~post8 - 1;havoc #t~post8; {5314#(<= 2 main_~k~0)} is VALID [2018-11-23 13:11:00,529 INFO L273 TraceCheckUtils]: 29: Hoare triple {5314#(<= 2 main_~k~0)} assume !!(~j1~0 < ~n0~0 + ~n1~0); {5314#(<= 2 main_~k~0)} is VALID [2018-11-23 13:11:00,529 INFO L256 TraceCheckUtils]: 30: Hoare triple {5314#(<= 2 main_~k~0)} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {5310#true} is VALID [2018-11-23 13:11:00,529 INFO L273 TraceCheckUtils]: 31: Hoare triple {5310#true} ~cond := #in~cond; {5310#true} is VALID [2018-11-23 13:11:00,529 INFO L273 TraceCheckUtils]: 32: Hoare triple {5310#true} assume !(0 == ~cond); {5310#true} is VALID [2018-11-23 13:11:00,529 INFO L273 TraceCheckUtils]: 33: Hoare triple {5310#true} assume true; {5310#true} is VALID [2018-11-23 13:11:00,530 INFO L268 TraceCheckUtils]: 34: Hoare quadruple {5310#true} {5314#(<= 2 main_~k~0)} #70#return; {5314#(<= 2 main_~k~0)} is VALID [2018-11-23 13:11:00,530 INFO L273 TraceCheckUtils]: 35: Hoare triple {5314#(<= 2 main_~k~0)} #t~post7 := ~j1~0;~j1~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~k~0;~k~0 := #t~post8 - 1;havoc #t~post8; {5313#(<= 1 main_~k~0)} is VALID [2018-11-23 13:11:00,531 INFO L273 TraceCheckUtils]: 36: Hoare triple {5313#(<= 1 main_~k~0)} assume !!(~j1~0 < ~n0~0 + ~n1~0); {5313#(<= 1 main_~k~0)} is VALID [2018-11-23 13:11:00,531 INFO L256 TraceCheckUtils]: 37: Hoare triple {5313#(<= 1 main_~k~0)} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {5434#(= |__VERIFIER_assert_#in~cond| 1)} is VALID [2018-11-23 13:11:00,532 INFO L273 TraceCheckUtils]: 38: Hoare triple {5434#(= |__VERIFIER_assert_#in~cond| 1)} ~cond := #in~cond; {5438#(= 1 __VERIFIER_assert_~cond)} is VALID [2018-11-23 13:11:00,532 INFO L273 TraceCheckUtils]: 39: Hoare triple {5438#(= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {5311#false} is VALID [2018-11-23 13:11:00,533 INFO L273 TraceCheckUtils]: 40: Hoare triple {5311#false} assume !false; {5311#false} is VALID [2018-11-23 13:11:00,535 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 16 proven. 15 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-23 13:11:00,557 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:11:00,558 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 12 [2018-11-23 13:11:00,558 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 41 [2018-11-23 13:11:00,558 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:11:00,559 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2018-11-23 13:11:00,598 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:11:00,599 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-23 13:11:00,599 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-23 13:11:00,599 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2018-11-23 13:11:00,600 INFO L87 Difference]: Start difference. First operand 52 states and 58 transitions. Second operand 12 states. [2018-11-23 13:11:01,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:11:01,518 INFO L93 Difference]: Finished difference Result 61 states and 67 transitions. [2018-11-23 13:11:01,518 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-23 13:11:01,518 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 41 [2018-11-23 13:11:01,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:11:01,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 13:11:01,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 58 transitions. [2018-11-23 13:11:01,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 13:11:01,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 58 transitions. [2018-11-23 13:11:01,521 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 58 transitions. [2018-11-23 13:11:02,280 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-23 13:11:02,281 INFO L225 Difference]: With dead ends: 61 [2018-11-23 13:11:02,281 INFO L226 Difference]: Without dead ends: 59 [2018-11-23 13:11:02,282 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2018-11-23 13:11:02,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-11-23 13:11:02,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2018-11-23 13:11:02,622 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:11:02,622 INFO L82 GeneralOperation]: Start isEquivalent. First operand 59 states. Second operand 59 states. [2018-11-23 13:11:02,622 INFO L74 IsIncluded]: Start isIncluded. First operand 59 states. Second operand 59 states. [2018-11-23 13:11:02,622 INFO L87 Difference]: Start difference. First operand 59 states. Second operand 59 states. [2018-11-23 13:11:02,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:11:02,623 INFO L93 Difference]: Finished difference Result 59 states and 65 transitions. [2018-11-23 13:11:02,624 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 65 transitions. [2018-11-23 13:11:02,624 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:11:02,624 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:11:02,624 INFO L74 IsIncluded]: Start isIncluded. First operand 59 states. Second operand 59 states. [2018-11-23 13:11:02,624 INFO L87 Difference]: Start difference. First operand 59 states. Second operand 59 states. [2018-11-23 13:11:02,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:11:02,625 INFO L93 Difference]: Finished difference Result 59 states and 65 transitions. [2018-11-23 13:11:02,625 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 65 transitions. [2018-11-23 13:11:02,626 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:11:02,626 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:11:02,626 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:11:02,626 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:11:02,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-11-23 13:11:02,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 65 transitions. [2018-11-23 13:11:02,627 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 65 transitions. Word has length 41 [2018-11-23 13:11:02,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:11:02,628 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 65 transitions. [2018-11-23 13:11:02,628 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-23 13:11:02,628 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 65 transitions. [2018-11-23 13:11:02,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-11-23 13:11:02,628 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:11:02,629 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:11:02,629 INFO L423 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:11:02,629 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:11:02,629 INFO L82 PathProgramCache]: Analyzing trace with hash 481149903, now seen corresponding path program 7 times [2018-11-23 13:11:02,629 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:11:02,629 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:11:02,630 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:11:02,630 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:11:02,630 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:11:02,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:11:03,825 INFO L256 TraceCheckUtils]: 0: Hoare triple {5744#true} call ULTIMATE.init(); {5744#true} is VALID [2018-11-23 13:11:03,826 INFO L273 TraceCheckUtils]: 1: Hoare triple {5744#true} assume true; {5744#true} is VALID [2018-11-23 13:11:03,826 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {5744#true} {5744#true} #66#return; {5744#true} is VALID [2018-11-23 13:11:03,826 INFO L256 TraceCheckUtils]: 3: Hoare triple {5744#true} call #t~ret9 := main(); {5744#true} is VALID [2018-11-23 13:11:03,827 INFO L273 TraceCheckUtils]: 4: Hoare triple {5744#true} havoc ~n0~0;havoc ~n1~0;~i0~0 := 0;~k~0 := 0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n0~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~n1~0 := #t~nondet2;havoc #t~nondet2; {5746#(<= main_~i0~0 0)} is VALID [2018-11-23 13:11:03,827 INFO L273 TraceCheckUtils]: 5: Hoare triple {5746#(<= main_~i0~0 0)} assume !!(-1000000 <= ~n0~0 && ~n0~0 < 1000000); {5746#(<= main_~i0~0 0)} is VALID [2018-11-23 13:11:03,828 INFO L273 TraceCheckUtils]: 6: Hoare triple {5746#(<= main_~i0~0 0)} assume !!(-1000000 <= ~n1~0 && ~n1~0 < 1000000); {5746#(<= main_~i0~0 0)} is VALID [2018-11-23 13:11:03,828 INFO L273 TraceCheckUtils]: 7: Hoare triple {5746#(<= main_~i0~0 0)} assume !(~i0~0 < ~n0~0); {5747#(<= main_~n0~0 0)} is VALID [2018-11-23 13:11:03,829 INFO L273 TraceCheckUtils]: 8: Hoare triple {5747#(<= main_~n0~0 0)} ~i1~0 := 0; {5748#(<= (+ main_~i1~0 main_~n0~0) 0)} is VALID [2018-11-23 13:11:03,829 INFO L273 TraceCheckUtils]: 9: Hoare triple {5748#(<= (+ main_~i1~0 main_~n0~0) 0)} assume !!(~i1~0 < ~n1~0);#t~post5 := ~i1~0;~i1~0 := 1 + #t~post5;havoc #t~post5;#t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {5749#(<= (+ main_~i1~0 main_~n0~0) 1)} is VALID [2018-11-23 13:11:03,830 INFO L273 TraceCheckUtils]: 10: Hoare triple {5749#(<= (+ main_~i1~0 main_~n0~0) 1)} assume !!(~i1~0 < ~n1~0);#t~post5 := ~i1~0;~i1~0 := 1 + #t~post5;havoc #t~post5;#t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {5750#(<= (+ main_~i1~0 main_~n0~0) 2)} is VALID [2018-11-23 13:11:03,830 INFO L273 TraceCheckUtils]: 11: Hoare triple {5750#(<= (+ main_~i1~0 main_~n0~0) 2)} assume !!(~i1~0 < ~n1~0);#t~post5 := ~i1~0;~i1~0 := 1 + #t~post5;havoc #t~post5;#t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {5751#(<= (+ main_~i1~0 main_~n0~0) 3)} is VALID [2018-11-23 13:11:03,831 INFO L273 TraceCheckUtils]: 12: Hoare triple {5751#(<= (+ main_~i1~0 main_~n0~0) 3)} assume !!(~i1~0 < ~n1~0);#t~post5 := ~i1~0;~i1~0 := 1 + #t~post5;havoc #t~post5;#t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {5752#(<= (+ main_~i1~0 main_~n0~0) 4)} is VALID [2018-11-23 13:11:03,831 INFO L273 TraceCheckUtils]: 13: Hoare triple {5752#(<= (+ main_~i1~0 main_~n0~0) 4)} assume !(~i1~0 < ~n1~0); {5753#(<= (+ main_~n0~0 main_~n1~0) 4)} is VALID [2018-11-23 13:11:03,832 INFO L273 TraceCheckUtils]: 14: Hoare triple {5753#(<= (+ main_~n0~0 main_~n1~0) 4)} ~j1~0 := 0; {5754#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 4))} is VALID [2018-11-23 13:11:03,833 INFO L273 TraceCheckUtils]: 15: Hoare triple {5754#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 4))} assume !!(~j1~0 < ~n0~0 + ~n1~0); {5754#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 4))} is VALID [2018-11-23 13:11:03,833 INFO L256 TraceCheckUtils]: 16: Hoare triple {5754#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 4))} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {5744#true} is VALID [2018-11-23 13:11:03,833 INFO L273 TraceCheckUtils]: 17: Hoare triple {5744#true} ~cond := #in~cond; {5744#true} is VALID [2018-11-23 13:11:03,834 INFO L273 TraceCheckUtils]: 18: Hoare triple {5744#true} assume !(0 == ~cond); {5744#true} is VALID [2018-11-23 13:11:03,834 INFO L273 TraceCheckUtils]: 19: Hoare triple {5744#true} assume true; {5744#true} is VALID [2018-11-23 13:11:03,835 INFO L268 TraceCheckUtils]: 20: Hoare quadruple {5744#true} {5754#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 4))} #70#return; {5754#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 4))} is VALID [2018-11-23 13:11:03,836 INFO L273 TraceCheckUtils]: 21: Hoare triple {5754#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 4))} #t~post7 := ~j1~0;~j1~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~k~0;~k~0 := #t~post8 - 1;havoc #t~post8; {5755#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 3))} is VALID [2018-11-23 13:11:03,836 INFO L273 TraceCheckUtils]: 22: Hoare triple {5755#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 3))} assume !!(~j1~0 < ~n0~0 + ~n1~0); {5755#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 3))} is VALID [2018-11-23 13:11:03,836 INFO L256 TraceCheckUtils]: 23: Hoare triple {5755#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 3))} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {5744#true} is VALID [2018-11-23 13:11:03,836 INFO L273 TraceCheckUtils]: 24: Hoare triple {5744#true} ~cond := #in~cond; {5744#true} is VALID [2018-11-23 13:11:03,837 INFO L273 TraceCheckUtils]: 25: Hoare triple {5744#true} assume !(0 == ~cond); {5744#true} is VALID [2018-11-23 13:11:03,837 INFO L273 TraceCheckUtils]: 26: Hoare triple {5744#true} assume true; {5744#true} is VALID [2018-11-23 13:11:03,837 INFO L268 TraceCheckUtils]: 27: Hoare quadruple {5744#true} {5755#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 3))} #70#return; {5755#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 3))} is VALID [2018-11-23 13:11:03,838 INFO L273 TraceCheckUtils]: 28: Hoare triple {5755#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 3))} #t~post7 := ~j1~0;~j1~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~k~0;~k~0 := #t~post8 - 1;havoc #t~post8; {5756#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 2))} is VALID [2018-11-23 13:11:03,839 INFO L273 TraceCheckUtils]: 29: Hoare triple {5756#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 2))} assume !!(~j1~0 < ~n0~0 + ~n1~0); {5756#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 2))} is VALID [2018-11-23 13:11:03,839 INFO L256 TraceCheckUtils]: 30: Hoare triple {5756#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 2))} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {5744#true} is VALID [2018-11-23 13:11:03,839 INFO L273 TraceCheckUtils]: 31: Hoare triple {5744#true} ~cond := #in~cond; {5744#true} is VALID [2018-11-23 13:11:03,840 INFO L273 TraceCheckUtils]: 32: Hoare triple {5744#true} assume !(0 == ~cond); {5744#true} is VALID [2018-11-23 13:11:03,840 INFO L273 TraceCheckUtils]: 33: Hoare triple {5744#true} assume true; {5744#true} is VALID [2018-11-23 13:11:03,841 INFO L268 TraceCheckUtils]: 34: Hoare quadruple {5744#true} {5756#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 2))} #70#return; {5756#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 2))} is VALID [2018-11-23 13:11:03,842 INFO L273 TraceCheckUtils]: 35: Hoare triple {5756#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 2))} #t~post7 := ~j1~0;~j1~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~k~0;~k~0 := #t~post8 - 1;havoc #t~post8; {5757#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 1))} is VALID [2018-11-23 13:11:03,843 INFO L273 TraceCheckUtils]: 36: Hoare triple {5757#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 1))} assume !!(~j1~0 < ~n0~0 + ~n1~0); {5757#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 1))} is VALID [2018-11-23 13:11:03,843 INFO L256 TraceCheckUtils]: 37: Hoare triple {5757#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 1))} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {5744#true} is VALID [2018-11-23 13:11:03,843 INFO L273 TraceCheckUtils]: 38: Hoare triple {5744#true} ~cond := #in~cond; {5744#true} is VALID [2018-11-23 13:11:03,843 INFO L273 TraceCheckUtils]: 39: Hoare triple {5744#true} assume !(0 == ~cond); {5744#true} is VALID [2018-11-23 13:11:03,844 INFO L273 TraceCheckUtils]: 40: Hoare triple {5744#true} assume true; {5744#true} is VALID [2018-11-23 13:11:03,845 INFO L268 TraceCheckUtils]: 41: Hoare quadruple {5744#true} {5757#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 1))} #70#return; {5757#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 1))} is VALID [2018-11-23 13:11:03,846 INFO L273 TraceCheckUtils]: 42: Hoare triple {5757#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 1))} #t~post7 := ~j1~0;~j1~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~k~0;~k~0 := #t~post8 - 1;havoc #t~post8; {5758#(<= (+ main_~n0~0 main_~n1~0) main_~j1~0)} is VALID [2018-11-23 13:11:03,846 INFO L273 TraceCheckUtils]: 43: Hoare triple {5758#(<= (+ main_~n0~0 main_~n1~0) main_~j1~0)} assume !!(~j1~0 < ~n0~0 + ~n1~0); {5745#false} is VALID [2018-11-23 13:11:03,847 INFO L256 TraceCheckUtils]: 44: Hoare triple {5745#false} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {5745#false} is VALID [2018-11-23 13:11:03,847 INFO L273 TraceCheckUtils]: 45: Hoare triple {5745#false} ~cond := #in~cond; {5745#false} is VALID [2018-11-23 13:11:03,847 INFO L273 TraceCheckUtils]: 46: Hoare triple {5745#false} assume 0 == ~cond; {5745#false} is VALID [2018-11-23 13:11:03,847 INFO L273 TraceCheckUtils]: 47: Hoare triple {5745#false} assume !false; {5745#false} is VALID [2018-11-23 13:11:03,852 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 34 proven. 10 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-11-23 13:11:03,852 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:11:03,852 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:11:03,862 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:11:03,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:11:03,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:11:03,892 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:11:04,553 INFO L256 TraceCheckUtils]: 0: Hoare triple {5744#true} call ULTIMATE.init(); {5744#true} is VALID [2018-11-23 13:11:04,553 INFO L273 TraceCheckUtils]: 1: Hoare triple {5744#true} assume true; {5744#true} is VALID [2018-11-23 13:11:04,553 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {5744#true} {5744#true} #66#return; {5744#true} is VALID [2018-11-23 13:11:04,553 INFO L256 TraceCheckUtils]: 3: Hoare triple {5744#true} call #t~ret9 := main(); {5744#true} is VALID [2018-11-23 13:11:04,554 INFO L273 TraceCheckUtils]: 4: Hoare triple {5744#true} havoc ~n0~0;havoc ~n1~0;~i0~0 := 0;~k~0 := 0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n0~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~n1~0 := #t~nondet2;havoc #t~nondet2; {5746#(<= main_~i0~0 0)} is VALID [2018-11-23 13:11:04,555 INFO L273 TraceCheckUtils]: 5: Hoare triple {5746#(<= main_~i0~0 0)} assume !!(-1000000 <= ~n0~0 && ~n0~0 < 1000000); {5746#(<= main_~i0~0 0)} is VALID [2018-11-23 13:11:04,555 INFO L273 TraceCheckUtils]: 6: Hoare triple {5746#(<= main_~i0~0 0)} assume !!(-1000000 <= ~n1~0 && ~n1~0 < 1000000); {5746#(<= main_~i0~0 0)} is VALID [2018-11-23 13:11:04,555 INFO L273 TraceCheckUtils]: 7: Hoare triple {5746#(<= main_~i0~0 0)} assume !(~i0~0 < ~n0~0); {5747#(<= main_~n0~0 0)} is VALID [2018-11-23 13:11:04,556 INFO L273 TraceCheckUtils]: 8: Hoare triple {5747#(<= main_~n0~0 0)} ~i1~0 := 0; {5786#(and (<= main_~i1~0 0) (<= main_~n0~0 0))} is VALID [2018-11-23 13:11:04,556 INFO L273 TraceCheckUtils]: 9: Hoare triple {5786#(and (<= main_~i1~0 0) (<= main_~n0~0 0))} assume !!(~i1~0 < ~n1~0);#t~post5 := ~i1~0;~i1~0 := 1 + #t~post5;havoc #t~post5;#t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {5790#(and (<= main_~i1~0 1) (<= main_~n0~0 0))} is VALID [2018-11-23 13:11:04,557 INFO L273 TraceCheckUtils]: 10: Hoare triple {5790#(and (<= main_~i1~0 1) (<= main_~n0~0 0))} assume !!(~i1~0 < ~n1~0);#t~post5 := ~i1~0;~i1~0 := 1 + #t~post5;havoc #t~post5;#t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {5794#(and (<= main_~i1~0 2) (<= main_~n0~0 0))} is VALID [2018-11-23 13:11:04,558 INFO L273 TraceCheckUtils]: 11: Hoare triple {5794#(and (<= main_~i1~0 2) (<= main_~n0~0 0))} assume !!(~i1~0 < ~n1~0);#t~post5 := ~i1~0;~i1~0 := 1 + #t~post5;havoc #t~post5;#t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {5798#(and (<= main_~n0~0 0) (<= main_~i1~0 3))} is VALID [2018-11-23 13:11:04,558 INFO L273 TraceCheckUtils]: 12: Hoare triple {5798#(and (<= main_~n0~0 0) (<= main_~i1~0 3))} assume !!(~i1~0 < ~n1~0);#t~post5 := ~i1~0;~i1~0 := 1 + #t~post5;havoc #t~post5;#t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {5802#(and (<= main_~i1~0 4) (<= main_~n0~0 0))} is VALID [2018-11-23 13:11:04,559 INFO L273 TraceCheckUtils]: 13: Hoare triple {5802#(and (<= main_~i1~0 4) (<= main_~n0~0 0))} assume !(~i1~0 < ~n1~0); {5806#(and (<= main_~n1~0 4) (<= main_~n0~0 0))} is VALID [2018-11-23 13:11:04,560 INFO L273 TraceCheckUtils]: 14: Hoare triple {5806#(and (<= main_~n1~0 4) (<= main_~n0~0 0))} ~j1~0 := 0; {5810#(and (<= main_~n1~0 4) (<= 0 main_~j1~0) (<= main_~n0~0 0))} is VALID [2018-11-23 13:11:04,561 INFO L273 TraceCheckUtils]: 15: Hoare triple {5810#(and (<= main_~n1~0 4) (<= 0 main_~j1~0) (<= main_~n0~0 0))} assume !!(~j1~0 < ~n0~0 + ~n1~0); {5810#(and (<= main_~n1~0 4) (<= 0 main_~j1~0) (<= main_~n0~0 0))} is VALID [2018-11-23 13:11:04,561 INFO L256 TraceCheckUtils]: 16: Hoare triple {5810#(and (<= main_~n1~0 4) (<= 0 main_~j1~0) (<= main_~n0~0 0))} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {5744#true} is VALID [2018-11-23 13:11:04,561 INFO L273 TraceCheckUtils]: 17: Hoare triple {5744#true} ~cond := #in~cond; {5744#true} is VALID [2018-11-23 13:11:04,561 INFO L273 TraceCheckUtils]: 18: Hoare triple {5744#true} assume !(0 == ~cond); {5744#true} is VALID [2018-11-23 13:11:04,561 INFO L273 TraceCheckUtils]: 19: Hoare triple {5744#true} assume true; {5744#true} is VALID [2018-11-23 13:11:04,562 INFO L268 TraceCheckUtils]: 20: Hoare quadruple {5744#true} {5810#(and (<= main_~n1~0 4) (<= 0 main_~j1~0) (<= main_~n0~0 0))} #70#return; {5810#(and (<= main_~n1~0 4) (<= 0 main_~j1~0) (<= main_~n0~0 0))} is VALID [2018-11-23 13:11:04,563 INFO L273 TraceCheckUtils]: 21: Hoare triple {5810#(and (<= main_~n1~0 4) (<= 0 main_~j1~0) (<= main_~n0~0 0))} #t~post7 := ~j1~0;~j1~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~k~0;~k~0 := #t~post8 - 1;havoc #t~post8; {5832#(and (<= 1 main_~j1~0) (<= main_~n1~0 4) (<= main_~n0~0 0))} is VALID [2018-11-23 13:11:04,564 INFO L273 TraceCheckUtils]: 22: Hoare triple {5832#(and (<= 1 main_~j1~0) (<= main_~n1~0 4) (<= main_~n0~0 0))} assume !!(~j1~0 < ~n0~0 + ~n1~0); {5832#(and (<= 1 main_~j1~0) (<= main_~n1~0 4) (<= main_~n0~0 0))} is VALID [2018-11-23 13:11:04,564 INFO L256 TraceCheckUtils]: 23: Hoare triple {5832#(and (<= 1 main_~j1~0) (<= main_~n1~0 4) (<= main_~n0~0 0))} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {5744#true} is VALID [2018-11-23 13:11:04,564 INFO L273 TraceCheckUtils]: 24: Hoare triple {5744#true} ~cond := #in~cond; {5744#true} is VALID [2018-11-23 13:11:04,564 INFO L273 TraceCheckUtils]: 25: Hoare triple {5744#true} assume !(0 == ~cond); {5744#true} is VALID [2018-11-23 13:11:04,564 INFO L273 TraceCheckUtils]: 26: Hoare triple {5744#true} assume true; {5744#true} is VALID [2018-11-23 13:11:04,565 INFO L268 TraceCheckUtils]: 27: Hoare quadruple {5744#true} {5832#(and (<= 1 main_~j1~0) (<= main_~n1~0 4) (<= main_~n0~0 0))} #70#return; {5832#(and (<= 1 main_~j1~0) (<= main_~n1~0 4) (<= main_~n0~0 0))} is VALID [2018-11-23 13:11:04,566 INFO L273 TraceCheckUtils]: 28: Hoare triple {5832#(and (<= 1 main_~j1~0) (<= main_~n1~0 4) (<= main_~n0~0 0))} #t~post7 := ~j1~0;~j1~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~k~0;~k~0 := #t~post8 - 1;havoc #t~post8; {5854#(and (<= main_~n1~0 4) (<= main_~n0~0 0) (<= 2 main_~j1~0))} is VALID [2018-11-23 13:11:04,567 INFO L273 TraceCheckUtils]: 29: Hoare triple {5854#(and (<= main_~n1~0 4) (<= main_~n0~0 0) (<= 2 main_~j1~0))} assume !!(~j1~0 < ~n0~0 + ~n1~0); {5854#(and (<= main_~n1~0 4) (<= main_~n0~0 0) (<= 2 main_~j1~0))} is VALID [2018-11-23 13:11:04,567 INFO L256 TraceCheckUtils]: 30: Hoare triple {5854#(and (<= main_~n1~0 4) (<= main_~n0~0 0) (<= 2 main_~j1~0))} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {5744#true} is VALID [2018-11-23 13:11:04,567 INFO L273 TraceCheckUtils]: 31: Hoare triple {5744#true} ~cond := #in~cond; {5744#true} is VALID [2018-11-23 13:11:04,567 INFO L273 TraceCheckUtils]: 32: Hoare triple {5744#true} assume !(0 == ~cond); {5744#true} is VALID [2018-11-23 13:11:04,567 INFO L273 TraceCheckUtils]: 33: Hoare triple {5744#true} assume true; {5744#true} is VALID [2018-11-23 13:11:04,568 INFO L268 TraceCheckUtils]: 34: Hoare quadruple {5744#true} {5854#(and (<= main_~n1~0 4) (<= main_~n0~0 0) (<= 2 main_~j1~0))} #70#return; {5854#(and (<= main_~n1~0 4) (<= main_~n0~0 0) (<= 2 main_~j1~0))} is VALID [2018-11-23 13:11:04,568 INFO L273 TraceCheckUtils]: 35: Hoare triple {5854#(and (<= main_~n1~0 4) (<= main_~n0~0 0) (<= 2 main_~j1~0))} #t~post7 := ~j1~0;~j1~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~k~0;~k~0 := #t~post8 - 1;havoc #t~post8; {5876#(and (<= main_~n1~0 4) (<= 3 main_~j1~0) (<= main_~n0~0 0))} is VALID [2018-11-23 13:11:04,569 INFO L273 TraceCheckUtils]: 36: Hoare triple {5876#(and (<= main_~n1~0 4) (<= 3 main_~j1~0) (<= main_~n0~0 0))} assume !!(~j1~0 < ~n0~0 + ~n1~0); {5876#(and (<= main_~n1~0 4) (<= 3 main_~j1~0) (<= main_~n0~0 0))} is VALID [2018-11-23 13:11:04,569 INFO L256 TraceCheckUtils]: 37: Hoare triple {5876#(and (<= main_~n1~0 4) (<= 3 main_~j1~0) (<= main_~n0~0 0))} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {5744#true} is VALID [2018-11-23 13:11:04,569 INFO L273 TraceCheckUtils]: 38: Hoare triple {5744#true} ~cond := #in~cond; {5744#true} is VALID [2018-11-23 13:11:04,569 INFO L273 TraceCheckUtils]: 39: Hoare triple {5744#true} assume !(0 == ~cond); {5744#true} is VALID [2018-11-23 13:11:04,570 INFO L273 TraceCheckUtils]: 40: Hoare triple {5744#true} assume true; {5744#true} is VALID [2018-11-23 13:11:04,570 INFO L268 TraceCheckUtils]: 41: Hoare quadruple {5744#true} {5876#(and (<= main_~n1~0 4) (<= 3 main_~j1~0) (<= main_~n0~0 0))} #70#return; {5876#(and (<= main_~n1~0 4) (<= 3 main_~j1~0) (<= main_~n0~0 0))} is VALID [2018-11-23 13:11:04,571 INFO L273 TraceCheckUtils]: 42: Hoare triple {5876#(and (<= main_~n1~0 4) (<= 3 main_~j1~0) (<= main_~n0~0 0))} #t~post7 := ~j1~0;~j1~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~k~0;~k~0 := #t~post8 - 1;havoc #t~post8; {5898#(and (<= main_~n1~0 4) (<= 4 main_~j1~0) (<= main_~n0~0 0))} is VALID [2018-11-23 13:11:04,572 INFO L273 TraceCheckUtils]: 43: Hoare triple {5898#(and (<= main_~n1~0 4) (<= 4 main_~j1~0) (<= main_~n0~0 0))} assume !!(~j1~0 < ~n0~0 + ~n1~0); {5745#false} is VALID [2018-11-23 13:11:04,572 INFO L256 TraceCheckUtils]: 44: Hoare triple {5745#false} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {5745#false} is VALID [2018-11-23 13:11:04,572 INFO L273 TraceCheckUtils]: 45: Hoare triple {5745#false} ~cond := #in~cond; {5745#false} is VALID [2018-11-23 13:11:04,573 INFO L273 TraceCheckUtils]: 46: Hoare triple {5745#false} assume 0 == ~cond; {5745#false} is VALID [2018-11-23 13:11:04,573 INFO L273 TraceCheckUtils]: 47: Hoare triple {5745#false} assume !false; {5745#false} is VALID [2018-11-23 13:11:04,576 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 34 proven. 10 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-11-23 13:11:04,594 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:11:04,595 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 26 [2018-11-23 13:11:04,595 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 48 [2018-11-23 13:11:04,595 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:11:04,595 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 26 states. [2018-11-23 13:11:04,657 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:11:04,657 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-11-23 13:11:04,657 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-11-23 13:11:04,658 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=509, Unknown=0, NotChecked=0, Total=650 [2018-11-23 13:11:04,658 INFO L87 Difference]: Start difference. First operand 59 states and 65 transitions. Second operand 26 states. [2018-11-23 13:11:05,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:11:05,986 INFO L93 Difference]: Finished difference Result 102 states and 119 transitions. [2018-11-23 13:11:05,986 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-23 13:11:05,986 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 48 [2018-11-23 13:11:05,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:11:05,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-23 13:11:05,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 65 transitions. [2018-11-23 13:11:05,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-23 13:11:05,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 65 transitions. [2018-11-23 13:11:05,989 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states and 65 transitions. [2018-11-23 13:11:06,063 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:11:06,066 INFO L225 Difference]: With dead ends: 102 [2018-11-23 13:11:06,066 INFO L226 Difference]: Without dead ends: 79 [2018-11-23 13:11:06,067 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 330 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=315, Invalid=1091, Unknown=0, NotChecked=0, Total=1406 [2018-11-23 13:11:06,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2018-11-23 13:11:06,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 60. [2018-11-23 13:11:06,234 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:11:06,234 INFO L82 GeneralOperation]: Start isEquivalent. First operand 79 states. Second operand 60 states. [2018-11-23 13:11:06,235 INFO L74 IsIncluded]: Start isIncluded. First operand 79 states. Second operand 60 states. [2018-11-23 13:11:06,235 INFO L87 Difference]: Start difference. First operand 79 states. Second operand 60 states. [2018-11-23 13:11:06,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:11:06,237 INFO L93 Difference]: Finished difference Result 79 states and 91 transitions. [2018-11-23 13:11:06,237 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 91 transitions. [2018-11-23 13:11:06,238 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:11:06,238 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:11:06,238 INFO L74 IsIncluded]: Start isIncluded. First operand 60 states. Second operand 79 states. [2018-11-23 13:11:06,238 INFO L87 Difference]: Start difference. First operand 60 states. Second operand 79 states. [2018-11-23 13:11:06,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:11:06,240 INFO L93 Difference]: Finished difference Result 79 states and 91 transitions. [2018-11-23 13:11:06,241 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 91 transitions. [2018-11-23 13:11:06,241 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:11:06,241 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:11:06,241 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:11:06,241 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:11:06,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-11-23 13:11:06,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 66 transitions. [2018-11-23 13:11:06,243 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 66 transitions. Word has length 48 [2018-11-23 13:11:06,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:11:06,243 INFO L480 AbstractCegarLoop]: Abstraction has 60 states and 66 transitions. [2018-11-23 13:11:06,243 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-11-23 13:11:06,244 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 66 transitions. [2018-11-23 13:11:06,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-11-23 13:11:06,244 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:11:06,244 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:11:06,245 INFO L423 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:11:06,245 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:11:06,245 INFO L82 PathProgramCache]: Analyzing trace with hash 439468878, now seen corresponding path program 4 times [2018-11-23 13:11:06,245 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:11:06,245 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:11:06,246 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:11:06,246 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:11:06,246 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:11:06,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:11:06,832 INFO L256 TraceCheckUtils]: 0: Hoare triple {6343#true} call ULTIMATE.init(); {6343#true} is VALID [2018-11-23 13:11:06,832 INFO L273 TraceCheckUtils]: 1: Hoare triple {6343#true} assume true; {6343#true} is VALID [2018-11-23 13:11:06,833 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {6343#true} {6343#true} #66#return; {6343#true} is VALID [2018-11-23 13:11:06,833 INFO L256 TraceCheckUtils]: 3: Hoare triple {6343#true} call #t~ret9 := main(); {6343#true} is VALID [2018-11-23 13:11:06,834 INFO L273 TraceCheckUtils]: 4: Hoare triple {6343#true} havoc ~n0~0;havoc ~n1~0;~i0~0 := 0;~k~0 := 0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n0~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~n1~0 := #t~nondet2;havoc #t~nondet2; {6345#(<= main_~i0~0 0)} is VALID [2018-11-23 13:11:06,834 INFO L273 TraceCheckUtils]: 5: Hoare triple {6345#(<= main_~i0~0 0)} assume !!(-1000000 <= ~n0~0 && ~n0~0 < 1000000); {6345#(<= main_~i0~0 0)} is VALID [2018-11-23 13:11:06,834 INFO L273 TraceCheckUtils]: 6: Hoare triple {6345#(<= main_~i0~0 0)} assume !!(-1000000 <= ~n1~0 && ~n1~0 < 1000000); {6345#(<= main_~i0~0 0)} is VALID [2018-11-23 13:11:06,835 INFO L273 TraceCheckUtils]: 7: Hoare triple {6345#(<= main_~i0~0 0)} assume !!(~i0~0 < ~n0~0);#t~post3 := ~i0~0;~i0~0 := 1 + #t~post3;havoc #t~post3;#t~post4 := ~k~0;~k~0 := 1 + #t~post4;havoc #t~post4; {6346#(<= main_~i0~0 1)} is VALID [2018-11-23 13:11:06,835 INFO L273 TraceCheckUtils]: 8: Hoare triple {6346#(<= main_~i0~0 1)} assume !(~i0~0 < ~n0~0); {6347#(<= main_~n0~0 1)} is VALID [2018-11-23 13:11:06,836 INFO L273 TraceCheckUtils]: 9: Hoare triple {6347#(<= main_~n0~0 1)} ~i1~0 := 0; {6348#(<= (+ main_~i1~0 main_~n0~0) 1)} is VALID [2018-11-23 13:11:06,836 INFO L273 TraceCheckUtils]: 10: Hoare triple {6348#(<= (+ main_~i1~0 main_~n0~0) 1)} assume !!(~i1~0 < ~n1~0);#t~post5 := ~i1~0;~i1~0 := 1 + #t~post5;havoc #t~post5;#t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {6349#(<= (+ main_~i1~0 main_~n0~0) 2)} is VALID [2018-11-23 13:11:06,837 INFO L273 TraceCheckUtils]: 11: Hoare triple {6349#(<= (+ main_~i1~0 main_~n0~0) 2)} assume !!(~i1~0 < ~n1~0);#t~post5 := ~i1~0;~i1~0 := 1 + #t~post5;havoc #t~post5;#t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {6350#(<= (+ main_~i1~0 main_~n0~0) 3)} is VALID [2018-11-23 13:11:06,838 INFO L273 TraceCheckUtils]: 12: Hoare triple {6350#(<= (+ main_~i1~0 main_~n0~0) 3)} assume !!(~i1~0 < ~n1~0);#t~post5 := ~i1~0;~i1~0 := 1 + #t~post5;havoc #t~post5;#t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {6351#(<= (+ main_~i1~0 main_~n0~0) 4)} is VALID [2018-11-23 13:11:06,839 INFO L273 TraceCheckUtils]: 13: Hoare triple {6351#(<= (+ main_~i1~0 main_~n0~0) 4)} assume !(~i1~0 < ~n1~0); {6352#(<= (+ main_~n0~0 main_~n1~0) 4)} is VALID [2018-11-23 13:11:06,840 INFO L273 TraceCheckUtils]: 14: Hoare triple {6352#(<= (+ main_~n0~0 main_~n1~0) 4)} ~j1~0 := 0; {6353#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 4))} is VALID [2018-11-23 13:11:06,840 INFO L273 TraceCheckUtils]: 15: Hoare triple {6353#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 4))} assume !!(~j1~0 < ~n0~0 + ~n1~0); {6353#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 4))} is VALID [2018-11-23 13:11:06,840 INFO L256 TraceCheckUtils]: 16: Hoare triple {6353#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 4))} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {6343#true} is VALID [2018-11-23 13:11:06,841 INFO L273 TraceCheckUtils]: 17: Hoare triple {6343#true} ~cond := #in~cond; {6343#true} is VALID [2018-11-23 13:11:06,841 INFO L273 TraceCheckUtils]: 18: Hoare triple {6343#true} assume !(0 == ~cond); {6343#true} is VALID [2018-11-23 13:11:06,841 INFO L273 TraceCheckUtils]: 19: Hoare triple {6343#true} assume true; {6343#true} is VALID [2018-11-23 13:11:06,842 INFO L268 TraceCheckUtils]: 20: Hoare quadruple {6343#true} {6353#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 4))} #70#return; {6353#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 4))} is VALID [2018-11-23 13:11:06,843 INFO L273 TraceCheckUtils]: 21: Hoare triple {6353#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 4))} #t~post7 := ~j1~0;~j1~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~k~0;~k~0 := #t~post8 - 1;havoc #t~post8; {6354#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 3))} is VALID [2018-11-23 13:11:06,843 INFO L273 TraceCheckUtils]: 22: Hoare triple {6354#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 3))} assume !!(~j1~0 < ~n0~0 + ~n1~0); {6354#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 3))} is VALID [2018-11-23 13:11:06,843 INFO L256 TraceCheckUtils]: 23: Hoare triple {6354#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 3))} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {6343#true} is VALID [2018-11-23 13:11:06,843 INFO L273 TraceCheckUtils]: 24: Hoare triple {6343#true} ~cond := #in~cond; {6343#true} is VALID [2018-11-23 13:11:06,844 INFO L273 TraceCheckUtils]: 25: Hoare triple {6343#true} assume !(0 == ~cond); {6343#true} is VALID [2018-11-23 13:11:06,844 INFO L273 TraceCheckUtils]: 26: Hoare triple {6343#true} assume true; {6343#true} is VALID [2018-11-23 13:11:06,844 INFO L268 TraceCheckUtils]: 27: Hoare quadruple {6343#true} {6354#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 3))} #70#return; {6354#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 3))} is VALID [2018-11-23 13:11:06,845 INFO L273 TraceCheckUtils]: 28: Hoare triple {6354#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 3))} #t~post7 := ~j1~0;~j1~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~k~0;~k~0 := #t~post8 - 1;havoc #t~post8; {6355#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 2))} is VALID [2018-11-23 13:11:06,845 INFO L273 TraceCheckUtils]: 29: Hoare triple {6355#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 2))} assume !!(~j1~0 < ~n0~0 + ~n1~0); {6355#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 2))} is VALID [2018-11-23 13:11:06,845 INFO L256 TraceCheckUtils]: 30: Hoare triple {6355#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 2))} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {6343#true} is VALID [2018-11-23 13:11:06,846 INFO L273 TraceCheckUtils]: 31: Hoare triple {6343#true} ~cond := #in~cond; {6343#true} is VALID [2018-11-23 13:11:06,846 INFO L273 TraceCheckUtils]: 32: Hoare triple {6343#true} assume !(0 == ~cond); {6343#true} is VALID [2018-11-23 13:11:06,846 INFO L273 TraceCheckUtils]: 33: Hoare triple {6343#true} assume true; {6343#true} is VALID [2018-11-23 13:11:06,847 INFO L268 TraceCheckUtils]: 34: Hoare quadruple {6343#true} {6355#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 2))} #70#return; {6355#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 2))} is VALID [2018-11-23 13:11:06,848 INFO L273 TraceCheckUtils]: 35: Hoare triple {6355#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 2))} #t~post7 := ~j1~0;~j1~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~k~0;~k~0 := #t~post8 - 1;havoc #t~post8; {6356#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 1))} is VALID [2018-11-23 13:11:06,848 INFO L273 TraceCheckUtils]: 36: Hoare triple {6356#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 1))} assume !!(~j1~0 < ~n0~0 + ~n1~0); {6356#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 1))} is VALID [2018-11-23 13:11:06,848 INFO L256 TraceCheckUtils]: 37: Hoare triple {6356#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 1))} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {6343#true} is VALID [2018-11-23 13:11:06,849 INFO L273 TraceCheckUtils]: 38: Hoare triple {6343#true} ~cond := #in~cond; {6343#true} is VALID [2018-11-23 13:11:06,849 INFO L273 TraceCheckUtils]: 39: Hoare triple {6343#true} assume !(0 == ~cond); {6343#true} is VALID [2018-11-23 13:11:06,849 INFO L273 TraceCheckUtils]: 40: Hoare triple {6343#true} assume true; {6343#true} is VALID [2018-11-23 13:11:06,850 INFO L268 TraceCheckUtils]: 41: Hoare quadruple {6343#true} {6356#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 1))} #70#return; {6356#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 1))} is VALID [2018-11-23 13:11:06,851 INFO L273 TraceCheckUtils]: 42: Hoare triple {6356#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 1))} #t~post7 := ~j1~0;~j1~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~k~0;~k~0 := #t~post8 - 1;havoc #t~post8; {6357#(<= (+ main_~n0~0 main_~n1~0) main_~j1~0)} is VALID [2018-11-23 13:11:06,851 INFO L273 TraceCheckUtils]: 43: Hoare triple {6357#(<= (+ main_~n0~0 main_~n1~0) main_~j1~0)} assume !!(~j1~0 < ~n0~0 + ~n1~0); {6344#false} is VALID [2018-11-23 13:11:06,852 INFO L256 TraceCheckUtils]: 44: Hoare triple {6344#false} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {6344#false} is VALID [2018-11-23 13:11:06,852 INFO L273 TraceCheckUtils]: 45: Hoare triple {6344#false} ~cond := #in~cond; {6344#false} is VALID [2018-11-23 13:11:06,852 INFO L273 TraceCheckUtils]: 46: Hoare triple {6344#false} assume 0 == ~cond; {6344#false} is VALID [2018-11-23 13:11:06,852 INFO L273 TraceCheckUtils]: 47: Hoare triple {6344#false} assume !false; {6344#false} is VALID [2018-11-23 13:11:06,855 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 34 proven. 7 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-11-23 13:11:06,855 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:11:06,855 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:11:06,864 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 13:11:06,879 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 13:11:06,879 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:11:06,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:11:06,890 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:11:07,240 INFO L256 TraceCheckUtils]: 0: Hoare triple {6343#true} call ULTIMATE.init(); {6343#true} is VALID [2018-11-23 13:11:07,240 INFO L273 TraceCheckUtils]: 1: Hoare triple {6343#true} assume true; {6343#true} is VALID [2018-11-23 13:11:07,241 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {6343#true} {6343#true} #66#return; {6343#true} is VALID [2018-11-23 13:11:07,241 INFO L256 TraceCheckUtils]: 3: Hoare triple {6343#true} call #t~ret9 := main(); {6343#true} is VALID [2018-11-23 13:11:07,242 INFO L273 TraceCheckUtils]: 4: Hoare triple {6343#true} havoc ~n0~0;havoc ~n1~0;~i0~0 := 0;~k~0 := 0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n0~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~n1~0 := #t~nondet2;havoc #t~nondet2; {6345#(<= main_~i0~0 0)} is VALID [2018-11-23 13:11:07,242 INFO L273 TraceCheckUtils]: 5: Hoare triple {6345#(<= main_~i0~0 0)} assume !!(-1000000 <= ~n0~0 && ~n0~0 < 1000000); {6345#(<= main_~i0~0 0)} is VALID [2018-11-23 13:11:07,243 INFO L273 TraceCheckUtils]: 6: Hoare triple {6345#(<= main_~i0~0 0)} assume !!(-1000000 <= ~n1~0 && ~n1~0 < 1000000); {6345#(<= main_~i0~0 0)} is VALID [2018-11-23 13:11:07,243 INFO L273 TraceCheckUtils]: 7: Hoare triple {6345#(<= main_~i0~0 0)} assume !!(~i0~0 < ~n0~0);#t~post3 := ~i0~0;~i0~0 := 1 + #t~post3;havoc #t~post3;#t~post4 := ~k~0;~k~0 := 1 + #t~post4;havoc #t~post4; {6346#(<= main_~i0~0 1)} is VALID [2018-11-23 13:11:07,244 INFO L273 TraceCheckUtils]: 8: Hoare triple {6346#(<= main_~i0~0 1)} assume !(~i0~0 < ~n0~0); {6347#(<= main_~n0~0 1)} is VALID [2018-11-23 13:11:07,244 INFO L273 TraceCheckUtils]: 9: Hoare triple {6347#(<= main_~n0~0 1)} ~i1~0 := 0; {6388#(and (<= main_~i1~0 0) (<= main_~n0~0 1))} is VALID [2018-11-23 13:11:07,245 INFO L273 TraceCheckUtils]: 10: Hoare triple {6388#(and (<= main_~i1~0 0) (<= main_~n0~0 1))} assume !!(~i1~0 < ~n1~0);#t~post5 := ~i1~0;~i1~0 := 1 + #t~post5;havoc #t~post5;#t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {6392#(and (<= main_~i1~0 1) (<= main_~n0~0 1))} is VALID [2018-11-23 13:11:07,245 INFO L273 TraceCheckUtils]: 11: Hoare triple {6392#(and (<= main_~i1~0 1) (<= main_~n0~0 1))} assume !!(~i1~0 < ~n1~0);#t~post5 := ~i1~0;~i1~0 := 1 + #t~post5;havoc #t~post5;#t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {6396#(and (<= main_~i1~0 2) (<= main_~n0~0 1))} is VALID [2018-11-23 13:11:07,246 INFO L273 TraceCheckUtils]: 12: Hoare triple {6396#(and (<= main_~i1~0 2) (<= main_~n0~0 1))} assume !!(~i1~0 < ~n1~0);#t~post5 := ~i1~0;~i1~0 := 1 + #t~post5;havoc #t~post5;#t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {6400#(and (<= main_~i1~0 3) (<= main_~n0~0 1))} is VALID [2018-11-23 13:11:07,247 INFO L273 TraceCheckUtils]: 13: Hoare triple {6400#(and (<= main_~i1~0 3) (<= main_~n0~0 1))} assume !(~i1~0 < ~n1~0); {6404#(and (<= main_~n1~0 3) (<= main_~n0~0 1))} is VALID [2018-11-23 13:11:07,248 INFO L273 TraceCheckUtils]: 14: Hoare triple {6404#(and (<= main_~n1~0 3) (<= main_~n0~0 1))} ~j1~0 := 0; {6408#(and (<= main_~n1~0 3) (<= 0 main_~j1~0) (<= main_~n0~0 1))} is VALID [2018-11-23 13:11:07,249 INFO L273 TraceCheckUtils]: 15: Hoare triple {6408#(and (<= main_~n1~0 3) (<= 0 main_~j1~0) (<= main_~n0~0 1))} assume !!(~j1~0 < ~n0~0 + ~n1~0); {6408#(and (<= main_~n1~0 3) (<= 0 main_~j1~0) (<= main_~n0~0 1))} is VALID [2018-11-23 13:11:07,249 INFO L256 TraceCheckUtils]: 16: Hoare triple {6408#(and (<= main_~n1~0 3) (<= 0 main_~j1~0) (<= main_~n0~0 1))} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {6343#true} is VALID [2018-11-23 13:11:07,249 INFO L273 TraceCheckUtils]: 17: Hoare triple {6343#true} ~cond := #in~cond; {6343#true} is VALID [2018-11-23 13:11:07,249 INFO L273 TraceCheckUtils]: 18: Hoare triple {6343#true} assume !(0 == ~cond); {6343#true} is VALID [2018-11-23 13:11:07,249 INFO L273 TraceCheckUtils]: 19: Hoare triple {6343#true} assume true; {6343#true} is VALID [2018-11-23 13:11:07,250 INFO L268 TraceCheckUtils]: 20: Hoare quadruple {6343#true} {6408#(and (<= main_~n1~0 3) (<= 0 main_~j1~0) (<= main_~n0~0 1))} #70#return; {6408#(and (<= main_~n1~0 3) (<= 0 main_~j1~0) (<= main_~n0~0 1))} is VALID [2018-11-23 13:11:07,251 INFO L273 TraceCheckUtils]: 21: Hoare triple {6408#(and (<= main_~n1~0 3) (<= 0 main_~j1~0) (<= main_~n0~0 1))} #t~post7 := ~j1~0;~j1~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~k~0;~k~0 := #t~post8 - 1;havoc #t~post8; {6430#(and (<= 1 main_~j1~0) (<= main_~n1~0 3) (<= main_~n0~0 1))} is VALID [2018-11-23 13:11:07,252 INFO L273 TraceCheckUtils]: 22: Hoare triple {6430#(and (<= 1 main_~j1~0) (<= main_~n1~0 3) (<= main_~n0~0 1))} assume !!(~j1~0 < ~n0~0 + ~n1~0); {6430#(and (<= 1 main_~j1~0) (<= main_~n1~0 3) (<= main_~n0~0 1))} is VALID [2018-11-23 13:11:07,252 INFO L256 TraceCheckUtils]: 23: Hoare triple {6430#(and (<= 1 main_~j1~0) (<= main_~n1~0 3) (<= main_~n0~0 1))} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {6343#true} is VALID [2018-11-23 13:11:07,252 INFO L273 TraceCheckUtils]: 24: Hoare triple {6343#true} ~cond := #in~cond; {6343#true} is VALID [2018-11-23 13:11:07,252 INFO L273 TraceCheckUtils]: 25: Hoare triple {6343#true} assume !(0 == ~cond); {6343#true} is VALID [2018-11-23 13:11:07,252 INFO L273 TraceCheckUtils]: 26: Hoare triple {6343#true} assume true; {6343#true} is VALID [2018-11-23 13:11:07,253 INFO L268 TraceCheckUtils]: 27: Hoare quadruple {6343#true} {6430#(and (<= 1 main_~j1~0) (<= main_~n1~0 3) (<= main_~n0~0 1))} #70#return; {6430#(and (<= 1 main_~j1~0) (<= main_~n1~0 3) (<= main_~n0~0 1))} is VALID [2018-11-23 13:11:07,254 INFO L273 TraceCheckUtils]: 28: Hoare triple {6430#(and (<= 1 main_~j1~0) (<= main_~n1~0 3) (<= main_~n0~0 1))} #t~post7 := ~j1~0;~j1~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~k~0;~k~0 := #t~post8 - 1;havoc #t~post8; {6452#(and (<= main_~n1~0 3) (<= main_~n0~0 1) (<= 2 main_~j1~0))} is VALID [2018-11-23 13:11:07,254 INFO L273 TraceCheckUtils]: 29: Hoare triple {6452#(and (<= main_~n1~0 3) (<= main_~n0~0 1) (<= 2 main_~j1~0))} assume !!(~j1~0 < ~n0~0 + ~n1~0); {6452#(and (<= main_~n1~0 3) (<= main_~n0~0 1) (<= 2 main_~j1~0))} is VALID [2018-11-23 13:11:07,255 INFO L256 TraceCheckUtils]: 30: Hoare triple {6452#(and (<= main_~n1~0 3) (<= main_~n0~0 1) (<= 2 main_~j1~0))} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {6343#true} is VALID [2018-11-23 13:11:07,255 INFO L273 TraceCheckUtils]: 31: Hoare triple {6343#true} ~cond := #in~cond; {6343#true} is VALID [2018-11-23 13:11:07,255 INFO L273 TraceCheckUtils]: 32: Hoare triple {6343#true} assume !(0 == ~cond); {6343#true} is VALID [2018-11-23 13:11:07,255 INFO L273 TraceCheckUtils]: 33: Hoare triple {6343#true} assume true; {6343#true} is VALID [2018-11-23 13:11:07,256 INFO L268 TraceCheckUtils]: 34: Hoare quadruple {6343#true} {6452#(and (<= main_~n1~0 3) (<= main_~n0~0 1) (<= 2 main_~j1~0))} #70#return; {6452#(and (<= main_~n1~0 3) (<= main_~n0~0 1) (<= 2 main_~j1~0))} is VALID [2018-11-23 13:11:07,257 INFO L273 TraceCheckUtils]: 35: Hoare triple {6452#(and (<= main_~n1~0 3) (<= main_~n0~0 1) (<= 2 main_~j1~0))} #t~post7 := ~j1~0;~j1~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~k~0;~k~0 := #t~post8 - 1;havoc #t~post8; {6474#(and (<= main_~n1~0 3) (<= 3 main_~j1~0) (<= main_~n0~0 1))} is VALID [2018-11-23 13:11:07,258 INFO L273 TraceCheckUtils]: 36: Hoare triple {6474#(and (<= main_~n1~0 3) (<= 3 main_~j1~0) (<= main_~n0~0 1))} assume !!(~j1~0 < ~n0~0 + ~n1~0); {6474#(and (<= main_~n1~0 3) (<= 3 main_~j1~0) (<= main_~n0~0 1))} is VALID [2018-11-23 13:11:07,258 INFO L256 TraceCheckUtils]: 37: Hoare triple {6474#(and (<= main_~n1~0 3) (<= 3 main_~j1~0) (<= main_~n0~0 1))} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {6343#true} is VALID [2018-11-23 13:11:07,258 INFO L273 TraceCheckUtils]: 38: Hoare triple {6343#true} ~cond := #in~cond; {6343#true} is VALID [2018-11-23 13:11:07,258 INFO L273 TraceCheckUtils]: 39: Hoare triple {6343#true} assume !(0 == ~cond); {6343#true} is VALID [2018-11-23 13:11:07,259 INFO L273 TraceCheckUtils]: 40: Hoare triple {6343#true} assume true; {6343#true} is VALID [2018-11-23 13:11:07,259 INFO L268 TraceCheckUtils]: 41: Hoare quadruple {6343#true} {6474#(and (<= main_~n1~0 3) (<= 3 main_~j1~0) (<= main_~n0~0 1))} #70#return; {6474#(and (<= main_~n1~0 3) (<= 3 main_~j1~0) (<= main_~n0~0 1))} is VALID [2018-11-23 13:11:07,260 INFO L273 TraceCheckUtils]: 42: Hoare triple {6474#(and (<= main_~n1~0 3) (<= 3 main_~j1~0) (<= main_~n0~0 1))} #t~post7 := ~j1~0;~j1~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~k~0;~k~0 := #t~post8 - 1;havoc #t~post8; {6496#(and (<= main_~n1~0 3) (<= 4 main_~j1~0) (<= main_~n0~0 1))} is VALID [2018-11-23 13:11:07,261 INFO L273 TraceCheckUtils]: 43: Hoare triple {6496#(and (<= main_~n1~0 3) (<= 4 main_~j1~0) (<= main_~n0~0 1))} assume !!(~j1~0 < ~n0~0 + ~n1~0); {6344#false} is VALID [2018-11-23 13:11:07,261 INFO L256 TraceCheckUtils]: 44: Hoare triple {6344#false} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {6344#false} is VALID [2018-11-23 13:11:07,262 INFO L273 TraceCheckUtils]: 45: Hoare triple {6344#false} ~cond := #in~cond; {6344#false} is VALID [2018-11-23 13:11:07,262 INFO L273 TraceCheckUtils]: 46: Hoare triple {6344#false} assume 0 == ~cond; {6344#false} is VALID [2018-11-23 13:11:07,262 INFO L273 TraceCheckUtils]: 47: Hoare triple {6344#false} assume !false; {6344#false} is VALID [2018-11-23 13:11:07,265 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 34 proven. 7 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-11-23 13:11:07,283 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:11:07,284 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 25 [2018-11-23 13:11:07,284 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 48 [2018-11-23 13:11:07,284 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:11:07,285 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 25 states. [2018-11-23 13:11:07,345 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:11:07,345 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-11-23 13:11:07,345 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-11-23 13:11:07,346 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=474, Unknown=0, NotChecked=0, Total=600 [2018-11-23 13:11:07,346 INFO L87 Difference]: Start difference. First operand 60 states and 66 transitions. Second operand 25 states. [2018-11-23 13:11:09,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:11:09,171 INFO L93 Difference]: Finished difference Result 121 states and 144 transitions. [2018-11-23 13:11:09,171 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-11-23 13:11:09,171 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 48 [2018-11-23 13:11:09,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:11:09,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-11-23 13:11:09,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 78 transitions. [2018-11-23 13:11:09,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-11-23 13:11:09,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 78 transitions. [2018-11-23 13:11:09,175 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 20 states and 78 transitions. [2018-11-23 13:11:09,276 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-23 13:11:09,277 INFO L225 Difference]: With dead ends: 121 [2018-11-23 13:11:09,278 INFO L226 Difference]: Without dead ends: 98 [2018-11-23 13:11:09,279 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 398 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=351, Invalid=1289, Unknown=0, NotChecked=0, Total=1640 [2018-11-23 13:11:09,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2018-11-23 13:11:09,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 60. [2018-11-23 13:11:09,576 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:11:09,577 INFO L82 GeneralOperation]: Start isEquivalent. First operand 98 states. Second operand 60 states. [2018-11-23 13:11:09,577 INFO L74 IsIncluded]: Start isIncluded. First operand 98 states. Second operand 60 states. [2018-11-23 13:11:09,577 INFO L87 Difference]: Start difference. First operand 98 states. Second operand 60 states. [2018-11-23 13:11:09,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:11:09,579 INFO L93 Difference]: Finished difference Result 98 states and 116 transitions. [2018-11-23 13:11:09,580 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 116 transitions. [2018-11-23 13:11:09,580 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:11:09,580 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:11:09,580 INFO L74 IsIncluded]: Start isIncluded. First operand 60 states. Second operand 98 states. [2018-11-23 13:11:09,581 INFO L87 Difference]: Start difference. First operand 60 states. Second operand 98 states. [2018-11-23 13:11:09,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:11:09,583 INFO L93 Difference]: Finished difference Result 98 states and 116 transitions. [2018-11-23 13:11:09,584 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 116 transitions. [2018-11-23 13:11:09,584 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:11:09,584 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:11:09,584 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:11:09,585 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:11:09,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-11-23 13:11:09,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 66 transitions. [2018-11-23 13:11:09,586 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 66 transitions. Word has length 48 [2018-11-23 13:11:09,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:11:09,586 INFO L480 AbstractCegarLoop]: Abstraction has 60 states and 66 transitions. [2018-11-23 13:11:09,586 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-11-23 13:11:09,586 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 66 transitions. [2018-11-23 13:11:09,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-11-23 13:11:09,587 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:11:09,587 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:11:09,587 INFO L423 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:11:09,588 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:11:09,588 INFO L82 PathProgramCache]: Analyzing trace with hash -1501538321, now seen corresponding path program 5 times [2018-11-23 13:11:09,588 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:11:09,588 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:11:09,589 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:11:09,589 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:11:09,589 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:11:09,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:11:09,805 INFO L256 TraceCheckUtils]: 0: Hoare triple {7020#true} call ULTIMATE.init(); {7020#true} is VALID [2018-11-23 13:11:09,805 INFO L273 TraceCheckUtils]: 1: Hoare triple {7020#true} assume true; {7020#true} is VALID [2018-11-23 13:11:09,805 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {7020#true} {7020#true} #66#return; {7020#true} is VALID [2018-11-23 13:11:09,806 INFO L256 TraceCheckUtils]: 3: Hoare triple {7020#true} call #t~ret9 := main(); {7020#true} is VALID [2018-11-23 13:11:09,807 INFO L273 TraceCheckUtils]: 4: Hoare triple {7020#true} havoc ~n0~0;havoc ~n1~0;~i0~0 := 0;~k~0 := 0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n0~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~n1~0 := #t~nondet2;havoc #t~nondet2; {7022#(<= main_~i0~0 0)} is VALID [2018-11-23 13:11:09,807 INFO L273 TraceCheckUtils]: 5: Hoare triple {7022#(<= main_~i0~0 0)} assume !!(-1000000 <= ~n0~0 && ~n0~0 < 1000000); {7022#(<= main_~i0~0 0)} is VALID [2018-11-23 13:11:09,808 INFO L273 TraceCheckUtils]: 6: Hoare triple {7022#(<= main_~i0~0 0)} assume !!(-1000000 <= ~n1~0 && ~n1~0 < 1000000); {7022#(<= main_~i0~0 0)} is VALID [2018-11-23 13:11:09,809 INFO L273 TraceCheckUtils]: 7: Hoare triple {7022#(<= main_~i0~0 0)} assume !!(~i0~0 < ~n0~0);#t~post3 := ~i0~0;~i0~0 := 1 + #t~post3;havoc #t~post3;#t~post4 := ~k~0;~k~0 := 1 + #t~post4;havoc #t~post4; {7023#(<= main_~i0~0 1)} is VALID [2018-11-23 13:11:09,809 INFO L273 TraceCheckUtils]: 8: Hoare triple {7023#(<= main_~i0~0 1)} assume !!(~i0~0 < ~n0~0);#t~post3 := ~i0~0;~i0~0 := 1 + #t~post3;havoc #t~post3;#t~post4 := ~k~0;~k~0 := 1 + #t~post4;havoc #t~post4; {7024#(<= main_~i0~0 2)} is VALID [2018-11-23 13:11:09,810 INFO L273 TraceCheckUtils]: 9: Hoare triple {7024#(<= main_~i0~0 2)} assume !(~i0~0 < ~n0~0); {7025#(<= main_~n0~0 2)} is VALID [2018-11-23 13:11:09,811 INFO L273 TraceCheckUtils]: 10: Hoare triple {7025#(<= main_~n0~0 2)} ~i1~0 := 0; {7026#(<= (+ main_~i1~0 main_~n0~0) 2)} is VALID [2018-11-23 13:11:09,812 INFO L273 TraceCheckUtils]: 11: Hoare triple {7026#(<= (+ main_~i1~0 main_~n0~0) 2)} assume !!(~i1~0 < ~n1~0);#t~post5 := ~i1~0;~i1~0 := 1 + #t~post5;havoc #t~post5;#t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {7027#(<= (+ main_~i1~0 main_~n0~0) 3)} is VALID [2018-11-23 13:11:09,813 INFO L273 TraceCheckUtils]: 12: Hoare triple {7027#(<= (+ main_~i1~0 main_~n0~0) 3)} assume !!(~i1~0 < ~n1~0);#t~post5 := ~i1~0;~i1~0 := 1 + #t~post5;havoc #t~post5;#t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {7028#(<= (+ main_~i1~0 main_~n0~0) 4)} is VALID [2018-11-23 13:11:09,813 INFO L273 TraceCheckUtils]: 13: Hoare triple {7028#(<= (+ main_~i1~0 main_~n0~0) 4)} assume !(~i1~0 < ~n1~0); {7029#(<= (+ main_~n0~0 main_~n1~0) 4)} is VALID [2018-11-23 13:11:09,814 INFO L273 TraceCheckUtils]: 14: Hoare triple {7029#(<= (+ main_~n0~0 main_~n1~0) 4)} ~j1~0 := 0; {7030#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 4))} is VALID [2018-11-23 13:11:09,815 INFO L273 TraceCheckUtils]: 15: Hoare triple {7030#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 4))} assume !!(~j1~0 < ~n0~0 + ~n1~0); {7030#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 4))} is VALID [2018-11-23 13:11:09,815 INFO L256 TraceCheckUtils]: 16: Hoare triple {7030#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 4))} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {7020#true} is VALID [2018-11-23 13:11:09,815 INFO L273 TraceCheckUtils]: 17: Hoare triple {7020#true} ~cond := #in~cond; {7020#true} is VALID [2018-11-23 13:11:09,815 INFO L273 TraceCheckUtils]: 18: Hoare triple {7020#true} assume !(0 == ~cond); {7020#true} is VALID [2018-11-23 13:11:09,816 INFO L273 TraceCheckUtils]: 19: Hoare triple {7020#true} assume true; {7020#true} is VALID [2018-11-23 13:11:09,817 INFO L268 TraceCheckUtils]: 20: Hoare quadruple {7020#true} {7030#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 4))} #70#return; {7030#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 4))} is VALID [2018-11-23 13:11:09,818 INFO L273 TraceCheckUtils]: 21: Hoare triple {7030#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 4))} #t~post7 := ~j1~0;~j1~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~k~0;~k~0 := #t~post8 - 1;havoc #t~post8; {7031#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 3))} is VALID [2018-11-23 13:11:09,818 INFO L273 TraceCheckUtils]: 22: Hoare triple {7031#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 3))} assume !!(~j1~0 < ~n0~0 + ~n1~0); {7031#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 3))} is VALID [2018-11-23 13:11:09,818 INFO L256 TraceCheckUtils]: 23: Hoare triple {7031#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 3))} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {7020#true} is VALID [2018-11-23 13:11:09,818 INFO L273 TraceCheckUtils]: 24: Hoare triple {7020#true} ~cond := #in~cond; {7020#true} is VALID [2018-11-23 13:11:09,818 INFO L273 TraceCheckUtils]: 25: Hoare triple {7020#true} assume !(0 == ~cond); {7020#true} is VALID [2018-11-23 13:11:09,818 INFO L273 TraceCheckUtils]: 26: Hoare triple {7020#true} assume true; {7020#true} is VALID [2018-11-23 13:11:09,819 INFO L268 TraceCheckUtils]: 27: Hoare quadruple {7020#true} {7031#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 3))} #70#return; {7031#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 3))} is VALID [2018-11-23 13:11:09,820 INFO L273 TraceCheckUtils]: 28: Hoare triple {7031#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 3))} #t~post7 := ~j1~0;~j1~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~k~0;~k~0 := #t~post8 - 1;havoc #t~post8; {7032#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 2))} is VALID [2018-11-23 13:11:09,821 INFO L273 TraceCheckUtils]: 29: Hoare triple {7032#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 2))} assume !!(~j1~0 < ~n0~0 + ~n1~0); {7032#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 2))} is VALID [2018-11-23 13:11:09,821 INFO L256 TraceCheckUtils]: 30: Hoare triple {7032#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 2))} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {7020#true} is VALID [2018-11-23 13:11:09,821 INFO L273 TraceCheckUtils]: 31: Hoare triple {7020#true} ~cond := #in~cond; {7020#true} is VALID [2018-11-23 13:11:09,821 INFO L273 TraceCheckUtils]: 32: Hoare triple {7020#true} assume !(0 == ~cond); {7020#true} is VALID [2018-11-23 13:11:09,822 INFO L273 TraceCheckUtils]: 33: Hoare triple {7020#true} assume true; {7020#true} is VALID [2018-11-23 13:11:09,823 INFO L268 TraceCheckUtils]: 34: Hoare quadruple {7020#true} {7032#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 2))} #70#return; {7032#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 2))} is VALID [2018-11-23 13:11:09,823 INFO L273 TraceCheckUtils]: 35: Hoare triple {7032#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 2))} #t~post7 := ~j1~0;~j1~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~k~0;~k~0 := #t~post8 - 1;havoc #t~post8; {7033#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 1))} is VALID [2018-11-23 13:11:09,824 INFO L273 TraceCheckUtils]: 36: Hoare triple {7033#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 1))} assume !!(~j1~0 < ~n0~0 + ~n1~0); {7033#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 1))} is VALID [2018-11-23 13:11:09,824 INFO L256 TraceCheckUtils]: 37: Hoare triple {7033#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 1))} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {7020#true} is VALID [2018-11-23 13:11:09,824 INFO L273 TraceCheckUtils]: 38: Hoare triple {7020#true} ~cond := #in~cond; {7020#true} is VALID [2018-11-23 13:11:09,824 INFO L273 TraceCheckUtils]: 39: Hoare triple {7020#true} assume !(0 == ~cond); {7020#true} is VALID [2018-11-23 13:11:09,824 INFO L273 TraceCheckUtils]: 40: Hoare triple {7020#true} assume true; {7020#true} is VALID [2018-11-23 13:11:09,825 INFO L268 TraceCheckUtils]: 41: Hoare quadruple {7020#true} {7033#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 1))} #70#return; {7033#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 1))} is VALID [2018-11-23 13:11:09,826 INFO L273 TraceCheckUtils]: 42: Hoare triple {7033#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 1))} #t~post7 := ~j1~0;~j1~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~k~0;~k~0 := #t~post8 - 1;havoc #t~post8; {7034#(<= (+ main_~n0~0 main_~n1~0) main_~j1~0)} is VALID [2018-11-23 13:11:09,826 INFO L273 TraceCheckUtils]: 43: Hoare triple {7034#(<= (+ main_~n0~0 main_~n1~0) main_~j1~0)} assume !!(~j1~0 < ~n0~0 + ~n1~0); {7021#false} is VALID [2018-11-23 13:11:09,826 INFO L256 TraceCheckUtils]: 44: Hoare triple {7021#false} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {7021#false} is VALID [2018-11-23 13:11:09,827 INFO L273 TraceCheckUtils]: 45: Hoare triple {7021#false} ~cond := #in~cond; {7021#false} is VALID [2018-11-23 13:11:09,827 INFO L273 TraceCheckUtils]: 46: Hoare triple {7021#false} assume 0 == ~cond; {7021#false} is VALID [2018-11-23 13:11:09,827 INFO L273 TraceCheckUtils]: 47: Hoare triple {7021#false} assume !false; {7021#false} is VALID [2018-11-23 13:11:09,829 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 34 proven. 6 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-11-23 13:11:09,830 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:11:09,830 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:11:09,838 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 13:11:09,870 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2018-11-23 13:11:09,870 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:11:09,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:11:09,887 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:11:10,206 INFO L256 TraceCheckUtils]: 0: Hoare triple {7020#true} call ULTIMATE.init(); {7020#true} is VALID [2018-11-23 13:11:10,207 INFO L273 TraceCheckUtils]: 1: Hoare triple {7020#true} assume true; {7020#true} is VALID [2018-11-23 13:11:10,207 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {7020#true} {7020#true} #66#return; {7020#true} is VALID [2018-11-23 13:11:10,207 INFO L256 TraceCheckUtils]: 3: Hoare triple {7020#true} call #t~ret9 := main(); {7020#true} is VALID [2018-11-23 13:11:10,208 INFO L273 TraceCheckUtils]: 4: Hoare triple {7020#true} havoc ~n0~0;havoc ~n1~0;~i0~0 := 0;~k~0 := 0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n0~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~n1~0 := #t~nondet2;havoc #t~nondet2; {7022#(<= main_~i0~0 0)} is VALID [2018-11-23 13:11:10,208 INFO L273 TraceCheckUtils]: 5: Hoare triple {7022#(<= main_~i0~0 0)} assume !!(-1000000 <= ~n0~0 && ~n0~0 < 1000000); {7022#(<= main_~i0~0 0)} is VALID [2018-11-23 13:11:10,208 INFO L273 TraceCheckUtils]: 6: Hoare triple {7022#(<= main_~i0~0 0)} assume !!(-1000000 <= ~n1~0 && ~n1~0 < 1000000); {7022#(<= main_~i0~0 0)} is VALID [2018-11-23 13:11:10,209 INFO L273 TraceCheckUtils]: 7: Hoare triple {7022#(<= main_~i0~0 0)} assume !!(~i0~0 < ~n0~0);#t~post3 := ~i0~0;~i0~0 := 1 + #t~post3;havoc #t~post3;#t~post4 := ~k~0;~k~0 := 1 + #t~post4;havoc #t~post4; {7023#(<= main_~i0~0 1)} is VALID [2018-11-23 13:11:10,210 INFO L273 TraceCheckUtils]: 8: Hoare triple {7023#(<= main_~i0~0 1)} assume !!(~i0~0 < ~n0~0);#t~post3 := ~i0~0;~i0~0 := 1 + #t~post3;havoc #t~post3;#t~post4 := ~k~0;~k~0 := 1 + #t~post4;havoc #t~post4; {7024#(<= main_~i0~0 2)} is VALID [2018-11-23 13:11:10,210 INFO L273 TraceCheckUtils]: 9: Hoare triple {7024#(<= main_~i0~0 2)} assume !(~i0~0 < ~n0~0); {7025#(<= main_~n0~0 2)} is VALID [2018-11-23 13:11:10,211 INFO L273 TraceCheckUtils]: 10: Hoare triple {7025#(<= main_~n0~0 2)} ~i1~0 := 0; {7068#(and (<= main_~n0~0 2) (<= main_~i1~0 0))} is VALID [2018-11-23 13:11:10,212 INFO L273 TraceCheckUtils]: 11: Hoare triple {7068#(and (<= main_~n0~0 2) (<= main_~i1~0 0))} assume !!(~i1~0 < ~n1~0);#t~post5 := ~i1~0;~i1~0 := 1 + #t~post5;havoc #t~post5;#t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {7072#(and (<= main_~n0~0 2) (<= main_~i1~0 1))} is VALID [2018-11-23 13:11:10,213 INFO L273 TraceCheckUtils]: 12: Hoare triple {7072#(and (<= main_~n0~0 2) (<= main_~i1~0 1))} assume !!(~i1~0 < ~n1~0);#t~post5 := ~i1~0;~i1~0 := 1 + #t~post5;havoc #t~post5;#t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {7076#(and (<= main_~n0~0 2) (<= main_~i1~0 2))} is VALID [2018-11-23 13:11:10,214 INFO L273 TraceCheckUtils]: 13: Hoare triple {7076#(and (<= main_~n0~0 2) (<= main_~i1~0 2))} assume !(~i1~0 < ~n1~0); {7080#(and (<= main_~n0~0 2) (<= main_~n1~0 2))} is VALID [2018-11-23 13:11:10,215 INFO L273 TraceCheckUtils]: 14: Hoare triple {7080#(and (<= main_~n0~0 2) (<= main_~n1~0 2))} ~j1~0 := 0; {7084#(and (<= main_~n0~0 2) (<= main_~n1~0 2) (<= 0 main_~j1~0))} is VALID [2018-11-23 13:11:10,215 INFO L273 TraceCheckUtils]: 15: Hoare triple {7084#(and (<= main_~n0~0 2) (<= main_~n1~0 2) (<= 0 main_~j1~0))} assume !!(~j1~0 < ~n0~0 + ~n1~0); {7084#(and (<= main_~n0~0 2) (<= main_~n1~0 2) (<= 0 main_~j1~0))} is VALID [2018-11-23 13:11:10,216 INFO L256 TraceCheckUtils]: 16: Hoare triple {7084#(and (<= main_~n0~0 2) (<= main_~n1~0 2) (<= 0 main_~j1~0))} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {7020#true} is VALID [2018-11-23 13:11:10,216 INFO L273 TraceCheckUtils]: 17: Hoare triple {7020#true} ~cond := #in~cond; {7020#true} is VALID [2018-11-23 13:11:10,216 INFO L273 TraceCheckUtils]: 18: Hoare triple {7020#true} assume !(0 == ~cond); {7020#true} is VALID [2018-11-23 13:11:10,217 INFO L273 TraceCheckUtils]: 19: Hoare triple {7020#true} assume true; {7020#true} is VALID [2018-11-23 13:11:10,237 INFO L268 TraceCheckUtils]: 20: Hoare quadruple {7020#true} {7084#(and (<= main_~n0~0 2) (<= main_~n1~0 2) (<= 0 main_~j1~0))} #70#return; {7084#(and (<= main_~n0~0 2) (<= main_~n1~0 2) (<= 0 main_~j1~0))} is VALID [2018-11-23 13:11:10,240 INFO L273 TraceCheckUtils]: 21: Hoare triple {7084#(and (<= main_~n0~0 2) (<= main_~n1~0 2) (<= 0 main_~j1~0))} #t~post7 := ~j1~0;~j1~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~k~0;~k~0 := #t~post8 - 1;havoc #t~post8; {7106#(and (<= 1 main_~j1~0) (<= main_~n0~0 2) (<= main_~n1~0 2))} is VALID [2018-11-23 13:11:10,241 INFO L273 TraceCheckUtils]: 22: Hoare triple {7106#(and (<= 1 main_~j1~0) (<= main_~n0~0 2) (<= main_~n1~0 2))} assume !!(~j1~0 < ~n0~0 + ~n1~0); {7106#(and (<= 1 main_~j1~0) (<= main_~n0~0 2) (<= main_~n1~0 2))} is VALID [2018-11-23 13:11:10,241 INFO L256 TraceCheckUtils]: 23: Hoare triple {7106#(and (<= 1 main_~j1~0) (<= main_~n0~0 2) (<= main_~n1~0 2))} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {7020#true} is VALID [2018-11-23 13:11:10,241 INFO L273 TraceCheckUtils]: 24: Hoare triple {7020#true} ~cond := #in~cond; {7020#true} is VALID [2018-11-23 13:11:10,241 INFO L273 TraceCheckUtils]: 25: Hoare triple {7020#true} assume !(0 == ~cond); {7020#true} is VALID [2018-11-23 13:11:10,241 INFO L273 TraceCheckUtils]: 26: Hoare triple {7020#true} assume true; {7020#true} is VALID [2018-11-23 13:11:10,242 INFO L268 TraceCheckUtils]: 27: Hoare quadruple {7020#true} {7106#(and (<= 1 main_~j1~0) (<= main_~n0~0 2) (<= main_~n1~0 2))} #70#return; {7106#(and (<= 1 main_~j1~0) (<= main_~n0~0 2) (<= main_~n1~0 2))} is VALID [2018-11-23 13:11:10,244 INFO L273 TraceCheckUtils]: 28: Hoare triple {7106#(and (<= 1 main_~j1~0) (<= main_~n0~0 2) (<= main_~n1~0 2))} #t~post7 := ~j1~0;~j1~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~k~0;~k~0 := #t~post8 - 1;havoc #t~post8; {7128#(and (<= main_~n0~0 2) (<= main_~n1~0 2) (<= 2 main_~j1~0))} is VALID [2018-11-23 13:11:10,244 INFO L273 TraceCheckUtils]: 29: Hoare triple {7128#(and (<= main_~n0~0 2) (<= main_~n1~0 2) (<= 2 main_~j1~0))} assume !!(~j1~0 < ~n0~0 + ~n1~0); {7128#(and (<= main_~n0~0 2) (<= main_~n1~0 2) (<= 2 main_~j1~0))} is VALID [2018-11-23 13:11:10,244 INFO L256 TraceCheckUtils]: 30: Hoare triple {7128#(and (<= main_~n0~0 2) (<= main_~n1~0 2) (<= 2 main_~j1~0))} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {7020#true} is VALID [2018-11-23 13:11:10,245 INFO L273 TraceCheckUtils]: 31: Hoare triple {7020#true} ~cond := #in~cond; {7020#true} is VALID [2018-11-23 13:11:10,245 INFO L273 TraceCheckUtils]: 32: Hoare triple {7020#true} assume !(0 == ~cond); {7020#true} is VALID [2018-11-23 13:11:10,245 INFO L273 TraceCheckUtils]: 33: Hoare triple {7020#true} assume true; {7020#true} is VALID [2018-11-23 13:11:10,246 INFO L268 TraceCheckUtils]: 34: Hoare quadruple {7020#true} {7128#(and (<= main_~n0~0 2) (<= main_~n1~0 2) (<= 2 main_~j1~0))} #70#return; {7128#(and (<= main_~n0~0 2) (<= main_~n1~0 2) (<= 2 main_~j1~0))} is VALID [2018-11-23 13:11:10,246 INFO L273 TraceCheckUtils]: 35: Hoare triple {7128#(and (<= main_~n0~0 2) (<= main_~n1~0 2) (<= 2 main_~j1~0))} #t~post7 := ~j1~0;~j1~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~k~0;~k~0 := #t~post8 - 1;havoc #t~post8; {7150#(and (<= main_~n0~0 2) (<= main_~n1~0 2) (<= 3 main_~j1~0))} is VALID [2018-11-23 13:11:10,247 INFO L273 TraceCheckUtils]: 36: Hoare triple {7150#(and (<= main_~n0~0 2) (<= main_~n1~0 2) (<= 3 main_~j1~0))} assume !!(~j1~0 < ~n0~0 + ~n1~0); {7150#(and (<= main_~n0~0 2) (<= main_~n1~0 2) (<= 3 main_~j1~0))} is VALID [2018-11-23 13:11:10,247 INFO L256 TraceCheckUtils]: 37: Hoare triple {7150#(and (<= main_~n0~0 2) (<= main_~n1~0 2) (<= 3 main_~j1~0))} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {7020#true} is VALID [2018-11-23 13:11:10,247 INFO L273 TraceCheckUtils]: 38: Hoare triple {7020#true} ~cond := #in~cond; {7020#true} is VALID [2018-11-23 13:11:10,247 INFO L273 TraceCheckUtils]: 39: Hoare triple {7020#true} assume !(0 == ~cond); {7020#true} is VALID [2018-11-23 13:11:10,247 INFO L273 TraceCheckUtils]: 40: Hoare triple {7020#true} assume true; {7020#true} is VALID [2018-11-23 13:11:10,248 INFO L268 TraceCheckUtils]: 41: Hoare quadruple {7020#true} {7150#(and (<= main_~n0~0 2) (<= main_~n1~0 2) (<= 3 main_~j1~0))} #70#return; {7150#(and (<= main_~n0~0 2) (<= main_~n1~0 2) (<= 3 main_~j1~0))} is VALID [2018-11-23 13:11:10,249 INFO L273 TraceCheckUtils]: 42: Hoare triple {7150#(and (<= main_~n0~0 2) (<= main_~n1~0 2) (<= 3 main_~j1~0))} #t~post7 := ~j1~0;~j1~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~k~0;~k~0 := #t~post8 - 1;havoc #t~post8; {7172#(and (<= main_~n0~0 2) (<= main_~n1~0 2) (<= 4 main_~j1~0))} is VALID [2018-11-23 13:11:10,250 INFO L273 TraceCheckUtils]: 43: Hoare triple {7172#(and (<= main_~n0~0 2) (<= main_~n1~0 2) (<= 4 main_~j1~0))} assume !!(~j1~0 < ~n0~0 + ~n1~0); {7021#false} is VALID [2018-11-23 13:11:10,251 INFO L256 TraceCheckUtils]: 44: Hoare triple {7021#false} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {7021#false} is VALID [2018-11-23 13:11:10,251 INFO L273 TraceCheckUtils]: 45: Hoare triple {7021#false} ~cond := #in~cond; {7021#false} is VALID [2018-11-23 13:11:10,251 INFO L273 TraceCheckUtils]: 46: Hoare triple {7021#false} assume 0 == ~cond; {7021#false} is VALID [2018-11-23 13:11:10,251 INFO L273 TraceCheckUtils]: 47: Hoare triple {7021#false} assume !false; {7021#false} is VALID [2018-11-23 13:11:10,256 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 34 proven. 6 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-11-23 13:11:10,274 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:11:10,274 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 24 [2018-11-23 13:11:10,275 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 48 [2018-11-23 13:11:10,275 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:11:10,275 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 24 states. [2018-11-23 13:11:10,339 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-23 13:11:10,339 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-11-23 13:11:10,340 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-11-23 13:11:10,340 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=437, Unknown=0, NotChecked=0, Total=552 [2018-11-23 13:11:10,340 INFO L87 Difference]: Start difference. First operand 60 states and 66 transitions. Second operand 24 states. [2018-11-23 13:11:12,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:11:12,106 INFO L93 Difference]: Finished difference Result 139 states and 168 transitions. [2018-11-23 13:11:12,106 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-11-23 13:11:12,106 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 48 [2018-11-23 13:11:12,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:11:12,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-23 13:11:12,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 89 transitions. [2018-11-23 13:11:12,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-23 13:11:12,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 89 transitions. [2018-11-23 13:11:12,109 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 23 states and 89 transitions. [2018-11-23 13:11:12,191 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 89 edges. 89 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:11:12,194 INFO L225 Difference]: With dead ends: 139 [2018-11-23 13:11:12,194 INFO L226 Difference]: Without dead ends: 116 [2018-11-23 13:11:12,195 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 422 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=364, Invalid=1358, Unknown=0, NotChecked=0, Total=1722 [2018-11-23 13:11:12,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2018-11-23 13:11:12,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 60. [2018-11-23 13:11:12,303 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:11:12,303 INFO L82 GeneralOperation]: Start isEquivalent. First operand 116 states. Second operand 60 states. [2018-11-23 13:11:12,303 INFO L74 IsIncluded]: Start isIncluded. First operand 116 states. Second operand 60 states. [2018-11-23 13:11:12,303 INFO L87 Difference]: Start difference. First operand 116 states. Second operand 60 states. [2018-11-23 13:11:12,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:11:12,307 INFO L93 Difference]: Finished difference Result 116 states and 140 transitions. [2018-11-23 13:11:12,307 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 140 transitions. [2018-11-23 13:11:12,308 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:11:12,308 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:11:12,308 INFO L74 IsIncluded]: Start isIncluded. First operand 60 states. Second operand 116 states. [2018-11-23 13:11:12,308 INFO L87 Difference]: Start difference. First operand 60 states. Second operand 116 states. [2018-11-23 13:11:12,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:11:12,311 INFO L93 Difference]: Finished difference Result 116 states and 140 transitions. [2018-11-23 13:11:12,311 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 140 transitions. [2018-11-23 13:11:12,312 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:11:12,312 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:11:12,312 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:11:12,312 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:11:12,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-11-23 13:11:12,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 66 transitions. [2018-11-23 13:11:12,314 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 66 transitions. Word has length 48 [2018-11-23 13:11:12,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:11:12,314 INFO L480 AbstractCegarLoop]: Abstraction has 60 states and 66 transitions. [2018-11-23 13:11:12,314 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-11-23 13:11:12,314 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 66 transitions. [2018-11-23 13:11:12,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-11-23 13:11:12,315 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:11:12,315 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:11:12,315 INFO L423 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:11:12,315 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:11:12,315 INFO L82 PathProgramCache]: Analyzing trace with hash 1068247854, now seen corresponding path program 6 times [2018-11-23 13:11:12,316 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:11:12,316 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:11:12,316 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:11:12,317 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:11:12,317 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:11:12,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:11:12,481 INFO L256 TraceCheckUtils]: 0: Hoare triple {7767#true} call ULTIMATE.init(); {7767#true} is VALID [2018-11-23 13:11:12,481 INFO L273 TraceCheckUtils]: 1: Hoare triple {7767#true} assume true; {7767#true} is VALID [2018-11-23 13:11:12,482 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {7767#true} {7767#true} #66#return; {7767#true} is VALID [2018-11-23 13:11:12,482 INFO L256 TraceCheckUtils]: 3: Hoare triple {7767#true} call #t~ret9 := main(); {7767#true} is VALID [2018-11-23 13:11:12,483 INFO L273 TraceCheckUtils]: 4: Hoare triple {7767#true} havoc ~n0~0;havoc ~n1~0;~i0~0 := 0;~k~0 := 0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n0~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~n1~0 := #t~nondet2;havoc #t~nondet2; {7769#(<= main_~i0~0 0)} is VALID [2018-11-23 13:11:12,483 INFO L273 TraceCheckUtils]: 5: Hoare triple {7769#(<= main_~i0~0 0)} assume !!(-1000000 <= ~n0~0 && ~n0~0 < 1000000); {7769#(<= main_~i0~0 0)} is VALID [2018-11-23 13:11:12,484 INFO L273 TraceCheckUtils]: 6: Hoare triple {7769#(<= main_~i0~0 0)} assume !!(-1000000 <= ~n1~0 && ~n1~0 < 1000000); {7769#(<= main_~i0~0 0)} is VALID [2018-11-23 13:11:12,484 INFO L273 TraceCheckUtils]: 7: Hoare triple {7769#(<= main_~i0~0 0)} assume !!(~i0~0 < ~n0~0);#t~post3 := ~i0~0;~i0~0 := 1 + #t~post3;havoc #t~post3;#t~post4 := ~k~0;~k~0 := 1 + #t~post4;havoc #t~post4; {7770#(<= main_~i0~0 1)} is VALID [2018-11-23 13:11:12,485 INFO L273 TraceCheckUtils]: 8: Hoare triple {7770#(<= main_~i0~0 1)} assume !!(~i0~0 < ~n0~0);#t~post3 := ~i0~0;~i0~0 := 1 + #t~post3;havoc #t~post3;#t~post4 := ~k~0;~k~0 := 1 + #t~post4;havoc #t~post4; {7771#(<= main_~i0~0 2)} is VALID [2018-11-23 13:11:12,485 INFO L273 TraceCheckUtils]: 9: Hoare triple {7771#(<= main_~i0~0 2)} assume !!(~i0~0 < ~n0~0);#t~post3 := ~i0~0;~i0~0 := 1 + #t~post3;havoc #t~post3;#t~post4 := ~k~0;~k~0 := 1 + #t~post4;havoc #t~post4; {7772#(<= main_~i0~0 3)} is VALID [2018-11-23 13:11:12,486 INFO L273 TraceCheckUtils]: 10: Hoare triple {7772#(<= main_~i0~0 3)} assume !(~i0~0 < ~n0~0); {7773#(<= main_~n0~0 3)} is VALID [2018-11-23 13:11:12,486 INFO L273 TraceCheckUtils]: 11: Hoare triple {7773#(<= main_~n0~0 3)} ~i1~0 := 0; {7774#(<= (+ main_~i1~0 main_~n0~0) 3)} is VALID [2018-11-23 13:11:12,487 INFO L273 TraceCheckUtils]: 12: Hoare triple {7774#(<= (+ main_~i1~0 main_~n0~0) 3)} assume !!(~i1~0 < ~n1~0);#t~post5 := ~i1~0;~i1~0 := 1 + #t~post5;havoc #t~post5;#t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {7775#(<= (+ main_~i1~0 main_~n0~0) 4)} is VALID [2018-11-23 13:11:12,488 INFO L273 TraceCheckUtils]: 13: Hoare triple {7775#(<= (+ main_~i1~0 main_~n0~0) 4)} assume !(~i1~0 < ~n1~0); {7776#(<= (+ main_~n0~0 main_~n1~0) 4)} is VALID [2018-11-23 13:11:12,488 INFO L273 TraceCheckUtils]: 14: Hoare triple {7776#(<= (+ main_~n0~0 main_~n1~0) 4)} ~j1~0 := 0; {7777#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 4))} is VALID [2018-11-23 13:11:12,489 INFO L273 TraceCheckUtils]: 15: Hoare triple {7777#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 4))} assume !!(~j1~0 < ~n0~0 + ~n1~0); {7777#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 4))} is VALID [2018-11-23 13:11:12,489 INFO L256 TraceCheckUtils]: 16: Hoare triple {7777#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 4))} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {7767#true} is VALID [2018-11-23 13:11:12,489 INFO L273 TraceCheckUtils]: 17: Hoare triple {7767#true} ~cond := #in~cond; {7767#true} is VALID [2018-11-23 13:11:12,490 INFO L273 TraceCheckUtils]: 18: Hoare triple {7767#true} assume !(0 == ~cond); {7767#true} is VALID [2018-11-23 13:11:12,490 INFO L273 TraceCheckUtils]: 19: Hoare triple {7767#true} assume true; {7767#true} is VALID [2018-11-23 13:11:12,491 INFO L268 TraceCheckUtils]: 20: Hoare quadruple {7767#true} {7777#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 4))} #70#return; {7777#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 4))} is VALID [2018-11-23 13:11:12,492 INFO L273 TraceCheckUtils]: 21: Hoare triple {7777#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 4))} #t~post7 := ~j1~0;~j1~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~k~0;~k~0 := #t~post8 - 1;havoc #t~post8; {7778#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 3))} is VALID [2018-11-23 13:11:12,492 INFO L273 TraceCheckUtils]: 22: Hoare triple {7778#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 3))} assume !!(~j1~0 < ~n0~0 + ~n1~0); {7778#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 3))} is VALID [2018-11-23 13:11:12,492 INFO L256 TraceCheckUtils]: 23: Hoare triple {7778#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 3))} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {7767#true} is VALID [2018-11-23 13:11:12,492 INFO L273 TraceCheckUtils]: 24: Hoare triple {7767#true} ~cond := #in~cond; {7767#true} is VALID [2018-11-23 13:11:12,492 INFO L273 TraceCheckUtils]: 25: Hoare triple {7767#true} assume !(0 == ~cond); {7767#true} is VALID [2018-11-23 13:11:12,492 INFO L273 TraceCheckUtils]: 26: Hoare triple {7767#true} assume true; {7767#true} is VALID [2018-11-23 13:11:12,493 INFO L268 TraceCheckUtils]: 27: Hoare quadruple {7767#true} {7778#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 3))} #70#return; {7778#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 3))} is VALID [2018-11-23 13:11:12,493 INFO L273 TraceCheckUtils]: 28: Hoare triple {7778#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 3))} #t~post7 := ~j1~0;~j1~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~k~0;~k~0 := #t~post8 - 1;havoc #t~post8; {7779#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 2))} is VALID [2018-11-23 13:11:12,494 INFO L273 TraceCheckUtils]: 29: Hoare triple {7779#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 2))} assume !!(~j1~0 < ~n0~0 + ~n1~0); {7779#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 2))} is VALID [2018-11-23 13:11:12,494 INFO L256 TraceCheckUtils]: 30: Hoare triple {7779#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 2))} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {7767#true} is VALID [2018-11-23 13:11:12,494 INFO L273 TraceCheckUtils]: 31: Hoare triple {7767#true} ~cond := #in~cond; {7767#true} is VALID [2018-11-23 13:11:12,494 INFO L273 TraceCheckUtils]: 32: Hoare triple {7767#true} assume !(0 == ~cond); {7767#true} is VALID [2018-11-23 13:11:12,494 INFO L273 TraceCheckUtils]: 33: Hoare triple {7767#true} assume true; {7767#true} is VALID [2018-11-23 13:11:12,495 INFO L268 TraceCheckUtils]: 34: Hoare quadruple {7767#true} {7779#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 2))} #70#return; {7779#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 2))} is VALID [2018-11-23 13:11:12,496 INFO L273 TraceCheckUtils]: 35: Hoare triple {7779#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 2))} #t~post7 := ~j1~0;~j1~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~k~0;~k~0 := #t~post8 - 1;havoc #t~post8; {7780#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 1))} is VALID [2018-11-23 13:11:12,496 INFO L273 TraceCheckUtils]: 36: Hoare triple {7780#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 1))} assume !!(~j1~0 < ~n0~0 + ~n1~0); {7780#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 1))} is VALID [2018-11-23 13:11:12,497 INFO L256 TraceCheckUtils]: 37: Hoare triple {7780#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 1))} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {7767#true} is VALID [2018-11-23 13:11:12,497 INFO L273 TraceCheckUtils]: 38: Hoare triple {7767#true} ~cond := #in~cond; {7767#true} is VALID [2018-11-23 13:11:12,497 INFO L273 TraceCheckUtils]: 39: Hoare triple {7767#true} assume !(0 == ~cond); {7767#true} is VALID [2018-11-23 13:11:12,497 INFO L273 TraceCheckUtils]: 40: Hoare triple {7767#true} assume true; {7767#true} is VALID [2018-11-23 13:11:12,498 INFO L268 TraceCheckUtils]: 41: Hoare quadruple {7767#true} {7780#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 1))} #70#return; {7780#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 1))} is VALID [2018-11-23 13:11:12,499 INFO L273 TraceCheckUtils]: 42: Hoare triple {7780#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 1))} #t~post7 := ~j1~0;~j1~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~k~0;~k~0 := #t~post8 - 1;havoc #t~post8; {7781#(<= (+ main_~n0~0 main_~n1~0) main_~j1~0)} is VALID [2018-11-23 13:11:12,499 INFO L273 TraceCheckUtils]: 43: Hoare triple {7781#(<= (+ main_~n0~0 main_~n1~0) main_~j1~0)} assume !!(~j1~0 < ~n0~0 + ~n1~0); {7768#false} is VALID [2018-11-23 13:11:12,500 INFO L256 TraceCheckUtils]: 44: Hoare triple {7768#false} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {7768#false} is VALID [2018-11-23 13:11:12,500 INFO L273 TraceCheckUtils]: 45: Hoare triple {7768#false} ~cond := #in~cond; {7768#false} is VALID [2018-11-23 13:11:12,500 INFO L273 TraceCheckUtils]: 46: Hoare triple {7768#false} assume 0 == ~cond; {7768#false} is VALID [2018-11-23 13:11:12,500 INFO L273 TraceCheckUtils]: 47: Hoare triple {7768#false} assume !false; {7768#false} is VALID [2018-11-23 13:11:12,502 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 34 proven. 7 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-11-23 13:11:12,502 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:11:12,502 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:11:12,511 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-23 13:11:12,531 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2018-11-23 13:11:12,531 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:11:12,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:11:12,543 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:11:12,909 INFO L256 TraceCheckUtils]: 0: Hoare triple {7767#true} call ULTIMATE.init(); {7767#true} is VALID [2018-11-23 13:11:12,909 INFO L273 TraceCheckUtils]: 1: Hoare triple {7767#true} assume true; {7767#true} is VALID [2018-11-23 13:11:12,910 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {7767#true} {7767#true} #66#return; {7767#true} is VALID [2018-11-23 13:11:12,910 INFO L256 TraceCheckUtils]: 3: Hoare triple {7767#true} call #t~ret9 := main(); {7767#true} is VALID [2018-11-23 13:11:12,911 INFO L273 TraceCheckUtils]: 4: Hoare triple {7767#true} havoc ~n0~0;havoc ~n1~0;~i0~0 := 0;~k~0 := 0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n0~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~n1~0 := #t~nondet2;havoc #t~nondet2; {7769#(<= main_~i0~0 0)} is VALID [2018-11-23 13:11:12,911 INFO L273 TraceCheckUtils]: 5: Hoare triple {7769#(<= main_~i0~0 0)} assume !!(-1000000 <= ~n0~0 && ~n0~0 < 1000000); {7769#(<= main_~i0~0 0)} is VALID [2018-11-23 13:11:12,912 INFO L273 TraceCheckUtils]: 6: Hoare triple {7769#(<= main_~i0~0 0)} assume !!(-1000000 <= ~n1~0 && ~n1~0 < 1000000); {7769#(<= main_~i0~0 0)} is VALID [2018-11-23 13:11:12,912 INFO L273 TraceCheckUtils]: 7: Hoare triple {7769#(<= main_~i0~0 0)} assume !!(~i0~0 < ~n0~0);#t~post3 := ~i0~0;~i0~0 := 1 + #t~post3;havoc #t~post3;#t~post4 := ~k~0;~k~0 := 1 + #t~post4;havoc #t~post4; {7770#(<= main_~i0~0 1)} is VALID [2018-11-23 13:11:12,913 INFO L273 TraceCheckUtils]: 8: Hoare triple {7770#(<= main_~i0~0 1)} assume !!(~i0~0 < ~n0~0);#t~post3 := ~i0~0;~i0~0 := 1 + #t~post3;havoc #t~post3;#t~post4 := ~k~0;~k~0 := 1 + #t~post4;havoc #t~post4; {7771#(<= main_~i0~0 2)} is VALID [2018-11-23 13:11:12,914 INFO L273 TraceCheckUtils]: 9: Hoare triple {7771#(<= main_~i0~0 2)} assume !!(~i0~0 < ~n0~0);#t~post3 := ~i0~0;~i0~0 := 1 + #t~post3;havoc #t~post3;#t~post4 := ~k~0;~k~0 := 1 + #t~post4;havoc #t~post4; {7772#(<= main_~i0~0 3)} is VALID [2018-11-23 13:11:12,915 INFO L273 TraceCheckUtils]: 10: Hoare triple {7772#(<= main_~i0~0 3)} assume !(~i0~0 < ~n0~0); {7773#(<= main_~n0~0 3)} is VALID [2018-11-23 13:11:12,915 INFO L273 TraceCheckUtils]: 11: Hoare triple {7773#(<= main_~n0~0 3)} ~i1~0 := 0; {7818#(and (<= main_~i1~0 0) (<= main_~n0~0 3))} is VALID [2018-11-23 13:11:12,916 INFO L273 TraceCheckUtils]: 12: Hoare triple {7818#(and (<= main_~i1~0 0) (<= main_~n0~0 3))} assume !!(~i1~0 < ~n1~0);#t~post5 := ~i1~0;~i1~0 := 1 + #t~post5;havoc #t~post5;#t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {7822#(and (<= main_~n0~0 3) (<= main_~i1~0 1))} is VALID [2018-11-23 13:11:12,917 INFO L273 TraceCheckUtils]: 13: Hoare triple {7822#(and (<= main_~n0~0 3) (<= main_~i1~0 1))} assume !(~i1~0 < ~n1~0); {7826#(and (<= main_~n1~0 1) (<= main_~n0~0 3))} is VALID [2018-11-23 13:11:12,918 INFO L273 TraceCheckUtils]: 14: Hoare triple {7826#(and (<= main_~n1~0 1) (<= main_~n0~0 3))} ~j1~0 := 0; {7830#(and (<= main_~n1~0 1) (<= main_~n0~0 3) (<= 0 main_~j1~0))} is VALID [2018-11-23 13:11:12,918 INFO L273 TraceCheckUtils]: 15: Hoare triple {7830#(and (<= main_~n1~0 1) (<= main_~n0~0 3) (<= 0 main_~j1~0))} assume !!(~j1~0 < ~n0~0 + ~n1~0); {7830#(and (<= main_~n1~0 1) (<= main_~n0~0 3) (<= 0 main_~j1~0))} is VALID [2018-11-23 13:11:12,919 INFO L256 TraceCheckUtils]: 16: Hoare triple {7830#(and (<= main_~n1~0 1) (<= main_~n0~0 3) (<= 0 main_~j1~0))} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {7767#true} is VALID [2018-11-23 13:11:12,919 INFO L273 TraceCheckUtils]: 17: Hoare triple {7767#true} ~cond := #in~cond; {7767#true} is VALID [2018-11-23 13:11:12,919 INFO L273 TraceCheckUtils]: 18: Hoare triple {7767#true} assume !(0 == ~cond); {7767#true} is VALID [2018-11-23 13:11:12,919 INFO L273 TraceCheckUtils]: 19: Hoare triple {7767#true} assume true; {7767#true} is VALID [2018-11-23 13:11:12,920 INFO L268 TraceCheckUtils]: 20: Hoare quadruple {7767#true} {7830#(and (<= main_~n1~0 1) (<= main_~n0~0 3) (<= 0 main_~j1~0))} #70#return; {7830#(and (<= main_~n1~0 1) (<= main_~n0~0 3) (<= 0 main_~j1~0))} is VALID [2018-11-23 13:11:12,921 INFO L273 TraceCheckUtils]: 21: Hoare triple {7830#(and (<= main_~n1~0 1) (<= main_~n0~0 3) (<= 0 main_~j1~0))} #t~post7 := ~j1~0;~j1~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~k~0;~k~0 := #t~post8 - 1;havoc #t~post8; {7852#(and (<= main_~n1~0 1) (<= 1 main_~j1~0) (<= main_~n0~0 3))} is VALID [2018-11-23 13:11:12,922 INFO L273 TraceCheckUtils]: 22: Hoare triple {7852#(and (<= main_~n1~0 1) (<= 1 main_~j1~0) (<= main_~n0~0 3))} assume !!(~j1~0 < ~n0~0 + ~n1~0); {7852#(and (<= main_~n1~0 1) (<= 1 main_~j1~0) (<= main_~n0~0 3))} is VALID [2018-11-23 13:11:12,922 INFO L256 TraceCheckUtils]: 23: Hoare triple {7852#(and (<= main_~n1~0 1) (<= 1 main_~j1~0) (<= main_~n0~0 3))} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {7767#true} is VALID [2018-11-23 13:11:12,922 INFO L273 TraceCheckUtils]: 24: Hoare triple {7767#true} ~cond := #in~cond; {7767#true} is VALID [2018-11-23 13:11:12,922 INFO L273 TraceCheckUtils]: 25: Hoare triple {7767#true} assume !(0 == ~cond); {7767#true} is VALID [2018-11-23 13:11:12,922 INFO L273 TraceCheckUtils]: 26: Hoare triple {7767#true} assume true; {7767#true} is VALID [2018-11-23 13:11:12,923 INFO L268 TraceCheckUtils]: 27: Hoare quadruple {7767#true} {7852#(and (<= main_~n1~0 1) (<= 1 main_~j1~0) (<= main_~n0~0 3))} #70#return; {7852#(and (<= main_~n1~0 1) (<= 1 main_~j1~0) (<= main_~n0~0 3))} is VALID [2018-11-23 13:11:12,924 INFO L273 TraceCheckUtils]: 28: Hoare triple {7852#(and (<= main_~n1~0 1) (<= 1 main_~j1~0) (<= main_~n0~0 3))} #t~post7 := ~j1~0;~j1~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~k~0;~k~0 := #t~post8 - 1;havoc #t~post8; {7874#(and (<= main_~n1~0 1) (<= main_~n0~0 3) (<= 2 main_~j1~0))} is VALID [2018-11-23 13:11:12,925 INFO L273 TraceCheckUtils]: 29: Hoare triple {7874#(and (<= main_~n1~0 1) (<= main_~n0~0 3) (<= 2 main_~j1~0))} assume !!(~j1~0 < ~n0~0 + ~n1~0); {7874#(and (<= main_~n1~0 1) (<= main_~n0~0 3) (<= 2 main_~j1~0))} is VALID [2018-11-23 13:11:12,925 INFO L256 TraceCheckUtils]: 30: Hoare triple {7874#(and (<= main_~n1~0 1) (<= main_~n0~0 3) (<= 2 main_~j1~0))} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {7767#true} is VALID [2018-11-23 13:11:12,925 INFO L273 TraceCheckUtils]: 31: Hoare triple {7767#true} ~cond := #in~cond; {7767#true} is VALID [2018-11-23 13:11:12,925 INFO L273 TraceCheckUtils]: 32: Hoare triple {7767#true} assume !(0 == ~cond); {7767#true} is VALID [2018-11-23 13:11:12,926 INFO L273 TraceCheckUtils]: 33: Hoare triple {7767#true} assume true; {7767#true} is VALID [2018-11-23 13:11:12,926 INFO L268 TraceCheckUtils]: 34: Hoare quadruple {7767#true} {7874#(and (<= main_~n1~0 1) (<= main_~n0~0 3) (<= 2 main_~j1~0))} #70#return; {7874#(and (<= main_~n1~0 1) (<= main_~n0~0 3) (<= 2 main_~j1~0))} is VALID [2018-11-23 13:11:12,927 INFO L273 TraceCheckUtils]: 35: Hoare triple {7874#(and (<= main_~n1~0 1) (<= main_~n0~0 3) (<= 2 main_~j1~0))} #t~post7 := ~j1~0;~j1~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~k~0;~k~0 := #t~post8 - 1;havoc #t~post8; {7896#(and (<= main_~n1~0 1) (<= main_~n0~0 3) (<= 3 main_~j1~0))} is VALID [2018-11-23 13:11:12,928 INFO L273 TraceCheckUtils]: 36: Hoare triple {7896#(and (<= main_~n1~0 1) (<= main_~n0~0 3) (<= 3 main_~j1~0))} assume !!(~j1~0 < ~n0~0 + ~n1~0); {7896#(and (<= main_~n1~0 1) (<= main_~n0~0 3) (<= 3 main_~j1~0))} is VALID [2018-11-23 13:11:12,928 INFO L256 TraceCheckUtils]: 37: Hoare triple {7896#(and (<= main_~n1~0 1) (<= main_~n0~0 3) (<= 3 main_~j1~0))} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {7767#true} is VALID [2018-11-23 13:11:12,928 INFO L273 TraceCheckUtils]: 38: Hoare triple {7767#true} ~cond := #in~cond; {7767#true} is VALID [2018-11-23 13:11:12,929 INFO L273 TraceCheckUtils]: 39: Hoare triple {7767#true} assume !(0 == ~cond); {7767#true} is VALID [2018-11-23 13:11:12,929 INFO L273 TraceCheckUtils]: 40: Hoare triple {7767#true} assume true; {7767#true} is VALID [2018-11-23 13:11:12,930 INFO L268 TraceCheckUtils]: 41: Hoare quadruple {7767#true} {7896#(and (<= main_~n1~0 1) (<= main_~n0~0 3) (<= 3 main_~j1~0))} #70#return; {7896#(and (<= main_~n1~0 1) (<= main_~n0~0 3) (<= 3 main_~j1~0))} is VALID [2018-11-23 13:11:12,931 INFO L273 TraceCheckUtils]: 42: Hoare triple {7896#(and (<= main_~n1~0 1) (<= main_~n0~0 3) (<= 3 main_~j1~0))} #t~post7 := ~j1~0;~j1~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~k~0;~k~0 := #t~post8 - 1;havoc #t~post8; {7918#(and (<= main_~n1~0 1) (<= main_~n0~0 3) (<= 4 main_~j1~0))} is VALID [2018-11-23 13:11:12,931 INFO L273 TraceCheckUtils]: 43: Hoare triple {7918#(and (<= main_~n1~0 1) (<= main_~n0~0 3) (<= 4 main_~j1~0))} assume !!(~j1~0 < ~n0~0 + ~n1~0); {7768#false} is VALID [2018-11-23 13:11:12,932 INFO L256 TraceCheckUtils]: 44: Hoare triple {7768#false} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {7768#false} is VALID [2018-11-23 13:11:12,932 INFO L273 TraceCheckUtils]: 45: Hoare triple {7768#false} ~cond := #in~cond; {7768#false} is VALID [2018-11-23 13:11:12,932 INFO L273 TraceCheckUtils]: 46: Hoare triple {7768#false} assume 0 == ~cond; {7768#false} is VALID [2018-11-23 13:11:12,932 INFO L273 TraceCheckUtils]: 47: Hoare triple {7768#false} assume !false; {7768#false} is VALID [2018-11-23 13:11:12,935 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 34 proven. 7 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-11-23 13:11:12,954 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:11:12,954 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 23 [2018-11-23 13:11:12,954 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 48 [2018-11-23 13:11:12,954 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:11:12,954 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 23 states. [2018-11-23 13:11:13,011 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 60 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:11:13,011 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-11-23 13:11:13,012 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-11-23 13:11:13,012 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=398, Unknown=0, NotChecked=0, Total=506 [2018-11-23 13:11:13,012 INFO L87 Difference]: Start difference. First operand 60 states and 66 transitions. Second operand 23 states. [2018-11-23 13:11:14,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:11:14,927 INFO L93 Difference]: Finished difference Result 156 states and 191 transitions. [2018-11-23 13:11:14,928 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-11-23 13:11:14,928 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 48 [2018-11-23 13:11:14,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:11:14,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-23 13:11:14,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 98 transitions. [2018-11-23 13:11:14,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-23 13:11:14,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 98 transitions. [2018-11-23 13:11:14,932 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 24 states and 98 transitions. [2018-11-23 13:11:15,109 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 98 edges. 98 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:11:15,112 INFO L225 Difference]: With dead ends: 156 [2018-11-23 13:11:15,112 INFO L226 Difference]: Without dead ends: 133 [2018-11-23 13:11:15,113 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 393 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=351, Invalid=1289, Unknown=0, NotChecked=0, Total=1640 [2018-11-23 13:11:15,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2018-11-23 13:11:15,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 60. [2018-11-23 13:11:15,266 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:11:15,266 INFO L82 GeneralOperation]: Start isEquivalent. First operand 133 states. Second operand 60 states. [2018-11-23 13:11:15,266 INFO L74 IsIncluded]: Start isIncluded. First operand 133 states. Second operand 60 states. [2018-11-23 13:11:15,266 INFO L87 Difference]: Start difference. First operand 133 states. Second operand 60 states. [2018-11-23 13:11:15,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:11:15,270 INFO L93 Difference]: Finished difference Result 133 states and 163 transitions. [2018-11-23 13:11:15,270 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 163 transitions. [2018-11-23 13:11:15,271 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:11:15,271 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:11:15,271 INFO L74 IsIncluded]: Start isIncluded. First operand 60 states. Second operand 133 states. [2018-11-23 13:11:15,271 INFO L87 Difference]: Start difference. First operand 60 states. Second operand 133 states. [2018-11-23 13:11:15,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:11:15,275 INFO L93 Difference]: Finished difference Result 133 states and 163 transitions. [2018-11-23 13:11:15,275 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 163 transitions. [2018-11-23 13:11:15,276 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:11:15,276 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:11:15,276 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:11:15,276 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:11:15,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-11-23 13:11:15,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 66 transitions. [2018-11-23 13:11:15,277 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 66 transitions. Word has length 48 [2018-11-23 13:11:15,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:11:15,278 INFO L480 AbstractCegarLoop]: Abstraction has 60 states and 66 transitions. [2018-11-23 13:11:15,278 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-11-23 13:11:15,278 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 66 transitions. [2018-11-23 13:11:15,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-11-23 13:11:15,279 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:11:15,279 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:11:15,279 INFO L423 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:11:15,279 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:11:15,279 INFO L82 PathProgramCache]: Analyzing trace with hash 1982428175, now seen corresponding path program 4 times [2018-11-23 13:11:15,279 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:11:15,280 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:11:15,280 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:11:15,280 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:11:15,280 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:11:15,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:11:15,670 INFO L256 TraceCheckUtils]: 0: Hoare triple {8576#true} call ULTIMATE.init(); {8576#true} is VALID [2018-11-23 13:11:15,670 INFO L273 TraceCheckUtils]: 1: Hoare triple {8576#true} assume true; {8576#true} is VALID [2018-11-23 13:11:15,670 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {8576#true} {8576#true} #66#return; {8576#true} is VALID [2018-11-23 13:11:15,670 INFO L256 TraceCheckUtils]: 3: Hoare triple {8576#true} call #t~ret9 := main(); {8576#true} is VALID [2018-11-23 13:11:15,671 INFO L273 TraceCheckUtils]: 4: Hoare triple {8576#true} havoc ~n0~0;havoc ~n1~0;~i0~0 := 0;~k~0 := 0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n0~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~n1~0 := #t~nondet2;havoc #t~nondet2; {8578#(<= main_~i0~0 0)} is VALID [2018-11-23 13:11:15,671 INFO L273 TraceCheckUtils]: 5: Hoare triple {8578#(<= main_~i0~0 0)} assume !!(-1000000 <= ~n0~0 && ~n0~0 < 1000000); {8578#(<= main_~i0~0 0)} is VALID [2018-11-23 13:11:15,672 INFO L273 TraceCheckUtils]: 6: Hoare triple {8578#(<= main_~i0~0 0)} assume !!(-1000000 <= ~n1~0 && ~n1~0 < 1000000); {8578#(<= main_~i0~0 0)} is VALID [2018-11-23 13:11:15,673 INFO L273 TraceCheckUtils]: 7: Hoare triple {8578#(<= main_~i0~0 0)} assume !!(~i0~0 < ~n0~0);#t~post3 := ~i0~0;~i0~0 := 1 + #t~post3;havoc #t~post3;#t~post4 := ~k~0;~k~0 := 1 + #t~post4;havoc #t~post4; {8579#(<= main_~i0~0 1)} is VALID [2018-11-23 13:11:15,674 INFO L273 TraceCheckUtils]: 8: Hoare triple {8579#(<= main_~i0~0 1)} assume !!(~i0~0 < ~n0~0);#t~post3 := ~i0~0;~i0~0 := 1 + #t~post3;havoc #t~post3;#t~post4 := ~k~0;~k~0 := 1 + #t~post4;havoc #t~post4; {8580#(<= main_~i0~0 2)} is VALID [2018-11-23 13:11:15,674 INFO L273 TraceCheckUtils]: 9: Hoare triple {8580#(<= main_~i0~0 2)} assume !!(~i0~0 < ~n0~0);#t~post3 := ~i0~0;~i0~0 := 1 + #t~post3;havoc #t~post3;#t~post4 := ~k~0;~k~0 := 1 + #t~post4;havoc #t~post4; {8581#(<= main_~i0~0 3)} is VALID [2018-11-23 13:11:15,675 INFO L273 TraceCheckUtils]: 10: Hoare triple {8581#(<= main_~i0~0 3)} assume !!(~i0~0 < ~n0~0);#t~post3 := ~i0~0;~i0~0 := 1 + #t~post3;havoc #t~post3;#t~post4 := ~k~0;~k~0 := 1 + #t~post4;havoc #t~post4; {8582#(<= main_~i0~0 4)} is VALID [2018-11-23 13:11:15,676 INFO L273 TraceCheckUtils]: 11: Hoare triple {8582#(<= main_~i0~0 4)} assume !(~i0~0 < ~n0~0); {8583#(<= main_~n0~0 4)} is VALID [2018-11-23 13:11:15,677 INFO L273 TraceCheckUtils]: 12: Hoare triple {8583#(<= main_~n0~0 4)} ~i1~0 := 0; {8584#(<= (+ main_~i1~0 main_~n0~0) 4)} is VALID [2018-11-23 13:11:15,677 INFO L273 TraceCheckUtils]: 13: Hoare triple {8584#(<= (+ main_~i1~0 main_~n0~0) 4)} assume !(~i1~0 < ~n1~0); {8585#(<= (+ main_~n0~0 main_~n1~0) 4)} is VALID [2018-11-23 13:11:15,678 INFO L273 TraceCheckUtils]: 14: Hoare triple {8585#(<= (+ main_~n0~0 main_~n1~0) 4)} ~j1~0 := 0; {8586#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 4))} is VALID [2018-11-23 13:11:15,678 INFO L273 TraceCheckUtils]: 15: Hoare triple {8586#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 4))} assume !!(~j1~0 < ~n0~0 + ~n1~0); {8586#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 4))} is VALID [2018-11-23 13:11:15,679 INFO L256 TraceCheckUtils]: 16: Hoare triple {8586#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 4))} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {8576#true} is VALID [2018-11-23 13:11:15,679 INFO L273 TraceCheckUtils]: 17: Hoare triple {8576#true} ~cond := #in~cond; {8576#true} is VALID [2018-11-23 13:11:15,679 INFO L273 TraceCheckUtils]: 18: Hoare triple {8576#true} assume !(0 == ~cond); {8576#true} is VALID [2018-11-23 13:11:15,679 INFO L273 TraceCheckUtils]: 19: Hoare triple {8576#true} assume true; {8576#true} is VALID [2018-11-23 13:11:15,680 INFO L268 TraceCheckUtils]: 20: Hoare quadruple {8576#true} {8586#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 4))} #70#return; {8586#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 4))} is VALID [2018-11-23 13:11:15,681 INFO L273 TraceCheckUtils]: 21: Hoare triple {8586#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 4))} #t~post7 := ~j1~0;~j1~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~k~0;~k~0 := #t~post8 - 1;havoc #t~post8; {8587#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 3))} is VALID [2018-11-23 13:11:15,682 INFO L273 TraceCheckUtils]: 22: Hoare triple {8587#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 3))} assume !!(~j1~0 < ~n0~0 + ~n1~0); {8587#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 3))} is VALID [2018-11-23 13:11:15,682 INFO L256 TraceCheckUtils]: 23: Hoare triple {8587#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 3))} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {8576#true} is VALID [2018-11-23 13:11:15,682 INFO L273 TraceCheckUtils]: 24: Hoare triple {8576#true} ~cond := #in~cond; {8576#true} is VALID [2018-11-23 13:11:15,682 INFO L273 TraceCheckUtils]: 25: Hoare triple {8576#true} assume !(0 == ~cond); {8576#true} is VALID [2018-11-23 13:11:15,682 INFO L273 TraceCheckUtils]: 26: Hoare triple {8576#true} assume true; {8576#true} is VALID [2018-11-23 13:11:15,683 INFO L268 TraceCheckUtils]: 27: Hoare quadruple {8576#true} {8587#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 3))} #70#return; {8587#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 3))} is VALID [2018-11-23 13:11:15,683 INFO L273 TraceCheckUtils]: 28: Hoare triple {8587#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 3))} #t~post7 := ~j1~0;~j1~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~k~0;~k~0 := #t~post8 - 1;havoc #t~post8; {8588#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 2))} is VALID [2018-11-23 13:11:15,684 INFO L273 TraceCheckUtils]: 29: Hoare triple {8588#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 2))} assume !!(~j1~0 < ~n0~0 + ~n1~0); {8588#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 2))} is VALID [2018-11-23 13:11:15,684 INFO L256 TraceCheckUtils]: 30: Hoare triple {8588#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 2))} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {8576#true} is VALID [2018-11-23 13:11:15,684 INFO L273 TraceCheckUtils]: 31: Hoare triple {8576#true} ~cond := #in~cond; {8576#true} is VALID [2018-11-23 13:11:15,685 INFO L273 TraceCheckUtils]: 32: Hoare triple {8576#true} assume !(0 == ~cond); {8576#true} is VALID [2018-11-23 13:11:15,685 INFO L273 TraceCheckUtils]: 33: Hoare triple {8576#true} assume true; {8576#true} is VALID [2018-11-23 13:11:15,686 INFO L268 TraceCheckUtils]: 34: Hoare quadruple {8576#true} {8588#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 2))} #70#return; {8588#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 2))} is VALID [2018-11-23 13:11:15,687 INFO L273 TraceCheckUtils]: 35: Hoare triple {8588#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 2))} #t~post7 := ~j1~0;~j1~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~k~0;~k~0 := #t~post8 - 1;havoc #t~post8; {8589#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 1))} is VALID [2018-11-23 13:11:15,687 INFO L273 TraceCheckUtils]: 36: Hoare triple {8589#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 1))} assume !!(~j1~0 < ~n0~0 + ~n1~0); {8589#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 1))} is VALID [2018-11-23 13:11:15,687 INFO L256 TraceCheckUtils]: 37: Hoare triple {8589#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 1))} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {8576#true} is VALID [2018-11-23 13:11:15,687 INFO L273 TraceCheckUtils]: 38: Hoare triple {8576#true} ~cond := #in~cond; {8576#true} is VALID [2018-11-23 13:11:15,687 INFO L273 TraceCheckUtils]: 39: Hoare triple {8576#true} assume !(0 == ~cond); {8576#true} is VALID [2018-11-23 13:11:15,687 INFO L273 TraceCheckUtils]: 40: Hoare triple {8576#true} assume true; {8576#true} is VALID [2018-11-23 13:11:15,688 INFO L268 TraceCheckUtils]: 41: Hoare quadruple {8576#true} {8589#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 1))} #70#return; {8589#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 1))} is VALID [2018-11-23 13:11:15,689 INFO L273 TraceCheckUtils]: 42: Hoare triple {8589#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 1))} #t~post7 := ~j1~0;~j1~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~k~0;~k~0 := #t~post8 - 1;havoc #t~post8; {8590#(<= (+ main_~n0~0 main_~n1~0) main_~j1~0)} is VALID [2018-11-23 13:11:15,689 INFO L273 TraceCheckUtils]: 43: Hoare triple {8590#(<= (+ main_~n0~0 main_~n1~0) main_~j1~0)} assume !!(~j1~0 < ~n0~0 + ~n1~0); {8577#false} is VALID [2018-11-23 13:11:15,689 INFO L256 TraceCheckUtils]: 44: Hoare triple {8577#false} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {8577#false} is VALID [2018-11-23 13:11:15,690 INFO L273 TraceCheckUtils]: 45: Hoare triple {8577#false} ~cond := #in~cond; {8577#false} is VALID [2018-11-23 13:11:15,690 INFO L273 TraceCheckUtils]: 46: Hoare triple {8577#false} assume 0 == ~cond; {8577#false} is VALID [2018-11-23 13:11:15,690 INFO L273 TraceCheckUtils]: 47: Hoare triple {8577#false} assume !false; {8577#false} is VALID [2018-11-23 13:11:15,693 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 34 proven. 10 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-11-23 13:11:15,693 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:11:15,694 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:11:15,704 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 13:11:15,719 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 13:11:15,719 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:11:15,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:11:15,731 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:11:16,005 INFO L256 TraceCheckUtils]: 0: Hoare triple {8576#true} call ULTIMATE.init(); {8576#true} is VALID [2018-11-23 13:11:16,005 INFO L273 TraceCheckUtils]: 1: Hoare triple {8576#true} assume true; {8576#true} is VALID [2018-11-23 13:11:16,005 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {8576#true} {8576#true} #66#return; {8576#true} is VALID [2018-11-23 13:11:16,005 INFO L256 TraceCheckUtils]: 3: Hoare triple {8576#true} call #t~ret9 := main(); {8576#true} is VALID [2018-11-23 13:11:16,006 INFO L273 TraceCheckUtils]: 4: Hoare triple {8576#true} havoc ~n0~0;havoc ~n1~0;~i0~0 := 0;~k~0 := 0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n0~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~n1~0 := #t~nondet2;havoc #t~nondet2; {8578#(<= main_~i0~0 0)} is VALID [2018-11-23 13:11:16,006 INFO L273 TraceCheckUtils]: 5: Hoare triple {8578#(<= main_~i0~0 0)} assume !!(-1000000 <= ~n0~0 && ~n0~0 < 1000000); {8578#(<= main_~i0~0 0)} is VALID [2018-11-23 13:11:16,007 INFO L273 TraceCheckUtils]: 6: Hoare triple {8578#(<= main_~i0~0 0)} assume !!(-1000000 <= ~n1~0 && ~n1~0 < 1000000); {8578#(<= main_~i0~0 0)} is VALID [2018-11-23 13:11:16,007 INFO L273 TraceCheckUtils]: 7: Hoare triple {8578#(<= main_~i0~0 0)} assume !!(~i0~0 < ~n0~0);#t~post3 := ~i0~0;~i0~0 := 1 + #t~post3;havoc #t~post3;#t~post4 := ~k~0;~k~0 := 1 + #t~post4;havoc #t~post4; {8579#(<= main_~i0~0 1)} is VALID [2018-11-23 13:11:16,008 INFO L273 TraceCheckUtils]: 8: Hoare triple {8579#(<= main_~i0~0 1)} assume !!(~i0~0 < ~n0~0);#t~post3 := ~i0~0;~i0~0 := 1 + #t~post3;havoc #t~post3;#t~post4 := ~k~0;~k~0 := 1 + #t~post4;havoc #t~post4; {8580#(<= main_~i0~0 2)} is VALID [2018-11-23 13:11:16,008 INFO L273 TraceCheckUtils]: 9: Hoare triple {8580#(<= main_~i0~0 2)} assume !!(~i0~0 < ~n0~0);#t~post3 := ~i0~0;~i0~0 := 1 + #t~post3;havoc #t~post3;#t~post4 := ~k~0;~k~0 := 1 + #t~post4;havoc #t~post4; {8581#(<= main_~i0~0 3)} is VALID [2018-11-23 13:11:16,010 INFO L273 TraceCheckUtils]: 10: Hoare triple {8581#(<= main_~i0~0 3)} assume !!(~i0~0 < ~n0~0);#t~post3 := ~i0~0;~i0~0 := 1 + #t~post3;havoc #t~post3;#t~post4 := ~k~0;~k~0 := 1 + #t~post4;havoc #t~post4; {8582#(<= main_~i0~0 4)} is VALID [2018-11-23 13:11:16,011 INFO L273 TraceCheckUtils]: 11: Hoare triple {8582#(<= main_~i0~0 4)} assume !(~i0~0 < ~n0~0); {8583#(<= main_~n0~0 4)} is VALID [2018-11-23 13:11:16,011 INFO L273 TraceCheckUtils]: 12: Hoare triple {8583#(<= main_~n0~0 4)} ~i1~0 := 0; {8630#(and (<= main_~n0~0 4) (<= main_~i1~0 0))} is VALID [2018-11-23 13:11:16,012 INFO L273 TraceCheckUtils]: 13: Hoare triple {8630#(and (<= main_~n0~0 4) (<= main_~i1~0 0))} assume !(~i1~0 < ~n1~0); {8634#(and (<= main_~n1~0 0) (<= main_~n0~0 4))} is VALID [2018-11-23 13:11:16,013 INFO L273 TraceCheckUtils]: 14: Hoare triple {8634#(and (<= main_~n1~0 0) (<= main_~n0~0 4))} ~j1~0 := 0; {8638#(and (<= main_~n1~0 0) (<= main_~n0~0 4) (<= 0 main_~j1~0))} is VALID [2018-11-23 13:11:16,013 INFO L273 TraceCheckUtils]: 15: Hoare triple {8638#(and (<= main_~n1~0 0) (<= main_~n0~0 4) (<= 0 main_~j1~0))} assume !!(~j1~0 < ~n0~0 + ~n1~0); {8638#(and (<= main_~n1~0 0) (<= main_~n0~0 4) (<= 0 main_~j1~0))} is VALID [2018-11-23 13:11:16,014 INFO L256 TraceCheckUtils]: 16: Hoare triple {8638#(and (<= main_~n1~0 0) (<= main_~n0~0 4) (<= 0 main_~j1~0))} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {8576#true} is VALID [2018-11-23 13:11:16,014 INFO L273 TraceCheckUtils]: 17: Hoare triple {8576#true} ~cond := #in~cond; {8576#true} is VALID [2018-11-23 13:11:16,014 INFO L273 TraceCheckUtils]: 18: Hoare triple {8576#true} assume !(0 == ~cond); {8576#true} is VALID [2018-11-23 13:11:16,014 INFO L273 TraceCheckUtils]: 19: Hoare triple {8576#true} assume true; {8576#true} is VALID [2018-11-23 13:11:16,015 INFO L268 TraceCheckUtils]: 20: Hoare quadruple {8576#true} {8638#(and (<= main_~n1~0 0) (<= main_~n0~0 4) (<= 0 main_~j1~0))} #70#return; {8638#(and (<= main_~n1~0 0) (<= main_~n0~0 4) (<= 0 main_~j1~0))} is VALID [2018-11-23 13:11:16,016 INFO L273 TraceCheckUtils]: 21: Hoare triple {8638#(and (<= main_~n1~0 0) (<= main_~n0~0 4) (<= 0 main_~j1~0))} #t~post7 := ~j1~0;~j1~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~k~0;~k~0 := #t~post8 - 1;havoc #t~post8; {8660#(and (<= main_~n1~0 0) (<= main_~n0~0 4) (<= 1 main_~j1~0))} is VALID [2018-11-23 13:11:16,017 INFO L273 TraceCheckUtils]: 22: Hoare triple {8660#(and (<= main_~n1~0 0) (<= main_~n0~0 4) (<= 1 main_~j1~0))} assume !!(~j1~0 < ~n0~0 + ~n1~0); {8660#(and (<= main_~n1~0 0) (<= main_~n0~0 4) (<= 1 main_~j1~0))} is VALID [2018-11-23 13:11:16,017 INFO L256 TraceCheckUtils]: 23: Hoare triple {8660#(and (<= main_~n1~0 0) (<= main_~n0~0 4) (<= 1 main_~j1~0))} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {8576#true} is VALID [2018-11-23 13:11:16,017 INFO L273 TraceCheckUtils]: 24: Hoare triple {8576#true} ~cond := #in~cond; {8576#true} is VALID [2018-11-23 13:11:16,018 INFO L273 TraceCheckUtils]: 25: Hoare triple {8576#true} assume !(0 == ~cond); {8576#true} is VALID [2018-11-23 13:11:16,018 INFO L273 TraceCheckUtils]: 26: Hoare triple {8576#true} assume true; {8576#true} is VALID [2018-11-23 13:11:16,019 INFO L268 TraceCheckUtils]: 27: Hoare quadruple {8576#true} {8660#(and (<= main_~n1~0 0) (<= main_~n0~0 4) (<= 1 main_~j1~0))} #70#return; {8660#(and (<= main_~n1~0 0) (<= main_~n0~0 4) (<= 1 main_~j1~0))} is VALID [2018-11-23 13:11:16,020 INFO L273 TraceCheckUtils]: 28: Hoare triple {8660#(and (<= main_~n1~0 0) (<= main_~n0~0 4) (<= 1 main_~j1~0))} #t~post7 := ~j1~0;~j1~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~k~0;~k~0 := #t~post8 - 1;havoc #t~post8; {8682#(and (<= main_~n1~0 0) (<= main_~n0~0 4) (<= 2 main_~j1~0))} is VALID [2018-11-23 13:11:16,021 INFO L273 TraceCheckUtils]: 29: Hoare triple {8682#(and (<= main_~n1~0 0) (<= main_~n0~0 4) (<= 2 main_~j1~0))} assume !!(~j1~0 < ~n0~0 + ~n1~0); {8682#(and (<= main_~n1~0 0) (<= main_~n0~0 4) (<= 2 main_~j1~0))} is VALID [2018-11-23 13:11:16,021 INFO L256 TraceCheckUtils]: 30: Hoare triple {8682#(and (<= main_~n1~0 0) (<= main_~n0~0 4) (<= 2 main_~j1~0))} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {8576#true} is VALID [2018-11-23 13:11:16,021 INFO L273 TraceCheckUtils]: 31: Hoare triple {8576#true} ~cond := #in~cond; {8576#true} is VALID [2018-11-23 13:11:16,021 INFO L273 TraceCheckUtils]: 32: Hoare triple {8576#true} assume !(0 == ~cond); {8576#true} is VALID [2018-11-23 13:11:16,021 INFO L273 TraceCheckUtils]: 33: Hoare triple {8576#true} assume true; {8576#true} is VALID [2018-11-23 13:11:16,022 INFO L268 TraceCheckUtils]: 34: Hoare quadruple {8576#true} {8682#(and (<= main_~n1~0 0) (<= main_~n0~0 4) (<= 2 main_~j1~0))} #70#return; {8682#(and (<= main_~n1~0 0) (<= main_~n0~0 4) (<= 2 main_~j1~0))} is VALID [2018-11-23 13:11:16,023 INFO L273 TraceCheckUtils]: 35: Hoare triple {8682#(and (<= main_~n1~0 0) (<= main_~n0~0 4) (<= 2 main_~j1~0))} #t~post7 := ~j1~0;~j1~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~k~0;~k~0 := #t~post8 - 1;havoc #t~post8; {8704#(and (<= main_~n1~0 0) (<= main_~n0~0 4) (<= 3 main_~j1~0))} is VALID [2018-11-23 13:11:16,024 INFO L273 TraceCheckUtils]: 36: Hoare triple {8704#(and (<= main_~n1~0 0) (<= main_~n0~0 4) (<= 3 main_~j1~0))} assume !!(~j1~0 < ~n0~0 + ~n1~0); {8704#(and (<= main_~n1~0 0) (<= main_~n0~0 4) (<= 3 main_~j1~0))} is VALID [2018-11-23 13:11:16,024 INFO L256 TraceCheckUtils]: 37: Hoare triple {8704#(and (<= main_~n1~0 0) (<= main_~n0~0 4) (<= 3 main_~j1~0))} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {8576#true} is VALID [2018-11-23 13:11:16,024 INFO L273 TraceCheckUtils]: 38: Hoare triple {8576#true} ~cond := #in~cond; {8576#true} is VALID [2018-11-23 13:11:16,024 INFO L273 TraceCheckUtils]: 39: Hoare triple {8576#true} assume !(0 == ~cond); {8576#true} is VALID [2018-11-23 13:11:16,024 INFO L273 TraceCheckUtils]: 40: Hoare triple {8576#true} assume true; {8576#true} is VALID [2018-11-23 13:11:16,025 INFO L268 TraceCheckUtils]: 41: Hoare quadruple {8576#true} {8704#(and (<= main_~n1~0 0) (<= main_~n0~0 4) (<= 3 main_~j1~0))} #70#return; {8704#(and (<= main_~n1~0 0) (<= main_~n0~0 4) (<= 3 main_~j1~0))} is VALID [2018-11-23 13:11:16,025 INFO L273 TraceCheckUtils]: 42: Hoare triple {8704#(and (<= main_~n1~0 0) (<= main_~n0~0 4) (<= 3 main_~j1~0))} #t~post7 := ~j1~0;~j1~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~k~0;~k~0 := #t~post8 - 1;havoc #t~post8; {8726#(and (<= main_~n1~0 0) (<= main_~n0~0 4) (<= 4 main_~j1~0))} is VALID [2018-11-23 13:11:16,026 INFO L273 TraceCheckUtils]: 43: Hoare triple {8726#(and (<= main_~n1~0 0) (<= main_~n0~0 4) (<= 4 main_~j1~0))} assume !!(~j1~0 < ~n0~0 + ~n1~0); {8577#false} is VALID [2018-11-23 13:11:16,026 INFO L256 TraceCheckUtils]: 44: Hoare triple {8577#false} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {8577#false} is VALID [2018-11-23 13:11:16,026 INFO L273 TraceCheckUtils]: 45: Hoare triple {8577#false} ~cond := #in~cond; {8577#false} is VALID [2018-11-23 13:11:16,026 INFO L273 TraceCheckUtils]: 46: Hoare triple {8577#false} assume 0 == ~cond; {8577#false} is VALID [2018-11-23 13:11:16,026 INFO L273 TraceCheckUtils]: 47: Hoare triple {8577#false} assume !false; {8577#false} is VALID [2018-11-23 13:11:16,029 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 34 proven. 10 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-11-23 13:11:16,049 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:11:16,049 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 22 [2018-11-23 13:11:16,049 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 48 [2018-11-23 13:11:16,050 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:11:16,050 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 22 states. [2018-11-23 13:11:16,104 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:11:16,105 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-11-23 13:11:16,105 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-11-23 13:11:16,105 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=357, Unknown=0, NotChecked=0, Total=462 [2018-11-23 13:11:16,106 INFO L87 Difference]: Start difference. First operand 60 states and 66 transitions. Second operand 22 states. [2018-11-23 13:11:18,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:11:18,220 INFO L93 Difference]: Finished difference Result 175 states and 217 transitions. [2018-11-23 13:11:18,221 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-11-23 13:11:18,221 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 48 [2018-11-23 13:11:18,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:11:18,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-23 13:11:18,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 105 transitions. [2018-11-23 13:11:18,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-23 13:11:18,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 105 transitions. [2018-11-23 13:11:18,224 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 23 states and 105 transitions. [2018-11-23 13:11:18,328 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 105 edges. 105 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:11:18,331 INFO L225 Difference]: With dead ends: 175 [2018-11-23 13:11:18,332 INFO L226 Difference]: Without dead ends: 152 [2018-11-23 13:11:18,333 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 308 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=315, Invalid=1091, Unknown=0, NotChecked=0, Total=1406 [2018-11-23 13:11:18,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2018-11-23 13:11:18,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 62. [2018-11-23 13:11:18,521 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:11:18,521 INFO L82 GeneralOperation]: Start isEquivalent. First operand 152 states. Second operand 62 states. [2018-11-23 13:11:18,521 INFO L74 IsIncluded]: Start isIncluded. First operand 152 states. Second operand 62 states. [2018-11-23 13:11:18,521 INFO L87 Difference]: Start difference. First operand 152 states. Second operand 62 states. [2018-11-23 13:11:18,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:11:18,525 INFO L93 Difference]: Finished difference Result 152 states and 189 transitions. [2018-11-23 13:11:18,525 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 189 transitions. [2018-11-23 13:11:18,526 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:11:18,526 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:11:18,526 INFO L74 IsIncluded]: Start isIncluded. First operand 62 states. Second operand 152 states. [2018-11-23 13:11:18,526 INFO L87 Difference]: Start difference. First operand 62 states. Second operand 152 states. [2018-11-23 13:11:18,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:11:18,530 INFO L93 Difference]: Finished difference Result 152 states and 189 transitions. [2018-11-23 13:11:18,531 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 189 transitions. [2018-11-23 13:11:18,531 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:11:18,531 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:11:18,532 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:11:18,532 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:11:18,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-11-23 13:11:18,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 69 transitions. [2018-11-23 13:11:18,533 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 69 transitions. Word has length 48 [2018-11-23 13:11:18,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:11:18,533 INFO L480 AbstractCegarLoop]: Abstraction has 62 states and 69 transitions. [2018-11-23 13:11:18,534 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-11-23 13:11:18,534 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 69 transitions. [2018-11-23 13:11:18,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-11-23 13:11:18,534 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:11:18,534 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:11:18,535 INFO L423 AbstractCegarLoop]: === Iteration 20 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:11:18,535 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:11:18,535 INFO L82 PathProgramCache]: Analyzing trace with hash 1778035559, now seen corresponding path program 8 times [2018-11-23 13:11:18,535 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:11:18,535 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:11:18,536 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:11:18,536 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:11:18,536 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:11:18,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:11:19,049 INFO L256 TraceCheckUtils]: 0: Hoare triple {9453#true} call ULTIMATE.init(); {9453#true} is VALID [2018-11-23 13:11:19,050 INFO L273 TraceCheckUtils]: 1: Hoare triple {9453#true} assume true; {9453#true} is VALID [2018-11-23 13:11:19,050 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {9453#true} {9453#true} #66#return; {9453#true} is VALID [2018-11-23 13:11:19,050 INFO L256 TraceCheckUtils]: 3: Hoare triple {9453#true} call #t~ret9 := main(); {9453#true} is VALID [2018-11-23 13:11:19,051 INFO L273 TraceCheckUtils]: 4: Hoare triple {9453#true} havoc ~n0~0;havoc ~n1~0;~i0~0 := 0;~k~0 := 0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n0~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~n1~0 := #t~nondet2;havoc #t~nondet2; {9455#(<= 0 main_~k~0)} is VALID [2018-11-23 13:11:19,051 INFO L273 TraceCheckUtils]: 5: Hoare triple {9455#(<= 0 main_~k~0)} assume !!(-1000000 <= ~n0~0 && ~n0~0 < 1000000); {9455#(<= 0 main_~k~0)} is VALID [2018-11-23 13:11:19,052 INFO L273 TraceCheckUtils]: 6: Hoare triple {9455#(<= 0 main_~k~0)} assume !!(-1000000 <= ~n1~0 && ~n1~0 < 1000000); {9455#(<= 0 main_~k~0)} is VALID [2018-11-23 13:11:19,052 INFO L273 TraceCheckUtils]: 7: Hoare triple {9455#(<= 0 main_~k~0)} assume !(~i0~0 < ~n0~0); {9455#(<= 0 main_~k~0)} is VALID [2018-11-23 13:11:19,053 INFO L273 TraceCheckUtils]: 8: Hoare triple {9455#(<= 0 main_~k~0)} ~i1~0 := 0; {9455#(<= 0 main_~k~0)} is VALID [2018-11-23 13:11:19,053 INFO L273 TraceCheckUtils]: 9: Hoare triple {9455#(<= 0 main_~k~0)} assume !!(~i1~0 < ~n1~0);#t~post5 := ~i1~0;~i1~0 := 1 + #t~post5;havoc #t~post5;#t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {9456#(<= 1 main_~k~0)} is VALID [2018-11-23 13:11:19,054 INFO L273 TraceCheckUtils]: 10: Hoare triple {9456#(<= 1 main_~k~0)} assume !!(~i1~0 < ~n1~0);#t~post5 := ~i1~0;~i1~0 := 1 + #t~post5;havoc #t~post5;#t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {9457#(<= 2 main_~k~0)} is VALID [2018-11-23 13:11:19,055 INFO L273 TraceCheckUtils]: 11: Hoare triple {9457#(<= 2 main_~k~0)} assume !!(~i1~0 < ~n1~0);#t~post5 := ~i1~0;~i1~0 := 1 + #t~post5;havoc #t~post5;#t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {9458#(<= 3 main_~k~0)} is VALID [2018-11-23 13:11:19,056 INFO L273 TraceCheckUtils]: 12: Hoare triple {9458#(<= 3 main_~k~0)} assume !!(~i1~0 < ~n1~0);#t~post5 := ~i1~0;~i1~0 := 1 + #t~post5;havoc #t~post5;#t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {9459#(<= 4 main_~k~0)} is VALID [2018-11-23 13:11:19,057 INFO L273 TraceCheckUtils]: 13: Hoare triple {9459#(<= 4 main_~k~0)} assume !!(~i1~0 < ~n1~0);#t~post5 := ~i1~0;~i1~0 := 1 + #t~post5;havoc #t~post5;#t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {9460#(<= 5 main_~k~0)} is VALID [2018-11-23 13:11:19,057 INFO L273 TraceCheckUtils]: 14: Hoare triple {9460#(<= 5 main_~k~0)} assume !(~i1~0 < ~n1~0); {9460#(<= 5 main_~k~0)} is VALID [2018-11-23 13:11:19,058 INFO L273 TraceCheckUtils]: 15: Hoare triple {9460#(<= 5 main_~k~0)} ~j1~0 := 0; {9460#(<= 5 main_~k~0)} is VALID [2018-11-23 13:11:19,058 INFO L273 TraceCheckUtils]: 16: Hoare triple {9460#(<= 5 main_~k~0)} assume !!(~j1~0 < ~n0~0 + ~n1~0); {9460#(<= 5 main_~k~0)} is VALID [2018-11-23 13:11:19,058 INFO L256 TraceCheckUtils]: 17: Hoare triple {9460#(<= 5 main_~k~0)} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {9453#true} is VALID [2018-11-23 13:11:19,059 INFO L273 TraceCheckUtils]: 18: Hoare triple {9453#true} ~cond := #in~cond; {9461#(= __VERIFIER_assert_~cond |__VERIFIER_assert_#in~cond|)} is VALID [2018-11-23 13:11:19,060 INFO L273 TraceCheckUtils]: 19: Hoare triple {9461#(= __VERIFIER_assert_~cond |__VERIFIER_assert_#in~cond|)} assume !(0 == ~cond); {9462#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2018-11-23 13:11:19,060 INFO L273 TraceCheckUtils]: 20: Hoare triple {9462#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {9462#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2018-11-23 13:11:19,061 INFO L268 TraceCheckUtils]: 21: Hoare quadruple {9462#(not (= |__VERIFIER_assert_#in~cond| 0))} {9460#(<= 5 main_~k~0)} #70#return; {9460#(<= 5 main_~k~0)} is VALID [2018-11-23 13:11:19,062 INFO L273 TraceCheckUtils]: 22: Hoare triple {9460#(<= 5 main_~k~0)} #t~post7 := ~j1~0;~j1~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~k~0;~k~0 := #t~post8 - 1;havoc #t~post8; {9459#(<= 4 main_~k~0)} is VALID [2018-11-23 13:11:19,080 INFO L273 TraceCheckUtils]: 23: Hoare triple {9459#(<= 4 main_~k~0)} assume !!(~j1~0 < ~n0~0 + ~n1~0); {9459#(<= 4 main_~k~0)} is VALID [2018-11-23 13:11:19,080 INFO L256 TraceCheckUtils]: 24: Hoare triple {9459#(<= 4 main_~k~0)} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {9453#true} is VALID [2018-11-23 13:11:19,080 INFO L273 TraceCheckUtils]: 25: Hoare triple {9453#true} ~cond := #in~cond; {9453#true} is VALID [2018-11-23 13:11:19,080 INFO L273 TraceCheckUtils]: 26: Hoare triple {9453#true} assume !(0 == ~cond); {9453#true} is VALID [2018-11-23 13:11:19,081 INFO L273 TraceCheckUtils]: 27: Hoare triple {9453#true} assume true; {9453#true} is VALID [2018-11-23 13:11:19,082 INFO L268 TraceCheckUtils]: 28: Hoare quadruple {9453#true} {9459#(<= 4 main_~k~0)} #70#return; {9459#(<= 4 main_~k~0)} is VALID [2018-11-23 13:11:19,082 INFO L273 TraceCheckUtils]: 29: Hoare triple {9459#(<= 4 main_~k~0)} #t~post7 := ~j1~0;~j1~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~k~0;~k~0 := #t~post8 - 1;havoc #t~post8; {9458#(<= 3 main_~k~0)} is VALID [2018-11-23 13:11:19,083 INFO L273 TraceCheckUtils]: 30: Hoare triple {9458#(<= 3 main_~k~0)} assume !!(~j1~0 < ~n0~0 + ~n1~0); {9458#(<= 3 main_~k~0)} is VALID [2018-11-23 13:11:19,083 INFO L256 TraceCheckUtils]: 31: Hoare triple {9458#(<= 3 main_~k~0)} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {9453#true} is VALID [2018-11-23 13:11:19,083 INFO L273 TraceCheckUtils]: 32: Hoare triple {9453#true} ~cond := #in~cond; {9453#true} is VALID [2018-11-23 13:11:19,083 INFO L273 TraceCheckUtils]: 33: Hoare triple {9453#true} assume !(0 == ~cond); {9453#true} is VALID [2018-11-23 13:11:19,083 INFO L273 TraceCheckUtils]: 34: Hoare triple {9453#true} assume true; {9453#true} is VALID [2018-11-23 13:11:19,083 INFO L268 TraceCheckUtils]: 35: Hoare quadruple {9453#true} {9458#(<= 3 main_~k~0)} #70#return; {9458#(<= 3 main_~k~0)} is VALID [2018-11-23 13:11:19,084 INFO L273 TraceCheckUtils]: 36: Hoare triple {9458#(<= 3 main_~k~0)} #t~post7 := ~j1~0;~j1~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~k~0;~k~0 := #t~post8 - 1;havoc #t~post8; {9457#(<= 2 main_~k~0)} is VALID [2018-11-23 13:11:19,084 INFO L273 TraceCheckUtils]: 37: Hoare triple {9457#(<= 2 main_~k~0)} assume !!(~j1~0 < ~n0~0 + ~n1~0); {9457#(<= 2 main_~k~0)} is VALID [2018-11-23 13:11:19,084 INFO L256 TraceCheckUtils]: 38: Hoare triple {9457#(<= 2 main_~k~0)} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {9453#true} is VALID [2018-11-23 13:11:19,085 INFO L273 TraceCheckUtils]: 39: Hoare triple {9453#true} ~cond := #in~cond; {9453#true} is VALID [2018-11-23 13:11:19,085 INFO L273 TraceCheckUtils]: 40: Hoare triple {9453#true} assume !(0 == ~cond); {9453#true} is VALID [2018-11-23 13:11:19,085 INFO L273 TraceCheckUtils]: 41: Hoare triple {9453#true} assume true; {9453#true} is VALID [2018-11-23 13:11:19,085 INFO L268 TraceCheckUtils]: 42: Hoare quadruple {9453#true} {9457#(<= 2 main_~k~0)} #70#return; {9457#(<= 2 main_~k~0)} is VALID [2018-11-23 13:11:19,086 INFO L273 TraceCheckUtils]: 43: Hoare triple {9457#(<= 2 main_~k~0)} #t~post7 := ~j1~0;~j1~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~k~0;~k~0 := #t~post8 - 1;havoc #t~post8; {9456#(<= 1 main_~k~0)} is VALID [2018-11-23 13:11:19,086 INFO L273 TraceCheckUtils]: 44: Hoare triple {9456#(<= 1 main_~k~0)} assume !!(~j1~0 < ~n0~0 + ~n1~0); {9456#(<= 1 main_~k~0)} is VALID [2018-11-23 13:11:19,087 INFO L256 TraceCheckUtils]: 45: Hoare triple {9456#(<= 1 main_~k~0)} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {9462#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2018-11-23 13:11:19,088 INFO L273 TraceCheckUtils]: 46: Hoare triple {9462#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {9463#(not (= __VERIFIER_assert_~cond 0))} is VALID [2018-11-23 13:11:19,088 INFO L273 TraceCheckUtils]: 47: Hoare triple {9463#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {9454#false} is VALID [2018-11-23 13:11:19,088 INFO L273 TraceCheckUtils]: 48: Hoare triple {9454#false} assume !false; {9454#false} is VALID [2018-11-23 13:11:19,091 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 22 proven. 36 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-11-23 13:11:19,091 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:11:19,091 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:11:19,103 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 13:11:19,118 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 13:11:19,118 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:11:19,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:11:19,127 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:11:19,253 INFO L256 TraceCheckUtils]: 0: Hoare triple {9453#true} call ULTIMATE.init(); {9453#true} is VALID [2018-11-23 13:11:19,254 INFO L273 TraceCheckUtils]: 1: Hoare triple {9453#true} assume true; {9453#true} is VALID [2018-11-23 13:11:19,254 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {9453#true} {9453#true} #66#return; {9453#true} is VALID [2018-11-23 13:11:19,254 INFO L256 TraceCheckUtils]: 3: Hoare triple {9453#true} call #t~ret9 := main(); {9453#true} is VALID [2018-11-23 13:11:19,255 INFO L273 TraceCheckUtils]: 4: Hoare triple {9453#true} havoc ~n0~0;havoc ~n1~0;~i0~0 := 0;~k~0 := 0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n0~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~n1~0 := #t~nondet2;havoc #t~nondet2; {9455#(<= 0 main_~k~0)} is VALID [2018-11-23 13:11:19,255 INFO L273 TraceCheckUtils]: 5: Hoare triple {9455#(<= 0 main_~k~0)} assume !!(-1000000 <= ~n0~0 && ~n0~0 < 1000000); {9455#(<= 0 main_~k~0)} is VALID [2018-11-23 13:11:19,256 INFO L273 TraceCheckUtils]: 6: Hoare triple {9455#(<= 0 main_~k~0)} assume !!(-1000000 <= ~n1~0 && ~n1~0 < 1000000); {9455#(<= 0 main_~k~0)} is VALID [2018-11-23 13:11:19,256 INFO L273 TraceCheckUtils]: 7: Hoare triple {9455#(<= 0 main_~k~0)} assume !(~i0~0 < ~n0~0); {9455#(<= 0 main_~k~0)} is VALID [2018-11-23 13:11:19,256 INFO L273 TraceCheckUtils]: 8: Hoare triple {9455#(<= 0 main_~k~0)} ~i1~0 := 0; {9455#(<= 0 main_~k~0)} is VALID [2018-11-23 13:11:19,257 INFO L273 TraceCheckUtils]: 9: Hoare triple {9455#(<= 0 main_~k~0)} assume !!(~i1~0 < ~n1~0);#t~post5 := ~i1~0;~i1~0 := 1 + #t~post5;havoc #t~post5;#t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {9456#(<= 1 main_~k~0)} is VALID [2018-11-23 13:11:19,257 INFO L273 TraceCheckUtils]: 10: Hoare triple {9456#(<= 1 main_~k~0)} assume !!(~i1~0 < ~n1~0);#t~post5 := ~i1~0;~i1~0 := 1 + #t~post5;havoc #t~post5;#t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {9457#(<= 2 main_~k~0)} is VALID [2018-11-23 13:11:19,258 INFO L273 TraceCheckUtils]: 11: Hoare triple {9457#(<= 2 main_~k~0)} assume !!(~i1~0 < ~n1~0);#t~post5 := ~i1~0;~i1~0 := 1 + #t~post5;havoc #t~post5;#t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {9458#(<= 3 main_~k~0)} is VALID [2018-11-23 13:11:19,258 INFO L273 TraceCheckUtils]: 12: Hoare triple {9458#(<= 3 main_~k~0)} assume !!(~i1~0 < ~n1~0);#t~post5 := ~i1~0;~i1~0 := 1 + #t~post5;havoc #t~post5;#t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {9459#(<= 4 main_~k~0)} is VALID [2018-11-23 13:11:19,259 INFO L273 TraceCheckUtils]: 13: Hoare triple {9459#(<= 4 main_~k~0)} assume !!(~i1~0 < ~n1~0);#t~post5 := ~i1~0;~i1~0 := 1 + #t~post5;havoc #t~post5;#t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {9460#(<= 5 main_~k~0)} is VALID [2018-11-23 13:11:19,259 INFO L273 TraceCheckUtils]: 14: Hoare triple {9460#(<= 5 main_~k~0)} assume !(~i1~0 < ~n1~0); {9460#(<= 5 main_~k~0)} is VALID [2018-11-23 13:11:19,260 INFO L273 TraceCheckUtils]: 15: Hoare triple {9460#(<= 5 main_~k~0)} ~j1~0 := 0; {9460#(<= 5 main_~k~0)} is VALID [2018-11-23 13:11:19,260 INFO L273 TraceCheckUtils]: 16: Hoare triple {9460#(<= 5 main_~k~0)} assume !!(~j1~0 < ~n0~0 + ~n1~0); {9460#(<= 5 main_~k~0)} is VALID [2018-11-23 13:11:19,261 INFO L256 TraceCheckUtils]: 17: Hoare triple {9460#(<= 5 main_~k~0)} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {9453#true} is VALID [2018-11-23 13:11:19,261 INFO L273 TraceCheckUtils]: 18: Hoare triple {9453#true} ~cond := #in~cond; {9453#true} is VALID [2018-11-23 13:11:19,261 INFO L273 TraceCheckUtils]: 19: Hoare triple {9453#true} assume !(0 == ~cond); {9453#true} is VALID [2018-11-23 13:11:19,261 INFO L273 TraceCheckUtils]: 20: Hoare triple {9453#true} assume true; {9453#true} is VALID [2018-11-23 13:11:19,262 INFO L268 TraceCheckUtils]: 21: Hoare quadruple {9453#true} {9460#(<= 5 main_~k~0)} #70#return; {9460#(<= 5 main_~k~0)} is VALID [2018-11-23 13:11:19,262 INFO L273 TraceCheckUtils]: 22: Hoare triple {9460#(<= 5 main_~k~0)} #t~post7 := ~j1~0;~j1~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~k~0;~k~0 := #t~post8 - 1;havoc #t~post8; {9459#(<= 4 main_~k~0)} is VALID [2018-11-23 13:11:19,263 INFO L273 TraceCheckUtils]: 23: Hoare triple {9459#(<= 4 main_~k~0)} assume !!(~j1~0 < ~n0~0 + ~n1~0); {9459#(<= 4 main_~k~0)} is VALID [2018-11-23 13:11:19,263 INFO L256 TraceCheckUtils]: 24: Hoare triple {9459#(<= 4 main_~k~0)} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {9453#true} is VALID [2018-11-23 13:11:19,263 INFO L273 TraceCheckUtils]: 25: Hoare triple {9453#true} ~cond := #in~cond; {9453#true} is VALID [2018-11-23 13:11:19,263 INFO L273 TraceCheckUtils]: 26: Hoare triple {9453#true} assume !(0 == ~cond); {9453#true} is VALID [2018-11-23 13:11:19,263 INFO L273 TraceCheckUtils]: 27: Hoare triple {9453#true} assume true; {9453#true} is VALID [2018-11-23 13:11:19,264 INFO L268 TraceCheckUtils]: 28: Hoare quadruple {9453#true} {9459#(<= 4 main_~k~0)} #70#return; {9459#(<= 4 main_~k~0)} is VALID [2018-11-23 13:11:19,264 INFO L273 TraceCheckUtils]: 29: Hoare triple {9459#(<= 4 main_~k~0)} #t~post7 := ~j1~0;~j1~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~k~0;~k~0 := #t~post8 - 1;havoc #t~post8; {9458#(<= 3 main_~k~0)} is VALID [2018-11-23 13:11:19,264 INFO L273 TraceCheckUtils]: 30: Hoare triple {9458#(<= 3 main_~k~0)} assume !!(~j1~0 < ~n0~0 + ~n1~0); {9458#(<= 3 main_~k~0)} is VALID [2018-11-23 13:11:19,265 INFO L256 TraceCheckUtils]: 31: Hoare triple {9458#(<= 3 main_~k~0)} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {9453#true} is VALID [2018-11-23 13:11:19,265 INFO L273 TraceCheckUtils]: 32: Hoare triple {9453#true} ~cond := #in~cond; {9453#true} is VALID [2018-11-23 13:11:19,265 INFO L273 TraceCheckUtils]: 33: Hoare triple {9453#true} assume !(0 == ~cond); {9453#true} is VALID [2018-11-23 13:11:19,265 INFO L273 TraceCheckUtils]: 34: Hoare triple {9453#true} assume true; {9453#true} is VALID [2018-11-23 13:11:19,266 INFO L268 TraceCheckUtils]: 35: Hoare quadruple {9453#true} {9458#(<= 3 main_~k~0)} #70#return; {9458#(<= 3 main_~k~0)} is VALID [2018-11-23 13:11:19,266 INFO L273 TraceCheckUtils]: 36: Hoare triple {9458#(<= 3 main_~k~0)} #t~post7 := ~j1~0;~j1~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~k~0;~k~0 := #t~post8 - 1;havoc #t~post8; {9457#(<= 2 main_~k~0)} is VALID [2018-11-23 13:11:19,267 INFO L273 TraceCheckUtils]: 37: Hoare triple {9457#(<= 2 main_~k~0)} assume !!(~j1~0 < ~n0~0 + ~n1~0); {9457#(<= 2 main_~k~0)} is VALID [2018-11-23 13:11:19,267 INFO L256 TraceCheckUtils]: 38: Hoare triple {9457#(<= 2 main_~k~0)} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {9453#true} is VALID [2018-11-23 13:11:19,267 INFO L273 TraceCheckUtils]: 39: Hoare triple {9453#true} ~cond := #in~cond; {9453#true} is VALID [2018-11-23 13:11:19,267 INFO L273 TraceCheckUtils]: 40: Hoare triple {9453#true} assume !(0 == ~cond); {9453#true} is VALID [2018-11-23 13:11:19,268 INFO L273 TraceCheckUtils]: 41: Hoare triple {9453#true} assume true; {9453#true} is VALID [2018-11-23 13:11:19,268 INFO L268 TraceCheckUtils]: 42: Hoare quadruple {9453#true} {9457#(<= 2 main_~k~0)} #70#return; {9457#(<= 2 main_~k~0)} is VALID [2018-11-23 13:11:19,269 INFO L273 TraceCheckUtils]: 43: Hoare triple {9457#(<= 2 main_~k~0)} #t~post7 := ~j1~0;~j1~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~k~0;~k~0 := #t~post8 - 1;havoc #t~post8; {9456#(<= 1 main_~k~0)} is VALID [2018-11-23 13:11:19,270 INFO L273 TraceCheckUtils]: 44: Hoare triple {9456#(<= 1 main_~k~0)} assume !!(~j1~0 < ~n0~0 + ~n1~0); {9456#(<= 1 main_~k~0)} is VALID [2018-11-23 13:11:19,271 INFO L256 TraceCheckUtils]: 45: Hoare triple {9456#(<= 1 main_~k~0)} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {9602#(= |__VERIFIER_assert_#in~cond| 1)} is VALID [2018-11-23 13:11:19,271 INFO L273 TraceCheckUtils]: 46: Hoare triple {9602#(= |__VERIFIER_assert_#in~cond| 1)} ~cond := #in~cond; {9606#(= 1 __VERIFIER_assert_~cond)} is VALID [2018-11-23 13:11:19,272 INFO L273 TraceCheckUtils]: 47: Hoare triple {9606#(= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {9454#false} is VALID [2018-11-23 13:11:19,272 INFO L273 TraceCheckUtils]: 48: Hoare triple {9454#false} assume !false; {9454#false} is VALID [2018-11-23 13:11:19,274 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 23 proven. 26 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-11-23 13:11:19,293 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:11:19,293 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 13 [2018-11-23 13:11:19,294 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 49 [2018-11-23 13:11:19,294 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:11:19,294 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states. [2018-11-23 13:11:19,333 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:11:19,333 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-23 13:11:19,334 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-23 13:11:19,334 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2018-11-23 13:11:19,334 INFO L87 Difference]: Start difference. First operand 62 states and 69 transitions. Second operand 13 states. [2018-11-23 13:11:20,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:11:20,196 INFO L93 Difference]: Finished difference Result 71 states and 78 transitions. [2018-11-23 13:11:20,196 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-23 13:11:20,197 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 49 [2018-11-23 13:11:20,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:11:20,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-23 13:11:20,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 66 transitions. [2018-11-23 13:11:20,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-23 13:11:20,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 66 transitions. [2018-11-23 13:11:20,200 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 66 transitions. [2018-11-23 13:11:20,415 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:11:20,417 INFO L225 Difference]: With dead ends: 71 [2018-11-23 13:11:20,417 INFO L226 Difference]: Without dead ends: 69 [2018-11-23 13:11:20,418 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2018-11-23 13:11:20,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-11-23 13:11:20,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2018-11-23 13:11:20,580 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:11:20,580 INFO L82 GeneralOperation]: Start isEquivalent. First operand 69 states. Second operand 69 states. [2018-11-23 13:11:20,580 INFO L74 IsIncluded]: Start isIncluded. First operand 69 states. Second operand 69 states. [2018-11-23 13:11:20,580 INFO L87 Difference]: Start difference. First operand 69 states. Second operand 69 states. [2018-11-23 13:11:20,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:11:20,582 INFO L93 Difference]: Finished difference Result 69 states and 76 transitions. [2018-11-23 13:11:20,582 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 76 transitions. [2018-11-23 13:11:20,582 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:11:20,582 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:11:20,583 INFO L74 IsIncluded]: Start isIncluded. First operand 69 states. Second operand 69 states. [2018-11-23 13:11:20,583 INFO L87 Difference]: Start difference. First operand 69 states. Second operand 69 states. [2018-11-23 13:11:20,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:11:20,584 INFO L93 Difference]: Finished difference Result 69 states and 76 transitions. [2018-11-23 13:11:20,584 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 76 transitions. [2018-11-23 13:11:20,584 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:11:20,585 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:11:20,585 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:11:20,585 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:11:20,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-11-23 13:11:20,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 76 transitions. [2018-11-23 13:11:20,586 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 76 transitions. Word has length 49 [2018-11-23 13:11:20,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:11:20,587 INFO L480 AbstractCegarLoop]: Abstraction has 69 states and 76 transitions. [2018-11-23 13:11:20,587 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-23 13:11:20,587 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 76 transitions. [2018-11-23 13:11:20,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-11-23 13:11:20,587 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:11:20,588 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:11:20,588 INFO L423 AbstractCegarLoop]: === Iteration 21 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:11:20,588 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:11:20,588 INFO L82 PathProgramCache]: Analyzing trace with hash 928790640, now seen corresponding path program 9 times [2018-11-23 13:11:20,588 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:11:20,588 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:11:20,589 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:11:20,589 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:11:20,589 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:11:20,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:11:20,837 INFO L256 TraceCheckUtils]: 0: Hoare triple {9962#true} call ULTIMATE.init(); {9962#true} is VALID [2018-11-23 13:11:20,837 INFO L273 TraceCheckUtils]: 1: Hoare triple {9962#true} assume true; {9962#true} is VALID [2018-11-23 13:11:20,838 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {9962#true} {9962#true} #66#return; {9962#true} is VALID [2018-11-23 13:11:20,838 INFO L256 TraceCheckUtils]: 3: Hoare triple {9962#true} call #t~ret9 := main(); {9962#true} is VALID [2018-11-23 13:11:20,839 INFO L273 TraceCheckUtils]: 4: Hoare triple {9962#true} havoc ~n0~0;havoc ~n1~0;~i0~0 := 0;~k~0 := 0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n0~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~n1~0 := #t~nondet2;havoc #t~nondet2; {9964#(<= main_~i0~0 0)} is VALID [2018-11-23 13:11:20,839 INFO L273 TraceCheckUtils]: 5: Hoare triple {9964#(<= main_~i0~0 0)} assume !!(-1000000 <= ~n0~0 && ~n0~0 < 1000000); {9964#(<= main_~i0~0 0)} is VALID [2018-11-23 13:11:20,839 INFO L273 TraceCheckUtils]: 6: Hoare triple {9964#(<= main_~i0~0 0)} assume !!(-1000000 <= ~n1~0 && ~n1~0 < 1000000); {9964#(<= main_~i0~0 0)} is VALID [2018-11-23 13:11:20,840 INFO L273 TraceCheckUtils]: 7: Hoare triple {9964#(<= main_~i0~0 0)} assume !(~i0~0 < ~n0~0); {9965#(<= main_~n0~0 0)} is VALID [2018-11-23 13:11:20,840 INFO L273 TraceCheckUtils]: 8: Hoare triple {9965#(<= main_~n0~0 0)} ~i1~0 := 0; {9966#(<= (+ main_~i1~0 main_~n0~0) 0)} is VALID [2018-11-23 13:11:20,841 INFO L273 TraceCheckUtils]: 9: Hoare triple {9966#(<= (+ main_~i1~0 main_~n0~0) 0)} assume !!(~i1~0 < ~n1~0);#t~post5 := ~i1~0;~i1~0 := 1 + #t~post5;havoc #t~post5;#t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {9967#(<= (+ main_~i1~0 main_~n0~0) 1)} is VALID [2018-11-23 13:11:20,841 INFO L273 TraceCheckUtils]: 10: Hoare triple {9967#(<= (+ main_~i1~0 main_~n0~0) 1)} assume !!(~i1~0 < ~n1~0);#t~post5 := ~i1~0;~i1~0 := 1 + #t~post5;havoc #t~post5;#t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {9968#(<= (+ main_~i1~0 main_~n0~0) 2)} is VALID [2018-11-23 13:11:20,842 INFO L273 TraceCheckUtils]: 11: Hoare triple {9968#(<= (+ main_~i1~0 main_~n0~0) 2)} assume !!(~i1~0 < ~n1~0);#t~post5 := ~i1~0;~i1~0 := 1 + #t~post5;havoc #t~post5;#t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {9969#(<= (+ main_~i1~0 main_~n0~0) 3)} is VALID [2018-11-23 13:11:20,843 INFO L273 TraceCheckUtils]: 12: Hoare triple {9969#(<= (+ main_~i1~0 main_~n0~0) 3)} assume !!(~i1~0 < ~n1~0);#t~post5 := ~i1~0;~i1~0 := 1 + #t~post5;havoc #t~post5;#t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {9970#(<= (+ main_~i1~0 main_~n0~0) 4)} is VALID [2018-11-23 13:11:20,844 INFO L273 TraceCheckUtils]: 13: Hoare triple {9970#(<= (+ main_~i1~0 main_~n0~0) 4)} assume !!(~i1~0 < ~n1~0);#t~post5 := ~i1~0;~i1~0 := 1 + #t~post5;havoc #t~post5;#t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {9971#(<= (+ main_~i1~0 main_~n0~0) 5)} is VALID [2018-11-23 13:11:20,845 INFO L273 TraceCheckUtils]: 14: Hoare triple {9971#(<= (+ main_~i1~0 main_~n0~0) 5)} assume !(~i1~0 < ~n1~0); {9972#(<= (+ main_~n0~0 main_~n1~0) 5)} is VALID [2018-11-23 13:11:20,845 INFO L273 TraceCheckUtils]: 15: Hoare triple {9972#(<= (+ main_~n0~0 main_~n1~0) 5)} ~j1~0 := 0; {9973#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 5))} is VALID [2018-11-23 13:11:20,846 INFO L273 TraceCheckUtils]: 16: Hoare triple {9973#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 5))} assume !!(~j1~0 < ~n0~0 + ~n1~0); {9973#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 5))} is VALID [2018-11-23 13:11:20,846 INFO L256 TraceCheckUtils]: 17: Hoare triple {9973#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 5))} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {9962#true} is VALID [2018-11-23 13:11:20,846 INFO L273 TraceCheckUtils]: 18: Hoare triple {9962#true} ~cond := #in~cond; {9962#true} is VALID [2018-11-23 13:11:20,846 INFO L273 TraceCheckUtils]: 19: Hoare triple {9962#true} assume !(0 == ~cond); {9962#true} is VALID [2018-11-23 13:11:20,847 INFO L273 TraceCheckUtils]: 20: Hoare triple {9962#true} assume true; {9962#true} is VALID [2018-11-23 13:11:20,847 INFO L268 TraceCheckUtils]: 21: Hoare quadruple {9962#true} {9973#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 5))} #70#return; {9973#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 5))} is VALID [2018-11-23 13:11:20,848 INFO L273 TraceCheckUtils]: 22: Hoare triple {9973#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 5))} #t~post7 := ~j1~0;~j1~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~k~0;~k~0 := #t~post8 - 1;havoc #t~post8; {9974#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 4))} is VALID [2018-11-23 13:11:20,849 INFO L273 TraceCheckUtils]: 23: Hoare triple {9974#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 4))} assume !!(~j1~0 < ~n0~0 + ~n1~0); {9974#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 4))} is VALID [2018-11-23 13:11:20,849 INFO L256 TraceCheckUtils]: 24: Hoare triple {9974#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 4))} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {9962#true} is VALID [2018-11-23 13:11:20,849 INFO L273 TraceCheckUtils]: 25: Hoare triple {9962#true} ~cond := #in~cond; {9962#true} is VALID [2018-11-23 13:11:20,849 INFO L273 TraceCheckUtils]: 26: Hoare triple {9962#true} assume !(0 == ~cond); {9962#true} is VALID [2018-11-23 13:11:20,849 INFO L273 TraceCheckUtils]: 27: Hoare triple {9962#true} assume true; {9962#true} is VALID [2018-11-23 13:11:20,850 INFO L268 TraceCheckUtils]: 28: Hoare quadruple {9962#true} {9974#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 4))} #70#return; {9974#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 4))} is VALID [2018-11-23 13:11:20,850 INFO L273 TraceCheckUtils]: 29: Hoare triple {9974#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 4))} #t~post7 := ~j1~0;~j1~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~k~0;~k~0 := #t~post8 - 1;havoc #t~post8; {9975#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 3))} is VALID [2018-11-23 13:11:20,850 INFO L273 TraceCheckUtils]: 30: Hoare triple {9975#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 3))} assume !!(~j1~0 < ~n0~0 + ~n1~0); {9975#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 3))} is VALID [2018-11-23 13:11:20,851 INFO L256 TraceCheckUtils]: 31: Hoare triple {9975#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 3))} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {9962#true} is VALID [2018-11-23 13:11:20,851 INFO L273 TraceCheckUtils]: 32: Hoare triple {9962#true} ~cond := #in~cond; {9962#true} is VALID [2018-11-23 13:11:20,851 INFO L273 TraceCheckUtils]: 33: Hoare triple {9962#true} assume !(0 == ~cond); {9962#true} is VALID [2018-11-23 13:11:20,851 INFO L273 TraceCheckUtils]: 34: Hoare triple {9962#true} assume true; {9962#true} is VALID [2018-11-23 13:11:20,852 INFO L268 TraceCheckUtils]: 35: Hoare quadruple {9962#true} {9975#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 3))} #70#return; {9975#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 3))} is VALID [2018-11-23 13:11:20,852 INFO L273 TraceCheckUtils]: 36: Hoare triple {9975#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 3))} #t~post7 := ~j1~0;~j1~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~k~0;~k~0 := #t~post8 - 1;havoc #t~post8; {9976#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 2))} is VALID [2018-11-23 13:11:20,853 INFO L273 TraceCheckUtils]: 37: Hoare triple {9976#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 2))} assume !!(~j1~0 < ~n0~0 + ~n1~0); {9976#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 2))} is VALID [2018-11-23 13:11:20,853 INFO L256 TraceCheckUtils]: 38: Hoare triple {9976#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 2))} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {9962#true} is VALID [2018-11-23 13:11:20,853 INFO L273 TraceCheckUtils]: 39: Hoare triple {9962#true} ~cond := #in~cond; {9962#true} is VALID [2018-11-23 13:11:20,854 INFO L273 TraceCheckUtils]: 40: Hoare triple {9962#true} assume !(0 == ~cond); {9962#true} is VALID [2018-11-23 13:11:20,854 INFO L273 TraceCheckUtils]: 41: Hoare triple {9962#true} assume true; {9962#true} is VALID [2018-11-23 13:11:20,855 INFO L268 TraceCheckUtils]: 42: Hoare quadruple {9962#true} {9976#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 2))} #70#return; {9976#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 2))} is VALID [2018-11-23 13:11:20,855 INFO L273 TraceCheckUtils]: 43: Hoare triple {9976#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 2))} #t~post7 := ~j1~0;~j1~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~k~0;~k~0 := #t~post8 - 1;havoc #t~post8; {9977#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 1))} is VALID [2018-11-23 13:11:20,856 INFO L273 TraceCheckUtils]: 44: Hoare triple {9977#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 1))} assume !!(~j1~0 < ~n0~0 + ~n1~0); {9977#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 1))} is VALID [2018-11-23 13:11:20,856 INFO L256 TraceCheckUtils]: 45: Hoare triple {9977#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 1))} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {9962#true} is VALID [2018-11-23 13:11:20,856 INFO L273 TraceCheckUtils]: 46: Hoare triple {9962#true} ~cond := #in~cond; {9962#true} is VALID [2018-11-23 13:11:20,856 INFO L273 TraceCheckUtils]: 47: Hoare triple {9962#true} assume !(0 == ~cond); {9962#true} is VALID [2018-11-23 13:11:20,857 INFO L273 TraceCheckUtils]: 48: Hoare triple {9962#true} assume true; {9962#true} is VALID [2018-11-23 13:11:20,857 INFO L268 TraceCheckUtils]: 49: Hoare quadruple {9962#true} {9977#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 1))} #70#return; {9977#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 1))} is VALID [2018-11-23 13:11:20,858 INFO L273 TraceCheckUtils]: 50: Hoare triple {9977#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 1))} #t~post7 := ~j1~0;~j1~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~k~0;~k~0 := #t~post8 - 1;havoc #t~post8; {9978#(<= (+ main_~n0~0 main_~n1~0) main_~j1~0)} is VALID [2018-11-23 13:11:20,859 INFO L273 TraceCheckUtils]: 51: Hoare triple {9978#(<= (+ main_~n0~0 main_~n1~0) main_~j1~0)} assume !!(~j1~0 < ~n0~0 + ~n1~0); {9963#false} is VALID [2018-11-23 13:11:20,859 INFO L256 TraceCheckUtils]: 52: Hoare triple {9963#false} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {9963#false} is VALID [2018-11-23 13:11:20,859 INFO L273 TraceCheckUtils]: 53: Hoare triple {9963#false} ~cond := #in~cond; {9963#false} is VALID [2018-11-23 13:11:20,859 INFO L273 TraceCheckUtils]: 54: Hoare triple {9963#false} assume 0 == ~cond; {9963#false} is VALID [2018-11-23 13:11:20,860 INFO L273 TraceCheckUtils]: 55: Hoare triple {9963#false} assume !false; {9963#false} is VALID [2018-11-23 13:11:20,864 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 50 proven. 15 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-11-23 13:11:20,864 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:11:20,864 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:11:20,872 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 13:11:20,892 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-11-23 13:11:20,892 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:11:20,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:11:20,906 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:11:21,290 INFO L256 TraceCheckUtils]: 0: Hoare triple {9962#true} call ULTIMATE.init(); {9962#true} is VALID [2018-11-23 13:11:21,290 INFO L273 TraceCheckUtils]: 1: Hoare triple {9962#true} assume true; {9962#true} is VALID [2018-11-23 13:11:21,290 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {9962#true} {9962#true} #66#return; {9962#true} is VALID [2018-11-23 13:11:21,290 INFO L256 TraceCheckUtils]: 3: Hoare triple {9962#true} call #t~ret9 := main(); {9962#true} is VALID [2018-11-23 13:11:21,291 INFO L273 TraceCheckUtils]: 4: Hoare triple {9962#true} havoc ~n0~0;havoc ~n1~0;~i0~0 := 0;~k~0 := 0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n0~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~n1~0 := #t~nondet2;havoc #t~nondet2; {9964#(<= main_~i0~0 0)} is VALID [2018-11-23 13:11:21,292 INFO L273 TraceCheckUtils]: 5: Hoare triple {9964#(<= main_~i0~0 0)} assume !!(-1000000 <= ~n0~0 && ~n0~0 < 1000000); {9964#(<= main_~i0~0 0)} is VALID [2018-11-23 13:11:21,292 INFO L273 TraceCheckUtils]: 6: Hoare triple {9964#(<= main_~i0~0 0)} assume !!(-1000000 <= ~n1~0 && ~n1~0 < 1000000); {9964#(<= main_~i0~0 0)} is VALID [2018-11-23 13:11:21,293 INFO L273 TraceCheckUtils]: 7: Hoare triple {9964#(<= main_~i0~0 0)} assume !(~i0~0 < ~n0~0); {9965#(<= main_~n0~0 0)} is VALID [2018-11-23 13:11:21,293 INFO L273 TraceCheckUtils]: 8: Hoare triple {9965#(<= main_~n0~0 0)} ~i1~0 := 0; {10006#(and (<= main_~i1~0 0) (<= main_~n0~0 0))} is VALID [2018-11-23 13:11:21,293 INFO L273 TraceCheckUtils]: 9: Hoare triple {10006#(and (<= main_~i1~0 0) (<= main_~n0~0 0))} assume !!(~i1~0 < ~n1~0);#t~post5 := ~i1~0;~i1~0 := 1 + #t~post5;havoc #t~post5;#t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {10010#(and (<= main_~i1~0 1) (<= main_~n0~0 0))} is VALID [2018-11-23 13:11:21,294 INFO L273 TraceCheckUtils]: 10: Hoare triple {10010#(and (<= main_~i1~0 1) (<= main_~n0~0 0))} assume !!(~i1~0 < ~n1~0);#t~post5 := ~i1~0;~i1~0 := 1 + #t~post5;havoc #t~post5;#t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {10014#(and (<= main_~i1~0 2) (<= main_~n0~0 0))} is VALID [2018-11-23 13:11:21,295 INFO L273 TraceCheckUtils]: 11: Hoare triple {10014#(and (<= main_~i1~0 2) (<= main_~n0~0 0))} assume !!(~i1~0 < ~n1~0);#t~post5 := ~i1~0;~i1~0 := 1 + #t~post5;havoc #t~post5;#t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {10018#(and (<= main_~n0~0 0) (<= main_~i1~0 3))} is VALID [2018-11-23 13:11:21,296 INFO L273 TraceCheckUtils]: 12: Hoare triple {10018#(and (<= main_~n0~0 0) (<= main_~i1~0 3))} assume !!(~i1~0 < ~n1~0);#t~post5 := ~i1~0;~i1~0 := 1 + #t~post5;havoc #t~post5;#t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {10022#(and (<= main_~i1~0 4) (<= main_~n0~0 0))} is VALID [2018-11-23 13:11:21,297 INFO L273 TraceCheckUtils]: 13: Hoare triple {10022#(and (<= main_~i1~0 4) (<= main_~n0~0 0))} assume !!(~i1~0 < ~n1~0);#t~post5 := ~i1~0;~i1~0 := 1 + #t~post5;havoc #t~post5;#t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {10026#(and (<= main_~i1~0 5) (<= main_~n0~0 0))} is VALID [2018-11-23 13:11:21,298 INFO L273 TraceCheckUtils]: 14: Hoare triple {10026#(and (<= main_~i1~0 5) (<= main_~n0~0 0))} assume !(~i1~0 < ~n1~0); {10030#(and (<= main_~n1~0 5) (<= main_~n0~0 0))} is VALID [2018-11-23 13:11:21,298 INFO L273 TraceCheckUtils]: 15: Hoare triple {10030#(and (<= main_~n1~0 5) (<= main_~n0~0 0))} ~j1~0 := 0; {10034#(and (<= main_~n1~0 5) (<= 0 main_~j1~0) (<= main_~n0~0 0))} is VALID [2018-11-23 13:11:21,299 INFO L273 TraceCheckUtils]: 16: Hoare triple {10034#(and (<= main_~n1~0 5) (<= 0 main_~j1~0) (<= main_~n0~0 0))} assume !!(~j1~0 < ~n0~0 + ~n1~0); {10034#(and (<= main_~n1~0 5) (<= 0 main_~j1~0) (<= main_~n0~0 0))} is VALID [2018-11-23 13:11:21,299 INFO L256 TraceCheckUtils]: 17: Hoare triple {10034#(and (<= main_~n1~0 5) (<= 0 main_~j1~0) (<= main_~n0~0 0))} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {9962#true} is VALID [2018-11-23 13:11:21,299 INFO L273 TraceCheckUtils]: 18: Hoare triple {9962#true} ~cond := #in~cond; {9962#true} is VALID [2018-11-23 13:11:21,300 INFO L273 TraceCheckUtils]: 19: Hoare triple {9962#true} assume !(0 == ~cond); {9962#true} is VALID [2018-11-23 13:11:21,300 INFO L273 TraceCheckUtils]: 20: Hoare triple {9962#true} assume true; {9962#true} is VALID [2018-11-23 13:11:21,301 INFO L268 TraceCheckUtils]: 21: Hoare quadruple {9962#true} {10034#(and (<= main_~n1~0 5) (<= 0 main_~j1~0) (<= main_~n0~0 0))} #70#return; {10034#(and (<= main_~n1~0 5) (<= 0 main_~j1~0) (<= main_~n0~0 0))} is VALID [2018-11-23 13:11:21,302 INFO L273 TraceCheckUtils]: 22: Hoare triple {10034#(and (<= main_~n1~0 5) (<= 0 main_~j1~0) (<= main_~n0~0 0))} #t~post7 := ~j1~0;~j1~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~k~0;~k~0 := #t~post8 - 1;havoc #t~post8; {10056#(and (<= main_~n1~0 5) (<= 1 main_~j1~0) (<= main_~n0~0 0))} is VALID [2018-11-23 13:11:21,302 INFO L273 TraceCheckUtils]: 23: Hoare triple {10056#(and (<= main_~n1~0 5) (<= 1 main_~j1~0) (<= main_~n0~0 0))} assume !!(~j1~0 < ~n0~0 + ~n1~0); {10056#(and (<= main_~n1~0 5) (<= 1 main_~j1~0) (<= main_~n0~0 0))} is VALID [2018-11-23 13:11:21,303 INFO L256 TraceCheckUtils]: 24: Hoare triple {10056#(and (<= main_~n1~0 5) (<= 1 main_~j1~0) (<= main_~n0~0 0))} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {9962#true} is VALID [2018-11-23 13:11:21,303 INFO L273 TraceCheckUtils]: 25: Hoare triple {9962#true} ~cond := #in~cond; {9962#true} is VALID [2018-11-23 13:11:21,303 INFO L273 TraceCheckUtils]: 26: Hoare triple {9962#true} assume !(0 == ~cond); {9962#true} is VALID [2018-11-23 13:11:21,303 INFO L273 TraceCheckUtils]: 27: Hoare triple {9962#true} assume true; {9962#true} is VALID [2018-11-23 13:11:21,304 INFO L268 TraceCheckUtils]: 28: Hoare quadruple {9962#true} {10056#(and (<= main_~n1~0 5) (<= 1 main_~j1~0) (<= main_~n0~0 0))} #70#return; {10056#(and (<= main_~n1~0 5) (<= 1 main_~j1~0) (<= main_~n0~0 0))} is VALID [2018-11-23 13:11:21,305 INFO L273 TraceCheckUtils]: 29: Hoare triple {10056#(and (<= main_~n1~0 5) (<= 1 main_~j1~0) (<= main_~n0~0 0))} #t~post7 := ~j1~0;~j1~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~k~0;~k~0 := #t~post8 - 1;havoc #t~post8; {10078#(and (<= main_~n1~0 5) (<= main_~n0~0 0) (<= 2 main_~j1~0))} is VALID [2018-11-23 13:11:21,305 INFO L273 TraceCheckUtils]: 30: Hoare triple {10078#(and (<= main_~n1~0 5) (<= main_~n0~0 0) (<= 2 main_~j1~0))} assume !!(~j1~0 < ~n0~0 + ~n1~0); {10078#(and (<= main_~n1~0 5) (<= main_~n0~0 0) (<= 2 main_~j1~0))} is VALID [2018-11-23 13:11:21,306 INFO L256 TraceCheckUtils]: 31: Hoare triple {10078#(and (<= main_~n1~0 5) (<= main_~n0~0 0) (<= 2 main_~j1~0))} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {9962#true} is VALID [2018-11-23 13:11:21,306 INFO L273 TraceCheckUtils]: 32: Hoare triple {9962#true} ~cond := #in~cond; {9962#true} is VALID [2018-11-23 13:11:21,306 INFO L273 TraceCheckUtils]: 33: Hoare triple {9962#true} assume !(0 == ~cond); {9962#true} is VALID [2018-11-23 13:11:21,306 INFO L273 TraceCheckUtils]: 34: Hoare triple {9962#true} assume true; {9962#true} is VALID [2018-11-23 13:11:21,306 INFO L268 TraceCheckUtils]: 35: Hoare quadruple {9962#true} {10078#(and (<= main_~n1~0 5) (<= main_~n0~0 0) (<= 2 main_~j1~0))} #70#return; {10078#(and (<= main_~n1~0 5) (<= main_~n0~0 0) (<= 2 main_~j1~0))} is VALID [2018-11-23 13:11:21,307 INFO L273 TraceCheckUtils]: 36: Hoare triple {10078#(and (<= main_~n1~0 5) (<= main_~n0~0 0) (<= 2 main_~j1~0))} #t~post7 := ~j1~0;~j1~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~k~0;~k~0 := #t~post8 - 1;havoc #t~post8; {10100#(and (<= main_~n1~0 5) (<= 3 main_~j1~0) (<= main_~n0~0 0))} is VALID [2018-11-23 13:11:21,308 INFO L273 TraceCheckUtils]: 37: Hoare triple {10100#(and (<= main_~n1~0 5) (<= 3 main_~j1~0) (<= main_~n0~0 0))} assume !!(~j1~0 < ~n0~0 + ~n1~0); {10100#(and (<= main_~n1~0 5) (<= 3 main_~j1~0) (<= main_~n0~0 0))} is VALID [2018-11-23 13:11:21,308 INFO L256 TraceCheckUtils]: 38: Hoare triple {10100#(and (<= main_~n1~0 5) (<= 3 main_~j1~0) (<= main_~n0~0 0))} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {9962#true} is VALID [2018-11-23 13:11:21,308 INFO L273 TraceCheckUtils]: 39: Hoare triple {9962#true} ~cond := #in~cond; {9962#true} is VALID [2018-11-23 13:11:21,308 INFO L273 TraceCheckUtils]: 40: Hoare triple {9962#true} assume !(0 == ~cond); {9962#true} is VALID [2018-11-23 13:11:21,309 INFO L273 TraceCheckUtils]: 41: Hoare triple {9962#true} assume true; {9962#true} is VALID [2018-11-23 13:11:21,309 INFO L268 TraceCheckUtils]: 42: Hoare quadruple {9962#true} {10100#(and (<= main_~n1~0 5) (<= 3 main_~j1~0) (<= main_~n0~0 0))} #70#return; {10100#(and (<= main_~n1~0 5) (<= 3 main_~j1~0) (<= main_~n0~0 0))} is VALID [2018-11-23 13:11:21,310 INFO L273 TraceCheckUtils]: 43: Hoare triple {10100#(and (<= main_~n1~0 5) (<= 3 main_~j1~0) (<= main_~n0~0 0))} #t~post7 := ~j1~0;~j1~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~k~0;~k~0 := #t~post8 - 1;havoc #t~post8; {10122#(and (<= main_~n1~0 5) (<= 4 main_~j1~0) (<= main_~n0~0 0))} is VALID [2018-11-23 13:11:21,311 INFO L273 TraceCheckUtils]: 44: Hoare triple {10122#(and (<= main_~n1~0 5) (<= 4 main_~j1~0) (<= main_~n0~0 0))} assume !!(~j1~0 < ~n0~0 + ~n1~0); {10122#(and (<= main_~n1~0 5) (<= 4 main_~j1~0) (<= main_~n0~0 0))} is VALID [2018-11-23 13:11:21,311 INFO L256 TraceCheckUtils]: 45: Hoare triple {10122#(and (<= main_~n1~0 5) (<= 4 main_~j1~0) (<= main_~n0~0 0))} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {9962#true} is VALID [2018-11-23 13:11:21,311 INFO L273 TraceCheckUtils]: 46: Hoare triple {9962#true} ~cond := #in~cond; {9962#true} is VALID [2018-11-23 13:11:21,312 INFO L273 TraceCheckUtils]: 47: Hoare triple {9962#true} assume !(0 == ~cond); {9962#true} is VALID [2018-11-23 13:11:21,312 INFO L273 TraceCheckUtils]: 48: Hoare triple {9962#true} assume true; {9962#true} is VALID [2018-11-23 13:11:21,313 INFO L268 TraceCheckUtils]: 49: Hoare quadruple {9962#true} {10122#(and (<= main_~n1~0 5) (<= 4 main_~j1~0) (<= main_~n0~0 0))} #70#return; {10122#(and (<= main_~n1~0 5) (<= 4 main_~j1~0) (<= main_~n0~0 0))} is VALID [2018-11-23 13:11:21,314 INFO L273 TraceCheckUtils]: 50: Hoare triple {10122#(and (<= main_~n1~0 5) (<= 4 main_~j1~0) (<= main_~n0~0 0))} #t~post7 := ~j1~0;~j1~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~k~0;~k~0 := #t~post8 - 1;havoc #t~post8; {10144#(and (<= main_~n1~0 5) (<= main_~n0~0 0) (<= 5 main_~j1~0))} is VALID [2018-11-23 13:11:21,314 INFO L273 TraceCheckUtils]: 51: Hoare triple {10144#(and (<= main_~n1~0 5) (<= main_~n0~0 0) (<= 5 main_~j1~0))} assume !!(~j1~0 < ~n0~0 + ~n1~0); {9963#false} is VALID [2018-11-23 13:11:21,314 INFO L256 TraceCheckUtils]: 52: Hoare triple {9963#false} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {9963#false} is VALID [2018-11-23 13:11:21,315 INFO L273 TraceCheckUtils]: 53: Hoare triple {9963#false} ~cond := #in~cond; {9963#false} is VALID [2018-11-23 13:11:21,315 INFO L273 TraceCheckUtils]: 54: Hoare triple {9963#false} assume 0 == ~cond; {9963#false} is VALID [2018-11-23 13:11:21,315 INFO L273 TraceCheckUtils]: 55: Hoare triple {9963#false} assume !false; {9963#false} is VALID [2018-11-23 13:11:21,318 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 50 proven. 15 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-11-23 13:11:21,336 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:11:21,337 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 30 [2018-11-23 13:11:21,337 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 56 [2018-11-23 13:11:21,337 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:11:21,337 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 30 states. [2018-11-23 13:11:21,407 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 73 edges. 73 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:11:21,407 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-11-23 13:11:21,408 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-11-23 13:11:21,408 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=185, Invalid=685, Unknown=0, NotChecked=0, Total=870 [2018-11-23 13:11:21,408 INFO L87 Difference]: Start difference. First operand 69 states and 76 transitions. Second operand 30 states. [2018-11-23 13:11:23,879 WARN L180 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 8 [2018-11-23 13:11:24,634 WARN L180 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2018-11-23 13:11:26,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:11:26,870 INFO L93 Difference]: Finished difference Result 119 states and 139 transitions. [2018-11-23 13:11:26,870 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-23 13:11:26,870 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 56 [2018-11-23 13:11:26,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:11:26,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-23 13:11:26,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 70 transitions. [2018-11-23 13:11:26,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-23 13:11:26,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 70 transitions. [2018-11-23 13:11:26,873 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states and 70 transitions. [2018-11-23 13:11:26,949 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:11:26,952 INFO L225 Difference]: With dead ends: 119 [2018-11-23 13:11:26,952 INFO L226 Difference]: Without dead ends: 93 [2018-11-23 13:11:26,953 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 478 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=409, Invalid=1483, Unknown=0, NotChecked=0, Total=1892 [2018-11-23 13:11:26,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2018-11-23 13:11:27,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 70. [2018-11-23 13:11:27,244 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:11:27,244 INFO L82 GeneralOperation]: Start isEquivalent. First operand 93 states. Second operand 70 states. [2018-11-23 13:11:27,244 INFO L74 IsIncluded]: Start isIncluded. First operand 93 states. Second operand 70 states. [2018-11-23 13:11:27,244 INFO L87 Difference]: Start difference. First operand 93 states. Second operand 70 states. [2018-11-23 13:11:27,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:11:27,246 INFO L93 Difference]: Finished difference Result 93 states and 107 transitions. [2018-11-23 13:11:27,246 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 107 transitions. [2018-11-23 13:11:27,246 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:11:27,246 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:11:27,247 INFO L74 IsIncluded]: Start isIncluded. First operand 70 states. Second operand 93 states. [2018-11-23 13:11:27,247 INFO L87 Difference]: Start difference. First operand 70 states. Second operand 93 states. [2018-11-23 13:11:27,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:11:27,248 INFO L93 Difference]: Finished difference Result 93 states and 107 transitions. [2018-11-23 13:11:27,249 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 107 transitions. [2018-11-23 13:11:27,249 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:11:27,249 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:11:27,249 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:11:27,250 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:11:27,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-11-23 13:11:27,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 77 transitions. [2018-11-23 13:11:27,251 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 77 transitions. Word has length 56 [2018-11-23 13:11:27,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:11:27,251 INFO L480 AbstractCegarLoop]: Abstraction has 70 states and 77 transitions. [2018-11-23 13:11:27,252 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-11-23 13:11:27,252 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 77 transitions. [2018-11-23 13:11:27,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-11-23 13:11:27,252 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:11:27,253 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:11:27,253 INFO L423 AbstractCegarLoop]: === Iteration 22 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:11:27,253 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:11:27,253 INFO L82 PathProgramCache]: Analyzing trace with hash -1167832849, now seen corresponding path program 7 times [2018-11-23 13:11:27,253 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:11:27,254 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:11:27,254 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:11:27,254 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:11:27,255 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:11:27,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:11:28,140 INFO L256 TraceCheckUtils]: 0: Hoare triple {10663#true} call ULTIMATE.init(); {10663#true} is VALID [2018-11-23 13:11:28,140 INFO L273 TraceCheckUtils]: 1: Hoare triple {10663#true} assume true; {10663#true} is VALID [2018-11-23 13:11:28,141 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {10663#true} {10663#true} #66#return; {10663#true} is VALID [2018-11-23 13:11:28,141 INFO L256 TraceCheckUtils]: 3: Hoare triple {10663#true} call #t~ret9 := main(); {10663#true} is VALID [2018-11-23 13:11:28,141 INFO L273 TraceCheckUtils]: 4: Hoare triple {10663#true} havoc ~n0~0;havoc ~n1~0;~i0~0 := 0;~k~0 := 0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n0~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~n1~0 := #t~nondet2;havoc #t~nondet2; {10665#(<= main_~i0~0 0)} is VALID [2018-11-23 13:11:28,142 INFO L273 TraceCheckUtils]: 5: Hoare triple {10665#(<= main_~i0~0 0)} assume !!(-1000000 <= ~n0~0 && ~n0~0 < 1000000); {10665#(<= main_~i0~0 0)} is VALID [2018-11-23 13:11:28,142 INFO L273 TraceCheckUtils]: 6: Hoare triple {10665#(<= main_~i0~0 0)} assume !!(-1000000 <= ~n1~0 && ~n1~0 < 1000000); {10665#(<= main_~i0~0 0)} is VALID [2018-11-23 13:11:28,144 INFO L273 TraceCheckUtils]: 7: Hoare triple {10665#(<= main_~i0~0 0)} assume !!(~i0~0 < ~n0~0);#t~post3 := ~i0~0;~i0~0 := 1 + #t~post3;havoc #t~post3;#t~post4 := ~k~0;~k~0 := 1 + #t~post4;havoc #t~post4; {10666#(<= main_~i0~0 1)} is VALID [2018-11-23 13:11:28,145 INFO L273 TraceCheckUtils]: 8: Hoare triple {10666#(<= main_~i0~0 1)} assume !(~i0~0 < ~n0~0); {10667#(<= main_~n0~0 1)} is VALID [2018-11-23 13:11:28,145 INFO L273 TraceCheckUtils]: 9: Hoare triple {10667#(<= main_~n0~0 1)} ~i1~0 := 0; {10668#(<= (+ main_~i1~0 main_~n0~0) 1)} is VALID [2018-11-23 13:11:28,146 INFO L273 TraceCheckUtils]: 10: Hoare triple {10668#(<= (+ main_~i1~0 main_~n0~0) 1)} assume !!(~i1~0 < ~n1~0);#t~post5 := ~i1~0;~i1~0 := 1 + #t~post5;havoc #t~post5;#t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {10669#(<= (+ main_~i1~0 main_~n0~0) 2)} is VALID [2018-11-23 13:11:28,147 INFO L273 TraceCheckUtils]: 11: Hoare triple {10669#(<= (+ main_~i1~0 main_~n0~0) 2)} assume !!(~i1~0 < ~n1~0);#t~post5 := ~i1~0;~i1~0 := 1 + #t~post5;havoc #t~post5;#t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {10670#(<= (+ main_~i1~0 main_~n0~0) 3)} is VALID [2018-11-23 13:11:28,147 INFO L273 TraceCheckUtils]: 12: Hoare triple {10670#(<= (+ main_~i1~0 main_~n0~0) 3)} assume !!(~i1~0 < ~n1~0);#t~post5 := ~i1~0;~i1~0 := 1 + #t~post5;havoc #t~post5;#t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {10671#(<= (+ main_~i1~0 main_~n0~0) 4)} is VALID [2018-11-23 13:11:28,148 INFO L273 TraceCheckUtils]: 13: Hoare triple {10671#(<= (+ main_~i1~0 main_~n0~0) 4)} assume !!(~i1~0 < ~n1~0);#t~post5 := ~i1~0;~i1~0 := 1 + #t~post5;havoc #t~post5;#t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {10672#(<= (+ main_~i1~0 main_~n0~0) 5)} is VALID [2018-11-23 13:11:28,148 INFO L273 TraceCheckUtils]: 14: Hoare triple {10672#(<= (+ main_~i1~0 main_~n0~0) 5)} assume !(~i1~0 < ~n1~0); {10673#(<= (+ main_~n0~0 main_~n1~0) 5)} is VALID [2018-11-23 13:11:28,149 INFO L273 TraceCheckUtils]: 15: Hoare triple {10673#(<= (+ main_~n0~0 main_~n1~0) 5)} ~j1~0 := 0; {10674#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 5))} is VALID [2018-11-23 13:11:28,149 INFO L273 TraceCheckUtils]: 16: Hoare triple {10674#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 5))} assume !!(~j1~0 < ~n0~0 + ~n1~0); {10674#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 5))} is VALID [2018-11-23 13:11:28,149 INFO L256 TraceCheckUtils]: 17: Hoare triple {10674#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 5))} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {10663#true} is VALID [2018-11-23 13:11:28,149 INFO L273 TraceCheckUtils]: 18: Hoare triple {10663#true} ~cond := #in~cond; {10663#true} is VALID [2018-11-23 13:11:28,150 INFO L273 TraceCheckUtils]: 19: Hoare triple {10663#true} assume !(0 == ~cond); {10663#true} is VALID [2018-11-23 13:11:28,150 INFO L273 TraceCheckUtils]: 20: Hoare triple {10663#true} assume true; {10663#true} is VALID [2018-11-23 13:11:28,150 INFO L268 TraceCheckUtils]: 21: Hoare quadruple {10663#true} {10674#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 5))} #70#return; {10674#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 5))} is VALID [2018-11-23 13:11:28,151 INFO L273 TraceCheckUtils]: 22: Hoare triple {10674#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 5))} #t~post7 := ~j1~0;~j1~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~k~0;~k~0 := #t~post8 - 1;havoc #t~post8; {10675#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 4))} is VALID [2018-11-23 13:11:28,152 INFO L273 TraceCheckUtils]: 23: Hoare triple {10675#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 4))} assume !!(~j1~0 < ~n0~0 + ~n1~0); {10675#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 4))} is VALID [2018-11-23 13:11:28,152 INFO L256 TraceCheckUtils]: 24: Hoare triple {10675#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 4))} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {10663#true} is VALID [2018-11-23 13:11:28,152 INFO L273 TraceCheckUtils]: 25: Hoare triple {10663#true} ~cond := #in~cond; {10663#true} is VALID [2018-11-23 13:11:28,152 INFO L273 TraceCheckUtils]: 26: Hoare triple {10663#true} assume !(0 == ~cond); {10663#true} is VALID [2018-11-23 13:11:28,153 INFO L273 TraceCheckUtils]: 27: Hoare triple {10663#true} assume true; {10663#true} is VALID [2018-11-23 13:11:28,153 INFO L268 TraceCheckUtils]: 28: Hoare quadruple {10663#true} {10675#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 4))} #70#return; {10675#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 4))} is VALID [2018-11-23 13:11:28,154 INFO L273 TraceCheckUtils]: 29: Hoare triple {10675#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 4))} #t~post7 := ~j1~0;~j1~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~k~0;~k~0 := #t~post8 - 1;havoc #t~post8; {10676#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 3))} is VALID [2018-11-23 13:11:28,155 INFO L273 TraceCheckUtils]: 30: Hoare triple {10676#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 3))} assume !!(~j1~0 < ~n0~0 + ~n1~0); {10676#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 3))} is VALID [2018-11-23 13:11:28,155 INFO L256 TraceCheckUtils]: 31: Hoare triple {10676#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 3))} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {10663#true} is VALID [2018-11-23 13:11:28,155 INFO L273 TraceCheckUtils]: 32: Hoare triple {10663#true} ~cond := #in~cond; {10663#true} is VALID [2018-11-23 13:11:28,155 INFO L273 TraceCheckUtils]: 33: Hoare triple {10663#true} assume !(0 == ~cond); {10663#true} is VALID [2018-11-23 13:11:28,155 INFO L273 TraceCheckUtils]: 34: Hoare triple {10663#true} assume true; {10663#true} is VALID [2018-11-23 13:11:28,156 INFO L268 TraceCheckUtils]: 35: Hoare quadruple {10663#true} {10676#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 3))} #70#return; {10676#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 3))} is VALID [2018-11-23 13:11:28,157 INFO L273 TraceCheckUtils]: 36: Hoare triple {10676#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 3))} #t~post7 := ~j1~0;~j1~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~k~0;~k~0 := #t~post8 - 1;havoc #t~post8; {10677#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 2))} is VALID [2018-11-23 13:11:28,158 INFO L273 TraceCheckUtils]: 37: Hoare triple {10677#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 2))} assume !!(~j1~0 < ~n0~0 + ~n1~0); {10677#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 2))} is VALID [2018-11-23 13:11:28,158 INFO L256 TraceCheckUtils]: 38: Hoare triple {10677#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 2))} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {10663#true} is VALID [2018-11-23 13:11:28,158 INFO L273 TraceCheckUtils]: 39: Hoare triple {10663#true} ~cond := #in~cond; {10663#true} is VALID [2018-11-23 13:11:28,158 INFO L273 TraceCheckUtils]: 40: Hoare triple {10663#true} assume !(0 == ~cond); {10663#true} is VALID [2018-11-23 13:11:28,158 INFO L273 TraceCheckUtils]: 41: Hoare triple {10663#true} assume true; {10663#true} is VALID [2018-11-23 13:11:28,159 INFO L268 TraceCheckUtils]: 42: Hoare quadruple {10663#true} {10677#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 2))} #70#return; {10677#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 2))} is VALID [2018-11-23 13:11:28,160 INFO L273 TraceCheckUtils]: 43: Hoare triple {10677#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 2))} #t~post7 := ~j1~0;~j1~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~k~0;~k~0 := #t~post8 - 1;havoc #t~post8; {10678#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 1))} is VALID [2018-11-23 13:11:28,160 INFO L273 TraceCheckUtils]: 44: Hoare triple {10678#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 1))} assume !!(~j1~0 < ~n0~0 + ~n1~0); {10678#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 1))} is VALID [2018-11-23 13:11:28,161 INFO L256 TraceCheckUtils]: 45: Hoare triple {10678#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 1))} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {10663#true} is VALID [2018-11-23 13:11:28,161 INFO L273 TraceCheckUtils]: 46: Hoare triple {10663#true} ~cond := #in~cond; {10663#true} is VALID [2018-11-23 13:11:28,161 INFO L273 TraceCheckUtils]: 47: Hoare triple {10663#true} assume !(0 == ~cond); {10663#true} is VALID [2018-11-23 13:11:28,161 INFO L273 TraceCheckUtils]: 48: Hoare triple {10663#true} assume true; {10663#true} is VALID [2018-11-23 13:11:28,162 INFO L268 TraceCheckUtils]: 49: Hoare quadruple {10663#true} {10678#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 1))} #70#return; {10678#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 1))} is VALID [2018-11-23 13:11:28,163 INFO L273 TraceCheckUtils]: 50: Hoare triple {10678#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 1))} #t~post7 := ~j1~0;~j1~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~k~0;~k~0 := #t~post8 - 1;havoc #t~post8; {10679#(<= (+ main_~n0~0 main_~n1~0) main_~j1~0)} is VALID [2018-11-23 13:11:28,163 INFO L273 TraceCheckUtils]: 51: Hoare triple {10679#(<= (+ main_~n0~0 main_~n1~0) main_~j1~0)} assume !!(~j1~0 < ~n0~0 + ~n1~0); {10664#false} is VALID [2018-11-23 13:11:28,164 INFO L256 TraceCheckUtils]: 52: Hoare triple {10664#false} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {10664#false} is VALID [2018-11-23 13:11:28,164 INFO L273 TraceCheckUtils]: 53: Hoare triple {10664#false} ~cond := #in~cond; {10664#false} is VALID [2018-11-23 13:11:28,164 INFO L273 TraceCheckUtils]: 54: Hoare triple {10664#false} assume 0 == ~cond; {10664#false} is VALID [2018-11-23 13:11:28,164 INFO L273 TraceCheckUtils]: 55: Hoare triple {10664#false} assume !false; {10664#false} is VALID [2018-11-23 13:11:28,168 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 50 proven. 11 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-11-23 13:11:28,168 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:11:28,169 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:11:28,177 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:11:28,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:11:28,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:11:28,205 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:11:28,561 INFO L256 TraceCheckUtils]: 0: Hoare triple {10663#true} call ULTIMATE.init(); {10663#true} is VALID [2018-11-23 13:11:28,561 INFO L273 TraceCheckUtils]: 1: Hoare triple {10663#true} assume true; {10663#true} is VALID [2018-11-23 13:11:28,562 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {10663#true} {10663#true} #66#return; {10663#true} is VALID [2018-11-23 13:11:28,562 INFO L256 TraceCheckUtils]: 3: Hoare triple {10663#true} call #t~ret9 := main(); {10663#true} is VALID [2018-11-23 13:11:28,563 INFO L273 TraceCheckUtils]: 4: Hoare triple {10663#true} havoc ~n0~0;havoc ~n1~0;~i0~0 := 0;~k~0 := 0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n0~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~n1~0 := #t~nondet2;havoc #t~nondet2; {10665#(<= main_~i0~0 0)} is VALID [2018-11-23 13:11:28,563 INFO L273 TraceCheckUtils]: 5: Hoare triple {10665#(<= main_~i0~0 0)} assume !!(-1000000 <= ~n0~0 && ~n0~0 < 1000000); {10665#(<= main_~i0~0 0)} is VALID [2018-11-23 13:11:28,564 INFO L273 TraceCheckUtils]: 6: Hoare triple {10665#(<= main_~i0~0 0)} assume !!(-1000000 <= ~n1~0 && ~n1~0 < 1000000); {10665#(<= main_~i0~0 0)} is VALID [2018-11-23 13:11:28,564 INFO L273 TraceCheckUtils]: 7: Hoare triple {10665#(<= main_~i0~0 0)} assume !!(~i0~0 < ~n0~0);#t~post3 := ~i0~0;~i0~0 := 1 + #t~post3;havoc #t~post3;#t~post4 := ~k~0;~k~0 := 1 + #t~post4;havoc #t~post4; {10666#(<= main_~i0~0 1)} is VALID [2018-11-23 13:11:28,565 INFO L273 TraceCheckUtils]: 8: Hoare triple {10666#(<= main_~i0~0 1)} assume !(~i0~0 < ~n0~0); {10667#(<= main_~n0~0 1)} is VALID [2018-11-23 13:11:28,565 INFO L273 TraceCheckUtils]: 9: Hoare triple {10667#(<= main_~n0~0 1)} ~i1~0 := 0; {10710#(and (<= main_~i1~0 0) (<= main_~n0~0 1))} is VALID [2018-11-23 13:11:28,566 INFO L273 TraceCheckUtils]: 10: Hoare triple {10710#(and (<= main_~i1~0 0) (<= main_~n0~0 1))} assume !!(~i1~0 < ~n1~0);#t~post5 := ~i1~0;~i1~0 := 1 + #t~post5;havoc #t~post5;#t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {10714#(and (<= main_~i1~0 1) (<= main_~n0~0 1))} is VALID [2018-11-23 13:11:28,566 INFO L273 TraceCheckUtils]: 11: Hoare triple {10714#(and (<= main_~i1~0 1) (<= main_~n0~0 1))} assume !!(~i1~0 < ~n1~0);#t~post5 := ~i1~0;~i1~0 := 1 + #t~post5;havoc #t~post5;#t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {10718#(and (<= main_~i1~0 2) (<= main_~n0~0 1))} is VALID [2018-11-23 13:11:28,567 INFO L273 TraceCheckUtils]: 12: Hoare triple {10718#(and (<= main_~i1~0 2) (<= main_~n0~0 1))} assume !!(~i1~0 < ~n1~0);#t~post5 := ~i1~0;~i1~0 := 1 + #t~post5;havoc #t~post5;#t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {10722#(and (<= main_~i1~0 3) (<= main_~n0~0 1))} is VALID [2018-11-23 13:11:28,568 INFO L273 TraceCheckUtils]: 13: Hoare triple {10722#(and (<= main_~i1~0 3) (<= main_~n0~0 1))} assume !!(~i1~0 < ~n1~0);#t~post5 := ~i1~0;~i1~0 := 1 + #t~post5;havoc #t~post5;#t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {10726#(and (<= main_~i1~0 4) (<= main_~n0~0 1))} is VALID [2018-11-23 13:11:28,569 INFO L273 TraceCheckUtils]: 14: Hoare triple {10726#(and (<= main_~i1~0 4) (<= main_~n0~0 1))} assume !(~i1~0 < ~n1~0); {10730#(and (<= main_~n1~0 4) (<= main_~n0~0 1))} is VALID [2018-11-23 13:11:28,570 INFO L273 TraceCheckUtils]: 15: Hoare triple {10730#(and (<= main_~n1~0 4) (<= main_~n0~0 1))} ~j1~0 := 0; {10734#(and (<= main_~n1~0 4) (<= 0 main_~j1~0) (<= main_~n0~0 1))} is VALID [2018-11-23 13:11:28,570 INFO L273 TraceCheckUtils]: 16: Hoare triple {10734#(and (<= main_~n1~0 4) (<= 0 main_~j1~0) (<= main_~n0~0 1))} assume !!(~j1~0 < ~n0~0 + ~n1~0); {10734#(and (<= main_~n1~0 4) (<= 0 main_~j1~0) (<= main_~n0~0 1))} is VALID [2018-11-23 13:11:28,570 INFO L256 TraceCheckUtils]: 17: Hoare triple {10734#(and (<= main_~n1~0 4) (<= 0 main_~j1~0) (<= main_~n0~0 1))} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {10663#true} is VALID [2018-11-23 13:11:28,571 INFO L273 TraceCheckUtils]: 18: Hoare triple {10663#true} ~cond := #in~cond; {10663#true} is VALID [2018-11-23 13:11:28,571 INFO L273 TraceCheckUtils]: 19: Hoare triple {10663#true} assume !(0 == ~cond); {10663#true} is VALID [2018-11-23 13:11:28,571 INFO L273 TraceCheckUtils]: 20: Hoare triple {10663#true} assume true; {10663#true} is VALID [2018-11-23 13:11:28,572 INFO L268 TraceCheckUtils]: 21: Hoare quadruple {10663#true} {10734#(and (<= main_~n1~0 4) (<= 0 main_~j1~0) (<= main_~n0~0 1))} #70#return; {10734#(and (<= main_~n1~0 4) (<= 0 main_~j1~0) (<= main_~n0~0 1))} is VALID [2018-11-23 13:11:28,573 INFO L273 TraceCheckUtils]: 22: Hoare triple {10734#(and (<= main_~n1~0 4) (<= 0 main_~j1~0) (<= main_~n0~0 1))} #t~post7 := ~j1~0;~j1~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~k~0;~k~0 := #t~post8 - 1;havoc #t~post8; {10756#(and (<= 1 main_~j1~0) (<= main_~n1~0 4) (<= main_~n0~0 1))} is VALID [2018-11-23 13:11:28,573 INFO L273 TraceCheckUtils]: 23: Hoare triple {10756#(and (<= 1 main_~j1~0) (<= main_~n1~0 4) (<= main_~n0~0 1))} assume !!(~j1~0 < ~n0~0 + ~n1~0); {10756#(and (<= 1 main_~j1~0) (<= main_~n1~0 4) (<= main_~n0~0 1))} is VALID [2018-11-23 13:11:28,574 INFO L256 TraceCheckUtils]: 24: Hoare triple {10756#(and (<= 1 main_~j1~0) (<= main_~n1~0 4) (<= main_~n0~0 1))} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {10663#true} is VALID [2018-11-23 13:11:28,574 INFO L273 TraceCheckUtils]: 25: Hoare triple {10663#true} ~cond := #in~cond; {10663#true} is VALID [2018-11-23 13:11:28,574 INFO L273 TraceCheckUtils]: 26: Hoare triple {10663#true} assume !(0 == ~cond); {10663#true} is VALID [2018-11-23 13:11:28,574 INFO L273 TraceCheckUtils]: 27: Hoare triple {10663#true} assume true; {10663#true} is VALID [2018-11-23 13:11:28,575 INFO L268 TraceCheckUtils]: 28: Hoare quadruple {10663#true} {10756#(and (<= 1 main_~j1~0) (<= main_~n1~0 4) (<= main_~n0~0 1))} #70#return; {10756#(and (<= 1 main_~j1~0) (<= main_~n1~0 4) (<= main_~n0~0 1))} is VALID [2018-11-23 13:11:28,576 INFO L273 TraceCheckUtils]: 29: Hoare triple {10756#(and (<= 1 main_~j1~0) (<= main_~n1~0 4) (<= main_~n0~0 1))} #t~post7 := ~j1~0;~j1~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~k~0;~k~0 := #t~post8 - 1;havoc #t~post8; {10778#(and (<= main_~n1~0 4) (<= main_~n0~0 1) (<= 2 main_~j1~0))} is VALID [2018-11-23 13:11:28,576 INFO L273 TraceCheckUtils]: 30: Hoare triple {10778#(and (<= main_~n1~0 4) (<= main_~n0~0 1) (<= 2 main_~j1~0))} assume !!(~j1~0 < ~n0~0 + ~n1~0); {10778#(and (<= main_~n1~0 4) (<= main_~n0~0 1) (<= 2 main_~j1~0))} is VALID [2018-11-23 13:11:28,577 INFO L256 TraceCheckUtils]: 31: Hoare triple {10778#(and (<= main_~n1~0 4) (<= main_~n0~0 1) (<= 2 main_~j1~0))} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {10663#true} is VALID [2018-11-23 13:11:28,577 INFO L273 TraceCheckUtils]: 32: Hoare triple {10663#true} ~cond := #in~cond; {10663#true} is VALID [2018-11-23 13:11:28,577 INFO L273 TraceCheckUtils]: 33: Hoare triple {10663#true} assume !(0 == ~cond); {10663#true} is VALID [2018-11-23 13:11:28,577 INFO L273 TraceCheckUtils]: 34: Hoare triple {10663#true} assume true; {10663#true} is VALID [2018-11-23 13:11:28,578 INFO L268 TraceCheckUtils]: 35: Hoare quadruple {10663#true} {10778#(and (<= main_~n1~0 4) (<= main_~n0~0 1) (<= 2 main_~j1~0))} #70#return; {10778#(and (<= main_~n1~0 4) (<= main_~n0~0 1) (<= 2 main_~j1~0))} is VALID [2018-11-23 13:11:28,579 INFO L273 TraceCheckUtils]: 36: Hoare triple {10778#(and (<= main_~n1~0 4) (<= main_~n0~0 1) (<= 2 main_~j1~0))} #t~post7 := ~j1~0;~j1~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~k~0;~k~0 := #t~post8 - 1;havoc #t~post8; {10800#(and (<= main_~n1~0 4) (<= 3 main_~j1~0) (<= main_~n0~0 1))} is VALID [2018-11-23 13:11:28,580 INFO L273 TraceCheckUtils]: 37: Hoare triple {10800#(and (<= main_~n1~0 4) (<= 3 main_~j1~0) (<= main_~n0~0 1))} assume !!(~j1~0 < ~n0~0 + ~n1~0); {10800#(and (<= main_~n1~0 4) (<= 3 main_~j1~0) (<= main_~n0~0 1))} is VALID [2018-11-23 13:11:28,580 INFO L256 TraceCheckUtils]: 38: Hoare triple {10800#(and (<= main_~n1~0 4) (<= 3 main_~j1~0) (<= main_~n0~0 1))} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {10663#true} is VALID [2018-11-23 13:11:28,580 INFO L273 TraceCheckUtils]: 39: Hoare triple {10663#true} ~cond := #in~cond; {10663#true} is VALID [2018-11-23 13:11:28,580 INFO L273 TraceCheckUtils]: 40: Hoare triple {10663#true} assume !(0 == ~cond); {10663#true} is VALID [2018-11-23 13:11:28,581 INFO L273 TraceCheckUtils]: 41: Hoare triple {10663#true} assume true; {10663#true} is VALID [2018-11-23 13:11:28,581 INFO L268 TraceCheckUtils]: 42: Hoare quadruple {10663#true} {10800#(and (<= main_~n1~0 4) (<= 3 main_~j1~0) (<= main_~n0~0 1))} #70#return; {10800#(and (<= main_~n1~0 4) (<= 3 main_~j1~0) (<= main_~n0~0 1))} is VALID [2018-11-23 13:11:28,582 INFO L273 TraceCheckUtils]: 43: Hoare triple {10800#(and (<= main_~n1~0 4) (<= 3 main_~j1~0) (<= main_~n0~0 1))} #t~post7 := ~j1~0;~j1~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~k~0;~k~0 := #t~post8 - 1;havoc #t~post8; {10822#(and (<= main_~n1~0 4) (<= 4 main_~j1~0) (<= main_~n0~0 1))} is VALID [2018-11-23 13:11:28,583 INFO L273 TraceCheckUtils]: 44: Hoare triple {10822#(and (<= main_~n1~0 4) (<= 4 main_~j1~0) (<= main_~n0~0 1))} assume !!(~j1~0 < ~n0~0 + ~n1~0); {10822#(and (<= main_~n1~0 4) (<= 4 main_~j1~0) (<= main_~n0~0 1))} is VALID [2018-11-23 13:11:28,583 INFO L256 TraceCheckUtils]: 45: Hoare triple {10822#(and (<= main_~n1~0 4) (<= 4 main_~j1~0) (<= main_~n0~0 1))} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {10663#true} is VALID [2018-11-23 13:11:28,583 INFO L273 TraceCheckUtils]: 46: Hoare triple {10663#true} ~cond := #in~cond; {10663#true} is VALID [2018-11-23 13:11:28,584 INFO L273 TraceCheckUtils]: 47: Hoare triple {10663#true} assume !(0 == ~cond); {10663#true} is VALID [2018-11-23 13:11:28,584 INFO L273 TraceCheckUtils]: 48: Hoare triple {10663#true} assume true; {10663#true} is VALID [2018-11-23 13:11:28,585 INFO L268 TraceCheckUtils]: 49: Hoare quadruple {10663#true} {10822#(and (<= main_~n1~0 4) (<= 4 main_~j1~0) (<= main_~n0~0 1))} #70#return; {10822#(and (<= main_~n1~0 4) (<= 4 main_~j1~0) (<= main_~n0~0 1))} is VALID [2018-11-23 13:11:28,585 INFO L273 TraceCheckUtils]: 50: Hoare triple {10822#(and (<= main_~n1~0 4) (<= 4 main_~j1~0) (<= main_~n0~0 1))} #t~post7 := ~j1~0;~j1~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~k~0;~k~0 := #t~post8 - 1;havoc #t~post8; {10844#(and (<= main_~n1~0 4) (<= 5 main_~j1~0) (<= main_~n0~0 1))} is VALID [2018-11-23 13:11:28,586 INFO L273 TraceCheckUtils]: 51: Hoare triple {10844#(and (<= main_~n1~0 4) (<= 5 main_~j1~0) (<= main_~n0~0 1))} assume !!(~j1~0 < ~n0~0 + ~n1~0); {10664#false} is VALID [2018-11-23 13:11:28,586 INFO L256 TraceCheckUtils]: 52: Hoare triple {10664#false} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {10664#false} is VALID [2018-11-23 13:11:28,587 INFO L273 TraceCheckUtils]: 53: Hoare triple {10664#false} ~cond := #in~cond; {10664#false} is VALID [2018-11-23 13:11:28,587 INFO L273 TraceCheckUtils]: 54: Hoare triple {10664#false} assume 0 == ~cond; {10664#false} is VALID [2018-11-23 13:11:28,587 INFO L273 TraceCheckUtils]: 55: Hoare triple {10664#false} assume !false; {10664#false} is VALID [2018-11-23 13:11:28,593 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 50 proven. 11 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-11-23 13:11:28,612 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:11:28,613 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 29 [2018-11-23 13:11:28,613 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 56 [2018-11-23 13:11:28,613 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:11:28,613 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 29 states. [2018-11-23 13:11:28,680 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 72 edges. 72 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:11:28,680 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-11-23 13:11:28,680 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-11-23 13:11:28,681 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=167, Invalid=645, Unknown=0, NotChecked=0, Total=812 [2018-11-23 13:11:28,681 INFO L87 Difference]: Start difference. First operand 70 states and 77 transitions. Second operand 29 states. [2018-11-23 13:11:32,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:11:32,068 INFO L93 Difference]: Finished difference Result 142 states and 169 transitions. [2018-11-23 13:11:32,068 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-11-23 13:11:32,068 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 56 [2018-11-23 13:11:32,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:11:32,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-11-23 13:11:32,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 84 transitions. [2018-11-23 13:11:32,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-11-23 13:11:32,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 84 transitions. [2018-11-23 13:11:32,071 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 23 states and 84 transitions. [2018-11-23 13:11:32,148 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 84 edges. 84 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:11:32,151 INFO L225 Difference]: With dead ends: 142 [2018-11-23 13:11:32,152 INFO L226 Difference]: Without dead ends: 116 [2018-11-23 13:11:32,153 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 589 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=465, Invalid=1791, Unknown=0, NotChecked=0, Total=2256 [2018-11-23 13:11:32,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2018-11-23 13:11:32,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 70. [2018-11-23 13:11:32,400 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:11:32,400 INFO L82 GeneralOperation]: Start isEquivalent. First operand 116 states. Second operand 70 states. [2018-11-23 13:11:32,400 INFO L74 IsIncluded]: Start isIncluded. First operand 116 states. Second operand 70 states. [2018-11-23 13:11:32,400 INFO L87 Difference]: Start difference. First operand 116 states. Second operand 70 states. [2018-11-23 13:11:32,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:11:32,403 INFO L93 Difference]: Finished difference Result 116 states and 137 transitions. [2018-11-23 13:11:32,403 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 137 transitions. [2018-11-23 13:11:32,404 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:11:32,404 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:11:32,404 INFO L74 IsIncluded]: Start isIncluded. First operand 70 states. Second operand 116 states. [2018-11-23 13:11:32,404 INFO L87 Difference]: Start difference. First operand 70 states. Second operand 116 states. [2018-11-23 13:11:32,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:11:32,407 INFO L93 Difference]: Finished difference Result 116 states and 137 transitions. [2018-11-23 13:11:32,407 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 137 transitions. [2018-11-23 13:11:32,408 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:11:32,408 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:11:32,408 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:11:32,408 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:11:32,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-11-23 13:11:32,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 77 transitions. [2018-11-23 13:11:32,409 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 77 transitions. Word has length 56 [2018-11-23 13:11:32,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:11:32,410 INFO L480 AbstractCegarLoop]: Abstraction has 70 states and 77 transitions. [2018-11-23 13:11:32,410 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-11-23 13:11:32,410 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 77 transitions. [2018-11-23 13:11:32,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-11-23 13:11:32,410 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:11:32,411 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:11:32,411 INFO L423 AbstractCegarLoop]: === Iteration 23 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:11:32,411 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:11:32,411 INFO L82 PathProgramCache]: Analyzing trace with hash -404181872, now seen corresponding path program 8 times [2018-11-23 13:11:32,411 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:11:32,411 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:11:32,412 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:11:32,412 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:11:32,412 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:11:32,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:11:32,637 INFO L256 TraceCheckUtils]: 0: Hoare triple {11459#true} call ULTIMATE.init(); {11459#true} is VALID [2018-11-23 13:11:32,637 INFO L273 TraceCheckUtils]: 1: Hoare triple {11459#true} assume true; {11459#true} is VALID [2018-11-23 13:11:32,637 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {11459#true} {11459#true} #66#return; {11459#true} is VALID [2018-11-23 13:11:32,637 INFO L256 TraceCheckUtils]: 3: Hoare triple {11459#true} call #t~ret9 := main(); {11459#true} is VALID [2018-11-23 13:11:32,638 INFO L273 TraceCheckUtils]: 4: Hoare triple {11459#true} havoc ~n0~0;havoc ~n1~0;~i0~0 := 0;~k~0 := 0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n0~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~n1~0 := #t~nondet2;havoc #t~nondet2; {11461#(<= main_~i0~0 0)} is VALID [2018-11-23 13:11:32,639 INFO L273 TraceCheckUtils]: 5: Hoare triple {11461#(<= main_~i0~0 0)} assume !!(-1000000 <= ~n0~0 && ~n0~0 < 1000000); {11461#(<= main_~i0~0 0)} is VALID [2018-11-23 13:11:32,639 INFO L273 TraceCheckUtils]: 6: Hoare triple {11461#(<= main_~i0~0 0)} assume !!(-1000000 <= ~n1~0 && ~n1~0 < 1000000); {11461#(<= main_~i0~0 0)} is VALID [2018-11-23 13:11:32,640 INFO L273 TraceCheckUtils]: 7: Hoare triple {11461#(<= main_~i0~0 0)} assume !!(~i0~0 < ~n0~0);#t~post3 := ~i0~0;~i0~0 := 1 + #t~post3;havoc #t~post3;#t~post4 := ~k~0;~k~0 := 1 + #t~post4;havoc #t~post4; {11462#(<= main_~i0~0 1)} is VALID [2018-11-23 13:11:32,640 INFO L273 TraceCheckUtils]: 8: Hoare triple {11462#(<= main_~i0~0 1)} assume !!(~i0~0 < ~n0~0);#t~post3 := ~i0~0;~i0~0 := 1 + #t~post3;havoc #t~post3;#t~post4 := ~k~0;~k~0 := 1 + #t~post4;havoc #t~post4; {11463#(<= main_~i0~0 2)} is VALID [2018-11-23 13:11:32,641 INFO L273 TraceCheckUtils]: 9: Hoare triple {11463#(<= main_~i0~0 2)} assume !(~i0~0 < ~n0~0); {11464#(<= main_~n0~0 2)} is VALID [2018-11-23 13:11:32,641 INFO L273 TraceCheckUtils]: 10: Hoare triple {11464#(<= main_~n0~0 2)} ~i1~0 := 0; {11465#(<= (+ main_~i1~0 main_~n0~0) 2)} is VALID [2018-11-23 13:11:32,642 INFO L273 TraceCheckUtils]: 11: Hoare triple {11465#(<= (+ main_~i1~0 main_~n0~0) 2)} assume !!(~i1~0 < ~n1~0);#t~post5 := ~i1~0;~i1~0 := 1 + #t~post5;havoc #t~post5;#t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {11466#(<= (+ main_~i1~0 main_~n0~0) 3)} is VALID [2018-11-23 13:11:32,643 INFO L273 TraceCheckUtils]: 12: Hoare triple {11466#(<= (+ main_~i1~0 main_~n0~0) 3)} assume !!(~i1~0 < ~n1~0);#t~post5 := ~i1~0;~i1~0 := 1 + #t~post5;havoc #t~post5;#t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {11467#(<= (+ main_~i1~0 main_~n0~0) 4)} is VALID [2018-11-23 13:11:32,644 INFO L273 TraceCheckUtils]: 13: Hoare triple {11467#(<= (+ main_~i1~0 main_~n0~0) 4)} assume !!(~i1~0 < ~n1~0);#t~post5 := ~i1~0;~i1~0 := 1 + #t~post5;havoc #t~post5;#t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {11468#(<= (+ main_~i1~0 main_~n0~0) 5)} is VALID [2018-11-23 13:11:32,644 INFO L273 TraceCheckUtils]: 14: Hoare triple {11468#(<= (+ main_~i1~0 main_~n0~0) 5)} assume !(~i1~0 < ~n1~0); {11469#(<= (+ main_~n0~0 main_~n1~0) 5)} is VALID [2018-11-23 13:11:32,645 INFO L273 TraceCheckUtils]: 15: Hoare triple {11469#(<= (+ main_~n0~0 main_~n1~0) 5)} ~j1~0 := 0; {11470#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 5))} is VALID [2018-11-23 13:11:32,646 INFO L273 TraceCheckUtils]: 16: Hoare triple {11470#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 5))} assume !!(~j1~0 < ~n0~0 + ~n1~0); {11470#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 5))} is VALID [2018-11-23 13:11:32,646 INFO L256 TraceCheckUtils]: 17: Hoare triple {11470#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 5))} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {11459#true} is VALID [2018-11-23 13:11:32,646 INFO L273 TraceCheckUtils]: 18: Hoare triple {11459#true} ~cond := #in~cond; {11459#true} is VALID [2018-11-23 13:11:32,647 INFO L273 TraceCheckUtils]: 19: Hoare triple {11459#true} assume !(0 == ~cond); {11459#true} is VALID [2018-11-23 13:11:32,648 INFO L273 TraceCheckUtils]: 20: Hoare triple {11459#true} assume true; {11459#true} is VALID [2018-11-23 13:11:32,650 INFO L268 TraceCheckUtils]: 21: Hoare quadruple {11459#true} {11470#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 5))} #70#return; {11470#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 5))} is VALID [2018-11-23 13:11:32,650 INFO L273 TraceCheckUtils]: 22: Hoare triple {11470#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 5))} #t~post7 := ~j1~0;~j1~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~k~0;~k~0 := #t~post8 - 1;havoc #t~post8; {11471#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 4))} is VALID [2018-11-23 13:11:32,651 INFO L273 TraceCheckUtils]: 23: Hoare triple {11471#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 4))} assume !!(~j1~0 < ~n0~0 + ~n1~0); {11471#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 4))} is VALID [2018-11-23 13:11:32,651 INFO L256 TraceCheckUtils]: 24: Hoare triple {11471#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 4))} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {11459#true} is VALID [2018-11-23 13:11:32,651 INFO L273 TraceCheckUtils]: 25: Hoare triple {11459#true} ~cond := #in~cond; {11459#true} is VALID [2018-11-23 13:11:32,651 INFO L273 TraceCheckUtils]: 26: Hoare triple {11459#true} assume !(0 == ~cond); {11459#true} is VALID [2018-11-23 13:11:32,651 INFO L273 TraceCheckUtils]: 27: Hoare triple {11459#true} assume true; {11459#true} is VALID [2018-11-23 13:11:32,652 INFO L268 TraceCheckUtils]: 28: Hoare quadruple {11459#true} {11471#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 4))} #70#return; {11471#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 4))} is VALID [2018-11-23 13:11:32,652 INFO L273 TraceCheckUtils]: 29: Hoare triple {11471#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 4))} #t~post7 := ~j1~0;~j1~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~k~0;~k~0 := #t~post8 - 1;havoc #t~post8; {11472#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 3))} is VALID [2018-11-23 13:11:32,653 INFO L273 TraceCheckUtils]: 30: Hoare triple {11472#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 3))} assume !!(~j1~0 < ~n0~0 + ~n1~0); {11472#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 3))} is VALID [2018-11-23 13:11:32,653 INFO L256 TraceCheckUtils]: 31: Hoare triple {11472#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 3))} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {11459#true} is VALID [2018-11-23 13:11:32,653 INFO L273 TraceCheckUtils]: 32: Hoare triple {11459#true} ~cond := #in~cond; {11459#true} is VALID [2018-11-23 13:11:32,653 INFO L273 TraceCheckUtils]: 33: Hoare triple {11459#true} assume !(0 == ~cond); {11459#true} is VALID [2018-11-23 13:11:32,654 INFO L273 TraceCheckUtils]: 34: Hoare triple {11459#true} assume true; {11459#true} is VALID [2018-11-23 13:11:32,655 INFO L268 TraceCheckUtils]: 35: Hoare quadruple {11459#true} {11472#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 3))} #70#return; {11472#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 3))} is VALID [2018-11-23 13:11:32,655 INFO L273 TraceCheckUtils]: 36: Hoare triple {11472#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 3))} #t~post7 := ~j1~0;~j1~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~k~0;~k~0 := #t~post8 - 1;havoc #t~post8; {11473#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 2))} is VALID [2018-11-23 13:11:32,655 INFO L273 TraceCheckUtils]: 37: Hoare triple {11473#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 2))} assume !!(~j1~0 < ~n0~0 + ~n1~0); {11473#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 2))} is VALID [2018-11-23 13:11:32,656 INFO L256 TraceCheckUtils]: 38: Hoare triple {11473#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 2))} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {11459#true} is VALID [2018-11-23 13:11:32,656 INFO L273 TraceCheckUtils]: 39: Hoare triple {11459#true} ~cond := #in~cond; {11459#true} is VALID [2018-11-23 13:11:32,656 INFO L273 TraceCheckUtils]: 40: Hoare triple {11459#true} assume !(0 == ~cond); {11459#true} is VALID [2018-11-23 13:11:32,656 INFO L273 TraceCheckUtils]: 41: Hoare triple {11459#true} assume true; {11459#true} is VALID [2018-11-23 13:11:32,656 INFO L268 TraceCheckUtils]: 42: Hoare quadruple {11459#true} {11473#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 2))} #70#return; {11473#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 2))} is VALID [2018-11-23 13:11:32,657 INFO L273 TraceCheckUtils]: 43: Hoare triple {11473#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 2))} #t~post7 := ~j1~0;~j1~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~k~0;~k~0 := #t~post8 - 1;havoc #t~post8; {11474#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 1))} is VALID [2018-11-23 13:11:32,658 INFO L273 TraceCheckUtils]: 44: Hoare triple {11474#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 1))} assume !!(~j1~0 < ~n0~0 + ~n1~0); {11474#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 1))} is VALID [2018-11-23 13:11:32,658 INFO L256 TraceCheckUtils]: 45: Hoare triple {11474#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 1))} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {11459#true} is VALID [2018-11-23 13:11:32,658 INFO L273 TraceCheckUtils]: 46: Hoare triple {11459#true} ~cond := #in~cond; {11459#true} is VALID [2018-11-23 13:11:32,658 INFO L273 TraceCheckUtils]: 47: Hoare triple {11459#true} assume !(0 == ~cond); {11459#true} is VALID [2018-11-23 13:11:32,659 INFO L273 TraceCheckUtils]: 48: Hoare triple {11459#true} assume true; {11459#true} is VALID [2018-11-23 13:11:32,659 INFO L268 TraceCheckUtils]: 49: Hoare quadruple {11459#true} {11474#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 1))} #70#return; {11474#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 1))} is VALID [2018-11-23 13:11:32,660 INFO L273 TraceCheckUtils]: 50: Hoare triple {11474#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 1))} #t~post7 := ~j1~0;~j1~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~k~0;~k~0 := #t~post8 - 1;havoc #t~post8; {11475#(<= (+ main_~n0~0 main_~n1~0) main_~j1~0)} is VALID [2018-11-23 13:11:32,661 INFO L273 TraceCheckUtils]: 51: Hoare triple {11475#(<= (+ main_~n0~0 main_~n1~0) main_~j1~0)} assume !!(~j1~0 < ~n0~0 + ~n1~0); {11460#false} is VALID [2018-11-23 13:11:32,661 INFO L256 TraceCheckUtils]: 52: Hoare triple {11460#false} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {11460#false} is VALID [2018-11-23 13:11:32,661 INFO L273 TraceCheckUtils]: 53: Hoare triple {11460#false} ~cond := #in~cond; {11460#false} is VALID [2018-11-23 13:11:32,662 INFO L273 TraceCheckUtils]: 54: Hoare triple {11460#false} assume 0 == ~cond; {11460#false} is VALID [2018-11-23 13:11:32,662 INFO L273 TraceCheckUtils]: 55: Hoare triple {11460#false} assume !false; {11460#false} is VALID [2018-11-23 13:11:32,665 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 50 proven. 9 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-11-23 13:11:32,666 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:11:32,666 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:11:32,675 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 13:11:32,693 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 13:11:32,693 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:11:32,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:11:32,705 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:11:33,204 INFO L256 TraceCheckUtils]: 0: Hoare triple {11459#true} call ULTIMATE.init(); {11459#true} is VALID [2018-11-23 13:11:33,205 INFO L273 TraceCheckUtils]: 1: Hoare triple {11459#true} assume true; {11459#true} is VALID [2018-11-23 13:11:33,205 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {11459#true} {11459#true} #66#return; {11459#true} is VALID [2018-11-23 13:11:33,205 INFO L256 TraceCheckUtils]: 3: Hoare triple {11459#true} call #t~ret9 := main(); {11459#true} is VALID [2018-11-23 13:11:33,207 INFO L273 TraceCheckUtils]: 4: Hoare triple {11459#true} havoc ~n0~0;havoc ~n1~0;~i0~0 := 0;~k~0 := 0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n0~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~n1~0 := #t~nondet2;havoc #t~nondet2; {11461#(<= main_~i0~0 0)} is VALID [2018-11-23 13:11:33,207 INFO L273 TraceCheckUtils]: 5: Hoare triple {11461#(<= main_~i0~0 0)} assume !!(-1000000 <= ~n0~0 && ~n0~0 < 1000000); {11461#(<= main_~i0~0 0)} is VALID [2018-11-23 13:11:33,207 INFO L273 TraceCheckUtils]: 6: Hoare triple {11461#(<= main_~i0~0 0)} assume !!(-1000000 <= ~n1~0 && ~n1~0 < 1000000); {11461#(<= main_~i0~0 0)} is VALID [2018-11-23 13:11:33,208 INFO L273 TraceCheckUtils]: 7: Hoare triple {11461#(<= main_~i0~0 0)} assume !!(~i0~0 < ~n0~0);#t~post3 := ~i0~0;~i0~0 := 1 + #t~post3;havoc #t~post3;#t~post4 := ~k~0;~k~0 := 1 + #t~post4;havoc #t~post4; {11462#(<= main_~i0~0 1)} is VALID [2018-11-23 13:11:33,209 INFO L273 TraceCheckUtils]: 8: Hoare triple {11462#(<= main_~i0~0 1)} assume !!(~i0~0 < ~n0~0);#t~post3 := ~i0~0;~i0~0 := 1 + #t~post3;havoc #t~post3;#t~post4 := ~k~0;~k~0 := 1 + #t~post4;havoc #t~post4; {11463#(<= main_~i0~0 2)} is VALID [2018-11-23 13:11:33,209 INFO L273 TraceCheckUtils]: 9: Hoare triple {11463#(<= main_~i0~0 2)} assume !(~i0~0 < ~n0~0); {11464#(<= main_~n0~0 2)} is VALID [2018-11-23 13:11:33,209 INFO L273 TraceCheckUtils]: 10: Hoare triple {11464#(<= main_~n0~0 2)} ~i1~0 := 0; {11509#(and (<= main_~n0~0 2) (<= main_~i1~0 0))} is VALID [2018-11-23 13:11:33,210 INFO L273 TraceCheckUtils]: 11: Hoare triple {11509#(and (<= main_~n0~0 2) (<= main_~i1~0 0))} assume !!(~i1~0 < ~n1~0);#t~post5 := ~i1~0;~i1~0 := 1 + #t~post5;havoc #t~post5;#t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {11513#(and (<= main_~n0~0 2) (<= main_~i1~0 1))} is VALID [2018-11-23 13:11:33,210 INFO L273 TraceCheckUtils]: 12: Hoare triple {11513#(and (<= main_~n0~0 2) (<= main_~i1~0 1))} assume !!(~i1~0 < ~n1~0);#t~post5 := ~i1~0;~i1~0 := 1 + #t~post5;havoc #t~post5;#t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {11517#(and (<= main_~n0~0 2) (<= main_~i1~0 2))} is VALID [2018-11-23 13:11:33,211 INFO L273 TraceCheckUtils]: 13: Hoare triple {11517#(and (<= main_~n0~0 2) (<= main_~i1~0 2))} assume !!(~i1~0 < ~n1~0);#t~post5 := ~i1~0;~i1~0 := 1 + #t~post5;havoc #t~post5;#t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {11521#(and (<= main_~n0~0 2) (<= main_~i1~0 3))} is VALID [2018-11-23 13:11:33,212 INFO L273 TraceCheckUtils]: 14: Hoare triple {11521#(and (<= main_~n0~0 2) (<= main_~i1~0 3))} assume !(~i1~0 < ~n1~0); {11525#(and (<= main_~n1~0 3) (<= main_~n0~0 2))} is VALID [2018-11-23 13:11:33,213 INFO L273 TraceCheckUtils]: 15: Hoare triple {11525#(and (<= main_~n1~0 3) (<= main_~n0~0 2))} ~j1~0 := 0; {11529#(and (<= main_~n1~0 3) (<= main_~n0~0 2) (<= 0 main_~j1~0))} is VALID [2018-11-23 13:11:33,213 INFO L273 TraceCheckUtils]: 16: Hoare triple {11529#(and (<= main_~n1~0 3) (<= main_~n0~0 2) (<= 0 main_~j1~0))} assume !!(~j1~0 < ~n0~0 + ~n1~0); {11529#(and (<= main_~n1~0 3) (<= main_~n0~0 2) (<= 0 main_~j1~0))} is VALID [2018-11-23 13:11:33,214 INFO L256 TraceCheckUtils]: 17: Hoare triple {11529#(and (<= main_~n1~0 3) (<= main_~n0~0 2) (<= 0 main_~j1~0))} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {11459#true} is VALID [2018-11-23 13:11:33,214 INFO L273 TraceCheckUtils]: 18: Hoare triple {11459#true} ~cond := #in~cond; {11459#true} is VALID [2018-11-23 13:11:33,214 INFO L273 TraceCheckUtils]: 19: Hoare triple {11459#true} assume !(0 == ~cond); {11459#true} is VALID [2018-11-23 13:11:33,214 INFO L273 TraceCheckUtils]: 20: Hoare triple {11459#true} assume true; {11459#true} is VALID [2018-11-23 13:11:33,215 INFO L268 TraceCheckUtils]: 21: Hoare quadruple {11459#true} {11529#(and (<= main_~n1~0 3) (<= main_~n0~0 2) (<= 0 main_~j1~0))} #70#return; {11529#(and (<= main_~n1~0 3) (<= main_~n0~0 2) (<= 0 main_~j1~0))} is VALID [2018-11-23 13:11:33,216 INFO L273 TraceCheckUtils]: 22: Hoare triple {11529#(and (<= main_~n1~0 3) (<= main_~n0~0 2) (<= 0 main_~j1~0))} #t~post7 := ~j1~0;~j1~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~k~0;~k~0 := #t~post8 - 1;havoc #t~post8; {11551#(and (<= 1 main_~j1~0) (<= main_~n1~0 3) (<= main_~n0~0 2))} is VALID [2018-11-23 13:11:33,216 INFO L273 TraceCheckUtils]: 23: Hoare triple {11551#(and (<= 1 main_~j1~0) (<= main_~n1~0 3) (<= main_~n0~0 2))} assume !!(~j1~0 < ~n0~0 + ~n1~0); {11551#(and (<= 1 main_~j1~0) (<= main_~n1~0 3) (<= main_~n0~0 2))} is VALID [2018-11-23 13:11:33,217 INFO L256 TraceCheckUtils]: 24: Hoare triple {11551#(and (<= 1 main_~j1~0) (<= main_~n1~0 3) (<= main_~n0~0 2))} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {11459#true} is VALID [2018-11-23 13:11:33,217 INFO L273 TraceCheckUtils]: 25: Hoare triple {11459#true} ~cond := #in~cond; {11459#true} is VALID [2018-11-23 13:11:33,217 INFO L273 TraceCheckUtils]: 26: Hoare triple {11459#true} assume !(0 == ~cond); {11459#true} is VALID [2018-11-23 13:11:33,217 INFO L273 TraceCheckUtils]: 27: Hoare triple {11459#true} assume true; {11459#true} is VALID [2018-11-23 13:11:33,217 INFO L268 TraceCheckUtils]: 28: Hoare quadruple {11459#true} {11551#(and (<= 1 main_~j1~0) (<= main_~n1~0 3) (<= main_~n0~0 2))} #70#return; {11551#(and (<= 1 main_~j1~0) (<= main_~n1~0 3) (<= main_~n0~0 2))} is VALID [2018-11-23 13:11:33,218 INFO L273 TraceCheckUtils]: 29: Hoare triple {11551#(and (<= 1 main_~j1~0) (<= main_~n1~0 3) (<= main_~n0~0 2))} #t~post7 := ~j1~0;~j1~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~k~0;~k~0 := #t~post8 - 1;havoc #t~post8; {11573#(and (<= main_~n1~0 3) (<= main_~n0~0 2) (<= 2 main_~j1~0))} is VALID [2018-11-23 13:11:33,218 INFO L273 TraceCheckUtils]: 30: Hoare triple {11573#(and (<= main_~n1~0 3) (<= main_~n0~0 2) (<= 2 main_~j1~0))} assume !!(~j1~0 < ~n0~0 + ~n1~0); {11573#(and (<= main_~n1~0 3) (<= main_~n0~0 2) (<= 2 main_~j1~0))} is VALID [2018-11-23 13:11:33,219 INFO L256 TraceCheckUtils]: 31: Hoare triple {11573#(and (<= main_~n1~0 3) (<= main_~n0~0 2) (<= 2 main_~j1~0))} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {11459#true} is VALID [2018-11-23 13:11:33,219 INFO L273 TraceCheckUtils]: 32: Hoare triple {11459#true} ~cond := #in~cond; {11459#true} is VALID [2018-11-23 13:11:33,219 INFO L273 TraceCheckUtils]: 33: Hoare triple {11459#true} assume !(0 == ~cond); {11459#true} is VALID [2018-11-23 13:11:33,219 INFO L273 TraceCheckUtils]: 34: Hoare triple {11459#true} assume true; {11459#true} is VALID [2018-11-23 13:11:33,220 INFO L268 TraceCheckUtils]: 35: Hoare quadruple {11459#true} {11573#(and (<= main_~n1~0 3) (<= main_~n0~0 2) (<= 2 main_~j1~0))} #70#return; {11573#(and (<= main_~n1~0 3) (<= main_~n0~0 2) (<= 2 main_~j1~0))} is VALID [2018-11-23 13:11:33,221 INFO L273 TraceCheckUtils]: 36: Hoare triple {11573#(and (<= main_~n1~0 3) (<= main_~n0~0 2) (<= 2 main_~j1~0))} #t~post7 := ~j1~0;~j1~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~k~0;~k~0 := #t~post8 - 1;havoc #t~post8; {11595#(and (<= main_~n1~0 3) (<= main_~n0~0 2) (<= 3 main_~j1~0))} is VALID [2018-11-23 13:11:33,222 INFO L273 TraceCheckUtils]: 37: Hoare triple {11595#(and (<= main_~n1~0 3) (<= main_~n0~0 2) (<= 3 main_~j1~0))} assume !!(~j1~0 < ~n0~0 + ~n1~0); {11595#(and (<= main_~n1~0 3) (<= main_~n0~0 2) (<= 3 main_~j1~0))} is VALID [2018-11-23 13:11:33,222 INFO L256 TraceCheckUtils]: 38: Hoare triple {11595#(and (<= main_~n1~0 3) (<= main_~n0~0 2) (<= 3 main_~j1~0))} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {11459#true} is VALID [2018-11-23 13:11:33,222 INFO L273 TraceCheckUtils]: 39: Hoare triple {11459#true} ~cond := #in~cond; {11459#true} is VALID [2018-11-23 13:11:33,222 INFO L273 TraceCheckUtils]: 40: Hoare triple {11459#true} assume !(0 == ~cond); {11459#true} is VALID [2018-11-23 13:11:33,222 INFO L273 TraceCheckUtils]: 41: Hoare triple {11459#true} assume true; {11459#true} is VALID [2018-11-23 13:11:33,223 INFO L268 TraceCheckUtils]: 42: Hoare quadruple {11459#true} {11595#(and (<= main_~n1~0 3) (<= main_~n0~0 2) (<= 3 main_~j1~0))} #70#return; {11595#(and (<= main_~n1~0 3) (<= main_~n0~0 2) (<= 3 main_~j1~0))} is VALID [2018-11-23 13:11:33,224 INFO L273 TraceCheckUtils]: 43: Hoare triple {11595#(and (<= main_~n1~0 3) (<= main_~n0~0 2) (<= 3 main_~j1~0))} #t~post7 := ~j1~0;~j1~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~k~0;~k~0 := #t~post8 - 1;havoc #t~post8; {11617#(and (<= main_~n1~0 3) (<= main_~n0~0 2) (<= 4 main_~j1~0))} is VALID [2018-11-23 13:11:33,225 INFO L273 TraceCheckUtils]: 44: Hoare triple {11617#(and (<= main_~n1~0 3) (<= main_~n0~0 2) (<= 4 main_~j1~0))} assume !!(~j1~0 < ~n0~0 + ~n1~0); {11617#(and (<= main_~n1~0 3) (<= main_~n0~0 2) (<= 4 main_~j1~0))} is VALID [2018-11-23 13:11:33,225 INFO L256 TraceCheckUtils]: 45: Hoare triple {11617#(and (<= main_~n1~0 3) (<= main_~n0~0 2) (<= 4 main_~j1~0))} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {11459#true} is VALID [2018-11-23 13:11:33,225 INFO L273 TraceCheckUtils]: 46: Hoare triple {11459#true} ~cond := #in~cond; {11459#true} is VALID [2018-11-23 13:11:33,226 INFO L273 TraceCheckUtils]: 47: Hoare triple {11459#true} assume !(0 == ~cond); {11459#true} is VALID [2018-11-23 13:11:33,226 INFO L273 TraceCheckUtils]: 48: Hoare triple {11459#true} assume true; {11459#true} is VALID [2018-11-23 13:11:33,227 INFO L268 TraceCheckUtils]: 49: Hoare quadruple {11459#true} {11617#(and (<= main_~n1~0 3) (<= main_~n0~0 2) (<= 4 main_~j1~0))} #70#return; {11617#(and (<= main_~n1~0 3) (<= main_~n0~0 2) (<= 4 main_~j1~0))} is VALID [2018-11-23 13:11:33,228 INFO L273 TraceCheckUtils]: 50: Hoare triple {11617#(and (<= main_~n1~0 3) (<= main_~n0~0 2) (<= 4 main_~j1~0))} #t~post7 := ~j1~0;~j1~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~k~0;~k~0 := #t~post8 - 1;havoc #t~post8; {11639#(and (<= main_~n1~0 3) (<= main_~n0~0 2) (<= 5 main_~j1~0))} is VALID [2018-11-23 13:11:33,228 INFO L273 TraceCheckUtils]: 51: Hoare triple {11639#(and (<= main_~n1~0 3) (<= main_~n0~0 2) (<= 5 main_~j1~0))} assume !!(~j1~0 < ~n0~0 + ~n1~0); {11460#false} is VALID [2018-11-23 13:11:33,229 INFO L256 TraceCheckUtils]: 52: Hoare triple {11460#false} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {11460#false} is VALID [2018-11-23 13:11:33,229 INFO L273 TraceCheckUtils]: 53: Hoare triple {11460#false} ~cond := #in~cond; {11460#false} is VALID [2018-11-23 13:11:33,229 INFO L273 TraceCheckUtils]: 54: Hoare triple {11460#false} assume 0 == ~cond; {11460#false} is VALID [2018-11-23 13:11:33,229 INFO L273 TraceCheckUtils]: 55: Hoare triple {11460#false} assume !false; {11460#false} is VALID [2018-11-23 13:11:33,234 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 50 proven. 9 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-11-23 13:11:33,252 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:11:33,252 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 28 [2018-11-23 13:11:33,253 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 56 [2018-11-23 13:11:33,253 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:11:33,253 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 28 states. [2018-11-23 13:11:33,327 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 71 edges. 71 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:11:33,327 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-11-23 13:11:33,327 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-11-23 13:11:33,328 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=603, Unknown=0, NotChecked=0, Total=756 [2018-11-23 13:11:33,328 INFO L87 Difference]: Start difference. First operand 70 states and 77 transitions. Second operand 28 states. [2018-11-23 13:11:35,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:11:35,506 INFO L93 Difference]: Finished difference Result 164 states and 198 transitions. [2018-11-23 13:11:35,506 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-11-23 13:11:35,507 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 56 [2018-11-23 13:11:35,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:11:35,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-11-23 13:11:35,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 96 transitions. [2018-11-23 13:11:35,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-11-23 13:11:35,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 96 transitions. [2018-11-23 13:11:35,510 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 27 states and 96 transitions. [2018-11-23 13:11:35,622 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 96 edges. 96 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:11:35,624 INFO L225 Difference]: With dead ends: 164 [2018-11-23 13:11:35,624 INFO L226 Difference]: Without dead ends: 138 [2018-11-23 13:11:35,625 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 651 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=496, Invalid=1954, Unknown=0, NotChecked=0, Total=2450 [2018-11-23 13:11:35,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2018-11-23 13:11:35,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 70. [2018-11-23 13:11:35,816 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:11:35,816 INFO L82 GeneralOperation]: Start isEquivalent. First operand 138 states. Second operand 70 states. [2018-11-23 13:11:35,816 INFO L74 IsIncluded]: Start isIncluded. First operand 138 states. Second operand 70 states. [2018-11-23 13:11:35,816 INFO L87 Difference]: Start difference. First operand 138 states. Second operand 70 states. [2018-11-23 13:11:35,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:11:35,818 INFO L93 Difference]: Finished difference Result 138 states and 166 transitions. [2018-11-23 13:11:35,819 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 166 transitions. [2018-11-23 13:11:35,819 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:11:35,819 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:11:35,819 INFO L74 IsIncluded]: Start isIncluded. First operand 70 states. Second operand 138 states. [2018-11-23 13:11:35,819 INFO L87 Difference]: Start difference. First operand 70 states. Second operand 138 states. [2018-11-23 13:11:35,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:11:35,821 INFO L93 Difference]: Finished difference Result 138 states and 166 transitions. [2018-11-23 13:11:35,822 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 166 transitions. [2018-11-23 13:11:35,822 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:11:35,822 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:11:35,822 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:11:35,822 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:11:35,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-11-23 13:11:35,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 77 transitions. [2018-11-23 13:11:35,823 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 77 transitions. Word has length 56 [2018-11-23 13:11:35,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:11:35,824 INFO L480 AbstractCegarLoop]: Abstraction has 70 states and 77 transitions. [2018-11-23 13:11:35,824 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-11-23 13:11:35,824 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 77 transitions. [2018-11-23 13:11:35,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-11-23 13:11:35,824 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:11:35,824 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:11:35,825 INFO L423 AbstractCegarLoop]: === Iteration 24 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:11:35,825 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:11:35,825 INFO L82 PathProgramCache]: Analyzing trace with hash 174641359, now seen corresponding path program 9 times [2018-11-23 13:11:35,825 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:11:35,825 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:11:35,826 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:11:35,826 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:11:35,826 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:11:35,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:11:36,101 INFO L256 TraceCheckUtils]: 0: Hoare triple {12342#true} call ULTIMATE.init(); {12342#true} is VALID [2018-11-23 13:11:36,101 INFO L273 TraceCheckUtils]: 1: Hoare triple {12342#true} assume true; {12342#true} is VALID [2018-11-23 13:11:36,102 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {12342#true} {12342#true} #66#return; {12342#true} is VALID [2018-11-23 13:11:36,102 INFO L256 TraceCheckUtils]: 3: Hoare triple {12342#true} call #t~ret9 := main(); {12342#true} is VALID [2018-11-23 13:11:36,103 INFO L273 TraceCheckUtils]: 4: Hoare triple {12342#true} havoc ~n0~0;havoc ~n1~0;~i0~0 := 0;~k~0 := 0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n0~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~n1~0 := #t~nondet2;havoc #t~nondet2; {12344#(<= main_~i0~0 0)} is VALID [2018-11-23 13:11:36,103 INFO L273 TraceCheckUtils]: 5: Hoare triple {12344#(<= main_~i0~0 0)} assume !!(-1000000 <= ~n0~0 && ~n0~0 < 1000000); {12344#(<= main_~i0~0 0)} is VALID [2018-11-23 13:11:36,103 INFO L273 TraceCheckUtils]: 6: Hoare triple {12344#(<= main_~i0~0 0)} assume !!(-1000000 <= ~n1~0 && ~n1~0 < 1000000); {12344#(<= main_~i0~0 0)} is VALID [2018-11-23 13:11:36,104 INFO L273 TraceCheckUtils]: 7: Hoare triple {12344#(<= main_~i0~0 0)} assume !!(~i0~0 < ~n0~0);#t~post3 := ~i0~0;~i0~0 := 1 + #t~post3;havoc #t~post3;#t~post4 := ~k~0;~k~0 := 1 + #t~post4;havoc #t~post4; {12345#(<= main_~i0~0 1)} is VALID [2018-11-23 13:11:36,105 INFO L273 TraceCheckUtils]: 8: Hoare triple {12345#(<= main_~i0~0 1)} assume !!(~i0~0 < ~n0~0);#t~post3 := ~i0~0;~i0~0 := 1 + #t~post3;havoc #t~post3;#t~post4 := ~k~0;~k~0 := 1 + #t~post4;havoc #t~post4; {12346#(<= main_~i0~0 2)} is VALID [2018-11-23 13:11:36,105 INFO L273 TraceCheckUtils]: 9: Hoare triple {12346#(<= main_~i0~0 2)} assume !!(~i0~0 < ~n0~0);#t~post3 := ~i0~0;~i0~0 := 1 + #t~post3;havoc #t~post3;#t~post4 := ~k~0;~k~0 := 1 + #t~post4;havoc #t~post4; {12347#(<= main_~i0~0 3)} is VALID [2018-11-23 13:11:36,105 INFO L273 TraceCheckUtils]: 10: Hoare triple {12347#(<= main_~i0~0 3)} assume !(~i0~0 < ~n0~0); {12348#(<= main_~n0~0 3)} is VALID [2018-11-23 13:11:36,106 INFO L273 TraceCheckUtils]: 11: Hoare triple {12348#(<= main_~n0~0 3)} ~i1~0 := 0; {12349#(<= (+ main_~i1~0 main_~n0~0) 3)} is VALID [2018-11-23 13:11:36,107 INFO L273 TraceCheckUtils]: 12: Hoare triple {12349#(<= (+ main_~i1~0 main_~n0~0) 3)} assume !!(~i1~0 < ~n1~0);#t~post5 := ~i1~0;~i1~0 := 1 + #t~post5;havoc #t~post5;#t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {12350#(<= (+ main_~i1~0 main_~n0~0) 4)} is VALID [2018-11-23 13:11:36,108 INFO L273 TraceCheckUtils]: 13: Hoare triple {12350#(<= (+ main_~i1~0 main_~n0~0) 4)} assume !!(~i1~0 < ~n1~0);#t~post5 := ~i1~0;~i1~0 := 1 + #t~post5;havoc #t~post5;#t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {12351#(<= (+ main_~i1~0 main_~n0~0) 5)} is VALID [2018-11-23 13:11:36,108 INFO L273 TraceCheckUtils]: 14: Hoare triple {12351#(<= (+ main_~i1~0 main_~n0~0) 5)} assume !(~i1~0 < ~n1~0); {12352#(<= (+ main_~n0~0 main_~n1~0) 5)} is VALID [2018-11-23 13:11:36,109 INFO L273 TraceCheckUtils]: 15: Hoare triple {12352#(<= (+ main_~n0~0 main_~n1~0) 5)} ~j1~0 := 0; {12353#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 5))} is VALID [2018-11-23 13:11:36,110 INFO L273 TraceCheckUtils]: 16: Hoare triple {12353#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 5))} assume !!(~j1~0 < ~n0~0 + ~n1~0); {12353#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 5))} is VALID [2018-11-23 13:11:36,110 INFO L256 TraceCheckUtils]: 17: Hoare triple {12353#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 5))} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {12342#true} is VALID [2018-11-23 13:11:36,110 INFO L273 TraceCheckUtils]: 18: Hoare triple {12342#true} ~cond := #in~cond; {12342#true} is VALID [2018-11-23 13:11:36,110 INFO L273 TraceCheckUtils]: 19: Hoare triple {12342#true} assume !(0 == ~cond); {12342#true} is VALID [2018-11-23 13:11:36,110 INFO L273 TraceCheckUtils]: 20: Hoare triple {12342#true} assume true; {12342#true} is VALID [2018-11-23 13:11:36,111 INFO L268 TraceCheckUtils]: 21: Hoare quadruple {12342#true} {12353#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 5))} #70#return; {12353#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 5))} is VALID [2018-11-23 13:11:36,112 INFO L273 TraceCheckUtils]: 22: Hoare triple {12353#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 5))} #t~post7 := ~j1~0;~j1~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~k~0;~k~0 := #t~post8 - 1;havoc #t~post8; {12354#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 4))} is VALID [2018-11-23 13:11:36,113 INFO L273 TraceCheckUtils]: 23: Hoare triple {12354#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 4))} assume !!(~j1~0 < ~n0~0 + ~n1~0); {12354#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 4))} is VALID [2018-11-23 13:11:36,113 INFO L256 TraceCheckUtils]: 24: Hoare triple {12354#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 4))} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {12342#true} is VALID [2018-11-23 13:11:36,113 INFO L273 TraceCheckUtils]: 25: Hoare triple {12342#true} ~cond := #in~cond; {12342#true} is VALID [2018-11-23 13:11:36,113 INFO L273 TraceCheckUtils]: 26: Hoare triple {12342#true} assume !(0 == ~cond); {12342#true} is VALID [2018-11-23 13:11:36,114 INFO L273 TraceCheckUtils]: 27: Hoare triple {12342#true} assume true; {12342#true} is VALID [2018-11-23 13:11:36,114 INFO L268 TraceCheckUtils]: 28: Hoare quadruple {12342#true} {12354#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 4))} #70#return; {12354#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 4))} is VALID [2018-11-23 13:11:36,115 INFO L273 TraceCheckUtils]: 29: Hoare triple {12354#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 4))} #t~post7 := ~j1~0;~j1~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~k~0;~k~0 := #t~post8 - 1;havoc #t~post8; {12355#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 3))} is VALID [2018-11-23 13:11:36,116 INFO L273 TraceCheckUtils]: 30: Hoare triple {12355#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 3))} assume !!(~j1~0 < ~n0~0 + ~n1~0); {12355#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 3))} is VALID [2018-11-23 13:11:36,116 INFO L256 TraceCheckUtils]: 31: Hoare triple {12355#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 3))} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {12342#true} is VALID [2018-11-23 13:11:36,116 INFO L273 TraceCheckUtils]: 32: Hoare triple {12342#true} ~cond := #in~cond; {12342#true} is VALID [2018-11-23 13:11:36,117 INFO L273 TraceCheckUtils]: 33: Hoare triple {12342#true} assume !(0 == ~cond); {12342#true} is VALID [2018-11-23 13:11:36,117 INFO L273 TraceCheckUtils]: 34: Hoare triple {12342#true} assume true; {12342#true} is VALID [2018-11-23 13:11:36,118 INFO L268 TraceCheckUtils]: 35: Hoare quadruple {12342#true} {12355#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 3))} #70#return; {12355#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 3))} is VALID [2018-11-23 13:11:36,118 INFO L273 TraceCheckUtils]: 36: Hoare triple {12355#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 3))} #t~post7 := ~j1~0;~j1~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~k~0;~k~0 := #t~post8 - 1;havoc #t~post8; {12356#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 2))} is VALID [2018-11-23 13:11:36,119 INFO L273 TraceCheckUtils]: 37: Hoare triple {12356#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 2))} assume !!(~j1~0 < ~n0~0 + ~n1~0); {12356#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 2))} is VALID [2018-11-23 13:11:36,119 INFO L256 TraceCheckUtils]: 38: Hoare triple {12356#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 2))} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {12342#true} is VALID [2018-11-23 13:11:36,119 INFO L273 TraceCheckUtils]: 39: Hoare triple {12342#true} ~cond := #in~cond; {12342#true} is VALID [2018-11-23 13:11:36,120 INFO L273 TraceCheckUtils]: 40: Hoare triple {12342#true} assume !(0 == ~cond); {12342#true} is VALID [2018-11-23 13:11:36,120 INFO L273 TraceCheckUtils]: 41: Hoare triple {12342#true} assume true; {12342#true} is VALID [2018-11-23 13:11:36,121 INFO L268 TraceCheckUtils]: 42: Hoare quadruple {12342#true} {12356#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 2))} #70#return; {12356#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 2))} is VALID [2018-11-23 13:11:36,121 INFO L273 TraceCheckUtils]: 43: Hoare triple {12356#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 2))} #t~post7 := ~j1~0;~j1~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~k~0;~k~0 := #t~post8 - 1;havoc #t~post8; {12357#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 1))} is VALID [2018-11-23 13:11:36,122 INFO L273 TraceCheckUtils]: 44: Hoare triple {12357#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 1))} assume !!(~j1~0 < ~n0~0 + ~n1~0); {12357#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 1))} is VALID [2018-11-23 13:11:36,122 INFO L256 TraceCheckUtils]: 45: Hoare triple {12357#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 1))} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {12342#true} is VALID [2018-11-23 13:11:36,122 INFO L273 TraceCheckUtils]: 46: Hoare triple {12342#true} ~cond := #in~cond; {12342#true} is VALID [2018-11-23 13:11:36,123 INFO L273 TraceCheckUtils]: 47: Hoare triple {12342#true} assume !(0 == ~cond); {12342#true} is VALID [2018-11-23 13:11:36,123 INFO L273 TraceCheckUtils]: 48: Hoare triple {12342#true} assume true; {12342#true} is VALID [2018-11-23 13:11:36,124 INFO L268 TraceCheckUtils]: 49: Hoare quadruple {12342#true} {12357#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 1))} #70#return; {12357#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 1))} is VALID [2018-11-23 13:11:36,125 INFO L273 TraceCheckUtils]: 50: Hoare triple {12357#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 1))} #t~post7 := ~j1~0;~j1~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~k~0;~k~0 := #t~post8 - 1;havoc #t~post8; {12358#(<= (+ main_~n0~0 main_~n1~0) main_~j1~0)} is VALID [2018-11-23 13:11:36,125 INFO L273 TraceCheckUtils]: 51: Hoare triple {12358#(<= (+ main_~n0~0 main_~n1~0) main_~j1~0)} assume !!(~j1~0 < ~n0~0 + ~n1~0); {12343#false} is VALID [2018-11-23 13:11:36,125 INFO L256 TraceCheckUtils]: 52: Hoare triple {12343#false} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {12343#false} is VALID [2018-11-23 13:11:36,126 INFO L273 TraceCheckUtils]: 53: Hoare triple {12343#false} ~cond := #in~cond; {12343#false} is VALID [2018-11-23 13:11:36,126 INFO L273 TraceCheckUtils]: 54: Hoare triple {12343#false} assume 0 == ~cond; {12343#false} is VALID [2018-11-23 13:11:36,126 INFO L273 TraceCheckUtils]: 55: Hoare triple {12343#false} assume !false; {12343#false} is VALID [2018-11-23 13:11:36,129 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 50 proven. 9 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-11-23 13:11:36,129 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:11:36,129 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:11:36,138 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 13:11:36,158 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-11-23 13:11:36,158 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:11:36,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:11:36,168 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:11:36,549 INFO L256 TraceCheckUtils]: 0: Hoare triple {12342#true} call ULTIMATE.init(); {12342#true} is VALID [2018-11-23 13:11:36,550 INFO L273 TraceCheckUtils]: 1: Hoare triple {12342#true} assume true; {12342#true} is VALID [2018-11-23 13:11:36,550 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {12342#true} {12342#true} #66#return; {12342#true} is VALID [2018-11-23 13:11:36,550 INFO L256 TraceCheckUtils]: 3: Hoare triple {12342#true} call #t~ret9 := main(); {12342#true} is VALID [2018-11-23 13:11:36,550 INFO L273 TraceCheckUtils]: 4: Hoare triple {12342#true} havoc ~n0~0;havoc ~n1~0;~i0~0 := 0;~k~0 := 0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n0~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~n1~0 := #t~nondet2;havoc #t~nondet2; {12344#(<= main_~i0~0 0)} is VALID [2018-11-23 13:11:36,551 INFO L273 TraceCheckUtils]: 5: Hoare triple {12344#(<= main_~i0~0 0)} assume !!(-1000000 <= ~n0~0 && ~n0~0 < 1000000); {12344#(<= main_~i0~0 0)} is VALID [2018-11-23 13:11:36,551 INFO L273 TraceCheckUtils]: 6: Hoare triple {12344#(<= main_~i0~0 0)} assume !!(-1000000 <= ~n1~0 && ~n1~0 < 1000000); {12344#(<= main_~i0~0 0)} is VALID [2018-11-23 13:11:36,552 INFO L273 TraceCheckUtils]: 7: Hoare triple {12344#(<= main_~i0~0 0)} assume !!(~i0~0 < ~n0~0);#t~post3 := ~i0~0;~i0~0 := 1 + #t~post3;havoc #t~post3;#t~post4 := ~k~0;~k~0 := 1 + #t~post4;havoc #t~post4; {12345#(<= main_~i0~0 1)} is VALID [2018-11-23 13:11:36,552 INFO L273 TraceCheckUtils]: 8: Hoare triple {12345#(<= main_~i0~0 1)} assume !!(~i0~0 < ~n0~0);#t~post3 := ~i0~0;~i0~0 := 1 + #t~post3;havoc #t~post3;#t~post4 := ~k~0;~k~0 := 1 + #t~post4;havoc #t~post4; {12346#(<= main_~i0~0 2)} is VALID [2018-11-23 13:11:36,553 INFO L273 TraceCheckUtils]: 9: Hoare triple {12346#(<= main_~i0~0 2)} assume !!(~i0~0 < ~n0~0);#t~post3 := ~i0~0;~i0~0 := 1 + #t~post3;havoc #t~post3;#t~post4 := ~k~0;~k~0 := 1 + #t~post4;havoc #t~post4; {12347#(<= main_~i0~0 3)} is VALID [2018-11-23 13:11:36,553 INFO L273 TraceCheckUtils]: 10: Hoare triple {12347#(<= main_~i0~0 3)} assume !(~i0~0 < ~n0~0); {12348#(<= main_~n0~0 3)} is VALID [2018-11-23 13:11:36,553 INFO L273 TraceCheckUtils]: 11: Hoare triple {12348#(<= main_~n0~0 3)} ~i1~0 := 0; {12395#(and (<= main_~i1~0 0) (<= main_~n0~0 3))} is VALID [2018-11-23 13:11:36,554 INFO L273 TraceCheckUtils]: 12: Hoare triple {12395#(and (<= main_~i1~0 0) (<= main_~n0~0 3))} assume !!(~i1~0 < ~n1~0);#t~post5 := ~i1~0;~i1~0 := 1 + #t~post5;havoc #t~post5;#t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {12399#(and (<= main_~n0~0 3) (<= main_~i1~0 1))} is VALID [2018-11-23 13:11:36,555 INFO L273 TraceCheckUtils]: 13: Hoare triple {12399#(and (<= main_~n0~0 3) (<= main_~i1~0 1))} assume !!(~i1~0 < ~n1~0);#t~post5 := ~i1~0;~i1~0 := 1 + #t~post5;havoc #t~post5;#t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {12403#(and (<= main_~i1~0 2) (<= main_~n0~0 3))} is VALID [2018-11-23 13:11:36,556 INFO L273 TraceCheckUtils]: 14: Hoare triple {12403#(and (<= main_~i1~0 2) (<= main_~n0~0 3))} assume !(~i1~0 < ~n1~0); {12407#(and (<= main_~n1~0 2) (<= main_~n0~0 3))} is VALID [2018-11-23 13:11:36,557 INFO L273 TraceCheckUtils]: 15: Hoare triple {12407#(and (<= main_~n1~0 2) (<= main_~n0~0 3))} ~j1~0 := 0; {12411#(and (<= main_~n1~0 2) (<= main_~n0~0 3) (<= 0 main_~j1~0))} is VALID [2018-11-23 13:11:36,557 INFO L273 TraceCheckUtils]: 16: Hoare triple {12411#(and (<= main_~n1~0 2) (<= main_~n0~0 3) (<= 0 main_~j1~0))} assume !!(~j1~0 < ~n0~0 + ~n1~0); {12411#(and (<= main_~n1~0 2) (<= main_~n0~0 3) (<= 0 main_~j1~0))} is VALID [2018-11-23 13:11:36,557 INFO L256 TraceCheckUtils]: 17: Hoare triple {12411#(and (<= main_~n1~0 2) (<= main_~n0~0 3) (<= 0 main_~j1~0))} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {12342#true} is VALID [2018-11-23 13:11:36,558 INFO L273 TraceCheckUtils]: 18: Hoare triple {12342#true} ~cond := #in~cond; {12342#true} is VALID [2018-11-23 13:11:36,558 INFO L273 TraceCheckUtils]: 19: Hoare triple {12342#true} assume !(0 == ~cond); {12342#true} is VALID [2018-11-23 13:11:36,558 INFO L273 TraceCheckUtils]: 20: Hoare triple {12342#true} assume true; {12342#true} is VALID [2018-11-23 13:11:36,559 INFO L268 TraceCheckUtils]: 21: Hoare quadruple {12342#true} {12411#(and (<= main_~n1~0 2) (<= main_~n0~0 3) (<= 0 main_~j1~0))} #70#return; {12411#(and (<= main_~n1~0 2) (<= main_~n0~0 3) (<= 0 main_~j1~0))} is VALID [2018-11-23 13:11:36,560 INFO L273 TraceCheckUtils]: 22: Hoare triple {12411#(and (<= main_~n1~0 2) (<= main_~n0~0 3) (<= 0 main_~j1~0))} #t~post7 := ~j1~0;~j1~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~k~0;~k~0 := #t~post8 - 1;havoc #t~post8; {12433#(and (<= 1 main_~j1~0) (<= main_~n1~0 2) (<= main_~n0~0 3))} is VALID [2018-11-23 13:11:36,561 INFO L273 TraceCheckUtils]: 23: Hoare triple {12433#(and (<= 1 main_~j1~0) (<= main_~n1~0 2) (<= main_~n0~0 3))} assume !!(~j1~0 < ~n0~0 + ~n1~0); {12433#(and (<= 1 main_~j1~0) (<= main_~n1~0 2) (<= main_~n0~0 3))} is VALID [2018-11-23 13:11:36,561 INFO L256 TraceCheckUtils]: 24: Hoare triple {12433#(and (<= 1 main_~j1~0) (<= main_~n1~0 2) (<= main_~n0~0 3))} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {12342#true} is VALID [2018-11-23 13:11:36,561 INFO L273 TraceCheckUtils]: 25: Hoare triple {12342#true} ~cond := #in~cond; {12342#true} is VALID [2018-11-23 13:11:36,561 INFO L273 TraceCheckUtils]: 26: Hoare triple {12342#true} assume !(0 == ~cond); {12342#true} is VALID [2018-11-23 13:11:36,561 INFO L273 TraceCheckUtils]: 27: Hoare triple {12342#true} assume true; {12342#true} is VALID [2018-11-23 13:11:36,562 INFO L268 TraceCheckUtils]: 28: Hoare quadruple {12342#true} {12433#(and (<= 1 main_~j1~0) (<= main_~n1~0 2) (<= main_~n0~0 3))} #70#return; {12433#(and (<= 1 main_~j1~0) (<= main_~n1~0 2) (<= main_~n0~0 3))} is VALID [2018-11-23 13:11:36,563 INFO L273 TraceCheckUtils]: 29: Hoare triple {12433#(and (<= 1 main_~j1~0) (<= main_~n1~0 2) (<= main_~n0~0 3))} #t~post7 := ~j1~0;~j1~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~k~0;~k~0 := #t~post8 - 1;havoc #t~post8; {12455#(and (<= main_~n1~0 2) (<= main_~n0~0 3) (<= 2 main_~j1~0))} is VALID [2018-11-23 13:11:36,564 INFO L273 TraceCheckUtils]: 30: Hoare triple {12455#(and (<= main_~n1~0 2) (<= main_~n0~0 3) (<= 2 main_~j1~0))} assume !!(~j1~0 < ~n0~0 + ~n1~0); {12455#(and (<= main_~n1~0 2) (<= main_~n0~0 3) (<= 2 main_~j1~0))} is VALID [2018-11-23 13:11:36,564 INFO L256 TraceCheckUtils]: 31: Hoare triple {12455#(and (<= main_~n1~0 2) (<= main_~n0~0 3) (<= 2 main_~j1~0))} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {12342#true} is VALID [2018-11-23 13:11:36,564 INFO L273 TraceCheckUtils]: 32: Hoare triple {12342#true} ~cond := #in~cond; {12342#true} is VALID [2018-11-23 13:11:36,564 INFO L273 TraceCheckUtils]: 33: Hoare triple {12342#true} assume !(0 == ~cond); {12342#true} is VALID [2018-11-23 13:11:36,565 INFO L273 TraceCheckUtils]: 34: Hoare triple {12342#true} assume true; {12342#true} is VALID [2018-11-23 13:11:36,565 INFO L268 TraceCheckUtils]: 35: Hoare quadruple {12342#true} {12455#(and (<= main_~n1~0 2) (<= main_~n0~0 3) (<= 2 main_~j1~0))} #70#return; {12455#(and (<= main_~n1~0 2) (<= main_~n0~0 3) (<= 2 main_~j1~0))} is VALID [2018-11-23 13:11:36,566 INFO L273 TraceCheckUtils]: 36: Hoare triple {12455#(and (<= main_~n1~0 2) (<= main_~n0~0 3) (<= 2 main_~j1~0))} #t~post7 := ~j1~0;~j1~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~k~0;~k~0 := #t~post8 - 1;havoc #t~post8; {12477#(and (<= main_~n1~0 2) (<= main_~n0~0 3) (<= 3 main_~j1~0))} is VALID [2018-11-23 13:11:36,567 INFO L273 TraceCheckUtils]: 37: Hoare triple {12477#(and (<= main_~n1~0 2) (<= main_~n0~0 3) (<= 3 main_~j1~0))} assume !!(~j1~0 < ~n0~0 + ~n1~0); {12477#(and (<= main_~n1~0 2) (<= main_~n0~0 3) (<= 3 main_~j1~0))} is VALID [2018-11-23 13:11:36,567 INFO L256 TraceCheckUtils]: 38: Hoare triple {12477#(and (<= main_~n1~0 2) (<= main_~n0~0 3) (<= 3 main_~j1~0))} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {12342#true} is VALID [2018-11-23 13:11:36,568 INFO L273 TraceCheckUtils]: 39: Hoare triple {12342#true} ~cond := #in~cond; {12342#true} is VALID [2018-11-23 13:11:36,568 INFO L273 TraceCheckUtils]: 40: Hoare triple {12342#true} assume !(0 == ~cond); {12342#true} is VALID [2018-11-23 13:11:36,568 INFO L273 TraceCheckUtils]: 41: Hoare triple {12342#true} assume true; {12342#true} is VALID [2018-11-23 13:11:36,569 INFO L268 TraceCheckUtils]: 42: Hoare quadruple {12342#true} {12477#(and (<= main_~n1~0 2) (<= main_~n0~0 3) (<= 3 main_~j1~0))} #70#return; {12477#(and (<= main_~n1~0 2) (<= main_~n0~0 3) (<= 3 main_~j1~0))} is VALID [2018-11-23 13:11:36,570 INFO L273 TraceCheckUtils]: 43: Hoare triple {12477#(and (<= main_~n1~0 2) (<= main_~n0~0 3) (<= 3 main_~j1~0))} #t~post7 := ~j1~0;~j1~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~k~0;~k~0 := #t~post8 - 1;havoc #t~post8; {12499#(and (<= main_~n1~0 2) (<= main_~n0~0 3) (<= 4 main_~j1~0))} is VALID [2018-11-23 13:11:36,570 INFO L273 TraceCheckUtils]: 44: Hoare triple {12499#(and (<= main_~n1~0 2) (<= main_~n0~0 3) (<= 4 main_~j1~0))} assume !!(~j1~0 < ~n0~0 + ~n1~0); {12499#(and (<= main_~n1~0 2) (<= main_~n0~0 3) (<= 4 main_~j1~0))} is VALID [2018-11-23 13:11:36,571 INFO L256 TraceCheckUtils]: 45: Hoare triple {12499#(and (<= main_~n1~0 2) (<= main_~n0~0 3) (<= 4 main_~j1~0))} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {12342#true} is VALID [2018-11-23 13:11:36,571 INFO L273 TraceCheckUtils]: 46: Hoare triple {12342#true} ~cond := #in~cond; {12342#true} is VALID [2018-11-23 13:11:36,571 INFO L273 TraceCheckUtils]: 47: Hoare triple {12342#true} assume !(0 == ~cond); {12342#true} is VALID [2018-11-23 13:11:36,571 INFO L273 TraceCheckUtils]: 48: Hoare triple {12342#true} assume true; {12342#true} is VALID [2018-11-23 13:11:36,572 INFO L268 TraceCheckUtils]: 49: Hoare quadruple {12342#true} {12499#(and (<= main_~n1~0 2) (<= main_~n0~0 3) (<= 4 main_~j1~0))} #70#return; {12499#(and (<= main_~n1~0 2) (<= main_~n0~0 3) (<= 4 main_~j1~0))} is VALID [2018-11-23 13:11:36,573 INFO L273 TraceCheckUtils]: 50: Hoare triple {12499#(and (<= main_~n1~0 2) (<= main_~n0~0 3) (<= 4 main_~j1~0))} #t~post7 := ~j1~0;~j1~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~k~0;~k~0 := #t~post8 - 1;havoc #t~post8; {12521#(and (<= main_~n1~0 2) (<= main_~n0~0 3) (<= 5 main_~j1~0))} is VALID [2018-11-23 13:11:36,574 INFO L273 TraceCheckUtils]: 51: Hoare triple {12521#(and (<= main_~n1~0 2) (<= main_~n0~0 3) (<= 5 main_~j1~0))} assume !!(~j1~0 < ~n0~0 + ~n1~0); {12343#false} is VALID [2018-11-23 13:11:36,574 INFO L256 TraceCheckUtils]: 52: Hoare triple {12343#false} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {12343#false} is VALID [2018-11-23 13:11:36,574 INFO L273 TraceCheckUtils]: 53: Hoare triple {12343#false} ~cond := #in~cond; {12343#false} is VALID [2018-11-23 13:11:36,574 INFO L273 TraceCheckUtils]: 54: Hoare triple {12343#false} assume 0 == ~cond; {12343#false} is VALID [2018-11-23 13:11:36,574 INFO L273 TraceCheckUtils]: 55: Hoare triple {12343#false} assume !false; {12343#false} is VALID [2018-11-23 13:11:36,577 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 50 proven. 9 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-11-23 13:11:36,596 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:11:36,596 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 27 [2018-11-23 13:11:36,596 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 56 [2018-11-23 13:11:36,597 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:11:36,597 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 27 states. [2018-11-23 13:11:36,663 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:11:36,663 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-11-23 13:11:36,664 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-11-23 13:11:36,664 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=559, Unknown=0, NotChecked=0, Total=702 [2018-11-23 13:11:36,665 INFO L87 Difference]: Start difference. First operand 70 states and 77 transitions. Second operand 27 states. [2018-11-23 13:11:39,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:11:39,016 INFO L93 Difference]: Finished difference Result 185 states and 226 transitions. [2018-11-23 13:11:39,016 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-11-23 13:11:39,016 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 56 [2018-11-23 13:11:39,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:11:39,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-23 13:11:39,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 106 transitions. [2018-11-23 13:11:39,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-23 13:11:39,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 106 transitions. [2018-11-23 13:11:39,020 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 29 states and 106 transitions. [2018-11-23 13:11:39,124 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 106 edges. 106 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:11:39,128 INFO L225 Difference]: With dead ends: 185 [2018-11-23 13:11:39,128 INFO L226 Difference]: Without dead ends: 159 [2018-11-23 13:11:39,129 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 650 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=496, Invalid=1954, Unknown=0, NotChecked=0, Total=2450 [2018-11-23 13:11:39,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2018-11-23 13:11:39,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 70. [2018-11-23 13:11:39,355 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:11:39,355 INFO L82 GeneralOperation]: Start isEquivalent. First operand 159 states. Second operand 70 states. [2018-11-23 13:11:39,355 INFO L74 IsIncluded]: Start isIncluded. First operand 159 states. Second operand 70 states. [2018-11-23 13:11:39,355 INFO L87 Difference]: Start difference. First operand 159 states. Second operand 70 states. [2018-11-23 13:11:39,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:11:39,358 INFO L93 Difference]: Finished difference Result 159 states and 194 transitions. [2018-11-23 13:11:39,358 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 194 transitions. [2018-11-23 13:11:39,359 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:11:39,359 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:11:39,359 INFO L74 IsIncluded]: Start isIncluded. First operand 70 states. Second operand 159 states. [2018-11-23 13:11:39,359 INFO L87 Difference]: Start difference. First operand 70 states. Second operand 159 states. [2018-11-23 13:11:39,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:11:39,362 INFO L93 Difference]: Finished difference Result 159 states and 194 transitions. [2018-11-23 13:11:39,363 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 194 transitions. [2018-11-23 13:11:39,363 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:11:39,363 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:11:39,364 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:11:39,364 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:11:39,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-11-23 13:11:39,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 77 transitions. [2018-11-23 13:11:39,365 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 77 transitions. Word has length 56 [2018-11-23 13:11:39,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:11:39,365 INFO L480 AbstractCegarLoop]: Abstraction has 70 states and 77 transitions. [2018-11-23 13:11:39,365 INFO L481 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-11-23 13:11:39,365 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 77 transitions. [2018-11-23 13:11:39,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-11-23 13:11:39,366 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:11:39,366 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:11:39,366 INFO L423 AbstractCegarLoop]: === Iteration 25 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:11:39,366 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:11:39,367 INFO L82 PathProgramCache]: Analyzing trace with hash 54765744, now seen corresponding path program 10 times [2018-11-23 13:11:39,367 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:11:39,367 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:11:39,367 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:11:39,368 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:11:39,368 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:11:39,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:11:39,580 INFO L256 TraceCheckUtils]: 0: Hoare triple {13304#true} call ULTIMATE.init(); {13304#true} is VALID [2018-11-23 13:11:39,580 INFO L273 TraceCheckUtils]: 1: Hoare triple {13304#true} assume true; {13304#true} is VALID [2018-11-23 13:11:39,580 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {13304#true} {13304#true} #66#return; {13304#true} is VALID [2018-11-23 13:11:39,581 INFO L256 TraceCheckUtils]: 3: Hoare triple {13304#true} call #t~ret9 := main(); {13304#true} is VALID [2018-11-23 13:11:39,581 INFO L273 TraceCheckUtils]: 4: Hoare triple {13304#true} havoc ~n0~0;havoc ~n1~0;~i0~0 := 0;~k~0 := 0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n0~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~n1~0 := #t~nondet2;havoc #t~nondet2; {13306#(<= main_~i0~0 0)} is VALID [2018-11-23 13:11:39,582 INFO L273 TraceCheckUtils]: 5: Hoare triple {13306#(<= main_~i0~0 0)} assume !!(-1000000 <= ~n0~0 && ~n0~0 < 1000000); {13306#(<= main_~i0~0 0)} is VALID [2018-11-23 13:11:39,582 INFO L273 TraceCheckUtils]: 6: Hoare triple {13306#(<= main_~i0~0 0)} assume !!(-1000000 <= ~n1~0 && ~n1~0 < 1000000); {13306#(<= main_~i0~0 0)} is VALID [2018-11-23 13:11:39,583 INFO L273 TraceCheckUtils]: 7: Hoare triple {13306#(<= main_~i0~0 0)} assume !!(~i0~0 < ~n0~0);#t~post3 := ~i0~0;~i0~0 := 1 + #t~post3;havoc #t~post3;#t~post4 := ~k~0;~k~0 := 1 + #t~post4;havoc #t~post4; {13307#(<= main_~i0~0 1)} is VALID [2018-11-23 13:11:39,584 INFO L273 TraceCheckUtils]: 8: Hoare triple {13307#(<= main_~i0~0 1)} assume !!(~i0~0 < ~n0~0);#t~post3 := ~i0~0;~i0~0 := 1 + #t~post3;havoc #t~post3;#t~post4 := ~k~0;~k~0 := 1 + #t~post4;havoc #t~post4; {13308#(<= main_~i0~0 2)} is VALID [2018-11-23 13:11:39,585 INFO L273 TraceCheckUtils]: 9: Hoare triple {13308#(<= main_~i0~0 2)} assume !!(~i0~0 < ~n0~0);#t~post3 := ~i0~0;~i0~0 := 1 + #t~post3;havoc #t~post3;#t~post4 := ~k~0;~k~0 := 1 + #t~post4;havoc #t~post4; {13309#(<= main_~i0~0 3)} is VALID [2018-11-23 13:11:39,586 INFO L273 TraceCheckUtils]: 10: Hoare triple {13309#(<= main_~i0~0 3)} assume !!(~i0~0 < ~n0~0);#t~post3 := ~i0~0;~i0~0 := 1 + #t~post3;havoc #t~post3;#t~post4 := ~k~0;~k~0 := 1 + #t~post4;havoc #t~post4; {13310#(<= main_~i0~0 4)} is VALID [2018-11-23 13:11:39,587 INFO L273 TraceCheckUtils]: 11: Hoare triple {13310#(<= main_~i0~0 4)} assume !(~i0~0 < ~n0~0); {13311#(<= main_~n0~0 4)} is VALID [2018-11-23 13:11:39,587 INFO L273 TraceCheckUtils]: 12: Hoare triple {13311#(<= main_~n0~0 4)} ~i1~0 := 0; {13312#(<= (+ main_~i1~0 main_~n0~0) 4)} is VALID [2018-11-23 13:11:39,588 INFO L273 TraceCheckUtils]: 13: Hoare triple {13312#(<= (+ main_~i1~0 main_~n0~0) 4)} assume !!(~i1~0 < ~n1~0);#t~post5 := ~i1~0;~i1~0 := 1 + #t~post5;havoc #t~post5;#t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {13313#(<= (+ main_~i1~0 main_~n0~0) 5)} is VALID [2018-11-23 13:11:39,589 INFO L273 TraceCheckUtils]: 14: Hoare triple {13313#(<= (+ main_~i1~0 main_~n0~0) 5)} assume !(~i1~0 < ~n1~0); {13314#(<= (+ main_~n0~0 main_~n1~0) 5)} is VALID [2018-11-23 13:11:39,590 INFO L273 TraceCheckUtils]: 15: Hoare triple {13314#(<= (+ main_~n0~0 main_~n1~0) 5)} ~j1~0 := 0; {13315#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 5))} is VALID [2018-11-23 13:11:39,590 INFO L273 TraceCheckUtils]: 16: Hoare triple {13315#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 5))} assume !!(~j1~0 < ~n0~0 + ~n1~0); {13315#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 5))} is VALID [2018-11-23 13:11:39,590 INFO L256 TraceCheckUtils]: 17: Hoare triple {13315#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 5))} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {13304#true} is VALID [2018-11-23 13:11:39,591 INFO L273 TraceCheckUtils]: 18: Hoare triple {13304#true} ~cond := #in~cond; {13304#true} is VALID [2018-11-23 13:11:39,591 INFO L273 TraceCheckUtils]: 19: Hoare triple {13304#true} assume !(0 == ~cond); {13304#true} is VALID [2018-11-23 13:11:39,591 INFO L273 TraceCheckUtils]: 20: Hoare triple {13304#true} assume true; {13304#true} is VALID [2018-11-23 13:11:39,592 INFO L268 TraceCheckUtils]: 21: Hoare quadruple {13304#true} {13315#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 5))} #70#return; {13315#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 5))} is VALID [2018-11-23 13:11:39,593 INFO L273 TraceCheckUtils]: 22: Hoare triple {13315#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 5))} #t~post7 := ~j1~0;~j1~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~k~0;~k~0 := #t~post8 - 1;havoc #t~post8; {13316#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 4))} is VALID [2018-11-23 13:11:39,593 INFO L273 TraceCheckUtils]: 23: Hoare triple {13316#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 4))} assume !!(~j1~0 < ~n0~0 + ~n1~0); {13316#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 4))} is VALID [2018-11-23 13:11:39,594 INFO L256 TraceCheckUtils]: 24: Hoare triple {13316#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 4))} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {13304#true} is VALID [2018-11-23 13:11:39,594 INFO L273 TraceCheckUtils]: 25: Hoare triple {13304#true} ~cond := #in~cond; {13304#true} is VALID [2018-11-23 13:11:39,594 INFO L273 TraceCheckUtils]: 26: Hoare triple {13304#true} assume !(0 == ~cond); {13304#true} is VALID [2018-11-23 13:11:39,594 INFO L273 TraceCheckUtils]: 27: Hoare triple {13304#true} assume true; {13304#true} is VALID [2018-11-23 13:11:39,595 INFO L268 TraceCheckUtils]: 28: Hoare quadruple {13304#true} {13316#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 4))} #70#return; {13316#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 4))} is VALID [2018-11-23 13:11:39,596 INFO L273 TraceCheckUtils]: 29: Hoare triple {13316#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 4))} #t~post7 := ~j1~0;~j1~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~k~0;~k~0 := #t~post8 - 1;havoc #t~post8; {13317#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 3))} is VALID [2018-11-23 13:11:39,597 INFO L273 TraceCheckUtils]: 30: Hoare triple {13317#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 3))} assume !!(~j1~0 < ~n0~0 + ~n1~0); {13317#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 3))} is VALID [2018-11-23 13:11:39,597 INFO L256 TraceCheckUtils]: 31: Hoare triple {13317#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 3))} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {13304#true} is VALID [2018-11-23 13:11:39,597 INFO L273 TraceCheckUtils]: 32: Hoare triple {13304#true} ~cond := #in~cond; {13304#true} is VALID [2018-11-23 13:11:39,597 INFO L273 TraceCheckUtils]: 33: Hoare triple {13304#true} assume !(0 == ~cond); {13304#true} is VALID [2018-11-23 13:11:39,597 INFO L273 TraceCheckUtils]: 34: Hoare triple {13304#true} assume true; {13304#true} is VALID [2018-11-23 13:11:39,598 INFO L268 TraceCheckUtils]: 35: Hoare quadruple {13304#true} {13317#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 3))} #70#return; {13317#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 3))} is VALID [2018-11-23 13:11:39,599 INFO L273 TraceCheckUtils]: 36: Hoare triple {13317#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 3))} #t~post7 := ~j1~0;~j1~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~k~0;~k~0 := #t~post8 - 1;havoc #t~post8; {13318#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 2))} is VALID [2018-11-23 13:11:39,600 INFO L273 TraceCheckUtils]: 37: Hoare triple {13318#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 2))} assume !!(~j1~0 < ~n0~0 + ~n1~0); {13318#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 2))} is VALID [2018-11-23 13:11:39,600 INFO L256 TraceCheckUtils]: 38: Hoare triple {13318#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 2))} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {13304#true} is VALID [2018-11-23 13:11:39,600 INFO L273 TraceCheckUtils]: 39: Hoare triple {13304#true} ~cond := #in~cond; {13304#true} is VALID [2018-11-23 13:11:39,600 INFO L273 TraceCheckUtils]: 40: Hoare triple {13304#true} assume !(0 == ~cond); {13304#true} is VALID [2018-11-23 13:11:39,600 INFO L273 TraceCheckUtils]: 41: Hoare triple {13304#true} assume true; {13304#true} is VALID [2018-11-23 13:11:39,601 INFO L268 TraceCheckUtils]: 42: Hoare quadruple {13304#true} {13318#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 2))} #70#return; {13318#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 2))} is VALID [2018-11-23 13:11:39,601 INFO L273 TraceCheckUtils]: 43: Hoare triple {13318#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 2))} #t~post7 := ~j1~0;~j1~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~k~0;~k~0 := #t~post8 - 1;havoc #t~post8; {13319#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 1))} is VALID [2018-11-23 13:11:39,601 INFO L273 TraceCheckUtils]: 44: Hoare triple {13319#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 1))} assume !!(~j1~0 < ~n0~0 + ~n1~0); {13319#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 1))} is VALID [2018-11-23 13:11:39,602 INFO L256 TraceCheckUtils]: 45: Hoare triple {13319#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 1))} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {13304#true} is VALID [2018-11-23 13:11:39,602 INFO L273 TraceCheckUtils]: 46: Hoare triple {13304#true} ~cond := #in~cond; {13304#true} is VALID [2018-11-23 13:11:39,602 INFO L273 TraceCheckUtils]: 47: Hoare triple {13304#true} assume !(0 == ~cond); {13304#true} is VALID [2018-11-23 13:11:39,602 INFO L273 TraceCheckUtils]: 48: Hoare triple {13304#true} assume true; {13304#true} is VALID [2018-11-23 13:11:39,603 INFO L268 TraceCheckUtils]: 49: Hoare quadruple {13304#true} {13319#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 1))} #70#return; {13319#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 1))} is VALID [2018-11-23 13:11:39,604 INFO L273 TraceCheckUtils]: 50: Hoare triple {13319#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 1))} #t~post7 := ~j1~0;~j1~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~k~0;~k~0 := #t~post8 - 1;havoc #t~post8; {13320#(<= (+ main_~n0~0 main_~n1~0) main_~j1~0)} is VALID [2018-11-23 13:11:39,604 INFO L273 TraceCheckUtils]: 51: Hoare triple {13320#(<= (+ main_~n0~0 main_~n1~0) main_~j1~0)} assume !!(~j1~0 < ~n0~0 + ~n1~0); {13305#false} is VALID [2018-11-23 13:11:39,605 INFO L256 TraceCheckUtils]: 52: Hoare triple {13305#false} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {13305#false} is VALID [2018-11-23 13:11:39,605 INFO L273 TraceCheckUtils]: 53: Hoare triple {13305#false} ~cond := #in~cond; {13305#false} is VALID [2018-11-23 13:11:39,605 INFO L273 TraceCheckUtils]: 54: Hoare triple {13305#false} assume 0 == ~cond; {13305#false} is VALID [2018-11-23 13:11:39,605 INFO L273 TraceCheckUtils]: 55: Hoare triple {13305#false} assume !false; {13305#false} is VALID [2018-11-23 13:11:39,609 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 50 proven. 11 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-11-23 13:11:39,609 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:11:39,609 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:11:39,618 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 13:11:39,637 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 13:11:39,637 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:11:39,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:11:39,653 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:11:40,056 INFO L256 TraceCheckUtils]: 0: Hoare triple {13304#true} call ULTIMATE.init(); {13304#true} is VALID [2018-11-23 13:11:40,056 INFO L273 TraceCheckUtils]: 1: Hoare triple {13304#true} assume true; {13304#true} is VALID [2018-11-23 13:11:40,056 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {13304#true} {13304#true} #66#return; {13304#true} is VALID [2018-11-23 13:11:40,056 INFO L256 TraceCheckUtils]: 3: Hoare triple {13304#true} call #t~ret9 := main(); {13304#true} is VALID [2018-11-23 13:11:40,057 INFO L273 TraceCheckUtils]: 4: Hoare triple {13304#true} havoc ~n0~0;havoc ~n1~0;~i0~0 := 0;~k~0 := 0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n0~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~n1~0 := #t~nondet2;havoc #t~nondet2; {13306#(<= main_~i0~0 0)} is VALID [2018-11-23 13:11:40,058 INFO L273 TraceCheckUtils]: 5: Hoare triple {13306#(<= main_~i0~0 0)} assume !!(-1000000 <= ~n0~0 && ~n0~0 < 1000000); {13306#(<= main_~i0~0 0)} is VALID [2018-11-23 13:11:40,058 INFO L273 TraceCheckUtils]: 6: Hoare triple {13306#(<= main_~i0~0 0)} assume !!(-1000000 <= ~n1~0 && ~n1~0 < 1000000); {13306#(<= main_~i0~0 0)} is VALID [2018-11-23 13:11:40,060 INFO L273 TraceCheckUtils]: 7: Hoare triple {13306#(<= main_~i0~0 0)} assume !!(~i0~0 < ~n0~0);#t~post3 := ~i0~0;~i0~0 := 1 + #t~post3;havoc #t~post3;#t~post4 := ~k~0;~k~0 := 1 + #t~post4;havoc #t~post4; {13307#(<= main_~i0~0 1)} is VALID [2018-11-23 13:11:40,060 INFO L273 TraceCheckUtils]: 8: Hoare triple {13307#(<= main_~i0~0 1)} assume !!(~i0~0 < ~n0~0);#t~post3 := ~i0~0;~i0~0 := 1 + #t~post3;havoc #t~post3;#t~post4 := ~k~0;~k~0 := 1 + #t~post4;havoc #t~post4; {13308#(<= main_~i0~0 2)} is VALID [2018-11-23 13:11:40,062 INFO L273 TraceCheckUtils]: 9: Hoare triple {13308#(<= main_~i0~0 2)} assume !!(~i0~0 < ~n0~0);#t~post3 := ~i0~0;~i0~0 := 1 + #t~post3;havoc #t~post3;#t~post4 := ~k~0;~k~0 := 1 + #t~post4;havoc #t~post4; {13309#(<= main_~i0~0 3)} is VALID [2018-11-23 13:11:40,062 INFO L273 TraceCheckUtils]: 10: Hoare triple {13309#(<= main_~i0~0 3)} assume !!(~i0~0 < ~n0~0);#t~post3 := ~i0~0;~i0~0 := 1 + #t~post3;havoc #t~post3;#t~post4 := ~k~0;~k~0 := 1 + #t~post4;havoc #t~post4; {13310#(<= main_~i0~0 4)} is VALID [2018-11-23 13:11:40,065 INFO L273 TraceCheckUtils]: 11: Hoare triple {13310#(<= main_~i0~0 4)} assume !(~i0~0 < ~n0~0); {13311#(<= main_~n0~0 4)} is VALID [2018-11-23 13:11:40,065 INFO L273 TraceCheckUtils]: 12: Hoare triple {13311#(<= main_~n0~0 4)} ~i1~0 := 0; {13360#(and (<= main_~n0~0 4) (<= main_~i1~0 0))} is VALID [2018-11-23 13:11:40,068 INFO L273 TraceCheckUtils]: 13: Hoare triple {13360#(and (<= main_~n0~0 4) (<= main_~i1~0 0))} assume !!(~i1~0 < ~n1~0);#t~post5 := ~i1~0;~i1~0 := 1 + #t~post5;havoc #t~post5;#t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {13364#(and (<= main_~n0~0 4) (<= main_~i1~0 1))} is VALID [2018-11-23 13:11:40,068 INFO L273 TraceCheckUtils]: 14: Hoare triple {13364#(and (<= main_~n0~0 4) (<= main_~i1~0 1))} assume !(~i1~0 < ~n1~0); {13368#(and (<= main_~n0~0 4) (<= main_~n1~0 1))} is VALID [2018-11-23 13:11:40,070 INFO L273 TraceCheckUtils]: 15: Hoare triple {13368#(and (<= main_~n0~0 4) (<= main_~n1~0 1))} ~j1~0 := 0; {13372#(and (<= main_~n0~0 4) (<= main_~n1~0 1) (<= 0 main_~j1~0))} is VALID [2018-11-23 13:11:40,070 INFO L273 TraceCheckUtils]: 16: Hoare triple {13372#(and (<= main_~n0~0 4) (<= main_~n1~0 1) (<= 0 main_~j1~0))} assume !!(~j1~0 < ~n0~0 + ~n1~0); {13372#(and (<= main_~n0~0 4) (<= main_~n1~0 1) (<= 0 main_~j1~0))} is VALID [2018-11-23 13:11:40,070 INFO L256 TraceCheckUtils]: 17: Hoare triple {13372#(and (<= main_~n0~0 4) (<= main_~n1~0 1) (<= 0 main_~j1~0))} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {13304#true} is VALID [2018-11-23 13:11:40,070 INFO L273 TraceCheckUtils]: 18: Hoare triple {13304#true} ~cond := #in~cond; {13304#true} is VALID [2018-11-23 13:11:40,070 INFO L273 TraceCheckUtils]: 19: Hoare triple {13304#true} assume !(0 == ~cond); {13304#true} is VALID [2018-11-23 13:11:40,071 INFO L273 TraceCheckUtils]: 20: Hoare triple {13304#true} assume true; {13304#true} is VALID [2018-11-23 13:11:40,071 INFO L268 TraceCheckUtils]: 21: Hoare quadruple {13304#true} {13372#(and (<= main_~n0~0 4) (<= main_~n1~0 1) (<= 0 main_~j1~0))} #70#return; {13372#(and (<= main_~n0~0 4) (<= main_~n1~0 1) (<= 0 main_~j1~0))} is VALID [2018-11-23 13:11:40,073 INFO L273 TraceCheckUtils]: 22: Hoare triple {13372#(and (<= main_~n0~0 4) (<= main_~n1~0 1) (<= 0 main_~j1~0))} #t~post7 := ~j1~0;~j1~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~k~0;~k~0 := #t~post8 - 1;havoc #t~post8; {13394#(and (<= main_~n0~0 4) (<= main_~n1~0 1) (<= 1 main_~j1~0))} is VALID [2018-11-23 13:11:40,073 INFO L273 TraceCheckUtils]: 23: Hoare triple {13394#(and (<= main_~n0~0 4) (<= main_~n1~0 1) (<= 1 main_~j1~0))} assume !!(~j1~0 < ~n0~0 + ~n1~0); {13394#(and (<= main_~n0~0 4) (<= main_~n1~0 1) (<= 1 main_~j1~0))} is VALID [2018-11-23 13:11:40,073 INFO L256 TraceCheckUtils]: 24: Hoare triple {13394#(and (<= main_~n0~0 4) (<= main_~n1~0 1) (<= 1 main_~j1~0))} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {13304#true} is VALID [2018-11-23 13:11:40,073 INFO L273 TraceCheckUtils]: 25: Hoare triple {13304#true} ~cond := #in~cond; {13304#true} is VALID [2018-11-23 13:11:40,073 INFO L273 TraceCheckUtils]: 26: Hoare triple {13304#true} assume !(0 == ~cond); {13304#true} is VALID [2018-11-23 13:11:40,074 INFO L273 TraceCheckUtils]: 27: Hoare triple {13304#true} assume true; {13304#true} is VALID [2018-11-23 13:11:40,074 INFO L268 TraceCheckUtils]: 28: Hoare quadruple {13304#true} {13394#(and (<= main_~n0~0 4) (<= main_~n1~0 1) (<= 1 main_~j1~0))} #70#return; {13394#(and (<= main_~n0~0 4) (<= main_~n1~0 1) (<= 1 main_~j1~0))} is VALID [2018-11-23 13:11:40,076 INFO L273 TraceCheckUtils]: 29: Hoare triple {13394#(and (<= main_~n0~0 4) (<= main_~n1~0 1) (<= 1 main_~j1~0))} #t~post7 := ~j1~0;~j1~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~k~0;~k~0 := #t~post8 - 1;havoc #t~post8; {13416#(and (<= main_~n0~0 4) (<= main_~n1~0 1) (<= 2 main_~j1~0))} is VALID [2018-11-23 13:11:40,076 INFO L273 TraceCheckUtils]: 30: Hoare triple {13416#(and (<= main_~n0~0 4) (<= main_~n1~0 1) (<= 2 main_~j1~0))} assume !!(~j1~0 < ~n0~0 + ~n1~0); {13416#(and (<= main_~n0~0 4) (<= main_~n1~0 1) (<= 2 main_~j1~0))} is VALID [2018-11-23 13:11:40,076 INFO L256 TraceCheckUtils]: 31: Hoare triple {13416#(and (<= main_~n0~0 4) (<= main_~n1~0 1) (<= 2 main_~j1~0))} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {13304#true} is VALID [2018-11-23 13:11:40,076 INFO L273 TraceCheckUtils]: 32: Hoare triple {13304#true} ~cond := #in~cond; {13304#true} is VALID [2018-11-23 13:11:40,076 INFO L273 TraceCheckUtils]: 33: Hoare triple {13304#true} assume !(0 == ~cond); {13304#true} is VALID [2018-11-23 13:11:40,077 INFO L273 TraceCheckUtils]: 34: Hoare triple {13304#true} assume true; {13304#true} is VALID [2018-11-23 13:11:40,077 INFO L268 TraceCheckUtils]: 35: Hoare quadruple {13304#true} {13416#(and (<= main_~n0~0 4) (<= main_~n1~0 1) (<= 2 main_~j1~0))} #70#return; {13416#(and (<= main_~n0~0 4) (<= main_~n1~0 1) (<= 2 main_~j1~0))} is VALID [2018-11-23 13:11:40,078 INFO L273 TraceCheckUtils]: 36: Hoare triple {13416#(and (<= main_~n0~0 4) (<= main_~n1~0 1) (<= 2 main_~j1~0))} #t~post7 := ~j1~0;~j1~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~k~0;~k~0 := #t~post8 - 1;havoc #t~post8; {13438#(and (<= main_~n0~0 4) (<= main_~n1~0 1) (<= 3 main_~j1~0))} is VALID [2018-11-23 13:11:40,078 INFO L273 TraceCheckUtils]: 37: Hoare triple {13438#(and (<= main_~n0~0 4) (<= main_~n1~0 1) (<= 3 main_~j1~0))} assume !!(~j1~0 < ~n0~0 + ~n1~0); {13438#(and (<= main_~n0~0 4) (<= main_~n1~0 1) (<= 3 main_~j1~0))} is VALID [2018-11-23 13:11:40,078 INFO L256 TraceCheckUtils]: 38: Hoare triple {13438#(and (<= main_~n0~0 4) (<= main_~n1~0 1) (<= 3 main_~j1~0))} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {13304#true} is VALID [2018-11-23 13:11:40,078 INFO L273 TraceCheckUtils]: 39: Hoare triple {13304#true} ~cond := #in~cond; {13304#true} is VALID [2018-11-23 13:11:40,079 INFO L273 TraceCheckUtils]: 40: Hoare triple {13304#true} assume !(0 == ~cond); {13304#true} is VALID [2018-11-23 13:11:40,079 INFO L273 TraceCheckUtils]: 41: Hoare triple {13304#true} assume true; {13304#true} is VALID [2018-11-23 13:11:40,080 INFO L268 TraceCheckUtils]: 42: Hoare quadruple {13304#true} {13438#(and (<= main_~n0~0 4) (<= main_~n1~0 1) (<= 3 main_~j1~0))} #70#return; {13438#(and (<= main_~n0~0 4) (<= main_~n1~0 1) (<= 3 main_~j1~0))} is VALID [2018-11-23 13:11:40,081 INFO L273 TraceCheckUtils]: 43: Hoare triple {13438#(and (<= main_~n0~0 4) (<= main_~n1~0 1) (<= 3 main_~j1~0))} #t~post7 := ~j1~0;~j1~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~k~0;~k~0 := #t~post8 - 1;havoc #t~post8; {13460#(and (<= main_~n0~0 4) (<= main_~n1~0 1) (<= 4 main_~j1~0))} is VALID [2018-11-23 13:11:40,083 INFO L273 TraceCheckUtils]: 44: Hoare triple {13460#(and (<= main_~n0~0 4) (<= main_~n1~0 1) (<= 4 main_~j1~0))} assume !!(~j1~0 < ~n0~0 + ~n1~0); {13460#(and (<= main_~n0~0 4) (<= main_~n1~0 1) (<= 4 main_~j1~0))} is VALID [2018-11-23 13:11:40,083 INFO L256 TraceCheckUtils]: 45: Hoare triple {13460#(and (<= main_~n0~0 4) (<= main_~n1~0 1) (<= 4 main_~j1~0))} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {13304#true} is VALID [2018-11-23 13:11:40,083 INFO L273 TraceCheckUtils]: 46: Hoare triple {13304#true} ~cond := #in~cond; {13304#true} is VALID [2018-11-23 13:11:40,083 INFO L273 TraceCheckUtils]: 47: Hoare triple {13304#true} assume !(0 == ~cond); {13304#true} is VALID [2018-11-23 13:11:40,083 INFO L273 TraceCheckUtils]: 48: Hoare triple {13304#true} assume true; {13304#true} is VALID [2018-11-23 13:11:40,085 INFO L268 TraceCheckUtils]: 49: Hoare quadruple {13304#true} {13460#(and (<= main_~n0~0 4) (<= main_~n1~0 1) (<= 4 main_~j1~0))} #70#return; {13460#(and (<= main_~n0~0 4) (<= main_~n1~0 1) (<= 4 main_~j1~0))} is VALID [2018-11-23 13:11:40,085 INFO L273 TraceCheckUtils]: 50: Hoare triple {13460#(and (<= main_~n0~0 4) (<= main_~n1~0 1) (<= 4 main_~j1~0))} #t~post7 := ~j1~0;~j1~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~k~0;~k~0 := #t~post8 - 1;havoc #t~post8; {13482#(and (<= main_~n0~0 4) (<= main_~n1~0 1) (<= 5 main_~j1~0))} is VALID [2018-11-23 13:11:40,087 INFO L273 TraceCheckUtils]: 51: Hoare triple {13482#(and (<= main_~n0~0 4) (<= main_~n1~0 1) (<= 5 main_~j1~0))} assume !!(~j1~0 < ~n0~0 + ~n1~0); {13305#false} is VALID [2018-11-23 13:11:40,087 INFO L256 TraceCheckUtils]: 52: Hoare triple {13305#false} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {13305#false} is VALID [2018-11-23 13:11:40,087 INFO L273 TraceCheckUtils]: 53: Hoare triple {13305#false} ~cond := #in~cond; {13305#false} is VALID [2018-11-23 13:11:40,087 INFO L273 TraceCheckUtils]: 54: Hoare triple {13305#false} assume 0 == ~cond; {13305#false} is VALID [2018-11-23 13:11:40,087 INFO L273 TraceCheckUtils]: 55: Hoare triple {13305#false} assume !false; {13305#false} is VALID [2018-11-23 13:11:40,090 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 50 proven. 11 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-11-23 13:11:40,108 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:11:40,108 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 26 [2018-11-23 13:11:40,109 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 56 [2018-11-23 13:11:40,109 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:11:40,109 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 26 states. [2018-11-23 13:11:40,195 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 69 edges. 69 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:11:40,195 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-11-23 13:11:40,195 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-11-23 13:11:40,195 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=513, Unknown=0, NotChecked=0, Total=650 [2018-11-23 13:11:40,196 INFO L87 Difference]: Start difference. First operand 70 states and 77 transitions. Second operand 26 states. [2018-11-23 13:11:42,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:11:42,491 INFO L93 Difference]: Finished difference Result 205 states and 253 transitions. [2018-11-23 13:11:42,491 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-11-23 13:11:42,491 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 56 [2018-11-23 13:11:42,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:11:42,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-23 13:11:42,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 114 transitions. [2018-11-23 13:11:42,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-23 13:11:42,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 114 transitions. [2018-11-23 13:11:42,495 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 29 states and 114 transitions. [2018-11-23 13:11:42,602 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 114 edges. 114 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:11:42,606 INFO L225 Difference]: With dead ends: 205 [2018-11-23 13:11:42,606 INFO L226 Difference]: Without dead ends: 179 [2018-11-23 13:11:42,607 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 580 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=465, Invalid=1791, Unknown=0, NotChecked=0, Total=2256 [2018-11-23 13:11:42,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2018-11-23 13:11:42,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 70. [2018-11-23 13:11:42,787 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:11:42,787 INFO L82 GeneralOperation]: Start isEquivalent. First operand 179 states. Second operand 70 states. [2018-11-23 13:11:42,787 INFO L74 IsIncluded]: Start isIncluded. First operand 179 states. Second operand 70 states. [2018-11-23 13:11:42,787 INFO L87 Difference]: Start difference. First operand 179 states. Second operand 70 states. [2018-11-23 13:11:42,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:11:42,790 INFO L93 Difference]: Finished difference Result 179 states and 221 transitions. [2018-11-23 13:11:42,790 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 221 transitions. [2018-11-23 13:11:42,791 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:11:42,791 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:11:42,791 INFO L74 IsIncluded]: Start isIncluded. First operand 70 states. Second operand 179 states. [2018-11-23 13:11:42,791 INFO L87 Difference]: Start difference. First operand 70 states. Second operand 179 states. [2018-11-23 13:11:42,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:11:42,796 INFO L93 Difference]: Finished difference Result 179 states and 221 transitions. [2018-11-23 13:11:42,796 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 221 transitions. [2018-11-23 13:11:42,796 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:11:42,797 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:11:42,797 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:11:42,797 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:11:42,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-11-23 13:11:42,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 77 transitions. [2018-11-23 13:11:42,798 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 77 transitions. Word has length 56 [2018-11-23 13:11:42,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:11:42,798 INFO L480 AbstractCegarLoop]: Abstraction has 70 states and 77 transitions. [2018-11-23 13:11:42,799 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-11-23 13:11:42,799 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 77 transitions. [2018-11-23 13:11:42,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-11-23 13:11:42,799 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:11:42,799 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:11:42,800 INFO L423 AbstractCegarLoop]: === Iteration 26 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:11:42,800 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:11:42,800 INFO L82 PathProgramCache]: Analyzing trace with hash -1750216529, now seen corresponding path program 5 times [2018-11-23 13:11:42,800 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:11:42,800 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:11:42,801 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:11:42,801 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:11:42,801 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:11:42,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:11:43,057 INFO L256 TraceCheckUtils]: 0: Hoare triple {14337#true} call ULTIMATE.init(); {14337#true} is VALID [2018-11-23 13:11:43,057 INFO L273 TraceCheckUtils]: 1: Hoare triple {14337#true} assume true; {14337#true} is VALID [2018-11-23 13:11:43,057 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {14337#true} {14337#true} #66#return; {14337#true} is VALID [2018-11-23 13:11:43,057 INFO L256 TraceCheckUtils]: 3: Hoare triple {14337#true} call #t~ret9 := main(); {14337#true} is VALID [2018-11-23 13:11:43,058 INFO L273 TraceCheckUtils]: 4: Hoare triple {14337#true} havoc ~n0~0;havoc ~n1~0;~i0~0 := 0;~k~0 := 0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n0~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~n1~0 := #t~nondet2;havoc #t~nondet2; {14339#(<= main_~i0~0 0)} is VALID [2018-11-23 13:11:43,058 INFO L273 TraceCheckUtils]: 5: Hoare triple {14339#(<= main_~i0~0 0)} assume !!(-1000000 <= ~n0~0 && ~n0~0 < 1000000); {14339#(<= main_~i0~0 0)} is VALID [2018-11-23 13:11:43,059 INFO L273 TraceCheckUtils]: 6: Hoare triple {14339#(<= main_~i0~0 0)} assume !!(-1000000 <= ~n1~0 && ~n1~0 < 1000000); {14339#(<= main_~i0~0 0)} is VALID [2018-11-23 13:11:43,060 INFO L273 TraceCheckUtils]: 7: Hoare triple {14339#(<= main_~i0~0 0)} assume !!(~i0~0 < ~n0~0);#t~post3 := ~i0~0;~i0~0 := 1 + #t~post3;havoc #t~post3;#t~post4 := ~k~0;~k~0 := 1 + #t~post4;havoc #t~post4; {14340#(<= main_~i0~0 1)} is VALID [2018-11-23 13:11:43,061 INFO L273 TraceCheckUtils]: 8: Hoare triple {14340#(<= main_~i0~0 1)} assume !!(~i0~0 < ~n0~0);#t~post3 := ~i0~0;~i0~0 := 1 + #t~post3;havoc #t~post3;#t~post4 := ~k~0;~k~0 := 1 + #t~post4;havoc #t~post4; {14341#(<= main_~i0~0 2)} is VALID [2018-11-23 13:11:43,062 INFO L273 TraceCheckUtils]: 9: Hoare triple {14341#(<= main_~i0~0 2)} assume !!(~i0~0 < ~n0~0);#t~post3 := ~i0~0;~i0~0 := 1 + #t~post3;havoc #t~post3;#t~post4 := ~k~0;~k~0 := 1 + #t~post4;havoc #t~post4; {14342#(<= main_~i0~0 3)} is VALID [2018-11-23 13:11:43,062 INFO L273 TraceCheckUtils]: 10: Hoare triple {14342#(<= main_~i0~0 3)} assume !!(~i0~0 < ~n0~0);#t~post3 := ~i0~0;~i0~0 := 1 + #t~post3;havoc #t~post3;#t~post4 := ~k~0;~k~0 := 1 + #t~post4;havoc #t~post4; {14343#(<= main_~i0~0 4)} is VALID [2018-11-23 13:11:43,063 INFO L273 TraceCheckUtils]: 11: Hoare triple {14343#(<= main_~i0~0 4)} assume !!(~i0~0 < ~n0~0);#t~post3 := ~i0~0;~i0~0 := 1 + #t~post3;havoc #t~post3;#t~post4 := ~k~0;~k~0 := 1 + #t~post4;havoc #t~post4; {14344#(<= main_~i0~0 5)} is VALID [2018-11-23 13:11:43,064 INFO L273 TraceCheckUtils]: 12: Hoare triple {14344#(<= main_~i0~0 5)} assume !(~i0~0 < ~n0~0); {14345#(<= main_~n0~0 5)} is VALID [2018-11-23 13:11:43,065 INFO L273 TraceCheckUtils]: 13: Hoare triple {14345#(<= main_~n0~0 5)} ~i1~0 := 0; {14346#(<= (+ main_~i1~0 main_~n0~0) 5)} is VALID [2018-11-23 13:11:43,065 INFO L273 TraceCheckUtils]: 14: Hoare triple {14346#(<= (+ main_~i1~0 main_~n0~0) 5)} assume !(~i1~0 < ~n1~0); {14347#(<= (+ main_~n0~0 main_~n1~0) 5)} is VALID [2018-11-23 13:11:43,066 INFO L273 TraceCheckUtils]: 15: Hoare triple {14347#(<= (+ main_~n0~0 main_~n1~0) 5)} ~j1~0 := 0; {14348#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 5))} is VALID [2018-11-23 13:11:43,066 INFO L273 TraceCheckUtils]: 16: Hoare triple {14348#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 5))} assume !!(~j1~0 < ~n0~0 + ~n1~0); {14348#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 5))} is VALID [2018-11-23 13:11:43,067 INFO L256 TraceCheckUtils]: 17: Hoare triple {14348#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 5))} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {14337#true} is VALID [2018-11-23 13:11:43,067 INFO L273 TraceCheckUtils]: 18: Hoare triple {14337#true} ~cond := #in~cond; {14337#true} is VALID [2018-11-23 13:11:43,067 INFO L273 TraceCheckUtils]: 19: Hoare triple {14337#true} assume !(0 == ~cond); {14337#true} is VALID [2018-11-23 13:11:43,067 INFO L273 TraceCheckUtils]: 20: Hoare triple {14337#true} assume true; {14337#true} is VALID [2018-11-23 13:11:43,068 INFO L268 TraceCheckUtils]: 21: Hoare quadruple {14337#true} {14348#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 5))} #70#return; {14348#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 5))} is VALID [2018-11-23 13:11:43,069 INFO L273 TraceCheckUtils]: 22: Hoare triple {14348#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 5))} #t~post7 := ~j1~0;~j1~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~k~0;~k~0 := #t~post8 - 1;havoc #t~post8; {14349#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 4))} is VALID [2018-11-23 13:11:43,069 INFO L273 TraceCheckUtils]: 23: Hoare triple {14349#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 4))} assume !!(~j1~0 < ~n0~0 + ~n1~0); {14349#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 4))} is VALID [2018-11-23 13:11:43,070 INFO L256 TraceCheckUtils]: 24: Hoare triple {14349#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 4))} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {14337#true} is VALID [2018-11-23 13:11:43,070 INFO L273 TraceCheckUtils]: 25: Hoare triple {14337#true} ~cond := #in~cond; {14337#true} is VALID [2018-11-23 13:11:43,070 INFO L273 TraceCheckUtils]: 26: Hoare triple {14337#true} assume !(0 == ~cond); {14337#true} is VALID [2018-11-23 13:11:43,070 INFO L273 TraceCheckUtils]: 27: Hoare triple {14337#true} assume true; {14337#true} is VALID [2018-11-23 13:11:43,070 INFO L268 TraceCheckUtils]: 28: Hoare quadruple {14337#true} {14349#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 4))} #70#return; {14349#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 4))} is VALID [2018-11-23 13:11:43,071 INFO L273 TraceCheckUtils]: 29: Hoare triple {14349#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 4))} #t~post7 := ~j1~0;~j1~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~k~0;~k~0 := #t~post8 - 1;havoc #t~post8; {14350#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 3))} is VALID [2018-11-23 13:11:43,071 INFO L273 TraceCheckUtils]: 30: Hoare triple {14350#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 3))} assume !!(~j1~0 < ~n0~0 + ~n1~0); {14350#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 3))} is VALID [2018-11-23 13:11:43,072 INFO L256 TraceCheckUtils]: 31: Hoare triple {14350#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 3))} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {14337#true} is VALID [2018-11-23 13:11:43,072 INFO L273 TraceCheckUtils]: 32: Hoare triple {14337#true} ~cond := #in~cond; {14337#true} is VALID [2018-11-23 13:11:43,072 INFO L273 TraceCheckUtils]: 33: Hoare triple {14337#true} assume !(0 == ~cond); {14337#true} is VALID [2018-11-23 13:11:43,072 INFO L273 TraceCheckUtils]: 34: Hoare triple {14337#true} assume true; {14337#true} is VALID [2018-11-23 13:11:43,073 INFO L268 TraceCheckUtils]: 35: Hoare quadruple {14337#true} {14350#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 3))} #70#return; {14350#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 3))} is VALID [2018-11-23 13:11:43,074 INFO L273 TraceCheckUtils]: 36: Hoare triple {14350#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 3))} #t~post7 := ~j1~0;~j1~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~k~0;~k~0 := #t~post8 - 1;havoc #t~post8; {14351#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 2))} is VALID [2018-11-23 13:11:43,074 INFO L273 TraceCheckUtils]: 37: Hoare triple {14351#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 2))} assume !!(~j1~0 < ~n0~0 + ~n1~0); {14351#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 2))} is VALID [2018-11-23 13:11:43,074 INFO L256 TraceCheckUtils]: 38: Hoare triple {14351#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 2))} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {14337#true} is VALID [2018-11-23 13:11:43,074 INFO L273 TraceCheckUtils]: 39: Hoare triple {14337#true} ~cond := #in~cond; {14337#true} is VALID [2018-11-23 13:11:43,074 INFO L273 TraceCheckUtils]: 40: Hoare triple {14337#true} assume !(0 == ~cond); {14337#true} is VALID [2018-11-23 13:11:43,074 INFO L273 TraceCheckUtils]: 41: Hoare triple {14337#true} assume true; {14337#true} is VALID [2018-11-23 13:11:43,075 INFO L268 TraceCheckUtils]: 42: Hoare quadruple {14337#true} {14351#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 2))} #70#return; {14351#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 2))} is VALID [2018-11-23 13:11:43,076 INFO L273 TraceCheckUtils]: 43: Hoare triple {14351#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 2))} #t~post7 := ~j1~0;~j1~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~k~0;~k~0 := #t~post8 - 1;havoc #t~post8; {14352#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 1))} is VALID [2018-11-23 13:11:43,076 INFO L273 TraceCheckUtils]: 44: Hoare triple {14352#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 1))} assume !!(~j1~0 < ~n0~0 + ~n1~0); {14352#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 1))} is VALID [2018-11-23 13:11:43,076 INFO L256 TraceCheckUtils]: 45: Hoare triple {14352#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 1))} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {14337#true} is VALID [2018-11-23 13:11:43,076 INFO L273 TraceCheckUtils]: 46: Hoare triple {14337#true} ~cond := #in~cond; {14337#true} is VALID [2018-11-23 13:11:43,077 INFO L273 TraceCheckUtils]: 47: Hoare triple {14337#true} assume !(0 == ~cond); {14337#true} is VALID [2018-11-23 13:11:43,077 INFO L273 TraceCheckUtils]: 48: Hoare triple {14337#true} assume true; {14337#true} is VALID [2018-11-23 13:11:43,078 INFO L268 TraceCheckUtils]: 49: Hoare quadruple {14337#true} {14352#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 1))} #70#return; {14352#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 1))} is VALID [2018-11-23 13:11:43,079 INFO L273 TraceCheckUtils]: 50: Hoare triple {14352#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 1))} #t~post7 := ~j1~0;~j1~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~k~0;~k~0 := #t~post8 - 1;havoc #t~post8; {14353#(<= (+ main_~n0~0 main_~n1~0) main_~j1~0)} is VALID [2018-11-23 13:11:43,079 INFO L273 TraceCheckUtils]: 51: Hoare triple {14353#(<= (+ main_~n0~0 main_~n1~0) main_~j1~0)} assume !!(~j1~0 < ~n0~0 + ~n1~0); {14338#false} is VALID [2018-11-23 13:11:43,079 INFO L256 TraceCheckUtils]: 52: Hoare triple {14338#false} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {14338#false} is VALID [2018-11-23 13:11:43,080 INFO L273 TraceCheckUtils]: 53: Hoare triple {14338#false} ~cond := #in~cond; {14338#false} is VALID [2018-11-23 13:11:43,080 INFO L273 TraceCheckUtils]: 54: Hoare triple {14338#false} assume 0 == ~cond; {14338#false} is VALID [2018-11-23 13:11:43,080 INFO L273 TraceCheckUtils]: 55: Hoare triple {14338#false} assume !false; {14338#false} is VALID [2018-11-23 13:11:43,084 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 50 proven. 15 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-11-23 13:11:43,084 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:11:43,084 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:11:43,093 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 13:11:43,114 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-11-23 13:11:43,114 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:11:43,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:11:43,127 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:11:43,633 INFO L256 TraceCheckUtils]: 0: Hoare triple {14337#true} call ULTIMATE.init(); {14337#true} is VALID [2018-11-23 13:11:43,633 INFO L273 TraceCheckUtils]: 1: Hoare triple {14337#true} assume true; {14337#true} is VALID [2018-11-23 13:11:43,633 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {14337#true} {14337#true} #66#return; {14337#true} is VALID [2018-11-23 13:11:43,633 INFO L256 TraceCheckUtils]: 3: Hoare triple {14337#true} call #t~ret9 := main(); {14337#true} is VALID [2018-11-23 13:11:43,634 INFO L273 TraceCheckUtils]: 4: Hoare triple {14337#true} havoc ~n0~0;havoc ~n1~0;~i0~0 := 0;~k~0 := 0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n0~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~n1~0 := #t~nondet2;havoc #t~nondet2; {14339#(<= main_~i0~0 0)} is VALID [2018-11-23 13:11:43,634 INFO L273 TraceCheckUtils]: 5: Hoare triple {14339#(<= main_~i0~0 0)} assume !!(-1000000 <= ~n0~0 && ~n0~0 < 1000000); {14339#(<= main_~i0~0 0)} is VALID [2018-11-23 13:11:43,634 INFO L273 TraceCheckUtils]: 6: Hoare triple {14339#(<= main_~i0~0 0)} assume !!(-1000000 <= ~n1~0 && ~n1~0 < 1000000); {14339#(<= main_~i0~0 0)} is VALID [2018-11-23 13:11:43,635 INFO L273 TraceCheckUtils]: 7: Hoare triple {14339#(<= main_~i0~0 0)} assume !!(~i0~0 < ~n0~0);#t~post3 := ~i0~0;~i0~0 := 1 + #t~post3;havoc #t~post3;#t~post4 := ~k~0;~k~0 := 1 + #t~post4;havoc #t~post4; {14340#(<= main_~i0~0 1)} is VALID [2018-11-23 13:11:43,636 INFO L273 TraceCheckUtils]: 8: Hoare triple {14340#(<= main_~i0~0 1)} assume !!(~i0~0 < ~n0~0);#t~post3 := ~i0~0;~i0~0 := 1 + #t~post3;havoc #t~post3;#t~post4 := ~k~0;~k~0 := 1 + #t~post4;havoc #t~post4; {14341#(<= main_~i0~0 2)} is VALID [2018-11-23 13:11:43,637 INFO L273 TraceCheckUtils]: 9: Hoare triple {14341#(<= main_~i0~0 2)} assume !!(~i0~0 < ~n0~0);#t~post3 := ~i0~0;~i0~0 := 1 + #t~post3;havoc #t~post3;#t~post4 := ~k~0;~k~0 := 1 + #t~post4;havoc #t~post4; {14342#(<= main_~i0~0 3)} is VALID [2018-11-23 13:11:43,637 INFO L273 TraceCheckUtils]: 10: Hoare triple {14342#(<= main_~i0~0 3)} assume !!(~i0~0 < ~n0~0);#t~post3 := ~i0~0;~i0~0 := 1 + #t~post3;havoc #t~post3;#t~post4 := ~k~0;~k~0 := 1 + #t~post4;havoc #t~post4; {14343#(<= main_~i0~0 4)} is VALID [2018-11-23 13:11:43,638 INFO L273 TraceCheckUtils]: 11: Hoare triple {14343#(<= main_~i0~0 4)} assume !!(~i0~0 < ~n0~0);#t~post3 := ~i0~0;~i0~0 := 1 + #t~post3;havoc #t~post3;#t~post4 := ~k~0;~k~0 := 1 + #t~post4;havoc #t~post4; {14344#(<= main_~i0~0 5)} is VALID [2018-11-23 13:11:43,639 INFO L273 TraceCheckUtils]: 12: Hoare triple {14344#(<= main_~i0~0 5)} assume !(~i0~0 < ~n0~0); {14345#(<= main_~n0~0 5)} is VALID [2018-11-23 13:11:43,640 INFO L273 TraceCheckUtils]: 13: Hoare triple {14345#(<= main_~n0~0 5)} ~i1~0 := 0; {14396#(and (<= main_~i1~0 0) (<= main_~n0~0 5))} is VALID [2018-11-23 13:11:43,640 INFO L273 TraceCheckUtils]: 14: Hoare triple {14396#(and (<= main_~i1~0 0) (<= main_~n0~0 5))} assume !(~i1~0 < ~n1~0); {14400#(and (<= main_~n1~0 0) (<= main_~n0~0 5))} is VALID [2018-11-23 13:11:43,641 INFO L273 TraceCheckUtils]: 15: Hoare triple {14400#(and (<= main_~n1~0 0) (<= main_~n0~0 5))} ~j1~0 := 0; {14404#(and (<= main_~n1~0 0) (<= 0 main_~j1~0) (<= main_~n0~0 5))} is VALID [2018-11-23 13:11:43,642 INFO L273 TraceCheckUtils]: 16: Hoare triple {14404#(and (<= main_~n1~0 0) (<= 0 main_~j1~0) (<= main_~n0~0 5))} assume !!(~j1~0 < ~n0~0 + ~n1~0); {14404#(and (<= main_~n1~0 0) (<= 0 main_~j1~0) (<= main_~n0~0 5))} is VALID [2018-11-23 13:11:43,642 INFO L256 TraceCheckUtils]: 17: Hoare triple {14404#(and (<= main_~n1~0 0) (<= 0 main_~j1~0) (<= main_~n0~0 5))} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {14337#true} is VALID [2018-11-23 13:11:43,642 INFO L273 TraceCheckUtils]: 18: Hoare triple {14337#true} ~cond := #in~cond; {14337#true} is VALID [2018-11-23 13:11:43,642 INFO L273 TraceCheckUtils]: 19: Hoare triple {14337#true} assume !(0 == ~cond); {14337#true} is VALID [2018-11-23 13:11:43,642 INFO L273 TraceCheckUtils]: 20: Hoare triple {14337#true} assume true; {14337#true} is VALID [2018-11-23 13:11:43,643 INFO L268 TraceCheckUtils]: 21: Hoare quadruple {14337#true} {14404#(and (<= main_~n1~0 0) (<= 0 main_~j1~0) (<= main_~n0~0 5))} #70#return; {14404#(and (<= main_~n1~0 0) (<= 0 main_~j1~0) (<= main_~n0~0 5))} is VALID [2018-11-23 13:11:43,644 INFO L273 TraceCheckUtils]: 22: Hoare triple {14404#(and (<= main_~n1~0 0) (<= 0 main_~j1~0) (<= main_~n0~0 5))} #t~post7 := ~j1~0;~j1~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~k~0;~k~0 := #t~post8 - 1;havoc #t~post8; {14426#(and (<= main_~n1~0 0) (<= 1 main_~j1~0) (<= main_~n0~0 5))} is VALID [2018-11-23 13:11:43,645 INFO L273 TraceCheckUtils]: 23: Hoare triple {14426#(and (<= main_~n1~0 0) (<= 1 main_~j1~0) (<= main_~n0~0 5))} assume !!(~j1~0 < ~n0~0 + ~n1~0); {14426#(and (<= main_~n1~0 0) (<= 1 main_~j1~0) (<= main_~n0~0 5))} is VALID [2018-11-23 13:11:43,645 INFO L256 TraceCheckUtils]: 24: Hoare triple {14426#(and (<= main_~n1~0 0) (<= 1 main_~j1~0) (<= main_~n0~0 5))} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {14337#true} is VALID [2018-11-23 13:11:43,645 INFO L273 TraceCheckUtils]: 25: Hoare triple {14337#true} ~cond := #in~cond; {14337#true} is VALID [2018-11-23 13:11:43,646 INFO L273 TraceCheckUtils]: 26: Hoare triple {14337#true} assume !(0 == ~cond); {14337#true} is VALID [2018-11-23 13:11:43,646 INFO L273 TraceCheckUtils]: 27: Hoare triple {14337#true} assume true; {14337#true} is VALID [2018-11-23 13:11:43,647 INFO L268 TraceCheckUtils]: 28: Hoare quadruple {14337#true} {14426#(and (<= main_~n1~0 0) (<= 1 main_~j1~0) (<= main_~n0~0 5))} #70#return; {14426#(and (<= main_~n1~0 0) (<= 1 main_~j1~0) (<= main_~n0~0 5))} is VALID [2018-11-23 13:11:43,648 INFO L273 TraceCheckUtils]: 29: Hoare triple {14426#(and (<= main_~n1~0 0) (<= 1 main_~j1~0) (<= main_~n0~0 5))} #t~post7 := ~j1~0;~j1~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~k~0;~k~0 := #t~post8 - 1;havoc #t~post8; {14448#(and (<= main_~n1~0 0) (<= main_~n0~0 5) (<= 2 main_~j1~0))} is VALID [2018-11-23 13:11:43,648 INFO L273 TraceCheckUtils]: 30: Hoare triple {14448#(and (<= main_~n1~0 0) (<= main_~n0~0 5) (<= 2 main_~j1~0))} assume !!(~j1~0 < ~n0~0 + ~n1~0); {14448#(and (<= main_~n1~0 0) (<= main_~n0~0 5) (<= 2 main_~j1~0))} is VALID [2018-11-23 13:11:43,649 INFO L256 TraceCheckUtils]: 31: Hoare triple {14448#(and (<= main_~n1~0 0) (<= main_~n0~0 5) (<= 2 main_~j1~0))} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {14337#true} is VALID [2018-11-23 13:11:43,649 INFO L273 TraceCheckUtils]: 32: Hoare triple {14337#true} ~cond := #in~cond; {14337#true} is VALID [2018-11-23 13:11:43,649 INFO L273 TraceCheckUtils]: 33: Hoare triple {14337#true} assume !(0 == ~cond); {14337#true} is VALID [2018-11-23 13:11:43,649 INFO L273 TraceCheckUtils]: 34: Hoare triple {14337#true} assume true; {14337#true} is VALID [2018-11-23 13:11:43,650 INFO L268 TraceCheckUtils]: 35: Hoare quadruple {14337#true} {14448#(and (<= main_~n1~0 0) (<= main_~n0~0 5) (<= 2 main_~j1~0))} #70#return; {14448#(and (<= main_~n1~0 0) (<= main_~n0~0 5) (<= 2 main_~j1~0))} is VALID [2018-11-23 13:11:43,651 INFO L273 TraceCheckUtils]: 36: Hoare triple {14448#(and (<= main_~n1~0 0) (<= main_~n0~0 5) (<= 2 main_~j1~0))} #t~post7 := ~j1~0;~j1~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~k~0;~k~0 := #t~post8 - 1;havoc #t~post8; {14470#(and (<= main_~n1~0 0) (<= 3 main_~j1~0) (<= main_~n0~0 5))} is VALID [2018-11-23 13:11:43,651 INFO L273 TraceCheckUtils]: 37: Hoare triple {14470#(and (<= main_~n1~0 0) (<= 3 main_~j1~0) (<= main_~n0~0 5))} assume !!(~j1~0 < ~n0~0 + ~n1~0); {14470#(and (<= main_~n1~0 0) (<= 3 main_~j1~0) (<= main_~n0~0 5))} is VALID [2018-11-23 13:11:43,651 INFO L256 TraceCheckUtils]: 38: Hoare triple {14470#(and (<= main_~n1~0 0) (<= 3 main_~j1~0) (<= main_~n0~0 5))} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {14337#true} is VALID [2018-11-23 13:11:43,651 INFO L273 TraceCheckUtils]: 39: Hoare triple {14337#true} ~cond := #in~cond; {14337#true} is VALID [2018-11-23 13:11:43,651 INFO L273 TraceCheckUtils]: 40: Hoare triple {14337#true} assume !(0 == ~cond); {14337#true} is VALID [2018-11-23 13:11:43,652 INFO L273 TraceCheckUtils]: 41: Hoare triple {14337#true} assume true; {14337#true} is VALID [2018-11-23 13:11:43,652 INFO L268 TraceCheckUtils]: 42: Hoare quadruple {14337#true} {14470#(and (<= main_~n1~0 0) (<= 3 main_~j1~0) (<= main_~n0~0 5))} #70#return; {14470#(and (<= main_~n1~0 0) (<= 3 main_~j1~0) (<= main_~n0~0 5))} is VALID [2018-11-23 13:11:43,653 INFO L273 TraceCheckUtils]: 43: Hoare triple {14470#(and (<= main_~n1~0 0) (<= 3 main_~j1~0) (<= main_~n0~0 5))} #t~post7 := ~j1~0;~j1~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~k~0;~k~0 := #t~post8 - 1;havoc #t~post8; {14492#(and (<= main_~n1~0 0) (<= 4 main_~j1~0) (<= main_~n0~0 5))} is VALID [2018-11-23 13:11:43,654 INFO L273 TraceCheckUtils]: 44: Hoare triple {14492#(and (<= main_~n1~0 0) (<= 4 main_~j1~0) (<= main_~n0~0 5))} assume !!(~j1~0 < ~n0~0 + ~n1~0); {14492#(and (<= main_~n1~0 0) (<= 4 main_~j1~0) (<= main_~n0~0 5))} is VALID [2018-11-23 13:11:43,654 INFO L256 TraceCheckUtils]: 45: Hoare triple {14492#(and (<= main_~n1~0 0) (<= 4 main_~j1~0) (<= main_~n0~0 5))} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {14337#true} is VALID [2018-11-23 13:11:43,654 INFO L273 TraceCheckUtils]: 46: Hoare triple {14337#true} ~cond := #in~cond; {14337#true} is VALID [2018-11-23 13:11:43,654 INFO L273 TraceCheckUtils]: 47: Hoare triple {14337#true} assume !(0 == ~cond); {14337#true} is VALID [2018-11-23 13:11:43,655 INFO L273 TraceCheckUtils]: 48: Hoare triple {14337#true} assume true; {14337#true} is VALID [2018-11-23 13:11:43,655 INFO L268 TraceCheckUtils]: 49: Hoare quadruple {14337#true} {14492#(and (<= main_~n1~0 0) (<= 4 main_~j1~0) (<= main_~n0~0 5))} #70#return; {14492#(and (<= main_~n1~0 0) (<= 4 main_~j1~0) (<= main_~n0~0 5))} is VALID [2018-11-23 13:11:43,656 INFO L273 TraceCheckUtils]: 50: Hoare triple {14492#(and (<= main_~n1~0 0) (<= 4 main_~j1~0) (<= main_~n0~0 5))} #t~post7 := ~j1~0;~j1~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~k~0;~k~0 := #t~post8 - 1;havoc #t~post8; {14514#(and (<= main_~n1~0 0) (<= main_~n0~0 5) (<= 5 main_~j1~0))} is VALID [2018-11-23 13:11:43,657 INFO L273 TraceCheckUtils]: 51: Hoare triple {14514#(and (<= main_~n1~0 0) (<= main_~n0~0 5) (<= 5 main_~j1~0))} assume !!(~j1~0 < ~n0~0 + ~n1~0); {14338#false} is VALID [2018-11-23 13:11:43,657 INFO L256 TraceCheckUtils]: 52: Hoare triple {14338#false} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {14338#false} is VALID [2018-11-23 13:11:43,657 INFO L273 TraceCheckUtils]: 53: Hoare triple {14338#false} ~cond := #in~cond; {14338#false} is VALID [2018-11-23 13:11:43,658 INFO L273 TraceCheckUtils]: 54: Hoare triple {14338#false} assume 0 == ~cond; {14338#false} is VALID [2018-11-23 13:11:43,658 INFO L273 TraceCheckUtils]: 55: Hoare triple {14338#false} assume !false; {14338#false} is VALID [2018-11-23 13:11:43,662 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 50 proven. 15 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-11-23 13:11:43,680 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:11:43,681 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 25 [2018-11-23 13:11:43,681 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 56 [2018-11-23 13:11:43,681 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:11:43,681 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 25 states. [2018-11-23 13:11:43,744 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 68 edges. 68 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:11:43,744 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-11-23 13:11:43,744 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-11-23 13:11:43,745 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=465, Unknown=0, NotChecked=0, Total=600 [2018-11-23 13:11:43,745 INFO L87 Difference]: Start difference. First operand 70 states and 77 transitions. Second operand 25 states. [2018-11-23 13:11:46,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:11:46,321 INFO L93 Difference]: Finished difference Result 227 states and 283 transitions. [2018-11-23 13:11:46,321 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-11-23 13:11:46,321 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 56 [2018-11-23 13:11:46,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:11:46,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-11-23 13:11:46,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 120 transitions. [2018-11-23 13:11:46,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-11-23 13:11:46,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 120 transitions. [2018-11-23 13:11:46,325 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 27 states and 120 transitions. [2018-11-23 13:11:46,503 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 120 edges. 120 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:11:46,508 INFO L225 Difference]: With dead ends: 227 [2018-11-23 13:11:46,509 INFO L226 Difference]: Without dead ends: 201 [2018-11-23 13:11:46,510 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 443 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=409, Invalid=1483, Unknown=0, NotChecked=0, Total=1892 [2018-11-23 13:11:46,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2018-11-23 13:11:46,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 72. [2018-11-23 13:11:46,849 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:11:46,849 INFO L82 GeneralOperation]: Start isEquivalent. First operand 201 states. Second operand 72 states. [2018-11-23 13:11:46,849 INFO L74 IsIncluded]: Start isIncluded. First operand 201 states. Second operand 72 states. [2018-11-23 13:11:46,849 INFO L87 Difference]: Start difference. First operand 201 states. Second operand 72 states. [2018-11-23 13:11:46,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:11:46,854 INFO L93 Difference]: Finished difference Result 201 states and 251 transitions. [2018-11-23 13:11:46,854 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 251 transitions. [2018-11-23 13:11:46,855 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:11:46,855 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:11:46,855 INFO L74 IsIncluded]: Start isIncluded. First operand 72 states. Second operand 201 states. [2018-11-23 13:11:46,855 INFO L87 Difference]: Start difference. First operand 72 states. Second operand 201 states. [2018-11-23 13:11:46,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:11:46,860 INFO L93 Difference]: Finished difference Result 201 states and 251 transitions. [2018-11-23 13:11:46,861 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 251 transitions. [2018-11-23 13:11:46,861 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:11:46,861 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:11:46,862 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:11:46,862 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:11:46,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-11-23 13:11:46,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 80 transitions. [2018-11-23 13:11:46,863 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 80 transitions. Word has length 56 [2018-11-23 13:11:46,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:11:46,864 INFO L480 AbstractCegarLoop]: Abstraction has 72 states and 80 transitions. [2018-11-23 13:11:46,864 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-11-23 13:11:46,864 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 80 transitions. [2018-11-23 13:11:46,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-11-23 13:11:46,864 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:11:46,864 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:11:46,865 INFO L423 AbstractCegarLoop]: === Iteration 27 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:11:46,865 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:11:46,865 INFO L82 PathProgramCache]: Analyzing trace with hash 1098123272, now seen corresponding path program 10 times [2018-11-23 13:11:46,865 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:11:46,865 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:11:46,866 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:11:46,866 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:11:46,866 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:11:46,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:11:47,183 INFO L256 TraceCheckUtils]: 0: Hoare triple {15447#true} call ULTIMATE.init(); {15447#true} is VALID [2018-11-23 13:11:47,183 INFO L273 TraceCheckUtils]: 1: Hoare triple {15447#true} assume true; {15447#true} is VALID [2018-11-23 13:11:47,183 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {15447#true} {15447#true} #66#return; {15447#true} is VALID [2018-11-23 13:11:47,183 INFO L256 TraceCheckUtils]: 3: Hoare triple {15447#true} call #t~ret9 := main(); {15447#true} is VALID [2018-11-23 13:11:47,184 INFO L273 TraceCheckUtils]: 4: Hoare triple {15447#true} havoc ~n0~0;havoc ~n1~0;~i0~0 := 0;~k~0 := 0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n0~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~n1~0 := #t~nondet2;havoc #t~nondet2; {15449#(<= 0 main_~k~0)} is VALID [2018-11-23 13:11:47,185 INFO L273 TraceCheckUtils]: 5: Hoare triple {15449#(<= 0 main_~k~0)} assume !!(-1000000 <= ~n0~0 && ~n0~0 < 1000000); {15449#(<= 0 main_~k~0)} is VALID [2018-11-23 13:11:47,185 INFO L273 TraceCheckUtils]: 6: Hoare triple {15449#(<= 0 main_~k~0)} assume !!(-1000000 <= ~n1~0 && ~n1~0 < 1000000); {15449#(<= 0 main_~k~0)} is VALID [2018-11-23 13:11:47,187 INFO L273 TraceCheckUtils]: 7: Hoare triple {15449#(<= 0 main_~k~0)} assume !(~i0~0 < ~n0~0); {15449#(<= 0 main_~k~0)} is VALID [2018-11-23 13:11:47,187 INFO L273 TraceCheckUtils]: 8: Hoare triple {15449#(<= 0 main_~k~0)} ~i1~0 := 0; {15449#(<= 0 main_~k~0)} is VALID [2018-11-23 13:11:47,189 INFO L273 TraceCheckUtils]: 9: Hoare triple {15449#(<= 0 main_~k~0)} assume !!(~i1~0 < ~n1~0);#t~post5 := ~i1~0;~i1~0 := 1 + #t~post5;havoc #t~post5;#t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {15450#(<= 1 main_~k~0)} is VALID [2018-11-23 13:11:47,189 INFO L273 TraceCheckUtils]: 10: Hoare triple {15450#(<= 1 main_~k~0)} assume !!(~i1~0 < ~n1~0);#t~post5 := ~i1~0;~i1~0 := 1 + #t~post5;havoc #t~post5;#t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {15451#(<= 2 main_~k~0)} is VALID [2018-11-23 13:11:47,191 INFO L273 TraceCheckUtils]: 11: Hoare triple {15451#(<= 2 main_~k~0)} assume !!(~i1~0 < ~n1~0);#t~post5 := ~i1~0;~i1~0 := 1 + #t~post5;havoc #t~post5;#t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {15452#(<= 3 main_~k~0)} is VALID [2018-11-23 13:11:47,191 INFO L273 TraceCheckUtils]: 12: Hoare triple {15452#(<= 3 main_~k~0)} assume !!(~i1~0 < ~n1~0);#t~post5 := ~i1~0;~i1~0 := 1 + #t~post5;havoc #t~post5;#t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {15453#(<= 4 main_~k~0)} is VALID [2018-11-23 13:11:47,193 INFO L273 TraceCheckUtils]: 13: Hoare triple {15453#(<= 4 main_~k~0)} assume !!(~i1~0 < ~n1~0);#t~post5 := ~i1~0;~i1~0 := 1 + #t~post5;havoc #t~post5;#t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {15454#(<= 5 main_~k~0)} is VALID [2018-11-23 13:11:47,193 INFO L273 TraceCheckUtils]: 14: Hoare triple {15454#(<= 5 main_~k~0)} assume !!(~i1~0 < ~n1~0);#t~post5 := ~i1~0;~i1~0 := 1 + #t~post5;havoc #t~post5;#t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {15455#(<= 6 main_~k~0)} is VALID [2018-11-23 13:11:47,195 INFO L273 TraceCheckUtils]: 15: Hoare triple {15455#(<= 6 main_~k~0)} assume !(~i1~0 < ~n1~0); {15455#(<= 6 main_~k~0)} is VALID [2018-11-23 13:11:47,195 INFO L273 TraceCheckUtils]: 16: Hoare triple {15455#(<= 6 main_~k~0)} ~j1~0 := 0; {15455#(<= 6 main_~k~0)} is VALID [2018-11-23 13:11:47,197 INFO L273 TraceCheckUtils]: 17: Hoare triple {15455#(<= 6 main_~k~0)} assume !!(~j1~0 < ~n0~0 + ~n1~0); {15455#(<= 6 main_~k~0)} is VALID [2018-11-23 13:11:47,197 INFO L256 TraceCheckUtils]: 18: Hoare triple {15455#(<= 6 main_~k~0)} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {15447#true} is VALID [2018-11-23 13:11:47,197 INFO L273 TraceCheckUtils]: 19: Hoare triple {15447#true} ~cond := #in~cond; {15456#(= __VERIFIER_assert_~cond |__VERIFIER_assert_#in~cond|)} is VALID [2018-11-23 13:11:47,197 INFO L273 TraceCheckUtils]: 20: Hoare triple {15456#(= __VERIFIER_assert_~cond |__VERIFIER_assert_#in~cond|)} assume !(0 == ~cond); {15457#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2018-11-23 13:11:47,198 INFO L273 TraceCheckUtils]: 21: Hoare triple {15457#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {15457#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2018-11-23 13:11:47,198 INFO L268 TraceCheckUtils]: 22: Hoare quadruple {15457#(not (= |__VERIFIER_assert_#in~cond| 0))} {15455#(<= 6 main_~k~0)} #70#return; {15455#(<= 6 main_~k~0)} is VALID [2018-11-23 13:11:47,199 INFO L273 TraceCheckUtils]: 23: Hoare triple {15455#(<= 6 main_~k~0)} #t~post7 := ~j1~0;~j1~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~k~0;~k~0 := #t~post8 - 1;havoc #t~post8; {15454#(<= 5 main_~k~0)} is VALID [2018-11-23 13:11:47,199 INFO L273 TraceCheckUtils]: 24: Hoare triple {15454#(<= 5 main_~k~0)} assume !!(~j1~0 < ~n0~0 + ~n1~0); {15454#(<= 5 main_~k~0)} is VALID [2018-11-23 13:11:47,199 INFO L256 TraceCheckUtils]: 25: Hoare triple {15454#(<= 5 main_~k~0)} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {15447#true} is VALID [2018-11-23 13:11:47,200 INFO L273 TraceCheckUtils]: 26: Hoare triple {15447#true} ~cond := #in~cond; {15447#true} is VALID [2018-11-23 13:11:47,200 INFO L273 TraceCheckUtils]: 27: Hoare triple {15447#true} assume !(0 == ~cond); {15447#true} is VALID [2018-11-23 13:11:47,200 INFO L273 TraceCheckUtils]: 28: Hoare triple {15447#true} assume true; {15447#true} is VALID [2018-11-23 13:11:47,200 INFO L268 TraceCheckUtils]: 29: Hoare quadruple {15447#true} {15454#(<= 5 main_~k~0)} #70#return; {15454#(<= 5 main_~k~0)} is VALID [2018-11-23 13:11:47,201 INFO L273 TraceCheckUtils]: 30: Hoare triple {15454#(<= 5 main_~k~0)} #t~post7 := ~j1~0;~j1~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~k~0;~k~0 := #t~post8 - 1;havoc #t~post8; {15453#(<= 4 main_~k~0)} is VALID [2018-11-23 13:11:47,201 INFO L273 TraceCheckUtils]: 31: Hoare triple {15453#(<= 4 main_~k~0)} assume !!(~j1~0 < ~n0~0 + ~n1~0); {15453#(<= 4 main_~k~0)} is VALID [2018-11-23 13:11:47,201 INFO L256 TraceCheckUtils]: 32: Hoare triple {15453#(<= 4 main_~k~0)} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {15447#true} is VALID [2018-11-23 13:11:47,202 INFO L273 TraceCheckUtils]: 33: Hoare triple {15447#true} ~cond := #in~cond; {15447#true} is VALID [2018-11-23 13:11:47,202 INFO L273 TraceCheckUtils]: 34: Hoare triple {15447#true} assume !(0 == ~cond); {15447#true} is VALID [2018-11-23 13:11:47,202 INFO L273 TraceCheckUtils]: 35: Hoare triple {15447#true} assume true; {15447#true} is VALID [2018-11-23 13:11:47,203 INFO L268 TraceCheckUtils]: 36: Hoare quadruple {15447#true} {15453#(<= 4 main_~k~0)} #70#return; {15453#(<= 4 main_~k~0)} is VALID [2018-11-23 13:11:47,204 INFO L273 TraceCheckUtils]: 37: Hoare triple {15453#(<= 4 main_~k~0)} #t~post7 := ~j1~0;~j1~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~k~0;~k~0 := #t~post8 - 1;havoc #t~post8; {15452#(<= 3 main_~k~0)} is VALID [2018-11-23 13:11:47,204 INFO L273 TraceCheckUtils]: 38: Hoare triple {15452#(<= 3 main_~k~0)} assume !!(~j1~0 < ~n0~0 + ~n1~0); {15452#(<= 3 main_~k~0)} is VALID [2018-11-23 13:11:47,205 INFO L256 TraceCheckUtils]: 39: Hoare triple {15452#(<= 3 main_~k~0)} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {15447#true} is VALID [2018-11-23 13:11:47,205 INFO L273 TraceCheckUtils]: 40: Hoare triple {15447#true} ~cond := #in~cond; {15447#true} is VALID [2018-11-23 13:11:47,205 INFO L273 TraceCheckUtils]: 41: Hoare triple {15447#true} assume !(0 == ~cond); {15447#true} is VALID [2018-11-23 13:11:47,205 INFO L273 TraceCheckUtils]: 42: Hoare triple {15447#true} assume true; {15447#true} is VALID [2018-11-23 13:11:47,206 INFO L268 TraceCheckUtils]: 43: Hoare quadruple {15447#true} {15452#(<= 3 main_~k~0)} #70#return; {15452#(<= 3 main_~k~0)} is VALID [2018-11-23 13:11:47,207 INFO L273 TraceCheckUtils]: 44: Hoare triple {15452#(<= 3 main_~k~0)} #t~post7 := ~j1~0;~j1~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~k~0;~k~0 := #t~post8 - 1;havoc #t~post8; {15451#(<= 2 main_~k~0)} is VALID [2018-11-23 13:11:47,208 INFO L273 TraceCheckUtils]: 45: Hoare triple {15451#(<= 2 main_~k~0)} assume !!(~j1~0 < ~n0~0 + ~n1~0); {15451#(<= 2 main_~k~0)} is VALID [2018-11-23 13:11:47,208 INFO L256 TraceCheckUtils]: 46: Hoare triple {15451#(<= 2 main_~k~0)} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {15447#true} is VALID [2018-11-23 13:11:47,208 INFO L273 TraceCheckUtils]: 47: Hoare triple {15447#true} ~cond := #in~cond; {15447#true} is VALID [2018-11-23 13:11:47,208 INFO L273 TraceCheckUtils]: 48: Hoare triple {15447#true} assume !(0 == ~cond); {15447#true} is VALID [2018-11-23 13:11:47,208 INFO L273 TraceCheckUtils]: 49: Hoare triple {15447#true} assume true; {15447#true} is VALID [2018-11-23 13:11:47,209 INFO L268 TraceCheckUtils]: 50: Hoare quadruple {15447#true} {15451#(<= 2 main_~k~0)} #70#return; {15451#(<= 2 main_~k~0)} is VALID [2018-11-23 13:11:47,210 INFO L273 TraceCheckUtils]: 51: Hoare triple {15451#(<= 2 main_~k~0)} #t~post7 := ~j1~0;~j1~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~k~0;~k~0 := #t~post8 - 1;havoc #t~post8; {15450#(<= 1 main_~k~0)} is VALID [2018-11-23 13:11:47,211 INFO L273 TraceCheckUtils]: 52: Hoare triple {15450#(<= 1 main_~k~0)} assume !!(~j1~0 < ~n0~0 + ~n1~0); {15450#(<= 1 main_~k~0)} is VALID [2018-11-23 13:11:47,212 INFO L256 TraceCheckUtils]: 53: Hoare triple {15450#(<= 1 main_~k~0)} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {15457#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2018-11-23 13:11:47,213 INFO L273 TraceCheckUtils]: 54: Hoare triple {15457#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {15458#(not (= __VERIFIER_assert_~cond 0))} is VALID [2018-11-23 13:11:47,213 INFO L273 TraceCheckUtils]: 55: Hoare triple {15458#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {15448#false} is VALID [2018-11-23 13:11:47,213 INFO L273 TraceCheckUtils]: 56: Hoare triple {15448#false} assume !false; {15448#false} is VALID [2018-11-23 13:11:47,216 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 30 proven. 53 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-11-23 13:11:47,217 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:11:47,217 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:11:47,226 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 13:11:47,246 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 13:11:47,246 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:11:47,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:11:47,256 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:11:47,376 INFO L256 TraceCheckUtils]: 0: Hoare triple {15447#true} call ULTIMATE.init(); {15447#true} is VALID [2018-11-23 13:11:47,376 INFO L273 TraceCheckUtils]: 1: Hoare triple {15447#true} assume true; {15447#true} is VALID [2018-11-23 13:11:47,376 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {15447#true} {15447#true} #66#return; {15447#true} is VALID [2018-11-23 13:11:47,376 INFO L256 TraceCheckUtils]: 3: Hoare triple {15447#true} call #t~ret9 := main(); {15447#true} is VALID [2018-11-23 13:11:47,377 INFO L273 TraceCheckUtils]: 4: Hoare triple {15447#true} havoc ~n0~0;havoc ~n1~0;~i0~0 := 0;~k~0 := 0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n0~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~n1~0 := #t~nondet2;havoc #t~nondet2; {15449#(<= 0 main_~k~0)} is VALID [2018-11-23 13:11:47,378 INFO L273 TraceCheckUtils]: 5: Hoare triple {15449#(<= 0 main_~k~0)} assume !!(-1000000 <= ~n0~0 && ~n0~0 < 1000000); {15449#(<= 0 main_~k~0)} is VALID [2018-11-23 13:11:47,378 INFO L273 TraceCheckUtils]: 6: Hoare triple {15449#(<= 0 main_~k~0)} assume !!(-1000000 <= ~n1~0 && ~n1~0 < 1000000); {15449#(<= 0 main_~k~0)} is VALID [2018-11-23 13:11:47,378 INFO L273 TraceCheckUtils]: 7: Hoare triple {15449#(<= 0 main_~k~0)} assume !(~i0~0 < ~n0~0); {15449#(<= 0 main_~k~0)} is VALID [2018-11-23 13:11:47,378 INFO L273 TraceCheckUtils]: 8: Hoare triple {15449#(<= 0 main_~k~0)} ~i1~0 := 0; {15449#(<= 0 main_~k~0)} is VALID [2018-11-23 13:11:47,379 INFO L273 TraceCheckUtils]: 9: Hoare triple {15449#(<= 0 main_~k~0)} assume !!(~i1~0 < ~n1~0);#t~post5 := ~i1~0;~i1~0 := 1 + #t~post5;havoc #t~post5;#t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {15450#(<= 1 main_~k~0)} is VALID [2018-11-23 13:11:47,379 INFO L273 TraceCheckUtils]: 10: Hoare triple {15450#(<= 1 main_~k~0)} assume !!(~i1~0 < ~n1~0);#t~post5 := ~i1~0;~i1~0 := 1 + #t~post5;havoc #t~post5;#t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {15451#(<= 2 main_~k~0)} is VALID [2018-11-23 13:11:47,380 INFO L273 TraceCheckUtils]: 11: Hoare triple {15451#(<= 2 main_~k~0)} assume !!(~i1~0 < ~n1~0);#t~post5 := ~i1~0;~i1~0 := 1 + #t~post5;havoc #t~post5;#t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {15452#(<= 3 main_~k~0)} is VALID [2018-11-23 13:11:47,388 INFO L273 TraceCheckUtils]: 12: Hoare triple {15452#(<= 3 main_~k~0)} assume !!(~i1~0 < ~n1~0);#t~post5 := ~i1~0;~i1~0 := 1 + #t~post5;havoc #t~post5;#t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {15453#(<= 4 main_~k~0)} is VALID [2018-11-23 13:11:47,388 INFO L273 TraceCheckUtils]: 13: Hoare triple {15453#(<= 4 main_~k~0)} assume !!(~i1~0 < ~n1~0);#t~post5 := ~i1~0;~i1~0 := 1 + #t~post5;havoc #t~post5;#t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {15454#(<= 5 main_~k~0)} is VALID [2018-11-23 13:11:47,389 INFO L273 TraceCheckUtils]: 14: Hoare triple {15454#(<= 5 main_~k~0)} assume !!(~i1~0 < ~n1~0);#t~post5 := ~i1~0;~i1~0 := 1 + #t~post5;havoc #t~post5;#t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {15455#(<= 6 main_~k~0)} is VALID [2018-11-23 13:11:47,389 INFO L273 TraceCheckUtils]: 15: Hoare triple {15455#(<= 6 main_~k~0)} assume !(~i1~0 < ~n1~0); {15455#(<= 6 main_~k~0)} is VALID [2018-11-23 13:11:47,389 INFO L273 TraceCheckUtils]: 16: Hoare triple {15455#(<= 6 main_~k~0)} ~j1~0 := 0; {15455#(<= 6 main_~k~0)} is VALID [2018-11-23 13:11:47,390 INFO L273 TraceCheckUtils]: 17: Hoare triple {15455#(<= 6 main_~k~0)} assume !!(~j1~0 < ~n0~0 + ~n1~0); {15455#(<= 6 main_~k~0)} is VALID [2018-11-23 13:11:47,390 INFO L256 TraceCheckUtils]: 18: Hoare triple {15455#(<= 6 main_~k~0)} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {15447#true} is VALID [2018-11-23 13:11:47,390 INFO L273 TraceCheckUtils]: 19: Hoare triple {15447#true} ~cond := #in~cond; {15447#true} is VALID [2018-11-23 13:11:47,390 INFO L273 TraceCheckUtils]: 20: Hoare triple {15447#true} assume !(0 == ~cond); {15447#true} is VALID [2018-11-23 13:11:47,390 INFO L273 TraceCheckUtils]: 21: Hoare triple {15447#true} assume true; {15447#true} is VALID [2018-11-23 13:11:47,391 INFO L268 TraceCheckUtils]: 22: Hoare quadruple {15447#true} {15455#(<= 6 main_~k~0)} #70#return; {15455#(<= 6 main_~k~0)} is VALID [2018-11-23 13:11:47,391 INFO L273 TraceCheckUtils]: 23: Hoare triple {15455#(<= 6 main_~k~0)} #t~post7 := ~j1~0;~j1~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~k~0;~k~0 := #t~post8 - 1;havoc #t~post8; {15454#(<= 5 main_~k~0)} is VALID [2018-11-23 13:11:47,392 INFO L273 TraceCheckUtils]: 24: Hoare triple {15454#(<= 5 main_~k~0)} assume !!(~j1~0 < ~n0~0 + ~n1~0); {15454#(<= 5 main_~k~0)} is VALID [2018-11-23 13:11:47,392 INFO L256 TraceCheckUtils]: 25: Hoare triple {15454#(<= 5 main_~k~0)} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {15447#true} is VALID [2018-11-23 13:11:47,392 INFO L273 TraceCheckUtils]: 26: Hoare triple {15447#true} ~cond := #in~cond; {15447#true} is VALID [2018-11-23 13:11:47,393 INFO L273 TraceCheckUtils]: 27: Hoare triple {15447#true} assume !(0 == ~cond); {15447#true} is VALID [2018-11-23 13:11:47,393 INFO L273 TraceCheckUtils]: 28: Hoare triple {15447#true} assume true; {15447#true} is VALID [2018-11-23 13:11:47,393 INFO L268 TraceCheckUtils]: 29: Hoare quadruple {15447#true} {15454#(<= 5 main_~k~0)} #70#return; {15454#(<= 5 main_~k~0)} is VALID [2018-11-23 13:11:47,394 INFO L273 TraceCheckUtils]: 30: Hoare triple {15454#(<= 5 main_~k~0)} #t~post7 := ~j1~0;~j1~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~k~0;~k~0 := #t~post8 - 1;havoc #t~post8; {15453#(<= 4 main_~k~0)} is VALID [2018-11-23 13:11:47,395 INFO L273 TraceCheckUtils]: 31: Hoare triple {15453#(<= 4 main_~k~0)} assume !!(~j1~0 < ~n0~0 + ~n1~0); {15453#(<= 4 main_~k~0)} is VALID [2018-11-23 13:11:47,395 INFO L256 TraceCheckUtils]: 32: Hoare triple {15453#(<= 4 main_~k~0)} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {15447#true} is VALID [2018-11-23 13:11:47,395 INFO L273 TraceCheckUtils]: 33: Hoare triple {15447#true} ~cond := #in~cond; {15447#true} is VALID [2018-11-23 13:11:47,395 INFO L273 TraceCheckUtils]: 34: Hoare triple {15447#true} assume !(0 == ~cond); {15447#true} is VALID [2018-11-23 13:11:47,395 INFO L273 TraceCheckUtils]: 35: Hoare triple {15447#true} assume true; {15447#true} is VALID [2018-11-23 13:11:47,396 INFO L268 TraceCheckUtils]: 36: Hoare quadruple {15447#true} {15453#(<= 4 main_~k~0)} #70#return; {15453#(<= 4 main_~k~0)} is VALID [2018-11-23 13:11:47,397 INFO L273 TraceCheckUtils]: 37: Hoare triple {15453#(<= 4 main_~k~0)} #t~post7 := ~j1~0;~j1~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~k~0;~k~0 := #t~post8 - 1;havoc #t~post8; {15452#(<= 3 main_~k~0)} is VALID [2018-11-23 13:11:47,397 INFO L273 TraceCheckUtils]: 38: Hoare triple {15452#(<= 3 main_~k~0)} assume !!(~j1~0 < ~n0~0 + ~n1~0); {15452#(<= 3 main_~k~0)} is VALID [2018-11-23 13:11:47,398 INFO L256 TraceCheckUtils]: 39: Hoare triple {15452#(<= 3 main_~k~0)} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {15447#true} is VALID [2018-11-23 13:11:47,398 INFO L273 TraceCheckUtils]: 40: Hoare triple {15447#true} ~cond := #in~cond; {15447#true} is VALID [2018-11-23 13:11:47,398 INFO L273 TraceCheckUtils]: 41: Hoare triple {15447#true} assume !(0 == ~cond); {15447#true} is VALID [2018-11-23 13:11:47,398 INFO L273 TraceCheckUtils]: 42: Hoare triple {15447#true} assume true; {15447#true} is VALID [2018-11-23 13:11:47,399 INFO L268 TraceCheckUtils]: 43: Hoare quadruple {15447#true} {15452#(<= 3 main_~k~0)} #70#return; {15452#(<= 3 main_~k~0)} is VALID [2018-11-23 13:11:47,400 INFO L273 TraceCheckUtils]: 44: Hoare triple {15452#(<= 3 main_~k~0)} #t~post7 := ~j1~0;~j1~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~k~0;~k~0 := #t~post8 - 1;havoc #t~post8; {15451#(<= 2 main_~k~0)} is VALID [2018-11-23 13:11:47,400 INFO L273 TraceCheckUtils]: 45: Hoare triple {15451#(<= 2 main_~k~0)} assume !!(~j1~0 < ~n0~0 + ~n1~0); {15451#(<= 2 main_~k~0)} is VALID [2018-11-23 13:11:47,400 INFO L256 TraceCheckUtils]: 46: Hoare triple {15451#(<= 2 main_~k~0)} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {15447#true} is VALID [2018-11-23 13:11:47,400 INFO L273 TraceCheckUtils]: 47: Hoare triple {15447#true} ~cond := #in~cond; {15447#true} is VALID [2018-11-23 13:11:47,401 INFO L273 TraceCheckUtils]: 48: Hoare triple {15447#true} assume !(0 == ~cond); {15447#true} is VALID [2018-11-23 13:11:47,401 INFO L273 TraceCheckUtils]: 49: Hoare triple {15447#true} assume true; {15447#true} is VALID [2018-11-23 13:11:47,402 INFO L268 TraceCheckUtils]: 50: Hoare quadruple {15447#true} {15451#(<= 2 main_~k~0)} #70#return; {15451#(<= 2 main_~k~0)} is VALID [2018-11-23 13:11:47,402 INFO L273 TraceCheckUtils]: 51: Hoare triple {15451#(<= 2 main_~k~0)} #t~post7 := ~j1~0;~j1~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~k~0;~k~0 := #t~post8 - 1;havoc #t~post8; {15450#(<= 1 main_~k~0)} is VALID [2018-11-23 13:11:47,403 INFO L273 TraceCheckUtils]: 52: Hoare triple {15450#(<= 1 main_~k~0)} assume !!(~j1~0 < ~n0~0 + ~n1~0); {15450#(<= 1 main_~k~0)} is VALID [2018-11-23 13:11:47,404 INFO L256 TraceCheckUtils]: 53: Hoare triple {15450#(<= 1 main_~k~0)} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {15621#(= |__VERIFIER_assert_#in~cond| 1)} is VALID [2018-11-23 13:11:47,405 INFO L273 TraceCheckUtils]: 54: Hoare triple {15621#(= |__VERIFIER_assert_#in~cond| 1)} ~cond := #in~cond; {15625#(= 1 __VERIFIER_assert_~cond)} is VALID [2018-11-23 13:11:47,405 INFO L273 TraceCheckUtils]: 55: Hoare triple {15625#(= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {15448#false} is VALID [2018-11-23 13:11:47,405 INFO L273 TraceCheckUtils]: 56: Hoare triple {15448#false} assume !false; {15448#false} is VALID [2018-11-23 13:11:47,408 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 31 proven. 40 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-11-23 13:11:47,428 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:11:47,428 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 14 [2018-11-23 13:11:47,428 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 57 [2018-11-23 13:11:47,428 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:11:47,429 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states. [2018-11-23 13:11:47,486 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-23 13:11:47,486 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-23 13:11:47,486 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-23 13:11:47,487 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2018-11-23 13:11:47,487 INFO L87 Difference]: Start difference. First operand 72 states and 80 transitions. Second operand 14 states. [2018-11-23 13:11:48,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:11:48,259 INFO L93 Difference]: Finished difference Result 81 states and 89 transitions. [2018-11-23 13:11:48,262 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-23 13:11:48,262 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 57 [2018-11-23 13:11:48,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:11:48,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-23 13:11:48,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 74 transitions. [2018-11-23 13:11:48,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-23 13:11:48,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 74 transitions. [2018-11-23 13:11:48,264 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states and 74 transitions. [2018-11-23 13:11:48,335 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-23 13:11:48,336 INFO L225 Difference]: With dead ends: 81 [2018-11-23 13:11:48,337 INFO L226 Difference]: Without dead ends: 79 [2018-11-23 13:11:48,337 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=61, Invalid=179, Unknown=0, NotChecked=0, Total=240 [2018-11-23 13:11:48,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2018-11-23 13:11:48,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2018-11-23 13:11:48,542 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:11:48,543 INFO L82 GeneralOperation]: Start isEquivalent. First operand 79 states. Second operand 79 states. [2018-11-23 13:11:48,543 INFO L74 IsIncluded]: Start isIncluded. First operand 79 states. Second operand 79 states. [2018-11-23 13:11:48,543 INFO L87 Difference]: Start difference. First operand 79 states. Second operand 79 states. [2018-11-23 13:11:48,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:11:48,544 INFO L93 Difference]: Finished difference Result 79 states and 87 transitions. [2018-11-23 13:11:48,544 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 87 transitions. [2018-11-23 13:11:48,544 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:11:48,545 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:11:48,545 INFO L74 IsIncluded]: Start isIncluded. First operand 79 states. Second operand 79 states. [2018-11-23 13:11:48,545 INFO L87 Difference]: Start difference. First operand 79 states. Second operand 79 states. [2018-11-23 13:11:48,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:11:48,546 INFO L93 Difference]: Finished difference Result 79 states and 87 transitions. [2018-11-23 13:11:48,546 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 87 transitions. [2018-11-23 13:11:48,546 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:11:48,546 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:11:48,546 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:11:48,546 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:11:48,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-11-23 13:11:48,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 87 transitions. [2018-11-23 13:11:48,547 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 87 transitions. Word has length 57 [2018-11-23 13:11:48,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:11:48,548 INFO L480 AbstractCegarLoop]: Abstraction has 79 states and 87 transitions. [2018-11-23 13:11:48,548 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-23 13:11:48,548 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 87 transitions. [2018-11-23 13:11:48,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-11-23 13:11:48,548 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:11:48,548 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:11:48,548 INFO L423 AbstractCegarLoop]: === Iteration 28 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:11:48,549 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:11:48,549 INFO L82 PathProgramCache]: Analyzing trace with hash -159345489, now seen corresponding path program 11 times [2018-11-23 13:11:48,549 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:11:48,549 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:11:48,549 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:11:48,550 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:11:48,550 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:11:48,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:11:49,691 INFO L256 TraceCheckUtils]: 0: Hoare triple {16031#true} call ULTIMATE.init(); {16031#true} is VALID [2018-11-23 13:11:49,691 INFO L273 TraceCheckUtils]: 1: Hoare triple {16031#true} assume true; {16031#true} is VALID [2018-11-23 13:11:49,691 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {16031#true} {16031#true} #66#return; {16031#true} is VALID [2018-11-23 13:11:49,691 INFO L256 TraceCheckUtils]: 3: Hoare triple {16031#true} call #t~ret9 := main(); {16031#true} is VALID [2018-11-23 13:11:49,692 INFO L273 TraceCheckUtils]: 4: Hoare triple {16031#true} havoc ~n0~0;havoc ~n1~0;~i0~0 := 0;~k~0 := 0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n0~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~n1~0 := #t~nondet2;havoc #t~nondet2; {16033#(<= main_~i0~0 0)} is VALID [2018-11-23 13:11:49,693 INFO L273 TraceCheckUtils]: 5: Hoare triple {16033#(<= main_~i0~0 0)} assume !!(-1000000 <= ~n0~0 && ~n0~0 < 1000000); {16033#(<= main_~i0~0 0)} is VALID [2018-11-23 13:11:49,693 INFO L273 TraceCheckUtils]: 6: Hoare triple {16033#(<= main_~i0~0 0)} assume !!(-1000000 <= ~n1~0 && ~n1~0 < 1000000); {16033#(<= main_~i0~0 0)} is VALID [2018-11-23 13:11:49,694 INFO L273 TraceCheckUtils]: 7: Hoare triple {16033#(<= main_~i0~0 0)} assume !(~i0~0 < ~n0~0); {16034#(<= main_~n0~0 0)} is VALID [2018-11-23 13:11:49,694 INFO L273 TraceCheckUtils]: 8: Hoare triple {16034#(<= main_~n0~0 0)} ~i1~0 := 0; {16035#(<= (+ main_~i1~0 main_~n0~0) 0)} is VALID [2018-11-23 13:11:49,695 INFO L273 TraceCheckUtils]: 9: Hoare triple {16035#(<= (+ main_~i1~0 main_~n0~0) 0)} assume !!(~i1~0 < ~n1~0);#t~post5 := ~i1~0;~i1~0 := 1 + #t~post5;havoc #t~post5;#t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {16036#(<= (+ main_~i1~0 main_~n0~0) 1)} is VALID [2018-11-23 13:11:49,695 INFO L273 TraceCheckUtils]: 10: Hoare triple {16036#(<= (+ main_~i1~0 main_~n0~0) 1)} assume !!(~i1~0 < ~n1~0);#t~post5 := ~i1~0;~i1~0 := 1 + #t~post5;havoc #t~post5;#t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {16037#(<= (+ main_~i1~0 main_~n0~0) 2)} is VALID [2018-11-23 13:11:49,696 INFO L273 TraceCheckUtils]: 11: Hoare triple {16037#(<= (+ main_~i1~0 main_~n0~0) 2)} assume !!(~i1~0 < ~n1~0);#t~post5 := ~i1~0;~i1~0 := 1 + #t~post5;havoc #t~post5;#t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {16038#(<= (+ main_~i1~0 main_~n0~0) 3)} is VALID [2018-11-23 13:11:49,696 INFO L273 TraceCheckUtils]: 12: Hoare triple {16038#(<= (+ main_~i1~0 main_~n0~0) 3)} assume !!(~i1~0 < ~n1~0);#t~post5 := ~i1~0;~i1~0 := 1 + #t~post5;havoc #t~post5;#t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {16039#(<= (+ main_~i1~0 main_~n0~0) 4)} is VALID [2018-11-23 13:11:49,697 INFO L273 TraceCheckUtils]: 13: Hoare triple {16039#(<= (+ main_~i1~0 main_~n0~0) 4)} assume !!(~i1~0 < ~n1~0);#t~post5 := ~i1~0;~i1~0 := 1 + #t~post5;havoc #t~post5;#t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {16040#(<= (+ main_~i1~0 main_~n0~0) 5)} is VALID [2018-11-23 13:11:49,698 INFO L273 TraceCheckUtils]: 14: Hoare triple {16040#(<= (+ main_~i1~0 main_~n0~0) 5)} assume !!(~i1~0 < ~n1~0);#t~post5 := ~i1~0;~i1~0 := 1 + #t~post5;havoc #t~post5;#t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {16041#(<= (+ main_~i1~0 main_~n0~0) 6)} is VALID [2018-11-23 13:11:49,699 INFO L273 TraceCheckUtils]: 15: Hoare triple {16041#(<= (+ main_~i1~0 main_~n0~0) 6)} assume !(~i1~0 < ~n1~0); {16042#(<= (+ main_~n0~0 main_~n1~0) 6)} is VALID [2018-11-23 13:11:49,700 INFO L273 TraceCheckUtils]: 16: Hoare triple {16042#(<= (+ main_~n0~0 main_~n1~0) 6)} ~j1~0 := 0; {16043#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 6))} is VALID [2018-11-23 13:11:49,700 INFO L273 TraceCheckUtils]: 17: Hoare triple {16043#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 6))} assume !!(~j1~0 < ~n0~0 + ~n1~0); {16043#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 6))} is VALID [2018-11-23 13:11:49,701 INFO L256 TraceCheckUtils]: 18: Hoare triple {16043#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 6))} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {16031#true} is VALID [2018-11-23 13:11:49,701 INFO L273 TraceCheckUtils]: 19: Hoare triple {16031#true} ~cond := #in~cond; {16031#true} is VALID [2018-11-23 13:11:49,701 INFO L273 TraceCheckUtils]: 20: Hoare triple {16031#true} assume !(0 == ~cond); {16031#true} is VALID [2018-11-23 13:11:49,701 INFO L273 TraceCheckUtils]: 21: Hoare triple {16031#true} assume true; {16031#true} is VALID [2018-11-23 13:11:49,702 INFO L268 TraceCheckUtils]: 22: Hoare quadruple {16031#true} {16043#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 6))} #70#return; {16043#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 6))} is VALID [2018-11-23 13:11:49,703 INFO L273 TraceCheckUtils]: 23: Hoare triple {16043#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 6))} #t~post7 := ~j1~0;~j1~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~k~0;~k~0 := #t~post8 - 1;havoc #t~post8; {16044#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 5))} is VALID [2018-11-23 13:11:49,703 INFO L273 TraceCheckUtils]: 24: Hoare triple {16044#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 5))} assume !!(~j1~0 < ~n0~0 + ~n1~0); {16044#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 5))} is VALID [2018-11-23 13:11:49,703 INFO L256 TraceCheckUtils]: 25: Hoare triple {16044#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 5))} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {16031#true} is VALID [2018-11-23 13:11:49,704 INFO L273 TraceCheckUtils]: 26: Hoare triple {16031#true} ~cond := #in~cond; {16031#true} is VALID [2018-11-23 13:11:49,704 INFO L273 TraceCheckUtils]: 27: Hoare triple {16031#true} assume !(0 == ~cond); {16031#true} is VALID [2018-11-23 13:11:49,704 INFO L273 TraceCheckUtils]: 28: Hoare triple {16031#true} assume true; {16031#true} is VALID [2018-11-23 13:11:49,704 INFO L268 TraceCheckUtils]: 29: Hoare quadruple {16031#true} {16044#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 5))} #70#return; {16044#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 5))} is VALID [2018-11-23 13:11:49,705 INFO L273 TraceCheckUtils]: 30: Hoare triple {16044#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 5))} #t~post7 := ~j1~0;~j1~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~k~0;~k~0 := #t~post8 - 1;havoc #t~post8; {16045#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 4))} is VALID [2018-11-23 13:11:49,706 INFO L273 TraceCheckUtils]: 31: Hoare triple {16045#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 4))} assume !!(~j1~0 < ~n0~0 + ~n1~0); {16045#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 4))} is VALID [2018-11-23 13:11:49,706 INFO L256 TraceCheckUtils]: 32: Hoare triple {16045#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 4))} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {16031#true} is VALID [2018-11-23 13:11:49,706 INFO L273 TraceCheckUtils]: 33: Hoare triple {16031#true} ~cond := #in~cond; {16031#true} is VALID [2018-11-23 13:11:49,706 INFO L273 TraceCheckUtils]: 34: Hoare triple {16031#true} assume !(0 == ~cond); {16031#true} is VALID [2018-11-23 13:11:49,706 INFO L273 TraceCheckUtils]: 35: Hoare triple {16031#true} assume true; {16031#true} is VALID [2018-11-23 13:11:49,707 INFO L268 TraceCheckUtils]: 36: Hoare quadruple {16031#true} {16045#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 4))} #70#return; {16045#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 4))} is VALID [2018-11-23 13:11:49,708 INFO L273 TraceCheckUtils]: 37: Hoare triple {16045#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 4))} #t~post7 := ~j1~0;~j1~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~k~0;~k~0 := #t~post8 - 1;havoc #t~post8; {16046#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 3))} is VALID [2018-11-23 13:11:49,709 INFO L273 TraceCheckUtils]: 38: Hoare triple {16046#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 3))} assume !!(~j1~0 < ~n0~0 + ~n1~0); {16046#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 3))} is VALID [2018-11-23 13:11:49,709 INFO L256 TraceCheckUtils]: 39: Hoare triple {16046#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 3))} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {16031#true} is VALID [2018-11-23 13:11:49,709 INFO L273 TraceCheckUtils]: 40: Hoare triple {16031#true} ~cond := #in~cond; {16031#true} is VALID [2018-11-23 13:11:49,709 INFO L273 TraceCheckUtils]: 41: Hoare triple {16031#true} assume !(0 == ~cond); {16031#true} is VALID [2018-11-23 13:11:49,710 INFO L273 TraceCheckUtils]: 42: Hoare triple {16031#true} assume true; {16031#true} is VALID [2018-11-23 13:11:49,710 INFO L268 TraceCheckUtils]: 43: Hoare quadruple {16031#true} {16046#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 3))} #70#return; {16046#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 3))} is VALID [2018-11-23 13:11:49,711 INFO L273 TraceCheckUtils]: 44: Hoare triple {16046#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 3))} #t~post7 := ~j1~0;~j1~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~k~0;~k~0 := #t~post8 - 1;havoc #t~post8; {16047#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 2))} is VALID [2018-11-23 13:11:49,712 INFO L273 TraceCheckUtils]: 45: Hoare triple {16047#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 2))} assume !!(~j1~0 < ~n0~0 + ~n1~0); {16047#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 2))} is VALID [2018-11-23 13:11:49,712 INFO L256 TraceCheckUtils]: 46: Hoare triple {16047#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 2))} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {16031#true} is VALID [2018-11-23 13:11:49,712 INFO L273 TraceCheckUtils]: 47: Hoare triple {16031#true} ~cond := #in~cond; {16031#true} is VALID [2018-11-23 13:11:49,713 INFO L273 TraceCheckUtils]: 48: Hoare triple {16031#true} assume !(0 == ~cond); {16031#true} is VALID [2018-11-23 13:11:49,713 INFO L273 TraceCheckUtils]: 49: Hoare triple {16031#true} assume true; {16031#true} is VALID [2018-11-23 13:11:49,714 INFO L268 TraceCheckUtils]: 50: Hoare quadruple {16031#true} {16047#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 2))} #70#return; {16047#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 2))} is VALID [2018-11-23 13:11:49,715 INFO L273 TraceCheckUtils]: 51: Hoare triple {16047#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 2))} #t~post7 := ~j1~0;~j1~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~k~0;~k~0 := #t~post8 - 1;havoc #t~post8; {16048#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 1))} is VALID [2018-11-23 13:11:49,715 INFO L273 TraceCheckUtils]: 52: Hoare triple {16048#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 1))} assume !!(~j1~0 < ~n0~0 + ~n1~0); {16048#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 1))} is VALID [2018-11-23 13:11:49,715 INFO L256 TraceCheckUtils]: 53: Hoare triple {16048#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 1))} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {16031#true} is VALID [2018-11-23 13:11:49,716 INFO L273 TraceCheckUtils]: 54: Hoare triple {16031#true} ~cond := #in~cond; {16031#true} is VALID [2018-11-23 13:11:49,716 INFO L273 TraceCheckUtils]: 55: Hoare triple {16031#true} assume !(0 == ~cond); {16031#true} is VALID [2018-11-23 13:11:49,716 INFO L273 TraceCheckUtils]: 56: Hoare triple {16031#true} assume true; {16031#true} is VALID [2018-11-23 13:11:49,717 INFO L268 TraceCheckUtils]: 57: Hoare quadruple {16031#true} {16048#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 1))} #70#return; {16048#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 1))} is VALID [2018-11-23 13:11:49,718 INFO L273 TraceCheckUtils]: 58: Hoare triple {16048#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 1))} #t~post7 := ~j1~0;~j1~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~k~0;~k~0 := #t~post8 - 1;havoc #t~post8; {16049#(<= (+ main_~n0~0 main_~n1~0) main_~j1~0)} is VALID [2018-11-23 13:11:49,718 INFO L273 TraceCheckUtils]: 59: Hoare triple {16049#(<= (+ main_~n0~0 main_~n1~0) main_~j1~0)} assume !!(~j1~0 < ~n0~0 + ~n1~0); {16032#false} is VALID [2018-11-23 13:11:49,719 INFO L256 TraceCheckUtils]: 60: Hoare triple {16032#false} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {16032#false} is VALID [2018-11-23 13:11:49,719 INFO L273 TraceCheckUtils]: 61: Hoare triple {16032#false} ~cond := #in~cond; {16032#false} is VALID [2018-11-23 13:11:49,719 INFO L273 TraceCheckUtils]: 62: Hoare triple {16032#false} assume 0 == ~cond; {16032#false} is VALID [2018-11-23 13:11:49,719 INFO L273 TraceCheckUtils]: 63: Hoare triple {16032#false} assume !false; {16032#false} is VALID [2018-11-23 13:11:49,724 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 69 proven. 21 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2018-11-23 13:11:49,724 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:11:49,724 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:11:49,734 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 13:11:49,762 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2018-11-23 13:11:49,762 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:11:49,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:11:49,782 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:11:50,470 INFO L256 TraceCheckUtils]: 0: Hoare triple {16031#true} call ULTIMATE.init(); {16031#true} is VALID [2018-11-23 13:11:50,470 INFO L273 TraceCheckUtils]: 1: Hoare triple {16031#true} assume true; {16031#true} is VALID [2018-11-23 13:11:50,470 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {16031#true} {16031#true} #66#return; {16031#true} is VALID [2018-11-23 13:11:50,471 INFO L256 TraceCheckUtils]: 3: Hoare triple {16031#true} call #t~ret9 := main(); {16031#true} is VALID [2018-11-23 13:11:50,471 INFO L273 TraceCheckUtils]: 4: Hoare triple {16031#true} havoc ~n0~0;havoc ~n1~0;~i0~0 := 0;~k~0 := 0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n0~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~n1~0 := #t~nondet2;havoc #t~nondet2; {16033#(<= main_~i0~0 0)} is VALID [2018-11-23 13:11:50,472 INFO L273 TraceCheckUtils]: 5: Hoare triple {16033#(<= main_~i0~0 0)} assume !!(-1000000 <= ~n0~0 && ~n0~0 < 1000000); {16033#(<= main_~i0~0 0)} is VALID [2018-11-23 13:11:50,472 INFO L273 TraceCheckUtils]: 6: Hoare triple {16033#(<= main_~i0~0 0)} assume !!(-1000000 <= ~n1~0 && ~n1~0 < 1000000); {16033#(<= main_~i0~0 0)} is VALID [2018-11-23 13:11:50,472 INFO L273 TraceCheckUtils]: 7: Hoare triple {16033#(<= main_~i0~0 0)} assume !(~i0~0 < ~n0~0); {16034#(<= main_~n0~0 0)} is VALID [2018-11-23 13:11:50,473 INFO L273 TraceCheckUtils]: 8: Hoare triple {16034#(<= main_~n0~0 0)} ~i1~0 := 0; {16077#(and (<= main_~i1~0 0) (<= main_~n0~0 0))} is VALID [2018-11-23 13:11:50,473 INFO L273 TraceCheckUtils]: 9: Hoare triple {16077#(and (<= main_~i1~0 0) (<= main_~n0~0 0))} assume !!(~i1~0 < ~n1~0);#t~post5 := ~i1~0;~i1~0 := 1 + #t~post5;havoc #t~post5;#t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {16081#(and (<= main_~i1~0 1) (<= main_~n0~0 0))} is VALID [2018-11-23 13:11:50,474 INFO L273 TraceCheckUtils]: 10: Hoare triple {16081#(and (<= main_~i1~0 1) (<= main_~n0~0 0))} assume !!(~i1~0 < ~n1~0);#t~post5 := ~i1~0;~i1~0 := 1 + #t~post5;havoc #t~post5;#t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {16085#(and (<= main_~i1~0 2) (<= main_~n0~0 0))} is VALID [2018-11-23 13:11:50,475 INFO L273 TraceCheckUtils]: 11: Hoare triple {16085#(and (<= main_~i1~0 2) (<= main_~n0~0 0))} assume !!(~i1~0 < ~n1~0);#t~post5 := ~i1~0;~i1~0 := 1 + #t~post5;havoc #t~post5;#t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {16089#(and (<= main_~n0~0 0) (<= main_~i1~0 3))} is VALID [2018-11-23 13:11:50,476 INFO L273 TraceCheckUtils]: 12: Hoare triple {16089#(and (<= main_~n0~0 0) (<= main_~i1~0 3))} assume !!(~i1~0 < ~n1~0);#t~post5 := ~i1~0;~i1~0 := 1 + #t~post5;havoc #t~post5;#t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {16093#(and (<= main_~i1~0 4) (<= main_~n0~0 0))} is VALID [2018-11-23 13:11:50,477 INFO L273 TraceCheckUtils]: 13: Hoare triple {16093#(and (<= main_~i1~0 4) (<= main_~n0~0 0))} assume !!(~i1~0 < ~n1~0);#t~post5 := ~i1~0;~i1~0 := 1 + #t~post5;havoc #t~post5;#t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {16097#(and (<= main_~i1~0 5) (<= main_~n0~0 0))} is VALID [2018-11-23 13:11:50,478 INFO L273 TraceCheckUtils]: 14: Hoare triple {16097#(and (<= main_~i1~0 5) (<= main_~n0~0 0))} assume !!(~i1~0 < ~n1~0);#t~post5 := ~i1~0;~i1~0 := 1 + #t~post5;havoc #t~post5;#t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {16101#(and (<= main_~n0~0 0) (<= main_~i1~0 6))} is VALID [2018-11-23 13:11:50,478 INFO L273 TraceCheckUtils]: 15: Hoare triple {16101#(and (<= main_~n0~0 0) (<= main_~i1~0 6))} assume !(~i1~0 < ~n1~0); {16105#(and (<= main_~n1~0 6) (<= main_~n0~0 0))} is VALID [2018-11-23 13:11:50,479 INFO L273 TraceCheckUtils]: 16: Hoare triple {16105#(and (<= main_~n1~0 6) (<= main_~n0~0 0))} ~j1~0 := 0; {16109#(and (<= main_~n1~0 6) (<= 0 main_~j1~0) (<= main_~n0~0 0))} is VALID [2018-11-23 13:11:50,480 INFO L273 TraceCheckUtils]: 17: Hoare triple {16109#(and (<= main_~n1~0 6) (<= 0 main_~j1~0) (<= main_~n0~0 0))} assume !!(~j1~0 < ~n0~0 + ~n1~0); {16109#(and (<= main_~n1~0 6) (<= 0 main_~j1~0) (<= main_~n0~0 0))} is VALID [2018-11-23 13:11:50,480 INFO L256 TraceCheckUtils]: 18: Hoare triple {16109#(and (<= main_~n1~0 6) (<= 0 main_~j1~0) (<= main_~n0~0 0))} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {16031#true} is VALID [2018-11-23 13:11:50,480 INFO L273 TraceCheckUtils]: 19: Hoare triple {16031#true} ~cond := #in~cond; {16031#true} is VALID [2018-11-23 13:11:50,480 INFO L273 TraceCheckUtils]: 20: Hoare triple {16031#true} assume !(0 == ~cond); {16031#true} is VALID [2018-11-23 13:11:50,481 INFO L273 TraceCheckUtils]: 21: Hoare triple {16031#true} assume true; {16031#true} is VALID [2018-11-23 13:11:50,481 INFO L268 TraceCheckUtils]: 22: Hoare quadruple {16031#true} {16109#(and (<= main_~n1~0 6) (<= 0 main_~j1~0) (<= main_~n0~0 0))} #70#return; {16109#(and (<= main_~n1~0 6) (<= 0 main_~j1~0) (<= main_~n0~0 0))} is VALID [2018-11-23 13:11:50,482 INFO L273 TraceCheckUtils]: 23: Hoare triple {16109#(and (<= main_~n1~0 6) (<= 0 main_~j1~0) (<= main_~n0~0 0))} #t~post7 := ~j1~0;~j1~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~k~0;~k~0 := #t~post8 - 1;havoc #t~post8; {16131#(and (<= 1 main_~j1~0) (<= main_~n1~0 6) (<= main_~n0~0 0))} is VALID [2018-11-23 13:11:50,483 INFO L273 TraceCheckUtils]: 24: Hoare triple {16131#(and (<= 1 main_~j1~0) (<= main_~n1~0 6) (<= main_~n0~0 0))} assume !!(~j1~0 < ~n0~0 + ~n1~0); {16131#(and (<= 1 main_~j1~0) (<= main_~n1~0 6) (<= main_~n0~0 0))} is VALID [2018-11-23 13:11:50,483 INFO L256 TraceCheckUtils]: 25: Hoare triple {16131#(and (<= 1 main_~j1~0) (<= main_~n1~0 6) (<= main_~n0~0 0))} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {16031#true} is VALID [2018-11-23 13:11:50,483 INFO L273 TraceCheckUtils]: 26: Hoare triple {16031#true} ~cond := #in~cond; {16031#true} is VALID [2018-11-23 13:11:50,483 INFO L273 TraceCheckUtils]: 27: Hoare triple {16031#true} assume !(0 == ~cond); {16031#true} is VALID [2018-11-23 13:11:50,484 INFO L273 TraceCheckUtils]: 28: Hoare triple {16031#true} assume true; {16031#true} is VALID [2018-11-23 13:11:50,484 INFO L268 TraceCheckUtils]: 29: Hoare quadruple {16031#true} {16131#(and (<= 1 main_~j1~0) (<= main_~n1~0 6) (<= main_~n0~0 0))} #70#return; {16131#(and (<= 1 main_~j1~0) (<= main_~n1~0 6) (<= main_~n0~0 0))} is VALID [2018-11-23 13:11:50,485 INFO L273 TraceCheckUtils]: 30: Hoare triple {16131#(and (<= 1 main_~j1~0) (<= main_~n1~0 6) (<= main_~n0~0 0))} #t~post7 := ~j1~0;~j1~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~k~0;~k~0 := #t~post8 - 1;havoc #t~post8; {16153#(and (<= main_~n1~0 6) (<= main_~n0~0 0) (<= 2 main_~j1~0))} is VALID [2018-11-23 13:11:50,486 INFO L273 TraceCheckUtils]: 31: Hoare triple {16153#(and (<= main_~n1~0 6) (<= main_~n0~0 0) (<= 2 main_~j1~0))} assume !!(~j1~0 < ~n0~0 + ~n1~0); {16153#(and (<= main_~n1~0 6) (<= main_~n0~0 0) (<= 2 main_~j1~0))} is VALID [2018-11-23 13:11:50,486 INFO L256 TraceCheckUtils]: 32: Hoare triple {16153#(and (<= main_~n1~0 6) (<= main_~n0~0 0) (<= 2 main_~j1~0))} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {16031#true} is VALID [2018-11-23 13:11:50,486 INFO L273 TraceCheckUtils]: 33: Hoare triple {16031#true} ~cond := #in~cond; {16031#true} is VALID [2018-11-23 13:11:50,487 INFO L273 TraceCheckUtils]: 34: Hoare triple {16031#true} assume !(0 == ~cond); {16031#true} is VALID [2018-11-23 13:11:50,487 INFO L273 TraceCheckUtils]: 35: Hoare triple {16031#true} assume true; {16031#true} is VALID [2018-11-23 13:11:50,487 INFO L268 TraceCheckUtils]: 36: Hoare quadruple {16031#true} {16153#(and (<= main_~n1~0 6) (<= main_~n0~0 0) (<= 2 main_~j1~0))} #70#return; {16153#(and (<= main_~n1~0 6) (<= main_~n0~0 0) (<= 2 main_~j1~0))} is VALID [2018-11-23 13:11:50,488 INFO L273 TraceCheckUtils]: 37: Hoare triple {16153#(and (<= main_~n1~0 6) (<= main_~n0~0 0) (<= 2 main_~j1~0))} #t~post7 := ~j1~0;~j1~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~k~0;~k~0 := #t~post8 - 1;havoc #t~post8; {16175#(and (<= main_~n1~0 6) (<= 3 main_~j1~0) (<= main_~n0~0 0))} is VALID [2018-11-23 13:11:50,489 INFO L273 TraceCheckUtils]: 38: Hoare triple {16175#(and (<= main_~n1~0 6) (<= 3 main_~j1~0) (<= main_~n0~0 0))} assume !!(~j1~0 < ~n0~0 + ~n1~0); {16175#(and (<= main_~n1~0 6) (<= 3 main_~j1~0) (<= main_~n0~0 0))} is VALID [2018-11-23 13:11:50,489 INFO L256 TraceCheckUtils]: 39: Hoare triple {16175#(and (<= main_~n1~0 6) (<= 3 main_~j1~0) (<= main_~n0~0 0))} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {16031#true} is VALID [2018-11-23 13:11:50,489 INFO L273 TraceCheckUtils]: 40: Hoare triple {16031#true} ~cond := #in~cond; {16031#true} is VALID [2018-11-23 13:11:50,490 INFO L273 TraceCheckUtils]: 41: Hoare triple {16031#true} assume !(0 == ~cond); {16031#true} is VALID [2018-11-23 13:11:50,490 INFO L273 TraceCheckUtils]: 42: Hoare triple {16031#true} assume true; {16031#true} is VALID [2018-11-23 13:11:50,491 INFO L268 TraceCheckUtils]: 43: Hoare quadruple {16031#true} {16175#(and (<= main_~n1~0 6) (<= 3 main_~j1~0) (<= main_~n0~0 0))} #70#return; {16175#(and (<= main_~n1~0 6) (<= 3 main_~j1~0) (<= main_~n0~0 0))} is VALID [2018-11-23 13:11:50,491 INFO L273 TraceCheckUtils]: 44: Hoare triple {16175#(and (<= main_~n1~0 6) (<= 3 main_~j1~0) (<= main_~n0~0 0))} #t~post7 := ~j1~0;~j1~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~k~0;~k~0 := #t~post8 - 1;havoc #t~post8; {16197#(and (<= main_~n1~0 6) (<= 4 main_~j1~0) (<= main_~n0~0 0))} is VALID [2018-11-23 13:11:50,492 INFO L273 TraceCheckUtils]: 45: Hoare triple {16197#(and (<= main_~n1~0 6) (<= 4 main_~j1~0) (<= main_~n0~0 0))} assume !!(~j1~0 < ~n0~0 + ~n1~0); {16197#(and (<= main_~n1~0 6) (<= 4 main_~j1~0) (<= main_~n0~0 0))} is VALID [2018-11-23 13:11:50,492 INFO L256 TraceCheckUtils]: 46: Hoare triple {16197#(and (<= main_~n1~0 6) (<= 4 main_~j1~0) (<= main_~n0~0 0))} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {16031#true} is VALID [2018-11-23 13:11:50,492 INFO L273 TraceCheckUtils]: 47: Hoare triple {16031#true} ~cond := #in~cond; {16031#true} is VALID [2018-11-23 13:11:50,493 INFO L273 TraceCheckUtils]: 48: Hoare triple {16031#true} assume !(0 == ~cond); {16031#true} is VALID [2018-11-23 13:11:50,493 INFO L273 TraceCheckUtils]: 49: Hoare triple {16031#true} assume true; {16031#true} is VALID [2018-11-23 13:11:50,494 INFO L268 TraceCheckUtils]: 50: Hoare quadruple {16031#true} {16197#(and (<= main_~n1~0 6) (<= 4 main_~j1~0) (<= main_~n0~0 0))} #70#return; {16197#(and (<= main_~n1~0 6) (<= 4 main_~j1~0) (<= main_~n0~0 0))} is VALID [2018-11-23 13:11:50,494 INFO L273 TraceCheckUtils]: 51: Hoare triple {16197#(and (<= main_~n1~0 6) (<= 4 main_~j1~0) (<= main_~n0~0 0))} #t~post7 := ~j1~0;~j1~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~k~0;~k~0 := #t~post8 - 1;havoc #t~post8; {16219#(and (<= main_~n1~0 6) (<= main_~n0~0 0) (<= 5 main_~j1~0))} is VALID [2018-11-23 13:11:50,495 INFO L273 TraceCheckUtils]: 52: Hoare triple {16219#(and (<= main_~n1~0 6) (<= main_~n0~0 0) (<= 5 main_~j1~0))} assume !!(~j1~0 < ~n0~0 + ~n1~0); {16219#(and (<= main_~n1~0 6) (<= main_~n0~0 0) (<= 5 main_~j1~0))} is VALID [2018-11-23 13:11:50,495 INFO L256 TraceCheckUtils]: 53: Hoare triple {16219#(and (<= main_~n1~0 6) (<= main_~n0~0 0) (<= 5 main_~j1~0))} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {16031#true} is VALID [2018-11-23 13:11:50,496 INFO L273 TraceCheckUtils]: 54: Hoare triple {16031#true} ~cond := #in~cond; {16031#true} is VALID [2018-11-23 13:11:50,496 INFO L273 TraceCheckUtils]: 55: Hoare triple {16031#true} assume !(0 == ~cond); {16031#true} is VALID [2018-11-23 13:11:50,496 INFO L273 TraceCheckUtils]: 56: Hoare triple {16031#true} assume true; {16031#true} is VALID [2018-11-23 13:11:50,497 INFO L268 TraceCheckUtils]: 57: Hoare quadruple {16031#true} {16219#(and (<= main_~n1~0 6) (<= main_~n0~0 0) (<= 5 main_~j1~0))} #70#return; {16219#(and (<= main_~n1~0 6) (<= main_~n0~0 0) (<= 5 main_~j1~0))} is VALID [2018-11-23 13:11:50,497 INFO L273 TraceCheckUtils]: 58: Hoare triple {16219#(and (<= main_~n1~0 6) (<= main_~n0~0 0) (<= 5 main_~j1~0))} #t~post7 := ~j1~0;~j1~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~k~0;~k~0 := #t~post8 - 1;havoc #t~post8; {16241#(and (<= 6 main_~j1~0) (<= main_~n1~0 6) (<= main_~n0~0 0))} is VALID [2018-11-23 13:11:50,498 INFO L273 TraceCheckUtils]: 59: Hoare triple {16241#(and (<= 6 main_~j1~0) (<= main_~n1~0 6) (<= main_~n0~0 0))} assume !!(~j1~0 < ~n0~0 + ~n1~0); {16032#false} is VALID [2018-11-23 13:11:50,498 INFO L256 TraceCheckUtils]: 60: Hoare triple {16032#false} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {16032#false} is VALID [2018-11-23 13:11:50,499 INFO L273 TraceCheckUtils]: 61: Hoare triple {16032#false} ~cond := #in~cond; {16032#false} is VALID [2018-11-23 13:11:50,499 INFO L273 TraceCheckUtils]: 62: Hoare triple {16032#false} assume 0 == ~cond; {16032#false} is VALID [2018-11-23 13:11:50,499 INFO L273 TraceCheckUtils]: 63: Hoare triple {16032#false} assume !false; {16032#false} is VALID [2018-11-23 13:11:50,504 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 69 proven. 21 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2018-11-23 13:11:50,523 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:11:50,523 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 34 [2018-11-23 13:11:50,524 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 64 [2018-11-23 13:11:50,524 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:11:50,524 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 34 states. [2018-11-23 13:11:50,606 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 83 edges. 83 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:11:50,606 INFO L459 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-11-23 13:11:50,606 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-11-23 13:11:50,607 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=235, Invalid=887, Unknown=0, NotChecked=0, Total=1122 [2018-11-23 13:11:50,607 INFO L87 Difference]: Start difference. First operand 79 states and 87 transitions. Second operand 34 states. [2018-11-23 13:11:52,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:11:52,891 INFO L93 Difference]: Finished difference Result 136 states and 159 transitions. [2018-11-23 13:11:52,891 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-11-23 13:11:52,891 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 64 [2018-11-23 13:11:52,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:11:52,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-11-23 13:11:52,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 75 transitions. [2018-11-23 13:11:52,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-11-23 13:11:52,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 75 transitions. [2018-11-23 13:11:52,894 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 19 states and 75 transitions. [2018-11-23 13:11:52,966 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 75 edges. 75 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:11:52,969 INFO L225 Difference]: With dead ends: 136 [2018-11-23 13:11:52,969 INFO L226 Difference]: Without dead ends: 107 [2018-11-23 13:11:52,971 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 653 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=515, Invalid=1935, Unknown=0, NotChecked=0, Total=2450 [2018-11-23 13:11:52,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2018-11-23 13:11:53,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 80. [2018-11-23 13:11:53,332 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:11:53,333 INFO L82 GeneralOperation]: Start isEquivalent. First operand 107 states. Second operand 80 states. [2018-11-23 13:11:53,333 INFO L74 IsIncluded]: Start isIncluded. First operand 107 states. Second operand 80 states. [2018-11-23 13:11:53,333 INFO L87 Difference]: Start difference. First operand 107 states. Second operand 80 states. [2018-11-23 13:11:53,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:11:53,334 INFO L93 Difference]: Finished difference Result 107 states and 123 transitions. [2018-11-23 13:11:53,335 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 123 transitions. [2018-11-23 13:11:53,335 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:11:53,335 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:11:53,335 INFO L74 IsIncluded]: Start isIncluded. First operand 80 states. Second operand 107 states. [2018-11-23 13:11:53,335 INFO L87 Difference]: Start difference. First operand 80 states. Second operand 107 states. [2018-11-23 13:11:53,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:11:53,337 INFO L93 Difference]: Finished difference Result 107 states and 123 transitions. [2018-11-23 13:11:53,337 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 123 transitions. [2018-11-23 13:11:53,337 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:11:53,337 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:11:53,337 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:11:53,338 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:11:53,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2018-11-23 13:11:53,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 88 transitions. [2018-11-23 13:11:53,339 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 88 transitions. Word has length 64 [2018-11-23 13:11:53,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:11:53,339 INFO L480 AbstractCegarLoop]: Abstraction has 80 states and 88 transitions. [2018-11-23 13:11:53,339 INFO L481 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-11-23 13:11:53,340 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 88 transitions. [2018-11-23 13:11:53,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-11-23 13:11:53,340 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:11:53,340 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:11:53,340 INFO L423 AbstractCegarLoop]: === Iteration 29 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:11:53,340 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:11:53,340 INFO L82 PathProgramCache]: Analyzing trace with hash -966019538, now seen corresponding path program 11 times [2018-11-23 13:11:53,341 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:11:53,341 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:11:53,341 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:11:53,341 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:11:53,341 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:11:53,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:11:53,673 INFO L256 TraceCheckUtils]: 0: Hoare triple {16834#true} call ULTIMATE.init(); {16834#true} is VALID [2018-11-23 13:11:53,673 INFO L273 TraceCheckUtils]: 1: Hoare triple {16834#true} assume true; {16834#true} is VALID [2018-11-23 13:11:53,674 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {16834#true} {16834#true} #66#return; {16834#true} is VALID [2018-11-23 13:11:53,674 INFO L256 TraceCheckUtils]: 3: Hoare triple {16834#true} call #t~ret9 := main(); {16834#true} is VALID [2018-11-23 13:11:53,675 INFO L273 TraceCheckUtils]: 4: Hoare triple {16834#true} havoc ~n0~0;havoc ~n1~0;~i0~0 := 0;~k~0 := 0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n0~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~n1~0 := #t~nondet2;havoc #t~nondet2; {16836#(<= main_~i0~0 0)} is VALID [2018-11-23 13:11:53,675 INFO L273 TraceCheckUtils]: 5: Hoare triple {16836#(<= main_~i0~0 0)} assume !!(-1000000 <= ~n0~0 && ~n0~0 < 1000000); {16836#(<= main_~i0~0 0)} is VALID [2018-11-23 13:11:53,676 INFO L273 TraceCheckUtils]: 6: Hoare triple {16836#(<= main_~i0~0 0)} assume !!(-1000000 <= ~n1~0 && ~n1~0 < 1000000); {16836#(<= main_~i0~0 0)} is VALID [2018-11-23 13:11:53,676 INFO L273 TraceCheckUtils]: 7: Hoare triple {16836#(<= main_~i0~0 0)} assume !!(~i0~0 < ~n0~0);#t~post3 := ~i0~0;~i0~0 := 1 + #t~post3;havoc #t~post3;#t~post4 := ~k~0;~k~0 := 1 + #t~post4;havoc #t~post4; {16837#(<= main_~i0~0 1)} is VALID [2018-11-23 13:11:53,677 INFO L273 TraceCheckUtils]: 8: Hoare triple {16837#(<= main_~i0~0 1)} assume !(~i0~0 < ~n0~0); {16838#(<= main_~n0~0 1)} is VALID [2018-11-23 13:11:53,677 INFO L273 TraceCheckUtils]: 9: Hoare triple {16838#(<= main_~n0~0 1)} ~i1~0 := 0; {16839#(<= (+ main_~i1~0 main_~n0~0) 1)} is VALID [2018-11-23 13:11:53,678 INFO L273 TraceCheckUtils]: 10: Hoare triple {16839#(<= (+ main_~i1~0 main_~n0~0) 1)} assume !!(~i1~0 < ~n1~0);#t~post5 := ~i1~0;~i1~0 := 1 + #t~post5;havoc #t~post5;#t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {16840#(<= (+ main_~i1~0 main_~n0~0) 2)} is VALID [2018-11-23 13:11:53,678 INFO L273 TraceCheckUtils]: 11: Hoare triple {16840#(<= (+ main_~i1~0 main_~n0~0) 2)} assume !!(~i1~0 < ~n1~0);#t~post5 := ~i1~0;~i1~0 := 1 + #t~post5;havoc #t~post5;#t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {16841#(<= (+ main_~i1~0 main_~n0~0) 3)} is VALID [2018-11-23 13:11:53,679 INFO L273 TraceCheckUtils]: 12: Hoare triple {16841#(<= (+ main_~i1~0 main_~n0~0) 3)} assume !!(~i1~0 < ~n1~0);#t~post5 := ~i1~0;~i1~0 := 1 + #t~post5;havoc #t~post5;#t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {16842#(<= (+ main_~i1~0 main_~n0~0) 4)} is VALID [2018-11-23 13:11:53,680 INFO L273 TraceCheckUtils]: 13: Hoare triple {16842#(<= (+ main_~i1~0 main_~n0~0) 4)} assume !!(~i1~0 < ~n1~0);#t~post5 := ~i1~0;~i1~0 := 1 + #t~post5;havoc #t~post5;#t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {16843#(<= (+ main_~i1~0 main_~n0~0) 5)} is VALID [2018-11-23 13:11:53,681 INFO L273 TraceCheckUtils]: 14: Hoare triple {16843#(<= (+ main_~i1~0 main_~n0~0) 5)} assume !!(~i1~0 < ~n1~0);#t~post5 := ~i1~0;~i1~0 := 1 + #t~post5;havoc #t~post5;#t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {16844#(<= (+ main_~i1~0 main_~n0~0) 6)} is VALID [2018-11-23 13:11:53,682 INFO L273 TraceCheckUtils]: 15: Hoare triple {16844#(<= (+ main_~i1~0 main_~n0~0) 6)} assume !(~i1~0 < ~n1~0); {16845#(<= (+ main_~n0~0 main_~n1~0) 6)} is VALID [2018-11-23 13:11:53,682 INFO L273 TraceCheckUtils]: 16: Hoare triple {16845#(<= (+ main_~n0~0 main_~n1~0) 6)} ~j1~0 := 0; {16846#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 6))} is VALID [2018-11-23 13:11:53,683 INFO L273 TraceCheckUtils]: 17: Hoare triple {16846#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 6))} assume !!(~j1~0 < ~n0~0 + ~n1~0); {16846#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 6))} is VALID [2018-11-23 13:11:53,683 INFO L256 TraceCheckUtils]: 18: Hoare triple {16846#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 6))} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {16834#true} is VALID [2018-11-23 13:11:53,683 INFO L273 TraceCheckUtils]: 19: Hoare triple {16834#true} ~cond := #in~cond; {16834#true} is VALID [2018-11-23 13:11:53,683 INFO L273 TraceCheckUtils]: 20: Hoare triple {16834#true} assume !(0 == ~cond); {16834#true} is VALID [2018-11-23 13:11:53,684 INFO L273 TraceCheckUtils]: 21: Hoare triple {16834#true} assume true; {16834#true} is VALID [2018-11-23 13:11:53,685 INFO L268 TraceCheckUtils]: 22: Hoare quadruple {16834#true} {16846#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 6))} #70#return; {16846#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 6))} is VALID [2018-11-23 13:11:53,686 INFO L273 TraceCheckUtils]: 23: Hoare triple {16846#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 6))} #t~post7 := ~j1~0;~j1~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~k~0;~k~0 := #t~post8 - 1;havoc #t~post8; {16847#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 5))} is VALID [2018-11-23 13:11:53,686 INFO L273 TraceCheckUtils]: 24: Hoare triple {16847#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 5))} assume !!(~j1~0 < ~n0~0 + ~n1~0); {16847#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 5))} is VALID [2018-11-23 13:11:53,686 INFO L256 TraceCheckUtils]: 25: Hoare triple {16847#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 5))} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {16834#true} is VALID [2018-11-23 13:11:53,686 INFO L273 TraceCheckUtils]: 26: Hoare triple {16834#true} ~cond := #in~cond; {16834#true} is VALID [2018-11-23 13:11:53,686 INFO L273 TraceCheckUtils]: 27: Hoare triple {16834#true} assume !(0 == ~cond); {16834#true} is VALID [2018-11-23 13:11:53,686 INFO L273 TraceCheckUtils]: 28: Hoare triple {16834#true} assume true; {16834#true} is VALID [2018-11-23 13:11:53,687 INFO L268 TraceCheckUtils]: 29: Hoare quadruple {16834#true} {16847#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 5))} #70#return; {16847#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 5))} is VALID [2018-11-23 13:11:53,688 INFO L273 TraceCheckUtils]: 30: Hoare triple {16847#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 5))} #t~post7 := ~j1~0;~j1~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~k~0;~k~0 := #t~post8 - 1;havoc #t~post8; {16848#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 4))} is VALID [2018-11-23 13:11:53,688 INFO L273 TraceCheckUtils]: 31: Hoare triple {16848#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 4))} assume !!(~j1~0 < ~n0~0 + ~n1~0); {16848#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 4))} is VALID [2018-11-23 13:11:53,688 INFO L256 TraceCheckUtils]: 32: Hoare triple {16848#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 4))} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {16834#true} is VALID [2018-11-23 13:11:53,688 INFO L273 TraceCheckUtils]: 33: Hoare triple {16834#true} ~cond := #in~cond; {16834#true} is VALID [2018-11-23 13:11:53,688 INFO L273 TraceCheckUtils]: 34: Hoare triple {16834#true} assume !(0 == ~cond); {16834#true} is VALID [2018-11-23 13:11:53,689 INFO L273 TraceCheckUtils]: 35: Hoare triple {16834#true} assume true; {16834#true} is VALID [2018-11-23 13:11:53,689 INFO L268 TraceCheckUtils]: 36: Hoare quadruple {16834#true} {16848#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 4))} #70#return; {16848#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 4))} is VALID [2018-11-23 13:11:53,690 INFO L273 TraceCheckUtils]: 37: Hoare triple {16848#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 4))} #t~post7 := ~j1~0;~j1~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~k~0;~k~0 := #t~post8 - 1;havoc #t~post8; {16849#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 3))} is VALID [2018-11-23 13:11:53,691 INFO L273 TraceCheckUtils]: 38: Hoare triple {16849#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 3))} assume !!(~j1~0 < ~n0~0 + ~n1~0); {16849#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 3))} is VALID [2018-11-23 13:11:53,691 INFO L256 TraceCheckUtils]: 39: Hoare triple {16849#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 3))} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {16834#true} is VALID [2018-11-23 13:11:53,691 INFO L273 TraceCheckUtils]: 40: Hoare triple {16834#true} ~cond := #in~cond; {16834#true} is VALID [2018-11-23 13:11:53,692 INFO L273 TraceCheckUtils]: 41: Hoare triple {16834#true} assume !(0 == ~cond); {16834#true} is VALID [2018-11-23 13:11:53,692 INFO L273 TraceCheckUtils]: 42: Hoare triple {16834#true} assume true; {16834#true} is VALID [2018-11-23 13:11:53,693 INFO L268 TraceCheckUtils]: 43: Hoare quadruple {16834#true} {16849#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 3))} #70#return; {16849#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 3))} is VALID [2018-11-23 13:11:53,694 INFO L273 TraceCheckUtils]: 44: Hoare triple {16849#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 3))} #t~post7 := ~j1~0;~j1~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~k~0;~k~0 := #t~post8 - 1;havoc #t~post8; {16850#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 2))} is VALID [2018-11-23 13:11:53,694 INFO L273 TraceCheckUtils]: 45: Hoare triple {16850#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 2))} assume !!(~j1~0 < ~n0~0 + ~n1~0); {16850#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 2))} is VALID [2018-11-23 13:11:53,694 INFO L256 TraceCheckUtils]: 46: Hoare triple {16850#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 2))} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {16834#true} is VALID [2018-11-23 13:11:53,695 INFO L273 TraceCheckUtils]: 47: Hoare triple {16834#true} ~cond := #in~cond; {16834#true} is VALID [2018-11-23 13:11:53,695 INFO L273 TraceCheckUtils]: 48: Hoare triple {16834#true} assume !(0 == ~cond); {16834#true} is VALID [2018-11-23 13:11:53,695 INFO L273 TraceCheckUtils]: 49: Hoare triple {16834#true} assume true; {16834#true} is VALID [2018-11-23 13:11:53,696 INFO L268 TraceCheckUtils]: 50: Hoare quadruple {16834#true} {16850#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 2))} #70#return; {16850#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 2))} is VALID [2018-11-23 13:11:53,697 INFO L273 TraceCheckUtils]: 51: Hoare triple {16850#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 2))} #t~post7 := ~j1~0;~j1~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~k~0;~k~0 := #t~post8 - 1;havoc #t~post8; {16851#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 1))} is VALID [2018-11-23 13:11:53,697 INFO L273 TraceCheckUtils]: 52: Hoare triple {16851#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 1))} assume !!(~j1~0 < ~n0~0 + ~n1~0); {16851#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 1))} is VALID [2018-11-23 13:11:53,698 INFO L256 TraceCheckUtils]: 53: Hoare triple {16851#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 1))} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {16834#true} is VALID [2018-11-23 13:11:53,698 INFO L273 TraceCheckUtils]: 54: Hoare triple {16834#true} ~cond := #in~cond; {16834#true} is VALID [2018-11-23 13:11:53,698 INFO L273 TraceCheckUtils]: 55: Hoare triple {16834#true} assume !(0 == ~cond); {16834#true} is VALID [2018-11-23 13:11:53,698 INFO L273 TraceCheckUtils]: 56: Hoare triple {16834#true} assume true; {16834#true} is VALID [2018-11-23 13:11:53,699 INFO L268 TraceCheckUtils]: 57: Hoare quadruple {16834#true} {16851#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 1))} #70#return; {16851#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 1))} is VALID [2018-11-23 13:11:53,700 INFO L273 TraceCheckUtils]: 58: Hoare triple {16851#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 1))} #t~post7 := ~j1~0;~j1~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~k~0;~k~0 := #t~post8 - 1;havoc #t~post8; {16852#(<= (+ main_~n0~0 main_~n1~0) main_~j1~0)} is VALID [2018-11-23 13:11:53,701 INFO L273 TraceCheckUtils]: 59: Hoare triple {16852#(<= (+ main_~n0~0 main_~n1~0) main_~j1~0)} assume !!(~j1~0 < ~n0~0 + ~n1~0); {16835#false} is VALID [2018-11-23 13:11:53,701 INFO L256 TraceCheckUtils]: 60: Hoare triple {16835#false} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {16835#false} is VALID [2018-11-23 13:11:53,701 INFO L273 TraceCheckUtils]: 61: Hoare triple {16835#false} ~cond := #in~cond; {16835#false} is VALID [2018-11-23 13:11:53,701 INFO L273 TraceCheckUtils]: 62: Hoare triple {16835#false} assume 0 == ~cond; {16835#false} is VALID [2018-11-23 13:11:53,702 INFO L273 TraceCheckUtils]: 63: Hoare triple {16835#false} assume !false; {16835#false} is VALID [2018-11-23 13:11:53,706 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 69 proven. 16 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2018-11-23 13:11:53,706 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:11:53,706 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:11:53,717 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 13:11:53,743 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2018-11-23 13:11:53,743 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:11:53,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:11:53,756 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:11:54,229 INFO L256 TraceCheckUtils]: 0: Hoare triple {16834#true} call ULTIMATE.init(); {16834#true} is VALID [2018-11-23 13:11:54,230 INFO L273 TraceCheckUtils]: 1: Hoare triple {16834#true} assume true; {16834#true} is VALID [2018-11-23 13:11:54,230 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {16834#true} {16834#true} #66#return; {16834#true} is VALID [2018-11-23 13:11:54,230 INFO L256 TraceCheckUtils]: 3: Hoare triple {16834#true} call #t~ret9 := main(); {16834#true} is VALID [2018-11-23 13:11:54,231 INFO L273 TraceCheckUtils]: 4: Hoare triple {16834#true} havoc ~n0~0;havoc ~n1~0;~i0~0 := 0;~k~0 := 0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n0~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~n1~0 := #t~nondet2;havoc #t~nondet2; {16836#(<= main_~i0~0 0)} is VALID [2018-11-23 13:11:54,231 INFO L273 TraceCheckUtils]: 5: Hoare triple {16836#(<= main_~i0~0 0)} assume !!(-1000000 <= ~n0~0 && ~n0~0 < 1000000); {16836#(<= main_~i0~0 0)} is VALID [2018-11-23 13:11:54,231 INFO L273 TraceCheckUtils]: 6: Hoare triple {16836#(<= main_~i0~0 0)} assume !!(-1000000 <= ~n1~0 && ~n1~0 < 1000000); {16836#(<= main_~i0~0 0)} is VALID [2018-11-23 13:11:54,232 INFO L273 TraceCheckUtils]: 7: Hoare triple {16836#(<= main_~i0~0 0)} assume !!(~i0~0 < ~n0~0);#t~post3 := ~i0~0;~i0~0 := 1 + #t~post3;havoc #t~post3;#t~post4 := ~k~0;~k~0 := 1 + #t~post4;havoc #t~post4; {16837#(<= main_~i0~0 1)} is VALID [2018-11-23 13:11:54,232 INFO L273 TraceCheckUtils]: 8: Hoare triple {16837#(<= main_~i0~0 1)} assume !(~i0~0 < ~n0~0); {16838#(<= main_~n0~0 1)} is VALID [2018-11-23 13:11:54,233 INFO L273 TraceCheckUtils]: 9: Hoare triple {16838#(<= main_~n0~0 1)} ~i1~0 := 0; {16883#(and (<= main_~i1~0 0) (<= main_~n0~0 1))} is VALID [2018-11-23 13:11:54,233 INFO L273 TraceCheckUtils]: 10: Hoare triple {16883#(and (<= main_~i1~0 0) (<= main_~n0~0 1))} assume !!(~i1~0 < ~n1~0);#t~post5 := ~i1~0;~i1~0 := 1 + #t~post5;havoc #t~post5;#t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {16887#(and (<= main_~i1~0 1) (<= main_~n0~0 1))} is VALID [2018-11-23 13:11:54,234 INFO L273 TraceCheckUtils]: 11: Hoare triple {16887#(and (<= main_~i1~0 1) (<= main_~n0~0 1))} assume !!(~i1~0 < ~n1~0);#t~post5 := ~i1~0;~i1~0 := 1 + #t~post5;havoc #t~post5;#t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {16891#(and (<= main_~i1~0 2) (<= main_~n0~0 1))} is VALID [2018-11-23 13:11:54,235 INFO L273 TraceCheckUtils]: 12: Hoare triple {16891#(and (<= main_~i1~0 2) (<= main_~n0~0 1))} assume !!(~i1~0 < ~n1~0);#t~post5 := ~i1~0;~i1~0 := 1 + #t~post5;havoc #t~post5;#t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {16895#(and (<= main_~i1~0 3) (<= main_~n0~0 1))} is VALID [2018-11-23 13:11:54,236 INFO L273 TraceCheckUtils]: 13: Hoare triple {16895#(and (<= main_~i1~0 3) (<= main_~n0~0 1))} assume !!(~i1~0 < ~n1~0);#t~post5 := ~i1~0;~i1~0 := 1 + #t~post5;havoc #t~post5;#t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {16899#(and (<= main_~i1~0 4) (<= main_~n0~0 1))} is VALID [2018-11-23 13:11:54,237 INFO L273 TraceCheckUtils]: 14: Hoare triple {16899#(and (<= main_~i1~0 4) (<= main_~n0~0 1))} assume !!(~i1~0 < ~n1~0);#t~post5 := ~i1~0;~i1~0 := 1 + #t~post5;havoc #t~post5;#t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {16903#(and (<= main_~i1~0 5) (<= main_~n0~0 1))} is VALID [2018-11-23 13:11:54,238 INFO L273 TraceCheckUtils]: 15: Hoare triple {16903#(and (<= main_~i1~0 5) (<= main_~n0~0 1))} assume !(~i1~0 < ~n1~0); {16907#(and (<= main_~n1~0 5) (<= main_~n0~0 1))} is VALID [2018-11-23 13:11:54,238 INFO L273 TraceCheckUtils]: 16: Hoare triple {16907#(and (<= main_~n1~0 5) (<= main_~n0~0 1))} ~j1~0 := 0; {16911#(and (<= main_~n1~0 5) (<= 0 main_~j1~0) (<= main_~n0~0 1))} is VALID [2018-11-23 13:11:54,239 INFO L273 TraceCheckUtils]: 17: Hoare triple {16911#(and (<= main_~n1~0 5) (<= 0 main_~j1~0) (<= main_~n0~0 1))} assume !!(~j1~0 < ~n0~0 + ~n1~0); {16911#(and (<= main_~n1~0 5) (<= 0 main_~j1~0) (<= main_~n0~0 1))} is VALID [2018-11-23 13:11:54,239 INFO L256 TraceCheckUtils]: 18: Hoare triple {16911#(and (<= main_~n1~0 5) (<= 0 main_~j1~0) (<= main_~n0~0 1))} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {16834#true} is VALID [2018-11-23 13:11:54,239 INFO L273 TraceCheckUtils]: 19: Hoare triple {16834#true} ~cond := #in~cond; {16834#true} is VALID [2018-11-23 13:11:54,240 INFO L273 TraceCheckUtils]: 20: Hoare triple {16834#true} assume !(0 == ~cond); {16834#true} is VALID [2018-11-23 13:11:54,240 INFO L273 TraceCheckUtils]: 21: Hoare triple {16834#true} assume true; {16834#true} is VALID [2018-11-23 13:11:54,241 INFO L268 TraceCheckUtils]: 22: Hoare quadruple {16834#true} {16911#(and (<= main_~n1~0 5) (<= 0 main_~j1~0) (<= main_~n0~0 1))} #70#return; {16911#(and (<= main_~n1~0 5) (<= 0 main_~j1~0) (<= main_~n0~0 1))} is VALID [2018-11-23 13:11:54,242 INFO L273 TraceCheckUtils]: 23: Hoare triple {16911#(and (<= main_~n1~0 5) (<= 0 main_~j1~0) (<= main_~n0~0 1))} #t~post7 := ~j1~0;~j1~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~k~0;~k~0 := #t~post8 - 1;havoc #t~post8; {16933#(and (<= main_~n1~0 5) (<= 1 main_~j1~0) (<= main_~n0~0 1))} is VALID [2018-11-23 13:11:54,243 INFO L273 TraceCheckUtils]: 24: Hoare triple {16933#(and (<= main_~n1~0 5) (<= 1 main_~j1~0) (<= main_~n0~0 1))} assume !!(~j1~0 < ~n0~0 + ~n1~0); {16933#(and (<= main_~n1~0 5) (<= 1 main_~j1~0) (<= main_~n0~0 1))} is VALID [2018-11-23 13:11:54,243 INFO L256 TraceCheckUtils]: 25: Hoare triple {16933#(and (<= main_~n1~0 5) (<= 1 main_~j1~0) (<= main_~n0~0 1))} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {16834#true} is VALID [2018-11-23 13:11:54,243 INFO L273 TraceCheckUtils]: 26: Hoare triple {16834#true} ~cond := #in~cond; {16834#true} is VALID [2018-11-23 13:11:54,243 INFO L273 TraceCheckUtils]: 27: Hoare triple {16834#true} assume !(0 == ~cond); {16834#true} is VALID [2018-11-23 13:11:54,243 INFO L273 TraceCheckUtils]: 28: Hoare triple {16834#true} assume true; {16834#true} is VALID [2018-11-23 13:11:54,244 INFO L268 TraceCheckUtils]: 29: Hoare quadruple {16834#true} {16933#(and (<= main_~n1~0 5) (<= 1 main_~j1~0) (<= main_~n0~0 1))} #70#return; {16933#(and (<= main_~n1~0 5) (<= 1 main_~j1~0) (<= main_~n0~0 1))} is VALID [2018-11-23 13:11:54,244 INFO L273 TraceCheckUtils]: 30: Hoare triple {16933#(and (<= main_~n1~0 5) (<= 1 main_~j1~0) (<= main_~n0~0 1))} #t~post7 := ~j1~0;~j1~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~k~0;~k~0 := #t~post8 - 1;havoc #t~post8; {16955#(and (<= main_~n1~0 5) (<= main_~n0~0 1) (<= 2 main_~j1~0))} is VALID [2018-11-23 13:11:54,245 INFO L273 TraceCheckUtils]: 31: Hoare triple {16955#(and (<= main_~n1~0 5) (<= main_~n0~0 1) (<= 2 main_~j1~0))} assume !!(~j1~0 < ~n0~0 + ~n1~0); {16955#(and (<= main_~n1~0 5) (<= main_~n0~0 1) (<= 2 main_~j1~0))} is VALID [2018-11-23 13:11:54,245 INFO L256 TraceCheckUtils]: 32: Hoare triple {16955#(and (<= main_~n1~0 5) (<= main_~n0~0 1) (<= 2 main_~j1~0))} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {16834#true} is VALID [2018-11-23 13:11:54,245 INFO L273 TraceCheckUtils]: 33: Hoare triple {16834#true} ~cond := #in~cond; {16834#true} is VALID [2018-11-23 13:11:54,245 INFO L273 TraceCheckUtils]: 34: Hoare triple {16834#true} assume !(0 == ~cond); {16834#true} is VALID [2018-11-23 13:11:54,245 INFO L273 TraceCheckUtils]: 35: Hoare triple {16834#true} assume true; {16834#true} is VALID [2018-11-23 13:11:54,246 INFO L268 TraceCheckUtils]: 36: Hoare quadruple {16834#true} {16955#(and (<= main_~n1~0 5) (<= main_~n0~0 1) (<= 2 main_~j1~0))} #70#return; {16955#(and (<= main_~n1~0 5) (<= main_~n0~0 1) (<= 2 main_~j1~0))} is VALID [2018-11-23 13:11:54,247 INFO L273 TraceCheckUtils]: 37: Hoare triple {16955#(and (<= main_~n1~0 5) (<= main_~n0~0 1) (<= 2 main_~j1~0))} #t~post7 := ~j1~0;~j1~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~k~0;~k~0 := #t~post8 - 1;havoc #t~post8; {16977#(and (<= main_~n1~0 5) (<= 3 main_~j1~0) (<= main_~n0~0 1))} is VALID [2018-11-23 13:11:54,248 INFO L273 TraceCheckUtils]: 38: Hoare triple {16977#(and (<= main_~n1~0 5) (<= 3 main_~j1~0) (<= main_~n0~0 1))} assume !!(~j1~0 < ~n0~0 + ~n1~0); {16977#(and (<= main_~n1~0 5) (<= 3 main_~j1~0) (<= main_~n0~0 1))} is VALID [2018-11-23 13:11:54,248 INFO L256 TraceCheckUtils]: 39: Hoare triple {16977#(and (<= main_~n1~0 5) (<= 3 main_~j1~0) (<= main_~n0~0 1))} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {16834#true} is VALID [2018-11-23 13:11:54,248 INFO L273 TraceCheckUtils]: 40: Hoare triple {16834#true} ~cond := #in~cond; {16834#true} is VALID [2018-11-23 13:11:54,248 INFO L273 TraceCheckUtils]: 41: Hoare triple {16834#true} assume !(0 == ~cond); {16834#true} is VALID [2018-11-23 13:11:54,248 INFO L273 TraceCheckUtils]: 42: Hoare triple {16834#true} assume true; {16834#true} is VALID [2018-11-23 13:11:54,249 INFO L268 TraceCheckUtils]: 43: Hoare quadruple {16834#true} {16977#(and (<= main_~n1~0 5) (<= 3 main_~j1~0) (<= main_~n0~0 1))} #70#return; {16977#(and (<= main_~n1~0 5) (<= 3 main_~j1~0) (<= main_~n0~0 1))} is VALID [2018-11-23 13:11:54,249 INFO L273 TraceCheckUtils]: 44: Hoare triple {16977#(and (<= main_~n1~0 5) (<= 3 main_~j1~0) (<= main_~n0~0 1))} #t~post7 := ~j1~0;~j1~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~k~0;~k~0 := #t~post8 - 1;havoc #t~post8; {16999#(and (<= main_~n1~0 5) (<= 4 main_~j1~0) (<= main_~n0~0 1))} is VALID [2018-11-23 13:11:54,250 INFO L273 TraceCheckUtils]: 45: Hoare triple {16999#(and (<= main_~n1~0 5) (<= 4 main_~j1~0) (<= main_~n0~0 1))} assume !!(~j1~0 < ~n0~0 + ~n1~0); {16999#(and (<= main_~n1~0 5) (<= 4 main_~j1~0) (<= main_~n0~0 1))} is VALID [2018-11-23 13:11:54,250 INFO L256 TraceCheckUtils]: 46: Hoare triple {16999#(and (<= main_~n1~0 5) (<= 4 main_~j1~0) (<= main_~n0~0 1))} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {16834#true} is VALID [2018-11-23 13:11:54,250 INFO L273 TraceCheckUtils]: 47: Hoare triple {16834#true} ~cond := #in~cond; {16834#true} is VALID [2018-11-23 13:11:54,250 INFO L273 TraceCheckUtils]: 48: Hoare triple {16834#true} assume !(0 == ~cond); {16834#true} is VALID [2018-11-23 13:11:54,250 INFO L273 TraceCheckUtils]: 49: Hoare triple {16834#true} assume true; {16834#true} is VALID [2018-11-23 13:11:54,251 INFO L268 TraceCheckUtils]: 50: Hoare quadruple {16834#true} {16999#(and (<= main_~n1~0 5) (<= 4 main_~j1~0) (<= main_~n0~0 1))} #70#return; {16999#(and (<= main_~n1~0 5) (<= 4 main_~j1~0) (<= main_~n0~0 1))} is VALID [2018-11-23 13:11:54,252 INFO L273 TraceCheckUtils]: 51: Hoare triple {16999#(and (<= main_~n1~0 5) (<= 4 main_~j1~0) (<= main_~n0~0 1))} #t~post7 := ~j1~0;~j1~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~k~0;~k~0 := #t~post8 - 1;havoc #t~post8; {17021#(and (<= main_~n1~0 5) (<= 5 main_~j1~0) (<= main_~n0~0 1))} is VALID [2018-11-23 13:11:54,253 INFO L273 TraceCheckUtils]: 52: Hoare triple {17021#(and (<= main_~n1~0 5) (<= 5 main_~j1~0) (<= main_~n0~0 1))} assume !!(~j1~0 < ~n0~0 + ~n1~0); {17021#(and (<= main_~n1~0 5) (<= 5 main_~j1~0) (<= main_~n0~0 1))} is VALID [2018-11-23 13:11:54,253 INFO L256 TraceCheckUtils]: 53: Hoare triple {17021#(and (<= main_~n1~0 5) (<= 5 main_~j1~0) (<= main_~n0~0 1))} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {16834#true} is VALID [2018-11-23 13:11:54,253 INFO L273 TraceCheckUtils]: 54: Hoare triple {16834#true} ~cond := #in~cond; {16834#true} is VALID [2018-11-23 13:11:54,253 INFO L273 TraceCheckUtils]: 55: Hoare triple {16834#true} assume !(0 == ~cond); {16834#true} is VALID [2018-11-23 13:11:54,253 INFO L273 TraceCheckUtils]: 56: Hoare triple {16834#true} assume true; {16834#true} is VALID [2018-11-23 13:11:54,254 INFO L268 TraceCheckUtils]: 57: Hoare quadruple {16834#true} {17021#(and (<= main_~n1~0 5) (<= 5 main_~j1~0) (<= main_~n0~0 1))} #70#return; {17021#(and (<= main_~n1~0 5) (<= 5 main_~j1~0) (<= main_~n0~0 1))} is VALID [2018-11-23 13:11:54,255 INFO L273 TraceCheckUtils]: 58: Hoare triple {17021#(and (<= main_~n1~0 5) (<= 5 main_~j1~0) (<= main_~n0~0 1))} #t~post7 := ~j1~0;~j1~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~k~0;~k~0 := #t~post8 - 1;havoc #t~post8; {17043#(and (<= main_~n1~0 5) (<= 6 main_~j1~0) (<= main_~n0~0 1))} is VALID [2018-11-23 13:11:54,256 INFO L273 TraceCheckUtils]: 59: Hoare triple {17043#(and (<= main_~n1~0 5) (<= 6 main_~j1~0) (<= main_~n0~0 1))} assume !!(~j1~0 < ~n0~0 + ~n1~0); {16835#false} is VALID [2018-11-23 13:11:54,256 INFO L256 TraceCheckUtils]: 60: Hoare triple {16835#false} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {16835#false} is VALID [2018-11-23 13:11:54,256 INFO L273 TraceCheckUtils]: 61: Hoare triple {16835#false} ~cond := #in~cond; {16835#false} is VALID [2018-11-23 13:11:54,256 INFO L273 TraceCheckUtils]: 62: Hoare triple {16835#false} assume 0 == ~cond; {16835#false} is VALID [2018-11-23 13:11:54,256 INFO L273 TraceCheckUtils]: 63: Hoare triple {16835#false} assume !false; {16835#false} is VALID [2018-11-23 13:11:54,260 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 69 proven. 16 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2018-11-23 13:11:54,279 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:11:54,279 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 33 [2018-11-23 13:11:54,279 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 64 [2018-11-23 13:11:54,280 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:11:54,280 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 33 states. [2018-11-23 13:11:54,355 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-23 13:11:54,356 INFO L459 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-11-23 13:11:54,356 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-11-23 13:11:54,357 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=214, Invalid=842, Unknown=0, NotChecked=0, Total=1056 [2018-11-23 13:11:54,357 INFO L87 Difference]: Start difference. First operand 80 states and 88 transitions. Second operand 33 states. [2018-11-23 13:11:56,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:11:56,912 INFO L93 Difference]: Finished difference Result 163 states and 194 transitions. [2018-11-23 13:11:56,912 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-11-23 13:11:56,912 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 64 [2018-11-23 13:11:56,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:11:56,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-11-23 13:11:56,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 90 transitions. [2018-11-23 13:11:56,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-11-23 13:11:56,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 90 transitions. [2018-11-23 13:11:56,916 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 26 states and 90 transitions. [2018-11-23 13:11:57,006 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 90 edges. 90 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:11:57,009 INFO L225 Difference]: With dead ends: 163 [2018-11-23 13:11:57,009 INFO L226 Difference]: Without dead ends: 134 [2018-11-23 13:11:57,011 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 817 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=595, Invalid=2375, Unknown=0, NotChecked=0, Total=2970 [2018-11-23 13:11:57,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2018-11-23 13:11:57,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 80. [2018-11-23 13:11:57,267 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:11:57,267 INFO L82 GeneralOperation]: Start isEquivalent. First operand 134 states. Second operand 80 states. [2018-11-23 13:11:57,267 INFO L74 IsIncluded]: Start isIncluded. First operand 134 states. Second operand 80 states. [2018-11-23 13:11:57,267 INFO L87 Difference]: Start difference. First operand 134 states. Second operand 80 states. [2018-11-23 13:11:57,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:11:57,270 INFO L93 Difference]: Finished difference Result 134 states and 158 transitions. [2018-11-23 13:11:57,270 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 158 transitions. [2018-11-23 13:11:57,270 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:11:57,270 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:11:57,270 INFO L74 IsIncluded]: Start isIncluded. First operand 80 states. Second operand 134 states. [2018-11-23 13:11:57,270 INFO L87 Difference]: Start difference. First operand 80 states. Second operand 134 states. [2018-11-23 13:11:57,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:11:57,273 INFO L93 Difference]: Finished difference Result 134 states and 158 transitions. [2018-11-23 13:11:57,273 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 158 transitions. [2018-11-23 13:11:57,273 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:11:57,273 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:11:57,273 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:11:57,273 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:11:57,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2018-11-23 13:11:57,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 88 transitions. [2018-11-23 13:11:57,274 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 88 transitions. Word has length 64 [2018-11-23 13:11:57,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:11:57,275 INFO L480 AbstractCegarLoop]: Abstraction has 80 states and 88 transitions. [2018-11-23 13:11:57,275 INFO L481 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-11-23 13:11:57,275 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 88 transitions. [2018-11-23 13:11:57,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-11-23 13:11:57,275 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:11:57,275 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:11:57,276 INFO L423 AbstractCegarLoop]: === Iteration 30 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:11:57,276 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:11:57,276 INFO L82 PathProgramCache]: Analyzing trace with hash -437851953, now seen corresponding path program 12 times [2018-11-23 13:11:57,276 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:11:57,276 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:11:57,277 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:11:57,277 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:11:57,277 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:11:57,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:11:57,521 INFO L256 TraceCheckUtils]: 0: Hoare triple {17749#true} call ULTIMATE.init(); {17749#true} is VALID [2018-11-23 13:11:57,521 INFO L273 TraceCheckUtils]: 1: Hoare triple {17749#true} assume true; {17749#true} is VALID [2018-11-23 13:11:57,521 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {17749#true} {17749#true} #66#return; {17749#true} is VALID [2018-11-23 13:11:57,522 INFO L256 TraceCheckUtils]: 3: Hoare triple {17749#true} call #t~ret9 := main(); {17749#true} is VALID [2018-11-23 13:11:57,522 INFO L273 TraceCheckUtils]: 4: Hoare triple {17749#true} havoc ~n0~0;havoc ~n1~0;~i0~0 := 0;~k~0 := 0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n0~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~n1~0 := #t~nondet2;havoc #t~nondet2; {17751#(<= main_~i0~0 0)} is VALID [2018-11-23 13:11:57,523 INFO L273 TraceCheckUtils]: 5: Hoare triple {17751#(<= main_~i0~0 0)} assume !!(-1000000 <= ~n0~0 && ~n0~0 < 1000000); {17751#(<= main_~i0~0 0)} is VALID [2018-11-23 13:11:57,523 INFO L273 TraceCheckUtils]: 6: Hoare triple {17751#(<= main_~i0~0 0)} assume !!(-1000000 <= ~n1~0 && ~n1~0 < 1000000); {17751#(<= main_~i0~0 0)} is VALID [2018-11-23 13:11:57,524 INFO L273 TraceCheckUtils]: 7: Hoare triple {17751#(<= main_~i0~0 0)} assume !!(~i0~0 < ~n0~0);#t~post3 := ~i0~0;~i0~0 := 1 + #t~post3;havoc #t~post3;#t~post4 := ~k~0;~k~0 := 1 + #t~post4;havoc #t~post4; {17752#(<= main_~i0~0 1)} is VALID [2018-11-23 13:11:57,525 INFO L273 TraceCheckUtils]: 8: Hoare triple {17752#(<= main_~i0~0 1)} assume !!(~i0~0 < ~n0~0);#t~post3 := ~i0~0;~i0~0 := 1 + #t~post3;havoc #t~post3;#t~post4 := ~k~0;~k~0 := 1 + #t~post4;havoc #t~post4; {17753#(<= main_~i0~0 2)} is VALID [2018-11-23 13:11:57,526 INFO L273 TraceCheckUtils]: 9: Hoare triple {17753#(<= main_~i0~0 2)} assume !(~i0~0 < ~n0~0); {17754#(<= main_~n0~0 2)} is VALID [2018-11-23 13:11:57,526 INFO L273 TraceCheckUtils]: 10: Hoare triple {17754#(<= main_~n0~0 2)} ~i1~0 := 0; {17755#(<= (+ main_~i1~0 main_~n0~0) 2)} is VALID [2018-11-23 13:11:57,527 INFO L273 TraceCheckUtils]: 11: Hoare triple {17755#(<= (+ main_~i1~0 main_~n0~0) 2)} assume !!(~i1~0 < ~n1~0);#t~post5 := ~i1~0;~i1~0 := 1 + #t~post5;havoc #t~post5;#t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {17756#(<= (+ main_~i1~0 main_~n0~0) 3)} is VALID [2018-11-23 13:11:57,528 INFO L273 TraceCheckUtils]: 12: Hoare triple {17756#(<= (+ main_~i1~0 main_~n0~0) 3)} assume !!(~i1~0 < ~n1~0);#t~post5 := ~i1~0;~i1~0 := 1 + #t~post5;havoc #t~post5;#t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {17757#(<= (+ main_~i1~0 main_~n0~0) 4)} is VALID [2018-11-23 13:11:57,529 INFO L273 TraceCheckUtils]: 13: Hoare triple {17757#(<= (+ main_~i1~0 main_~n0~0) 4)} assume !!(~i1~0 < ~n1~0);#t~post5 := ~i1~0;~i1~0 := 1 + #t~post5;havoc #t~post5;#t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {17758#(<= (+ main_~i1~0 main_~n0~0) 5)} is VALID [2018-11-23 13:11:57,530 INFO L273 TraceCheckUtils]: 14: Hoare triple {17758#(<= (+ main_~i1~0 main_~n0~0) 5)} assume !!(~i1~0 < ~n1~0);#t~post5 := ~i1~0;~i1~0 := 1 + #t~post5;havoc #t~post5;#t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {17759#(<= (+ main_~i1~0 main_~n0~0) 6)} is VALID [2018-11-23 13:11:57,530 INFO L273 TraceCheckUtils]: 15: Hoare triple {17759#(<= (+ main_~i1~0 main_~n0~0) 6)} assume !(~i1~0 < ~n1~0); {17760#(<= (+ main_~n0~0 main_~n1~0) 6)} is VALID [2018-11-23 13:11:57,531 INFO L273 TraceCheckUtils]: 16: Hoare triple {17760#(<= (+ main_~n0~0 main_~n1~0) 6)} ~j1~0 := 0; {17761#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 6))} is VALID [2018-11-23 13:11:57,532 INFO L273 TraceCheckUtils]: 17: Hoare triple {17761#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 6))} assume !!(~j1~0 < ~n0~0 + ~n1~0); {17761#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 6))} is VALID [2018-11-23 13:11:57,532 INFO L256 TraceCheckUtils]: 18: Hoare triple {17761#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 6))} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {17749#true} is VALID [2018-11-23 13:11:57,532 INFO L273 TraceCheckUtils]: 19: Hoare triple {17749#true} ~cond := #in~cond; {17749#true} is VALID [2018-11-23 13:11:57,532 INFO L273 TraceCheckUtils]: 20: Hoare triple {17749#true} assume !(0 == ~cond); {17749#true} is VALID [2018-11-23 13:11:57,532 INFO L273 TraceCheckUtils]: 21: Hoare triple {17749#true} assume true; {17749#true} is VALID [2018-11-23 13:11:57,533 INFO L268 TraceCheckUtils]: 22: Hoare quadruple {17749#true} {17761#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 6))} #70#return; {17761#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 6))} is VALID [2018-11-23 13:11:57,534 INFO L273 TraceCheckUtils]: 23: Hoare triple {17761#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 6))} #t~post7 := ~j1~0;~j1~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~k~0;~k~0 := #t~post8 - 1;havoc #t~post8; {17762#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 5))} is VALID [2018-11-23 13:11:57,535 INFO L273 TraceCheckUtils]: 24: Hoare triple {17762#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 5))} assume !!(~j1~0 < ~n0~0 + ~n1~0); {17762#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 5))} is VALID [2018-11-23 13:11:57,535 INFO L256 TraceCheckUtils]: 25: Hoare triple {17762#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 5))} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {17749#true} is VALID [2018-11-23 13:11:57,535 INFO L273 TraceCheckUtils]: 26: Hoare triple {17749#true} ~cond := #in~cond; {17749#true} is VALID [2018-11-23 13:11:57,535 INFO L273 TraceCheckUtils]: 27: Hoare triple {17749#true} assume !(0 == ~cond); {17749#true} is VALID [2018-11-23 13:11:57,536 INFO L273 TraceCheckUtils]: 28: Hoare triple {17749#true} assume true; {17749#true} is VALID [2018-11-23 13:11:57,536 INFO L268 TraceCheckUtils]: 29: Hoare quadruple {17749#true} {17762#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 5))} #70#return; {17762#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 5))} is VALID [2018-11-23 13:11:57,537 INFO L273 TraceCheckUtils]: 30: Hoare triple {17762#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 5))} #t~post7 := ~j1~0;~j1~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~k~0;~k~0 := #t~post8 - 1;havoc #t~post8; {17763#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 4))} is VALID [2018-11-23 13:11:57,538 INFO L273 TraceCheckUtils]: 31: Hoare triple {17763#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 4))} assume !!(~j1~0 < ~n0~0 + ~n1~0); {17763#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 4))} is VALID [2018-11-23 13:11:57,538 INFO L256 TraceCheckUtils]: 32: Hoare triple {17763#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 4))} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {17749#true} is VALID [2018-11-23 13:11:57,538 INFO L273 TraceCheckUtils]: 33: Hoare triple {17749#true} ~cond := #in~cond; {17749#true} is VALID [2018-11-23 13:11:57,538 INFO L273 TraceCheckUtils]: 34: Hoare triple {17749#true} assume !(0 == ~cond); {17749#true} is VALID [2018-11-23 13:11:57,539 INFO L273 TraceCheckUtils]: 35: Hoare triple {17749#true} assume true; {17749#true} is VALID [2018-11-23 13:11:57,539 INFO L268 TraceCheckUtils]: 36: Hoare quadruple {17749#true} {17763#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 4))} #70#return; {17763#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 4))} is VALID [2018-11-23 13:11:57,540 INFO L273 TraceCheckUtils]: 37: Hoare triple {17763#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 4))} #t~post7 := ~j1~0;~j1~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~k~0;~k~0 := #t~post8 - 1;havoc #t~post8; {17764#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 3))} is VALID [2018-11-23 13:11:57,541 INFO L273 TraceCheckUtils]: 38: Hoare triple {17764#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 3))} assume !!(~j1~0 < ~n0~0 + ~n1~0); {17764#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 3))} is VALID [2018-11-23 13:11:57,541 INFO L256 TraceCheckUtils]: 39: Hoare triple {17764#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 3))} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {17749#true} is VALID [2018-11-23 13:11:57,541 INFO L273 TraceCheckUtils]: 40: Hoare triple {17749#true} ~cond := #in~cond; {17749#true} is VALID [2018-11-23 13:11:57,541 INFO L273 TraceCheckUtils]: 41: Hoare triple {17749#true} assume !(0 == ~cond); {17749#true} is VALID [2018-11-23 13:11:57,542 INFO L273 TraceCheckUtils]: 42: Hoare triple {17749#true} assume true; {17749#true} is VALID [2018-11-23 13:11:57,542 INFO L268 TraceCheckUtils]: 43: Hoare quadruple {17749#true} {17764#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 3))} #70#return; {17764#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 3))} is VALID [2018-11-23 13:11:57,543 INFO L273 TraceCheckUtils]: 44: Hoare triple {17764#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 3))} #t~post7 := ~j1~0;~j1~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~k~0;~k~0 := #t~post8 - 1;havoc #t~post8; {17765#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 2))} is VALID [2018-11-23 13:11:57,543 INFO L273 TraceCheckUtils]: 45: Hoare triple {17765#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 2))} assume !!(~j1~0 < ~n0~0 + ~n1~0); {17765#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 2))} is VALID [2018-11-23 13:11:57,543 INFO L256 TraceCheckUtils]: 46: Hoare triple {17765#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 2))} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {17749#true} is VALID [2018-11-23 13:11:57,543 INFO L273 TraceCheckUtils]: 47: Hoare triple {17749#true} ~cond := #in~cond; {17749#true} is VALID [2018-11-23 13:11:57,543 INFO L273 TraceCheckUtils]: 48: Hoare triple {17749#true} assume !(0 == ~cond); {17749#true} is VALID [2018-11-23 13:11:57,543 INFO L273 TraceCheckUtils]: 49: Hoare triple {17749#true} assume true; {17749#true} is VALID [2018-11-23 13:11:57,544 INFO L268 TraceCheckUtils]: 50: Hoare quadruple {17749#true} {17765#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 2))} #70#return; {17765#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 2))} is VALID [2018-11-23 13:11:57,546 INFO L273 TraceCheckUtils]: 51: Hoare triple {17765#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 2))} #t~post7 := ~j1~0;~j1~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~k~0;~k~0 := #t~post8 - 1;havoc #t~post8; {17766#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 1))} is VALID [2018-11-23 13:11:57,547 INFO L273 TraceCheckUtils]: 52: Hoare triple {17766#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 1))} assume !!(~j1~0 < ~n0~0 + ~n1~0); {17766#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 1))} is VALID [2018-11-23 13:11:57,547 INFO L256 TraceCheckUtils]: 53: Hoare triple {17766#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 1))} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {17749#true} is VALID [2018-11-23 13:11:57,547 INFO L273 TraceCheckUtils]: 54: Hoare triple {17749#true} ~cond := #in~cond; {17749#true} is VALID [2018-11-23 13:11:57,547 INFO L273 TraceCheckUtils]: 55: Hoare triple {17749#true} assume !(0 == ~cond); {17749#true} is VALID [2018-11-23 13:11:57,547 INFO L273 TraceCheckUtils]: 56: Hoare triple {17749#true} assume true; {17749#true} is VALID [2018-11-23 13:11:57,548 INFO L268 TraceCheckUtils]: 57: Hoare quadruple {17749#true} {17766#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 1))} #70#return; {17766#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 1))} is VALID [2018-11-23 13:11:57,549 INFO L273 TraceCheckUtils]: 58: Hoare triple {17766#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 1))} #t~post7 := ~j1~0;~j1~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~k~0;~k~0 := #t~post8 - 1;havoc #t~post8; {17767#(<= (+ main_~n0~0 main_~n1~0) main_~j1~0)} is VALID [2018-11-23 13:11:57,550 INFO L273 TraceCheckUtils]: 59: Hoare triple {17767#(<= (+ main_~n0~0 main_~n1~0) main_~j1~0)} assume !!(~j1~0 < ~n0~0 + ~n1~0); {17750#false} is VALID [2018-11-23 13:11:57,550 INFO L256 TraceCheckUtils]: 60: Hoare triple {17750#false} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {17750#false} is VALID [2018-11-23 13:11:57,550 INFO L273 TraceCheckUtils]: 61: Hoare triple {17750#false} ~cond := #in~cond; {17750#false} is VALID [2018-11-23 13:11:57,551 INFO L273 TraceCheckUtils]: 62: Hoare triple {17750#false} assume 0 == ~cond; {17750#false} is VALID [2018-11-23 13:11:57,551 INFO L273 TraceCheckUtils]: 63: Hoare triple {17750#false} assume !false; {17750#false} is VALID [2018-11-23 13:11:57,555 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 69 proven. 13 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2018-11-23 13:11:57,556 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:11:57,556 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:11:57,566 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-23 13:11:57,601 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-11-23 13:11:57,601 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:11:57,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:11:57,616 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:11:58,266 INFO L256 TraceCheckUtils]: 0: Hoare triple {17749#true} call ULTIMATE.init(); {17749#true} is VALID [2018-11-23 13:11:58,266 INFO L273 TraceCheckUtils]: 1: Hoare triple {17749#true} assume true; {17749#true} is VALID [2018-11-23 13:11:58,267 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {17749#true} {17749#true} #66#return; {17749#true} is VALID [2018-11-23 13:11:58,267 INFO L256 TraceCheckUtils]: 3: Hoare triple {17749#true} call #t~ret9 := main(); {17749#true} is VALID [2018-11-23 13:11:58,267 INFO L273 TraceCheckUtils]: 4: Hoare triple {17749#true} havoc ~n0~0;havoc ~n1~0;~i0~0 := 0;~k~0 := 0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n0~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~n1~0 := #t~nondet2;havoc #t~nondet2; {17751#(<= main_~i0~0 0)} is VALID [2018-11-23 13:11:58,268 INFO L273 TraceCheckUtils]: 5: Hoare triple {17751#(<= main_~i0~0 0)} assume !!(-1000000 <= ~n0~0 && ~n0~0 < 1000000); {17751#(<= main_~i0~0 0)} is VALID [2018-11-23 13:11:58,268 INFO L273 TraceCheckUtils]: 6: Hoare triple {17751#(<= main_~i0~0 0)} assume !!(-1000000 <= ~n1~0 && ~n1~0 < 1000000); {17751#(<= main_~i0~0 0)} is VALID [2018-11-23 13:11:58,269 INFO L273 TraceCheckUtils]: 7: Hoare triple {17751#(<= main_~i0~0 0)} assume !!(~i0~0 < ~n0~0);#t~post3 := ~i0~0;~i0~0 := 1 + #t~post3;havoc #t~post3;#t~post4 := ~k~0;~k~0 := 1 + #t~post4;havoc #t~post4; {17752#(<= main_~i0~0 1)} is VALID [2018-11-23 13:11:58,269 INFO L273 TraceCheckUtils]: 8: Hoare triple {17752#(<= main_~i0~0 1)} assume !!(~i0~0 < ~n0~0);#t~post3 := ~i0~0;~i0~0 := 1 + #t~post3;havoc #t~post3;#t~post4 := ~k~0;~k~0 := 1 + #t~post4;havoc #t~post4; {17753#(<= main_~i0~0 2)} is VALID [2018-11-23 13:11:58,270 INFO L273 TraceCheckUtils]: 9: Hoare triple {17753#(<= main_~i0~0 2)} assume !(~i0~0 < ~n0~0); {17754#(<= main_~n0~0 2)} is VALID [2018-11-23 13:11:58,270 INFO L273 TraceCheckUtils]: 10: Hoare triple {17754#(<= main_~n0~0 2)} ~i1~0 := 0; {17801#(and (<= main_~n0~0 2) (<= main_~i1~0 0))} is VALID [2018-11-23 13:11:58,271 INFO L273 TraceCheckUtils]: 11: Hoare triple {17801#(and (<= main_~n0~0 2) (<= main_~i1~0 0))} assume !!(~i1~0 < ~n1~0);#t~post5 := ~i1~0;~i1~0 := 1 + #t~post5;havoc #t~post5;#t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {17805#(and (<= main_~n0~0 2) (<= main_~i1~0 1))} is VALID [2018-11-23 13:11:58,272 INFO L273 TraceCheckUtils]: 12: Hoare triple {17805#(and (<= main_~n0~0 2) (<= main_~i1~0 1))} assume !!(~i1~0 < ~n1~0);#t~post5 := ~i1~0;~i1~0 := 1 + #t~post5;havoc #t~post5;#t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {17809#(and (<= main_~n0~0 2) (<= main_~i1~0 2))} is VALID [2018-11-23 13:11:58,273 INFO L273 TraceCheckUtils]: 13: Hoare triple {17809#(and (<= main_~n0~0 2) (<= main_~i1~0 2))} assume !!(~i1~0 < ~n1~0);#t~post5 := ~i1~0;~i1~0 := 1 + #t~post5;havoc #t~post5;#t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {17813#(and (<= main_~n0~0 2) (<= main_~i1~0 3))} is VALID [2018-11-23 13:11:58,274 INFO L273 TraceCheckUtils]: 14: Hoare triple {17813#(and (<= main_~n0~0 2) (<= main_~i1~0 3))} assume !!(~i1~0 < ~n1~0);#t~post5 := ~i1~0;~i1~0 := 1 + #t~post5;havoc #t~post5;#t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {17817#(and (<= main_~n0~0 2) (<= main_~i1~0 4))} is VALID [2018-11-23 13:11:58,275 INFO L273 TraceCheckUtils]: 15: Hoare triple {17817#(and (<= main_~n0~0 2) (<= main_~i1~0 4))} assume !(~i1~0 < ~n1~0); {17821#(and (<= main_~n0~0 2) (<= main_~n1~0 4))} is VALID [2018-11-23 13:11:58,275 INFO L273 TraceCheckUtils]: 16: Hoare triple {17821#(and (<= main_~n0~0 2) (<= main_~n1~0 4))} ~j1~0 := 0; {17825#(and (<= main_~n0~0 2) (<= main_~n1~0 4) (<= 0 main_~j1~0))} is VALID [2018-11-23 13:11:58,276 INFO L273 TraceCheckUtils]: 17: Hoare triple {17825#(and (<= main_~n0~0 2) (<= main_~n1~0 4) (<= 0 main_~j1~0))} assume !!(~j1~0 < ~n0~0 + ~n1~0); {17825#(and (<= main_~n0~0 2) (<= main_~n1~0 4) (<= 0 main_~j1~0))} is VALID [2018-11-23 13:11:58,276 INFO L256 TraceCheckUtils]: 18: Hoare triple {17825#(and (<= main_~n0~0 2) (<= main_~n1~0 4) (<= 0 main_~j1~0))} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {17749#true} is VALID [2018-11-23 13:11:58,276 INFO L273 TraceCheckUtils]: 19: Hoare triple {17749#true} ~cond := #in~cond; {17749#true} is VALID [2018-11-23 13:11:58,277 INFO L273 TraceCheckUtils]: 20: Hoare triple {17749#true} assume !(0 == ~cond); {17749#true} is VALID [2018-11-23 13:11:58,277 INFO L273 TraceCheckUtils]: 21: Hoare triple {17749#true} assume true; {17749#true} is VALID [2018-11-23 13:11:58,278 INFO L268 TraceCheckUtils]: 22: Hoare quadruple {17749#true} {17825#(and (<= main_~n0~0 2) (<= main_~n1~0 4) (<= 0 main_~j1~0))} #70#return; {17825#(and (<= main_~n0~0 2) (<= main_~n1~0 4) (<= 0 main_~j1~0))} is VALID [2018-11-23 13:11:58,279 INFO L273 TraceCheckUtils]: 23: Hoare triple {17825#(and (<= main_~n0~0 2) (<= main_~n1~0 4) (<= 0 main_~j1~0))} #t~post7 := ~j1~0;~j1~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~k~0;~k~0 := #t~post8 - 1;havoc #t~post8; {17847#(and (<= 1 main_~j1~0) (<= main_~n0~0 2) (<= main_~n1~0 4))} is VALID [2018-11-23 13:11:58,279 INFO L273 TraceCheckUtils]: 24: Hoare triple {17847#(and (<= 1 main_~j1~0) (<= main_~n0~0 2) (<= main_~n1~0 4))} assume !!(~j1~0 < ~n0~0 + ~n1~0); {17847#(and (<= 1 main_~j1~0) (<= main_~n0~0 2) (<= main_~n1~0 4))} is VALID [2018-11-23 13:11:58,279 INFO L256 TraceCheckUtils]: 25: Hoare triple {17847#(and (<= 1 main_~j1~0) (<= main_~n0~0 2) (<= main_~n1~0 4))} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {17749#true} is VALID [2018-11-23 13:11:58,280 INFO L273 TraceCheckUtils]: 26: Hoare triple {17749#true} ~cond := #in~cond; {17749#true} is VALID [2018-11-23 13:11:58,280 INFO L273 TraceCheckUtils]: 27: Hoare triple {17749#true} assume !(0 == ~cond); {17749#true} is VALID [2018-11-23 13:11:58,280 INFO L273 TraceCheckUtils]: 28: Hoare triple {17749#true} assume true; {17749#true} is VALID [2018-11-23 13:11:58,280 INFO L268 TraceCheckUtils]: 29: Hoare quadruple {17749#true} {17847#(and (<= 1 main_~j1~0) (<= main_~n0~0 2) (<= main_~n1~0 4))} #70#return; {17847#(and (<= 1 main_~j1~0) (<= main_~n0~0 2) (<= main_~n1~0 4))} is VALID [2018-11-23 13:11:58,281 INFO L273 TraceCheckUtils]: 30: Hoare triple {17847#(and (<= 1 main_~j1~0) (<= main_~n0~0 2) (<= main_~n1~0 4))} #t~post7 := ~j1~0;~j1~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~k~0;~k~0 := #t~post8 - 1;havoc #t~post8; {17869#(and (<= main_~n0~0 2) (<= main_~n1~0 4) (<= 2 main_~j1~0))} is VALID [2018-11-23 13:11:58,281 INFO L273 TraceCheckUtils]: 31: Hoare triple {17869#(and (<= main_~n0~0 2) (<= main_~n1~0 4) (<= 2 main_~j1~0))} assume !!(~j1~0 < ~n0~0 + ~n1~0); {17869#(and (<= main_~n0~0 2) (<= main_~n1~0 4) (<= 2 main_~j1~0))} is VALID [2018-11-23 13:11:58,281 INFO L256 TraceCheckUtils]: 32: Hoare triple {17869#(and (<= main_~n0~0 2) (<= main_~n1~0 4) (<= 2 main_~j1~0))} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {17749#true} is VALID [2018-11-23 13:11:58,282 INFO L273 TraceCheckUtils]: 33: Hoare triple {17749#true} ~cond := #in~cond; {17749#true} is VALID [2018-11-23 13:11:58,282 INFO L273 TraceCheckUtils]: 34: Hoare triple {17749#true} assume !(0 == ~cond); {17749#true} is VALID [2018-11-23 13:11:58,282 INFO L273 TraceCheckUtils]: 35: Hoare triple {17749#true} assume true; {17749#true} is VALID [2018-11-23 13:11:58,308 INFO L268 TraceCheckUtils]: 36: Hoare quadruple {17749#true} {17869#(and (<= main_~n0~0 2) (<= main_~n1~0 4) (<= 2 main_~j1~0))} #70#return; {17869#(and (<= main_~n0~0 2) (<= main_~n1~0 4) (<= 2 main_~j1~0))} is VALID [2018-11-23 13:11:58,311 INFO L273 TraceCheckUtils]: 37: Hoare triple {17869#(and (<= main_~n0~0 2) (<= main_~n1~0 4) (<= 2 main_~j1~0))} #t~post7 := ~j1~0;~j1~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~k~0;~k~0 := #t~post8 - 1;havoc #t~post8; {17891#(and (<= main_~n0~0 2) (<= main_~n1~0 4) (<= 3 main_~j1~0))} is VALID [2018-11-23 13:11:58,311 INFO L273 TraceCheckUtils]: 38: Hoare triple {17891#(and (<= main_~n0~0 2) (<= main_~n1~0 4) (<= 3 main_~j1~0))} assume !!(~j1~0 < ~n0~0 + ~n1~0); {17891#(and (<= main_~n0~0 2) (<= main_~n1~0 4) (<= 3 main_~j1~0))} is VALID [2018-11-23 13:11:58,311 INFO L256 TraceCheckUtils]: 39: Hoare triple {17891#(and (<= main_~n0~0 2) (<= main_~n1~0 4) (<= 3 main_~j1~0))} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {17749#true} is VALID [2018-11-23 13:11:58,312 INFO L273 TraceCheckUtils]: 40: Hoare triple {17749#true} ~cond := #in~cond; {17749#true} is VALID [2018-11-23 13:11:58,312 INFO L273 TraceCheckUtils]: 41: Hoare triple {17749#true} assume !(0 == ~cond); {17749#true} is VALID [2018-11-23 13:11:58,312 INFO L273 TraceCheckUtils]: 42: Hoare triple {17749#true} assume true; {17749#true} is VALID [2018-11-23 13:11:58,313 INFO L268 TraceCheckUtils]: 43: Hoare quadruple {17749#true} {17891#(and (<= main_~n0~0 2) (<= main_~n1~0 4) (<= 3 main_~j1~0))} #70#return; {17891#(and (<= main_~n0~0 2) (<= main_~n1~0 4) (<= 3 main_~j1~0))} is VALID [2018-11-23 13:11:58,313 INFO L273 TraceCheckUtils]: 44: Hoare triple {17891#(and (<= main_~n0~0 2) (<= main_~n1~0 4) (<= 3 main_~j1~0))} #t~post7 := ~j1~0;~j1~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~k~0;~k~0 := #t~post8 - 1;havoc #t~post8; {17913#(and (<= main_~n0~0 2) (<= main_~n1~0 4) (<= 4 main_~j1~0))} is VALID [2018-11-23 13:11:58,314 INFO L273 TraceCheckUtils]: 45: Hoare triple {17913#(and (<= main_~n0~0 2) (<= main_~n1~0 4) (<= 4 main_~j1~0))} assume !!(~j1~0 < ~n0~0 + ~n1~0); {17913#(and (<= main_~n0~0 2) (<= main_~n1~0 4) (<= 4 main_~j1~0))} is VALID [2018-11-23 13:11:58,314 INFO L256 TraceCheckUtils]: 46: Hoare triple {17913#(and (<= main_~n0~0 2) (<= main_~n1~0 4) (<= 4 main_~j1~0))} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {17749#true} is VALID [2018-11-23 13:11:58,314 INFO L273 TraceCheckUtils]: 47: Hoare triple {17749#true} ~cond := #in~cond; {17749#true} is VALID [2018-11-23 13:11:58,315 INFO L273 TraceCheckUtils]: 48: Hoare triple {17749#true} assume !(0 == ~cond); {17749#true} is VALID [2018-11-23 13:11:58,315 INFO L273 TraceCheckUtils]: 49: Hoare triple {17749#true} assume true; {17749#true} is VALID [2018-11-23 13:11:58,316 INFO L268 TraceCheckUtils]: 50: Hoare quadruple {17749#true} {17913#(and (<= main_~n0~0 2) (<= main_~n1~0 4) (<= 4 main_~j1~0))} #70#return; {17913#(and (<= main_~n0~0 2) (<= main_~n1~0 4) (<= 4 main_~j1~0))} is VALID [2018-11-23 13:11:58,317 INFO L273 TraceCheckUtils]: 51: Hoare triple {17913#(and (<= main_~n0~0 2) (<= main_~n1~0 4) (<= 4 main_~j1~0))} #t~post7 := ~j1~0;~j1~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~k~0;~k~0 := #t~post8 - 1;havoc #t~post8; {17935#(and (<= main_~n0~0 2) (<= main_~n1~0 4) (<= 5 main_~j1~0))} is VALID [2018-11-23 13:11:58,317 INFO L273 TraceCheckUtils]: 52: Hoare triple {17935#(and (<= main_~n0~0 2) (<= main_~n1~0 4) (<= 5 main_~j1~0))} assume !!(~j1~0 < ~n0~0 + ~n1~0); {17935#(and (<= main_~n0~0 2) (<= main_~n1~0 4) (<= 5 main_~j1~0))} is VALID [2018-11-23 13:11:58,318 INFO L256 TraceCheckUtils]: 53: Hoare triple {17935#(and (<= main_~n0~0 2) (<= main_~n1~0 4) (<= 5 main_~j1~0))} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {17749#true} is VALID [2018-11-23 13:11:58,318 INFO L273 TraceCheckUtils]: 54: Hoare triple {17749#true} ~cond := #in~cond; {17749#true} is VALID [2018-11-23 13:11:58,318 INFO L273 TraceCheckUtils]: 55: Hoare triple {17749#true} assume !(0 == ~cond); {17749#true} is VALID [2018-11-23 13:11:58,318 INFO L273 TraceCheckUtils]: 56: Hoare triple {17749#true} assume true; {17749#true} is VALID [2018-11-23 13:11:58,319 INFO L268 TraceCheckUtils]: 57: Hoare quadruple {17749#true} {17935#(and (<= main_~n0~0 2) (<= main_~n1~0 4) (<= 5 main_~j1~0))} #70#return; {17935#(and (<= main_~n0~0 2) (<= main_~n1~0 4) (<= 5 main_~j1~0))} is VALID [2018-11-23 13:11:58,320 INFO L273 TraceCheckUtils]: 58: Hoare triple {17935#(and (<= main_~n0~0 2) (<= main_~n1~0 4) (<= 5 main_~j1~0))} #t~post7 := ~j1~0;~j1~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~k~0;~k~0 := #t~post8 - 1;havoc #t~post8; {17957#(and (<= 6 main_~j1~0) (<= main_~n0~0 2) (<= main_~n1~0 4))} is VALID [2018-11-23 13:11:58,321 INFO L273 TraceCheckUtils]: 59: Hoare triple {17957#(and (<= 6 main_~j1~0) (<= main_~n0~0 2) (<= main_~n1~0 4))} assume !!(~j1~0 < ~n0~0 + ~n1~0); {17750#false} is VALID [2018-11-23 13:11:58,321 INFO L256 TraceCheckUtils]: 60: Hoare triple {17750#false} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {17750#false} is VALID [2018-11-23 13:11:58,321 INFO L273 TraceCheckUtils]: 61: Hoare triple {17750#false} ~cond := #in~cond; {17750#false} is VALID [2018-11-23 13:11:58,322 INFO L273 TraceCheckUtils]: 62: Hoare triple {17750#false} assume 0 == ~cond; {17750#false} is VALID [2018-11-23 13:11:58,322 INFO L273 TraceCheckUtils]: 63: Hoare triple {17750#false} assume !false; {17750#false} is VALID [2018-11-23 13:11:58,327 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 69 proven. 13 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2018-11-23 13:11:58,346 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:11:58,346 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 32 [2018-11-23 13:11:58,347 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 64 [2018-11-23 13:11:58,347 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:11:58,347 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 32 states. [2018-11-23 13:11:58,440 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 81 edges. 81 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:11:58,440 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-11-23 13:11:58,440 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-11-23 13:11:58,441 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=197, Invalid=795, Unknown=0, NotChecked=0, Total=992 [2018-11-23 13:11:58,441 INFO L87 Difference]: Start difference. First operand 80 states and 88 transitions. Second operand 32 states. [2018-11-23 13:12:01,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:12:01,671 INFO L93 Difference]: Finished difference Result 189 states and 228 transitions. [2018-11-23 13:12:01,671 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-11-23 13:12:01,671 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 64 [2018-11-23 13:12:01,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:12:01,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-11-23 13:12:01,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 103 transitions. [2018-11-23 13:12:01,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-11-23 13:12:01,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 103 transitions. [2018-11-23 13:12:01,675 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 31 states and 103 transitions. [2018-11-23 13:12:01,792 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 103 edges. 103 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:12:01,796 INFO L225 Difference]: With dead ends: 189 [2018-11-23 13:12:01,796 INFO L226 Difference]: Without dead ends: 160 [2018-11-23 13:12:01,797 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 929 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=649, Invalid=2657, Unknown=0, NotChecked=0, Total=3306 [2018-11-23 13:12:01,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2018-11-23 13:12:02,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 80. [2018-11-23 13:12:02,253 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:12:02,253 INFO L82 GeneralOperation]: Start isEquivalent. First operand 160 states. Second operand 80 states. [2018-11-23 13:12:02,253 INFO L74 IsIncluded]: Start isIncluded. First operand 160 states. Second operand 80 states. [2018-11-23 13:12:02,253 INFO L87 Difference]: Start difference. First operand 160 states. Second operand 80 states. [2018-11-23 13:12:02,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:12:02,257 INFO L93 Difference]: Finished difference Result 160 states and 192 transitions. [2018-11-23 13:12:02,257 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 192 transitions. [2018-11-23 13:12:02,257 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:12:02,257 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:12:02,258 INFO L74 IsIncluded]: Start isIncluded. First operand 80 states. Second operand 160 states. [2018-11-23 13:12:02,258 INFO L87 Difference]: Start difference. First operand 80 states. Second operand 160 states. [2018-11-23 13:12:02,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:12:02,260 INFO L93 Difference]: Finished difference Result 160 states and 192 transitions. [2018-11-23 13:12:02,260 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 192 transitions. [2018-11-23 13:12:02,261 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:12:02,261 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:12:02,261 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:12:02,261 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:12:02,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2018-11-23 13:12:02,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 88 transitions. [2018-11-23 13:12:02,262 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 88 transitions. Word has length 64 [2018-11-23 13:12:02,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:12:02,262 INFO L480 AbstractCegarLoop]: Abstraction has 80 states and 88 transitions. [2018-11-23 13:12:02,262 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-11-23 13:12:02,262 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 88 transitions. [2018-11-23 13:12:02,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-11-23 13:12:02,263 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:12:02,263 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:12:02,263 INFO L423 AbstractCegarLoop]: === Iteration 31 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:12:02,263 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:12:02,263 INFO L82 PathProgramCache]: Analyzing trace with hash -1529192946, now seen corresponding path program 13 times [2018-11-23 13:12:02,264 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:12:02,264 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:12:02,264 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:12:02,264 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:12:02,264 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:12:02,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:12:02,888 INFO L256 TraceCheckUtils]: 0: Hoare triple {18768#true} call ULTIMATE.init(); {18768#true} is VALID [2018-11-23 13:12:02,888 INFO L273 TraceCheckUtils]: 1: Hoare triple {18768#true} assume true; {18768#true} is VALID [2018-11-23 13:12:02,888 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {18768#true} {18768#true} #66#return; {18768#true} is VALID [2018-11-23 13:12:02,889 INFO L256 TraceCheckUtils]: 3: Hoare triple {18768#true} call #t~ret9 := main(); {18768#true} is VALID [2018-11-23 13:12:02,889 INFO L273 TraceCheckUtils]: 4: Hoare triple {18768#true} havoc ~n0~0;havoc ~n1~0;~i0~0 := 0;~k~0 := 0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n0~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~n1~0 := #t~nondet2;havoc #t~nondet2; {18770#(<= main_~i0~0 0)} is VALID [2018-11-23 13:12:02,890 INFO L273 TraceCheckUtils]: 5: Hoare triple {18770#(<= main_~i0~0 0)} assume !!(-1000000 <= ~n0~0 && ~n0~0 < 1000000); {18770#(<= main_~i0~0 0)} is VALID [2018-11-23 13:12:02,890 INFO L273 TraceCheckUtils]: 6: Hoare triple {18770#(<= main_~i0~0 0)} assume !!(-1000000 <= ~n1~0 && ~n1~0 < 1000000); {18770#(<= main_~i0~0 0)} is VALID [2018-11-23 13:12:02,891 INFO L273 TraceCheckUtils]: 7: Hoare triple {18770#(<= main_~i0~0 0)} assume !!(~i0~0 < ~n0~0);#t~post3 := ~i0~0;~i0~0 := 1 + #t~post3;havoc #t~post3;#t~post4 := ~k~0;~k~0 := 1 + #t~post4;havoc #t~post4; {18771#(<= main_~i0~0 1)} is VALID [2018-11-23 13:12:02,891 INFO L273 TraceCheckUtils]: 8: Hoare triple {18771#(<= main_~i0~0 1)} assume !!(~i0~0 < ~n0~0);#t~post3 := ~i0~0;~i0~0 := 1 + #t~post3;havoc #t~post3;#t~post4 := ~k~0;~k~0 := 1 + #t~post4;havoc #t~post4; {18772#(<= main_~i0~0 2)} is VALID [2018-11-23 13:12:02,892 INFO L273 TraceCheckUtils]: 9: Hoare triple {18772#(<= main_~i0~0 2)} assume !!(~i0~0 < ~n0~0);#t~post3 := ~i0~0;~i0~0 := 1 + #t~post3;havoc #t~post3;#t~post4 := ~k~0;~k~0 := 1 + #t~post4;havoc #t~post4; {18773#(<= main_~i0~0 3)} is VALID [2018-11-23 13:12:02,892 INFO L273 TraceCheckUtils]: 10: Hoare triple {18773#(<= main_~i0~0 3)} assume !(~i0~0 < ~n0~0); {18774#(<= main_~n0~0 3)} is VALID [2018-11-23 13:12:02,938 INFO L273 TraceCheckUtils]: 11: Hoare triple {18774#(<= main_~n0~0 3)} ~i1~0 := 0; {18775#(<= (+ main_~i1~0 main_~n0~0) 3)} is VALID [2018-11-23 13:12:02,941 INFO L273 TraceCheckUtils]: 12: Hoare triple {18775#(<= (+ main_~i1~0 main_~n0~0) 3)} assume !!(~i1~0 < ~n1~0);#t~post5 := ~i1~0;~i1~0 := 1 + #t~post5;havoc #t~post5;#t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {18776#(<= (+ main_~i1~0 main_~n0~0) 4)} is VALID [2018-11-23 13:12:02,942 INFO L273 TraceCheckUtils]: 13: Hoare triple {18776#(<= (+ main_~i1~0 main_~n0~0) 4)} assume !!(~i1~0 < ~n1~0);#t~post5 := ~i1~0;~i1~0 := 1 + #t~post5;havoc #t~post5;#t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {18777#(<= (+ main_~i1~0 main_~n0~0) 5)} is VALID [2018-11-23 13:12:02,943 INFO L273 TraceCheckUtils]: 14: Hoare triple {18777#(<= (+ main_~i1~0 main_~n0~0) 5)} assume !!(~i1~0 < ~n1~0);#t~post5 := ~i1~0;~i1~0 := 1 + #t~post5;havoc #t~post5;#t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {18778#(<= (+ main_~i1~0 main_~n0~0) 6)} is VALID [2018-11-23 13:12:02,943 INFO L273 TraceCheckUtils]: 15: Hoare triple {18778#(<= (+ main_~i1~0 main_~n0~0) 6)} assume !(~i1~0 < ~n1~0); {18779#(<= (+ main_~n0~0 main_~n1~0) 6)} is VALID [2018-11-23 13:12:02,944 INFO L273 TraceCheckUtils]: 16: Hoare triple {18779#(<= (+ main_~n0~0 main_~n1~0) 6)} ~j1~0 := 0; {18780#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 6))} is VALID [2018-11-23 13:12:02,944 INFO L273 TraceCheckUtils]: 17: Hoare triple {18780#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 6))} assume !!(~j1~0 < ~n0~0 + ~n1~0); {18780#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 6))} is VALID [2018-11-23 13:12:02,944 INFO L256 TraceCheckUtils]: 18: Hoare triple {18780#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 6))} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {18768#true} is VALID [2018-11-23 13:12:02,944 INFO L273 TraceCheckUtils]: 19: Hoare triple {18768#true} ~cond := #in~cond; {18768#true} is VALID [2018-11-23 13:12:02,945 INFO L273 TraceCheckUtils]: 20: Hoare triple {18768#true} assume !(0 == ~cond); {18768#true} is VALID [2018-11-23 13:12:02,945 INFO L273 TraceCheckUtils]: 21: Hoare triple {18768#true} assume true; {18768#true} is VALID [2018-11-23 13:12:02,945 INFO L268 TraceCheckUtils]: 22: Hoare quadruple {18768#true} {18780#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 6))} #70#return; {18780#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 6))} is VALID [2018-11-23 13:12:02,946 INFO L273 TraceCheckUtils]: 23: Hoare triple {18780#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 6))} #t~post7 := ~j1~0;~j1~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~k~0;~k~0 := #t~post8 - 1;havoc #t~post8; {18781#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 5))} is VALID [2018-11-23 13:12:02,947 INFO L273 TraceCheckUtils]: 24: Hoare triple {18781#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 5))} assume !!(~j1~0 < ~n0~0 + ~n1~0); {18781#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 5))} is VALID [2018-11-23 13:12:02,947 INFO L256 TraceCheckUtils]: 25: Hoare triple {18781#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 5))} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {18768#true} is VALID [2018-11-23 13:12:02,947 INFO L273 TraceCheckUtils]: 26: Hoare triple {18768#true} ~cond := #in~cond; {18768#true} is VALID [2018-11-23 13:12:02,947 INFO L273 TraceCheckUtils]: 27: Hoare triple {18768#true} assume !(0 == ~cond); {18768#true} is VALID [2018-11-23 13:12:02,948 INFO L273 TraceCheckUtils]: 28: Hoare triple {18768#true} assume true; {18768#true} is VALID [2018-11-23 13:12:02,950 INFO L268 TraceCheckUtils]: 29: Hoare quadruple {18768#true} {18781#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 5))} #70#return; {18781#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 5))} is VALID [2018-11-23 13:12:02,951 INFO L273 TraceCheckUtils]: 30: Hoare triple {18781#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 5))} #t~post7 := ~j1~0;~j1~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~k~0;~k~0 := #t~post8 - 1;havoc #t~post8; {18782#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 4))} is VALID [2018-11-23 13:12:02,952 INFO L273 TraceCheckUtils]: 31: Hoare triple {18782#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 4))} assume !!(~j1~0 < ~n0~0 + ~n1~0); {18782#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 4))} is VALID [2018-11-23 13:12:02,952 INFO L256 TraceCheckUtils]: 32: Hoare triple {18782#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 4))} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {18768#true} is VALID [2018-11-23 13:12:02,952 INFO L273 TraceCheckUtils]: 33: Hoare triple {18768#true} ~cond := #in~cond; {18768#true} is VALID [2018-11-23 13:12:02,952 INFO L273 TraceCheckUtils]: 34: Hoare triple {18768#true} assume !(0 == ~cond); {18768#true} is VALID [2018-11-23 13:12:02,952 INFO L273 TraceCheckUtils]: 35: Hoare triple {18768#true} assume true; {18768#true} is VALID [2018-11-23 13:12:02,953 INFO L268 TraceCheckUtils]: 36: Hoare quadruple {18768#true} {18782#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 4))} #70#return; {18782#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 4))} is VALID [2018-11-23 13:12:02,954 INFO L273 TraceCheckUtils]: 37: Hoare triple {18782#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 4))} #t~post7 := ~j1~0;~j1~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~k~0;~k~0 := #t~post8 - 1;havoc #t~post8; {18783#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 3))} is VALID [2018-11-23 13:12:02,955 INFO L273 TraceCheckUtils]: 38: Hoare triple {18783#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 3))} assume !!(~j1~0 < ~n0~0 + ~n1~0); {18783#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 3))} is VALID [2018-11-23 13:12:02,955 INFO L256 TraceCheckUtils]: 39: Hoare triple {18783#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 3))} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {18768#true} is VALID [2018-11-23 13:12:02,955 INFO L273 TraceCheckUtils]: 40: Hoare triple {18768#true} ~cond := #in~cond; {18768#true} is VALID [2018-11-23 13:12:02,955 INFO L273 TraceCheckUtils]: 41: Hoare triple {18768#true} assume !(0 == ~cond); {18768#true} is VALID [2018-11-23 13:12:02,955 INFO L273 TraceCheckUtils]: 42: Hoare triple {18768#true} assume true; {18768#true} is VALID [2018-11-23 13:12:02,956 INFO L268 TraceCheckUtils]: 43: Hoare quadruple {18768#true} {18783#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 3))} #70#return; {18783#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 3))} is VALID [2018-11-23 13:12:02,957 INFO L273 TraceCheckUtils]: 44: Hoare triple {18783#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 3))} #t~post7 := ~j1~0;~j1~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~k~0;~k~0 := #t~post8 - 1;havoc #t~post8; {18784#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 2))} is VALID [2018-11-23 13:12:02,957 INFO L273 TraceCheckUtils]: 45: Hoare triple {18784#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 2))} assume !!(~j1~0 < ~n0~0 + ~n1~0); {18784#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 2))} is VALID [2018-11-23 13:12:02,958 INFO L256 TraceCheckUtils]: 46: Hoare triple {18784#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 2))} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {18768#true} is VALID [2018-11-23 13:12:02,958 INFO L273 TraceCheckUtils]: 47: Hoare triple {18768#true} ~cond := #in~cond; {18768#true} is VALID [2018-11-23 13:12:02,958 INFO L273 TraceCheckUtils]: 48: Hoare triple {18768#true} assume !(0 == ~cond); {18768#true} is VALID [2018-11-23 13:12:02,958 INFO L273 TraceCheckUtils]: 49: Hoare triple {18768#true} assume true; {18768#true} is VALID [2018-11-23 13:12:02,959 INFO L268 TraceCheckUtils]: 50: Hoare quadruple {18768#true} {18784#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 2))} #70#return; {18784#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 2))} is VALID [2018-11-23 13:12:02,960 INFO L273 TraceCheckUtils]: 51: Hoare triple {18784#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 2))} #t~post7 := ~j1~0;~j1~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~k~0;~k~0 := #t~post8 - 1;havoc #t~post8; {18785#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 1))} is VALID [2018-11-23 13:12:02,960 INFO L273 TraceCheckUtils]: 52: Hoare triple {18785#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 1))} assume !!(~j1~0 < ~n0~0 + ~n1~0); {18785#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 1))} is VALID [2018-11-23 13:12:02,960 INFO L256 TraceCheckUtils]: 53: Hoare triple {18785#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 1))} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {18768#true} is VALID [2018-11-23 13:12:02,961 INFO L273 TraceCheckUtils]: 54: Hoare triple {18768#true} ~cond := #in~cond; {18768#true} is VALID [2018-11-23 13:12:02,961 INFO L273 TraceCheckUtils]: 55: Hoare triple {18768#true} assume !(0 == ~cond); {18768#true} is VALID [2018-11-23 13:12:02,961 INFO L273 TraceCheckUtils]: 56: Hoare triple {18768#true} assume true; {18768#true} is VALID [2018-11-23 13:12:02,962 INFO L268 TraceCheckUtils]: 57: Hoare quadruple {18768#true} {18785#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 1))} #70#return; {18785#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 1))} is VALID [2018-11-23 13:12:02,962 INFO L273 TraceCheckUtils]: 58: Hoare triple {18785#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 1))} #t~post7 := ~j1~0;~j1~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~k~0;~k~0 := #t~post8 - 1;havoc #t~post8; {18786#(<= (+ main_~n0~0 main_~n1~0) main_~j1~0)} is VALID [2018-11-23 13:12:02,963 INFO L273 TraceCheckUtils]: 59: Hoare triple {18786#(<= (+ main_~n0~0 main_~n1~0) main_~j1~0)} assume !!(~j1~0 < ~n0~0 + ~n1~0); {18769#false} is VALID [2018-11-23 13:12:02,963 INFO L256 TraceCheckUtils]: 60: Hoare triple {18769#false} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {18769#false} is VALID [2018-11-23 13:12:02,963 INFO L273 TraceCheckUtils]: 61: Hoare triple {18769#false} ~cond := #in~cond; {18769#false} is VALID [2018-11-23 13:12:02,964 INFO L273 TraceCheckUtils]: 62: Hoare triple {18769#false} assume 0 == ~cond; {18769#false} is VALID [2018-11-23 13:12:02,964 INFO L273 TraceCheckUtils]: 63: Hoare triple {18769#false} assume !false; {18769#false} is VALID [2018-11-23 13:12:02,968 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 69 proven. 12 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2018-11-23 13:12:02,968 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:12:02,968 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:12:02,977 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:12:02,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:12:03,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:12:03,013 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:12:03,455 INFO L256 TraceCheckUtils]: 0: Hoare triple {18768#true} call ULTIMATE.init(); {18768#true} is VALID [2018-11-23 13:12:03,456 INFO L273 TraceCheckUtils]: 1: Hoare triple {18768#true} assume true; {18768#true} is VALID [2018-11-23 13:12:03,456 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {18768#true} {18768#true} #66#return; {18768#true} is VALID [2018-11-23 13:12:03,456 INFO L256 TraceCheckUtils]: 3: Hoare triple {18768#true} call #t~ret9 := main(); {18768#true} is VALID [2018-11-23 13:12:03,457 INFO L273 TraceCheckUtils]: 4: Hoare triple {18768#true} havoc ~n0~0;havoc ~n1~0;~i0~0 := 0;~k~0 := 0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n0~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~n1~0 := #t~nondet2;havoc #t~nondet2; {18770#(<= main_~i0~0 0)} is VALID [2018-11-23 13:12:03,457 INFO L273 TraceCheckUtils]: 5: Hoare triple {18770#(<= main_~i0~0 0)} assume !!(-1000000 <= ~n0~0 && ~n0~0 < 1000000); {18770#(<= main_~i0~0 0)} is VALID [2018-11-23 13:12:03,458 INFO L273 TraceCheckUtils]: 6: Hoare triple {18770#(<= main_~i0~0 0)} assume !!(-1000000 <= ~n1~0 && ~n1~0 < 1000000); {18770#(<= main_~i0~0 0)} is VALID [2018-11-23 13:12:03,458 INFO L273 TraceCheckUtils]: 7: Hoare triple {18770#(<= main_~i0~0 0)} assume !!(~i0~0 < ~n0~0);#t~post3 := ~i0~0;~i0~0 := 1 + #t~post3;havoc #t~post3;#t~post4 := ~k~0;~k~0 := 1 + #t~post4;havoc #t~post4; {18771#(<= main_~i0~0 1)} is VALID [2018-11-23 13:12:03,459 INFO L273 TraceCheckUtils]: 8: Hoare triple {18771#(<= main_~i0~0 1)} assume !!(~i0~0 < ~n0~0);#t~post3 := ~i0~0;~i0~0 := 1 + #t~post3;havoc #t~post3;#t~post4 := ~k~0;~k~0 := 1 + #t~post4;havoc #t~post4; {18772#(<= main_~i0~0 2)} is VALID [2018-11-23 13:12:03,459 INFO L273 TraceCheckUtils]: 9: Hoare triple {18772#(<= main_~i0~0 2)} assume !!(~i0~0 < ~n0~0);#t~post3 := ~i0~0;~i0~0 := 1 + #t~post3;havoc #t~post3;#t~post4 := ~k~0;~k~0 := 1 + #t~post4;havoc #t~post4; {18773#(<= main_~i0~0 3)} is VALID [2018-11-23 13:12:03,460 INFO L273 TraceCheckUtils]: 10: Hoare triple {18773#(<= main_~i0~0 3)} assume !(~i0~0 < ~n0~0); {18774#(<= main_~n0~0 3)} is VALID [2018-11-23 13:12:03,461 INFO L273 TraceCheckUtils]: 11: Hoare triple {18774#(<= main_~n0~0 3)} ~i1~0 := 0; {18823#(and (<= main_~i1~0 0) (<= main_~n0~0 3))} is VALID [2018-11-23 13:12:03,462 INFO L273 TraceCheckUtils]: 12: Hoare triple {18823#(and (<= main_~i1~0 0) (<= main_~n0~0 3))} assume !!(~i1~0 < ~n1~0);#t~post5 := ~i1~0;~i1~0 := 1 + #t~post5;havoc #t~post5;#t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {18827#(and (<= main_~n0~0 3) (<= main_~i1~0 1))} is VALID [2018-11-23 13:12:03,463 INFO L273 TraceCheckUtils]: 13: Hoare triple {18827#(and (<= main_~n0~0 3) (<= main_~i1~0 1))} assume !!(~i1~0 < ~n1~0);#t~post5 := ~i1~0;~i1~0 := 1 + #t~post5;havoc #t~post5;#t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {18831#(and (<= main_~i1~0 2) (<= main_~n0~0 3))} is VALID [2018-11-23 13:12:03,463 INFO L273 TraceCheckUtils]: 14: Hoare triple {18831#(and (<= main_~i1~0 2) (<= main_~n0~0 3))} assume !!(~i1~0 < ~n1~0);#t~post5 := ~i1~0;~i1~0 := 1 + #t~post5;havoc #t~post5;#t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {18835#(and (<= main_~n0~0 3) (<= main_~i1~0 3))} is VALID [2018-11-23 13:12:03,464 INFO L273 TraceCheckUtils]: 15: Hoare triple {18835#(and (<= main_~n0~0 3) (<= main_~i1~0 3))} assume !(~i1~0 < ~n1~0); {18839#(and (<= main_~n1~0 3) (<= main_~n0~0 3))} is VALID [2018-11-23 13:12:03,465 INFO L273 TraceCheckUtils]: 16: Hoare triple {18839#(and (<= main_~n1~0 3) (<= main_~n0~0 3))} ~j1~0 := 0; {18843#(and (<= main_~n1~0 3) (<= main_~n0~0 3) (<= 0 main_~j1~0))} is VALID [2018-11-23 13:12:03,466 INFO L273 TraceCheckUtils]: 17: Hoare triple {18843#(and (<= main_~n1~0 3) (<= main_~n0~0 3) (<= 0 main_~j1~0))} assume !!(~j1~0 < ~n0~0 + ~n1~0); {18843#(and (<= main_~n1~0 3) (<= main_~n0~0 3) (<= 0 main_~j1~0))} is VALID [2018-11-23 13:12:03,466 INFO L256 TraceCheckUtils]: 18: Hoare triple {18843#(and (<= main_~n1~0 3) (<= main_~n0~0 3) (<= 0 main_~j1~0))} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {18768#true} is VALID [2018-11-23 13:12:03,466 INFO L273 TraceCheckUtils]: 19: Hoare triple {18768#true} ~cond := #in~cond; {18768#true} is VALID [2018-11-23 13:12:03,466 INFO L273 TraceCheckUtils]: 20: Hoare triple {18768#true} assume !(0 == ~cond); {18768#true} is VALID [2018-11-23 13:12:03,467 INFO L273 TraceCheckUtils]: 21: Hoare triple {18768#true} assume true; {18768#true} is VALID [2018-11-23 13:12:03,467 INFO L268 TraceCheckUtils]: 22: Hoare quadruple {18768#true} {18843#(and (<= main_~n1~0 3) (<= main_~n0~0 3) (<= 0 main_~j1~0))} #70#return; {18843#(and (<= main_~n1~0 3) (<= main_~n0~0 3) (<= 0 main_~j1~0))} is VALID [2018-11-23 13:12:03,468 INFO L273 TraceCheckUtils]: 23: Hoare triple {18843#(and (<= main_~n1~0 3) (<= main_~n0~0 3) (<= 0 main_~j1~0))} #t~post7 := ~j1~0;~j1~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~k~0;~k~0 := #t~post8 - 1;havoc #t~post8; {18865#(and (<= 1 main_~j1~0) (<= main_~n1~0 3) (<= main_~n0~0 3))} is VALID [2018-11-23 13:12:03,469 INFO L273 TraceCheckUtils]: 24: Hoare triple {18865#(and (<= 1 main_~j1~0) (<= main_~n1~0 3) (<= main_~n0~0 3))} assume !!(~j1~0 < ~n0~0 + ~n1~0); {18865#(and (<= 1 main_~j1~0) (<= main_~n1~0 3) (<= main_~n0~0 3))} is VALID [2018-11-23 13:12:03,469 INFO L256 TraceCheckUtils]: 25: Hoare triple {18865#(and (<= 1 main_~j1~0) (<= main_~n1~0 3) (<= main_~n0~0 3))} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {18768#true} is VALID [2018-11-23 13:12:03,469 INFO L273 TraceCheckUtils]: 26: Hoare triple {18768#true} ~cond := #in~cond; {18768#true} is VALID [2018-11-23 13:12:03,469 INFO L273 TraceCheckUtils]: 27: Hoare triple {18768#true} assume !(0 == ~cond); {18768#true} is VALID [2018-11-23 13:12:03,469 INFO L273 TraceCheckUtils]: 28: Hoare triple {18768#true} assume true; {18768#true} is VALID [2018-11-23 13:12:03,470 INFO L268 TraceCheckUtils]: 29: Hoare quadruple {18768#true} {18865#(and (<= 1 main_~j1~0) (<= main_~n1~0 3) (<= main_~n0~0 3))} #70#return; {18865#(and (<= 1 main_~j1~0) (<= main_~n1~0 3) (<= main_~n0~0 3))} is VALID [2018-11-23 13:12:03,470 INFO L273 TraceCheckUtils]: 30: Hoare triple {18865#(and (<= 1 main_~j1~0) (<= main_~n1~0 3) (<= main_~n0~0 3))} #t~post7 := ~j1~0;~j1~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~k~0;~k~0 := #t~post8 - 1;havoc #t~post8; {18887#(and (<= main_~n1~0 3) (<= main_~n0~0 3) (<= 2 main_~j1~0))} is VALID [2018-11-23 13:12:03,471 INFO L273 TraceCheckUtils]: 31: Hoare triple {18887#(and (<= main_~n1~0 3) (<= main_~n0~0 3) (<= 2 main_~j1~0))} assume !!(~j1~0 < ~n0~0 + ~n1~0); {18887#(and (<= main_~n1~0 3) (<= main_~n0~0 3) (<= 2 main_~j1~0))} is VALID [2018-11-23 13:12:03,471 INFO L256 TraceCheckUtils]: 32: Hoare triple {18887#(and (<= main_~n1~0 3) (<= main_~n0~0 3) (<= 2 main_~j1~0))} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {18768#true} is VALID [2018-11-23 13:12:03,471 INFO L273 TraceCheckUtils]: 33: Hoare triple {18768#true} ~cond := #in~cond; {18768#true} is VALID [2018-11-23 13:12:03,471 INFO L273 TraceCheckUtils]: 34: Hoare triple {18768#true} assume !(0 == ~cond); {18768#true} is VALID [2018-11-23 13:12:03,471 INFO L273 TraceCheckUtils]: 35: Hoare triple {18768#true} assume true; {18768#true} is VALID [2018-11-23 13:12:03,472 INFO L268 TraceCheckUtils]: 36: Hoare quadruple {18768#true} {18887#(and (<= main_~n1~0 3) (<= main_~n0~0 3) (<= 2 main_~j1~0))} #70#return; {18887#(and (<= main_~n1~0 3) (<= main_~n0~0 3) (<= 2 main_~j1~0))} is VALID [2018-11-23 13:12:03,474 INFO L273 TraceCheckUtils]: 37: Hoare triple {18887#(and (<= main_~n1~0 3) (<= main_~n0~0 3) (<= 2 main_~j1~0))} #t~post7 := ~j1~0;~j1~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~k~0;~k~0 := #t~post8 - 1;havoc #t~post8; {18909#(and (<= main_~n1~0 3) (<= main_~n0~0 3) (<= 3 main_~j1~0))} is VALID [2018-11-23 13:12:03,476 INFO L273 TraceCheckUtils]: 38: Hoare triple {18909#(and (<= main_~n1~0 3) (<= main_~n0~0 3) (<= 3 main_~j1~0))} assume !!(~j1~0 < ~n0~0 + ~n1~0); {18909#(and (<= main_~n1~0 3) (<= main_~n0~0 3) (<= 3 main_~j1~0))} is VALID [2018-11-23 13:12:03,476 INFO L256 TraceCheckUtils]: 39: Hoare triple {18909#(and (<= main_~n1~0 3) (<= main_~n0~0 3) (<= 3 main_~j1~0))} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {18768#true} is VALID [2018-11-23 13:12:03,476 INFO L273 TraceCheckUtils]: 40: Hoare triple {18768#true} ~cond := #in~cond; {18768#true} is VALID [2018-11-23 13:12:03,476 INFO L273 TraceCheckUtils]: 41: Hoare triple {18768#true} assume !(0 == ~cond); {18768#true} is VALID [2018-11-23 13:12:03,477 INFO L273 TraceCheckUtils]: 42: Hoare triple {18768#true} assume true; {18768#true} is VALID [2018-11-23 13:12:03,486 INFO L268 TraceCheckUtils]: 43: Hoare quadruple {18768#true} {18909#(and (<= main_~n1~0 3) (<= main_~n0~0 3) (<= 3 main_~j1~0))} #70#return; {18909#(and (<= main_~n1~0 3) (<= main_~n0~0 3) (<= 3 main_~j1~0))} is VALID [2018-11-23 13:12:03,487 INFO L273 TraceCheckUtils]: 44: Hoare triple {18909#(and (<= main_~n1~0 3) (<= main_~n0~0 3) (<= 3 main_~j1~0))} #t~post7 := ~j1~0;~j1~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~k~0;~k~0 := #t~post8 - 1;havoc #t~post8; {18931#(and (<= main_~n1~0 3) (<= main_~n0~0 3) (<= 4 main_~j1~0))} is VALID [2018-11-23 13:12:03,487 INFO L273 TraceCheckUtils]: 45: Hoare triple {18931#(and (<= main_~n1~0 3) (<= main_~n0~0 3) (<= 4 main_~j1~0))} assume !!(~j1~0 < ~n0~0 + ~n1~0); {18931#(and (<= main_~n1~0 3) (<= main_~n0~0 3) (<= 4 main_~j1~0))} is VALID [2018-11-23 13:12:03,488 INFO L256 TraceCheckUtils]: 46: Hoare triple {18931#(and (<= main_~n1~0 3) (<= main_~n0~0 3) (<= 4 main_~j1~0))} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {18768#true} is VALID [2018-11-23 13:12:03,488 INFO L273 TraceCheckUtils]: 47: Hoare triple {18768#true} ~cond := #in~cond; {18768#true} is VALID [2018-11-23 13:12:03,488 INFO L273 TraceCheckUtils]: 48: Hoare triple {18768#true} assume !(0 == ~cond); {18768#true} is VALID [2018-11-23 13:12:03,488 INFO L273 TraceCheckUtils]: 49: Hoare triple {18768#true} assume true; {18768#true} is VALID [2018-11-23 13:12:03,488 INFO L268 TraceCheckUtils]: 50: Hoare quadruple {18768#true} {18931#(and (<= main_~n1~0 3) (<= main_~n0~0 3) (<= 4 main_~j1~0))} #70#return; {18931#(and (<= main_~n1~0 3) (<= main_~n0~0 3) (<= 4 main_~j1~0))} is VALID [2018-11-23 13:12:03,489 INFO L273 TraceCheckUtils]: 51: Hoare triple {18931#(and (<= main_~n1~0 3) (<= main_~n0~0 3) (<= 4 main_~j1~0))} #t~post7 := ~j1~0;~j1~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~k~0;~k~0 := #t~post8 - 1;havoc #t~post8; {18953#(and (<= main_~n1~0 3) (<= main_~n0~0 3) (<= 5 main_~j1~0))} is VALID [2018-11-23 13:12:03,489 INFO L273 TraceCheckUtils]: 52: Hoare triple {18953#(and (<= main_~n1~0 3) (<= main_~n0~0 3) (<= 5 main_~j1~0))} assume !!(~j1~0 < ~n0~0 + ~n1~0); {18953#(and (<= main_~n1~0 3) (<= main_~n0~0 3) (<= 5 main_~j1~0))} is VALID [2018-11-23 13:12:03,490 INFO L256 TraceCheckUtils]: 53: Hoare triple {18953#(and (<= main_~n1~0 3) (<= main_~n0~0 3) (<= 5 main_~j1~0))} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {18768#true} is VALID [2018-11-23 13:12:03,490 INFO L273 TraceCheckUtils]: 54: Hoare triple {18768#true} ~cond := #in~cond; {18768#true} is VALID [2018-11-23 13:12:03,490 INFO L273 TraceCheckUtils]: 55: Hoare triple {18768#true} assume !(0 == ~cond); {18768#true} is VALID [2018-11-23 13:12:03,490 INFO L273 TraceCheckUtils]: 56: Hoare triple {18768#true} assume true; {18768#true} is VALID [2018-11-23 13:12:03,490 INFO L268 TraceCheckUtils]: 57: Hoare quadruple {18768#true} {18953#(and (<= main_~n1~0 3) (<= main_~n0~0 3) (<= 5 main_~j1~0))} #70#return; {18953#(and (<= main_~n1~0 3) (<= main_~n0~0 3) (<= 5 main_~j1~0))} is VALID [2018-11-23 13:12:03,491 INFO L273 TraceCheckUtils]: 58: Hoare triple {18953#(and (<= main_~n1~0 3) (<= main_~n0~0 3) (<= 5 main_~j1~0))} #t~post7 := ~j1~0;~j1~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~k~0;~k~0 := #t~post8 - 1;havoc #t~post8; {18975#(and (<= 6 main_~j1~0) (<= main_~n1~0 3) (<= main_~n0~0 3))} is VALID [2018-11-23 13:12:03,491 INFO L273 TraceCheckUtils]: 59: Hoare triple {18975#(and (<= 6 main_~j1~0) (<= main_~n1~0 3) (<= main_~n0~0 3))} assume !!(~j1~0 < ~n0~0 + ~n1~0); {18769#false} is VALID [2018-11-23 13:12:03,491 INFO L256 TraceCheckUtils]: 60: Hoare triple {18769#false} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {18769#false} is VALID [2018-11-23 13:12:03,492 INFO L273 TraceCheckUtils]: 61: Hoare triple {18769#false} ~cond := #in~cond; {18769#false} is VALID [2018-11-23 13:12:03,492 INFO L273 TraceCheckUtils]: 62: Hoare triple {18769#false} assume 0 == ~cond; {18769#false} is VALID [2018-11-23 13:12:03,492 INFO L273 TraceCheckUtils]: 63: Hoare triple {18769#false} assume !false; {18769#false} is VALID [2018-11-23 13:12:03,498 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 69 proven. 12 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2018-11-23 13:12:03,516 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:12:03,516 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 31 [2018-11-23 13:12:03,516 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 64 [2018-11-23 13:12:03,517 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:12:03,517 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 31 states. [2018-11-23 13:12:03,588 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 80 edges. 80 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:12:03,588 INFO L459 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-11-23 13:12:03,588 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-11-23 13:12:03,589 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=184, Invalid=746, Unknown=0, NotChecked=0, Total=930 [2018-11-23 13:12:03,589 INFO L87 Difference]: Start difference. First operand 80 states and 88 transitions. Second operand 31 states. [2018-11-23 13:12:06,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:12:06,832 INFO L93 Difference]: Finished difference Result 214 states and 261 transitions. [2018-11-23 13:12:06,832 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-11-23 13:12:06,832 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 64 [2018-11-23 13:12:06,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:12:06,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-11-23 13:12:06,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 114 transitions. [2018-11-23 13:12:06,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-11-23 13:12:06,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 114 transitions. [2018-11-23 13:12:06,835 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 34 states and 114 transitions. [2018-11-23 13:12:06,994 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 114 edges. 114 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:12:06,998 INFO L225 Difference]: With dead ends: 214 [2018-11-23 13:12:06,998 INFO L226 Difference]: Without dead ends: 185 [2018-11-23 13:12:06,999 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 969 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=668, Invalid=2754, Unknown=0, NotChecked=0, Total=3422 [2018-11-23 13:12:07,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2018-11-23 13:12:07,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 80. [2018-11-23 13:12:07,316 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:12:07,316 INFO L82 GeneralOperation]: Start isEquivalent. First operand 185 states. Second operand 80 states. [2018-11-23 13:12:07,316 INFO L74 IsIncluded]: Start isIncluded. First operand 185 states. Second operand 80 states. [2018-11-23 13:12:07,317 INFO L87 Difference]: Start difference. First operand 185 states. Second operand 80 states. [2018-11-23 13:12:07,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:12:07,320 INFO L93 Difference]: Finished difference Result 185 states and 225 transitions. [2018-11-23 13:12:07,320 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 225 transitions. [2018-11-23 13:12:07,320 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:12:07,320 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:12:07,320 INFO L74 IsIncluded]: Start isIncluded. First operand 80 states. Second operand 185 states. [2018-11-23 13:12:07,320 INFO L87 Difference]: Start difference. First operand 80 states. Second operand 185 states. [2018-11-23 13:12:07,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:12:07,324 INFO L93 Difference]: Finished difference Result 185 states and 225 transitions. [2018-11-23 13:12:07,324 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 225 transitions. [2018-11-23 13:12:07,325 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:12:07,325 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:12:07,325 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:12:07,325 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:12:07,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2018-11-23 13:12:07,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 88 transitions. [2018-11-23 13:12:07,327 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 88 transitions. Word has length 64 [2018-11-23 13:12:07,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:12:07,327 INFO L480 AbstractCegarLoop]: Abstraction has 80 states and 88 transitions. [2018-11-23 13:12:07,327 INFO L481 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-11-23 13:12:07,327 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 88 transitions. [2018-11-23 13:12:07,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-11-23 13:12:07,328 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:12:07,328 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:12:07,328 INFO L423 AbstractCegarLoop]: === Iteration 32 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:12:07,328 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:12:07,328 INFO L82 PathProgramCache]: Analyzing trace with hash -317471505, now seen corresponding path program 14 times [2018-11-23 13:12:07,329 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:12:07,329 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:12:07,329 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:12:07,329 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:12:07,330 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:12:07,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:12:07,573 INFO L256 TraceCheckUtils]: 0: Hoare triple {19883#true} call ULTIMATE.init(); {19883#true} is VALID [2018-11-23 13:12:07,573 INFO L273 TraceCheckUtils]: 1: Hoare triple {19883#true} assume true; {19883#true} is VALID [2018-11-23 13:12:07,573 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {19883#true} {19883#true} #66#return; {19883#true} is VALID [2018-11-23 13:12:07,573 INFO L256 TraceCheckUtils]: 3: Hoare triple {19883#true} call #t~ret9 := main(); {19883#true} is VALID [2018-11-23 13:12:07,574 INFO L273 TraceCheckUtils]: 4: Hoare triple {19883#true} havoc ~n0~0;havoc ~n1~0;~i0~0 := 0;~k~0 := 0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n0~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~n1~0 := #t~nondet2;havoc #t~nondet2; {19885#(<= main_~i0~0 0)} is VALID [2018-11-23 13:12:07,575 INFO L273 TraceCheckUtils]: 5: Hoare triple {19885#(<= main_~i0~0 0)} assume !!(-1000000 <= ~n0~0 && ~n0~0 < 1000000); {19885#(<= main_~i0~0 0)} is VALID [2018-11-23 13:12:07,575 INFO L273 TraceCheckUtils]: 6: Hoare triple {19885#(<= main_~i0~0 0)} assume !!(-1000000 <= ~n1~0 && ~n1~0 < 1000000); {19885#(<= main_~i0~0 0)} is VALID [2018-11-23 13:12:07,576 INFO L273 TraceCheckUtils]: 7: Hoare triple {19885#(<= main_~i0~0 0)} assume !!(~i0~0 < ~n0~0);#t~post3 := ~i0~0;~i0~0 := 1 + #t~post3;havoc #t~post3;#t~post4 := ~k~0;~k~0 := 1 + #t~post4;havoc #t~post4; {19886#(<= main_~i0~0 1)} is VALID [2018-11-23 13:12:07,577 INFO L273 TraceCheckUtils]: 8: Hoare triple {19886#(<= main_~i0~0 1)} assume !!(~i0~0 < ~n0~0);#t~post3 := ~i0~0;~i0~0 := 1 + #t~post3;havoc #t~post3;#t~post4 := ~k~0;~k~0 := 1 + #t~post4;havoc #t~post4; {19887#(<= main_~i0~0 2)} is VALID [2018-11-23 13:12:07,578 INFO L273 TraceCheckUtils]: 9: Hoare triple {19887#(<= main_~i0~0 2)} assume !!(~i0~0 < ~n0~0);#t~post3 := ~i0~0;~i0~0 := 1 + #t~post3;havoc #t~post3;#t~post4 := ~k~0;~k~0 := 1 + #t~post4;havoc #t~post4; {19888#(<= main_~i0~0 3)} is VALID [2018-11-23 13:12:07,578 INFO L273 TraceCheckUtils]: 10: Hoare triple {19888#(<= main_~i0~0 3)} assume !!(~i0~0 < ~n0~0);#t~post3 := ~i0~0;~i0~0 := 1 + #t~post3;havoc #t~post3;#t~post4 := ~k~0;~k~0 := 1 + #t~post4;havoc #t~post4; {19889#(<= main_~i0~0 4)} is VALID [2018-11-23 13:12:07,579 INFO L273 TraceCheckUtils]: 11: Hoare triple {19889#(<= main_~i0~0 4)} assume !(~i0~0 < ~n0~0); {19890#(<= main_~n0~0 4)} is VALID [2018-11-23 13:12:07,580 INFO L273 TraceCheckUtils]: 12: Hoare triple {19890#(<= main_~n0~0 4)} ~i1~0 := 0; {19891#(<= (+ main_~i1~0 main_~n0~0) 4)} is VALID [2018-11-23 13:12:07,581 INFO L273 TraceCheckUtils]: 13: Hoare triple {19891#(<= (+ main_~i1~0 main_~n0~0) 4)} assume !!(~i1~0 < ~n1~0);#t~post5 := ~i1~0;~i1~0 := 1 + #t~post5;havoc #t~post5;#t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {19892#(<= (+ main_~i1~0 main_~n0~0) 5)} is VALID [2018-11-23 13:12:07,582 INFO L273 TraceCheckUtils]: 14: Hoare triple {19892#(<= (+ main_~i1~0 main_~n0~0) 5)} assume !!(~i1~0 < ~n1~0);#t~post5 := ~i1~0;~i1~0 := 1 + #t~post5;havoc #t~post5;#t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {19893#(<= (+ main_~i1~0 main_~n0~0) 6)} is VALID [2018-11-23 13:12:07,582 INFO L273 TraceCheckUtils]: 15: Hoare triple {19893#(<= (+ main_~i1~0 main_~n0~0) 6)} assume !(~i1~0 < ~n1~0); {19894#(<= (+ main_~n0~0 main_~n1~0) 6)} is VALID [2018-11-23 13:12:07,583 INFO L273 TraceCheckUtils]: 16: Hoare triple {19894#(<= (+ main_~n0~0 main_~n1~0) 6)} ~j1~0 := 0; {19895#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 6))} is VALID [2018-11-23 13:12:07,584 INFO L273 TraceCheckUtils]: 17: Hoare triple {19895#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 6))} assume !!(~j1~0 < ~n0~0 + ~n1~0); {19895#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 6))} is VALID [2018-11-23 13:12:07,584 INFO L256 TraceCheckUtils]: 18: Hoare triple {19895#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 6))} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {19883#true} is VALID [2018-11-23 13:12:07,584 INFO L273 TraceCheckUtils]: 19: Hoare triple {19883#true} ~cond := #in~cond; {19883#true} is VALID [2018-11-23 13:12:07,584 INFO L273 TraceCheckUtils]: 20: Hoare triple {19883#true} assume !(0 == ~cond); {19883#true} is VALID [2018-11-23 13:12:07,584 INFO L273 TraceCheckUtils]: 21: Hoare triple {19883#true} assume true; {19883#true} is VALID [2018-11-23 13:12:07,585 INFO L268 TraceCheckUtils]: 22: Hoare quadruple {19883#true} {19895#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 6))} #70#return; {19895#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 6))} is VALID [2018-11-23 13:12:07,586 INFO L273 TraceCheckUtils]: 23: Hoare triple {19895#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 6))} #t~post7 := ~j1~0;~j1~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~k~0;~k~0 := #t~post8 - 1;havoc #t~post8; {19896#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 5))} is VALID [2018-11-23 13:12:07,587 INFO L273 TraceCheckUtils]: 24: Hoare triple {19896#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 5))} assume !!(~j1~0 < ~n0~0 + ~n1~0); {19896#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 5))} is VALID [2018-11-23 13:12:07,587 INFO L256 TraceCheckUtils]: 25: Hoare triple {19896#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 5))} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {19883#true} is VALID [2018-11-23 13:12:07,587 INFO L273 TraceCheckUtils]: 26: Hoare triple {19883#true} ~cond := #in~cond; {19883#true} is VALID [2018-11-23 13:12:07,587 INFO L273 TraceCheckUtils]: 27: Hoare triple {19883#true} assume !(0 == ~cond); {19883#true} is VALID [2018-11-23 13:12:07,587 INFO L273 TraceCheckUtils]: 28: Hoare triple {19883#true} assume true; {19883#true} is VALID [2018-11-23 13:12:07,588 INFO L268 TraceCheckUtils]: 29: Hoare quadruple {19883#true} {19896#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 5))} #70#return; {19896#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 5))} is VALID [2018-11-23 13:12:07,589 INFO L273 TraceCheckUtils]: 30: Hoare triple {19896#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 5))} #t~post7 := ~j1~0;~j1~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~k~0;~k~0 := #t~post8 - 1;havoc #t~post8; {19897#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 4))} is VALID [2018-11-23 13:12:07,589 INFO L273 TraceCheckUtils]: 31: Hoare triple {19897#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 4))} assume !!(~j1~0 < ~n0~0 + ~n1~0); {19897#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 4))} is VALID [2018-11-23 13:12:07,589 INFO L256 TraceCheckUtils]: 32: Hoare triple {19897#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 4))} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {19883#true} is VALID [2018-11-23 13:12:07,589 INFO L273 TraceCheckUtils]: 33: Hoare triple {19883#true} ~cond := #in~cond; {19883#true} is VALID [2018-11-23 13:12:07,590 INFO L273 TraceCheckUtils]: 34: Hoare triple {19883#true} assume !(0 == ~cond); {19883#true} is VALID [2018-11-23 13:12:07,590 INFO L273 TraceCheckUtils]: 35: Hoare triple {19883#true} assume true; {19883#true} is VALID [2018-11-23 13:12:07,591 INFO L268 TraceCheckUtils]: 36: Hoare quadruple {19883#true} {19897#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 4))} #70#return; {19897#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 4))} is VALID [2018-11-23 13:12:07,595 INFO L273 TraceCheckUtils]: 37: Hoare triple {19897#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 4))} #t~post7 := ~j1~0;~j1~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~k~0;~k~0 := #t~post8 - 1;havoc #t~post8; {19898#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 3))} is VALID [2018-11-23 13:12:07,595 INFO L273 TraceCheckUtils]: 38: Hoare triple {19898#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 3))} assume !!(~j1~0 < ~n0~0 + ~n1~0); {19898#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 3))} is VALID [2018-11-23 13:12:07,596 INFO L256 TraceCheckUtils]: 39: Hoare triple {19898#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 3))} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {19883#true} is VALID [2018-11-23 13:12:07,596 INFO L273 TraceCheckUtils]: 40: Hoare triple {19883#true} ~cond := #in~cond; {19883#true} is VALID [2018-11-23 13:12:07,596 INFO L273 TraceCheckUtils]: 41: Hoare triple {19883#true} assume !(0 == ~cond); {19883#true} is VALID [2018-11-23 13:12:07,596 INFO L273 TraceCheckUtils]: 42: Hoare triple {19883#true} assume true; {19883#true} is VALID [2018-11-23 13:12:07,597 INFO L268 TraceCheckUtils]: 43: Hoare quadruple {19883#true} {19898#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 3))} #70#return; {19898#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 3))} is VALID [2018-11-23 13:12:07,597 INFO L273 TraceCheckUtils]: 44: Hoare triple {19898#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 3))} #t~post7 := ~j1~0;~j1~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~k~0;~k~0 := #t~post8 - 1;havoc #t~post8; {19899#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 2))} is VALID [2018-11-23 13:12:07,598 INFO L273 TraceCheckUtils]: 45: Hoare triple {19899#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 2))} assume !!(~j1~0 < ~n0~0 + ~n1~0); {19899#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 2))} is VALID [2018-11-23 13:12:07,598 INFO L256 TraceCheckUtils]: 46: Hoare triple {19899#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 2))} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {19883#true} is VALID [2018-11-23 13:12:07,598 INFO L273 TraceCheckUtils]: 47: Hoare triple {19883#true} ~cond := #in~cond; {19883#true} is VALID [2018-11-23 13:12:07,599 INFO L273 TraceCheckUtils]: 48: Hoare triple {19883#true} assume !(0 == ~cond); {19883#true} is VALID [2018-11-23 13:12:07,599 INFO L273 TraceCheckUtils]: 49: Hoare triple {19883#true} assume true; {19883#true} is VALID [2018-11-23 13:12:07,600 INFO L268 TraceCheckUtils]: 50: Hoare quadruple {19883#true} {19899#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 2))} #70#return; {19899#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 2))} is VALID [2018-11-23 13:12:07,601 INFO L273 TraceCheckUtils]: 51: Hoare triple {19899#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 2))} #t~post7 := ~j1~0;~j1~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~k~0;~k~0 := #t~post8 - 1;havoc #t~post8; {19900#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 1))} is VALID [2018-11-23 13:12:07,602 INFO L273 TraceCheckUtils]: 52: Hoare triple {19900#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 1))} assume !!(~j1~0 < ~n0~0 + ~n1~0); {19900#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 1))} is VALID [2018-11-23 13:12:07,602 INFO L256 TraceCheckUtils]: 53: Hoare triple {19900#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 1))} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {19883#true} is VALID [2018-11-23 13:12:07,602 INFO L273 TraceCheckUtils]: 54: Hoare triple {19883#true} ~cond := #in~cond; {19883#true} is VALID [2018-11-23 13:12:07,602 INFO L273 TraceCheckUtils]: 55: Hoare triple {19883#true} assume !(0 == ~cond); {19883#true} is VALID [2018-11-23 13:12:07,602 INFO L273 TraceCheckUtils]: 56: Hoare triple {19883#true} assume true; {19883#true} is VALID [2018-11-23 13:12:07,604 INFO L268 TraceCheckUtils]: 57: Hoare quadruple {19883#true} {19900#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 1))} #70#return; {19900#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 1))} is VALID [2018-11-23 13:12:07,605 INFO L273 TraceCheckUtils]: 58: Hoare triple {19900#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 1))} #t~post7 := ~j1~0;~j1~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~k~0;~k~0 := #t~post8 - 1;havoc #t~post8; {19901#(<= (+ main_~n0~0 main_~n1~0) main_~j1~0)} is VALID [2018-11-23 13:12:07,605 INFO L273 TraceCheckUtils]: 59: Hoare triple {19901#(<= (+ main_~n0~0 main_~n1~0) main_~j1~0)} assume !!(~j1~0 < ~n0~0 + ~n1~0); {19884#false} is VALID [2018-11-23 13:12:07,606 INFO L256 TraceCheckUtils]: 60: Hoare triple {19884#false} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {19884#false} is VALID [2018-11-23 13:12:07,606 INFO L273 TraceCheckUtils]: 61: Hoare triple {19884#false} ~cond := #in~cond; {19884#false} is VALID [2018-11-23 13:12:07,606 INFO L273 TraceCheckUtils]: 62: Hoare triple {19884#false} assume 0 == ~cond; {19884#false} is VALID [2018-11-23 13:12:07,606 INFO L273 TraceCheckUtils]: 63: Hoare triple {19884#false} assume !false; {19884#false} is VALID [2018-11-23 13:12:07,610 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 69 proven. 13 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2018-11-23 13:12:07,611 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:12:07,611 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:12:07,621 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 13:12:07,666 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 13:12:07,666 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:12:07,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:12:07,678 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:12:08,093 INFO L256 TraceCheckUtils]: 0: Hoare triple {19883#true} call ULTIMATE.init(); {19883#true} is VALID [2018-11-23 13:12:08,093 INFO L273 TraceCheckUtils]: 1: Hoare triple {19883#true} assume true; {19883#true} is VALID [2018-11-23 13:12:08,094 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {19883#true} {19883#true} #66#return; {19883#true} is VALID [2018-11-23 13:12:08,094 INFO L256 TraceCheckUtils]: 3: Hoare triple {19883#true} call #t~ret9 := main(); {19883#true} is VALID [2018-11-23 13:12:08,094 INFO L273 TraceCheckUtils]: 4: Hoare triple {19883#true} havoc ~n0~0;havoc ~n1~0;~i0~0 := 0;~k~0 := 0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n0~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~n1~0 := #t~nondet2;havoc #t~nondet2; {19885#(<= main_~i0~0 0)} is VALID [2018-11-23 13:12:08,094 INFO L273 TraceCheckUtils]: 5: Hoare triple {19885#(<= main_~i0~0 0)} assume !!(-1000000 <= ~n0~0 && ~n0~0 < 1000000); {19885#(<= main_~i0~0 0)} is VALID [2018-11-23 13:12:08,095 INFO L273 TraceCheckUtils]: 6: Hoare triple {19885#(<= main_~i0~0 0)} assume !!(-1000000 <= ~n1~0 && ~n1~0 < 1000000); {19885#(<= main_~i0~0 0)} is VALID [2018-11-23 13:12:08,095 INFO L273 TraceCheckUtils]: 7: Hoare triple {19885#(<= main_~i0~0 0)} assume !!(~i0~0 < ~n0~0);#t~post3 := ~i0~0;~i0~0 := 1 + #t~post3;havoc #t~post3;#t~post4 := ~k~0;~k~0 := 1 + #t~post4;havoc #t~post4; {19886#(<= main_~i0~0 1)} is VALID [2018-11-23 13:12:08,096 INFO L273 TraceCheckUtils]: 8: Hoare triple {19886#(<= main_~i0~0 1)} assume !!(~i0~0 < ~n0~0);#t~post3 := ~i0~0;~i0~0 := 1 + #t~post3;havoc #t~post3;#t~post4 := ~k~0;~k~0 := 1 + #t~post4;havoc #t~post4; {19887#(<= main_~i0~0 2)} is VALID [2018-11-23 13:12:08,097 INFO L273 TraceCheckUtils]: 9: Hoare triple {19887#(<= main_~i0~0 2)} assume !!(~i0~0 < ~n0~0);#t~post3 := ~i0~0;~i0~0 := 1 + #t~post3;havoc #t~post3;#t~post4 := ~k~0;~k~0 := 1 + #t~post4;havoc #t~post4; {19888#(<= main_~i0~0 3)} is VALID [2018-11-23 13:12:08,098 INFO L273 TraceCheckUtils]: 10: Hoare triple {19888#(<= main_~i0~0 3)} assume !!(~i0~0 < ~n0~0);#t~post3 := ~i0~0;~i0~0 := 1 + #t~post3;havoc #t~post3;#t~post4 := ~k~0;~k~0 := 1 + #t~post4;havoc #t~post4; {19889#(<= main_~i0~0 4)} is VALID [2018-11-23 13:12:08,099 INFO L273 TraceCheckUtils]: 11: Hoare triple {19889#(<= main_~i0~0 4)} assume !(~i0~0 < ~n0~0); {19890#(<= main_~n0~0 4)} is VALID [2018-11-23 13:12:08,099 INFO L273 TraceCheckUtils]: 12: Hoare triple {19890#(<= main_~n0~0 4)} ~i1~0 := 0; {19941#(and (<= main_~n0~0 4) (<= main_~i1~0 0))} is VALID [2018-11-23 13:12:08,100 INFO L273 TraceCheckUtils]: 13: Hoare triple {19941#(and (<= main_~n0~0 4) (<= main_~i1~0 0))} assume !!(~i1~0 < ~n1~0);#t~post5 := ~i1~0;~i1~0 := 1 + #t~post5;havoc #t~post5;#t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {19945#(and (<= main_~n0~0 4) (<= main_~i1~0 1))} is VALID [2018-11-23 13:12:08,101 INFO L273 TraceCheckUtils]: 14: Hoare triple {19945#(and (<= main_~n0~0 4) (<= main_~i1~0 1))} assume !!(~i1~0 < ~n1~0);#t~post5 := ~i1~0;~i1~0 := 1 + #t~post5;havoc #t~post5;#t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {19949#(and (<= main_~n0~0 4) (<= main_~i1~0 2))} is VALID [2018-11-23 13:12:08,102 INFO L273 TraceCheckUtils]: 15: Hoare triple {19949#(and (<= main_~n0~0 4) (<= main_~i1~0 2))} assume !(~i1~0 < ~n1~0); {19953#(and (<= main_~n0~0 4) (<= main_~n1~0 2))} is VALID [2018-11-23 13:12:08,102 INFO L273 TraceCheckUtils]: 16: Hoare triple {19953#(and (<= main_~n0~0 4) (<= main_~n1~0 2))} ~j1~0 := 0; {19957#(and (<= main_~n0~0 4) (<= main_~n1~0 2) (<= 0 main_~j1~0))} is VALID [2018-11-23 13:12:08,103 INFO L273 TraceCheckUtils]: 17: Hoare triple {19957#(and (<= main_~n0~0 4) (<= main_~n1~0 2) (<= 0 main_~j1~0))} assume !!(~j1~0 < ~n0~0 + ~n1~0); {19957#(and (<= main_~n0~0 4) (<= main_~n1~0 2) (<= 0 main_~j1~0))} is VALID [2018-11-23 13:12:08,103 INFO L256 TraceCheckUtils]: 18: Hoare triple {19957#(and (<= main_~n0~0 4) (<= main_~n1~0 2) (<= 0 main_~j1~0))} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {19883#true} is VALID [2018-11-23 13:12:08,103 INFO L273 TraceCheckUtils]: 19: Hoare triple {19883#true} ~cond := #in~cond; {19883#true} is VALID [2018-11-23 13:12:08,104 INFO L273 TraceCheckUtils]: 20: Hoare triple {19883#true} assume !(0 == ~cond); {19883#true} is VALID [2018-11-23 13:12:08,104 INFO L273 TraceCheckUtils]: 21: Hoare triple {19883#true} assume true; {19883#true} is VALID [2018-11-23 13:12:08,105 INFO L268 TraceCheckUtils]: 22: Hoare quadruple {19883#true} {19957#(and (<= main_~n0~0 4) (<= main_~n1~0 2) (<= 0 main_~j1~0))} #70#return; {19957#(and (<= main_~n0~0 4) (<= main_~n1~0 2) (<= 0 main_~j1~0))} is VALID [2018-11-23 13:12:08,106 INFO L273 TraceCheckUtils]: 23: Hoare triple {19957#(and (<= main_~n0~0 4) (<= main_~n1~0 2) (<= 0 main_~j1~0))} #t~post7 := ~j1~0;~j1~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~k~0;~k~0 := #t~post8 - 1;havoc #t~post8; {19979#(and (<= main_~n0~0 4) (<= 1 main_~j1~0) (<= main_~n1~0 2))} is VALID [2018-11-23 13:12:08,107 INFO L273 TraceCheckUtils]: 24: Hoare triple {19979#(and (<= main_~n0~0 4) (<= 1 main_~j1~0) (<= main_~n1~0 2))} assume !!(~j1~0 < ~n0~0 + ~n1~0); {19979#(and (<= main_~n0~0 4) (<= 1 main_~j1~0) (<= main_~n1~0 2))} is VALID [2018-11-23 13:12:08,107 INFO L256 TraceCheckUtils]: 25: Hoare triple {19979#(and (<= main_~n0~0 4) (<= 1 main_~j1~0) (<= main_~n1~0 2))} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {19883#true} is VALID [2018-11-23 13:12:08,107 INFO L273 TraceCheckUtils]: 26: Hoare triple {19883#true} ~cond := #in~cond; {19883#true} is VALID [2018-11-23 13:12:08,107 INFO L273 TraceCheckUtils]: 27: Hoare triple {19883#true} assume !(0 == ~cond); {19883#true} is VALID [2018-11-23 13:12:08,107 INFO L273 TraceCheckUtils]: 28: Hoare triple {19883#true} assume true; {19883#true} is VALID [2018-11-23 13:12:08,108 INFO L268 TraceCheckUtils]: 29: Hoare quadruple {19883#true} {19979#(and (<= main_~n0~0 4) (<= 1 main_~j1~0) (<= main_~n1~0 2))} #70#return; {19979#(and (<= main_~n0~0 4) (<= 1 main_~j1~0) (<= main_~n1~0 2))} is VALID [2018-11-23 13:12:08,109 INFO L273 TraceCheckUtils]: 30: Hoare triple {19979#(and (<= main_~n0~0 4) (<= 1 main_~j1~0) (<= main_~n1~0 2))} #t~post7 := ~j1~0;~j1~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~k~0;~k~0 := #t~post8 - 1;havoc #t~post8; {20001#(and (<= main_~n0~0 4) (<= main_~n1~0 2) (<= 2 main_~j1~0))} is VALID [2018-11-23 13:12:08,110 INFO L273 TraceCheckUtils]: 31: Hoare triple {20001#(and (<= main_~n0~0 4) (<= main_~n1~0 2) (<= 2 main_~j1~0))} assume !!(~j1~0 < ~n0~0 + ~n1~0); {20001#(and (<= main_~n0~0 4) (<= main_~n1~0 2) (<= 2 main_~j1~0))} is VALID [2018-11-23 13:12:08,110 INFO L256 TraceCheckUtils]: 32: Hoare triple {20001#(and (<= main_~n0~0 4) (<= main_~n1~0 2) (<= 2 main_~j1~0))} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {19883#true} is VALID [2018-11-23 13:12:08,110 INFO L273 TraceCheckUtils]: 33: Hoare triple {19883#true} ~cond := #in~cond; {19883#true} is VALID [2018-11-23 13:12:08,110 INFO L273 TraceCheckUtils]: 34: Hoare triple {19883#true} assume !(0 == ~cond); {19883#true} is VALID [2018-11-23 13:12:08,110 INFO L273 TraceCheckUtils]: 35: Hoare triple {19883#true} assume true; {19883#true} is VALID [2018-11-23 13:12:08,111 INFO L268 TraceCheckUtils]: 36: Hoare quadruple {19883#true} {20001#(and (<= main_~n0~0 4) (<= main_~n1~0 2) (<= 2 main_~j1~0))} #70#return; {20001#(and (<= main_~n0~0 4) (<= main_~n1~0 2) (<= 2 main_~j1~0))} is VALID [2018-11-23 13:12:08,111 INFO L273 TraceCheckUtils]: 37: Hoare triple {20001#(and (<= main_~n0~0 4) (<= main_~n1~0 2) (<= 2 main_~j1~0))} #t~post7 := ~j1~0;~j1~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~k~0;~k~0 := #t~post8 - 1;havoc #t~post8; {20023#(and (<= main_~n0~0 4) (<= main_~n1~0 2) (<= 3 main_~j1~0))} is VALID [2018-11-23 13:12:08,112 INFO L273 TraceCheckUtils]: 38: Hoare triple {20023#(and (<= main_~n0~0 4) (<= main_~n1~0 2) (<= 3 main_~j1~0))} assume !!(~j1~0 < ~n0~0 + ~n1~0); {20023#(and (<= main_~n0~0 4) (<= main_~n1~0 2) (<= 3 main_~j1~0))} is VALID [2018-11-23 13:12:08,112 INFO L256 TraceCheckUtils]: 39: Hoare triple {20023#(and (<= main_~n0~0 4) (<= main_~n1~0 2) (<= 3 main_~j1~0))} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {19883#true} is VALID [2018-11-23 13:12:08,112 INFO L273 TraceCheckUtils]: 40: Hoare triple {19883#true} ~cond := #in~cond; {19883#true} is VALID [2018-11-23 13:12:08,112 INFO L273 TraceCheckUtils]: 41: Hoare triple {19883#true} assume !(0 == ~cond); {19883#true} is VALID [2018-11-23 13:12:08,112 INFO L273 TraceCheckUtils]: 42: Hoare triple {19883#true} assume true; {19883#true} is VALID [2018-11-23 13:12:08,113 INFO L268 TraceCheckUtils]: 43: Hoare quadruple {19883#true} {20023#(and (<= main_~n0~0 4) (<= main_~n1~0 2) (<= 3 main_~j1~0))} #70#return; {20023#(and (<= main_~n0~0 4) (<= main_~n1~0 2) (<= 3 main_~j1~0))} is VALID [2018-11-23 13:12:08,114 INFO L273 TraceCheckUtils]: 44: Hoare triple {20023#(and (<= main_~n0~0 4) (<= main_~n1~0 2) (<= 3 main_~j1~0))} #t~post7 := ~j1~0;~j1~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~k~0;~k~0 := #t~post8 - 1;havoc #t~post8; {20045#(and (<= main_~n0~0 4) (<= main_~n1~0 2) (<= 4 main_~j1~0))} is VALID [2018-11-23 13:12:08,115 INFO L273 TraceCheckUtils]: 45: Hoare triple {20045#(and (<= main_~n0~0 4) (<= main_~n1~0 2) (<= 4 main_~j1~0))} assume !!(~j1~0 < ~n0~0 + ~n1~0); {20045#(and (<= main_~n0~0 4) (<= main_~n1~0 2) (<= 4 main_~j1~0))} is VALID [2018-11-23 13:12:08,115 INFO L256 TraceCheckUtils]: 46: Hoare triple {20045#(and (<= main_~n0~0 4) (<= main_~n1~0 2) (<= 4 main_~j1~0))} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {19883#true} is VALID [2018-11-23 13:12:08,115 INFO L273 TraceCheckUtils]: 47: Hoare triple {19883#true} ~cond := #in~cond; {19883#true} is VALID [2018-11-23 13:12:08,115 INFO L273 TraceCheckUtils]: 48: Hoare triple {19883#true} assume !(0 == ~cond); {19883#true} is VALID [2018-11-23 13:12:08,116 INFO L273 TraceCheckUtils]: 49: Hoare triple {19883#true} assume true; {19883#true} is VALID [2018-11-23 13:12:08,116 INFO L268 TraceCheckUtils]: 50: Hoare quadruple {19883#true} {20045#(and (<= main_~n0~0 4) (<= main_~n1~0 2) (<= 4 main_~j1~0))} #70#return; {20045#(and (<= main_~n0~0 4) (<= main_~n1~0 2) (<= 4 main_~j1~0))} is VALID [2018-11-23 13:12:08,117 INFO L273 TraceCheckUtils]: 51: Hoare triple {20045#(and (<= main_~n0~0 4) (<= main_~n1~0 2) (<= 4 main_~j1~0))} #t~post7 := ~j1~0;~j1~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~k~0;~k~0 := #t~post8 - 1;havoc #t~post8; {20067#(and (<= main_~n0~0 4) (<= main_~n1~0 2) (<= 5 main_~j1~0))} is VALID [2018-11-23 13:12:08,118 INFO L273 TraceCheckUtils]: 52: Hoare triple {20067#(and (<= main_~n0~0 4) (<= main_~n1~0 2) (<= 5 main_~j1~0))} assume !!(~j1~0 < ~n0~0 + ~n1~0); {20067#(and (<= main_~n0~0 4) (<= main_~n1~0 2) (<= 5 main_~j1~0))} is VALID [2018-11-23 13:12:08,118 INFO L256 TraceCheckUtils]: 53: Hoare triple {20067#(and (<= main_~n0~0 4) (<= main_~n1~0 2) (<= 5 main_~j1~0))} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {19883#true} is VALID [2018-11-23 13:12:08,118 INFO L273 TraceCheckUtils]: 54: Hoare triple {19883#true} ~cond := #in~cond; {19883#true} is VALID [2018-11-23 13:12:08,118 INFO L273 TraceCheckUtils]: 55: Hoare triple {19883#true} assume !(0 == ~cond); {19883#true} is VALID [2018-11-23 13:12:08,118 INFO L273 TraceCheckUtils]: 56: Hoare triple {19883#true} assume true; {19883#true} is VALID [2018-11-23 13:12:08,119 INFO L268 TraceCheckUtils]: 57: Hoare quadruple {19883#true} {20067#(and (<= main_~n0~0 4) (<= main_~n1~0 2) (<= 5 main_~j1~0))} #70#return; {20067#(and (<= main_~n0~0 4) (<= main_~n1~0 2) (<= 5 main_~j1~0))} is VALID [2018-11-23 13:12:08,120 INFO L273 TraceCheckUtils]: 58: Hoare triple {20067#(and (<= main_~n0~0 4) (<= main_~n1~0 2) (<= 5 main_~j1~0))} #t~post7 := ~j1~0;~j1~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~k~0;~k~0 := #t~post8 - 1;havoc #t~post8; {20089#(and (<= main_~n0~0 4) (<= 6 main_~j1~0) (<= main_~n1~0 2))} is VALID [2018-11-23 13:12:08,120 INFO L273 TraceCheckUtils]: 59: Hoare triple {20089#(and (<= main_~n0~0 4) (<= 6 main_~j1~0) (<= main_~n1~0 2))} assume !!(~j1~0 < ~n0~0 + ~n1~0); {19884#false} is VALID [2018-11-23 13:12:08,121 INFO L256 TraceCheckUtils]: 60: Hoare triple {19884#false} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {19884#false} is VALID [2018-11-23 13:12:08,121 INFO L273 TraceCheckUtils]: 61: Hoare triple {19884#false} ~cond := #in~cond; {19884#false} is VALID [2018-11-23 13:12:08,121 INFO L273 TraceCheckUtils]: 62: Hoare triple {19884#false} assume 0 == ~cond; {19884#false} is VALID [2018-11-23 13:12:08,121 INFO L273 TraceCheckUtils]: 63: Hoare triple {19884#false} assume !false; {19884#false} is VALID [2018-11-23 13:12:08,126 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 69 proven. 13 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2018-11-23 13:12:08,144 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:12:08,145 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 30 [2018-11-23 13:12:08,145 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 64 [2018-11-23 13:12:08,145 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:12:08,145 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 30 states. [2018-11-23 13:12:08,233 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 79 edges. 79 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:12:08,233 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-11-23 13:12:08,233 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-11-23 13:12:08,234 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=175, Invalid=695, Unknown=0, NotChecked=0, Total=870 [2018-11-23 13:12:08,234 INFO L87 Difference]: Start difference. First operand 80 states and 88 transitions. Second operand 30 states. [2018-11-23 13:12:11,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:12:11,863 INFO L93 Difference]: Finished difference Result 238 states and 293 transitions. [2018-11-23 13:12:11,863 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-11-23 13:12:11,863 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 64 [2018-11-23 13:12:11,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:12:11,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-23 13:12:11,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 123 transitions. [2018-11-23 13:12:11,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-23 13:12:11,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 123 transitions. [2018-11-23 13:12:11,866 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 35 states and 123 transitions. [2018-11-23 13:12:11,984 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 123 edges. 123 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:12:11,989 INFO L225 Difference]: With dead ends: 238 [2018-11-23 13:12:11,989 INFO L226 Difference]: Without dead ends: 209 [2018-11-23 13:12:11,990 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 928 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=649, Invalid=2657, Unknown=0, NotChecked=0, Total=3306 [2018-11-23 13:12:11,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2018-11-23 13:12:12,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 80. [2018-11-23 13:12:12,356 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:12:12,356 INFO L82 GeneralOperation]: Start isEquivalent. First operand 209 states. Second operand 80 states. [2018-11-23 13:12:12,357 INFO L74 IsIncluded]: Start isIncluded. First operand 209 states. Second operand 80 states. [2018-11-23 13:12:12,357 INFO L87 Difference]: Start difference. First operand 209 states. Second operand 80 states. [2018-11-23 13:12:12,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:12:12,361 INFO L93 Difference]: Finished difference Result 209 states and 257 transitions. [2018-11-23 13:12:12,361 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 257 transitions. [2018-11-23 13:12:12,361 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:12:12,362 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:12:12,362 INFO L74 IsIncluded]: Start isIncluded. First operand 80 states. Second operand 209 states. [2018-11-23 13:12:12,362 INFO L87 Difference]: Start difference. First operand 80 states. Second operand 209 states. [2018-11-23 13:12:12,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:12:12,365 INFO L93 Difference]: Finished difference Result 209 states and 257 transitions. [2018-11-23 13:12:12,366 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 257 transitions. [2018-11-23 13:12:12,366 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:12:12,366 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:12:12,366 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:12:12,366 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:12:12,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2018-11-23 13:12:12,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 88 transitions. [2018-11-23 13:12:12,368 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 88 transitions. Word has length 64 [2018-11-23 13:12:12,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:12:12,368 INFO L480 AbstractCegarLoop]: Abstraction has 80 states and 88 transitions. [2018-11-23 13:12:12,368 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-11-23 13:12:12,368 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 88 transitions. [2018-11-23 13:12:12,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-11-23 13:12:12,369 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:12:12,369 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:12:12,369 INFO L423 AbstractCegarLoop]: === Iteration 33 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:12:12,369 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:12:12,369 INFO L82 PathProgramCache]: Analyzing trace with hash -1802404370, now seen corresponding path program 15 times [2018-11-23 13:12:12,369 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:12:12,369 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:12:12,370 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:12:12,370 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:12:12,370 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:12:12,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:12:12,681 INFO L256 TraceCheckUtils]: 0: Hoare triple {21086#true} call ULTIMATE.init(); {21086#true} is VALID [2018-11-23 13:12:12,682 INFO L273 TraceCheckUtils]: 1: Hoare triple {21086#true} assume true; {21086#true} is VALID [2018-11-23 13:12:12,682 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {21086#true} {21086#true} #66#return; {21086#true} is VALID [2018-11-23 13:12:12,682 INFO L256 TraceCheckUtils]: 3: Hoare triple {21086#true} call #t~ret9 := main(); {21086#true} is VALID [2018-11-23 13:12:12,683 INFO L273 TraceCheckUtils]: 4: Hoare triple {21086#true} havoc ~n0~0;havoc ~n1~0;~i0~0 := 0;~k~0 := 0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n0~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~n1~0 := #t~nondet2;havoc #t~nondet2; {21088#(<= main_~i0~0 0)} is VALID [2018-11-23 13:12:12,683 INFO L273 TraceCheckUtils]: 5: Hoare triple {21088#(<= main_~i0~0 0)} assume !!(-1000000 <= ~n0~0 && ~n0~0 < 1000000); {21088#(<= main_~i0~0 0)} is VALID [2018-11-23 13:12:12,684 INFO L273 TraceCheckUtils]: 6: Hoare triple {21088#(<= main_~i0~0 0)} assume !!(-1000000 <= ~n1~0 && ~n1~0 < 1000000); {21088#(<= main_~i0~0 0)} is VALID [2018-11-23 13:12:12,685 INFO L273 TraceCheckUtils]: 7: Hoare triple {21088#(<= main_~i0~0 0)} assume !!(~i0~0 < ~n0~0);#t~post3 := ~i0~0;~i0~0 := 1 + #t~post3;havoc #t~post3;#t~post4 := ~k~0;~k~0 := 1 + #t~post4;havoc #t~post4; {21089#(<= main_~i0~0 1)} is VALID [2018-11-23 13:12:12,686 INFO L273 TraceCheckUtils]: 8: Hoare triple {21089#(<= main_~i0~0 1)} assume !!(~i0~0 < ~n0~0);#t~post3 := ~i0~0;~i0~0 := 1 + #t~post3;havoc #t~post3;#t~post4 := ~k~0;~k~0 := 1 + #t~post4;havoc #t~post4; {21090#(<= main_~i0~0 2)} is VALID [2018-11-23 13:12:12,686 INFO L273 TraceCheckUtils]: 9: Hoare triple {21090#(<= main_~i0~0 2)} assume !!(~i0~0 < ~n0~0);#t~post3 := ~i0~0;~i0~0 := 1 + #t~post3;havoc #t~post3;#t~post4 := ~k~0;~k~0 := 1 + #t~post4;havoc #t~post4; {21091#(<= main_~i0~0 3)} is VALID [2018-11-23 13:12:12,687 INFO L273 TraceCheckUtils]: 10: Hoare triple {21091#(<= main_~i0~0 3)} assume !!(~i0~0 < ~n0~0);#t~post3 := ~i0~0;~i0~0 := 1 + #t~post3;havoc #t~post3;#t~post4 := ~k~0;~k~0 := 1 + #t~post4;havoc #t~post4; {21092#(<= main_~i0~0 4)} is VALID [2018-11-23 13:12:12,688 INFO L273 TraceCheckUtils]: 11: Hoare triple {21092#(<= main_~i0~0 4)} assume !!(~i0~0 < ~n0~0);#t~post3 := ~i0~0;~i0~0 := 1 + #t~post3;havoc #t~post3;#t~post4 := ~k~0;~k~0 := 1 + #t~post4;havoc #t~post4; {21093#(<= main_~i0~0 5)} is VALID [2018-11-23 13:12:12,689 INFO L273 TraceCheckUtils]: 12: Hoare triple {21093#(<= main_~i0~0 5)} assume !(~i0~0 < ~n0~0); {21094#(<= main_~n0~0 5)} is VALID [2018-11-23 13:12:12,689 INFO L273 TraceCheckUtils]: 13: Hoare triple {21094#(<= main_~n0~0 5)} ~i1~0 := 0; {21095#(<= (+ main_~i1~0 main_~n0~0) 5)} is VALID [2018-11-23 13:12:12,690 INFO L273 TraceCheckUtils]: 14: Hoare triple {21095#(<= (+ main_~i1~0 main_~n0~0) 5)} assume !!(~i1~0 < ~n1~0);#t~post5 := ~i1~0;~i1~0 := 1 + #t~post5;havoc #t~post5;#t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {21096#(<= (+ main_~i1~0 main_~n0~0) 6)} is VALID [2018-11-23 13:12:12,691 INFO L273 TraceCheckUtils]: 15: Hoare triple {21096#(<= (+ main_~i1~0 main_~n0~0) 6)} assume !(~i1~0 < ~n1~0); {21097#(<= (+ main_~n0~0 main_~n1~0) 6)} is VALID [2018-11-23 13:12:12,692 INFO L273 TraceCheckUtils]: 16: Hoare triple {21097#(<= (+ main_~n0~0 main_~n1~0) 6)} ~j1~0 := 0; {21098#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 6))} is VALID [2018-11-23 13:12:12,692 INFO L273 TraceCheckUtils]: 17: Hoare triple {21098#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 6))} assume !!(~j1~0 < ~n0~0 + ~n1~0); {21098#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 6))} is VALID [2018-11-23 13:12:12,692 INFO L256 TraceCheckUtils]: 18: Hoare triple {21098#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 6))} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {21086#true} is VALID [2018-11-23 13:12:12,693 INFO L273 TraceCheckUtils]: 19: Hoare triple {21086#true} ~cond := #in~cond; {21086#true} is VALID [2018-11-23 13:12:12,693 INFO L273 TraceCheckUtils]: 20: Hoare triple {21086#true} assume !(0 == ~cond); {21086#true} is VALID [2018-11-23 13:12:12,693 INFO L273 TraceCheckUtils]: 21: Hoare triple {21086#true} assume true; {21086#true} is VALID [2018-11-23 13:12:12,694 INFO L268 TraceCheckUtils]: 22: Hoare quadruple {21086#true} {21098#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 6))} #70#return; {21098#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 6))} is VALID [2018-11-23 13:12:12,695 INFO L273 TraceCheckUtils]: 23: Hoare triple {21098#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 6))} #t~post7 := ~j1~0;~j1~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~k~0;~k~0 := #t~post8 - 1;havoc #t~post8; {21099#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 5))} is VALID [2018-11-23 13:12:12,695 INFO L273 TraceCheckUtils]: 24: Hoare triple {21099#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 5))} assume !!(~j1~0 < ~n0~0 + ~n1~0); {21099#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 5))} is VALID [2018-11-23 13:12:12,696 INFO L256 TraceCheckUtils]: 25: Hoare triple {21099#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 5))} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {21086#true} is VALID [2018-11-23 13:12:12,696 INFO L273 TraceCheckUtils]: 26: Hoare triple {21086#true} ~cond := #in~cond; {21086#true} is VALID [2018-11-23 13:12:12,696 INFO L273 TraceCheckUtils]: 27: Hoare triple {21086#true} assume !(0 == ~cond); {21086#true} is VALID [2018-11-23 13:12:12,696 INFO L273 TraceCheckUtils]: 28: Hoare triple {21086#true} assume true; {21086#true} is VALID [2018-11-23 13:12:12,697 INFO L268 TraceCheckUtils]: 29: Hoare quadruple {21086#true} {21099#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 5))} #70#return; {21099#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 5))} is VALID [2018-11-23 13:12:12,698 INFO L273 TraceCheckUtils]: 30: Hoare triple {21099#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 5))} #t~post7 := ~j1~0;~j1~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~k~0;~k~0 := #t~post8 - 1;havoc #t~post8; {21100#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 4))} is VALID [2018-11-23 13:12:12,698 INFO L273 TraceCheckUtils]: 31: Hoare triple {21100#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 4))} assume !!(~j1~0 < ~n0~0 + ~n1~0); {21100#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 4))} is VALID [2018-11-23 13:12:12,699 INFO L256 TraceCheckUtils]: 32: Hoare triple {21100#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 4))} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {21086#true} is VALID [2018-11-23 13:12:12,699 INFO L273 TraceCheckUtils]: 33: Hoare triple {21086#true} ~cond := #in~cond; {21086#true} is VALID [2018-11-23 13:12:12,699 INFO L273 TraceCheckUtils]: 34: Hoare triple {21086#true} assume !(0 == ~cond); {21086#true} is VALID [2018-11-23 13:12:12,699 INFO L273 TraceCheckUtils]: 35: Hoare triple {21086#true} assume true; {21086#true} is VALID [2018-11-23 13:12:12,700 INFO L268 TraceCheckUtils]: 36: Hoare quadruple {21086#true} {21100#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 4))} #70#return; {21100#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 4))} is VALID [2018-11-23 13:12:12,701 INFO L273 TraceCheckUtils]: 37: Hoare triple {21100#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 4))} #t~post7 := ~j1~0;~j1~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~k~0;~k~0 := #t~post8 - 1;havoc #t~post8; {21101#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 3))} is VALID [2018-11-23 13:12:12,701 INFO L273 TraceCheckUtils]: 38: Hoare triple {21101#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 3))} assume !!(~j1~0 < ~n0~0 + ~n1~0); {21101#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 3))} is VALID [2018-11-23 13:12:12,702 INFO L256 TraceCheckUtils]: 39: Hoare triple {21101#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 3))} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {21086#true} is VALID [2018-11-23 13:12:12,702 INFO L273 TraceCheckUtils]: 40: Hoare triple {21086#true} ~cond := #in~cond; {21086#true} is VALID [2018-11-23 13:12:12,702 INFO L273 TraceCheckUtils]: 41: Hoare triple {21086#true} assume !(0 == ~cond); {21086#true} is VALID [2018-11-23 13:12:12,702 INFO L273 TraceCheckUtils]: 42: Hoare triple {21086#true} assume true; {21086#true} is VALID [2018-11-23 13:12:12,703 INFO L268 TraceCheckUtils]: 43: Hoare quadruple {21086#true} {21101#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 3))} #70#return; {21101#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 3))} is VALID [2018-11-23 13:12:12,704 INFO L273 TraceCheckUtils]: 44: Hoare triple {21101#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 3))} #t~post7 := ~j1~0;~j1~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~k~0;~k~0 := #t~post8 - 1;havoc #t~post8; {21102#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 2))} is VALID [2018-11-23 13:12:12,704 INFO L273 TraceCheckUtils]: 45: Hoare triple {21102#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 2))} assume !!(~j1~0 < ~n0~0 + ~n1~0); {21102#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 2))} is VALID [2018-11-23 13:12:12,705 INFO L256 TraceCheckUtils]: 46: Hoare triple {21102#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 2))} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {21086#true} is VALID [2018-11-23 13:12:12,705 INFO L273 TraceCheckUtils]: 47: Hoare triple {21086#true} ~cond := #in~cond; {21086#true} is VALID [2018-11-23 13:12:12,705 INFO L273 TraceCheckUtils]: 48: Hoare triple {21086#true} assume !(0 == ~cond); {21086#true} is VALID [2018-11-23 13:12:12,705 INFO L273 TraceCheckUtils]: 49: Hoare triple {21086#true} assume true; {21086#true} is VALID [2018-11-23 13:12:12,706 INFO L268 TraceCheckUtils]: 50: Hoare quadruple {21086#true} {21102#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 2))} #70#return; {21102#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 2))} is VALID [2018-11-23 13:12:12,707 INFO L273 TraceCheckUtils]: 51: Hoare triple {21102#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 2))} #t~post7 := ~j1~0;~j1~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~k~0;~k~0 := #t~post8 - 1;havoc #t~post8; {21103#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 1))} is VALID [2018-11-23 13:12:12,707 INFO L273 TraceCheckUtils]: 52: Hoare triple {21103#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 1))} assume !!(~j1~0 < ~n0~0 + ~n1~0); {21103#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 1))} is VALID [2018-11-23 13:12:12,708 INFO L256 TraceCheckUtils]: 53: Hoare triple {21103#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 1))} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {21086#true} is VALID [2018-11-23 13:12:12,708 INFO L273 TraceCheckUtils]: 54: Hoare triple {21086#true} ~cond := #in~cond; {21086#true} is VALID [2018-11-23 13:12:12,708 INFO L273 TraceCheckUtils]: 55: Hoare triple {21086#true} assume !(0 == ~cond); {21086#true} is VALID [2018-11-23 13:12:12,708 INFO L273 TraceCheckUtils]: 56: Hoare triple {21086#true} assume true; {21086#true} is VALID [2018-11-23 13:12:12,709 INFO L268 TraceCheckUtils]: 57: Hoare quadruple {21086#true} {21103#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 1))} #70#return; {21103#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 1))} is VALID [2018-11-23 13:12:12,710 INFO L273 TraceCheckUtils]: 58: Hoare triple {21103#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 1))} #t~post7 := ~j1~0;~j1~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~k~0;~k~0 := #t~post8 - 1;havoc #t~post8; {21104#(<= (+ main_~n0~0 main_~n1~0) main_~j1~0)} is VALID [2018-11-23 13:12:12,710 INFO L273 TraceCheckUtils]: 59: Hoare triple {21104#(<= (+ main_~n0~0 main_~n1~0) main_~j1~0)} assume !!(~j1~0 < ~n0~0 + ~n1~0); {21087#false} is VALID [2018-11-23 13:12:12,710 INFO L256 TraceCheckUtils]: 60: Hoare triple {21087#false} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {21087#false} is VALID [2018-11-23 13:12:12,711 INFO L273 TraceCheckUtils]: 61: Hoare triple {21087#false} ~cond := #in~cond; {21087#false} is VALID [2018-11-23 13:12:12,711 INFO L273 TraceCheckUtils]: 62: Hoare triple {21087#false} assume 0 == ~cond; {21087#false} is VALID [2018-11-23 13:12:12,711 INFO L273 TraceCheckUtils]: 63: Hoare triple {21087#false} assume !false; {21087#false} is VALID [2018-11-23 13:12:12,714 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 69 proven. 16 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2018-11-23 13:12:12,714 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:12:12,714 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:12:12,723 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 13:12:12,747 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2018-11-23 13:12:12,748 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:12:12,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:12:12,761 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:12:13,284 INFO L256 TraceCheckUtils]: 0: Hoare triple {21086#true} call ULTIMATE.init(); {21086#true} is VALID [2018-11-23 13:12:13,285 INFO L273 TraceCheckUtils]: 1: Hoare triple {21086#true} assume true; {21086#true} is VALID [2018-11-23 13:12:13,285 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {21086#true} {21086#true} #66#return; {21086#true} is VALID [2018-11-23 13:12:13,285 INFO L256 TraceCheckUtils]: 3: Hoare triple {21086#true} call #t~ret9 := main(); {21086#true} is VALID [2018-11-23 13:12:13,286 INFO L273 TraceCheckUtils]: 4: Hoare triple {21086#true} havoc ~n0~0;havoc ~n1~0;~i0~0 := 0;~k~0 := 0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n0~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~n1~0 := #t~nondet2;havoc #t~nondet2; {21088#(<= main_~i0~0 0)} is VALID [2018-11-23 13:12:13,286 INFO L273 TraceCheckUtils]: 5: Hoare triple {21088#(<= main_~i0~0 0)} assume !!(-1000000 <= ~n0~0 && ~n0~0 < 1000000); {21088#(<= main_~i0~0 0)} is VALID [2018-11-23 13:12:13,287 INFO L273 TraceCheckUtils]: 6: Hoare triple {21088#(<= main_~i0~0 0)} assume !!(-1000000 <= ~n1~0 && ~n1~0 < 1000000); {21088#(<= main_~i0~0 0)} is VALID [2018-11-23 13:12:13,287 INFO L273 TraceCheckUtils]: 7: Hoare triple {21088#(<= main_~i0~0 0)} assume !!(~i0~0 < ~n0~0);#t~post3 := ~i0~0;~i0~0 := 1 + #t~post3;havoc #t~post3;#t~post4 := ~k~0;~k~0 := 1 + #t~post4;havoc #t~post4; {21089#(<= main_~i0~0 1)} is VALID [2018-11-23 13:12:13,288 INFO L273 TraceCheckUtils]: 8: Hoare triple {21089#(<= main_~i0~0 1)} assume !!(~i0~0 < ~n0~0);#t~post3 := ~i0~0;~i0~0 := 1 + #t~post3;havoc #t~post3;#t~post4 := ~k~0;~k~0 := 1 + #t~post4;havoc #t~post4; {21090#(<= main_~i0~0 2)} is VALID [2018-11-23 13:12:13,288 INFO L273 TraceCheckUtils]: 9: Hoare triple {21090#(<= main_~i0~0 2)} assume !!(~i0~0 < ~n0~0);#t~post3 := ~i0~0;~i0~0 := 1 + #t~post3;havoc #t~post3;#t~post4 := ~k~0;~k~0 := 1 + #t~post4;havoc #t~post4; {21091#(<= main_~i0~0 3)} is VALID [2018-11-23 13:12:13,289 INFO L273 TraceCheckUtils]: 10: Hoare triple {21091#(<= main_~i0~0 3)} assume !!(~i0~0 < ~n0~0);#t~post3 := ~i0~0;~i0~0 := 1 + #t~post3;havoc #t~post3;#t~post4 := ~k~0;~k~0 := 1 + #t~post4;havoc #t~post4; {21092#(<= main_~i0~0 4)} is VALID [2018-11-23 13:12:13,290 INFO L273 TraceCheckUtils]: 11: Hoare triple {21092#(<= main_~i0~0 4)} assume !!(~i0~0 < ~n0~0);#t~post3 := ~i0~0;~i0~0 := 1 + #t~post3;havoc #t~post3;#t~post4 := ~k~0;~k~0 := 1 + #t~post4;havoc #t~post4; {21093#(<= main_~i0~0 5)} is VALID [2018-11-23 13:12:13,291 INFO L273 TraceCheckUtils]: 12: Hoare triple {21093#(<= main_~i0~0 5)} assume !(~i0~0 < ~n0~0); {21094#(<= main_~n0~0 5)} is VALID [2018-11-23 13:12:13,291 INFO L273 TraceCheckUtils]: 13: Hoare triple {21094#(<= main_~n0~0 5)} ~i1~0 := 0; {21147#(and (<= main_~i1~0 0) (<= main_~n0~0 5))} is VALID [2018-11-23 13:12:13,313 INFO L273 TraceCheckUtils]: 14: Hoare triple {21147#(and (<= main_~i1~0 0) (<= main_~n0~0 5))} assume !!(~i1~0 < ~n1~0);#t~post5 := ~i1~0;~i1~0 := 1 + #t~post5;havoc #t~post5;#t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {21151#(and (<= main_~i1~0 1) (<= main_~n0~0 5))} is VALID [2018-11-23 13:12:13,327 INFO L273 TraceCheckUtils]: 15: Hoare triple {21151#(and (<= main_~i1~0 1) (<= main_~n0~0 5))} assume !(~i1~0 < ~n1~0); {21155#(and (<= main_~n1~0 1) (<= main_~n0~0 5))} is VALID [2018-11-23 13:12:13,336 INFO L273 TraceCheckUtils]: 16: Hoare triple {21155#(and (<= main_~n1~0 1) (<= main_~n0~0 5))} ~j1~0 := 0; {21159#(and (<= main_~n1~0 1) (<= 0 main_~j1~0) (<= main_~n0~0 5))} is VALID [2018-11-23 13:12:13,347 INFO L273 TraceCheckUtils]: 17: Hoare triple {21159#(and (<= main_~n1~0 1) (<= 0 main_~j1~0) (<= main_~n0~0 5))} assume !!(~j1~0 < ~n0~0 + ~n1~0); {21159#(and (<= main_~n1~0 1) (<= 0 main_~j1~0) (<= main_~n0~0 5))} is VALID [2018-11-23 13:12:13,347 INFO L256 TraceCheckUtils]: 18: Hoare triple {21159#(and (<= main_~n1~0 1) (<= 0 main_~j1~0) (<= main_~n0~0 5))} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {21086#true} is VALID [2018-11-23 13:12:13,347 INFO L273 TraceCheckUtils]: 19: Hoare triple {21086#true} ~cond := #in~cond; {21086#true} is VALID [2018-11-23 13:12:13,347 INFO L273 TraceCheckUtils]: 20: Hoare triple {21086#true} assume !(0 == ~cond); {21086#true} is VALID [2018-11-23 13:12:13,347 INFO L273 TraceCheckUtils]: 21: Hoare triple {21086#true} assume true; {21086#true} is VALID [2018-11-23 13:12:13,348 INFO L268 TraceCheckUtils]: 22: Hoare quadruple {21086#true} {21159#(and (<= main_~n1~0 1) (<= 0 main_~j1~0) (<= main_~n0~0 5))} #70#return; {21159#(and (<= main_~n1~0 1) (<= 0 main_~j1~0) (<= main_~n0~0 5))} is VALID [2018-11-23 13:12:13,349 INFO L273 TraceCheckUtils]: 23: Hoare triple {21159#(and (<= main_~n1~0 1) (<= 0 main_~j1~0) (<= main_~n0~0 5))} #t~post7 := ~j1~0;~j1~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~k~0;~k~0 := #t~post8 - 1;havoc #t~post8; {21181#(and (<= main_~n1~0 1) (<= 1 main_~j1~0) (<= main_~n0~0 5))} is VALID [2018-11-23 13:12:13,349 INFO L273 TraceCheckUtils]: 24: Hoare triple {21181#(and (<= main_~n1~0 1) (<= 1 main_~j1~0) (<= main_~n0~0 5))} assume !!(~j1~0 < ~n0~0 + ~n1~0); {21181#(and (<= main_~n1~0 1) (<= 1 main_~j1~0) (<= main_~n0~0 5))} is VALID [2018-11-23 13:12:13,349 INFO L256 TraceCheckUtils]: 25: Hoare triple {21181#(and (<= main_~n1~0 1) (<= 1 main_~j1~0) (<= main_~n0~0 5))} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {21086#true} is VALID [2018-11-23 13:12:13,349 INFO L273 TraceCheckUtils]: 26: Hoare triple {21086#true} ~cond := #in~cond; {21086#true} is VALID [2018-11-23 13:12:13,350 INFO L273 TraceCheckUtils]: 27: Hoare triple {21086#true} assume !(0 == ~cond); {21086#true} is VALID [2018-11-23 13:12:13,350 INFO L273 TraceCheckUtils]: 28: Hoare triple {21086#true} assume true; {21086#true} is VALID [2018-11-23 13:12:13,350 INFO L268 TraceCheckUtils]: 29: Hoare quadruple {21086#true} {21181#(and (<= main_~n1~0 1) (<= 1 main_~j1~0) (<= main_~n0~0 5))} #70#return; {21181#(and (<= main_~n1~0 1) (<= 1 main_~j1~0) (<= main_~n0~0 5))} is VALID [2018-11-23 13:12:13,351 INFO L273 TraceCheckUtils]: 30: Hoare triple {21181#(and (<= main_~n1~0 1) (<= 1 main_~j1~0) (<= main_~n0~0 5))} #t~post7 := ~j1~0;~j1~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~k~0;~k~0 := #t~post8 - 1;havoc #t~post8; {21203#(and (<= main_~n1~0 1) (<= main_~n0~0 5) (<= 2 main_~j1~0))} is VALID [2018-11-23 13:12:13,351 INFO L273 TraceCheckUtils]: 31: Hoare triple {21203#(and (<= main_~n1~0 1) (<= main_~n0~0 5) (<= 2 main_~j1~0))} assume !!(~j1~0 < ~n0~0 + ~n1~0); {21203#(and (<= main_~n1~0 1) (<= main_~n0~0 5) (<= 2 main_~j1~0))} is VALID [2018-11-23 13:12:13,351 INFO L256 TraceCheckUtils]: 32: Hoare triple {21203#(and (<= main_~n1~0 1) (<= main_~n0~0 5) (<= 2 main_~j1~0))} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {21086#true} is VALID [2018-11-23 13:12:13,352 INFO L273 TraceCheckUtils]: 33: Hoare triple {21086#true} ~cond := #in~cond; {21086#true} is VALID [2018-11-23 13:12:13,352 INFO L273 TraceCheckUtils]: 34: Hoare triple {21086#true} assume !(0 == ~cond); {21086#true} is VALID [2018-11-23 13:12:13,352 INFO L273 TraceCheckUtils]: 35: Hoare triple {21086#true} assume true; {21086#true} is VALID [2018-11-23 13:12:13,353 INFO L268 TraceCheckUtils]: 36: Hoare quadruple {21086#true} {21203#(and (<= main_~n1~0 1) (<= main_~n0~0 5) (<= 2 main_~j1~0))} #70#return; {21203#(and (<= main_~n1~0 1) (<= main_~n0~0 5) (<= 2 main_~j1~0))} is VALID [2018-11-23 13:12:13,354 INFO L273 TraceCheckUtils]: 37: Hoare triple {21203#(and (<= main_~n1~0 1) (<= main_~n0~0 5) (<= 2 main_~j1~0))} #t~post7 := ~j1~0;~j1~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~k~0;~k~0 := #t~post8 - 1;havoc #t~post8; {21225#(and (<= main_~n1~0 1) (<= 3 main_~j1~0) (<= main_~n0~0 5))} is VALID [2018-11-23 13:12:13,355 INFO L273 TraceCheckUtils]: 38: Hoare triple {21225#(and (<= main_~n1~0 1) (<= 3 main_~j1~0) (<= main_~n0~0 5))} assume !!(~j1~0 < ~n0~0 + ~n1~0); {21225#(and (<= main_~n1~0 1) (<= 3 main_~j1~0) (<= main_~n0~0 5))} is VALID [2018-11-23 13:12:13,355 INFO L256 TraceCheckUtils]: 39: Hoare triple {21225#(and (<= main_~n1~0 1) (<= 3 main_~j1~0) (<= main_~n0~0 5))} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {21086#true} is VALID [2018-11-23 13:12:13,355 INFO L273 TraceCheckUtils]: 40: Hoare triple {21086#true} ~cond := #in~cond; {21086#true} is VALID [2018-11-23 13:12:13,355 INFO L273 TraceCheckUtils]: 41: Hoare triple {21086#true} assume !(0 == ~cond); {21086#true} is VALID [2018-11-23 13:12:13,355 INFO L273 TraceCheckUtils]: 42: Hoare triple {21086#true} assume true; {21086#true} is VALID [2018-11-23 13:12:13,356 INFO L268 TraceCheckUtils]: 43: Hoare quadruple {21086#true} {21225#(and (<= main_~n1~0 1) (<= 3 main_~j1~0) (<= main_~n0~0 5))} #70#return; {21225#(and (<= main_~n1~0 1) (<= 3 main_~j1~0) (<= main_~n0~0 5))} is VALID [2018-11-23 13:12:13,357 INFO L273 TraceCheckUtils]: 44: Hoare triple {21225#(and (<= main_~n1~0 1) (<= 3 main_~j1~0) (<= main_~n0~0 5))} #t~post7 := ~j1~0;~j1~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~k~0;~k~0 := #t~post8 - 1;havoc #t~post8; {21247#(and (<= main_~n1~0 1) (<= 4 main_~j1~0) (<= main_~n0~0 5))} is VALID [2018-11-23 13:12:13,358 INFO L273 TraceCheckUtils]: 45: Hoare triple {21247#(and (<= main_~n1~0 1) (<= 4 main_~j1~0) (<= main_~n0~0 5))} assume !!(~j1~0 < ~n0~0 + ~n1~0); {21247#(and (<= main_~n1~0 1) (<= 4 main_~j1~0) (<= main_~n0~0 5))} is VALID [2018-11-23 13:12:13,358 INFO L256 TraceCheckUtils]: 46: Hoare triple {21247#(and (<= main_~n1~0 1) (<= 4 main_~j1~0) (<= main_~n0~0 5))} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {21086#true} is VALID [2018-11-23 13:12:13,358 INFO L273 TraceCheckUtils]: 47: Hoare triple {21086#true} ~cond := #in~cond; {21086#true} is VALID [2018-11-23 13:12:13,358 INFO L273 TraceCheckUtils]: 48: Hoare triple {21086#true} assume !(0 == ~cond); {21086#true} is VALID [2018-11-23 13:12:13,358 INFO L273 TraceCheckUtils]: 49: Hoare triple {21086#true} assume true; {21086#true} is VALID [2018-11-23 13:12:13,359 INFO L268 TraceCheckUtils]: 50: Hoare quadruple {21086#true} {21247#(and (<= main_~n1~0 1) (<= 4 main_~j1~0) (<= main_~n0~0 5))} #70#return; {21247#(and (<= main_~n1~0 1) (<= 4 main_~j1~0) (<= main_~n0~0 5))} is VALID [2018-11-23 13:12:13,359 INFO L273 TraceCheckUtils]: 51: Hoare triple {21247#(and (<= main_~n1~0 1) (<= 4 main_~j1~0) (<= main_~n0~0 5))} #t~post7 := ~j1~0;~j1~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~k~0;~k~0 := #t~post8 - 1;havoc #t~post8; {21269#(and (<= main_~n1~0 1) (<= main_~n0~0 5) (<= 5 main_~j1~0))} is VALID [2018-11-23 13:12:13,360 INFO L273 TraceCheckUtils]: 52: Hoare triple {21269#(and (<= main_~n1~0 1) (<= main_~n0~0 5) (<= 5 main_~j1~0))} assume !!(~j1~0 < ~n0~0 + ~n1~0); {21269#(and (<= main_~n1~0 1) (<= main_~n0~0 5) (<= 5 main_~j1~0))} is VALID [2018-11-23 13:12:13,360 INFO L256 TraceCheckUtils]: 53: Hoare triple {21269#(and (<= main_~n1~0 1) (<= main_~n0~0 5) (<= 5 main_~j1~0))} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {21086#true} is VALID [2018-11-23 13:12:13,360 INFO L273 TraceCheckUtils]: 54: Hoare triple {21086#true} ~cond := #in~cond; {21086#true} is VALID [2018-11-23 13:12:13,361 INFO L273 TraceCheckUtils]: 55: Hoare triple {21086#true} assume !(0 == ~cond); {21086#true} is VALID [2018-11-23 13:12:13,361 INFO L273 TraceCheckUtils]: 56: Hoare triple {21086#true} assume true; {21086#true} is VALID [2018-11-23 13:12:13,362 INFO L268 TraceCheckUtils]: 57: Hoare quadruple {21086#true} {21269#(and (<= main_~n1~0 1) (<= main_~n0~0 5) (<= 5 main_~j1~0))} #70#return; {21269#(and (<= main_~n1~0 1) (<= main_~n0~0 5) (<= 5 main_~j1~0))} is VALID [2018-11-23 13:12:13,362 INFO L273 TraceCheckUtils]: 58: Hoare triple {21269#(and (<= main_~n1~0 1) (<= main_~n0~0 5) (<= 5 main_~j1~0))} #t~post7 := ~j1~0;~j1~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~k~0;~k~0 := #t~post8 - 1;havoc #t~post8; {21291#(and (<= main_~n1~0 1) (<= 6 main_~j1~0) (<= main_~n0~0 5))} is VALID [2018-11-23 13:12:13,363 INFO L273 TraceCheckUtils]: 59: Hoare triple {21291#(and (<= main_~n1~0 1) (<= 6 main_~j1~0) (<= main_~n0~0 5))} assume !!(~j1~0 < ~n0~0 + ~n1~0); {21087#false} is VALID [2018-11-23 13:12:13,363 INFO L256 TraceCheckUtils]: 60: Hoare triple {21087#false} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {21087#false} is VALID [2018-11-23 13:12:13,363 INFO L273 TraceCheckUtils]: 61: Hoare triple {21087#false} ~cond := #in~cond; {21087#false} is VALID [2018-11-23 13:12:13,363 INFO L273 TraceCheckUtils]: 62: Hoare triple {21087#false} assume 0 == ~cond; {21087#false} is VALID [2018-11-23 13:12:13,363 INFO L273 TraceCheckUtils]: 63: Hoare triple {21087#false} assume !false; {21087#false} is VALID [2018-11-23 13:12:13,368 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 69 proven. 16 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2018-11-23 13:12:13,387 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:12:13,387 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 29 [2018-11-23 13:12:13,387 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 64 [2018-11-23 13:12:13,388 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:12:13,388 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 29 states. [2018-11-23 13:12:13,461 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-23 13:12:13,461 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-11-23 13:12:13,462 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-11-23 13:12:13,462 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=170, Invalid=642, Unknown=0, NotChecked=0, Total=812 [2018-11-23 13:12:13,463 INFO L87 Difference]: Start difference. First operand 80 states and 88 transitions. Second operand 29 states. [2018-11-23 13:12:18,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:12:18,098 INFO L93 Difference]: Finished difference Result 261 states and 324 transitions. [2018-11-23 13:12:18,099 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-11-23 13:12:18,099 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 64 [2018-11-23 13:12:18,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:12:18,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-11-23 13:12:18,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 130 transitions. [2018-11-23 13:12:18,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-11-23 13:12:18,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 130 transitions. [2018-11-23 13:12:18,103 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 34 states and 130 transitions. [2018-11-23 13:12:18,250 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 130 edges. 130 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:12:18,256 INFO L225 Difference]: With dead ends: 261 [2018-11-23 13:12:18,256 INFO L226 Difference]: Without dead ends: 232 [2018-11-23 13:12:18,257 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 803 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=595, Invalid=2375, Unknown=0, NotChecked=0, Total=2970 [2018-11-23 13:12:18,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2018-11-23 13:12:18,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 80. [2018-11-23 13:12:18,539 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:12:18,539 INFO L82 GeneralOperation]: Start isEquivalent. First operand 232 states. Second operand 80 states. [2018-11-23 13:12:18,540 INFO L74 IsIncluded]: Start isIncluded. First operand 232 states. Second operand 80 states. [2018-11-23 13:12:18,540 INFO L87 Difference]: Start difference. First operand 232 states. Second operand 80 states. [2018-11-23 13:12:18,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:12:18,545 INFO L93 Difference]: Finished difference Result 232 states and 288 transitions. [2018-11-23 13:12:18,545 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 288 transitions. [2018-11-23 13:12:18,546 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:12:18,546 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:12:18,546 INFO L74 IsIncluded]: Start isIncluded. First operand 80 states. Second operand 232 states. [2018-11-23 13:12:18,546 INFO L87 Difference]: Start difference. First operand 80 states. Second operand 232 states. [2018-11-23 13:12:18,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:12:18,552 INFO L93 Difference]: Finished difference Result 232 states and 288 transitions. [2018-11-23 13:12:18,552 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 288 transitions. [2018-11-23 13:12:18,552 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:12:18,553 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:12:18,553 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:12:18,553 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:12:18,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2018-11-23 13:12:18,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 88 transitions. [2018-11-23 13:12:18,554 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 88 transitions. Word has length 64 [2018-11-23 13:12:18,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:12:18,555 INFO L480 AbstractCegarLoop]: Abstraction has 80 states and 88 transitions. [2018-11-23 13:12:18,555 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-11-23 13:12:18,555 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 88 transitions. [2018-11-23 13:12:18,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-11-23 13:12:18,555 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:12:18,555 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:12:18,556 INFO L423 AbstractCegarLoop]: === Iteration 34 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:12:18,556 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:12:18,556 INFO L82 PathProgramCache]: Analyzing trace with hash -603379441, now seen corresponding path program 6 times [2018-11-23 13:12:18,556 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:12:18,556 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:12:18,557 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:12:18,557 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:12:18,557 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:12:18,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:12:18,942 INFO L256 TraceCheckUtils]: 0: Hoare triple {22369#true} call ULTIMATE.init(); {22369#true} is VALID [2018-11-23 13:12:18,942 INFO L273 TraceCheckUtils]: 1: Hoare triple {22369#true} assume true; {22369#true} is VALID [2018-11-23 13:12:18,942 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {22369#true} {22369#true} #66#return; {22369#true} is VALID [2018-11-23 13:12:18,943 INFO L256 TraceCheckUtils]: 3: Hoare triple {22369#true} call #t~ret9 := main(); {22369#true} is VALID [2018-11-23 13:12:18,943 INFO L273 TraceCheckUtils]: 4: Hoare triple {22369#true} havoc ~n0~0;havoc ~n1~0;~i0~0 := 0;~k~0 := 0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n0~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~n1~0 := #t~nondet2;havoc #t~nondet2; {22371#(<= main_~i0~0 0)} is VALID [2018-11-23 13:12:18,944 INFO L273 TraceCheckUtils]: 5: Hoare triple {22371#(<= main_~i0~0 0)} assume !!(-1000000 <= ~n0~0 && ~n0~0 < 1000000); {22371#(<= main_~i0~0 0)} is VALID [2018-11-23 13:12:18,944 INFO L273 TraceCheckUtils]: 6: Hoare triple {22371#(<= main_~i0~0 0)} assume !!(-1000000 <= ~n1~0 && ~n1~0 < 1000000); {22371#(<= main_~i0~0 0)} is VALID [2018-11-23 13:12:18,945 INFO L273 TraceCheckUtils]: 7: Hoare triple {22371#(<= main_~i0~0 0)} assume !!(~i0~0 < ~n0~0);#t~post3 := ~i0~0;~i0~0 := 1 + #t~post3;havoc #t~post3;#t~post4 := ~k~0;~k~0 := 1 + #t~post4;havoc #t~post4; {22372#(<= main_~i0~0 1)} is VALID [2018-11-23 13:12:18,945 INFO L273 TraceCheckUtils]: 8: Hoare triple {22372#(<= main_~i0~0 1)} assume !!(~i0~0 < ~n0~0);#t~post3 := ~i0~0;~i0~0 := 1 + #t~post3;havoc #t~post3;#t~post4 := ~k~0;~k~0 := 1 + #t~post4;havoc #t~post4; {22373#(<= main_~i0~0 2)} is VALID [2018-11-23 13:12:18,946 INFO L273 TraceCheckUtils]: 9: Hoare triple {22373#(<= main_~i0~0 2)} assume !!(~i0~0 < ~n0~0);#t~post3 := ~i0~0;~i0~0 := 1 + #t~post3;havoc #t~post3;#t~post4 := ~k~0;~k~0 := 1 + #t~post4;havoc #t~post4; {22374#(<= main_~i0~0 3)} is VALID [2018-11-23 13:12:18,947 INFO L273 TraceCheckUtils]: 10: Hoare triple {22374#(<= main_~i0~0 3)} assume !!(~i0~0 < ~n0~0);#t~post3 := ~i0~0;~i0~0 := 1 + #t~post3;havoc #t~post3;#t~post4 := ~k~0;~k~0 := 1 + #t~post4;havoc #t~post4; {22375#(<= main_~i0~0 4)} is VALID [2018-11-23 13:12:18,948 INFO L273 TraceCheckUtils]: 11: Hoare triple {22375#(<= main_~i0~0 4)} assume !!(~i0~0 < ~n0~0);#t~post3 := ~i0~0;~i0~0 := 1 + #t~post3;havoc #t~post3;#t~post4 := ~k~0;~k~0 := 1 + #t~post4;havoc #t~post4; {22376#(<= main_~i0~0 5)} is VALID [2018-11-23 13:12:18,948 INFO L273 TraceCheckUtils]: 12: Hoare triple {22376#(<= main_~i0~0 5)} assume !!(~i0~0 < ~n0~0);#t~post3 := ~i0~0;~i0~0 := 1 + #t~post3;havoc #t~post3;#t~post4 := ~k~0;~k~0 := 1 + #t~post4;havoc #t~post4; {22377#(<= main_~i0~0 6)} is VALID [2018-11-23 13:12:18,949 INFO L273 TraceCheckUtils]: 13: Hoare triple {22377#(<= main_~i0~0 6)} assume !(~i0~0 < ~n0~0); {22378#(<= main_~n0~0 6)} is VALID [2018-11-23 13:12:18,971 INFO L273 TraceCheckUtils]: 14: Hoare triple {22378#(<= main_~n0~0 6)} ~i1~0 := 0; {22379#(<= (+ main_~i1~0 main_~n0~0) 6)} is VALID [2018-11-23 13:12:18,990 INFO L273 TraceCheckUtils]: 15: Hoare triple {22379#(<= (+ main_~i1~0 main_~n0~0) 6)} assume !(~i1~0 < ~n1~0); {22380#(<= (+ main_~n0~0 main_~n1~0) 6)} is VALID [2018-11-23 13:12:19,000 INFO L273 TraceCheckUtils]: 16: Hoare triple {22380#(<= (+ main_~n0~0 main_~n1~0) 6)} ~j1~0 := 0; {22381#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 6))} is VALID [2018-11-23 13:12:19,001 INFO L273 TraceCheckUtils]: 17: Hoare triple {22381#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 6))} assume !!(~j1~0 < ~n0~0 + ~n1~0); {22381#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 6))} is VALID [2018-11-23 13:12:19,001 INFO L256 TraceCheckUtils]: 18: Hoare triple {22381#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 6))} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {22369#true} is VALID [2018-11-23 13:12:19,001 INFO L273 TraceCheckUtils]: 19: Hoare triple {22369#true} ~cond := #in~cond; {22369#true} is VALID [2018-11-23 13:12:19,001 INFO L273 TraceCheckUtils]: 20: Hoare triple {22369#true} assume !(0 == ~cond); {22369#true} is VALID [2018-11-23 13:12:19,001 INFO L273 TraceCheckUtils]: 21: Hoare triple {22369#true} assume true; {22369#true} is VALID [2018-11-23 13:12:19,002 INFO L268 TraceCheckUtils]: 22: Hoare quadruple {22369#true} {22381#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 6))} #70#return; {22381#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 6))} is VALID [2018-11-23 13:12:19,002 INFO L273 TraceCheckUtils]: 23: Hoare triple {22381#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 6))} #t~post7 := ~j1~0;~j1~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~k~0;~k~0 := #t~post8 - 1;havoc #t~post8; {22382#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 5))} is VALID [2018-11-23 13:12:19,003 INFO L273 TraceCheckUtils]: 24: Hoare triple {22382#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 5))} assume !!(~j1~0 < ~n0~0 + ~n1~0); {22382#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 5))} is VALID [2018-11-23 13:12:19,003 INFO L256 TraceCheckUtils]: 25: Hoare triple {22382#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 5))} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {22369#true} is VALID [2018-11-23 13:12:19,003 INFO L273 TraceCheckUtils]: 26: Hoare triple {22369#true} ~cond := #in~cond; {22369#true} is VALID [2018-11-23 13:12:19,004 INFO L273 TraceCheckUtils]: 27: Hoare triple {22369#true} assume !(0 == ~cond); {22369#true} is VALID [2018-11-23 13:12:19,004 INFO L273 TraceCheckUtils]: 28: Hoare triple {22369#true} assume true; {22369#true} is VALID [2018-11-23 13:12:19,005 INFO L268 TraceCheckUtils]: 29: Hoare quadruple {22369#true} {22382#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 5))} #70#return; {22382#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 5))} is VALID [2018-11-23 13:12:19,006 INFO L273 TraceCheckUtils]: 30: Hoare triple {22382#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 5))} #t~post7 := ~j1~0;~j1~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~k~0;~k~0 := #t~post8 - 1;havoc #t~post8; {22383#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 4))} is VALID [2018-11-23 13:12:19,006 INFO L273 TraceCheckUtils]: 31: Hoare triple {22383#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 4))} assume !!(~j1~0 < ~n0~0 + ~n1~0); {22383#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 4))} is VALID [2018-11-23 13:12:19,006 INFO L256 TraceCheckUtils]: 32: Hoare triple {22383#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 4))} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {22369#true} is VALID [2018-11-23 13:12:19,007 INFO L273 TraceCheckUtils]: 33: Hoare triple {22369#true} ~cond := #in~cond; {22369#true} is VALID [2018-11-23 13:12:19,007 INFO L273 TraceCheckUtils]: 34: Hoare triple {22369#true} assume !(0 == ~cond); {22369#true} is VALID [2018-11-23 13:12:19,007 INFO L273 TraceCheckUtils]: 35: Hoare triple {22369#true} assume true; {22369#true} is VALID [2018-11-23 13:12:19,008 INFO L268 TraceCheckUtils]: 36: Hoare quadruple {22369#true} {22383#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 4))} #70#return; {22383#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 4))} is VALID [2018-11-23 13:12:19,009 INFO L273 TraceCheckUtils]: 37: Hoare triple {22383#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 4))} #t~post7 := ~j1~0;~j1~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~k~0;~k~0 := #t~post8 - 1;havoc #t~post8; {22384#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 3))} is VALID [2018-11-23 13:12:19,009 INFO L273 TraceCheckUtils]: 38: Hoare triple {22384#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 3))} assume !!(~j1~0 < ~n0~0 + ~n1~0); {22384#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 3))} is VALID [2018-11-23 13:12:19,009 INFO L256 TraceCheckUtils]: 39: Hoare triple {22384#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 3))} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {22369#true} is VALID [2018-11-23 13:12:19,010 INFO L273 TraceCheckUtils]: 40: Hoare triple {22369#true} ~cond := #in~cond; {22369#true} is VALID [2018-11-23 13:12:19,010 INFO L273 TraceCheckUtils]: 41: Hoare triple {22369#true} assume !(0 == ~cond); {22369#true} is VALID [2018-11-23 13:12:19,010 INFO L273 TraceCheckUtils]: 42: Hoare triple {22369#true} assume true; {22369#true} is VALID [2018-11-23 13:12:19,011 INFO L268 TraceCheckUtils]: 43: Hoare quadruple {22369#true} {22384#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 3))} #70#return; {22384#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 3))} is VALID [2018-11-23 13:12:19,012 INFO L273 TraceCheckUtils]: 44: Hoare triple {22384#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 3))} #t~post7 := ~j1~0;~j1~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~k~0;~k~0 := #t~post8 - 1;havoc #t~post8; {22385#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 2))} is VALID [2018-11-23 13:12:19,012 INFO L273 TraceCheckUtils]: 45: Hoare triple {22385#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 2))} assume !!(~j1~0 < ~n0~0 + ~n1~0); {22385#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 2))} is VALID [2018-11-23 13:12:19,013 INFO L256 TraceCheckUtils]: 46: Hoare triple {22385#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 2))} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {22369#true} is VALID [2018-11-23 13:12:19,013 INFO L273 TraceCheckUtils]: 47: Hoare triple {22369#true} ~cond := #in~cond; {22369#true} is VALID [2018-11-23 13:12:19,013 INFO L273 TraceCheckUtils]: 48: Hoare triple {22369#true} assume !(0 == ~cond); {22369#true} is VALID [2018-11-23 13:12:19,013 INFO L273 TraceCheckUtils]: 49: Hoare triple {22369#true} assume true; {22369#true} is VALID [2018-11-23 13:12:19,014 INFO L268 TraceCheckUtils]: 50: Hoare quadruple {22369#true} {22385#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 2))} #70#return; {22385#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 2))} is VALID [2018-11-23 13:12:19,015 INFO L273 TraceCheckUtils]: 51: Hoare triple {22385#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 2))} #t~post7 := ~j1~0;~j1~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~k~0;~k~0 := #t~post8 - 1;havoc #t~post8; {22386#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 1))} is VALID [2018-11-23 13:12:19,015 INFO L273 TraceCheckUtils]: 52: Hoare triple {22386#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 1))} assume !!(~j1~0 < ~n0~0 + ~n1~0); {22386#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 1))} is VALID [2018-11-23 13:12:19,016 INFO L256 TraceCheckUtils]: 53: Hoare triple {22386#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 1))} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {22369#true} is VALID [2018-11-23 13:12:19,016 INFO L273 TraceCheckUtils]: 54: Hoare triple {22369#true} ~cond := #in~cond; {22369#true} is VALID [2018-11-23 13:12:19,016 INFO L273 TraceCheckUtils]: 55: Hoare triple {22369#true} assume !(0 == ~cond); {22369#true} is VALID [2018-11-23 13:12:19,016 INFO L273 TraceCheckUtils]: 56: Hoare triple {22369#true} assume true; {22369#true} is VALID [2018-11-23 13:12:19,017 INFO L268 TraceCheckUtils]: 57: Hoare quadruple {22369#true} {22386#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 1))} #70#return; {22386#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 1))} is VALID [2018-11-23 13:12:19,018 INFO L273 TraceCheckUtils]: 58: Hoare triple {22386#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 1))} #t~post7 := ~j1~0;~j1~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~k~0;~k~0 := #t~post8 - 1;havoc #t~post8; {22387#(<= (+ main_~n0~0 main_~n1~0) main_~j1~0)} is VALID [2018-11-23 13:12:19,019 INFO L273 TraceCheckUtils]: 59: Hoare triple {22387#(<= (+ main_~n0~0 main_~n1~0) main_~j1~0)} assume !!(~j1~0 < ~n0~0 + ~n1~0); {22370#false} is VALID [2018-11-23 13:12:19,019 INFO L256 TraceCheckUtils]: 60: Hoare triple {22370#false} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {22370#false} is VALID [2018-11-23 13:12:19,019 INFO L273 TraceCheckUtils]: 61: Hoare triple {22370#false} ~cond := #in~cond; {22370#false} is VALID [2018-11-23 13:12:19,019 INFO L273 TraceCheckUtils]: 62: Hoare triple {22370#false} assume 0 == ~cond; {22370#false} is VALID [2018-11-23 13:12:19,019 INFO L273 TraceCheckUtils]: 63: Hoare triple {22370#false} assume !false; {22370#false} is VALID [2018-11-23 13:12:19,024 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 69 proven. 21 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2018-11-23 13:12:19,024 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:12:19,024 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:12:19,034 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-23 13:12:19,061 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-11-23 13:12:19,061 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:12:19,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:12:19,072 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:12:19,889 INFO L256 TraceCheckUtils]: 0: Hoare triple {22369#true} call ULTIMATE.init(); {22369#true} is VALID [2018-11-23 13:12:19,890 INFO L273 TraceCheckUtils]: 1: Hoare triple {22369#true} assume true; {22369#true} is VALID [2018-11-23 13:12:19,890 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {22369#true} {22369#true} #66#return; {22369#true} is VALID [2018-11-23 13:12:19,890 INFO L256 TraceCheckUtils]: 3: Hoare triple {22369#true} call #t~ret9 := main(); {22369#true} is VALID [2018-11-23 13:12:19,891 INFO L273 TraceCheckUtils]: 4: Hoare triple {22369#true} havoc ~n0~0;havoc ~n1~0;~i0~0 := 0;~k~0 := 0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n0~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~n1~0 := #t~nondet2;havoc #t~nondet2; {22371#(<= main_~i0~0 0)} is VALID [2018-11-23 13:12:19,892 INFO L273 TraceCheckUtils]: 5: Hoare triple {22371#(<= main_~i0~0 0)} assume !!(-1000000 <= ~n0~0 && ~n0~0 < 1000000); {22371#(<= main_~i0~0 0)} is VALID [2018-11-23 13:12:19,892 INFO L273 TraceCheckUtils]: 6: Hoare triple {22371#(<= main_~i0~0 0)} assume !!(-1000000 <= ~n1~0 && ~n1~0 < 1000000); {22371#(<= main_~i0~0 0)} is VALID [2018-11-23 13:12:19,893 INFO L273 TraceCheckUtils]: 7: Hoare triple {22371#(<= main_~i0~0 0)} assume !!(~i0~0 < ~n0~0);#t~post3 := ~i0~0;~i0~0 := 1 + #t~post3;havoc #t~post3;#t~post4 := ~k~0;~k~0 := 1 + #t~post4;havoc #t~post4; {22372#(<= main_~i0~0 1)} is VALID [2018-11-23 13:12:19,893 INFO L273 TraceCheckUtils]: 8: Hoare triple {22372#(<= main_~i0~0 1)} assume !!(~i0~0 < ~n0~0);#t~post3 := ~i0~0;~i0~0 := 1 + #t~post3;havoc #t~post3;#t~post4 := ~k~0;~k~0 := 1 + #t~post4;havoc #t~post4; {22373#(<= main_~i0~0 2)} is VALID [2018-11-23 13:12:19,894 INFO L273 TraceCheckUtils]: 9: Hoare triple {22373#(<= main_~i0~0 2)} assume !!(~i0~0 < ~n0~0);#t~post3 := ~i0~0;~i0~0 := 1 + #t~post3;havoc #t~post3;#t~post4 := ~k~0;~k~0 := 1 + #t~post4;havoc #t~post4; {22374#(<= main_~i0~0 3)} is VALID [2018-11-23 13:12:19,894 INFO L273 TraceCheckUtils]: 10: Hoare triple {22374#(<= main_~i0~0 3)} assume !!(~i0~0 < ~n0~0);#t~post3 := ~i0~0;~i0~0 := 1 + #t~post3;havoc #t~post3;#t~post4 := ~k~0;~k~0 := 1 + #t~post4;havoc #t~post4; {22375#(<= main_~i0~0 4)} is VALID [2018-11-23 13:12:19,895 INFO L273 TraceCheckUtils]: 11: Hoare triple {22375#(<= main_~i0~0 4)} assume !!(~i0~0 < ~n0~0);#t~post3 := ~i0~0;~i0~0 := 1 + #t~post3;havoc #t~post3;#t~post4 := ~k~0;~k~0 := 1 + #t~post4;havoc #t~post4; {22376#(<= main_~i0~0 5)} is VALID [2018-11-23 13:12:19,896 INFO L273 TraceCheckUtils]: 12: Hoare triple {22376#(<= main_~i0~0 5)} assume !!(~i0~0 < ~n0~0);#t~post3 := ~i0~0;~i0~0 := 1 + #t~post3;havoc #t~post3;#t~post4 := ~k~0;~k~0 := 1 + #t~post4;havoc #t~post4; {22377#(<= main_~i0~0 6)} is VALID [2018-11-23 13:12:19,897 INFO L273 TraceCheckUtils]: 13: Hoare triple {22377#(<= main_~i0~0 6)} assume !(~i0~0 < ~n0~0); {22378#(<= main_~n0~0 6)} is VALID [2018-11-23 13:12:19,897 INFO L273 TraceCheckUtils]: 14: Hoare triple {22378#(<= main_~n0~0 6)} ~i1~0 := 0; {22433#(and (<= main_~i1~0 0) (<= main_~n0~0 6))} is VALID [2018-11-23 13:12:19,898 INFO L273 TraceCheckUtils]: 15: Hoare triple {22433#(and (<= main_~i1~0 0) (<= main_~n0~0 6))} assume !(~i1~0 < ~n1~0); {22437#(and (<= main_~n1~0 0) (<= main_~n0~0 6))} is VALID [2018-11-23 13:12:19,899 INFO L273 TraceCheckUtils]: 16: Hoare triple {22437#(and (<= main_~n1~0 0) (<= main_~n0~0 6))} ~j1~0 := 0; {22441#(and (<= main_~n1~0 0) (<= 0 main_~j1~0) (<= main_~n0~0 6))} is VALID [2018-11-23 13:12:19,900 INFO L273 TraceCheckUtils]: 17: Hoare triple {22441#(and (<= main_~n1~0 0) (<= 0 main_~j1~0) (<= main_~n0~0 6))} assume !!(~j1~0 < ~n0~0 + ~n1~0); {22441#(and (<= main_~n1~0 0) (<= 0 main_~j1~0) (<= main_~n0~0 6))} is VALID [2018-11-23 13:12:19,900 INFO L256 TraceCheckUtils]: 18: Hoare triple {22441#(and (<= main_~n1~0 0) (<= 0 main_~j1~0) (<= main_~n0~0 6))} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {22369#true} is VALID [2018-11-23 13:12:19,900 INFO L273 TraceCheckUtils]: 19: Hoare triple {22369#true} ~cond := #in~cond; {22369#true} is VALID [2018-11-23 13:12:19,900 INFO L273 TraceCheckUtils]: 20: Hoare triple {22369#true} assume !(0 == ~cond); {22369#true} is VALID [2018-11-23 13:12:19,901 INFO L273 TraceCheckUtils]: 21: Hoare triple {22369#true} assume true; {22369#true} is VALID [2018-11-23 13:12:19,901 INFO L268 TraceCheckUtils]: 22: Hoare quadruple {22369#true} {22441#(and (<= main_~n1~0 0) (<= 0 main_~j1~0) (<= main_~n0~0 6))} #70#return; {22441#(and (<= main_~n1~0 0) (<= 0 main_~j1~0) (<= main_~n0~0 6))} is VALID [2018-11-23 13:12:19,902 INFO L273 TraceCheckUtils]: 23: Hoare triple {22441#(and (<= main_~n1~0 0) (<= 0 main_~j1~0) (<= main_~n0~0 6))} #t~post7 := ~j1~0;~j1~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~k~0;~k~0 := #t~post8 - 1;havoc #t~post8; {22463#(and (<= main_~n1~0 0) (<= 1 main_~j1~0) (<= main_~n0~0 6))} is VALID [2018-11-23 13:12:19,903 INFO L273 TraceCheckUtils]: 24: Hoare triple {22463#(and (<= main_~n1~0 0) (<= 1 main_~j1~0) (<= main_~n0~0 6))} assume !!(~j1~0 < ~n0~0 + ~n1~0); {22463#(and (<= main_~n1~0 0) (<= 1 main_~j1~0) (<= main_~n0~0 6))} is VALID [2018-11-23 13:12:19,903 INFO L256 TraceCheckUtils]: 25: Hoare triple {22463#(and (<= main_~n1~0 0) (<= 1 main_~j1~0) (<= main_~n0~0 6))} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {22369#true} is VALID [2018-11-23 13:12:19,903 INFO L273 TraceCheckUtils]: 26: Hoare triple {22369#true} ~cond := #in~cond; {22369#true} is VALID [2018-11-23 13:12:19,904 INFO L273 TraceCheckUtils]: 27: Hoare triple {22369#true} assume !(0 == ~cond); {22369#true} is VALID [2018-11-23 13:12:19,904 INFO L273 TraceCheckUtils]: 28: Hoare triple {22369#true} assume true; {22369#true} is VALID [2018-11-23 13:12:19,905 INFO L268 TraceCheckUtils]: 29: Hoare quadruple {22369#true} {22463#(and (<= main_~n1~0 0) (<= 1 main_~j1~0) (<= main_~n0~0 6))} #70#return; {22463#(and (<= main_~n1~0 0) (<= 1 main_~j1~0) (<= main_~n0~0 6))} is VALID [2018-11-23 13:12:19,906 INFO L273 TraceCheckUtils]: 30: Hoare triple {22463#(and (<= main_~n1~0 0) (<= 1 main_~j1~0) (<= main_~n0~0 6))} #t~post7 := ~j1~0;~j1~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~k~0;~k~0 := #t~post8 - 1;havoc #t~post8; {22485#(and (<= main_~n1~0 0) (<= main_~n0~0 6) (<= 2 main_~j1~0))} is VALID [2018-11-23 13:12:19,906 INFO L273 TraceCheckUtils]: 31: Hoare triple {22485#(and (<= main_~n1~0 0) (<= main_~n0~0 6) (<= 2 main_~j1~0))} assume !!(~j1~0 < ~n0~0 + ~n1~0); {22485#(and (<= main_~n1~0 0) (<= main_~n0~0 6) (<= 2 main_~j1~0))} is VALID [2018-11-23 13:12:19,907 INFO L256 TraceCheckUtils]: 32: Hoare triple {22485#(and (<= main_~n1~0 0) (<= main_~n0~0 6) (<= 2 main_~j1~0))} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {22369#true} is VALID [2018-11-23 13:12:19,907 INFO L273 TraceCheckUtils]: 33: Hoare triple {22369#true} ~cond := #in~cond; {22369#true} is VALID [2018-11-23 13:12:19,907 INFO L273 TraceCheckUtils]: 34: Hoare triple {22369#true} assume !(0 == ~cond); {22369#true} is VALID [2018-11-23 13:12:19,907 INFO L273 TraceCheckUtils]: 35: Hoare triple {22369#true} assume true; {22369#true} is VALID [2018-11-23 13:12:19,908 INFO L268 TraceCheckUtils]: 36: Hoare quadruple {22369#true} {22485#(and (<= main_~n1~0 0) (<= main_~n0~0 6) (<= 2 main_~j1~0))} #70#return; {22485#(and (<= main_~n1~0 0) (<= main_~n0~0 6) (<= 2 main_~j1~0))} is VALID [2018-11-23 13:12:19,909 INFO L273 TraceCheckUtils]: 37: Hoare triple {22485#(and (<= main_~n1~0 0) (<= main_~n0~0 6) (<= 2 main_~j1~0))} #t~post7 := ~j1~0;~j1~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~k~0;~k~0 := #t~post8 - 1;havoc #t~post8; {22507#(and (<= main_~n1~0 0) (<= 3 main_~j1~0) (<= main_~n0~0 6))} is VALID [2018-11-23 13:12:19,910 INFO L273 TraceCheckUtils]: 38: Hoare triple {22507#(and (<= main_~n1~0 0) (<= 3 main_~j1~0) (<= main_~n0~0 6))} assume !!(~j1~0 < ~n0~0 + ~n1~0); {22507#(and (<= main_~n1~0 0) (<= 3 main_~j1~0) (<= main_~n0~0 6))} is VALID [2018-11-23 13:12:19,910 INFO L256 TraceCheckUtils]: 39: Hoare triple {22507#(and (<= main_~n1~0 0) (<= 3 main_~j1~0) (<= main_~n0~0 6))} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {22369#true} is VALID [2018-11-23 13:12:19,910 INFO L273 TraceCheckUtils]: 40: Hoare triple {22369#true} ~cond := #in~cond; {22369#true} is VALID [2018-11-23 13:12:19,911 INFO L273 TraceCheckUtils]: 41: Hoare triple {22369#true} assume !(0 == ~cond); {22369#true} is VALID [2018-11-23 13:12:19,911 INFO L273 TraceCheckUtils]: 42: Hoare triple {22369#true} assume true; {22369#true} is VALID [2018-11-23 13:12:19,912 INFO L268 TraceCheckUtils]: 43: Hoare quadruple {22369#true} {22507#(and (<= main_~n1~0 0) (<= 3 main_~j1~0) (<= main_~n0~0 6))} #70#return; {22507#(and (<= main_~n1~0 0) (<= 3 main_~j1~0) (<= main_~n0~0 6))} is VALID [2018-11-23 13:12:19,913 INFO L273 TraceCheckUtils]: 44: Hoare triple {22507#(and (<= main_~n1~0 0) (<= 3 main_~j1~0) (<= main_~n0~0 6))} #t~post7 := ~j1~0;~j1~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~k~0;~k~0 := #t~post8 - 1;havoc #t~post8; {22529#(and (<= main_~n1~0 0) (<= 4 main_~j1~0) (<= main_~n0~0 6))} is VALID [2018-11-23 13:12:19,913 INFO L273 TraceCheckUtils]: 45: Hoare triple {22529#(and (<= main_~n1~0 0) (<= 4 main_~j1~0) (<= main_~n0~0 6))} assume !!(~j1~0 < ~n0~0 + ~n1~0); {22529#(and (<= main_~n1~0 0) (<= 4 main_~j1~0) (<= main_~n0~0 6))} is VALID [2018-11-23 13:12:19,913 INFO L256 TraceCheckUtils]: 46: Hoare triple {22529#(and (<= main_~n1~0 0) (<= 4 main_~j1~0) (<= main_~n0~0 6))} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {22369#true} is VALID [2018-11-23 13:12:19,914 INFO L273 TraceCheckUtils]: 47: Hoare triple {22369#true} ~cond := #in~cond; {22369#true} is VALID [2018-11-23 13:12:19,914 INFO L273 TraceCheckUtils]: 48: Hoare triple {22369#true} assume !(0 == ~cond); {22369#true} is VALID [2018-11-23 13:12:19,914 INFO L273 TraceCheckUtils]: 49: Hoare triple {22369#true} assume true; {22369#true} is VALID [2018-11-23 13:12:19,915 INFO L268 TraceCheckUtils]: 50: Hoare quadruple {22369#true} {22529#(and (<= main_~n1~0 0) (<= 4 main_~j1~0) (<= main_~n0~0 6))} #70#return; {22529#(and (<= main_~n1~0 0) (<= 4 main_~j1~0) (<= main_~n0~0 6))} is VALID [2018-11-23 13:12:19,916 INFO L273 TraceCheckUtils]: 51: Hoare triple {22529#(and (<= main_~n1~0 0) (<= 4 main_~j1~0) (<= main_~n0~0 6))} #t~post7 := ~j1~0;~j1~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~k~0;~k~0 := #t~post8 - 1;havoc #t~post8; {22551#(and (<= main_~n1~0 0) (<= main_~n0~0 6) (<= 5 main_~j1~0))} is VALID [2018-11-23 13:12:19,916 INFO L273 TraceCheckUtils]: 52: Hoare triple {22551#(and (<= main_~n1~0 0) (<= main_~n0~0 6) (<= 5 main_~j1~0))} assume !!(~j1~0 < ~n0~0 + ~n1~0); {22551#(and (<= main_~n1~0 0) (<= main_~n0~0 6) (<= 5 main_~j1~0))} is VALID [2018-11-23 13:12:19,916 INFO L256 TraceCheckUtils]: 53: Hoare triple {22551#(and (<= main_~n1~0 0) (<= main_~n0~0 6) (<= 5 main_~j1~0))} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {22369#true} is VALID [2018-11-23 13:12:19,917 INFO L273 TraceCheckUtils]: 54: Hoare triple {22369#true} ~cond := #in~cond; {22369#true} is VALID [2018-11-23 13:12:19,917 INFO L273 TraceCheckUtils]: 55: Hoare triple {22369#true} assume !(0 == ~cond); {22369#true} is VALID [2018-11-23 13:12:19,917 INFO L273 TraceCheckUtils]: 56: Hoare triple {22369#true} assume true; {22369#true} is VALID [2018-11-23 13:12:19,917 INFO L268 TraceCheckUtils]: 57: Hoare quadruple {22369#true} {22551#(and (<= main_~n1~0 0) (<= main_~n0~0 6) (<= 5 main_~j1~0))} #70#return; {22551#(and (<= main_~n1~0 0) (<= main_~n0~0 6) (<= 5 main_~j1~0))} is VALID [2018-11-23 13:12:19,918 INFO L273 TraceCheckUtils]: 58: Hoare triple {22551#(and (<= main_~n1~0 0) (<= main_~n0~0 6) (<= 5 main_~j1~0))} #t~post7 := ~j1~0;~j1~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~k~0;~k~0 := #t~post8 - 1;havoc #t~post8; {22573#(and (<= main_~n1~0 0) (<= 6 main_~j1~0) (<= main_~n0~0 6))} is VALID [2018-11-23 13:12:19,918 INFO L273 TraceCheckUtils]: 59: Hoare triple {22573#(and (<= main_~n1~0 0) (<= 6 main_~j1~0) (<= main_~n0~0 6))} assume !!(~j1~0 < ~n0~0 + ~n1~0); {22370#false} is VALID [2018-11-23 13:12:19,918 INFO L256 TraceCheckUtils]: 60: Hoare triple {22370#false} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {22370#false} is VALID [2018-11-23 13:12:19,918 INFO L273 TraceCheckUtils]: 61: Hoare triple {22370#false} ~cond := #in~cond; {22370#false} is VALID [2018-11-23 13:12:19,919 INFO L273 TraceCheckUtils]: 62: Hoare triple {22370#false} assume 0 == ~cond; {22370#false} is VALID [2018-11-23 13:12:19,919 INFO L273 TraceCheckUtils]: 63: Hoare triple {22370#false} assume !false; {22370#false} is VALID [2018-11-23 13:12:19,924 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 69 proven. 21 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2018-11-23 13:12:19,944 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:12:19,944 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 28 [2018-11-23 13:12:19,944 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 64 [2018-11-23 13:12:19,945 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:12:19,945 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 28 states. [2018-11-23 13:12:20,018 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 77 edges. 77 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:12:20,018 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-11-23 13:12:20,019 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-11-23 13:12:20,019 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=169, Invalid=587, Unknown=0, NotChecked=0, Total=756 [2018-11-23 13:12:20,019 INFO L87 Difference]: Start difference. First operand 80 states and 88 transitions. Second operand 28 states. [2018-11-23 13:12:24,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:12:24,123 INFO L93 Difference]: Finished difference Result 286 states and 358 transitions. [2018-11-23 13:12:24,123 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-11-23 13:12:24,123 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 64 [2018-11-23 13:12:24,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:12:24,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-11-23 13:12:24,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 135 transitions. [2018-11-23 13:12:24,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-11-23 13:12:24,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 135 transitions. [2018-11-23 13:12:24,128 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 31 states and 135 transitions. [2018-11-23 13:12:24,271 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 135 edges. 135 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:12:24,276 INFO L225 Difference]: With dead ends: 286 [2018-11-23 13:12:24,276 INFO L226 Difference]: Without dead ends: 257 [2018-11-23 13:12:24,277 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 602 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=515, Invalid=1935, Unknown=0, NotChecked=0, Total=2450 [2018-11-23 13:12:24,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2018-11-23 13:12:24,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 82. [2018-11-23 13:12:24,761 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:12:24,761 INFO L82 GeneralOperation]: Start isEquivalent. First operand 257 states. Second operand 82 states. [2018-11-23 13:12:24,761 INFO L74 IsIncluded]: Start isIncluded. First operand 257 states. Second operand 82 states. [2018-11-23 13:12:24,761 INFO L87 Difference]: Start difference. First operand 257 states. Second operand 82 states. [2018-11-23 13:12:24,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:12:24,768 INFO L93 Difference]: Finished difference Result 257 states and 322 transitions. [2018-11-23 13:12:24,768 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 322 transitions. [2018-11-23 13:12:24,769 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:12:24,769 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:12:24,769 INFO L74 IsIncluded]: Start isIncluded. First operand 82 states. Second operand 257 states. [2018-11-23 13:12:24,769 INFO L87 Difference]: Start difference. First operand 82 states. Second operand 257 states. [2018-11-23 13:12:24,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:12:24,776 INFO L93 Difference]: Finished difference Result 257 states and 322 transitions. [2018-11-23 13:12:24,776 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 322 transitions. [2018-11-23 13:12:24,776 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:12:24,777 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:12:24,777 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:12:24,777 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:12:24,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-11-23 13:12:24,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 91 transitions. [2018-11-23 13:12:24,778 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 91 transitions. Word has length 64 [2018-11-23 13:12:24,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:12:24,779 INFO L480 AbstractCegarLoop]: Abstraction has 82 states and 91 transitions. [2018-11-23 13:12:24,779 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-11-23 13:12:24,779 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 91 transitions. [2018-11-23 13:12:24,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-11-23 13:12:24,779 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:12:24,780 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:12:24,780 INFO L423 AbstractCegarLoop]: === Iteration 35 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:12:24,780 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:12:24,780 INFO L82 PathProgramCache]: Analyzing trace with hash 1476086855, now seen corresponding path program 12 times [2018-11-23 13:12:24,780 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:12:24,780 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:12:24,781 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:12:24,781 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:12:24,781 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:12:24,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:12:25,169 INFO L256 TraceCheckUtils]: 0: Hoare triple {23738#true} call ULTIMATE.init(); {23738#true} is VALID [2018-11-23 13:12:25,169 INFO L273 TraceCheckUtils]: 1: Hoare triple {23738#true} assume true; {23738#true} is VALID [2018-11-23 13:12:25,169 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {23738#true} {23738#true} #66#return; {23738#true} is VALID [2018-11-23 13:12:25,170 INFO L256 TraceCheckUtils]: 3: Hoare triple {23738#true} call #t~ret9 := main(); {23738#true} is VALID [2018-11-23 13:12:25,170 INFO L273 TraceCheckUtils]: 4: Hoare triple {23738#true} havoc ~n0~0;havoc ~n1~0;~i0~0 := 0;~k~0 := 0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n0~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~n1~0 := #t~nondet2;havoc #t~nondet2; {23740#(<= 0 main_~k~0)} is VALID [2018-11-23 13:12:25,171 INFO L273 TraceCheckUtils]: 5: Hoare triple {23740#(<= 0 main_~k~0)} assume !!(-1000000 <= ~n0~0 && ~n0~0 < 1000000); {23740#(<= 0 main_~k~0)} is VALID [2018-11-23 13:12:25,171 INFO L273 TraceCheckUtils]: 6: Hoare triple {23740#(<= 0 main_~k~0)} assume !!(-1000000 <= ~n1~0 && ~n1~0 < 1000000); {23740#(<= 0 main_~k~0)} is VALID [2018-11-23 13:12:25,171 INFO L273 TraceCheckUtils]: 7: Hoare triple {23740#(<= 0 main_~k~0)} assume !(~i0~0 < ~n0~0); {23740#(<= 0 main_~k~0)} is VALID [2018-11-23 13:12:25,172 INFO L273 TraceCheckUtils]: 8: Hoare triple {23740#(<= 0 main_~k~0)} ~i1~0 := 0; {23740#(<= 0 main_~k~0)} is VALID [2018-11-23 13:12:25,172 INFO L273 TraceCheckUtils]: 9: Hoare triple {23740#(<= 0 main_~k~0)} assume !!(~i1~0 < ~n1~0);#t~post5 := ~i1~0;~i1~0 := 1 + #t~post5;havoc #t~post5;#t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {23741#(<= 1 main_~k~0)} is VALID [2018-11-23 13:12:25,173 INFO L273 TraceCheckUtils]: 10: Hoare triple {23741#(<= 1 main_~k~0)} assume !!(~i1~0 < ~n1~0);#t~post5 := ~i1~0;~i1~0 := 1 + #t~post5;havoc #t~post5;#t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {23742#(<= 2 main_~k~0)} is VALID [2018-11-23 13:12:25,174 INFO L273 TraceCheckUtils]: 11: Hoare triple {23742#(<= 2 main_~k~0)} assume !!(~i1~0 < ~n1~0);#t~post5 := ~i1~0;~i1~0 := 1 + #t~post5;havoc #t~post5;#t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {23743#(<= 3 main_~k~0)} is VALID [2018-11-23 13:12:25,175 INFO L273 TraceCheckUtils]: 12: Hoare triple {23743#(<= 3 main_~k~0)} assume !!(~i1~0 < ~n1~0);#t~post5 := ~i1~0;~i1~0 := 1 + #t~post5;havoc #t~post5;#t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {23744#(<= 4 main_~k~0)} is VALID [2018-11-23 13:12:25,175 INFO L273 TraceCheckUtils]: 13: Hoare triple {23744#(<= 4 main_~k~0)} assume !!(~i1~0 < ~n1~0);#t~post5 := ~i1~0;~i1~0 := 1 + #t~post5;havoc #t~post5;#t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {23745#(<= 5 main_~k~0)} is VALID [2018-11-23 13:12:25,176 INFO L273 TraceCheckUtils]: 14: Hoare triple {23745#(<= 5 main_~k~0)} assume !!(~i1~0 < ~n1~0);#t~post5 := ~i1~0;~i1~0 := 1 + #t~post5;havoc #t~post5;#t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {23746#(<= 6 main_~k~0)} is VALID [2018-11-23 13:12:25,177 INFO L273 TraceCheckUtils]: 15: Hoare triple {23746#(<= 6 main_~k~0)} assume !!(~i1~0 < ~n1~0);#t~post5 := ~i1~0;~i1~0 := 1 + #t~post5;havoc #t~post5;#t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {23747#(<= 7 main_~k~0)} is VALID [2018-11-23 13:12:25,178 INFO L273 TraceCheckUtils]: 16: Hoare triple {23747#(<= 7 main_~k~0)} assume !(~i1~0 < ~n1~0); {23747#(<= 7 main_~k~0)} is VALID [2018-11-23 13:12:25,178 INFO L273 TraceCheckUtils]: 17: Hoare triple {23747#(<= 7 main_~k~0)} ~j1~0 := 0; {23747#(<= 7 main_~k~0)} is VALID [2018-11-23 13:12:25,179 INFO L273 TraceCheckUtils]: 18: Hoare triple {23747#(<= 7 main_~k~0)} assume !!(~j1~0 < ~n0~0 + ~n1~0); {23747#(<= 7 main_~k~0)} is VALID [2018-11-23 13:12:25,179 INFO L256 TraceCheckUtils]: 19: Hoare triple {23747#(<= 7 main_~k~0)} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {23738#true} is VALID [2018-11-23 13:12:25,180 INFO L273 TraceCheckUtils]: 20: Hoare triple {23738#true} ~cond := #in~cond; {23748#(= __VERIFIER_assert_~cond |__VERIFIER_assert_#in~cond|)} is VALID [2018-11-23 13:12:25,180 INFO L273 TraceCheckUtils]: 21: Hoare triple {23748#(= __VERIFIER_assert_~cond |__VERIFIER_assert_#in~cond|)} assume !(0 == ~cond); {23749#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2018-11-23 13:12:25,181 INFO L273 TraceCheckUtils]: 22: Hoare triple {23749#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {23749#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2018-11-23 13:12:25,181 INFO L268 TraceCheckUtils]: 23: Hoare quadruple {23749#(not (= |__VERIFIER_assert_#in~cond| 0))} {23747#(<= 7 main_~k~0)} #70#return; {23747#(<= 7 main_~k~0)} is VALID [2018-11-23 13:12:25,182 INFO L273 TraceCheckUtils]: 24: Hoare triple {23747#(<= 7 main_~k~0)} #t~post7 := ~j1~0;~j1~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~k~0;~k~0 := #t~post8 - 1;havoc #t~post8; {23746#(<= 6 main_~k~0)} is VALID [2018-11-23 13:12:25,183 INFO L273 TraceCheckUtils]: 25: Hoare triple {23746#(<= 6 main_~k~0)} assume !!(~j1~0 < ~n0~0 + ~n1~0); {23746#(<= 6 main_~k~0)} is VALID [2018-11-23 13:12:25,183 INFO L256 TraceCheckUtils]: 26: Hoare triple {23746#(<= 6 main_~k~0)} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {23738#true} is VALID [2018-11-23 13:12:25,183 INFO L273 TraceCheckUtils]: 27: Hoare triple {23738#true} ~cond := #in~cond; {23738#true} is VALID [2018-11-23 13:12:25,184 INFO L273 TraceCheckUtils]: 28: Hoare triple {23738#true} assume !(0 == ~cond); {23738#true} is VALID [2018-11-23 13:12:25,184 INFO L273 TraceCheckUtils]: 29: Hoare triple {23738#true} assume true; {23738#true} is VALID [2018-11-23 13:12:25,185 INFO L268 TraceCheckUtils]: 30: Hoare quadruple {23738#true} {23746#(<= 6 main_~k~0)} #70#return; {23746#(<= 6 main_~k~0)} is VALID [2018-11-23 13:12:25,185 INFO L273 TraceCheckUtils]: 31: Hoare triple {23746#(<= 6 main_~k~0)} #t~post7 := ~j1~0;~j1~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~k~0;~k~0 := #t~post8 - 1;havoc #t~post8; {23745#(<= 5 main_~k~0)} is VALID [2018-11-23 13:12:25,186 INFO L273 TraceCheckUtils]: 32: Hoare triple {23745#(<= 5 main_~k~0)} assume !!(~j1~0 < ~n0~0 + ~n1~0); {23745#(<= 5 main_~k~0)} is VALID [2018-11-23 13:12:25,186 INFO L256 TraceCheckUtils]: 33: Hoare triple {23745#(<= 5 main_~k~0)} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {23738#true} is VALID [2018-11-23 13:12:25,186 INFO L273 TraceCheckUtils]: 34: Hoare triple {23738#true} ~cond := #in~cond; {23738#true} is VALID [2018-11-23 13:12:25,187 INFO L273 TraceCheckUtils]: 35: Hoare triple {23738#true} assume !(0 == ~cond); {23738#true} is VALID [2018-11-23 13:12:25,187 INFO L273 TraceCheckUtils]: 36: Hoare triple {23738#true} assume true; {23738#true} is VALID [2018-11-23 13:12:25,188 INFO L268 TraceCheckUtils]: 37: Hoare quadruple {23738#true} {23745#(<= 5 main_~k~0)} #70#return; {23745#(<= 5 main_~k~0)} is VALID [2018-11-23 13:12:25,189 INFO L273 TraceCheckUtils]: 38: Hoare triple {23745#(<= 5 main_~k~0)} #t~post7 := ~j1~0;~j1~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~k~0;~k~0 := #t~post8 - 1;havoc #t~post8; {23744#(<= 4 main_~k~0)} is VALID [2018-11-23 13:12:25,189 INFO L273 TraceCheckUtils]: 39: Hoare triple {23744#(<= 4 main_~k~0)} assume !!(~j1~0 < ~n0~0 + ~n1~0); {23744#(<= 4 main_~k~0)} is VALID [2018-11-23 13:12:25,189 INFO L256 TraceCheckUtils]: 40: Hoare triple {23744#(<= 4 main_~k~0)} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {23738#true} is VALID [2018-11-23 13:12:25,190 INFO L273 TraceCheckUtils]: 41: Hoare triple {23738#true} ~cond := #in~cond; {23738#true} is VALID [2018-11-23 13:12:25,190 INFO L273 TraceCheckUtils]: 42: Hoare triple {23738#true} assume !(0 == ~cond); {23738#true} is VALID [2018-11-23 13:12:25,190 INFO L273 TraceCheckUtils]: 43: Hoare triple {23738#true} assume true; {23738#true} is VALID [2018-11-23 13:12:25,191 INFO L268 TraceCheckUtils]: 44: Hoare quadruple {23738#true} {23744#(<= 4 main_~k~0)} #70#return; {23744#(<= 4 main_~k~0)} is VALID [2018-11-23 13:12:25,192 INFO L273 TraceCheckUtils]: 45: Hoare triple {23744#(<= 4 main_~k~0)} #t~post7 := ~j1~0;~j1~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~k~0;~k~0 := #t~post8 - 1;havoc #t~post8; {23743#(<= 3 main_~k~0)} is VALID [2018-11-23 13:12:25,192 INFO L273 TraceCheckUtils]: 46: Hoare triple {23743#(<= 3 main_~k~0)} assume !!(~j1~0 < ~n0~0 + ~n1~0); {23743#(<= 3 main_~k~0)} is VALID [2018-11-23 13:12:25,192 INFO L256 TraceCheckUtils]: 47: Hoare triple {23743#(<= 3 main_~k~0)} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {23738#true} is VALID [2018-11-23 13:12:25,193 INFO L273 TraceCheckUtils]: 48: Hoare triple {23738#true} ~cond := #in~cond; {23738#true} is VALID [2018-11-23 13:12:25,193 INFO L273 TraceCheckUtils]: 49: Hoare triple {23738#true} assume !(0 == ~cond); {23738#true} is VALID [2018-11-23 13:12:25,193 INFO L273 TraceCheckUtils]: 50: Hoare triple {23738#true} assume true; {23738#true} is VALID [2018-11-23 13:12:25,194 INFO L268 TraceCheckUtils]: 51: Hoare quadruple {23738#true} {23743#(<= 3 main_~k~0)} #70#return; {23743#(<= 3 main_~k~0)} is VALID [2018-11-23 13:12:25,195 INFO L273 TraceCheckUtils]: 52: Hoare triple {23743#(<= 3 main_~k~0)} #t~post7 := ~j1~0;~j1~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~k~0;~k~0 := #t~post8 - 1;havoc #t~post8; {23742#(<= 2 main_~k~0)} is VALID [2018-11-23 13:12:25,195 INFO L273 TraceCheckUtils]: 53: Hoare triple {23742#(<= 2 main_~k~0)} assume !!(~j1~0 < ~n0~0 + ~n1~0); {23742#(<= 2 main_~k~0)} is VALID [2018-11-23 13:12:25,195 INFO L256 TraceCheckUtils]: 54: Hoare triple {23742#(<= 2 main_~k~0)} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {23738#true} is VALID [2018-11-23 13:12:25,196 INFO L273 TraceCheckUtils]: 55: Hoare triple {23738#true} ~cond := #in~cond; {23738#true} is VALID [2018-11-23 13:12:25,196 INFO L273 TraceCheckUtils]: 56: Hoare triple {23738#true} assume !(0 == ~cond); {23738#true} is VALID [2018-11-23 13:12:25,196 INFO L273 TraceCheckUtils]: 57: Hoare triple {23738#true} assume true; {23738#true} is VALID [2018-11-23 13:12:25,197 INFO L268 TraceCheckUtils]: 58: Hoare quadruple {23738#true} {23742#(<= 2 main_~k~0)} #70#return; {23742#(<= 2 main_~k~0)} is VALID [2018-11-23 13:12:25,197 INFO L273 TraceCheckUtils]: 59: Hoare triple {23742#(<= 2 main_~k~0)} #t~post7 := ~j1~0;~j1~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~k~0;~k~0 := #t~post8 - 1;havoc #t~post8; {23741#(<= 1 main_~k~0)} is VALID [2018-11-23 13:12:25,198 INFO L273 TraceCheckUtils]: 60: Hoare triple {23741#(<= 1 main_~k~0)} assume !!(~j1~0 < ~n0~0 + ~n1~0); {23741#(<= 1 main_~k~0)} is VALID [2018-11-23 13:12:25,199 INFO L256 TraceCheckUtils]: 61: Hoare triple {23741#(<= 1 main_~k~0)} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {23749#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2018-11-23 13:12:25,200 INFO L273 TraceCheckUtils]: 62: Hoare triple {23749#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {23750#(not (= __VERIFIER_assert_~cond 0))} is VALID [2018-11-23 13:12:25,200 INFO L273 TraceCheckUtils]: 63: Hoare triple {23750#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {23739#false} is VALID [2018-11-23 13:12:25,201 INFO L273 TraceCheckUtils]: 64: Hoare triple {23739#false} assume !false; {23739#false} is VALID [2018-11-23 13:12:25,204 INFO L134 CoverageAnalysis]: Checked inductivity of 157 backedges. 39 proven. 73 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2018-11-23 13:12:25,205 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:12:25,205 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:12:25,213 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-23 13:12:25,239 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-11-23 13:12:25,239 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:12:25,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:12:25,252 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:12:25,392 INFO L256 TraceCheckUtils]: 0: Hoare triple {23738#true} call ULTIMATE.init(); {23738#true} is VALID [2018-11-23 13:12:25,393 INFO L273 TraceCheckUtils]: 1: Hoare triple {23738#true} assume true; {23738#true} is VALID [2018-11-23 13:12:25,393 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {23738#true} {23738#true} #66#return; {23738#true} is VALID [2018-11-23 13:12:25,393 INFO L256 TraceCheckUtils]: 3: Hoare triple {23738#true} call #t~ret9 := main(); {23738#true} is VALID [2018-11-23 13:12:25,394 INFO L273 TraceCheckUtils]: 4: Hoare triple {23738#true} havoc ~n0~0;havoc ~n1~0;~i0~0 := 0;~k~0 := 0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n0~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~n1~0 := #t~nondet2;havoc #t~nondet2; {23740#(<= 0 main_~k~0)} is VALID [2018-11-23 13:12:25,394 INFO L273 TraceCheckUtils]: 5: Hoare triple {23740#(<= 0 main_~k~0)} assume !!(-1000000 <= ~n0~0 && ~n0~0 < 1000000); {23740#(<= 0 main_~k~0)} is VALID [2018-11-23 13:12:25,395 INFO L273 TraceCheckUtils]: 6: Hoare triple {23740#(<= 0 main_~k~0)} assume !!(-1000000 <= ~n1~0 && ~n1~0 < 1000000); {23740#(<= 0 main_~k~0)} is VALID [2018-11-23 13:12:25,395 INFO L273 TraceCheckUtils]: 7: Hoare triple {23740#(<= 0 main_~k~0)} assume !(~i0~0 < ~n0~0); {23740#(<= 0 main_~k~0)} is VALID [2018-11-23 13:12:25,395 INFO L273 TraceCheckUtils]: 8: Hoare triple {23740#(<= 0 main_~k~0)} ~i1~0 := 0; {23740#(<= 0 main_~k~0)} is VALID [2018-11-23 13:12:25,396 INFO L273 TraceCheckUtils]: 9: Hoare triple {23740#(<= 0 main_~k~0)} assume !!(~i1~0 < ~n1~0);#t~post5 := ~i1~0;~i1~0 := 1 + #t~post5;havoc #t~post5;#t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {23741#(<= 1 main_~k~0)} is VALID [2018-11-23 13:12:25,396 INFO L273 TraceCheckUtils]: 10: Hoare triple {23741#(<= 1 main_~k~0)} assume !!(~i1~0 < ~n1~0);#t~post5 := ~i1~0;~i1~0 := 1 + #t~post5;havoc #t~post5;#t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {23742#(<= 2 main_~k~0)} is VALID [2018-11-23 13:12:25,397 INFO L273 TraceCheckUtils]: 11: Hoare triple {23742#(<= 2 main_~k~0)} assume !!(~i1~0 < ~n1~0);#t~post5 := ~i1~0;~i1~0 := 1 + #t~post5;havoc #t~post5;#t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {23743#(<= 3 main_~k~0)} is VALID [2018-11-23 13:12:25,397 INFO L273 TraceCheckUtils]: 12: Hoare triple {23743#(<= 3 main_~k~0)} assume !!(~i1~0 < ~n1~0);#t~post5 := ~i1~0;~i1~0 := 1 + #t~post5;havoc #t~post5;#t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {23744#(<= 4 main_~k~0)} is VALID [2018-11-23 13:12:25,398 INFO L273 TraceCheckUtils]: 13: Hoare triple {23744#(<= 4 main_~k~0)} assume !!(~i1~0 < ~n1~0);#t~post5 := ~i1~0;~i1~0 := 1 + #t~post5;havoc #t~post5;#t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {23745#(<= 5 main_~k~0)} is VALID [2018-11-23 13:12:25,399 INFO L273 TraceCheckUtils]: 14: Hoare triple {23745#(<= 5 main_~k~0)} assume !!(~i1~0 < ~n1~0);#t~post5 := ~i1~0;~i1~0 := 1 + #t~post5;havoc #t~post5;#t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {23746#(<= 6 main_~k~0)} is VALID [2018-11-23 13:12:25,400 INFO L273 TraceCheckUtils]: 15: Hoare triple {23746#(<= 6 main_~k~0)} assume !!(~i1~0 < ~n1~0);#t~post5 := ~i1~0;~i1~0 := 1 + #t~post5;havoc #t~post5;#t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {23747#(<= 7 main_~k~0)} is VALID [2018-11-23 13:12:25,400 INFO L273 TraceCheckUtils]: 16: Hoare triple {23747#(<= 7 main_~k~0)} assume !(~i1~0 < ~n1~0); {23747#(<= 7 main_~k~0)} is VALID [2018-11-23 13:12:25,401 INFO L273 TraceCheckUtils]: 17: Hoare triple {23747#(<= 7 main_~k~0)} ~j1~0 := 0; {23747#(<= 7 main_~k~0)} is VALID [2018-11-23 13:12:25,401 INFO L273 TraceCheckUtils]: 18: Hoare triple {23747#(<= 7 main_~k~0)} assume !!(~j1~0 < ~n0~0 + ~n1~0); {23747#(<= 7 main_~k~0)} is VALID [2018-11-23 13:12:25,401 INFO L256 TraceCheckUtils]: 19: Hoare triple {23747#(<= 7 main_~k~0)} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {23738#true} is VALID [2018-11-23 13:12:25,402 INFO L273 TraceCheckUtils]: 20: Hoare triple {23738#true} ~cond := #in~cond; {23738#true} is VALID [2018-11-23 13:12:25,402 INFO L273 TraceCheckUtils]: 21: Hoare triple {23738#true} assume !(0 == ~cond); {23738#true} is VALID [2018-11-23 13:12:25,402 INFO L273 TraceCheckUtils]: 22: Hoare triple {23738#true} assume true; {23738#true} is VALID [2018-11-23 13:12:25,403 INFO L268 TraceCheckUtils]: 23: Hoare quadruple {23738#true} {23747#(<= 7 main_~k~0)} #70#return; {23747#(<= 7 main_~k~0)} is VALID [2018-11-23 13:12:25,403 INFO L273 TraceCheckUtils]: 24: Hoare triple {23747#(<= 7 main_~k~0)} #t~post7 := ~j1~0;~j1~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~k~0;~k~0 := #t~post8 - 1;havoc #t~post8; {23746#(<= 6 main_~k~0)} is VALID [2018-11-23 13:12:25,404 INFO L273 TraceCheckUtils]: 25: Hoare triple {23746#(<= 6 main_~k~0)} assume !!(~j1~0 < ~n0~0 + ~n1~0); {23746#(<= 6 main_~k~0)} is VALID [2018-11-23 13:12:25,404 INFO L256 TraceCheckUtils]: 26: Hoare triple {23746#(<= 6 main_~k~0)} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {23738#true} is VALID [2018-11-23 13:12:25,404 INFO L273 TraceCheckUtils]: 27: Hoare triple {23738#true} ~cond := #in~cond; {23738#true} is VALID [2018-11-23 13:12:25,404 INFO L273 TraceCheckUtils]: 28: Hoare triple {23738#true} assume !(0 == ~cond); {23738#true} is VALID [2018-11-23 13:12:25,405 INFO L273 TraceCheckUtils]: 29: Hoare triple {23738#true} assume true; {23738#true} is VALID [2018-11-23 13:12:25,405 INFO L268 TraceCheckUtils]: 30: Hoare quadruple {23738#true} {23746#(<= 6 main_~k~0)} #70#return; {23746#(<= 6 main_~k~0)} is VALID [2018-11-23 13:12:25,406 INFO L273 TraceCheckUtils]: 31: Hoare triple {23746#(<= 6 main_~k~0)} #t~post7 := ~j1~0;~j1~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~k~0;~k~0 := #t~post8 - 1;havoc #t~post8; {23745#(<= 5 main_~k~0)} is VALID [2018-11-23 13:12:25,407 INFO L273 TraceCheckUtils]: 32: Hoare triple {23745#(<= 5 main_~k~0)} assume !!(~j1~0 < ~n0~0 + ~n1~0); {23745#(<= 5 main_~k~0)} is VALID [2018-11-23 13:12:25,407 INFO L256 TraceCheckUtils]: 33: Hoare triple {23745#(<= 5 main_~k~0)} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {23738#true} is VALID [2018-11-23 13:12:25,407 INFO L273 TraceCheckUtils]: 34: Hoare triple {23738#true} ~cond := #in~cond; {23738#true} is VALID [2018-11-23 13:12:25,407 INFO L273 TraceCheckUtils]: 35: Hoare triple {23738#true} assume !(0 == ~cond); {23738#true} is VALID [2018-11-23 13:12:25,407 INFO L273 TraceCheckUtils]: 36: Hoare triple {23738#true} assume true; {23738#true} is VALID [2018-11-23 13:12:25,408 INFO L268 TraceCheckUtils]: 37: Hoare quadruple {23738#true} {23745#(<= 5 main_~k~0)} #70#return; {23745#(<= 5 main_~k~0)} is VALID [2018-11-23 13:12:25,409 INFO L273 TraceCheckUtils]: 38: Hoare triple {23745#(<= 5 main_~k~0)} #t~post7 := ~j1~0;~j1~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~k~0;~k~0 := #t~post8 - 1;havoc #t~post8; {23744#(<= 4 main_~k~0)} is VALID [2018-11-23 13:12:25,409 INFO L273 TraceCheckUtils]: 39: Hoare triple {23744#(<= 4 main_~k~0)} assume !!(~j1~0 < ~n0~0 + ~n1~0); {23744#(<= 4 main_~k~0)} is VALID [2018-11-23 13:12:25,409 INFO L256 TraceCheckUtils]: 40: Hoare triple {23744#(<= 4 main_~k~0)} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {23738#true} is VALID [2018-11-23 13:12:25,410 INFO L273 TraceCheckUtils]: 41: Hoare triple {23738#true} ~cond := #in~cond; {23738#true} is VALID [2018-11-23 13:12:25,410 INFO L273 TraceCheckUtils]: 42: Hoare triple {23738#true} assume !(0 == ~cond); {23738#true} is VALID [2018-11-23 13:12:25,410 INFO L273 TraceCheckUtils]: 43: Hoare triple {23738#true} assume true; {23738#true} is VALID [2018-11-23 13:12:25,411 INFO L268 TraceCheckUtils]: 44: Hoare quadruple {23738#true} {23744#(<= 4 main_~k~0)} #70#return; {23744#(<= 4 main_~k~0)} is VALID [2018-11-23 13:12:25,411 INFO L273 TraceCheckUtils]: 45: Hoare triple {23744#(<= 4 main_~k~0)} #t~post7 := ~j1~0;~j1~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~k~0;~k~0 := #t~post8 - 1;havoc #t~post8; {23743#(<= 3 main_~k~0)} is VALID [2018-11-23 13:12:25,412 INFO L273 TraceCheckUtils]: 46: Hoare triple {23743#(<= 3 main_~k~0)} assume !!(~j1~0 < ~n0~0 + ~n1~0); {23743#(<= 3 main_~k~0)} is VALID [2018-11-23 13:12:25,412 INFO L256 TraceCheckUtils]: 47: Hoare triple {23743#(<= 3 main_~k~0)} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {23738#true} is VALID [2018-11-23 13:12:25,412 INFO L273 TraceCheckUtils]: 48: Hoare triple {23738#true} ~cond := #in~cond; {23738#true} is VALID [2018-11-23 13:12:25,412 INFO L273 TraceCheckUtils]: 49: Hoare triple {23738#true} assume !(0 == ~cond); {23738#true} is VALID [2018-11-23 13:12:25,413 INFO L273 TraceCheckUtils]: 50: Hoare triple {23738#true} assume true; {23738#true} is VALID [2018-11-23 13:12:25,413 INFO L268 TraceCheckUtils]: 51: Hoare quadruple {23738#true} {23743#(<= 3 main_~k~0)} #70#return; {23743#(<= 3 main_~k~0)} is VALID [2018-11-23 13:12:25,414 INFO L273 TraceCheckUtils]: 52: Hoare triple {23743#(<= 3 main_~k~0)} #t~post7 := ~j1~0;~j1~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~k~0;~k~0 := #t~post8 - 1;havoc #t~post8; {23742#(<= 2 main_~k~0)} is VALID [2018-11-23 13:12:25,414 INFO L273 TraceCheckUtils]: 53: Hoare triple {23742#(<= 2 main_~k~0)} assume !!(~j1~0 < ~n0~0 + ~n1~0); {23742#(<= 2 main_~k~0)} is VALID [2018-11-23 13:12:25,415 INFO L256 TraceCheckUtils]: 54: Hoare triple {23742#(<= 2 main_~k~0)} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {23738#true} is VALID [2018-11-23 13:12:25,415 INFO L273 TraceCheckUtils]: 55: Hoare triple {23738#true} ~cond := #in~cond; {23738#true} is VALID [2018-11-23 13:12:25,415 INFO L273 TraceCheckUtils]: 56: Hoare triple {23738#true} assume !(0 == ~cond); {23738#true} is VALID [2018-11-23 13:12:25,415 INFO L273 TraceCheckUtils]: 57: Hoare triple {23738#true} assume true; {23738#true} is VALID [2018-11-23 13:12:25,416 INFO L268 TraceCheckUtils]: 58: Hoare quadruple {23738#true} {23742#(<= 2 main_~k~0)} #70#return; {23742#(<= 2 main_~k~0)} is VALID [2018-11-23 13:12:25,417 INFO L273 TraceCheckUtils]: 59: Hoare triple {23742#(<= 2 main_~k~0)} #t~post7 := ~j1~0;~j1~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~k~0;~k~0 := #t~post8 - 1;havoc #t~post8; {23741#(<= 1 main_~k~0)} is VALID [2018-11-23 13:12:25,417 INFO L273 TraceCheckUtils]: 60: Hoare triple {23741#(<= 1 main_~k~0)} assume !!(~j1~0 < ~n0~0 + ~n1~0); {23741#(<= 1 main_~k~0)} is VALID [2018-11-23 13:12:25,418 INFO L256 TraceCheckUtils]: 61: Hoare triple {23741#(<= 1 main_~k~0)} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {23937#(= |__VERIFIER_assert_#in~cond| 1)} is VALID [2018-11-23 13:12:25,419 INFO L273 TraceCheckUtils]: 62: Hoare triple {23937#(= |__VERIFIER_assert_#in~cond| 1)} ~cond := #in~cond; {23941#(= 1 __VERIFIER_assert_~cond)} is VALID [2018-11-23 13:12:25,419 INFO L273 TraceCheckUtils]: 63: Hoare triple {23941#(= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {23739#false} is VALID [2018-11-23 13:12:25,419 INFO L273 TraceCheckUtils]: 64: Hoare triple {23739#false} assume !false; {23739#false} is VALID [2018-11-23 13:12:25,423 INFO L134 CoverageAnalysis]: Checked inductivity of 157 backedges. 40 proven. 57 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2018-11-23 13:12:25,442 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:12:25,442 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12] total 15 [2018-11-23 13:12:25,443 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 65 [2018-11-23 13:12:25,443 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:12:25,443 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states. [2018-11-23 13:12:25,514 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:12:25,514 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-11-23 13:12:25,514 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-23 13:12:25,515 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2018-11-23 13:12:25,515 INFO L87 Difference]: Start difference. First operand 82 states and 91 transitions. Second operand 15 states. [2018-11-23 13:12:26,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:12:26,804 INFO L93 Difference]: Finished difference Result 91 states and 100 transitions. [2018-11-23 13:12:26,804 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-23 13:12:26,805 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 65 [2018-11-23 13:12:26,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:12:26,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-23 13:12:26,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 82 transitions. [2018-11-23 13:12:26,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-23 13:12:26,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 82 transitions. [2018-11-23 13:12:26,807 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states and 82 transitions. [2018-11-23 13:12:26,885 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-23 13:12:26,887 INFO L225 Difference]: With dead ends: 91 [2018-11-23 13:12:26,887 INFO L226 Difference]: Without dead ends: 89 [2018-11-23 13:12:26,887 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=70, Invalid=202, Unknown=0, NotChecked=0, Total=272 [2018-11-23 13:12:26,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2018-11-23 13:12:27,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2018-11-23 13:12:27,215 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:12:27,216 INFO L82 GeneralOperation]: Start isEquivalent. First operand 89 states. Second operand 89 states. [2018-11-23 13:12:27,216 INFO L74 IsIncluded]: Start isIncluded. First operand 89 states. Second operand 89 states. [2018-11-23 13:12:27,216 INFO L87 Difference]: Start difference. First operand 89 states. Second operand 89 states. [2018-11-23 13:12:27,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:12:27,218 INFO L93 Difference]: Finished difference Result 89 states and 98 transitions. [2018-11-23 13:12:27,218 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 98 transitions. [2018-11-23 13:12:27,218 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:12:27,219 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:12:27,219 INFO L74 IsIncluded]: Start isIncluded. First operand 89 states. Second operand 89 states. [2018-11-23 13:12:27,219 INFO L87 Difference]: Start difference. First operand 89 states. Second operand 89 states. [2018-11-23 13:12:27,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:12:27,221 INFO L93 Difference]: Finished difference Result 89 states and 98 transitions. [2018-11-23 13:12:27,221 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 98 transitions. [2018-11-23 13:12:27,221 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:12:27,221 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:12:27,221 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:12:27,222 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:12:27,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-11-23 13:12:27,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 98 transitions. [2018-11-23 13:12:27,223 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 98 transitions. Word has length 65 [2018-11-23 13:12:27,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:12:27,223 INFO L480 AbstractCegarLoop]: Abstraction has 89 states and 98 transitions. [2018-11-23 13:12:27,224 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-11-23 13:12:27,224 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 98 transitions. [2018-11-23 13:12:27,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-11-23 13:12:27,224 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:12:27,224 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 8, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:12:27,225 INFO L423 AbstractCegarLoop]: === Iteration 36 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:12:27,225 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:12:27,225 INFO L82 PathProgramCache]: Analyzing trace with hash 711908240, now seen corresponding path program 13 times [2018-11-23 13:12:27,225 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:12:27,225 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:12:27,226 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:12:27,226 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:12:27,226 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:12:27,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:12:27,694 INFO L256 TraceCheckUtils]: 0: Hoare triple {24397#true} call ULTIMATE.init(); {24397#true} is VALID [2018-11-23 13:12:27,694 INFO L273 TraceCheckUtils]: 1: Hoare triple {24397#true} assume true; {24397#true} is VALID [2018-11-23 13:12:27,695 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {24397#true} {24397#true} #66#return; {24397#true} is VALID [2018-11-23 13:12:27,695 INFO L256 TraceCheckUtils]: 3: Hoare triple {24397#true} call #t~ret9 := main(); {24397#true} is VALID [2018-11-23 13:12:27,696 INFO L273 TraceCheckUtils]: 4: Hoare triple {24397#true} havoc ~n0~0;havoc ~n1~0;~i0~0 := 0;~k~0 := 0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n0~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~n1~0 := #t~nondet2;havoc #t~nondet2; {24399#(<= main_~i0~0 0)} is VALID [2018-11-23 13:12:27,696 INFO L273 TraceCheckUtils]: 5: Hoare triple {24399#(<= main_~i0~0 0)} assume !!(-1000000 <= ~n0~0 && ~n0~0 < 1000000); {24399#(<= main_~i0~0 0)} is VALID [2018-11-23 13:12:27,697 INFO L273 TraceCheckUtils]: 6: Hoare triple {24399#(<= main_~i0~0 0)} assume !!(-1000000 <= ~n1~0 && ~n1~0 < 1000000); {24399#(<= main_~i0~0 0)} is VALID [2018-11-23 13:12:27,697 INFO L273 TraceCheckUtils]: 7: Hoare triple {24399#(<= main_~i0~0 0)} assume !(~i0~0 < ~n0~0); {24400#(<= main_~n0~0 0)} is VALID [2018-11-23 13:12:27,698 INFO L273 TraceCheckUtils]: 8: Hoare triple {24400#(<= main_~n0~0 0)} ~i1~0 := 0; {24401#(<= (+ main_~i1~0 main_~n0~0) 0)} is VALID [2018-11-23 13:12:27,699 INFO L273 TraceCheckUtils]: 9: Hoare triple {24401#(<= (+ main_~i1~0 main_~n0~0) 0)} assume !!(~i1~0 < ~n1~0);#t~post5 := ~i1~0;~i1~0 := 1 + #t~post5;havoc #t~post5;#t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {24402#(<= (+ main_~i1~0 main_~n0~0) 1)} is VALID [2018-11-23 13:12:27,700 INFO L273 TraceCheckUtils]: 10: Hoare triple {24402#(<= (+ main_~i1~0 main_~n0~0) 1)} assume !!(~i1~0 < ~n1~0);#t~post5 := ~i1~0;~i1~0 := 1 + #t~post5;havoc #t~post5;#t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {24403#(<= (+ main_~i1~0 main_~n0~0) 2)} is VALID [2018-11-23 13:12:27,701 INFO L273 TraceCheckUtils]: 11: Hoare triple {24403#(<= (+ main_~i1~0 main_~n0~0) 2)} assume !!(~i1~0 < ~n1~0);#t~post5 := ~i1~0;~i1~0 := 1 + #t~post5;havoc #t~post5;#t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {24404#(<= (+ main_~i1~0 main_~n0~0) 3)} is VALID [2018-11-23 13:12:27,702 INFO L273 TraceCheckUtils]: 12: Hoare triple {24404#(<= (+ main_~i1~0 main_~n0~0) 3)} assume !!(~i1~0 < ~n1~0);#t~post5 := ~i1~0;~i1~0 := 1 + #t~post5;havoc #t~post5;#t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {24405#(<= (+ main_~i1~0 main_~n0~0) 4)} is VALID [2018-11-23 13:12:27,703 INFO L273 TraceCheckUtils]: 13: Hoare triple {24405#(<= (+ main_~i1~0 main_~n0~0) 4)} assume !!(~i1~0 < ~n1~0);#t~post5 := ~i1~0;~i1~0 := 1 + #t~post5;havoc #t~post5;#t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {24406#(<= (+ main_~i1~0 main_~n0~0) 5)} is VALID [2018-11-23 13:12:27,704 INFO L273 TraceCheckUtils]: 14: Hoare triple {24406#(<= (+ main_~i1~0 main_~n0~0) 5)} assume !!(~i1~0 < ~n1~0);#t~post5 := ~i1~0;~i1~0 := 1 + #t~post5;havoc #t~post5;#t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {24407#(<= (+ main_~i1~0 main_~n0~0) 6)} is VALID [2018-11-23 13:12:27,705 INFO L273 TraceCheckUtils]: 15: Hoare triple {24407#(<= (+ main_~i1~0 main_~n0~0) 6)} assume !!(~i1~0 < ~n1~0);#t~post5 := ~i1~0;~i1~0 := 1 + #t~post5;havoc #t~post5;#t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {24408#(<= (+ main_~i1~0 main_~n0~0) 7)} is VALID [2018-11-23 13:12:27,705 INFO L273 TraceCheckUtils]: 16: Hoare triple {24408#(<= (+ main_~i1~0 main_~n0~0) 7)} assume !(~i1~0 < ~n1~0); {24409#(<= (+ main_~n0~0 main_~n1~0) 7)} is VALID [2018-11-23 13:12:27,706 INFO L273 TraceCheckUtils]: 17: Hoare triple {24409#(<= (+ main_~n0~0 main_~n1~0) 7)} ~j1~0 := 0; {24410#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 7))} is VALID [2018-11-23 13:12:27,707 INFO L273 TraceCheckUtils]: 18: Hoare triple {24410#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 7))} assume !!(~j1~0 < ~n0~0 + ~n1~0); {24410#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 7))} is VALID [2018-11-23 13:12:27,707 INFO L256 TraceCheckUtils]: 19: Hoare triple {24410#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 7))} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {24397#true} is VALID [2018-11-23 13:12:27,707 INFO L273 TraceCheckUtils]: 20: Hoare triple {24397#true} ~cond := #in~cond; {24397#true} is VALID [2018-11-23 13:12:27,707 INFO L273 TraceCheckUtils]: 21: Hoare triple {24397#true} assume !(0 == ~cond); {24397#true} is VALID [2018-11-23 13:12:27,708 INFO L273 TraceCheckUtils]: 22: Hoare triple {24397#true} assume true; {24397#true} is VALID [2018-11-23 13:12:27,708 INFO L268 TraceCheckUtils]: 23: Hoare quadruple {24397#true} {24410#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 7))} #70#return; {24410#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 7))} is VALID [2018-11-23 13:12:27,709 INFO L273 TraceCheckUtils]: 24: Hoare triple {24410#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 7))} #t~post7 := ~j1~0;~j1~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~k~0;~k~0 := #t~post8 - 1;havoc #t~post8; {24411#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 6))} is VALID [2018-11-23 13:12:27,710 INFO L273 TraceCheckUtils]: 25: Hoare triple {24411#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 6))} assume !!(~j1~0 < ~n0~0 + ~n1~0); {24411#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 6))} is VALID [2018-11-23 13:12:27,710 INFO L256 TraceCheckUtils]: 26: Hoare triple {24411#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 6))} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {24397#true} is VALID [2018-11-23 13:12:27,710 INFO L273 TraceCheckUtils]: 27: Hoare triple {24397#true} ~cond := #in~cond; {24397#true} is VALID [2018-11-23 13:12:27,711 INFO L273 TraceCheckUtils]: 28: Hoare triple {24397#true} assume !(0 == ~cond); {24397#true} is VALID [2018-11-23 13:12:27,711 INFO L273 TraceCheckUtils]: 29: Hoare triple {24397#true} assume true; {24397#true} is VALID [2018-11-23 13:12:27,711 INFO L268 TraceCheckUtils]: 30: Hoare quadruple {24397#true} {24411#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 6))} #70#return; {24411#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 6))} is VALID [2018-11-23 13:12:27,712 INFO L273 TraceCheckUtils]: 31: Hoare triple {24411#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 6))} #t~post7 := ~j1~0;~j1~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~k~0;~k~0 := #t~post8 - 1;havoc #t~post8; {24412#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 5))} is VALID [2018-11-23 13:12:27,713 INFO L273 TraceCheckUtils]: 32: Hoare triple {24412#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 5))} assume !!(~j1~0 < ~n0~0 + ~n1~0); {24412#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 5))} is VALID [2018-11-23 13:12:27,713 INFO L256 TraceCheckUtils]: 33: Hoare triple {24412#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 5))} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {24397#true} is VALID [2018-11-23 13:12:27,713 INFO L273 TraceCheckUtils]: 34: Hoare triple {24397#true} ~cond := #in~cond; {24397#true} is VALID [2018-11-23 13:12:27,714 INFO L273 TraceCheckUtils]: 35: Hoare triple {24397#true} assume !(0 == ~cond); {24397#true} is VALID [2018-11-23 13:12:27,714 INFO L273 TraceCheckUtils]: 36: Hoare triple {24397#true} assume true; {24397#true} is VALID [2018-11-23 13:12:27,714 INFO L268 TraceCheckUtils]: 37: Hoare quadruple {24397#true} {24412#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 5))} #70#return; {24412#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 5))} is VALID [2018-11-23 13:12:27,715 INFO L273 TraceCheckUtils]: 38: Hoare triple {24412#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 5))} #t~post7 := ~j1~0;~j1~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~k~0;~k~0 := #t~post8 - 1;havoc #t~post8; {24413#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 4))} is VALID [2018-11-23 13:12:27,715 INFO L273 TraceCheckUtils]: 39: Hoare triple {24413#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 4))} assume !!(~j1~0 < ~n0~0 + ~n1~0); {24413#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 4))} is VALID [2018-11-23 13:12:27,715 INFO L256 TraceCheckUtils]: 40: Hoare triple {24413#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 4))} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {24397#true} is VALID [2018-11-23 13:12:27,715 INFO L273 TraceCheckUtils]: 41: Hoare triple {24397#true} ~cond := #in~cond; {24397#true} is VALID [2018-11-23 13:12:27,715 INFO L273 TraceCheckUtils]: 42: Hoare triple {24397#true} assume !(0 == ~cond); {24397#true} is VALID [2018-11-23 13:12:27,716 INFO L273 TraceCheckUtils]: 43: Hoare triple {24397#true} assume true; {24397#true} is VALID [2018-11-23 13:12:27,716 INFO L268 TraceCheckUtils]: 44: Hoare quadruple {24397#true} {24413#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 4))} #70#return; {24413#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 4))} is VALID [2018-11-23 13:12:27,717 INFO L273 TraceCheckUtils]: 45: Hoare triple {24413#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 4))} #t~post7 := ~j1~0;~j1~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~k~0;~k~0 := #t~post8 - 1;havoc #t~post8; {24414#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 3))} is VALID [2018-11-23 13:12:27,718 INFO L273 TraceCheckUtils]: 46: Hoare triple {24414#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 3))} assume !!(~j1~0 < ~n0~0 + ~n1~0); {24414#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 3))} is VALID [2018-11-23 13:12:27,718 INFO L256 TraceCheckUtils]: 47: Hoare triple {24414#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 3))} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {24397#true} is VALID [2018-11-23 13:12:27,718 INFO L273 TraceCheckUtils]: 48: Hoare triple {24397#true} ~cond := #in~cond; {24397#true} is VALID [2018-11-23 13:12:27,719 INFO L273 TraceCheckUtils]: 49: Hoare triple {24397#true} assume !(0 == ~cond); {24397#true} is VALID [2018-11-23 13:12:27,719 INFO L273 TraceCheckUtils]: 50: Hoare triple {24397#true} assume true; {24397#true} is VALID [2018-11-23 13:12:27,743 INFO L268 TraceCheckUtils]: 51: Hoare quadruple {24397#true} {24414#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 3))} #70#return; {24414#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 3))} is VALID [2018-11-23 13:12:27,752 INFO L273 TraceCheckUtils]: 52: Hoare triple {24414#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 3))} #t~post7 := ~j1~0;~j1~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~k~0;~k~0 := #t~post8 - 1;havoc #t~post8; {24415#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 2))} is VALID [2018-11-23 13:12:27,767 INFO L273 TraceCheckUtils]: 53: Hoare triple {24415#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 2))} assume !!(~j1~0 < ~n0~0 + ~n1~0); {24415#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 2))} is VALID [2018-11-23 13:12:27,767 INFO L256 TraceCheckUtils]: 54: Hoare triple {24415#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 2))} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {24397#true} is VALID [2018-11-23 13:12:27,767 INFO L273 TraceCheckUtils]: 55: Hoare triple {24397#true} ~cond := #in~cond; {24397#true} is VALID [2018-11-23 13:12:27,768 INFO L273 TraceCheckUtils]: 56: Hoare triple {24397#true} assume !(0 == ~cond); {24397#true} is VALID [2018-11-23 13:12:27,768 INFO L273 TraceCheckUtils]: 57: Hoare triple {24397#true} assume true; {24397#true} is VALID [2018-11-23 13:12:27,782 INFO L268 TraceCheckUtils]: 58: Hoare quadruple {24397#true} {24415#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 2))} #70#return; {24415#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 2))} is VALID [2018-11-23 13:12:27,797 INFO L273 TraceCheckUtils]: 59: Hoare triple {24415#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 2))} #t~post7 := ~j1~0;~j1~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~k~0;~k~0 := #t~post8 - 1;havoc #t~post8; {24416#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 1))} is VALID [2018-11-23 13:12:27,806 INFO L273 TraceCheckUtils]: 60: Hoare triple {24416#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 1))} assume !!(~j1~0 < ~n0~0 + ~n1~0); {24416#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 1))} is VALID [2018-11-23 13:12:27,806 INFO L256 TraceCheckUtils]: 61: Hoare triple {24416#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 1))} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {24397#true} is VALID [2018-11-23 13:12:27,806 INFO L273 TraceCheckUtils]: 62: Hoare triple {24397#true} ~cond := #in~cond; {24397#true} is VALID [2018-11-23 13:12:27,806 INFO L273 TraceCheckUtils]: 63: Hoare triple {24397#true} assume !(0 == ~cond); {24397#true} is VALID [2018-11-23 13:12:27,807 INFO L273 TraceCheckUtils]: 64: Hoare triple {24397#true} assume true; {24397#true} is VALID [2018-11-23 13:12:27,822 INFO L268 TraceCheckUtils]: 65: Hoare quadruple {24397#true} {24416#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 1))} #70#return; {24416#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 1))} is VALID [2018-11-23 13:12:27,837 INFO L273 TraceCheckUtils]: 66: Hoare triple {24416#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 1))} #t~post7 := ~j1~0;~j1~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~k~0;~k~0 := #t~post8 - 1;havoc #t~post8; {24417#(<= (+ main_~n0~0 main_~n1~0) main_~j1~0)} is VALID [2018-11-23 13:12:27,851 INFO L273 TraceCheckUtils]: 67: Hoare triple {24417#(<= (+ main_~n0~0 main_~n1~0) main_~j1~0)} assume !!(~j1~0 < ~n0~0 + ~n1~0); {24398#false} is VALID [2018-11-23 13:12:27,851 INFO L256 TraceCheckUtils]: 68: Hoare triple {24398#false} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {24398#false} is VALID [2018-11-23 13:12:27,851 INFO L273 TraceCheckUtils]: 69: Hoare triple {24398#false} ~cond := #in~cond; {24398#false} is VALID [2018-11-23 13:12:27,851 INFO L273 TraceCheckUtils]: 70: Hoare triple {24398#false} assume 0 == ~cond; {24398#false} is VALID [2018-11-23 13:12:27,852 INFO L273 TraceCheckUtils]: 71: Hoare triple {24398#false} assume !false; {24398#false} is VALID [2018-11-23 13:12:27,858 INFO L134 CoverageAnalysis]: Checked inductivity of 203 backedges. 91 proven. 28 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2018-11-23 13:12:27,858 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:12:27,858 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:12:27,872 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:12:27,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:12:27,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:12:27,927 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:12:28,490 INFO L256 TraceCheckUtils]: 0: Hoare triple {24397#true} call ULTIMATE.init(); {24397#true} is VALID [2018-11-23 13:12:28,490 INFO L273 TraceCheckUtils]: 1: Hoare triple {24397#true} assume true; {24397#true} is VALID [2018-11-23 13:12:28,490 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {24397#true} {24397#true} #66#return; {24397#true} is VALID [2018-11-23 13:12:28,491 INFO L256 TraceCheckUtils]: 3: Hoare triple {24397#true} call #t~ret9 := main(); {24397#true} is VALID [2018-11-23 13:12:28,491 INFO L273 TraceCheckUtils]: 4: Hoare triple {24397#true} havoc ~n0~0;havoc ~n1~0;~i0~0 := 0;~k~0 := 0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n0~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~n1~0 := #t~nondet2;havoc #t~nondet2; {24399#(<= main_~i0~0 0)} is VALID [2018-11-23 13:12:28,492 INFO L273 TraceCheckUtils]: 5: Hoare triple {24399#(<= main_~i0~0 0)} assume !!(-1000000 <= ~n0~0 && ~n0~0 < 1000000); {24399#(<= main_~i0~0 0)} is VALID [2018-11-23 13:12:28,492 INFO L273 TraceCheckUtils]: 6: Hoare triple {24399#(<= main_~i0~0 0)} assume !!(-1000000 <= ~n1~0 && ~n1~0 < 1000000); {24399#(<= main_~i0~0 0)} is VALID [2018-11-23 13:12:28,493 INFO L273 TraceCheckUtils]: 7: Hoare triple {24399#(<= main_~i0~0 0)} assume !(~i0~0 < ~n0~0); {24400#(<= main_~n0~0 0)} is VALID [2018-11-23 13:12:28,493 INFO L273 TraceCheckUtils]: 8: Hoare triple {24400#(<= main_~n0~0 0)} ~i1~0 := 0; {24445#(and (<= main_~i1~0 0) (<= main_~n0~0 0))} is VALID [2018-11-23 13:12:28,494 INFO L273 TraceCheckUtils]: 9: Hoare triple {24445#(and (<= main_~i1~0 0) (<= main_~n0~0 0))} assume !!(~i1~0 < ~n1~0);#t~post5 := ~i1~0;~i1~0 := 1 + #t~post5;havoc #t~post5;#t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {24449#(and (<= main_~i1~0 1) (<= main_~n0~0 0))} is VALID [2018-11-23 13:12:28,494 INFO L273 TraceCheckUtils]: 10: Hoare triple {24449#(and (<= main_~i1~0 1) (<= main_~n0~0 0))} assume !!(~i1~0 < ~n1~0);#t~post5 := ~i1~0;~i1~0 := 1 + #t~post5;havoc #t~post5;#t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {24453#(and (<= main_~i1~0 2) (<= main_~n0~0 0))} is VALID [2018-11-23 13:12:28,495 INFO L273 TraceCheckUtils]: 11: Hoare triple {24453#(and (<= main_~i1~0 2) (<= main_~n0~0 0))} assume !!(~i1~0 < ~n1~0);#t~post5 := ~i1~0;~i1~0 := 1 + #t~post5;havoc #t~post5;#t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {24457#(and (<= main_~n0~0 0) (<= main_~i1~0 3))} is VALID [2018-11-23 13:12:28,496 INFO L273 TraceCheckUtils]: 12: Hoare triple {24457#(and (<= main_~n0~0 0) (<= main_~i1~0 3))} assume !!(~i1~0 < ~n1~0);#t~post5 := ~i1~0;~i1~0 := 1 + #t~post5;havoc #t~post5;#t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {24461#(and (<= main_~i1~0 4) (<= main_~n0~0 0))} is VALID [2018-11-23 13:12:28,497 INFO L273 TraceCheckUtils]: 13: Hoare triple {24461#(and (<= main_~i1~0 4) (<= main_~n0~0 0))} assume !!(~i1~0 < ~n1~0);#t~post5 := ~i1~0;~i1~0 := 1 + #t~post5;havoc #t~post5;#t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {24465#(and (<= main_~i1~0 5) (<= main_~n0~0 0))} is VALID [2018-11-23 13:12:28,498 INFO L273 TraceCheckUtils]: 14: Hoare triple {24465#(and (<= main_~i1~0 5) (<= main_~n0~0 0))} assume !!(~i1~0 < ~n1~0);#t~post5 := ~i1~0;~i1~0 := 1 + #t~post5;havoc #t~post5;#t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {24469#(and (<= main_~n0~0 0) (<= main_~i1~0 6))} is VALID [2018-11-23 13:12:28,498 INFO L273 TraceCheckUtils]: 15: Hoare triple {24469#(and (<= main_~n0~0 0) (<= main_~i1~0 6))} assume !!(~i1~0 < ~n1~0);#t~post5 := ~i1~0;~i1~0 := 1 + #t~post5;havoc #t~post5;#t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {24473#(and (<= main_~i1~0 7) (<= main_~n0~0 0))} is VALID [2018-11-23 13:12:28,499 INFO L273 TraceCheckUtils]: 16: Hoare triple {24473#(and (<= main_~i1~0 7) (<= main_~n0~0 0))} assume !(~i1~0 < ~n1~0); {24477#(and (<= main_~n0~0 0) (<= main_~n1~0 7))} is VALID [2018-11-23 13:12:28,500 INFO L273 TraceCheckUtils]: 17: Hoare triple {24477#(and (<= main_~n0~0 0) (<= main_~n1~0 7))} ~j1~0 := 0; {24481#(and (<= 0 main_~j1~0) (<= main_~n0~0 0) (<= main_~n1~0 7))} is VALID [2018-11-23 13:12:28,500 INFO L273 TraceCheckUtils]: 18: Hoare triple {24481#(and (<= 0 main_~j1~0) (<= main_~n0~0 0) (<= main_~n1~0 7))} assume !!(~j1~0 < ~n0~0 + ~n1~0); {24481#(and (<= 0 main_~j1~0) (<= main_~n0~0 0) (<= main_~n1~0 7))} is VALID [2018-11-23 13:12:28,501 INFO L256 TraceCheckUtils]: 19: Hoare triple {24481#(and (<= 0 main_~j1~0) (<= main_~n0~0 0) (<= main_~n1~0 7))} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {24397#true} is VALID [2018-11-23 13:12:28,501 INFO L273 TraceCheckUtils]: 20: Hoare triple {24397#true} ~cond := #in~cond; {24397#true} is VALID [2018-11-23 13:12:28,501 INFO L273 TraceCheckUtils]: 21: Hoare triple {24397#true} assume !(0 == ~cond); {24397#true} is VALID [2018-11-23 13:12:28,501 INFO L273 TraceCheckUtils]: 22: Hoare triple {24397#true} assume true; {24397#true} is VALID [2018-11-23 13:12:28,502 INFO L268 TraceCheckUtils]: 23: Hoare quadruple {24397#true} {24481#(and (<= 0 main_~j1~0) (<= main_~n0~0 0) (<= main_~n1~0 7))} #70#return; {24481#(and (<= 0 main_~j1~0) (<= main_~n0~0 0) (<= main_~n1~0 7))} is VALID [2018-11-23 13:12:28,503 INFO L273 TraceCheckUtils]: 24: Hoare triple {24481#(and (<= 0 main_~j1~0) (<= main_~n0~0 0) (<= main_~n1~0 7))} #t~post7 := ~j1~0;~j1~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~k~0;~k~0 := #t~post8 - 1;havoc #t~post8; {24503#(and (<= 1 main_~j1~0) (<= main_~n0~0 0) (<= main_~n1~0 7))} is VALID [2018-11-23 13:12:28,503 INFO L273 TraceCheckUtils]: 25: Hoare triple {24503#(and (<= 1 main_~j1~0) (<= main_~n0~0 0) (<= main_~n1~0 7))} assume !!(~j1~0 < ~n0~0 + ~n1~0); {24503#(and (<= 1 main_~j1~0) (<= main_~n0~0 0) (<= main_~n1~0 7))} is VALID [2018-11-23 13:12:28,503 INFO L256 TraceCheckUtils]: 26: Hoare triple {24503#(and (<= 1 main_~j1~0) (<= main_~n0~0 0) (<= main_~n1~0 7))} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {24397#true} is VALID [2018-11-23 13:12:28,503 INFO L273 TraceCheckUtils]: 27: Hoare triple {24397#true} ~cond := #in~cond; {24397#true} is VALID [2018-11-23 13:12:28,503 INFO L273 TraceCheckUtils]: 28: Hoare triple {24397#true} assume !(0 == ~cond); {24397#true} is VALID [2018-11-23 13:12:28,503 INFO L273 TraceCheckUtils]: 29: Hoare triple {24397#true} assume true; {24397#true} is VALID [2018-11-23 13:12:28,504 INFO L268 TraceCheckUtils]: 30: Hoare quadruple {24397#true} {24503#(and (<= 1 main_~j1~0) (<= main_~n0~0 0) (<= main_~n1~0 7))} #70#return; {24503#(and (<= 1 main_~j1~0) (<= main_~n0~0 0) (<= main_~n1~0 7))} is VALID [2018-11-23 13:12:28,505 INFO L273 TraceCheckUtils]: 31: Hoare triple {24503#(and (<= 1 main_~j1~0) (<= main_~n0~0 0) (<= main_~n1~0 7))} #t~post7 := ~j1~0;~j1~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~k~0;~k~0 := #t~post8 - 1;havoc #t~post8; {24525#(and (<= main_~n0~0 0) (<= 2 main_~j1~0) (<= main_~n1~0 7))} is VALID [2018-11-23 13:12:28,505 INFO L273 TraceCheckUtils]: 32: Hoare triple {24525#(and (<= main_~n0~0 0) (<= 2 main_~j1~0) (<= main_~n1~0 7))} assume !!(~j1~0 < ~n0~0 + ~n1~0); {24525#(and (<= main_~n0~0 0) (<= 2 main_~j1~0) (<= main_~n1~0 7))} is VALID [2018-11-23 13:12:28,505 INFO L256 TraceCheckUtils]: 33: Hoare triple {24525#(and (<= main_~n0~0 0) (<= 2 main_~j1~0) (<= main_~n1~0 7))} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {24397#true} is VALID [2018-11-23 13:12:28,506 INFO L273 TraceCheckUtils]: 34: Hoare triple {24397#true} ~cond := #in~cond; {24397#true} is VALID [2018-11-23 13:12:28,506 INFO L273 TraceCheckUtils]: 35: Hoare triple {24397#true} assume !(0 == ~cond); {24397#true} is VALID [2018-11-23 13:12:28,506 INFO L273 TraceCheckUtils]: 36: Hoare triple {24397#true} assume true; {24397#true} is VALID [2018-11-23 13:12:28,507 INFO L268 TraceCheckUtils]: 37: Hoare quadruple {24397#true} {24525#(and (<= main_~n0~0 0) (<= 2 main_~j1~0) (<= main_~n1~0 7))} #70#return; {24525#(and (<= main_~n0~0 0) (<= 2 main_~j1~0) (<= main_~n1~0 7))} is VALID [2018-11-23 13:12:28,508 INFO L273 TraceCheckUtils]: 38: Hoare triple {24525#(and (<= main_~n0~0 0) (<= 2 main_~j1~0) (<= main_~n1~0 7))} #t~post7 := ~j1~0;~j1~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~k~0;~k~0 := #t~post8 - 1;havoc #t~post8; {24547#(and (<= 3 main_~j1~0) (<= main_~n0~0 0) (<= main_~n1~0 7))} is VALID [2018-11-23 13:12:28,508 INFO L273 TraceCheckUtils]: 39: Hoare triple {24547#(and (<= 3 main_~j1~0) (<= main_~n0~0 0) (<= main_~n1~0 7))} assume !!(~j1~0 < ~n0~0 + ~n1~0); {24547#(and (<= 3 main_~j1~0) (<= main_~n0~0 0) (<= main_~n1~0 7))} is VALID [2018-11-23 13:12:28,508 INFO L256 TraceCheckUtils]: 40: Hoare triple {24547#(and (<= 3 main_~j1~0) (<= main_~n0~0 0) (<= main_~n1~0 7))} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {24397#true} is VALID [2018-11-23 13:12:28,509 INFO L273 TraceCheckUtils]: 41: Hoare triple {24397#true} ~cond := #in~cond; {24397#true} is VALID [2018-11-23 13:12:28,509 INFO L273 TraceCheckUtils]: 42: Hoare triple {24397#true} assume !(0 == ~cond); {24397#true} is VALID [2018-11-23 13:12:28,509 INFO L273 TraceCheckUtils]: 43: Hoare triple {24397#true} assume true; {24397#true} is VALID [2018-11-23 13:12:28,510 INFO L268 TraceCheckUtils]: 44: Hoare quadruple {24397#true} {24547#(and (<= 3 main_~j1~0) (<= main_~n0~0 0) (<= main_~n1~0 7))} #70#return; {24547#(and (<= 3 main_~j1~0) (<= main_~n0~0 0) (<= main_~n1~0 7))} is VALID [2018-11-23 13:12:28,510 INFO L273 TraceCheckUtils]: 45: Hoare triple {24547#(and (<= 3 main_~j1~0) (<= main_~n0~0 0) (<= main_~n1~0 7))} #t~post7 := ~j1~0;~j1~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~k~0;~k~0 := #t~post8 - 1;havoc #t~post8; {24569#(and (<= 4 main_~j1~0) (<= main_~n0~0 0) (<= main_~n1~0 7))} is VALID [2018-11-23 13:12:28,511 INFO L273 TraceCheckUtils]: 46: Hoare triple {24569#(and (<= 4 main_~j1~0) (<= main_~n0~0 0) (<= main_~n1~0 7))} assume !!(~j1~0 < ~n0~0 + ~n1~0); {24569#(and (<= 4 main_~j1~0) (<= main_~n0~0 0) (<= main_~n1~0 7))} is VALID [2018-11-23 13:12:28,511 INFO L256 TraceCheckUtils]: 47: Hoare triple {24569#(and (<= 4 main_~j1~0) (<= main_~n0~0 0) (<= main_~n1~0 7))} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {24397#true} is VALID [2018-11-23 13:12:28,512 INFO L273 TraceCheckUtils]: 48: Hoare triple {24397#true} ~cond := #in~cond; {24397#true} is VALID [2018-11-23 13:12:28,512 INFO L273 TraceCheckUtils]: 49: Hoare triple {24397#true} assume !(0 == ~cond); {24397#true} is VALID [2018-11-23 13:12:28,512 INFO L273 TraceCheckUtils]: 50: Hoare triple {24397#true} assume true; {24397#true} is VALID [2018-11-23 13:12:28,513 INFO L268 TraceCheckUtils]: 51: Hoare quadruple {24397#true} {24569#(and (<= 4 main_~j1~0) (<= main_~n0~0 0) (<= main_~n1~0 7))} #70#return; {24569#(and (<= 4 main_~j1~0) (<= main_~n0~0 0) (<= main_~n1~0 7))} is VALID [2018-11-23 13:12:28,513 INFO L273 TraceCheckUtils]: 52: Hoare triple {24569#(and (<= 4 main_~j1~0) (<= main_~n0~0 0) (<= main_~n1~0 7))} #t~post7 := ~j1~0;~j1~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~k~0;~k~0 := #t~post8 - 1;havoc #t~post8; {24591#(and (<= main_~n0~0 0) (<= 5 main_~j1~0) (<= main_~n1~0 7))} is VALID [2018-11-23 13:12:28,514 INFO L273 TraceCheckUtils]: 53: Hoare triple {24591#(and (<= main_~n0~0 0) (<= 5 main_~j1~0) (<= main_~n1~0 7))} assume !!(~j1~0 < ~n0~0 + ~n1~0); {24591#(and (<= main_~n0~0 0) (<= 5 main_~j1~0) (<= main_~n1~0 7))} is VALID [2018-11-23 13:12:28,514 INFO L256 TraceCheckUtils]: 54: Hoare triple {24591#(and (<= main_~n0~0 0) (<= 5 main_~j1~0) (<= main_~n1~0 7))} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {24397#true} is VALID [2018-11-23 13:12:28,515 INFO L273 TraceCheckUtils]: 55: Hoare triple {24397#true} ~cond := #in~cond; {24397#true} is VALID [2018-11-23 13:12:28,515 INFO L273 TraceCheckUtils]: 56: Hoare triple {24397#true} assume !(0 == ~cond); {24397#true} is VALID [2018-11-23 13:12:28,515 INFO L273 TraceCheckUtils]: 57: Hoare triple {24397#true} assume true; {24397#true} is VALID [2018-11-23 13:12:28,516 INFO L268 TraceCheckUtils]: 58: Hoare quadruple {24397#true} {24591#(and (<= main_~n0~0 0) (<= 5 main_~j1~0) (<= main_~n1~0 7))} #70#return; {24591#(and (<= main_~n0~0 0) (<= 5 main_~j1~0) (<= main_~n1~0 7))} is VALID [2018-11-23 13:12:28,516 INFO L273 TraceCheckUtils]: 59: Hoare triple {24591#(and (<= main_~n0~0 0) (<= 5 main_~j1~0) (<= main_~n1~0 7))} #t~post7 := ~j1~0;~j1~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~k~0;~k~0 := #t~post8 - 1;havoc #t~post8; {24613#(and (<= 6 main_~j1~0) (<= main_~n0~0 0) (<= main_~n1~0 7))} is VALID [2018-11-23 13:12:28,517 INFO L273 TraceCheckUtils]: 60: Hoare triple {24613#(and (<= 6 main_~j1~0) (<= main_~n0~0 0) (<= main_~n1~0 7))} assume !!(~j1~0 < ~n0~0 + ~n1~0); {24613#(and (<= 6 main_~j1~0) (<= main_~n0~0 0) (<= main_~n1~0 7))} is VALID [2018-11-23 13:12:28,517 INFO L256 TraceCheckUtils]: 61: Hoare triple {24613#(and (<= 6 main_~j1~0) (<= main_~n0~0 0) (<= main_~n1~0 7))} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {24397#true} is VALID [2018-11-23 13:12:28,517 INFO L273 TraceCheckUtils]: 62: Hoare triple {24397#true} ~cond := #in~cond; {24397#true} is VALID [2018-11-23 13:12:28,518 INFO L273 TraceCheckUtils]: 63: Hoare triple {24397#true} assume !(0 == ~cond); {24397#true} is VALID [2018-11-23 13:12:28,518 INFO L273 TraceCheckUtils]: 64: Hoare triple {24397#true} assume true; {24397#true} is VALID [2018-11-23 13:12:28,519 INFO L268 TraceCheckUtils]: 65: Hoare quadruple {24397#true} {24613#(and (<= 6 main_~j1~0) (<= main_~n0~0 0) (<= main_~n1~0 7))} #70#return; {24613#(and (<= 6 main_~j1~0) (<= main_~n0~0 0) (<= main_~n1~0 7))} is VALID [2018-11-23 13:12:28,519 INFO L273 TraceCheckUtils]: 66: Hoare triple {24613#(and (<= 6 main_~j1~0) (<= main_~n0~0 0) (<= main_~n1~0 7))} #t~post7 := ~j1~0;~j1~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~k~0;~k~0 := #t~post8 - 1;havoc #t~post8; {24635#(and (<= 7 main_~j1~0) (<= main_~n0~0 0) (<= main_~n1~0 7))} is VALID [2018-11-23 13:12:28,520 INFO L273 TraceCheckUtils]: 67: Hoare triple {24635#(and (<= 7 main_~j1~0) (<= main_~n0~0 0) (<= main_~n1~0 7))} assume !!(~j1~0 < ~n0~0 + ~n1~0); {24398#false} is VALID [2018-11-23 13:12:28,520 INFO L256 TraceCheckUtils]: 68: Hoare triple {24398#false} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {24398#false} is VALID [2018-11-23 13:12:28,520 INFO L273 TraceCheckUtils]: 69: Hoare triple {24398#false} ~cond := #in~cond; {24398#false} is VALID [2018-11-23 13:12:28,521 INFO L273 TraceCheckUtils]: 70: Hoare triple {24398#false} assume 0 == ~cond; {24398#false} is VALID [2018-11-23 13:12:28,521 INFO L273 TraceCheckUtils]: 71: Hoare triple {24398#false} assume !false; {24398#false} is VALID [2018-11-23 13:12:28,527 INFO L134 CoverageAnalysis]: Checked inductivity of 203 backedges. 91 proven. 28 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2018-11-23 13:12:28,546 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:12:28,547 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 38 [2018-11-23 13:12:28,547 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 72 [2018-11-23 13:12:28,547 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:12:28,547 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 38 states. [2018-11-23 13:12:28,629 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 93 edges. 93 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:12:28,629 INFO L459 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-11-23 13:12:28,630 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-11-23 13:12:28,630 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=291, Invalid=1115, Unknown=0, NotChecked=0, Total=1406 [2018-11-23 13:12:28,630 INFO L87 Difference]: Start difference. First operand 89 states and 98 transitions. Second operand 38 states. [2018-11-23 13:12:31,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:12:31,624 INFO L93 Difference]: Finished difference Result 153 states and 179 transitions. [2018-11-23 13:12:31,624 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-11-23 13:12:31,624 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 72 [2018-11-23 13:12:31,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:12:31,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-11-23 13:12:31,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 80 transitions. [2018-11-23 13:12:31,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-11-23 13:12:31,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 80 transitions. [2018-11-23 13:12:31,626 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 21 states and 80 transitions. [2018-11-23 13:12:31,706 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 80 edges. 80 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:12:31,710 INFO L225 Difference]: With dead ends: 153 [2018-11-23 13:12:31,710 INFO L226 Difference]: Without dead ends: 121 [2018-11-23 13:12:31,711 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 855 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=633, Invalid=2447, Unknown=0, NotChecked=0, Total=3080 [2018-11-23 13:12:31,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2018-11-23 13:12:32,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 90. [2018-11-23 13:12:32,169 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:12:32,169 INFO L82 GeneralOperation]: Start isEquivalent. First operand 121 states. Second operand 90 states. [2018-11-23 13:12:32,169 INFO L74 IsIncluded]: Start isIncluded. First operand 121 states. Second operand 90 states. [2018-11-23 13:12:32,170 INFO L87 Difference]: Start difference. First operand 121 states. Second operand 90 states. [2018-11-23 13:12:32,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:12:32,173 INFO L93 Difference]: Finished difference Result 121 states and 139 transitions. [2018-11-23 13:12:32,173 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 139 transitions. [2018-11-23 13:12:32,173 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:12:32,173 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:12:32,173 INFO L74 IsIncluded]: Start isIncluded. First operand 90 states. Second operand 121 states. [2018-11-23 13:12:32,173 INFO L87 Difference]: Start difference. First operand 90 states. Second operand 121 states. [2018-11-23 13:12:32,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:12:32,176 INFO L93 Difference]: Finished difference Result 121 states and 139 transitions. [2018-11-23 13:12:32,176 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 139 transitions. [2018-11-23 13:12:32,176 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:12:32,176 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:12:32,177 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:12:32,177 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:12:32,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2018-11-23 13:12:32,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 99 transitions. [2018-11-23 13:12:32,178 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 99 transitions. Word has length 72 [2018-11-23 13:12:32,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:12:32,179 INFO L480 AbstractCegarLoop]: Abstraction has 90 states and 99 transitions. [2018-11-23 13:12:32,179 INFO L481 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-11-23 13:12:32,179 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 99 transitions. [2018-11-23 13:12:32,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-11-23 13:12:32,179 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:12:32,180 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 8, 7, 7, 7, 7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:12:32,180 INFO L423 AbstractCegarLoop]: === Iteration 37 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:12:32,180 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:12:32,180 INFO L82 PathProgramCache]: Analyzing trace with hash 1067191823, now seen corresponding path program 16 times [2018-11-23 13:12:32,180 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:12:32,181 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:12:32,181 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:12:32,181 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:12:32,181 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:12:32,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:12:32,494 INFO L256 TraceCheckUtils]: 0: Hoare triple {25302#true} call ULTIMATE.init(); {25302#true} is VALID [2018-11-23 13:12:32,494 INFO L273 TraceCheckUtils]: 1: Hoare triple {25302#true} assume true; {25302#true} is VALID [2018-11-23 13:12:32,494 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {25302#true} {25302#true} #66#return; {25302#true} is VALID [2018-11-23 13:12:32,494 INFO L256 TraceCheckUtils]: 3: Hoare triple {25302#true} call #t~ret9 := main(); {25302#true} is VALID [2018-11-23 13:12:32,495 INFO L273 TraceCheckUtils]: 4: Hoare triple {25302#true} havoc ~n0~0;havoc ~n1~0;~i0~0 := 0;~k~0 := 0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n0~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~n1~0 := #t~nondet2;havoc #t~nondet2; {25304#(<= main_~i0~0 0)} is VALID [2018-11-23 13:12:32,495 INFO L273 TraceCheckUtils]: 5: Hoare triple {25304#(<= main_~i0~0 0)} assume !!(-1000000 <= ~n0~0 && ~n0~0 < 1000000); {25304#(<= main_~i0~0 0)} is VALID [2018-11-23 13:12:32,495 INFO L273 TraceCheckUtils]: 6: Hoare triple {25304#(<= main_~i0~0 0)} assume !!(-1000000 <= ~n1~0 && ~n1~0 < 1000000); {25304#(<= main_~i0~0 0)} is VALID [2018-11-23 13:12:32,496 INFO L273 TraceCheckUtils]: 7: Hoare triple {25304#(<= main_~i0~0 0)} assume !!(~i0~0 < ~n0~0);#t~post3 := ~i0~0;~i0~0 := 1 + #t~post3;havoc #t~post3;#t~post4 := ~k~0;~k~0 := 1 + #t~post4;havoc #t~post4; {25305#(<= main_~i0~0 1)} is VALID [2018-11-23 13:12:32,497 INFO L273 TraceCheckUtils]: 8: Hoare triple {25305#(<= main_~i0~0 1)} assume !(~i0~0 < ~n0~0); {25306#(<= main_~n0~0 1)} is VALID [2018-11-23 13:12:32,498 INFO L273 TraceCheckUtils]: 9: Hoare triple {25306#(<= main_~n0~0 1)} ~i1~0 := 0; {25307#(<= (+ main_~i1~0 main_~n0~0) 1)} is VALID [2018-11-23 13:12:32,498 INFO L273 TraceCheckUtils]: 10: Hoare triple {25307#(<= (+ main_~i1~0 main_~n0~0) 1)} assume !!(~i1~0 < ~n1~0);#t~post5 := ~i1~0;~i1~0 := 1 + #t~post5;havoc #t~post5;#t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {25308#(<= (+ main_~i1~0 main_~n0~0) 2)} is VALID [2018-11-23 13:12:32,499 INFO L273 TraceCheckUtils]: 11: Hoare triple {25308#(<= (+ main_~i1~0 main_~n0~0) 2)} assume !!(~i1~0 < ~n1~0);#t~post5 := ~i1~0;~i1~0 := 1 + #t~post5;havoc #t~post5;#t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {25309#(<= (+ main_~i1~0 main_~n0~0) 3)} is VALID [2018-11-23 13:12:32,500 INFO L273 TraceCheckUtils]: 12: Hoare triple {25309#(<= (+ main_~i1~0 main_~n0~0) 3)} assume !!(~i1~0 < ~n1~0);#t~post5 := ~i1~0;~i1~0 := 1 + #t~post5;havoc #t~post5;#t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {25310#(<= (+ main_~i1~0 main_~n0~0) 4)} is VALID [2018-11-23 13:12:32,501 INFO L273 TraceCheckUtils]: 13: Hoare triple {25310#(<= (+ main_~i1~0 main_~n0~0) 4)} assume !!(~i1~0 < ~n1~0);#t~post5 := ~i1~0;~i1~0 := 1 + #t~post5;havoc #t~post5;#t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {25311#(<= (+ main_~i1~0 main_~n0~0) 5)} is VALID [2018-11-23 13:12:32,502 INFO L273 TraceCheckUtils]: 14: Hoare triple {25311#(<= (+ main_~i1~0 main_~n0~0) 5)} assume !!(~i1~0 < ~n1~0);#t~post5 := ~i1~0;~i1~0 := 1 + #t~post5;havoc #t~post5;#t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {25312#(<= (+ main_~i1~0 main_~n0~0) 6)} is VALID [2018-11-23 13:12:32,503 INFO L273 TraceCheckUtils]: 15: Hoare triple {25312#(<= (+ main_~i1~0 main_~n0~0) 6)} assume !!(~i1~0 < ~n1~0);#t~post5 := ~i1~0;~i1~0 := 1 + #t~post5;havoc #t~post5;#t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {25313#(<= (+ main_~i1~0 main_~n0~0) 7)} is VALID [2018-11-23 13:12:32,504 INFO L273 TraceCheckUtils]: 16: Hoare triple {25313#(<= (+ main_~i1~0 main_~n0~0) 7)} assume !(~i1~0 < ~n1~0); {25314#(<= (+ main_~n0~0 main_~n1~0) 7)} is VALID [2018-11-23 13:12:32,504 INFO L273 TraceCheckUtils]: 17: Hoare triple {25314#(<= (+ main_~n0~0 main_~n1~0) 7)} ~j1~0 := 0; {25315#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 7))} is VALID [2018-11-23 13:12:32,505 INFO L273 TraceCheckUtils]: 18: Hoare triple {25315#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 7))} assume !!(~j1~0 < ~n0~0 + ~n1~0); {25315#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 7))} is VALID [2018-11-23 13:12:32,505 INFO L256 TraceCheckUtils]: 19: Hoare triple {25315#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 7))} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {25302#true} is VALID [2018-11-23 13:12:32,505 INFO L273 TraceCheckUtils]: 20: Hoare triple {25302#true} ~cond := #in~cond; {25302#true} is VALID [2018-11-23 13:12:32,505 INFO L273 TraceCheckUtils]: 21: Hoare triple {25302#true} assume !(0 == ~cond); {25302#true} is VALID [2018-11-23 13:12:32,506 INFO L273 TraceCheckUtils]: 22: Hoare triple {25302#true} assume true; {25302#true} is VALID [2018-11-23 13:12:32,507 INFO L268 TraceCheckUtils]: 23: Hoare quadruple {25302#true} {25315#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 7))} #70#return; {25315#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 7))} is VALID [2018-11-23 13:12:32,508 INFO L273 TraceCheckUtils]: 24: Hoare triple {25315#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 7))} #t~post7 := ~j1~0;~j1~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~k~0;~k~0 := #t~post8 - 1;havoc #t~post8; {25316#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 6))} is VALID [2018-11-23 13:12:32,508 INFO L273 TraceCheckUtils]: 25: Hoare triple {25316#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 6))} assume !!(~j1~0 < ~n0~0 + ~n1~0); {25316#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 6))} is VALID [2018-11-23 13:12:32,508 INFO L256 TraceCheckUtils]: 26: Hoare triple {25316#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 6))} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {25302#true} is VALID [2018-11-23 13:12:32,509 INFO L273 TraceCheckUtils]: 27: Hoare triple {25302#true} ~cond := #in~cond; {25302#true} is VALID [2018-11-23 13:12:32,509 INFO L273 TraceCheckUtils]: 28: Hoare triple {25302#true} assume !(0 == ~cond); {25302#true} is VALID [2018-11-23 13:12:32,509 INFO L273 TraceCheckUtils]: 29: Hoare triple {25302#true} assume true; {25302#true} is VALID [2018-11-23 13:12:32,510 INFO L268 TraceCheckUtils]: 30: Hoare quadruple {25302#true} {25316#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 6))} #70#return; {25316#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 6))} is VALID [2018-11-23 13:12:32,511 INFO L273 TraceCheckUtils]: 31: Hoare triple {25316#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 6))} #t~post7 := ~j1~0;~j1~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~k~0;~k~0 := #t~post8 - 1;havoc #t~post8; {25317#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 5))} is VALID [2018-11-23 13:12:32,511 INFO L273 TraceCheckUtils]: 32: Hoare triple {25317#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 5))} assume !!(~j1~0 < ~n0~0 + ~n1~0); {25317#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 5))} is VALID [2018-11-23 13:12:32,512 INFO L256 TraceCheckUtils]: 33: Hoare triple {25317#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 5))} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {25302#true} is VALID [2018-11-23 13:12:32,512 INFO L273 TraceCheckUtils]: 34: Hoare triple {25302#true} ~cond := #in~cond; {25302#true} is VALID [2018-11-23 13:12:32,512 INFO L273 TraceCheckUtils]: 35: Hoare triple {25302#true} assume !(0 == ~cond); {25302#true} is VALID [2018-11-23 13:12:32,512 INFO L273 TraceCheckUtils]: 36: Hoare triple {25302#true} assume true; {25302#true} is VALID [2018-11-23 13:12:32,513 INFO L268 TraceCheckUtils]: 37: Hoare quadruple {25302#true} {25317#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 5))} #70#return; {25317#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 5))} is VALID [2018-11-23 13:12:32,514 INFO L273 TraceCheckUtils]: 38: Hoare triple {25317#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 5))} #t~post7 := ~j1~0;~j1~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~k~0;~k~0 := #t~post8 - 1;havoc #t~post8; {25318#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 4))} is VALID [2018-11-23 13:12:32,514 INFO L273 TraceCheckUtils]: 39: Hoare triple {25318#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 4))} assume !!(~j1~0 < ~n0~0 + ~n1~0); {25318#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 4))} is VALID [2018-11-23 13:12:32,515 INFO L256 TraceCheckUtils]: 40: Hoare triple {25318#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 4))} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {25302#true} is VALID [2018-11-23 13:12:32,515 INFO L273 TraceCheckUtils]: 41: Hoare triple {25302#true} ~cond := #in~cond; {25302#true} is VALID [2018-11-23 13:12:32,515 INFO L273 TraceCheckUtils]: 42: Hoare triple {25302#true} assume !(0 == ~cond); {25302#true} is VALID [2018-11-23 13:12:32,515 INFO L273 TraceCheckUtils]: 43: Hoare triple {25302#true} assume true; {25302#true} is VALID [2018-11-23 13:12:32,516 INFO L268 TraceCheckUtils]: 44: Hoare quadruple {25302#true} {25318#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 4))} #70#return; {25318#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 4))} is VALID [2018-11-23 13:12:32,517 INFO L273 TraceCheckUtils]: 45: Hoare triple {25318#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 4))} #t~post7 := ~j1~0;~j1~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~k~0;~k~0 := #t~post8 - 1;havoc #t~post8; {25319#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 3))} is VALID [2018-11-23 13:12:32,518 INFO L273 TraceCheckUtils]: 46: Hoare triple {25319#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 3))} assume !!(~j1~0 < ~n0~0 + ~n1~0); {25319#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 3))} is VALID [2018-11-23 13:12:32,518 INFO L256 TraceCheckUtils]: 47: Hoare triple {25319#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 3))} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {25302#true} is VALID [2018-11-23 13:12:32,518 INFO L273 TraceCheckUtils]: 48: Hoare triple {25302#true} ~cond := #in~cond; {25302#true} is VALID [2018-11-23 13:12:32,518 INFO L273 TraceCheckUtils]: 49: Hoare triple {25302#true} assume !(0 == ~cond); {25302#true} is VALID [2018-11-23 13:12:32,518 INFO L273 TraceCheckUtils]: 50: Hoare triple {25302#true} assume true; {25302#true} is VALID [2018-11-23 13:12:32,520 INFO L268 TraceCheckUtils]: 51: Hoare quadruple {25302#true} {25319#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 3))} #70#return; {25319#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 3))} is VALID [2018-11-23 13:12:32,520 INFO L273 TraceCheckUtils]: 52: Hoare triple {25319#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 3))} #t~post7 := ~j1~0;~j1~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~k~0;~k~0 := #t~post8 - 1;havoc #t~post8; {25320#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 2))} is VALID [2018-11-23 13:12:32,521 INFO L273 TraceCheckUtils]: 53: Hoare triple {25320#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 2))} assume !!(~j1~0 < ~n0~0 + ~n1~0); {25320#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 2))} is VALID [2018-11-23 13:12:32,521 INFO L256 TraceCheckUtils]: 54: Hoare triple {25320#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 2))} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {25302#true} is VALID [2018-11-23 13:12:32,521 INFO L273 TraceCheckUtils]: 55: Hoare triple {25302#true} ~cond := #in~cond; {25302#true} is VALID [2018-11-23 13:12:32,522 INFO L273 TraceCheckUtils]: 56: Hoare triple {25302#true} assume !(0 == ~cond); {25302#true} is VALID [2018-11-23 13:12:32,522 INFO L273 TraceCheckUtils]: 57: Hoare triple {25302#true} assume true; {25302#true} is VALID [2018-11-23 13:12:32,523 INFO L268 TraceCheckUtils]: 58: Hoare quadruple {25302#true} {25320#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 2))} #70#return; {25320#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 2))} is VALID [2018-11-23 13:12:32,524 INFO L273 TraceCheckUtils]: 59: Hoare triple {25320#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 2))} #t~post7 := ~j1~0;~j1~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~k~0;~k~0 := #t~post8 - 1;havoc #t~post8; {25321#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 1))} is VALID [2018-11-23 13:12:32,524 INFO L273 TraceCheckUtils]: 60: Hoare triple {25321#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 1))} assume !!(~j1~0 < ~n0~0 + ~n1~0); {25321#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 1))} is VALID [2018-11-23 13:12:32,524 INFO L256 TraceCheckUtils]: 61: Hoare triple {25321#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 1))} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {25302#true} is VALID [2018-11-23 13:12:32,524 INFO L273 TraceCheckUtils]: 62: Hoare triple {25302#true} ~cond := #in~cond; {25302#true} is VALID [2018-11-23 13:12:32,525 INFO L273 TraceCheckUtils]: 63: Hoare triple {25302#true} assume !(0 == ~cond); {25302#true} is VALID [2018-11-23 13:12:32,525 INFO L273 TraceCheckUtils]: 64: Hoare triple {25302#true} assume true; {25302#true} is VALID [2018-11-23 13:12:32,526 INFO L268 TraceCheckUtils]: 65: Hoare quadruple {25302#true} {25321#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 1))} #70#return; {25321#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 1))} is VALID [2018-11-23 13:12:32,527 INFO L273 TraceCheckUtils]: 66: Hoare triple {25321#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 1))} #t~post7 := ~j1~0;~j1~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~k~0;~k~0 := #t~post8 - 1;havoc #t~post8; {25322#(<= (+ main_~n0~0 main_~n1~0) main_~j1~0)} is VALID [2018-11-23 13:12:32,527 INFO L273 TraceCheckUtils]: 67: Hoare triple {25322#(<= (+ main_~n0~0 main_~n1~0) main_~j1~0)} assume !!(~j1~0 < ~n0~0 + ~n1~0); {25303#false} is VALID [2018-11-23 13:12:32,527 INFO L256 TraceCheckUtils]: 68: Hoare triple {25303#false} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {25303#false} is VALID [2018-11-23 13:12:32,528 INFO L273 TraceCheckUtils]: 69: Hoare triple {25303#false} ~cond := #in~cond; {25303#false} is VALID [2018-11-23 13:12:32,528 INFO L273 TraceCheckUtils]: 70: Hoare triple {25303#false} assume 0 == ~cond; {25303#false} is VALID [2018-11-23 13:12:32,528 INFO L273 TraceCheckUtils]: 71: Hoare triple {25303#false} assume !false; {25303#false} is VALID [2018-11-23 13:12:32,534 INFO L134 CoverageAnalysis]: Checked inductivity of 197 backedges. 91 proven. 22 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2018-11-23 13:12:32,535 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:12:32,535 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:12:32,550 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 13:12:32,598 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 13:12:32,598 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:12:32,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:12:32,613 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:12:33,213 INFO L256 TraceCheckUtils]: 0: Hoare triple {25302#true} call ULTIMATE.init(); {25302#true} is VALID [2018-11-23 13:12:33,213 INFO L273 TraceCheckUtils]: 1: Hoare triple {25302#true} assume true; {25302#true} is VALID [2018-11-23 13:12:33,213 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {25302#true} {25302#true} #66#return; {25302#true} is VALID [2018-11-23 13:12:33,214 INFO L256 TraceCheckUtils]: 3: Hoare triple {25302#true} call #t~ret9 := main(); {25302#true} is VALID [2018-11-23 13:12:33,214 INFO L273 TraceCheckUtils]: 4: Hoare triple {25302#true} havoc ~n0~0;havoc ~n1~0;~i0~0 := 0;~k~0 := 0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n0~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~n1~0 := #t~nondet2;havoc #t~nondet2; {25304#(<= main_~i0~0 0)} is VALID [2018-11-23 13:12:33,215 INFO L273 TraceCheckUtils]: 5: Hoare triple {25304#(<= main_~i0~0 0)} assume !!(-1000000 <= ~n0~0 && ~n0~0 < 1000000); {25304#(<= main_~i0~0 0)} is VALID [2018-11-23 13:12:33,215 INFO L273 TraceCheckUtils]: 6: Hoare triple {25304#(<= main_~i0~0 0)} assume !!(-1000000 <= ~n1~0 && ~n1~0 < 1000000); {25304#(<= main_~i0~0 0)} is VALID [2018-11-23 13:12:33,216 INFO L273 TraceCheckUtils]: 7: Hoare triple {25304#(<= main_~i0~0 0)} assume !!(~i0~0 < ~n0~0);#t~post3 := ~i0~0;~i0~0 := 1 + #t~post3;havoc #t~post3;#t~post4 := ~k~0;~k~0 := 1 + #t~post4;havoc #t~post4; {25305#(<= main_~i0~0 1)} is VALID [2018-11-23 13:12:33,216 INFO L273 TraceCheckUtils]: 8: Hoare triple {25305#(<= main_~i0~0 1)} assume !(~i0~0 < ~n0~0); {25306#(<= main_~n0~0 1)} is VALID [2018-11-23 13:12:33,217 INFO L273 TraceCheckUtils]: 9: Hoare triple {25306#(<= main_~n0~0 1)} ~i1~0 := 0; {25353#(and (<= main_~i1~0 0) (<= main_~n0~0 1))} is VALID [2018-11-23 13:12:33,217 INFO L273 TraceCheckUtils]: 10: Hoare triple {25353#(and (<= main_~i1~0 0) (<= main_~n0~0 1))} assume !!(~i1~0 < ~n1~0);#t~post5 := ~i1~0;~i1~0 := 1 + #t~post5;havoc #t~post5;#t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {25357#(and (<= main_~i1~0 1) (<= main_~n0~0 1))} is VALID [2018-11-23 13:12:33,218 INFO L273 TraceCheckUtils]: 11: Hoare triple {25357#(and (<= main_~i1~0 1) (<= main_~n0~0 1))} assume !!(~i1~0 < ~n1~0);#t~post5 := ~i1~0;~i1~0 := 1 + #t~post5;havoc #t~post5;#t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {25361#(and (<= main_~i1~0 2) (<= main_~n0~0 1))} is VALID [2018-11-23 13:12:33,219 INFO L273 TraceCheckUtils]: 12: Hoare triple {25361#(and (<= main_~i1~0 2) (<= main_~n0~0 1))} assume !!(~i1~0 < ~n1~0);#t~post5 := ~i1~0;~i1~0 := 1 + #t~post5;havoc #t~post5;#t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {25365#(and (<= main_~i1~0 3) (<= main_~n0~0 1))} is VALID [2018-11-23 13:12:33,220 INFO L273 TraceCheckUtils]: 13: Hoare triple {25365#(and (<= main_~i1~0 3) (<= main_~n0~0 1))} assume !!(~i1~0 < ~n1~0);#t~post5 := ~i1~0;~i1~0 := 1 + #t~post5;havoc #t~post5;#t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {25369#(and (<= main_~i1~0 4) (<= main_~n0~0 1))} is VALID [2018-11-23 13:12:33,221 INFO L273 TraceCheckUtils]: 14: Hoare triple {25369#(and (<= main_~i1~0 4) (<= main_~n0~0 1))} assume !!(~i1~0 < ~n1~0);#t~post5 := ~i1~0;~i1~0 := 1 + #t~post5;havoc #t~post5;#t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {25373#(and (<= main_~i1~0 5) (<= main_~n0~0 1))} is VALID [2018-11-23 13:12:33,221 INFO L273 TraceCheckUtils]: 15: Hoare triple {25373#(and (<= main_~i1~0 5) (<= main_~n0~0 1))} assume !!(~i1~0 < ~n1~0);#t~post5 := ~i1~0;~i1~0 := 1 + #t~post5;havoc #t~post5;#t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {25377#(and (<= main_~n0~0 1) (<= main_~i1~0 6))} is VALID [2018-11-23 13:12:33,222 INFO L273 TraceCheckUtils]: 16: Hoare triple {25377#(and (<= main_~n0~0 1) (<= main_~i1~0 6))} assume !(~i1~0 < ~n1~0); {25381#(and (<= main_~n1~0 6) (<= main_~n0~0 1))} is VALID [2018-11-23 13:12:33,223 INFO L273 TraceCheckUtils]: 17: Hoare triple {25381#(and (<= main_~n1~0 6) (<= main_~n0~0 1))} ~j1~0 := 0; {25385#(and (<= main_~n1~0 6) (<= 0 main_~j1~0) (<= main_~n0~0 1))} is VALID [2018-11-23 13:12:33,224 INFO L273 TraceCheckUtils]: 18: Hoare triple {25385#(and (<= main_~n1~0 6) (<= 0 main_~j1~0) (<= main_~n0~0 1))} assume !!(~j1~0 < ~n0~0 + ~n1~0); {25385#(and (<= main_~n1~0 6) (<= 0 main_~j1~0) (<= main_~n0~0 1))} is VALID [2018-11-23 13:12:33,224 INFO L256 TraceCheckUtils]: 19: Hoare triple {25385#(and (<= main_~n1~0 6) (<= 0 main_~j1~0) (<= main_~n0~0 1))} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {25302#true} is VALID [2018-11-23 13:12:33,224 INFO L273 TraceCheckUtils]: 20: Hoare triple {25302#true} ~cond := #in~cond; {25302#true} is VALID [2018-11-23 13:12:33,224 INFO L273 TraceCheckUtils]: 21: Hoare triple {25302#true} assume !(0 == ~cond); {25302#true} is VALID [2018-11-23 13:12:33,224 INFO L273 TraceCheckUtils]: 22: Hoare triple {25302#true} assume true; {25302#true} is VALID [2018-11-23 13:12:33,225 INFO L268 TraceCheckUtils]: 23: Hoare quadruple {25302#true} {25385#(and (<= main_~n1~0 6) (<= 0 main_~j1~0) (<= main_~n0~0 1))} #70#return; {25385#(and (<= main_~n1~0 6) (<= 0 main_~j1~0) (<= main_~n0~0 1))} is VALID [2018-11-23 13:12:33,226 INFO L273 TraceCheckUtils]: 24: Hoare triple {25385#(and (<= main_~n1~0 6) (<= 0 main_~j1~0) (<= main_~n0~0 1))} #t~post7 := ~j1~0;~j1~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~k~0;~k~0 := #t~post8 - 1;havoc #t~post8; {25407#(and (<= 1 main_~j1~0) (<= main_~n1~0 6) (<= main_~n0~0 1))} is VALID [2018-11-23 13:12:33,227 INFO L273 TraceCheckUtils]: 25: Hoare triple {25407#(and (<= 1 main_~j1~0) (<= main_~n1~0 6) (<= main_~n0~0 1))} assume !!(~j1~0 < ~n0~0 + ~n1~0); {25407#(and (<= 1 main_~j1~0) (<= main_~n1~0 6) (<= main_~n0~0 1))} is VALID [2018-11-23 13:12:33,227 INFO L256 TraceCheckUtils]: 26: Hoare triple {25407#(and (<= 1 main_~j1~0) (<= main_~n1~0 6) (<= main_~n0~0 1))} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {25302#true} is VALID [2018-11-23 13:12:33,227 INFO L273 TraceCheckUtils]: 27: Hoare triple {25302#true} ~cond := #in~cond; {25302#true} is VALID [2018-11-23 13:12:33,227 INFO L273 TraceCheckUtils]: 28: Hoare triple {25302#true} assume !(0 == ~cond); {25302#true} is VALID [2018-11-23 13:12:33,227 INFO L273 TraceCheckUtils]: 29: Hoare triple {25302#true} assume true; {25302#true} is VALID [2018-11-23 13:12:33,228 INFO L268 TraceCheckUtils]: 30: Hoare quadruple {25302#true} {25407#(and (<= 1 main_~j1~0) (<= main_~n1~0 6) (<= main_~n0~0 1))} #70#return; {25407#(and (<= 1 main_~j1~0) (<= main_~n1~0 6) (<= main_~n0~0 1))} is VALID [2018-11-23 13:12:33,229 INFO L273 TraceCheckUtils]: 31: Hoare triple {25407#(and (<= 1 main_~j1~0) (<= main_~n1~0 6) (<= main_~n0~0 1))} #t~post7 := ~j1~0;~j1~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~k~0;~k~0 := #t~post8 - 1;havoc #t~post8; {25429#(and (<= main_~n1~0 6) (<= main_~n0~0 1) (<= 2 main_~j1~0))} is VALID [2018-11-23 13:12:33,230 INFO L273 TraceCheckUtils]: 32: Hoare triple {25429#(and (<= main_~n1~0 6) (<= main_~n0~0 1) (<= 2 main_~j1~0))} assume !!(~j1~0 < ~n0~0 + ~n1~0); {25429#(and (<= main_~n1~0 6) (<= main_~n0~0 1) (<= 2 main_~j1~0))} is VALID [2018-11-23 13:12:33,230 INFO L256 TraceCheckUtils]: 33: Hoare triple {25429#(and (<= main_~n1~0 6) (<= main_~n0~0 1) (<= 2 main_~j1~0))} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {25302#true} is VALID [2018-11-23 13:12:33,230 INFO L273 TraceCheckUtils]: 34: Hoare triple {25302#true} ~cond := #in~cond; {25302#true} is VALID [2018-11-23 13:12:33,230 INFO L273 TraceCheckUtils]: 35: Hoare triple {25302#true} assume !(0 == ~cond); {25302#true} is VALID [2018-11-23 13:12:33,230 INFO L273 TraceCheckUtils]: 36: Hoare triple {25302#true} assume true; {25302#true} is VALID [2018-11-23 13:12:33,231 INFO L268 TraceCheckUtils]: 37: Hoare quadruple {25302#true} {25429#(and (<= main_~n1~0 6) (<= main_~n0~0 1) (<= 2 main_~j1~0))} #70#return; {25429#(and (<= main_~n1~0 6) (<= main_~n0~0 1) (<= 2 main_~j1~0))} is VALID [2018-11-23 13:12:33,232 INFO L273 TraceCheckUtils]: 38: Hoare triple {25429#(and (<= main_~n1~0 6) (<= main_~n0~0 1) (<= 2 main_~j1~0))} #t~post7 := ~j1~0;~j1~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~k~0;~k~0 := #t~post8 - 1;havoc #t~post8; {25451#(and (<= main_~n1~0 6) (<= 3 main_~j1~0) (<= main_~n0~0 1))} is VALID [2018-11-23 13:12:33,232 INFO L273 TraceCheckUtils]: 39: Hoare triple {25451#(and (<= main_~n1~0 6) (<= 3 main_~j1~0) (<= main_~n0~0 1))} assume !!(~j1~0 < ~n0~0 + ~n1~0); {25451#(and (<= main_~n1~0 6) (<= 3 main_~j1~0) (<= main_~n0~0 1))} is VALID [2018-11-23 13:12:33,233 INFO L256 TraceCheckUtils]: 40: Hoare triple {25451#(and (<= main_~n1~0 6) (<= 3 main_~j1~0) (<= main_~n0~0 1))} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {25302#true} is VALID [2018-11-23 13:12:33,233 INFO L273 TraceCheckUtils]: 41: Hoare triple {25302#true} ~cond := #in~cond; {25302#true} is VALID [2018-11-23 13:12:33,233 INFO L273 TraceCheckUtils]: 42: Hoare triple {25302#true} assume !(0 == ~cond); {25302#true} is VALID [2018-11-23 13:12:33,233 INFO L273 TraceCheckUtils]: 43: Hoare triple {25302#true} assume true; {25302#true} is VALID [2018-11-23 13:12:33,234 INFO L268 TraceCheckUtils]: 44: Hoare quadruple {25302#true} {25451#(and (<= main_~n1~0 6) (<= 3 main_~j1~0) (<= main_~n0~0 1))} #70#return; {25451#(and (<= main_~n1~0 6) (<= 3 main_~j1~0) (<= main_~n0~0 1))} is VALID [2018-11-23 13:12:33,235 INFO L273 TraceCheckUtils]: 45: Hoare triple {25451#(and (<= main_~n1~0 6) (<= 3 main_~j1~0) (<= main_~n0~0 1))} #t~post7 := ~j1~0;~j1~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~k~0;~k~0 := #t~post8 - 1;havoc #t~post8; {25473#(and (<= main_~n1~0 6) (<= 4 main_~j1~0) (<= main_~n0~0 1))} is VALID [2018-11-23 13:12:33,235 INFO L273 TraceCheckUtils]: 46: Hoare triple {25473#(and (<= main_~n1~0 6) (<= 4 main_~j1~0) (<= main_~n0~0 1))} assume !!(~j1~0 < ~n0~0 + ~n1~0); {25473#(and (<= main_~n1~0 6) (<= 4 main_~j1~0) (<= main_~n0~0 1))} is VALID [2018-11-23 13:12:33,236 INFO L256 TraceCheckUtils]: 47: Hoare triple {25473#(and (<= main_~n1~0 6) (<= 4 main_~j1~0) (<= main_~n0~0 1))} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {25302#true} is VALID [2018-11-23 13:12:33,236 INFO L273 TraceCheckUtils]: 48: Hoare triple {25302#true} ~cond := #in~cond; {25302#true} is VALID [2018-11-23 13:12:33,236 INFO L273 TraceCheckUtils]: 49: Hoare triple {25302#true} assume !(0 == ~cond); {25302#true} is VALID [2018-11-23 13:12:33,236 INFO L273 TraceCheckUtils]: 50: Hoare triple {25302#true} assume true; {25302#true} is VALID [2018-11-23 13:12:33,237 INFO L268 TraceCheckUtils]: 51: Hoare quadruple {25302#true} {25473#(and (<= main_~n1~0 6) (<= 4 main_~j1~0) (<= main_~n0~0 1))} #70#return; {25473#(and (<= main_~n1~0 6) (<= 4 main_~j1~0) (<= main_~n0~0 1))} is VALID [2018-11-23 13:12:33,238 INFO L273 TraceCheckUtils]: 52: Hoare triple {25473#(and (<= main_~n1~0 6) (<= 4 main_~j1~0) (<= main_~n0~0 1))} #t~post7 := ~j1~0;~j1~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~k~0;~k~0 := #t~post8 - 1;havoc #t~post8; {25495#(and (<= main_~n1~0 6) (<= 5 main_~j1~0) (<= main_~n0~0 1))} is VALID [2018-11-23 13:12:33,238 INFO L273 TraceCheckUtils]: 53: Hoare triple {25495#(and (<= main_~n1~0 6) (<= 5 main_~j1~0) (<= main_~n0~0 1))} assume !!(~j1~0 < ~n0~0 + ~n1~0); {25495#(and (<= main_~n1~0 6) (<= 5 main_~j1~0) (<= main_~n0~0 1))} is VALID [2018-11-23 13:12:33,239 INFO L256 TraceCheckUtils]: 54: Hoare triple {25495#(and (<= main_~n1~0 6) (<= 5 main_~j1~0) (<= main_~n0~0 1))} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {25302#true} is VALID [2018-11-23 13:12:33,239 INFO L273 TraceCheckUtils]: 55: Hoare triple {25302#true} ~cond := #in~cond; {25302#true} is VALID [2018-11-23 13:12:33,239 INFO L273 TraceCheckUtils]: 56: Hoare triple {25302#true} assume !(0 == ~cond); {25302#true} is VALID [2018-11-23 13:12:33,239 INFO L273 TraceCheckUtils]: 57: Hoare triple {25302#true} assume true; {25302#true} is VALID [2018-11-23 13:12:33,240 INFO L268 TraceCheckUtils]: 58: Hoare quadruple {25302#true} {25495#(and (<= main_~n1~0 6) (<= 5 main_~j1~0) (<= main_~n0~0 1))} #70#return; {25495#(and (<= main_~n1~0 6) (<= 5 main_~j1~0) (<= main_~n0~0 1))} is VALID [2018-11-23 13:12:33,241 INFO L273 TraceCheckUtils]: 59: Hoare triple {25495#(and (<= main_~n1~0 6) (<= 5 main_~j1~0) (<= main_~n0~0 1))} #t~post7 := ~j1~0;~j1~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~k~0;~k~0 := #t~post8 - 1;havoc #t~post8; {25517#(and (<= 6 main_~j1~0) (<= main_~n1~0 6) (<= main_~n0~0 1))} is VALID [2018-11-23 13:12:33,241 INFO L273 TraceCheckUtils]: 60: Hoare triple {25517#(and (<= 6 main_~j1~0) (<= main_~n1~0 6) (<= main_~n0~0 1))} assume !!(~j1~0 < ~n0~0 + ~n1~0); {25517#(and (<= 6 main_~j1~0) (<= main_~n1~0 6) (<= main_~n0~0 1))} is VALID [2018-11-23 13:12:33,242 INFO L256 TraceCheckUtils]: 61: Hoare triple {25517#(and (<= 6 main_~j1~0) (<= main_~n1~0 6) (<= main_~n0~0 1))} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {25302#true} is VALID [2018-11-23 13:12:33,242 INFO L273 TraceCheckUtils]: 62: Hoare triple {25302#true} ~cond := #in~cond; {25302#true} is VALID [2018-11-23 13:12:33,242 INFO L273 TraceCheckUtils]: 63: Hoare triple {25302#true} assume !(0 == ~cond); {25302#true} is VALID [2018-11-23 13:12:33,242 INFO L273 TraceCheckUtils]: 64: Hoare triple {25302#true} assume true; {25302#true} is VALID [2018-11-23 13:12:33,243 INFO L268 TraceCheckUtils]: 65: Hoare quadruple {25302#true} {25517#(and (<= 6 main_~j1~0) (<= main_~n1~0 6) (<= main_~n0~0 1))} #70#return; {25517#(and (<= 6 main_~j1~0) (<= main_~n1~0 6) (<= main_~n0~0 1))} is VALID [2018-11-23 13:12:33,244 INFO L273 TraceCheckUtils]: 66: Hoare triple {25517#(and (<= 6 main_~j1~0) (<= main_~n1~0 6) (<= main_~n0~0 1))} #t~post7 := ~j1~0;~j1~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~k~0;~k~0 := #t~post8 - 1;havoc #t~post8; {25539#(and (<= main_~n1~0 6) (<= 7 main_~j1~0) (<= main_~n0~0 1))} is VALID [2018-11-23 13:12:33,245 INFO L273 TraceCheckUtils]: 67: Hoare triple {25539#(and (<= main_~n1~0 6) (<= 7 main_~j1~0) (<= main_~n0~0 1))} assume !!(~j1~0 < ~n0~0 + ~n1~0); {25303#false} is VALID [2018-11-23 13:12:33,245 INFO L256 TraceCheckUtils]: 68: Hoare triple {25303#false} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {25303#false} is VALID [2018-11-23 13:12:33,245 INFO L273 TraceCheckUtils]: 69: Hoare triple {25303#false} ~cond := #in~cond; {25303#false} is VALID [2018-11-23 13:12:33,245 INFO L273 TraceCheckUtils]: 70: Hoare triple {25303#false} assume 0 == ~cond; {25303#false} is VALID [2018-11-23 13:12:33,245 INFO L273 TraceCheckUtils]: 71: Hoare triple {25303#false} assume !false; {25303#false} is VALID [2018-11-23 13:12:33,252 INFO L134 CoverageAnalysis]: Checked inductivity of 197 backedges. 91 proven. 22 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2018-11-23 13:12:33,271 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:12:33,271 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 37 [2018-11-23 13:12:33,272 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 72 [2018-11-23 13:12:33,272 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:12:33,272 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 37 states. [2018-11-23 13:12:33,357 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 92 edges. 92 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:12:33,357 INFO L459 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-11-23 13:12:33,357 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-11-23 13:12:33,358 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=267, Invalid=1065, Unknown=0, NotChecked=0, Total=1332 [2018-11-23 13:12:33,358 INFO L87 Difference]: Start difference. First operand 90 states and 99 transitions. Second operand 37 states. [2018-11-23 13:12:36,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:12:36,989 INFO L93 Difference]: Finished difference Result 184 states and 219 transitions. [2018-11-23 13:12:36,989 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-11-23 13:12:36,989 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 72 [2018-11-23 13:12:36,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:12:36,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-11-23 13:12:36,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 96 transitions. [2018-11-23 13:12:36,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-11-23 13:12:36,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 96 transitions. [2018-11-23 13:12:36,992 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 29 states and 96 transitions. [2018-11-23 13:12:37,085 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 96 edges. 96 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:12:37,089 INFO L225 Difference]: With dead ends: 184 [2018-11-23 13:12:37,089 INFO L226 Difference]: Without dead ends: 152 [2018-11-23 13:12:37,090 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1082 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=741, Invalid=3041, Unknown=0, NotChecked=0, Total=3782 [2018-11-23 13:12:37,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2018-11-23 13:12:37,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 90. [2018-11-23 13:12:37,832 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:12:37,832 INFO L82 GeneralOperation]: Start isEquivalent. First operand 152 states. Second operand 90 states. [2018-11-23 13:12:37,832 INFO L74 IsIncluded]: Start isIncluded. First operand 152 states. Second operand 90 states. [2018-11-23 13:12:37,832 INFO L87 Difference]: Start difference. First operand 152 states. Second operand 90 states. [2018-11-23 13:12:37,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:12:37,835 INFO L93 Difference]: Finished difference Result 152 states and 179 transitions. [2018-11-23 13:12:37,835 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 179 transitions. [2018-11-23 13:12:37,835 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:12:37,836 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:12:37,836 INFO L74 IsIncluded]: Start isIncluded. First operand 90 states. Second operand 152 states. [2018-11-23 13:12:37,836 INFO L87 Difference]: Start difference. First operand 90 states. Second operand 152 states. [2018-11-23 13:12:37,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:12:37,838 INFO L93 Difference]: Finished difference Result 152 states and 179 transitions. [2018-11-23 13:12:37,838 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 179 transitions. [2018-11-23 13:12:37,838 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:12:37,838 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:12:37,838 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:12:37,839 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:12:37,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2018-11-23 13:12:37,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 99 transitions. [2018-11-23 13:12:37,840 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 99 transitions. Word has length 72 [2018-11-23 13:12:37,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:12:37,840 INFO L480 AbstractCegarLoop]: Abstraction has 90 states and 99 transitions. [2018-11-23 13:12:37,840 INFO L481 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-11-23 13:12:37,840 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 99 transitions. [2018-11-23 13:12:37,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-11-23 13:12:37,840 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:12:37,841 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 8, 7, 7, 7, 7, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:12:37,841 INFO L423 AbstractCegarLoop]: === Iteration 38 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:12:37,841 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:12:37,841 INFO L82 PathProgramCache]: Analyzing trace with hash 1355747248, now seen corresponding path program 17 times [2018-11-23 13:12:37,841 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:12:37,841 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:12:37,842 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:12:37,842 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:12:37,842 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:12:37,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:12:38,221 INFO L256 TraceCheckUtils]: 0: Hoare triple {26336#true} call ULTIMATE.init(); {26336#true} is VALID [2018-11-23 13:12:38,222 INFO L273 TraceCheckUtils]: 1: Hoare triple {26336#true} assume true; {26336#true} is VALID [2018-11-23 13:12:38,222 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {26336#true} {26336#true} #66#return; {26336#true} is VALID [2018-11-23 13:12:38,222 INFO L256 TraceCheckUtils]: 3: Hoare triple {26336#true} call #t~ret9 := main(); {26336#true} is VALID [2018-11-23 13:12:38,223 INFO L273 TraceCheckUtils]: 4: Hoare triple {26336#true} havoc ~n0~0;havoc ~n1~0;~i0~0 := 0;~k~0 := 0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n0~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~n1~0 := #t~nondet2;havoc #t~nondet2; {26338#(<= main_~i0~0 0)} is VALID [2018-11-23 13:12:38,223 INFO L273 TraceCheckUtils]: 5: Hoare triple {26338#(<= main_~i0~0 0)} assume !!(-1000000 <= ~n0~0 && ~n0~0 < 1000000); {26338#(<= main_~i0~0 0)} is VALID [2018-11-23 13:12:38,224 INFO L273 TraceCheckUtils]: 6: Hoare triple {26338#(<= main_~i0~0 0)} assume !!(-1000000 <= ~n1~0 && ~n1~0 < 1000000); {26338#(<= main_~i0~0 0)} is VALID [2018-11-23 13:12:38,225 INFO L273 TraceCheckUtils]: 7: Hoare triple {26338#(<= main_~i0~0 0)} assume !!(~i0~0 < ~n0~0);#t~post3 := ~i0~0;~i0~0 := 1 + #t~post3;havoc #t~post3;#t~post4 := ~k~0;~k~0 := 1 + #t~post4;havoc #t~post4; {26339#(<= main_~i0~0 1)} is VALID [2018-11-23 13:12:38,226 INFO L273 TraceCheckUtils]: 8: Hoare triple {26339#(<= main_~i0~0 1)} assume !!(~i0~0 < ~n0~0);#t~post3 := ~i0~0;~i0~0 := 1 + #t~post3;havoc #t~post3;#t~post4 := ~k~0;~k~0 := 1 + #t~post4;havoc #t~post4; {26340#(<= main_~i0~0 2)} is VALID [2018-11-23 13:12:38,226 INFO L273 TraceCheckUtils]: 9: Hoare triple {26340#(<= main_~i0~0 2)} assume !(~i0~0 < ~n0~0); {26341#(<= main_~n0~0 2)} is VALID [2018-11-23 13:12:38,227 INFO L273 TraceCheckUtils]: 10: Hoare triple {26341#(<= main_~n0~0 2)} ~i1~0 := 0; {26342#(<= (+ main_~i1~0 main_~n0~0) 2)} is VALID [2018-11-23 13:12:38,228 INFO L273 TraceCheckUtils]: 11: Hoare triple {26342#(<= (+ main_~i1~0 main_~n0~0) 2)} assume !!(~i1~0 < ~n1~0);#t~post5 := ~i1~0;~i1~0 := 1 + #t~post5;havoc #t~post5;#t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {26343#(<= (+ main_~i1~0 main_~n0~0) 3)} is VALID [2018-11-23 13:12:38,229 INFO L273 TraceCheckUtils]: 12: Hoare triple {26343#(<= (+ main_~i1~0 main_~n0~0) 3)} assume !!(~i1~0 < ~n1~0);#t~post5 := ~i1~0;~i1~0 := 1 + #t~post5;havoc #t~post5;#t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {26344#(<= (+ main_~i1~0 main_~n0~0) 4)} is VALID [2018-11-23 13:12:38,230 INFO L273 TraceCheckUtils]: 13: Hoare triple {26344#(<= (+ main_~i1~0 main_~n0~0) 4)} assume !!(~i1~0 < ~n1~0);#t~post5 := ~i1~0;~i1~0 := 1 + #t~post5;havoc #t~post5;#t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {26345#(<= (+ main_~i1~0 main_~n0~0) 5)} is VALID [2018-11-23 13:12:38,231 INFO L273 TraceCheckUtils]: 14: Hoare triple {26345#(<= (+ main_~i1~0 main_~n0~0) 5)} assume !!(~i1~0 < ~n1~0);#t~post5 := ~i1~0;~i1~0 := 1 + #t~post5;havoc #t~post5;#t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {26346#(<= (+ main_~i1~0 main_~n0~0) 6)} is VALID [2018-11-23 13:12:38,232 INFO L273 TraceCheckUtils]: 15: Hoare triple {26346#(<= (+ main_~i1~0 main_~n0~0) 6)} assume !!(~i1~0 < ~n1~0);#t~post5 := ~i1~0;~i1~0 := 1 + #t~post5;havoc #t~post5;#t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {26347#(<= (+ main_~i1~0 main_~n0~0) 7)} is VALID [2018-11-23 13:12:38,232 INFO L273 TraceCheckUtils]: 16: Hoare triple {26347#(<= (+ main_~i1~0 main_~n0~0) 7)} assume !(~i1~0 < ~n1~0); {26348#(<= (+ main_~n0~0 main_~n1~0) 7)} is VALID [2018-11-23 13:12:38,233 INFO L273 TraceCheckUtils]: 17: Hoare triple {26348#(<= (+ main_~n0~0 main_~n1~0) 7)} ~j1~0 := 0; {26349#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 7))} is VALID [2018-11-23 13:12:38,234 INFO L273 TraceCheckUtils]: 18: Hoare triple {26349#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 7))} assume !!(~j1~0 < ~n0~0 + ~n1~0); {26349#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 7))} is VALID [2018-11-23 13:12:38,234 INFO L256 TraceCheckUtils]: 19: Hoare triple {26349#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 7))} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {26336#true} is VALID [2018-11-23 13:12:38,234 INFO L273 TraceCheckUtils]: 20: Hoare triple {26336#true} ~cond := #in~cond; {26336#true} is VALID [2018-11-23 13:12:38,234 INFO L273 TraceCheckUtils]: 21: Hoare triple {26336#true} assume !(0 == ~cond); {26336#true} is VALID [2018-11-23 13:12:38,234 INFO L273 TraceCheckUtils]: 22: Hoare triple {26336#true} assume true; {26336#true} is VALID [2018-11-23 13:12:38,236 INFO L268 TraceCheckUtils]: 23: Hoare quadruple {26336#true} {26349#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 7))} #70#return; {26349#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 7))} is VALID [2018-11-23 13:12:38,237 INFO L273 TraceCheckUtils]: 24: Hoare triple {26349#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 7))} #t~post7 := ~j1~0;~j1~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~k~0;~k~0 := #t~post8 - 1;havoc #t~post8; {26350#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 6))} is VALID [2018-11-23 13:12:38,237 INFO L273 TraceCheckUtils]: 25: Hoare triple {26350#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 6))} assume !!(~j1~0 < ~n0~0 + ~n1~0); {26350#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 6))} is VALID [2018-11-23 13:12:38,237 INFO L256 TraceCheckUtils]: 26: Hoare triple {26350#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 6))} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {26336#true} is VALID [2018-11-23 13:12:38,237 INFO L273 TraceCheckUtils]: 27: Hoare triple {26336#true} ~cond := #in~cond; {26336#true} is VALID [2018-11-23 13:12:38,238 INFO L273 TraceCheckUtils]: 28: Hoare triple {26336#true} assume !(0 == ~cond); {26336#true} is VALID [2018-11-23 13:12:38,238 INFO L273 TraceCheckUtils]: 29: Hoare triple {26336#true} assume true; {26336#true} is VALID [2018-11-23 13:12:38,239 INFO L268 TraceCheckUtils]: 30: Hoare quadruple {26336#true} {26350#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 6))} #70#return; {26350#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 6))} is VALID [2018-11-23 13:12:38,240 INFO L273 TraceCheckUtils]: 31: Hoare triple {26350#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 6))} #t~post7 := ~j1~0;~j1~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~k~0;~k~0 := #t~post8 - 1;havoc #t~post8; {26351#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 5))} is VALID [2018-11-23 13:12:38,240 INFO L273 TraceCheckUtils]: 32: Hoare triple {26351#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 5))} assume !!(~j1~0 < ~n0~0 + ~n1~0); {26351#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 5))} is VALID [2018-11-23 13:12:38,241 INFO L256 TraceCheckUtils]: 33: Hoare triple {26351#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 5))} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {26336#true} is VALID [2018-11-23 13:12:38,241 INFO L273 TraceCheckUtils]: 34: Hoare triple {26336#true} ~cond := #in~cond; {26336#true} is VALID [2018-11-23 13:12:38,241 INFO L273 TraceCheckUtils]: 35: Hoare triple {26336#true} assume !(0 == ~cond); {26336#true} is VALID [2018-11-23 13:12:38,241 INFO L273 TraceCheckUtils]: 36: Hoare triple {26336#true} assume true; {26336#true} is VALID [2018-11-23 13:12:38,242 INFO L268 TraceCheckUtils]: 37: Hoare quadruple {26336#true} {26351#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 5))} #70#return; {26351#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 5))} is VALID [2018-11-23 13:12:38,243 INFO L273 TraceCheckUtils]: 38: Hoare triple {26351#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 5))} #t~post7 := ~j1~0;~j1~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~k~0;~k~0 := #t~post8 - 1;havoc #t~post8; {26352#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 4))} is VALID [2018-11-23 13:12:38,244 INFO L273 TraceCheckUtils]: 39: Hoare triple {26352#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 4))} assume !!(~j1~0 < ~n0~0 + ~n1~0); {26352#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 4))} is VALID [2018-11-23 13:12:38,244 INFO L256 TraceCheckUtils]: 40: Hoare triple {26352#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 4))} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {26336#true} is VALID [2018-11-23 13:12:38,244 INFO L273 TraceCheckUtils]: 41: Hoare triple {26336#true} ~cond := #in~cond; {26336#true} is VALID [2018-11-23 13:12:38,245 INFO L273 TraceCheckUtils]: 42: Hoare triple {26336#true} assume !(0 == ~cond); {26336#true} is VALID [2018-11-23 13:12:38,245 INFO L273 TraceCheckUtils]: 43: Hoare triple {26336#true} assume true; {26336#true} is VALID [2018-11-23 13:12:38,246 INFO L268 TraceCheckUtils]: 44: Hoare quadruple {26336#true} {26352#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 4))} #70#return; {26352#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 4))} is VALID [2018-11-23 13:12:38,247 INFO L273 TraceCheckUtils]: 45: Hoare triple {26352#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 4))} #t~post7 := ~j1~0;~j1~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~k~0;~k~0 := #t~post8 - 1;havoc #t~post8; {26353#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 3))} is VALID [2018-11-23 13:12:38,248 INFO L273 TraceCheckUtils]: 46: Hoare triple {26353#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 3))} assume !!(~j1~0 < ~n0~0 + ~n1~0); {26353#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 3))} is VALID [2018-11-23 13:12:38,248 INFO L256 TraceCheckUtils]: 47: Hoare triple {26353#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 3))} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {26336#true} is VALID [2018-11-23 13:12:38,248 INFO L273 TraceCheckUtils]: 48: Hoare triple {26336#true} ~cond := #in~cond; {26336#true} is VALID [2018-11-23 13:12:38,248 INFO L273 TraceCheckUtils]: 49: Hoare triple {26336#true} assume !(0 == ~cond); {26336#true} is VALID [2018-11-23 13:12:38,248 INFO L273 TraceCheckUtils]: 50: Hoare triple {26336#true} assume true; {26336#true} is VALID [2018-11-23 13:12:38,249 INFO L268 TraceCheckUtils]: 51: Hoare quadruple {26336#true} {26353#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 3))} #70#return; {26353#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 3))} is VALID [2018-11-23 13:12:38,250 INFO L273 TraceCheckUtils]: 52: Hoare triple {26353#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 3))} #t~post7 := ~j1~0;~j1~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~k~0;~k~0 := #t~post8 - 1;havoc #t~post8; {26354#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 2))} is VALID [2018-11-23 13:12:38,251 INFO L273 TraceCheckUtils]: 53: Hoare triple {26354#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 2))} assume !!(~j1~0 < ~n0~0 + ~n1~0); {26354#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 2))} is VALID [2018-11-23 13:12:38,251 INFO L256 TraceCheckUtils]: 54: Hoare triple {26354#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 2))} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {26336#true} is VALID [2018-11-23 13:12:38,251 INFO L273 TraceCheckUtils]: 55: Hoare triple {26336#true} ~cond := #in~cond; {26336#true} is VALID [2018-11-23 13:12:38,251 INFO L273 TraceCheckUtils]: 56: Hoare triple {26336#true} assume !(0 == ~cond); {26336#true} is VALID [2018-11-23 13:12:38,251 INFO L273 TraceCheckUtils]: 57: Hoare triple {26336#true} assume true; {26336#true} is VALID [2018-11-23 13:12:38,252 INFO L268 TraceCheckUtils]: 58: Hoare quadruple {26336#true} {26354#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 2))} #70#return; {26354#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 2))} is VALID [2018-11-23 13:12:38,253 INFO L273 TraceCheckUtils]: 59: Hoare triple {26354#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 2))} #t~post7 := ~j1~0;~j1~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~k~0;~k~0 := #t~post8 - 1;havoc #t~post8; {26355#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 1))} is VALID [2018-11-23 13:12:38,253 INFO L273 TraceCheckUtils]: 60: Hoare triple {26355#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 1))} assume !!(~j1~0 < ~n0~0 + ~n1~0); {26355#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 1))} is VALID [2018-11-23 13:12:38,254 INFO L256 TraceCheckUtils]: 61: Hoare triple {26355#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 1))} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {26336#true} is VALID [2018-11-23 13:12:38,254 INFO L273 TraceCheckUtils]: 62: Hoare triple {26336#true} ~cond := #in~cond; {26336#true} is VALID [2018-11-23 13:12:38,254 INFO L273 TraceCheckUtils]: 63: Hoare triple {26336#true} assume !(0 == ~cond); {26336#true} is VALID [2018-11-23 13:12:38,254 INFO L273 TraceCheckUtils]: 64: Hoare triple {26336#true} assume true; {26336#true} is VALID [2018-11-23 13:12:38,255 INFO L268 TraceCheckUtils]: 65: Hoare quadruple {26336#true} {26355#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 1))} #70#return; {26355#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 1))} is VALID [2018-11-23 13:12:38,256 INFO L273 TraceCheckUtils]: 66: Hoare triple {26355#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 1))} #t~post7 := ~j1~0;~j1~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~k~0;~k~0 := #t~post8 - 1;havoc #t~post8; {26356#(<= (+ main_~n0~0 main_~n1~0) main_~j1~0)} is VALID [2018-11-23 13:12:38,257 INFO L273 TraceCheckUtils]: 67: Hoare triple {26356#(<= (+ main_~n0~0 main_~n1~0) main_~j1~0)} assume !!(~j1~0 < ~n0~0 + ~n1~0); {26337#false} is VALID [2018-11-23 13:12:38,257 INFO L256 TraceCheckUtils]: 68: Hoare triple {26337#false} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {26337#false} is VALID [2018-11-23 13:12:38,257 INFO L273 TraceCheckUtils]: 69: Hoare triple {26337#false} ~cond := #in~cond; {26337#false} is VALID [2018-11-23 13:12:38,258 INFO L273 TraceCheckUtils]: 70: Hoare triple {26337#false} assume 0 == ~cond; {26337#false} is VALID [2018-11-23 13:12:38,258 INFO L273 TraceCheckUtils]: 71: Hoare triple {26337#false} assume !false; {26337#false} is VALID [2018-11-23 13:12:38,264 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 91 proven. 18 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2018-11-23 13:12:38,264 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:12:38,264 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:12:38,273 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 13:12:38,299 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2018-11-23 13:12:38,299 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:12:38,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:12:38,314 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:12:38,843 INFO L256 TraceCheckUtils]: 0: Hoare triple {26336#true} call ULTIMATE.init(); {26336#true} is VALID [2018-11-23 13:12:38,843 INFO L273 TraceCheckUtils]: 1: Hoare triple {26336#true} assume true; {26336#true} is VALID [2018-11-23 13:12:38,843 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {26336#true} {26336#true} #66#return; {26336#true} is VALID [2018-11-23 13:12:38,844 INFO L256 TraceCheckUtils]: 3: Hoare triple {26336#true} call #t~ret9 := main(); {26336#true} is VALID [2018-11-23 13:12:38,844 INFO L273 TraceCheckUtils]: 4: Hoare triple {26336#true} havoc ~n0~0;havoc ~n1~0;~i0~0 := 0;~k~0 := 0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n0~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~n1~0 := #t~nondet2;havoc #t~nondet2; {26338#(<= main_~i0~0 0)} is VALID [2018-11-23 13:12:38,845 INFO L273 TraceCheckUtils]: 5: Hoare triple {26338#(<= main_~i0~0 0)} assume !!(-1000000 <= ~n0~0 && ~n0~0 < 1000000); {26338#(<= main_~i0~0 0)} is VALID [2018-11-23 13:12:38,845 INFO L273 TraceCheckUtils]: 6: Hoare triple {26338#(<= main_~i0~0 0)} assume !!(-1000000 <= ~n1~0 && ~n1~0 < 1000000); {26338#(<= main_~i0~0 0)} is VALID [2018-11-23 13:12:38,846 INFO L273 TraceCheckUtils]: 7: Hoare triple {26338#(<= main_~i0~0 0)} assume !!(~i0~0 < ~n0~0);#t~post3 := ~i0~0;~i0~0 := 1 + #t~post3;havoc #t~post3;#t~post4 := ~k~0;~k~0 := 1 + #t~post4;havoc #t~post4; {26339#(<= main_~i0~0 1)} is VALID [2018-11-23 13:12:38,846 INFO L273 TraceCheckUtils]: 8: Hoare triple {26339#(<= main_~i0~0 1)} assume !!(~i0~0 < ~n0~0);#t~post3 := ~i0~0;~i0~0 := 1 + #t~post3;havoc #t~post3;#t~post4 := ~k~0;~k~0 := 1 + #t~post4;havoc #t~post4; {26340#(<= main_~i0~0 2)} is VALID [2018-11-23 13:12:38,847 INFO L273 TraceCheckUtils]: 9: Hoare triple {26340#(<= main_~i0~0 2)} assume !(~i0~0 < ~n0~0); {26341#(<= main_~n0~0 2)} is VALID [2018-11-23 13:12:38,847 INFO L273 TraceCheckUtils]: 10: Hoare triple {26341#(<= main_~n0~0 2)} ~i1~0 := 0; {26390#(and (<= main_~n0~0 2) (<= main_~i1~0 0))} is VALID [2018-11-23 13:12:38,848 INFO L273 TraceCheckUtils]: 11: Hoare triple {26390#(and (<= main_~n0~0 2) (<= main_~i1~0 0))} assume !!(~i1~0 < ~n1~0);#t~post5 := ~i1~0;~i1~0 := 1 + #t~post5;havoc #t~post5;#t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {26394#(and (<= main_~n0~0 2) (<= main_~i1~0 1))} is VALID [2018-11-23 13:12:38,849 INFO L273 TraceCheckUtils]: 12: Hoare triple {26394#(and (<= main_~n0~0 2) (<= main_~i1~0 1))} assume !!(~i1~0 < ~n1~0);#t~post5 := ~i1~0;~i1~0 := 1 + #t~post5;havoc #t~post5;#t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {26398#(and (<= main_~n0~0 2) (<= main_~i1~0 2))} is VALID [2018-11-23 13:12:38,850 INFO L273 TraceCheckUtils]: 13: Hoare triple {26398#(and (<= main_~n0~0 2) (<= main_~i1~0 2))} assume !!(~i1~0 < ~n1~0);#t~post5 := ~i1~0;~i1~0 := 1 + #t~post5;havoc #t~post5;#t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {26402#(and (<= main_~n0~0 2) (<= main_~i1~0 3))} is VALID [2018-11-23 13:12:38,850 INFO L273 TraceCheckUtils]: 14: Hoare triple {26402#(and (<= main_~n0~0 2) (<= main_~i1~0 3))} assume !!(~i1~0 < ~n1~0);#t~post5 := ~i1~0;~i1~0 := 1 + #t~post5;havoc #t~post5;#t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {26406#(and (<= main_~n0~0 2) (<= main_~i1~0 4))} is VALID [2018-11-23 13:12:38,851 INFO L273 TraceCheckUtils]: 15: Hoare triple {26406#(and (<= main_~n0~0 2) (<= main_~i1~0 4))} assume !!(~i1~0 < ~n1~0);#t~post5 := ~i1~0;~i1~0 := 1 + #t~post5;havoc #t~post5;#t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {26410#(and (<= main_~n0~0 2) (<= main_~i1~0 5))} is VALID [2018-11-23 13:12:38,852 INFO L273 TraceCheckUtils]: 16: Hoare triple {26410#(and (<= main_~n0~0 2) (<= main_~i1~0 5))} assume !(~i1~0 < ~n1~0); {26414#(and (<= main_~n1~0 5) (<= main_~n0~0 2))} is VALID [2018-11-23 13:12:38,853 INFO L273 TraceCheckUtils]: 17: Hoare triple {26414#(and (<= main_~n1~0 5) (<= main_~n0~0 2))} ~j1~0 := 0; {26418#(and (<= main_~n1~0 5) (<= main_~n0~0 2) (<= 0 main_~j1~0))} is VALID [2018-11-23 13:12:38,854 INFO L273 TraceCheckUtils]: 18: Hoare triple {26418#(and (<= main_~n1~0 5) (<= main_~n0~0 2) (<= 0 main_~j1~0))} assume !!(~j1~0 < ~n0~0 + ~n1~0); {26418#(and (<= main_~n1~0 5) (<= main_~n0~0 2) (<= 0 main_~j1~0))} is VALID [2018-11-23 13:12:38,854 INFO L256 TraceCheckUtils]: 19: Hoare triple {26418#(and (<= main_~n1~0 5) (<= main_~n0~0 2) (<= 0 main_~j1~0))} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {26336#true} is VALID [2018-11-23 13:12:38,854 INFO L273 TraceCheckUtils]: 20: Hoare triple {26336#true} ~cond := #in~cond; {26336#true} is VALID [2018-11-23 13:12:38,854 INFO L273 TraceCheckUtils]: 21: Hoare triple {26336#true} assume !(0 == ~cond); {26336#true} is VALID [2018-11-23 13:12:38,854 INFO L273 TraceCheckUtils]: 22: Hoare triple {26336#true} assume true; {26336#true} is VALID [2018-11-23 13:12:38,856 INFO L268 TraceCheckUtils]: 23: Hoare quadruple {26336#true} {26418#(and (<= main_~n1~0 5) (<= main_~n0~0 2) (<= 0 main_~j1~0))} #70#return; {26418#(and (<= main_~n1~0 5) (<= main_~n0~0 2) (<= 0 main_~j1~0))} is VALID [2018-11-23 13:12:38,857 INFO L273 TraceCheckUtils]: 24: Hoare triple {26418#(and (<= main_~n1~0 5) (<= main_~n0~0 2) (<= 0 main_~j1~0))} #t~post7 := ~j1~0;~j1~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~k~0;~k~0 := #t~post8 - 1;havoc #t~post8; {26440#(and (<= main_~n1~0 5) (<= 1 main_~j1~0) (<= main_~n0~0 2))} is VALID [2018-11-23 13:12:38,857 INFO L273 TraceCheckUtils]: 25: Hoare triple {26440#(and (<= main_~n1~0 5) (<= 1 main_~j1~0) (<= main_~n0~0 2))} assume !!(~j1~0 < ~n0~0 + ~n1~0); {26440#(and (<= main_~n1~0 5) (<= 1 main_~j1~0) (<= main_~n0~0 2))} is VALID [2018-11-23 13:12:38,857 INFO L256 TraceCheckUtils]: 26: Hoare triple {26440#(and (<= main_~n1~0 5) (<= 1 main_~j1~0) (<= main_~n0~0 2))} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {26336#true} is VALID [2018-11-23 13:12:38,857 INFO L273 TraceCheckUtils]: 27: Hoare triple {26336#true} ~cond := #in~cond; {26336#true} is VALID [2018-11-23 13:12:38,857 INFO L273 TraceCheckUtils]: 28: Hoare triple {26336#true} assume !(0 == ~cond); {26336#true} is VALID [2018-11-23 13:12:38,857 INFO L273 TraceCheckUtils]: 29: Hoare triple {26336#true} assume true; {26336#true} is VALID [2018-11-23 13:12:38,858 INFO L268 TraceCheckUtils]: 30: Hoare quadruple {26336#true} {26440#(and (<= main_~n1~0 5) (<= 1 main_~j1~0) (<= main_~n0~0 2))} #70#return; {26440#(and (<= main_~n1~0 5) (<= 1 main_~j1~0) (<= main_~n0~0 2))} is VALID [2018-11-23 13:12:38,859 INFO L273 TraceCheckUtils]: 31: Hoare triple {26440#(and (<= main_~n1~0 5) (<= 1 main_~j1~0) (<= main_~n0~0 2))} #t~post7 := ~j1~0;~j1~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~k~0;~k~0 := #t~post8 - 1;havoc #t~post8; {26462#(and (<= main_~n1~0 5) (<= main_~n0~0 2) (<= 2 main_~j1~0))} is VALID [2018-11-23 13:12:38,859 INFO L273 TraceCheckUtils]: 32: Hoare triple {26462#(and (<= main_~n1~0 5) (<= main_~n0~0 2) (<= 2 main_~j1~0))} assume !!(~j1~0 < ~n0~0 + ~n1~0); {26462#(and (<= main_~n1~0 5) (<= main_~n0~0 2) (<= 2 main_~j1~0))} is VALID [2018-11-23 13:12:38,859 INFO L256 TraceCheckUtils]: 33: Hoare triple {26462#(and (<= main_~n1~0 5) (<= main_~n0~0 2) (<= 2 main_~j1~0))} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {26336#true} is VALID [2018-11-23 13:12:38,860 INFO L273 TraceCheckUtils]: 34: Hoare triple {26336#true} ~cond := #in~cond; {26336#true} is VALID [2018-11-23 13:12:38,860 INFO L273 TraceCheckUtils]: 35: Hoare triple {26336#true} assume !(0 == ~cond); {26336#true} is VALID [2018-11-23 13:12:38,860 INFO L273 TraceCheckUtils]: 36: Hoare triple {26336#true} assume true; {26336#true} is VALID [2018-11-23 13:12:38,861 INFO L268 TraceCheckUtils]: 37: Hoare quadruple {26336#true} {26462#(and (<= main_~n1~0 5) (<= main_~n0~0 2) (<= 2 main_~j1~0))} #70#return; {26462#(and (<= main_~n1~0 5) (<= main_~n0~0 2) (<= 2 main_~j1~0))} is VALID [2018-11-23 13:12:38,862 INFO L273 TraceCheckUtils]: 38: Hoare triple {26462#(and (<= main_~n1~0 5) (<= main_~n0~0 2) (<= 2 main_~j1~0))} #t~post7 := ~j1~0;~j1~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~k~0;~k~0 := #t~post8 - 1;havoc #t~post8; {26484#(and (<= main_~n1~0 5) (<= main_~n0~0 2) (<= 3 main_~j1~0))} is VALID [2018-11-23 13:12:38,863 INFO L273 TraceCheckUtils]: 39: Hoare triple {26484#(and (<= main_~n1~0 5) (<= main_~n0~0 2) (<= 3 main_~j1~0))} assume !!(~j1~0 < ~n0~0 + ~n1~0); {26484#(and (<= main_~n1~0 5) (<= main_~n0~0 2) (<= 3 main_~j1~0))} is VALID [2018-11-23 13:12:38,863 INFO L256 TraceCheckUtils]: 40: Hoare triple {26484#(and (<= main_~n1~0 5) (<= main_~n0~0 2) (<= 3 main_~j1~0))} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {26336#true} is VALID [2018-11-23 13:12:38,863 INFO L273 TraceCheckUtils]: 41: Hoare triple {26336#true} ~cond := #in~cond; {26336#true} is VALID [2018-11-23 13:12:38,863 INFO L273 TraceCheckUtils]: 42: Hoare triple {26336#true} assume !(0 == ~cond); {26336#true} is VALID [2018-11-23 13:12:38,863 INFO L273 TraceCheckUtils]: 43: Hoare triple {26336#true} assume true; {26336#true} is VALID [2018-11-23 13:12:38,865 INFO L268 TraceCheckUtils]: 44: Hoare quadruple {26336#true} {26484#(and (<= main_~n1~0 5) (<= main_~n0~0 2) (<= 3 main_~j1~0))} #70#return; {26484#(and (<= main_~n1~0 5) (<= main_~n0~0 2) (<= 3 main_~j1~0))} is VALID [2018-11-23 13:12:38,866 INFO L273 TraceCheckUtils]: 45: Hoare triple {26484#(and (<= main_~n1~0 5) (<= main_~n0~0 2) (<= 3 main_~j1~0))} #t~post7 := ~j1~0;~j1~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~k~0;~k~0 := #t~post8 - 1;havoc #t~post8; {26506#(and (<= main_~n1~0 5) (<= main_~n0~0 2) (<= 4 main_~j1~0))} is VALID [2018-11-23 13:12:38,866 INFO L273 TraceCheckUtils]: 46: Hoare triple {26506#(and (<= main_~n1~0 5) (<= main_~n0~0 2) (<= 4 main_~j1~0))} assume !!(~j1~0 < ~n0~0 + ~n1~0); {26506#(and (<= main_~n1~0 5) (<= main_~n0~0 2) (<= 4 main_~j1~0))} is VALID [2018-11-23 13:12:38,867 INFO L256 TraceCheckUtils]: 47: Hoare triple {26506#(and (<= main_~n1~0 5) (<= main_~n0~0 2) (<= 4 main_~j1~0))} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {26336#true} is VALID [2018-11-23 13:12:38,867 INFO L273 TraceCheckUtils]: 48: Hoare triple {26336#true} ~cond := #in~cond; {26336#true} is VALID [2018-11-23 13:12:38,867 INFO L273 TraceCheckUtils]: 49: Hoare triple {26336#true} assume !(0 == ~cond); {26336#true} is VALID [2018-11-23 13:12:38,867 INFO L273 TraceCheckUtils]: 50: Hoare triple {26336#true} assume true; {26336#true} is VALID [2018-11-23 13:12:38,868 INFO L268 TraceCheckUtils]: 51: Hoare quadruple {26336#true} {26506#(and (<= main_~n1~0 5) (<= main_~n0~0 2) (<= 4 main_~j1~0))} #70#return; {26506#(and (<= main_~n1~0 5) (<= main_~n0~0 2) (<= 4 main_~j1~0))} is VALID [2018-11-23 13:12:38,869 INFO L273 TraceCheckUtils]: 52: Hoare triple {26506#(and (<= main_~n1~0 5) (<= main_~n0~0 2) (<= 4 main_~j1~0))} #t~post7 := ~j1~0;~j1~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~k~0;~k~0 := #t~post8 - 1;havoc #t~post8; {26528#(and (<= main_~n1~0 5) (<= main_~n0~0 2) (<= 5 main_~j1~0))} is VALID [2018-11-23 13:12:38,870 INFO L273 TraceCheckUtils]: 53: Hoare triple {26528#(and (<= main_~n1~0 5) (<= main_~n0~0 2) (<= 5 main_~j1~0))} assume !!(~j1~0 < ~n0~0 + ~n1~0); {26528#(and (<= main_~n1~0 5) (<= main_~n0~0 2) (<= 5 main_~j1~0))} is VALID [2018-11-23 13:12:38,870 INFO L256 TraceCheckUtils]: 54: Hoare triple {26528#(and (<= main_~n1~0 5) (<= main_~n0~0 2) (<= 5 main_~j1~0))} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {26336#true} is VALID [2018-11-23 13:12:38,870 INFO L273 TraceCheckUtils]: 55: Hoare triple {26336#true} ~cond := #in~cond; {26336#true} is VALID [2018-11-23 13:12:38,870 INFO L273 TraceCheckUtils]: 56: Hoare triple {26336#true} assume !(0 == ~cond); {26336#true} is VALID [2018-11-23 13:12:38,870 INFO L273 TraceCheckUtils]: 57: Hoare triple {26336#true} assume true; {26336#true} is VALID [2018-11-23 13:12:38,871 INFO L268 TraceCheckUtils]: 58: Hoare quadruple {26336#true} {26528#(and (<= main_~n1~0 5) (<= main_~n0~0 2) (<= 5 main_~j1~0))} #70#return; {26528#(and (<= main_~n1~0 5) (<= main_~n0~0 2) (<= 5 main_~j1~0))} is VALID [2018-11-23 13:12:38,872 INFO L273 TraceCheckUtils]: 59: Hoare triple {26528#(and (<= main_~n1~0 5) (<= main_~n0~0 2) (<= 5 main_~j1~0))} #t~post7 := ~j1~0;~j1~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~k~0;~k~0 := #t~post8 - 1;havoc #t~post8; {26550#(and (<= main_~n1~0 5) (<= 6 main_~j1~0) (<= main_~n0~0 2))} is VALID [2018-11-23 13:12:38,872 INFO L273 TraceCheckUtils]: 60: Hoare triple {26550#(and (<= main_~n1~0 5) (<= 6 main_~j1~0) (<= main_~n0~0 2))} assume !!(~j1~0 < ~n0~0 + ~n1~0); {26550#(and (<= main_~n1~0 5) (<= 6 main_~j1~0) (<= main_~n0~0 2))} is VALID [2018-11-23 13:12:38,872 INFO L256 TraceCheckUtils]: 61: Hoare triple {26550#(and (<= main_~n1~0 5) (<= 6 main_~j1~0) (<= main_~n0~0 2))} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {26336#true} is VALID [2018-11-23 13:12:38,872 INFO L273 TraceCheckUtils]: 62: Hoare triple {26336#true} ~cond := #in~cond; {26336#true} is VALID [2018-11-23 13:12:38,873 INFO L273 TraceCheckUtils]: 63: Hoare triple {26336#true} assume !(0 == ~cond); {26336#true} is VALID [2018-11-23 13:12:38,873 INFO L273 TraceCheckUtils]: 64: Hoare triple {26336#true} assume true; {26336#true} is VALID [2018-11-23 13:12:38,874 INFO L268 TraceCheckUtils]: 65: Hoare quadruple {26336#true} {26550#(and (<= main_~n1~0 5) (<= 6 main_~j1~0) (<= main_~n0~0 2))} #70#return; {26550#(and (<= main_~n1~0 5) (<= 6 main_~j1~0) (<= main_~n0~0 2))} is VALID [2018-11-23 13:12:38,875 INFO L273 TraceCheckUtils]: 66: Hoare triple {26550#(and (<= main_~n1~0 5) (<= 6 main_~j1~0) (<= main_~n0~0 2))} #t~post7 := ~j1~0;~j1~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~k~0;~k~0 := #t~post8 - 1;havoc #t~post8; {26572#(and (<= main_~n1~0 5) (<= main_~n0~0 2) (<= 7 main_~j1~0))} is VALID [2018-11-23 13:12:38,876 INFO L273 TraceCheckUtils]: 67: Hoare triple {26572#(and (<= main_~n1~0 5) (<= main_~n0~0 2) (<= 7 main_~j1~0))} assume !!(~j1~0 < ~n0~0 + ~n1~0); {26337#false} is VALID [2018-11-23 13:12:38,876 INFO L256 TraceCheckUtils]: 68: Hoare triple {26337#false} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {26337#false} is VALID [2018-11-23 13:12:38,876 INFO L273 TraceCheckUtils]: 69: Hoare triple {26337#false} ~cond := #in~cond; {26337#false} is VALID [2018-11-23 13:12:38,877 INFO L273 TraceCheckUtils]: 70: Hoare triple {26337#false} assume 0 == ~cond; {26337#false} is VALID [2018-11-23 13:12:38,877 INFO L273 TraceCheckUtils]: 71: Hoare triple {26337#false} assume !false; {26337#false} is VALID [2018-11-23 13:12:38,883 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 91 proven. 18 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2018-11-23 13:12:38,902 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:12:38,902 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 36 [2018-11-23 13:12:38,903 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 72 [2018-11-23 13:12:38,903 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:12:38,903 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 36 states. [2018-11-23 13:12:38,991 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 91 edges. 91 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:12:38,991 INFO L459 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-11-23 13:12:38,992 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-11-23 13:12:38,992 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=247, Invalid=1013, Unknown=0, NotChecked=0, Total=1260 [2018-11-23 13:12:38,992 INFO L87 Difference]: Start difference. First operand 90 states and 99 transitions. Second operand 36 states. [2018-11-23 13:12:43,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:12:43,473 INFO L93 Difference]: Finished difference Result 214 states and 258 transitions. [2018-11-23 13:12:43,473 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-11-23 13:12:43,474 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 72 [2018-11-23 13:12:43,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:12:43,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-11-23 13:12:43,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 110 transitions. [2018-11-23 13:12:43,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-11-23 13:12:43,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 110 transitions. [2018-11-23 13:12:43,477 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 35 states and 110 transitions. [2018-11-23 13:12:43,591 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 110 edges. 110 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:12:43,596 INFO L225 Difference]: With dead ends: 214 [2018-11-23 13:12:43,596 INFO L226 Difference]: Without dead ends: 182 [2018-11-23 13:12:43,596 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1256 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=823, Invalid=3467, Unknown=0, NotChecked=0, Total=4290 [2018-11-23 13:12:43,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2018-11-23 13:12:44,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 90. [2018-11-23 13:12:44,095 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:12:44,095 INFO L82 GeneralOperation]: Start isEquivalent. First operand 182 states. Second operand 90 states. [2018-11-23 13:12:44,095 INFO L74 IsIncluded]: Start isIncluded. First operand 182 states. Second operand 90 states. [2018-11-23 13:12:44,096 INFO L87 Difference]: Start difference. First operand 182 states. Second operand 90 states. [2018-11-23 13:12:44,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:12:44,099 INFO L93 Difference]: Finished difference Result 182 states and 218 transitions. [2018-11-23 13:12:44,099 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 218 transitions. [2018-11-23 13:12:44,100 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:12:44,100 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:12:44,100 INFO L74 IsIncluded]: Start isIncluded. First operand 90 states. Second operand 182 states. [2018-11-23 13:12:44,100 INFO L87 Difference]: Start difference. First operand 90 states. Second operand 182 states. [2018-11-23 13:12:44,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:12:44,104 INFO L93 Difference]: Finished difference Result 182 states and 218 transitions. [2018-11-23 13:12:44,104 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 218 transitions. [2018-11-23 13:12:44,104 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:12:44,104 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:12:44,105 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:12:44,105 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:12:44,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2018-11-23 13:12:44,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 99 transitions. [2018-11-23 13:12:44,106 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 99 transitions. Word has length 72 [2018-11-23 13:12:44,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:12:44,107 INFO L480 AbstractCegarLoop]: Abstraction has 90 states and 99 transitions. [2018-11-23 13:12:44,107 INFO L481 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-11-23 13:12:44,107 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 99 transitions. [2018-11-23 13:12:44,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-11-23 13:12:44,107 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:12:44,107 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 8, 7, 7, 7, 7, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:12:44,108 INFO L423 AbstractCegarLoop]: === Iteration 39 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:12:44,108 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:12:44,108 INFO L82 PathProgramCache]: Analyzing trace with hash 810866159, now seen corresponding path program 18 times [2018-11-23 13:12:44,108 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:12:44,108 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:12:44,109 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:12:44,109 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:12:44,109 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:12:44,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:12:44,532 INFO L256 TraceCheckUtils]: 0: Hoare triple {27491#true} call ULTIMATE.init(); {27491#true} is VALID [2018-11-23 13:12:44,533 INFO L273 TraceCheckUtils]: 1: Hoare triple {27491#true} assume true; {27491#true} is VALID [2018-11-23 13:12:44,533 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {27491#true} {27491#true} #66#return; {27491#true} is VALID [2018-11-23 13:12:44,533 INFO L256 TraceCheckUtils]: 3: Hoare triple {27491#true} call #t~ret9 := main(); {27491#true} is VALID [2018-11-23 13:12:44,534 INFO L273 TraceCheckUtils]: 4: Hoare triple {27491#true} havoc ~n0~0;havoc ~n1~0;~i0~0 := 0;~k~0 := 0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n0~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~n1~0 := #t~nondet2;havoc #t~nondet2; {27493#(<= main_~i0~0 0)} is VALID [2018-11-23 13:12:44,534 INFO L273 TraceCheckUtils]: 5: Hoare triple {27493#(<= main_~i0~0 0)} assume !!(-1000000 <= ~n0~0 && ~n0~0 < 1000000); {27493#(<= main_~i0~0 0)} is VALID [2018-11-23 13:12:44,535 INFO L273 TraceCheckUtils]: 6: Hoare triple {27493#(<= main_~i0~0 0)} assume !!(-1000000 <= ~n1~0 && ~n1~0 < 1000000); {27493#(<= main_~i0~0 0)} is VALID [2018-11-23 13:12:44,536 INFO L273 TraceCheckUtils]: 7: Hoare triple {27493#(<= main_~i0~0 0)} assume !!(~i0~0 < ~n0~0);#t~post3 := ~i0~0;~i0~0 := 1 + #t~post3;havoc #t~post3;#t~post4 := ~k~0;~k~0 := 1 + #t~post4;havoc #t~post4; {27494#(<= main_~i0~0 1)} is VALID [2018-11-23 13:12:44,537 INFO L273 TraceCheckUtils]: 8: Hoare triple {27494#(<= main_~i0~0 1)} assume !!(~i0~0 < ~n0~0);#t~post3 := ~i0~0;~i0~0 := 1 + #t~post3;havoc #t~post3;#t~post4 := ~k~0;~k~0 := 1 + #t~post4;havoc #t~post4; {27495#(<= main_~i0~0 2)} is VALID [2018-11-23 13:12:44,538 INFO L273 TraceCheckUtils]: 9: Hoare triple {27495#(<= main_~i0~0 2)} assume !!(~i0~0 < ~n0~0);#t~post3 := ~i0~0;~i0~0 := 1 + #t~post3;havoc #t~post3;#t~post4 := ~k~0;~k~0 := 1 + #t~post4;havoc #t~post4; {27496#(<= main_~i0~0 3)} is VALID [2018-11-23 13:12:44,538 INFO L273 TraceCheckUtils]: 10: Hoare triple {27496#(<= main_~i0~0 3)} assume !(~i0~0 < ~n0~0); {27497#(<= main_~n0~0 3)} is VALID [2018-11-23 13:12:44,539 INFO L273 TraceCheckUtils]: 11: Hoare triple {27497#(<= main_~n0~0 3)} ~i1~0 := 0; {27498#(<= (+ main_~i1~0 main_~n0~0) 3)} is VALID [2018-11-23 13:12:44,540 INFO L273 TraceCheckUtils]: 12: Hoare triple {27498#(<= (+ main_~i1~0 main_~n0~0) 3)} assume !!(~i1~0 < ~n1~0);#t~post5 := ~i1~0;~i1~0 := 1 + #t~post5;havoc #t~post5;#t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {27499#(<= (+ main_~i1~0 main_~n0~0) 4)} is VALID [2018-11-23 13:12:44,541 INFO L273 TraceCheckUtils]: 13: Hoare triple {27499#(<= (+ main_~i1~0 main_~n0~0) 4)} assume !!(~i1~0 < ~n1~0);#t~post5 := ~i1~0;~i1~0 := 1 + #t~post5;havoc #t~post5;#t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {27500#(<= (+ main_~i1~0 main_~n0~0) 5)} is VALID [2018-11-23 13:12:44,542 INFO L273 TraceCheckUtils]: 14: Hoare triple {27500#(<= (+ main_~i1~0 main_~n0~0) 5)} assume !!(~i1~0 < ~n1~0);#t~post5 := ~i1~0;~i1~0 := 1 + #t~post5;havoc #t~post5;#t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {27501#(<= (+ main_~i1~0 main_~n0~0) 6)} is VALID [2018-11-23 13:12:44,543 INFO L273 TraceCheckUtils]: 15: Hoare triple {27501#(<= (+ main_~i1~0 main_~n0~0) 6)} assume !!(~i1~0 < ~n1~0);#t~post5 := ~i1~0;~i1~0 := 1 + #t~post5;havoc #t~post5;#t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {27502#(<= (+ main_~i1~0 main_~n0~0) 7)} is VALID [2018-11-23 13:12:44,543 INFO L273 TraceCheckUtils]: 16: Hoare triple {27502#(<= (+ main_~i1~0 main_~n0~0) 7)} assume !(~i1~0 < ~n1~0); {27503#(<= (+ main_~n0~0 main_~n1~0) 7)} is VALID [2018-11-23 13:12:44,544 INFO L273 TraceCheckUtils]: 17: Hoare triple {27503#(<= (+ main_~n0~0 main_~n1~0) 7)} ~j1~0 := 0; {27504#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 7))} is VALID [2018-11-23 13:12:44,545 INFO L273 TraceCheckUtils]: 18: Hoare triple {27504#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 7))} assume !!(~j1~0 < ~n0~0 + ~n1~0); {27504#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 7))} is VALID [2018-11-23 13:12:44,545 INFO L256 TraceCheckUtils]: 19: Hoare triple {27504#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 7))} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {27491#true} is VALID [2018-11-23 13:12:44,545 INFO L273 TraceCheckUtils]: 20: Hoare triple {27491#true} ~cond := #in~cond; {27491#true} is VALID [2018-11-23 13:12:44,545 INFO L273 TraceCheckUtils]: 21: Hoare triple {27491#true} assume !(0 == ~cond); {27491#true} is VALID [2018-11-23 13:12:44,546 INFO L273 TraceCheckUtils]: 22: Hoare triple {27491#true} assume true; {27491#true} is VALID [2018-11-23 13:12:44,547 INFO L268 TraceCheckUtils]: 23: Hoare quadruple {27491#true} {27504#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 7))} #70#return; {27504#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 7))} is VALID [2018-11-23 13:12:44,548 INFO L273 TraceCheckUtils]: 24: Hoare triple {27504#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 7))} #t~post7 := ~j1~0;~j1~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~k~0;~k~0 := #t~post8 - 1;havoc #t~post8; {27505#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 6))} is VALID [2018-11-23 13:12:44,548 INFO L273 TraceCheckUtils]: 25: Hoare triple {27505#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 6))} assume !!(~j1~0 < ~n0~0 + ~n1~0); {27505#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 6))} is VALID [2018-11-23 13:12:44,549 INFO L256 TraceCheckUtils]: 26: Hoare triple {27505#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 6))} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {27491#true} is VALID [2018-11-23 13:12:44,549 INFO L273 TraceCheckUtils]: 27: Hoare triple {27491#true} ~cond := #in~cond; {27491#true} is VALID [2018-11-23 13:12:44,549 INFO L273 TraceCheckUtils]: 28: Hoare triple {27491#true} assume !(0 == ~cond); {27491#true} is VALID [2018-11-23 13:12:44,549 INFO L273 TraceCheckUtils]: 29: Hoare triple {27491#true} assume true; {27491#true} is VALID [2018-11-23 13:12:44,550 INFO L268 TraceCheckUtils]: 30: Hoare quadruple {27491#true} {27505#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 6))} #70#return; {27505#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 6))} is VALID [2018-11-23 13:12:44,551 INFO L273 TraceCheckUtils]: 31: Hoare triple {27505#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 6))} #t~post7 := ~j1~0;~j1~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~k~0;~k~0 := #t~post8 - 1;havoc #t~post8; {27506#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 5))} is VALID [2018-11-23 13:12:44,552 INFO L273 TraceCheckUtils]: 32: Hoare triple {27506#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 5))} assume !!(~j1~0 < ~n0~0 + ~n1~0); {27506#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 5))} is VALID [2018-11-23 13:12:44,552 INFO L256 TraceCheckUtils]: 33: Hoare triple {27506#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 5))} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {27491#true} is VALID [2018-11-23 13:12:44,552 INFO L273 TraceCheckUtils]: 34: Hoare triple {27491#true} ~cond := #in~cond; {27491#true} is VALID [2018-11-23 13:12:44,553 INFO L273 TraceCheckUtils]: 35: Hoare triple {27491#true} assume !(0 == ~cond); {27491#true} is VALID [2018-11-23 13:12:44,553 INFO L273 TraceCheckUtils]: 36: Hoare triple {27491#true} assume true; {27491#true} is VALID [2018-11-23 13:12:44,554 INFO L268 TraceCheckUtils]: 37: Hoare quadruple {27491#true} {27506#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 5))} #70#return; {27506#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 5))} is VALID [2018-11-23 13:12:44,555 INFO L273 TraceCheckUtils]: 38: Hoare triple {27506#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 5))} #t~post7 := ~j1~0;~j1~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~k~0;~k~0 := #t~post8 - 1;havoc #t~post8; {27507#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 4))} is VALID [2018-11-23 13:12:44,555 INFO L273 TraceCheckUtils]: 39: Hoare triple {27507#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 4))} assume !!(~j1~0 < ~n0~0 + ~n1~0); {27507#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 4))} is VALID [2018-11-23 13:12:44,556 INFO L256 TraceCheckUtils]: 40: Hoare triple {27507#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 4))} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {27491#true} is VALID [2018-11-23 13:12:44,556 INFO L273 TraceCheckUtils]: 41: Hoare triple {27491#true} ~cond := #in~cond; {27491#true} is VALID [2018-11-23 13:12:44,556 INFO L273 TraceCheckUtils]: 42: Hoare triple {27491#true} assume !(0 == ~cond); {27491#true} is VALID [2018-11-23 13:12:44,556 INFO L273 TraceCheckUtils]: 43: Hoare triple {27491#true} assume true; {27491#true} is VALID [2018-11-23 13:12:44,557 INFO L268 TraceCheckUtils]: 44: Hoare quadruple {27491#true} {27507#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 4))} #70#return; {27507#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 4))} is VALID [2018-11-23 13:12:44,558 INFO L273 TraceCheckUtils]: 45: Hoare triple {27507#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 4))} #t~post7 := ~j1~0;~j1~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~k~0;~k~0 := #t~post8 - 1;havoc #t~post8; {27508#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 3))} is VALID [2018-11-23 13:12:44,559 INFO L273 TraceCheckUtils]: 46: Hoare triple {27508#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 3))} assume !!(~j1~0 < ~n0~0 + ~n1~0); {27508#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 3))} is VALID [2018-11-23 13:12:44,559 INFO L256 TraceCheckUtils]: 47: Hoare triple {27508#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 3))} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {27491#true} is VALID [2018-11-23 13:12:44,559 INFO L273 TraceCheckUtils]: 48: Hoare triple {27491#true} ~cond := #in~cond; {27491#true} is VALID [2018-11-23 13:12:44,559 INFO L273 TraceCheckUtils]: 49: Hoare triple {27491#true} assume !(0 == ~cond); {27491#true} is VALID [2018-11-23 13:12:44,559 INFO L273 TraceCheckUtils]: 50: Hoare triple {27491#true} assume true; {27491#true} is VALID [2018-11-23 13:12:44,560 INFO L268 TraceCheckUtils]: 51: Hoare quadruple {27491#true} {27508#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 3))} #70#return; {27508#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 3))} is VALID [2018-11-23 13:12:44,561 INFO L273 TraceCheckUtils]: 52: Hoare triple {27508#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 3))} #t~post7 := ~j1~0;~j1~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~k~0;~k~0 := #t~post8 - 1;havoc #t~post8; {27509#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 2))} is VALID [2018-11-23 13:12:44,562 INFO L273 TraceCheckUtils]: 53: Hoare triple {27509#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 2))} assume !!(~j1~0 < ~n0~0 + ~n1~0); {27509#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 2))} is VALID [2018-11-23 13:12:44,562 INFO L256 TraceCheckUtils]: 54: Hoare triple {27509#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 2))} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {27491#true} is VALID [2018-11-23 13:12:44,562 INFO L273 TraceCheckUtils]: 55: Hoare triple {27491#true} ~cond := #in~cond; {27491#true} is VALID [2018-11-23 13:12:44,562 INFO L273 TraceCheckUtils]: 56: Hoare triple {27491#true} assume !(0 == ~cond); {27491#true} is VALID [2018-11-23 13:12:44,563 INFO L273 TraceCheckUtils]: 57: Hoare triple {27491#true} assume true; {27491#true} is VALID [2018-11-23 13:12:44,563 INFO L268 TraceCheckUtils]: 58: Hoare quadruple {27491#true} {27509#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 2))} #70#return; {27509#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 2))} is VALID [2018-11-23 13:12:44,564 INFO L273 TraceCheckUtils]: 59: Hoare triple {27509#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 2))} #t~post7 := ~j1~0;~j1~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~k~0;~k~0 := #t~post8 - 1;havoc #t~post8; {27510#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 1))} is VALID [2018-11-23 13:12:44,564 INFO L273 TraceCheckUtils]: 60: Hoare triple {27510#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 1))} assume !!(~j1~0 < ~n0~0 + ~n1~0); {27510#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 1))} is VALID [2018-11-23 13:12:44,564 INFO L256 TraceCheckUtils]: 61: Hoare triple {27510#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 1))} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {27491#true} is VALID [2018-11-23 13:12:44,564 INFO L273 TraceCheckUtils]: 62: Hoare triple {27491#true} ~cond := #in~cond; {27491#true} is VALID [2018-11-23 13:12:44,565 INFO L273 TraceCheckUtils]: 63: Hoare triple {27491#true} assume !(0 == ~cond); {27491#true} is VALID [2018-11-23 13:12:44,565 INFO L273 TraceCheckUtils]: 64: Hoare triple {27491#true} assume true; {27491#true} is VALID [2018-11-23 13:12:44,565 INFO L268 TraceCheckUtils]: 65: Hoare quadruple {27491#true} {27510#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 1))} #70#return; {27510#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 1))} is VALID [2018-11-23 13:12:44,566 INFO L273 TraceCheckUtils]: 66: Hoare triple {27510#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 1))} #t~post7 := ~j1~0;~j1~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~k~0;~k~0 := #t~post8 - 1;havoc #t~post8; {27511#(<= (+ main_~n0~0 main_~n1~0) main_~j1~0)} is VALID [2018-11-23 13:12:44,567 INFO L273 TraceCheckUtils]: 67: Hoare triple {27511#(<= (+ main_~n0~0 main_~n1~0) main_~j1~0)} assume !!(~j1~0 < ~n0~0 + ~n1~0); {27492#false} is VALID [2018-11-23 13:12:44,567 INFO L256 TraceCheckUtils]: 68: Hoare triple {27492#false} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {27492#false} is VALID [2018-11-23 13:12:44,567 INFO L273 TraceCheckUtils]: 69: Hoare triple {27492#false} ~cond := #in~cond; {27492#false} is VALID [2018-11-23 13:12:44,567 INFO L273 TraceCheckUtils]: 70: Hoare triple {27492#false} assume 0 == ~cond; {27492#false} is VALID [2018-11-23 13:12:44,568 INFO L273 TraceCheckUtils]: 71: Hoare triple {27492#false} assume !false; {27492#false} is VALID [2018-11-23 13:12:44,573 INFO L134 CoverageAnalysis]: Checked inductivity of 191 backedges. 91 proven. 16 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2018-11-23 13:12:44,574 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:12:44,574 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:12:44,582 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-23 13:12:44,608 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2018-11-23 13:12:44,608 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:12:44,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:12:44,623 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:12:45,131 INFO L256 TraceCheckUtils]: 0: Hoare triple {27491#true} call ULTIMATE.init(); {27491#true} is VALID [2018-11-23 13:12:45,132 INFO L273 TraceCheckUtils]: 1: Hoare triple {27491#true} assume true; {27491#true} is VALID [2018-11-23 13:12:45,132 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {27491#true} {27491#true} #66#return; {27491#true} is VALID [2018-11-23 13:12:45,132 INFO L256 TraceCheckUtils]: 3: Hoare triple {27491#true} call #t~ret9 := main(); {27491#true} is VALID [2018-11-23 13:12:45,133 INFO L273 TraceCheckUtils]: 4: Hoare triple {27491#true} havoc ~n0~0;havoc ~n1~0;~i0~0 := 0;~k~0 := 0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n0~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~n1~0 := #t~nondet2;havoc #t~nondet2; {27493#(<= main_~i0~0 0)} is VALID [2018-11-23 13:12:45,133 INFO L273 TraceCheckUtils]: 5: Hoare triple {27493#(<= main_~i0~0 0)} assume !!(-1000000 <= ~n0~0 && ~n0~0 < 1000000); {27493#(<= main_~i0~0 0)} is VALID [2018-11-23 13:12:45,134 INFO L273 TraceCheckUtils]: 6: Hoare triple {27493#(<= main_~i0~0 0)} assume !!(-1000000 <= ~n1~0 && ~n1~0 < 1000000); {27493#(<= main_~i0~0 0)} is VALID [2018-11-23 13:12:45,135 INFO L273 TraceCheckUtils]: 7: Hoare triple {27493#(<= main_~i0~0 0)} assume !!(~i0~0 < ~n0~0);#t~post3 := ~i0~0;~i0~0 := 1 + #t~post3;havoc #t~post3;#t~post4 := ~k~0;~k~0 := 1 + #t~post4;havoc #t~post4; {27494#(<= main_~i0~0 1)} is VALID [2018-11-23 13:12:45,136 INFO L273 TraceCheckUtils]: 8: Hoare triple {27494#(<= main_~i0~0 1)} assume !!(~i0~0 < ~n0~0);#t~post3 := ~i0~0;~i0~0 := 1 + #t~post3;havoc #t~post3;#t~post4 := ~k~0;~k~0 := 1 + #t~post4;havoc #t~post4; {27495#(<= main_~i0~0 2)} is VALID [2018-11-23 13:12:45,136 INFO L273 TraceCheckUtils]: 9: Hoare triple {27495#(<= main_~i0~0 2)} assume !!(~i0~0 < ~n0~0);#t~post3 := ~i0~0;~i0~0 := 1 + #t~post3;havoc #t~post3;#t~post4 := ~k~0;~k~0 := 1 + #t~post4;havoc #t~post4; {27496#(<= main_~i0~0 3)} is VALID [2018-11-23 13:12:45,137 INFO L273 TraceCheckUtils]: 10: Hoare triple {27496#(<= main_~i0~0 3)} assume !(~i0~0 < ~n0~0); {27497#(<= main_~n0~0 3)} is VALID [2018-11-23 13:12:45,138 INFO L273 TraceCheckUtils]: 11: Hoare triple {27497#(<= main_~n0~0 3)} ~i1~0 := 0; {27548#(and (<= main_~i1~0 0) (<= main_~n0~0 3))} is VALID [2018-11-23 13:12:45,139 INFO L273 TraceCheckUtils]: 12: Hoare triple {27548#(and (<= main_~i1~0 0) (<= main_~n0~0 3))} assume !!(~i1~0 < ~n1~0);#t~post5 := ~i1~0;~i1~0 := 1 + #t~post5;havoc #t~post5;#t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {27552#(and (<= main_~n0~0 3) (<= main_~i1~0 1))} is VALID [2018-11-23 13:12:45,140 INFO L273 TraceCheckUtils]: 13: Hoare triple {27552#(and (<= main_~n0~0 3) (<= main_~i1~0 1))} assume !!(~i1~0 < ~n1~0);#t~post5 := ~i1~0;~i1~0 := 1 + #t~post5;havoc #t~post5;#t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {27556#(and (<= main_~i1~0 2) (<= main_~n0~0 3))} is VALID [2018-11-23 13:12:45,141 INFO L273 TraceCheckUtils]: 14: Hoare triple {27556#(and (<= main_~i1~0 2) (<= main_~n0~0 3))} assume !!(~i1~0 < ~n1~0);#t~post5 := ~i1~0;~i1~0 := 1 + #t~post5;havoc #t~post5;#t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {27560#(and (<= main_~n0~0 3) (<= main_~i1~0 3))} is VALID [2018-11-23 13:12:45,142 INFO L273 TraceCheckUtils]: 15: Hoare triple {27560#(and (<= main_~n0~0 3) (<= main_~i1~0 3))} assume !!(~i1~0 < ~n1~0);#t~post5 := ~i1~0;~i1~0 := 1 + #t~post5;havoc #t~post5;#t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {27564#(and (<= main_~n0~0 3) (<= main_~i1~0 4))} is VALID [2018-11-23 13:12:45,142 INFO L273 TraceCheckUtils]: 16: Hoare triple {27564#(and (<= main_~n0~0 3) (<= main_~i1~0 4))} assume !(~i1~0 < ~n1~0); {27568#(and (<= main_~n0~0 3) (<= main_~n1~0 4))} is VALID [2018-11-23 13:12:45,143 INFO L273 TraceCheckUtils]: 17: Hoare triple {27568#(and (<= main_~n0~0 3) (<= main_~n1~0 4))} ~j1~0 := 0; {27572#(and (<= main_~n0~0 3) (<= main_~n1~0 4) (<= 0 main_~j1~0))} is VALID [2018-11-23 13:12:45,144 INFO L273 TraceCheckUtils]: 18: Hoare triple {27572#(and (<= main_~n0~0 3) (<= main_~n1~0 4) (<= 0 main_~j1~0))} assume !!(~j1~0 < ~n0~0 + ~n1~0); {27572#(and (<= main_~n0~0 3) (<= main_~n1~0 4) (<= 0 main_~j1~0))} is VALID [2018-11-23 13:12:45,144 INFO L256 TraceCheckUtils]: 19: Hoare triple {27572#(and (<= main_~n0~0 3) (<= main_~n1~0 4) (<= 0 main_~j1~0))} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {27491#true} is VALID [2018-11-23 13:12:45,144 INFO L273 TraceCheckUtils]: 20: Hoare triple {27491#true} ~cond := #in~cond; {27491#true} is VALID [2018-11-23 13:12:45,144 INFO L273 TraceCheckUtils]: 21: Hoare triple {27491#true} assume !(0 == ~cond); {27491#true} is VALID [2018-11-23 13:12:45,145 INFO L273 TraceCheckUtils]: 22: Hoare triple {27491#true} assume true; {27491#true} is VALID [2018-11-23 13:12:45,146 INFO L268 TraceCheckUtils]: 23: Hoare quadruple {27491#true} {27572#(and (<= main_~n0~0 3) (<= main_~n1~0 4) (<= 0 main_~j1~0))} #70#return; {27572#(and (<= main_~n0~0 3) (<= main_~n1~0 4) (<= 0 main_~j1~0))} is VALID [2018-11-23 13:12:45,147 INFO L273 TraceCheckUtils]: 24: Hoare triple {27572#(and (<= main_~n0~0 3) (<= main_~n1~0 4) (<= 0 main_~j1~0))} #t~post7 := ~j1~0;~j1~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~k~0;~k~0 := #t~post8 - 1;havoc #t~post8; {27594#(and (<= 1 main_~j1~0) (<= main_~n0~0 3) (<= main_~n1~0 4))} is VALID [2018-11-23 13:12:45,147 INFO L273 TraceCheckUtils]: 25: Hoare triple {27594#(and (<= 1 main_~j1~0) (<= main_~n0~0 3) (<= main_~n1~0 4))} assume !!(~j1~0 < ~n0~0 + ~n1~0); {27594#(and (<= 1 main_~j1~0) (<= main_~n0~0 3) (<= main_~n1~0 4))} is VALID [2018-11-23 13:12:45,147 INFO L256 TraceCheckUtils]: 26: Hoare triple {27594#(and (<= 1 main_~j1~0) (<= main_~n0~0 3) (<= main_~n1~0 4))} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {27491#true} is VALID [2018-11-23 13:12:45,147 INFO L273 TraceCheckUtils]: 27: Hoare triple {27491#true} ~cond := #in~cond; {27491#true} is VALID [2018-11-23 13:12:45,147 INFO L273 TraceCheckUtils]: 28: Hoare triple {27491#true} assume !(0 == ~cond); {27491#true} is VALID [2018-11-23 13:12:45,148 INFO L273 TraceCheckUtils]: 29: Hoare triple {27491#true} assume true; {27491#true} is VALID [2018-11-23 13:12:45,148 INFO L268 TraceCheckUtils]: 30: Hoare quadruple {27491#true} {27594#(and (<= 1 main_~j1~0) (<= main_~n0~0 3) (<= main_~n1~0 4))} #70#return; {27594#(and (<= 1 main_~j1~0) (<= main_~n0~0 3) (<= main_~n1~0 4))} is VALID [2018-11-23 13:12:45,149 INFO L273 TraceCheckUtils]: 31: Hoare triple {27594#(and (<= 1 main_~j1~0) (<= main_~n0~0 3) (<= main_~n1~0 4))} #t~post7 := ~j1~0;~j1~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~k~0;~k~0 := #t~post8 - 1;havoc #t~post8; {27616#(and (<= main_~n0~0 3) (<= main_~n1~0 4) (<= 2 main_~j1~0))} is VALID [2018-11-23 13:12:45,149 INFO L273 TraceCheckUtils]: 32: Hoare triple {27616#(and (<= main_~n0~0 3) (<= main_~n1~0 4) (<= 2 main_~j1~0))} assume !!(~j1~0 < ~n0~0 + ~n1~0); {27616#(and (<= main_~n0~0 3) (<= main_~n1~0 4) (<= 2 main_~j1~0))} is VALID [2018-11-23 13:12:45,150 INFO L256 TraceCheckUtils]: 33: Hoare triple {27616#(and (<= main_~n0~0 3) (<= main_~n1~0 4) (<= 2 main_~j1~0))} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {27491#true} is VALID [2018-11-23 13:12:45,150 INFO L273 TraceCheckUtils]: 34: Hoare triple {27491#true} ~cond := #in~cond; {27491#true} is VALID [2018-11-23 13:12:45,150 INFO L273 TraceCheckUtils]: 35: Hoare triple {27491#true} assume !(0 == ~cond); {27491#true} is VALID [2018-11-23 13:12:45,150 INFO L273 TraceCheckUtils]: 36: Hoare triple {27491#true} assume true; {27491#true} is VALID [2018-11-23 13:12:45,169 INFO L268 TraceCheckUtils]: 37: Hoare quadruple {27491#true} {27616#(and (<= main_~n0~0 3) (<= main_~n1~0 4) (<= 2 main_~j1~0))} #70#return; {27616#(and (<= main_~n0~0 3) (<= main_~n1~0 4) (<= 2 main_~j1~0))} is VALID [2018-11-23 13:12:45,178 INFO L273 TraceCheckUtils]: 38: Hoare triple {27616#(and (<= main_~n0~0 3) (<= main_~n1~0 4) (<= 2 main_~j1~0))} #t~post7 := ~j1~0;~j1~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~k~0;~k~0 := #t~post8 - 1;havoc #t~post8; {27638#(and (<= main_~n0~0 3) (<= main_~n1~0 4) (<= 3 main_~j1~0))} is VALID [2018-11-23 13:12:45,181 INFO L273 TraceCheckUtils]: 39: Hoare triple {27638#(and (<= main_~n0~0 3) (<= main_~n1~0 4) (<= 3 main_~j1~0))} assume !!(~j1~0 < ~n0~0 + ~n1~0); {27638#(and (<= main_~n0~0 3) (<= main_~n1~0 4) (<= 3 main_~j1~0))} is VALID [2018-11-23 13:12:45,181 INFO L256 TraceCheckUtils]: 40: Hoare triple {27638#(and (<= main_~n0~0 3) (<= main_~n1~0 4) (<= 3 main_~j1~0))} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {27491#true} is VALID [2018-11-23 13:12:45,181 INFO L273 TraceCheckUtils]: 41: Hoare triple {27491#true} ~cond := #in~cond; {27491#true} is VALID [2018-11-23 13:12:45,181 INFO L273 TraceCheckUtils]: 42: Hoare triple {27491#true} assume !(0 == ~cond); {27491#true} is VALID [2018-11-23 13:12:45,181 INFO L273 TraceCheckUtils]: 43: Hoare triple {27491#true} assume true; {27491#true} is VALID [2018-11-23 13:12:45,182 INFO L268 TraceCheckUtils]: 44: Hoare quadruple {27491#true} {27638#(and (<= main_~n0~0 3) (<= main_~n1~0 4) (<= 3 main_~j1~0))} #70#return; {27638#(and (<= main_~n0~0 3) (<= main_~n1~0 4) (<= 3 main_~j1~0))} is VALID [2018-11-23 13:12:45,183 INFO L273 TraceCheckUtils]: 45: Hoare triple {27638#(and (<= main_~n0~0 3) (<= main_~n1~0 4) (<= 3 main_~j1~0))} #t~post7 := ~j1~0;~j1~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~k~0;~k~0 := #t~post8 - 1;havoc #t~post8; {27660#(and (<= main_~n0~0 3) (<= main_~n1~0 4) (<= 4 main_~j1~0))} is VALID [2018-11-23 13:12:45,183 INFO L273 TraceCheckUtils]: 46: Hoare triple {27660#(and (<= main_~n0~0 3) (<= main_~n1~0 4) (<= 4 main_~j1~0))} assume !!(~j1~0 < ~n0~0 + ~n1~0); {27660#(and (<= main_~n0~0 3) (<= main_~n1~0 4) (<= 4 main_~j1~0))} is VALID [2018-11-23 13:12:45,183 INFO L256 TraceCheckUtils]: 47: Hoare triple {27660#(and (<= main_~n0~0 3) (<= main_~n1~0 4) (<= 4 main_~j1~0))} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {27491#true} is VALID [2018-11-23 13:12:45,183 INFO L273 TraceCheckUtils]: 48: Hoare triple {27491#true} ~cond := #in~cond; {27491#true} is VALID [2018-11-23 13:12:45,183 INFO L273 TraceCheckUtils]: 49: Hoare triple {27491#true} assume !(0 == ~cond); {27491#true} is VALID [2018-11-23 13:12:45,183 INFO L273 TraceCheckUtils]: 50: Hoare triple {27491#true} assume true; {27491#true} is VALID [2018-11-23 13:12:45,184 INFO L268 TraceCheckUtils]: 51: Hoare quadruple {27491#true} {27660#(and (<= main_~n0~0 3) (<= main_~n1~0 4) (<= 4 main_~j1~0))} #70#return; {27660#(and (<= main_~n0~0 3) (<= main_~n1~0 4) (<= 4 main_~j1~0))} is VALID [2018-11-23 13:12:45,185 INFO L273 TraceCheckUtils]: 52: Hoare triple {27660#(and (<= main_~n0~0 3) (<= main_~n1~0 4) (<= 4 main_~j1~0))} #t~post7 := ~j1~0;~j1~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~k~0;~k~0 := #t~post8 - 1;havoc #t~post8; {27682#(and (<= main_~n0~0 3) (<= main_~n1~0 4) (<= 5 main_~j1~0))} is VALID [2018-11-23 13:12:45,185 INFO L273 TraceCheckUtils]: 53: Hoare triple {27682#(and (<= main_~n0~0 3) (<= main_~n1~0 4) (<= 5 main_~j1~0))} assume !!(~j1~0 < ~n0~0 + ~n1~0); {27682#(and (<= main_~n0~0 3) (<= main_~n1~0 4) (<= 5 main_~j1~0))} is VALID [2018-11-23 13:12:45,185 INFO L256 TraceCheckUtils]: 54: Hoare triple {27682#(and (<= main_~n0~0 3) (<= main_~n1~0 4) (<= 5 main_~j1~0))} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {27491#true} is VALID [2018-11-23 13:12:45,185 INFO L273 TraceCheckUtils]: 55: Hoare triple {27491#true} ~cond := #in~cond; {27491#true} is VALID [2018-11-23 13:12:45,185 INFO L273 TraceCheckUtils]: 56: Hoare triple {27491#true} assume !(0 == ~cond); {27491#true} is VALID [2018-11-23 13:12:45,185 INFO L273 TraceCheckUtils]: 57: Hoare triple {27491#true} assume true; {27491#true} is VALID [2018-11-23 13:12:45,186 INFO L268 TraceCheckUtils]: 58: Hoare quadruple {27491#true} {27682#(and (<= main_~n0~0 3) (<= main_~n1~0 4) (<= 5 main_~j1~0))} #70#return; {27682#(and (<= main_~n0~0 3) (<= main_~n1~0 4) (<= 5 main_~j1~0))} is VALID [2018-11-23 13:12:45,186 INFO L273 TraceCheckUtils]: 59: Hoare triple {27682#(and (<= main_~n0~0 3) (<= main_~n1~0 4) (<= 5 main_~j1~0))} #t~post7 := ~j1~0;~j1~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~k~0;~k~0 := #t~post8 - 1;havoc #t~post8; {27704#(and (<= 6 main_~j1~0) (<= main_~n0~0 3) (<= main_~n1~0 4))} is VALID [2018-11-23 13:12:45,187 INFO L273 TraceCheckUtils]: 60: Hoare triple {27704#(and (<= 6 main_~j1~0) (<= main_~n0~0 3) (<= main_~n1~0 4))} assume !!(~j1~0 < ~n0~0 + ~n1~0); {27704#(and (<= 6 main_~j1~0) (<= main_~n0~0 3) (<= main_~n1~0 4))} is VALID [2018-11-23 13:12:45,187 INFO L256 TraceCheckUtils]: 61: Hoare triple {27704#(and (<= 6 main_~j1~0) (<= main_~n0~0 3) (<= main_~n1~0 4))} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {27491#true} is VALID [2018-11-23 13:12:45,187 INFO L273 TraceCheckUtils]: 62: Hoare triple {27491#true} ~cond := #in~cond; {27491#true} is VALID [2018-11-23 13:12:45,188 INFO L273 TraceCheckUtils]: 63: Hoare triple {27491#true} assume !(0 == ~cond); {27491#true} is VALID [2018-11-23 13:12:45,188 INFO L273 TraceCheckUtils]: 64: Hoare triple {27491#true} assume true; {27491#true} is VALID [2018-11-23 13:12:45,189 INFO L268 TraceCheckUtils]: 65: Hoare quadruple {27491#true} {27704#(and (<= 6 main_~j1~0) (<= main_~n0~0 3) (<= main_~n1~0 4))} #70#return; {27704#(and (<= 6 main_~j1~0) (<= main_~n0~0 3) (<= main_~n1~0 4))} is VALID [2018-11-23 13:12:45,190 INFO L273 TraceCheckUtils]: 66: Hoare triple {27704#(and (<= 6 main_~j1~0) (<= main_~n0~0 3) (<= main_~n1~0 4))} #t~post7 := ~j1~0;~j1~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~k~0;~k~0 := #t~post8 - 1;havoc #t~post8; {27726#(and (<= main_~n0~0 3) (<= main_~n1~0 4) (<= 7 main_~j1~0))} is VALID [2018-11-23 13:12:45,190 INFO L273 TraceCheckUtils]: 67: Hoare triple {27726#(and (<= main_~n0~0 3) (<= main_~n1~0 4) (<= 7 main_~j1~0))} assume !!(~j1~0 < ~n0~0 + ~n1~0); {27492#false} is VALID [2018-11-23 13:12:45,191 INFO L256 TraceCheckUtils]: 68: Hoare triple {27492#false} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {27492#false} is VALID [2018-11-23 13:12:45,191 INFO L273 TraceCheckUtils]: 69: Hoare triple {27492#false} ~cond := #in~cond; {27492#false} is VALID [2018-11-23 13:12:45,191 INFO L273 TraceCheckUtils]: 70: Hoare triple {27492#false} assume 0 == ~cond; {27492#false} is VALID [2018-11-23 13:12:45,191 INFO L273 TraceCheckUtils]: 71: Hoare triple {27492#false} assume !false; {27492#false} is VALID [2018-11-23 13:12:45,197 INFO L134 CoverageAnalysis]: Checked inductivity of 191 backedges. 91 proven. 16 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2018-11-23 13:12:45,216 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:12:45,216 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 35 [2018-11-23 13:12:45,216 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 72 [2018-11-23 13:12:45,217 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:12:45,217 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 35 states. [2018-11-23 13:12:45,309 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 90 edges. 90 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:12:45,309 INFO L459 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-11-23 13:12:45,309 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-11-23 13:12:45,310 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=959, Unknown=0, NotChecked=0, Total=1190 [2018-11-23 13:12:45,310 INFO L87 Difference]: Start difference. First operand 90 states and 99 transitions. Second operand 35 states. [2018-11-23 13:12:49,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:12:49,684 INFO L93 Difference]: Finished difference Result 243 states and 296 transitions. [2018-11-23 13:12:49,684 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-11-23 13:12:49,684 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 72 [2018-11-23 13:12:49,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:12:49,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-11-23 13:12:49,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 122 transitions. [2018-11-23 13:12:49,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-11-23 13:12:49,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 122 transitions. [2018-11-23 13:12:49,688 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 39 states and 122 transitions. [2018-11-23 13:12:49,818 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 122 edges. 122 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:12:49,822 INFO L225 Difference]: With dead ends: 243 [2018-11-23 13:12:49,822 INFO L226 Difference]: Without dead ends: 211 [2018-11-23 13:12:49,823 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1351 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=867, Invalid=3689, Unknown=0, NotChecked=0, Total=4556 [2018-11-23 13:12:49,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2018-11-23 13:12:50,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 90. [2018-11-23 13:12:50,281 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:12:50,281 INFO L82 GeneralOperation]: Start isEquivalent. First operand 211 states. Second operand 90 states. [2018-11-23 13:12:50,281 INFO L74 IsIncluded]: Start isIncluded. First operand 211 states. Second operand 90 states. [2018-11-23 13:12:50,281 INFO L87 Difference]: Start difference. First operand 211 states. Second operand 90 states. [2018-11-23 13:12:50,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:12:50,285 INFO L93 Difference]: Finished difference Result 211 states and 256 transitions. [2018-11-23 13:12:50,285 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 256 transitions. [2018-11-23 13:12:50,285 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:12:50,286 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:12:50,286 INFO L74 IsIncluded]: Start isIncluded. First operand 90 states. Second operand 211 states. [2018-11-23 13:12:50,286 INFO L87 Difference]: Start difference. First operand 90 states. Second operand 211 states. [2018-11-23 13:12:50,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:12:50,291 INFO L93 Difference]: Finished difference Result 211 states and 256 transitions. [2018-11-23 13:12:50,291 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 256 transitions. [2018-11-23 13:12:50,291 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:12:50,292 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:12:50,292 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:12:50,292 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:12:50,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2018-11-23 13:12:50,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 99 transitions. [2018-11-23 13:12:50,293 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 99 transitions. Word has length 72 [2018-11-23 13:12:50,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:12:50,294 INFO L480 AbstractCegarLoop]: Abstraction has 90 states and 99 transitions. [2018-11-23 13:12:50,294 INFO L481 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-11-23 13:12:50,294 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 99 transitions. [2018-11-23 13:12:50,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-11-23 13:12:50,294 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:12:50,295 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 8, 7, 7, 7, 7, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:12:50,295 INFO L423 AbstractCegarLoop]: === Iteration 40 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:12:50,295 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:12:50,295 INFO L82 PathProgramCache]: Analyzing trace with hash -1007825968, now seen corresponding path program 19 times [2018-11-23 13:12:50,295 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:12:50,295 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:12:50,296 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:12:50,296 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:12:50,296 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:12:50,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:12:50,641 INFO L256 TraceCheckUtils]: 0: Hoare triple {28759#true} call ULTIMATE.init(); {28759#true} is VALID [2018-11-23 13:12:50,641 INFO L273 TraceCheckUtils]: 1: Hoare triple {28759#true} assume true; {28759#true} is VALID [2018-11-23 13:12:50,641 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {28759#true} {28759#true} #66#return; {28759#true} is VALID [2018-11-23 13:12:50,641 INFO L256 TraceCheckUtils]: 3: Hoare triple {28759#true} call #t~ret9 := main(); {28759#true} is VALID [2018-11-23 13:12:50,642 INFO L273 TraceCheckUtils]: 4: Hoare triple {28759#true} havoc ~n0~0;havoc ~n1~0;~i0~0 := 0;~k~0 := 0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n0~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~n1~0 := #t~nondet2;havoc #t~nondet2; {28761#(<= main_~i0~0 0)} is VALID [2018-11-23 13:12:50,642 INFO L273 TraceCheckUtils]: 5: Hoare triple {28761#(<= main_~i0~0 0)} assume !!(-1000000 <= ~n0~0 && ~n0~0 < 1000000); {28761#(<= main_~i0~0 0)} is VALID [2018-11-23 13:12:50,643 INFO L273 TraceCheckUtils]: 6: Hoare triple {28761#(<= main_~i0~0 0)} assume !!(-1000000 <= ~n1~0 && ~n1~0 < 1000000); {28761#(<= main_~i0~0 0)} is VALID [2018-11-23 13:12:50,644 INFO L273 TraceCheckUtils]: 7: Hoare triple {28761#(<= main_~i0~0 0)} assume !!(~i0~0 < ~n0~0);#t~post3 := ~i0~0;~i0~0 := 1 + #t~post3;havoc #t~post3;#t~post4 := ~k~0;~k~0 := 1 + #t~post4;havoc #t~post4; {28762#(<= main_~i0~0 1)} is VALID [2018-11-23 13:12:50,644 INFO L273 TraceCheckUtils]: 8: Hoare triple {28762#(<= main_~i0~0 1)} assume !!(~i0~0 < ~n0~0);#t~post3 := ~i0~0;~i0~0 := 1 + #t~post3;havoc #t~post3;#t~post4 := ~k~0;~k~0 := 1 + #t~post4;havoc #t~post4; {28763#(<= main_~i0~0 2)} is VALID [2018-11-23 13:12:50,645 INFO L273 TraceCheckUtils]: 9: Hoare triple {28763#(<= main_~i0~0 2)} assume !!(~i0~0 < ~n0~0);#t~post3 := ~i0~0;~i0~0 := 1 + #t~post3;havoc #t~post3;#t~post4 := ~k~0;~k~0 := 1 + #t~post4;havoc #t~post4; {28764#(<= main_~i0~0 3)} is VALID [2018-11-23 13:12:50,646 INFO L273 TraceCheckUtils]: 10: Hoare triple {28764#(<= main_~i0~0 3)} assume !!(~i0~0 < ~n0~0);#t~post3 := ~i0~0;~i0~0 := 1 + #t~post3;havoc #t~post3;#t~post4 := ~k~0;~k~0 := 1 + #t~post4;havoc #t~post4; {28765#(<= main_~i0~0 4)} is VALID [2018-11-23 13:12:50,647 INFO L273 TraceCheckUtils]: 11: Hoare triple {28765#(<= main_~i0~0 4)} assume !(~i0~0 < ~n0~0); {28766#(<= main_~n0~0 4)} is VALID [2018-11-23 13:12:50,647 INFO L273 TraceCheckUtils]: 12: Hoare triple {28766#(<= main_~n0~0 4)} ~i1~0 := 0; {28767#(<= (+ main_~i1~0 main_~n0~0) 4)} is VALID [2018-11-23 13:12:50,648 INFO L273 TraceCheckUtils]: 13: Hoare triple {28767#(<= (+ main_~i1~0 main_~n0~0) 4)} assume !!(~i1~0 < ~n1~0);#t~post5 := ~i1~0;~i1~0 := 1 + #t~post5;havoc #t~post5;#t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {28768#(<= (+ main_~i1~0 main_~n0~0) 5)} is VALID [2018-11-23 13:12:50,649 INFO L273 TraceCheckUtils]: 14: Hoare triple {28768#(<= (+ main_~i1~0 main_~n0~0) 5)} assume !!(~i1~0 < ~n1~0);#t~post5 := ~i1~0;~i1~0 := 1 + #t~post5;havoc #t~post5;#t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {28769#(<= (+ main_~i1~0 main_~n0~0) 6)} is VALID [2018-11-23 13:12:50,650 INFO L273 TraceCheckUtils]: 15: Hoare triple {28769#(<= (+ main_~i1~0 main_~n0~0) 6)} assume !!(~i1~0 < ~n1~0);#t~post5 := ~i1~0;~i1~0 := 1 + #t~post5;havoc #t~post5;#t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {28770#(<= (+ main_~i1~0 main_~n0~0) 7)} is VALID [2018-11-23 13:12:50,651 INFO L273 TraceCheckUtils]: 16: Hoare triple {28770#(<= (+ main_~i1~0 main_~n0~0) 7)} assume !(~i1~0 < ~n1~0); {28771#(<= (+ main_~n0~0 main_~n1~0) 7)} is VALID [2018-11-23 13:12:50,651 INFO L273 TraceCheckUtils]: 17: Hoare triple {28771#(<= (+ main_~n0~0 main_~n1~0) 7)} ~j1~0 := 0; {28772#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 7))} is VALID [2018-11-23 13:12:50,652 INFO L273 TraceCheckUtils]: 18: Hoare triple {28772#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 7))} assume !!(~j1~0 < ~n0~0 + ~n1~0); {28772#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 7))} is VALID [2018-11-23 13:12:50,652 INFO L256 TraceCheckUtils]: 19: Hoare triple {28772#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 7))} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {28759#true} is VALID [2018-11-23 13:12:50,652 INFO L273 TraceCheckUtils]: 20: Hoare triple {28759#true} ~cond := #in~cond; {28759#true} is VALID [2018-11-23 13:12:50,652 INFO L273 TraceCheckUtils]: 21: Hoare triple {28759#true} assume !(0 == ~cond); {28759#true} is VALID [2018-11-23 13:12:50,653 INFO L273 TraceCheckUtils]: 22: Hoare triple {28759#true} assume true; {28759#true} is VALID [2018-11-23 13:12:50,654 INFO L268 TraceCheckUtils]: 23: Hoare quadruple {28759#true} {28772#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 7))} #70#return; {28772#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 7))} is VALID [2018-11-23 13:12:50,655 INFO L273 TraceCheckUtils]: 24: Hoare triple {28772#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 7))} #t~post7 := ~j1~0;~j1~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~k~0;~k~0 := #t~post8 - 1;havoc #t~post8; {28773#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 6))} is VALID [2018-11-23 13:12:50,655 INFO L273 TraceCheckUtils]: 25: Hoare triple {28773#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 6))} assume !!(~j1~0 < ~n0~0 + ~n1~0); {28773#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 6))} is VALID [2018-11-23 13:12:50,655 INFO L256 TraceCheckUtils]: 26: Hoare triple {28773#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 6))} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {28759#true} is VALID [2018-11-23 13:12:50,655 INFO L273 TraceCheckUtils]: 27: Hoare triple {28759#true} ~cond := #in~cond; {28759#true} is VALID [2018-11-23 13:12:50,656 INFO L273 TraceCheckUtils]: 28: Hoare triple {28759#true} assume !(0 == ~cond); {28759#true} is VALID [2018-11-23 13:12:50,656 INFO L273 TraceCheckUtils]: 29: Hoare triple {28759#true} assume true; {28759#true} is VALID [2018-11-23 13:12:50,657 INFO L268 TraceCheckUtils]: 30: Hoare quadruple {28759#true} {28773#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 6))} #70#return; {28773#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 6))} is VALID [2018-11-23 13:12:50,658 INFO L273 TraceCheckUtils]: 31: Hoare triple {28773#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 6))} #t~post7 := ~j1~0;~j1~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~k~0;~k~0 := #t~post8 - 1;havoc #t~post8; {28774#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 5))} is VALID [2018-11-23 13:12:50,658 INFO L273 TraceCheckUtils]: 32: Hoare triple {28774#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 5))} assume !!(~j1~0 < ~n0~0 + ~n1~0); {28774#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 5))} is VALID [2018-11-23 13:12:50,658 INFO L256 TraceCheckUtils]: 33: Hoare triple {28774#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 5))} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {28759#true} is VALID [2018-11-23 13:12:50,658 INFO L273 TraceCheckUtils]: 34: Hoare triple {28759#true} ~cond := #in~cond; {28759#true} is VALID [2018-11-23 13:12:50,659 INFO L273 TraceCheckUtils]: 35: Hoare triple {28759#true} assume !(0 == ~cond); {28759#true} is VALID [2018-11-23 13:12:50,659 INFO L273 TraceCheckUtils]: 36: Hoare triple {28759#true} assume true; {28759#true} is VALID [2018-11-23 13:12:50,660 INFO L268 TraceCheckUtils]: 37: Hoare quadruple {28759#true} {28774#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 5))} #70#return; {28774#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 5))} is VALID [2018-11-23 13:12:50,660 INFO L273 TraceCheckUtils]: 38: Hoare triple {28774#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 5))} #t~post7 := ~j1~0;~j1~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~k~0;~k~0 := #t~post8 - 1;havoc #t~post8; {28775#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 4))} is VALID [2018-11-23 13:12:50,661 INFO L273 TraceCheckUtils]: 39: Hoare triple {28775#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 4))} assume !!(~j1~0 < ~n0~0 + ~n1~0); {28775#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 4))} is VALID [2018-11-23 13:12:50,661 INFO L256 TraceCheckUtils]: 40: Hoare triple {28775#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 4))} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {28759#true} is VALID [2018-11-23 13:12:50,661 INFO L273 TraceCheckUtils]: 41: Hoare triple {28759#true} ~cond := #in~cond; {28759#true} is VALID [2018-11-23 13:12:50,662 INFO L273 TraceCheckUtils]: 42: Hoare triple {28759#true} assume !(0 == ~cond); {28759#true} is VALID [2018-11-23 13:12:50,662 INFO L273 TraceCheckUtils]: 43: Hoare triple {28759#true} assume true; {28759#true} is VALID [2018-11-23 13:12:50,663 INFO L268 TraceCheckUtils]: 44: Hoare quadruple {28759#true} {28775#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 4))} #70#return; {28775#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 4))} is VALID [2018-11-23 13:12:50,663 INFO L273 TraceCheckUtils]: 45: Hoare triple {28775#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 4))} #t~post7 := ~j1~0;~j1~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~k~0;~k~0 := #t~post8 - 1;havoc #t~post8; {28776#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 3))} is VALID [2018-11-23 13:12:50,664 INFO L273 TraceCheckUtils]: 46: Hoare triple {28776#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 3))} assume !!(~j1~0 < ~n0~0 + ~n1~0); {28776#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 3))} is VALID [2018-11-23 13:12:50,664 INFO L256 TraceCheckUtils]: 47: Hoare triple {28776#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 3))} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {28759#true} is VALID [2018-11-23 13:12:50,664 INFO L273 TraceCheckUtils]: 48: Hoare triple {28759#true} ~cond := #in~cond; {28759#true} is VALID [2018-11-23 13:12:50,664 INFO L273 TraceCheckUtils]: 49: Hoare triple {28759#true} assume !(0 == ~cond); {28759#true} is VALID [2018-11-23 13:12:50,665 INFO L273 TraceCheckUtils]: 50: Hoare triple {28759#true} assume true; {28759#true} is VALID [2018-11-23 13:12:50,665 INFO L268 TraceCheckUtils]: 51: Hoare quadruple {28759#true} {28776#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 3))} #70#return; {28776#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 3))} is VALID [2018-11-23 13:12:50,666 INFO L273 TraceCheckUtils]: 52: Hoare triple {28776#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 3))} #t~post7 := ~j1~0;~j1~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~k~0;~k~0 := #t~post8 - 1;havoc #t~post8; {28777#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 2))} is VALID [2018-11-23 13:12:50,667 INFO L273 TraceCheckUtils]: 53: Hoare triple {28777#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 2))} assume !!(~j1~0 < ~n0~0 + ~n1~0); {28777#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 2))} is VALID [2018-11-23 13:12:50,667 INFO L256 TraceCheckUtils]: 54: Hoare triple {28777#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 2))} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {28759#true} is VALID [2018-11-23 13:12:50,667 INFO L273 TraceCheckUtils]: 55: Hoare triple {28759#true} ~cond := #in~cond; {28759#true} is VALID [2018-11-23 13:12:50,667 INFO L273 TraceCheckUtils]: 56: Hoare triple {28759#true} assume !(0 == ~cond); {28759#true} is VALID [2018-11-23 13:12:50,667 INFO L273 TraceCheckUtils]: 57: Hoare triple {28759#true} assume true; {28759#true} is VALID [2018-11-23 13:12:50,668 INFO L268 TraceCheckUtils]: 58: Hoare quadruple {28759#true} {28777#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 2))} #70#return; {28777#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 2))} is VALID [2018-11-23 13:12:50,669 INFO L273 TraceCheckUtils]: 59: Hoare triple {28777#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 2))} #t~post7 := ~j1~0;~j1~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~k~0;~k~0 := #t~post8 - 1;havoc #t~post8; {28778#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 1))} is VALID [2018-11-23 13:12:50,670 INFO L273 TraceCheckUtils]: 60: Hoare triple {28778#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 1))} assume !!(~j1~0 < ~n0~0 + ~n1~0); {28778#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 1))} is VALID [2018-11-23 13:12:50,670 INFO L256 TraceCheckUtils]: 61: Hoare triple {28778#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 1))} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {28759#true} is VALID [2018-11-23 13:12:50,670 INFO L273 TraceCheckUtils]: 62: Hoare triple {28759#true} ~cond := #in~cond; {28759#true} is VALID [2018-11-23 13:12:50,670 INFO L273 TraceCheckUtils]: 63: Hoare triple {28759#true} assume !(0 == ~cond); {28759#true} is VALID [2018-11-23 13:12:50,670 INFO L273 TraceCheckUtils]: 64: Hoare triple {28759#true} assume true; {28759#true} is VALID [2018-11-23 13:12:50,671 INFO L268 TraceCheckUtils]: 65: Hoare quadruple {28759#true} {28778#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 1))} #70#return; {28778#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 1))} is VALID [2018-11-23 13:12:50,672 INFO L273 TraceCheckUtils]: 66: Hoare triple {28778#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 1))} #t~post7 := ~j1~0;~j1~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~k~0;~k~0 := #t~post8 - 1;havoc #t~post8; {28779#(<= (+ main_~n0~0 main_~n1~0) main_~j1~0)} is VALID [2018-11-23 13:12:50,673 INFO L273 TraceCheckUtils]: 67: Hoare triple {28779#(<= (+ main_~n0~0 main_~n1~0) main_~j1~0)} assume !!(~j1~0 < ~n0~0 + ~n1~0); {28760#false} is VALID [2018-11-23 13:12:50,673 INFO L256 TraceCheckUtils]: 68: Hoare triple {28760#false} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {28760#false} is VALID [2018-11-23 13:12:50,673 INFO L273 TraceCheckUtils]: 69: Hoare triple {28760#false} ~cond := #in~cond; {28760#false} is VALID [2018-11-23 13:12:50,673 INFO L273 TraceCheckUtils]: 70: Hoare triple {28760#false} assume 0 == ~cond; {28760#false} is VALID [2018-11-23 13:12:50,673 INFO L273 TraceCheckUtils]: 71: Hoare triple {28760#false} assume !false; {28760#false} is VALID [2018-11-23 13:12:50,679 INFO L134 CoverageAnalysis]: Checked inductivity of 191 backedges. 91 proven. 16 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2018-11-23 13:12:50,679 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:12:50,679 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:12:50,687 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:12:50,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:12:50,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:12:50,737 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:12:51,285 INFO L256 TraceCheckUtils]: 0: Hoare triple {28759#true} call ULTIMATE.init(); {28759#true} is VALID [2018-11-23 13:12:51,286 INFO L273 TraceCheckUtils]: 1: Hoare triple {28759#true} assume true; {28759#true} is VALID [2018-11-23 13:12:51,286 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {28759#true} {28759#true} #66#return; {28759#true} is VALID [2018-11-23 13:12:51,286 INFO L256 TraceCheckUtils]: 3: Hoare triple {28759#true} call #t~ret9 := main(); {28759#true} is VALID [2018-11-23 13:12:51,287 INFO L273 TraceCheckUtils]: 4: Hoare triple {28759#true} havoc ~n0~0;havoc ~n1~0;~i0~0 := 0;~k~0 := 0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n0~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~n1~0 := #t~nondet2;havoc #t~nondet2; {28761#(<= main_~i0~0 0)} is VALID [2018-11-23 13:12:51,287 INFO L273 TraceCheckUtils]: 5: Hoare triple {28761#(<= main_~i0~0 0)} assume !!(-1000000 <= ~n0~0 && ~n0~0 < 1000000); {28761#(<= main_~i0~0 0)} is VALID [2018-11-23 13:12:51,288 INFO L273 TraceCheckUtils]: 6: Hoare triple {28761#(<= main_~i0~0 0)} assume !!(-1000000 <= ~n1~0 && ~n1~0 < 1000000); {28761#(<= main_~i0~0 0)} is VALID [2018-11-23 13:12:51,288 INFO L273 TraceCheckUtils]: 7: Hoare triple {28761#(<= main_~i0~0 0)} assume !!(~i0~0 < ~n0~0);#t~post3 := ~i0~0;~i0~0 := 1 + #t~post3;havoc #t~post3;#t~post4 := ~k~0;~k~0 := 1 + #t~post4;havoc #t~post4; {28762#(<= main_~i0~0 1)} is VALID [2018-11-23 13:12:51,289 INFO L273 TraceCheckUtils]: 8: Hoare triple {28762#(<= main_~i0~0 1)} assume !!(~i0~0 < ~n0~0);#t~post3 := ~i0~0;~i0~0 := 1 + #t~post3;havoc #t~post3;#t~post4 := ~k~0;~k~0 := 1 + #t~post4;havoc #t~post4; {28763#(<= main_~i0~0 2)} is VALID [2018-11-23 13:12:51,289 INFO L273 TraceCheckUtils]: 9: Hoare triple {28763#(<= main_~i0~0 2)} assume !!(~i0~0 < ~n0~0);#t~post3 := ~i0~0;~i0~0 := 1 + #t~post3;havoc #t~post3;#t~post4 := ~k~0;~k~0 := 1 + #t~post4;havoc #t~post4; {28764#(<= main_~i0~0 3)} is VALID [2018-11-23 13:12:51,290 INFO L273 TraceCheckUtils]: 10: Hoare triple {28764#(<= main_~i0~0 3)} assume !!(~i0~0 < ~n0~0);#t~post3 := ~i0~0;~i0~0 := 1 + #t~post3;havoc #t~post3;#t~post4 := ~k~0;~k~0 := 1 + #t~post4;havoc #t~post4; {28765#(<= main_~i0~0 4)} is VALID [2018-11-23 13:12:51,290 INFO L273 TraceCheckUtils]: 11: Hoare triple {28765#(<= main_~i0~0 4)} assume !(~i0~0 < ~n0~0); {28766#(<= main_~n0~0 4)} is VALID [2018-11-23 13:12:51,291 INFO L273 TraceCheckUtils]: 12: Hoare triple {28766#(<= main_~n0~0 4)} ~i1~0 := 0; {28819#(and (<= main_~n0~0 4) (<= main_~i1~0 0))} is VALID [2018-11-23 13:12:51,292 INFO L273 TraceCheckUtils]: 13: Hoare triple {28819#(and (<= main_~n0~0 4) (<= main_~i1~0 0))} assume !!(~i1~0 < ~n1~0);#t~post5 := ~i1~0;~i1~0 := 1 + #t~post5;havoc #t~post5;#t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {28823#(and (<= main_~n0~0 4) (<= main_~i1~0 1))} is VALID [2018-11-23 13:12:51,293 INFO L273 TraceCheckUtils]: 14: Hoare triple {28823#(and (<= main_~n0~0 4) (<= main_~i1~0 1))} assume !!(~i1~0 < ~n1~0);#t~post5 := ~i1~0;~i1~0 := 1 + #t~post5;havoc #t~post5;#t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {28827#(and (<= main_~n0~0 4) (<= main_~i1~0 2))} is VALID [2018-11-23 13:12:51,293 INFO L273 TraceCheckUtils]: 15: Hoare triple {28827#(and (<= main_~n0~0 4) (<= main_~i1~0 2))} assume !!(~i1~0 < ~n1~0);#t~post5 := ~i1~0;~i1~0 := 1 + #t~post5;havoc #t~post5;#t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {28831#(and (<= main_~n0~0 4) (<= main_~i1~0 3))} is VALID [2018-11-23 13:12:51,294 INFO L273 TraceCheckUtils]: 16: Hoare triple {28831#(and (<= main_~n0~0 4) (<= main_~i1~0 3))} assume !(~i1~0 < ~n1~0); {28835#(and (<= main_~n0~0 4) (<= main_~n1~0 3))} is VALID [2018-11-23 13:12:51,295 INFO L273 TraceCheckUtils]: 17: Hoare triple {28835#(and (<= main_~n0~0 4) (<= main_~n1~0 3))} ~j1~0 := 0; {28839#(and (<= main_~n0~0 4) (<= main_~n1~0 3) (<= 0 main_~j1~0))} is VALID [2018-11-23 13:12:51,296 INFO L273 TraceCheckUtils]: 18: Hoare triple {28839#(and (<= main_~n0~0 4) (<= main_~n1~0 3) (<= 0 main_~j1~0))} assume !!(~j1~0 < ~n0~0 + ~n1~0); {28839#(and (<= main_~n0~0 4) (<= main_~n1~0 3) (<= 0 main_~j1~0))} is VALID [2018-11-23 13:12:51,296 INFO L256 TraceCheckUtils]: 19: Hoare triple {28839#(and (<= main_~n0~0 4) (<= main_~n1~0 3) (<= 0 main_~j1~0))} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {28759#true} is VALID [2018-11-23 13:12:51,296 INFO L273 TraceCheckUtils]: 20: Hoare triple {28759#true} ~cond := #in~cond; {28759#true} is VALID [2018-11-23 13:12:51,296 INFO L273 TraceCheckUtils]: 21: Hoare triple {28759#true} assume !(0 == ~cond); {28759#true} is VALID [2018-11-23 13:12:51,296 INFO L273 TraceCheckUtils]: 22: Hoare triple {28759#true} assume true; {28759#true} is VALID [2018-11-23 13:12:51,297 INFO L268 TraceCheckUtils]: 23: Hoare quadruple {28759#true} {28839#(and (<= main_~n0~0 4) (<= main_~n1~0 3) (<= 0 main_~j1~0))} #70#return; {28839#(and (<= main_~n0~0 4) (<= main_~n1~0 3) (<= 0 main_~j1~0))} is VALID [2018-11-23 13:12:51,298 INFO L273 TraceCheckUtils]: 24: Hoare triple {28839#(and (<= main_~n0~0 4) (<= main_~n1~0 3) (<= 0 main_~j1~0))} #t~post7 := ~j1~0;~j1~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~k~0;~k~0 := #t~post8 - 1;havoc #t~post8; {28861#(and (<= main_~n0~0 4) (<= 1 main_~j1~0) (<= main_~n1~0 3))} is VALID [2018-11-23 13:12:51,298 INFO L273 TraceCheckUtils]: 25: Hoare triple {28861#(and (<= main_~n0~0 4) (<= 1 main_~j1~0) (<= main_~n1~0 3))} assume !!(~j1~0 < ~n0~0 + ~n1~0); {28861#(and (<= main_~n0~0 4) (<= 1 main_~j1~0) (<= main_~n1~0 3))} is VALID [2018-11-23 13:12:51,299 INFO L256 TraceCheckUtils]: 26: Hoare triple {28861#(and (<= main_~n0~0 4) (<= 1 main_~j1~0) (<= main_~n1~0 3))} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {28759#true} is VALID [2018-11-23 13:12:51,299 INFO L273 TraceCheckUtils]: 27: Hoare triple {28759#true} ~cond := #in~cond; {28759#true} is VALID [2018-11-23 13:12:51,299 INFO L273 TraceCheckUtils]: 28: Hoare triple {28759#true} assume !(0 == ~cond); {28759#true} is VALID [2018-11-23 13:12:51,299 INFO L273 TraceCheckUtils]: 29: Hoare triple {28759#true} assume true; {28759#true} is VALID [2018-11-23 13:12:51,299 INFO L268 TraceCheckUtils]: 30: Hoare quadruple {28759#true} {28861#(and (<= main_~n0~0 4) (<= 1 main_~j1~0) (<= main_~n1~0 3))} #70#return; {28861#(and (<= main_~n0~0 4) (<= 1 main_~j1~0) (<= main_~n1~0 3))} is VALID [2018-11-23 13:12:51,300 INFO L273 TraceCheckUtils]: 31: Hoare triple {28861#(and (<= main_~n0~0 4) (<= 1 main_~j1~0) (<= main_~n1~0 3))} #t~post7 := ~j1~0;~j1~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~k~0;~k~0 := #t~post8 - 1;havoc #t~post8; {28883#(and (<= main_~n0~0 4) (<= main_~n1~0 3) (<= 2 main_~j1~0))} is VALID [2018-11-23 13:12:51,300 INFO L273 TraceCheckUtils]: 32: Hoare triple {28883#(and (<= main_~n0~0 4) (<= main_~n1~0 3) (<= 2 main_~j1~0))} assume !!(~j1~0 < ~n0~0 + ~n1~0); {28883#(and (<= main_~n0~0 4) (<= main_~n1~0 3) (<= 2 main_~j1~0))} is VALID [2018-11-23 13:12:51,301 INFO L256 TraceCheckUtils]: 33: Hoare triple {28883#(and (<= main_~n0~0 4) (<= main_~n1~0 3) (<= 2 main_~j1~0))} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {28759#true} is VALID [2018-11-23 13:12:51,301 INFO L273 TraceCheckUtils]: 34: Hoare triple {28759#true} ~cond := #in~cond; {28759#true} is VALID [2018-11-23 13:12:51,301 INFO L273 TraceCheckUtils]: 35: Hoare triple {28759#true} assume !(0 == ~cond); {28759#true} is VALID [2018-11-23 13:12:51,301 INFO L273 TraceCheckUtils]: 36: Hoare triple {28759#true} assume true; {28759#true} is VALID [2018-11-23 13:12:51,302 INFO L268 TraceCheckUtils]: 37: Hoare quadruple {28759#true} {28883#(and (<= main_~n0~0 4) (<= main_~n1~0 3) (<= 2 main_~j1~0))} #70#return; {28883#(and (<= main_~n0~0 4) (<= main_~n1~0 3) (<= 2 main_~j1~0))} is VALID [2018-11-23 13:12:51,303 INFO L273 TraceCheckUtils]: 38: Hoare triple {28883#(and (<= main_~n0~0 4) (<= main_~n1~0 3) (<= 2 main_~j1~0))} #t~post7 := ~j1~0;~j1~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~k~0;~k~0 := #t~post8 - 1;havoc #t~post8; {28905#(and (<= main_~n0~0 4) (<= main_~n1~0 3) (<= 3 main_~j1~0))} is VALID [2018-11-23 13:12:51,304 INFO L273 TraceCheckUtils]: 39: Hoare triple {28905#(and (<= main_~n0~0 4) (<= main_~n1~0 3) (<= 3 main_~j1~0))} assume !!(~j1~0 < ~n0~0 + ~n1~0); {28905#(and (<= main_~n0~0 4) (<= main_~n1~0 3) (<= 3 main_~j1~0))} is VALID [2018-11-23 13:12:51,304 INFO L256 TraceCheckUtils]: 40: Hoare triple {28905#(and (<= main_~n0~0 4) (<= main_~n1~0 3) (<= 3 main_~j1~0))} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {28759#true} is VALID [2018-11-23 13:12:51,304 INFO L273 TraceCheckUtils]: 41: Hoare triple {28759#true} ~cond := #in~cond; {28759#true} is VALID [2018-11-23 13:12:51,304 INFO L273 TraceCheckUtils]: 42: Hoare triple {28759#true} assume !(0 == ~cond); {28759#true} is VALID [2018-11-23 13:12:51,305 INFO L273 TraceCheckUtils]: 43: Hoare triple {28759#true} assume true; {28759#true} is VALID [2018-11-23 13:12:51,305 INFO L268 TraceCheckUtils]: 44: Hoare quadruple {28759#true} {28905#(and (<= main_~n0~0 4) (<= main_~n1~0 3) (<= 3 main_~j1~0))} #70#return; {28905#(and (<= main_~n0~0 4) (<= main_~n1~0 3) (<= 3 main_~j1~0))} is VALID [2018-11-23 13:12:51,306 INFO L273 TraceCheckUtils]: 45: Hoare triple {28905#(and (<= main_~n0~0 4) (<= main_~n1~0 3) (<= 3 main_~j1~0))} #t~post7 := ~j1~0;~j1~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~k~0;~k~0 := #t~post8 - 1;havoc #t~post8; {28927#(and (<= main_~n0~0 4) (<= main_~n1~0 3) (<= 4 main_~j1~0))} is VALID [2018-11-23 13:12:51,307 INFO L273 TraceCheckUtils]: 46: Hoare triple {28927#(and (<= main_~n0~0 4) (<= main_~n1~0 3) (<= 4 main_~j1~0))} assume !!(~j1~0 < ~n0~0 + ~n1~0); {28927#(and (<= main_~n0~0 4) (<= main_~n1~0 3) (<= 4 main_~j1~0))} is VALID [2018-11-23 13:12:51,307 INFO L256 TraceCheckUtils]: 47: Hoare triple {28927#(and (<= main_~n0~0 4) (<= main_~n1~0 3) (<= 4 main_~j1~0))} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {28759#true} is VALID [2018-11-23 13:12:51,308 INFO L273 TraceCheckUtils]: 48: Hoare triple {28759#true} ~cond := #in~cond; {28759#true} is VALID [2018-11-23 13:12:51,308 INFO L273 TraceCheckUtils]: 49: Hoare triple {28759#true} assume !(0 == ~cond); {28759#true} is VALID [2018-11-23 13:12:51,308 INFO L273 TraceCheckUtils]: 50: Hoare triple {28759#true} assume true; {28759#true} is VALID [2018-11-23 13:12:51,309 INFO L268 TraceCheckUtils]: 51: Hoare quadruple {28759#true} {28927#(and (<= main_~n0~0 4) (<= main_~n1~0 3) (<= 4 main_~j1~0))} #70#return; {28927#(and (<= main_~n0~0 4) (<= main_~n1~0 3) (<= 4 main_~j1~0))} is VALID [2018-11-23 13:12:51,309 INFO L273 TraceCheckUtils]: 52: Hoare triple {28927#(and (<= main_~n0~0 4) (<= main_~n1~0 3) (<= 4 main_~j1~0))} #t~post7 := ~j1~0;~j1~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~k~0;~k~0 := #t~post8 - 1;havoc #t~post8; {28949#(and (<= main_~n0~0 4) (<= main_~n1~0 3) (<= 5 main_~j1~0))} is VALID [2018-11-23 13:12:51,310 INFO L273 TraceCheckUtils]: 53: Hoare triple {28949#(and (<= main_~n0~0 4) (<= main_~n1~0 3) (<= 5 main_~j1~0))} assume !!(~j1~0 < ~n0~0 + ~n1~0); {28949#(and (<= main_~n0~0 4) (<= main_~n1~0 3) (<= 5 main_~j1~0))} is VALID [2018-11-23 13:12:51,310 INFO L256 TraceCheckUtils]: 54: Hoare triple {28949#(and (<= main_~n0~0 4) (<= main_~n1~0 3) (<= 5 main_~j1~0))} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {28759#true} is VALID [2018-11-23 13:12:51,310 INFO L273 TraceCheckUtils]: 55: Hoare triple {28759#true} ~cond := #in~cond; {28759#true} is VALID [2018-11-23 13:12:51,310 INFO L273 TraceCheckUtils]: 56: Hoare triple {28759#true} assume !(0 == ~cond); {28759#true} is VALID [2018-11-23 13:12:51,310 INFO L273 TraceCheckUtils]: 57: Hoare triple {28759#true} assume true; {28759#true} is VALID [2018-11-23 13:12:51,311 INFO L268 TraceCheckUtils]: 58: Hoare quadruple {28759#true} {28949#(and (<= main_~n0~0 4) (<= main_~n1~0 3) (<= 5 main_~j1~0))} #70#return; {28949#(and (<= main_~n0~0 4) (<= main_~n1~0 3) (<= 5 main_~j1~0))} is VALID [2018-11-23 13:12:51,311 INFO L273 TraceCheckUtils]: 59: Hoare triple {28949#(and (<= main_~n0~0 4) (<= main_~n1~0 3) (<= 5 main_~j1~0))} #t~post7 := ~j1~0;~j1~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~k~0;~k~0 := #t~post8 - 1;havoc #t~post8; {28971#(and (<= main_~n0~0 4) (<= 6 main_~j1~0) (<= main_~n1~0 3))} is VALID [2018-11-23 13:12:51,312 INFO L273 TraceCheckUtils]: 60: Hoare triple {28971#(and (<= main_~n0~0 4) (<= 6 main_~j1~0) (<= main_~n1~0 3))} assume !!(~j1~0 < ~n0~0 + ~n1~0); {28971#(and (<= main_~n0~0 4) (<= 6 main_~j1~0) (<= main_~n1~0 3))} is VALID [2018-11-23 13:12:51,312 INFO L256 TraceCheckUtils]: 61: Hoare triple {28971#(and (<= main_~n0~0 4) (<= 6 main_~j1~0) (<= main_~n1~0 3))} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {28759#true} is VALID [2018-11-23 13:12:51,312 INFO L273 TraceCheckUtils]: 62: Hoare triple {28759#true} ~cond := #in~cond; {28759#true} is VALID [2018-11-23 13:12:51,312 INFO L273 TraceCheckUtils]: 63: Hoare triple {28759#true} assume !(0 == ~cond); {28759#true} is VALID [2018-11-23 13:12:51,312 INFO L273 TraceCheckUtils]: 64: Hoare triple {28759#true} assume true; {28759#true} is VALID [2018-11-23 13:12:51,318 INFO L268 TraceCheckUtils]: 65: Hoare quadruple {28759#true} {28971#(and (<= main_~n0~0 4) (<= 6 main_~j1~0) (<= main_~n1~0 3))} #70#return; {28971#(and (<= main_~n0~0 4) (<= 6 main_~j1~0) (<= main_~n1~0 3))} is VALID [2018-11-23 13:12:51,318 INFO L273 TraceCheckUtils]: 66: Hoare triple {28971#(and (<= main_~n0~0 4) (<= 6 main_~j1~0) (<= main_~n1~0 3))} #t~post7 := ~j1~0;~j1~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~k~0;~k~0 := #t~post8 - 1;havoc #t~post8; {28993#(and (<= main_~n0~0 4) (<= main_~n1~0 3) (<= 7 main_~j1~0))} is VALID [2018-11-23 13:12:51,319 INFO L273 TraceCheckUtils]: 67: Hoare triple {28993#(and (<= main_~n0~0 4) (<= main_~n1~0 3) (<= 7 main_~j1~0))} assume !!(~j1~0 < ~n0~0 + ~n1~0); {28760#false} is VALID [2018-11-23 13:12:51,319 INFO L256 TraceCheckUtils]: 68: Hoare triple {28760#false} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {28760#false} is VALID [2018-11-23 13:12:51,319 INFO L273 TraceCheckUtils]: 69: Hoare triple {28760#false} ~cond := #in~cond; {28760#false} is VALID [2018-11-23 13:12:51,319 INFO L273 TraceCheckUtils]: 70: Hoare triple {28760#false} assume 0 == ~cond; {28760#false} is VALID [2018-11-23 13:12:51,319 INFO L273 TraceCheckUtils]: 71: Hoare triple {28760#false} assume !false; {28760#false} is VALID [2018-11-23 13:12:51,324 INFO L134 CoverageAnalysis]: Checked inductivity of 191 backedges. 91 proven. 16 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2018-11-23 13:12:51,343 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:12:51,343 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 34 [2018-11-23 13:12:51,344 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 72 [2018-11-23 13:12:51,344 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:12:51,344 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 34 states. [2018-11-23 13:12:51,431 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 89 edges. 89 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:12:51,432 INFO L459 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-11-23 13:12:51,432 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-11-23 13:12:51,432 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=219, Invalid=903, Unknown=0, NotChecked=0, Total=1122 [2018-11-23 13:12:51,433 INFO L87 Difference]: Start difference. First operand 90 states and 99 transitions. Second operand 34 states. [2018-11-23 13:12:56,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:12:56,174 INFO L93 Difference]: Finished difference Result 271 states and 333 transitions. [2018-11-23 13:12:56,174 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-11-23 13:12:56,174 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 72 [2018-11-23 13:12:56,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:12:56,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-11-23 13:12:56,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 132 transitions. [2018-11-23 13:12:56,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-11-23 13:12:56,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 132 transitions. [2018-11-23 13:12:56,178 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 41 states and 132 transitions. [2018-11-23 13:12:56,308 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 132 edges. 132 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:12:56,315 INFO L225 Difference]: With dead ends: 271 [2018-11-23 13:12:56,316 INFO L226 Difference]: Without dead ends: 239 [2018-11-23 13:12:56,317 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1353 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=867, Invalid=3689, Unknown=0, NotChecked=0, Total=4556 [2018-11-23 13:12:56,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2018-11-23 13:12:56,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 90. [2018-11-23 13:12:56,909 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:12:56,909 INFO L82 GeneralOperation]: Start isEquivalent. First operand 239 states. Second operand 90 states. [2018-11-23 13:12:56,909 INFO L74 IsIncluded]: Start isIncluded. First operand 239 states. Second operand 90 states. [2018-11-23 13:12:56,909 INFO L87 Difference]: Start difference. First operand 239 states. Second operand 90 states. [2018-11-23 13:12:56,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:12:56,915 INFO L93 Difference]: Finished difference Result 239 states and 293 transitions. [2018-11-23 13:12:56,915 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 293 transitions. [2018-11-23 13:12:56,915 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:12:56,915 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:12:56,915 INFO L74 IsIncluded]: Start isIncluded. First operand 90 states. Second operand 239 states. [2018-11-23 13:12:56,915 INFO L87 Difference]: Start difference. First operand 90 states. Second operand 239 states. [2018-11-23 13:12:56,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:12:56,920 INFO L93 Difference]: Finished difference Result 239 states and 293 transitions. [2018-11-23 13:12:56,920 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 293 transitions. [2018-11-23 13:12:56,920 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:12:56,920 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:12:56,920 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:12:56,920 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:12:56,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2018-11-23 13:12:56,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 99 transitions. [2018-11-23 13:12:56,921 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 99 transitions. Word has length 72 [2018-11-23 13:12:56,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:12:56,922 INFO L480 AbstractCegarLoop]: Abstraction has 90 states and 99 transitions. [2018-11-23 13:12:56,922 INFO L481 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-11-23 13:12:56,922 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 99 transitions. [2018-11-23 13:12:56,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-11-23 13:12:56,922 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:12:56,922 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 8, 7, 7, 7, 7, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:12:56,922 INFO L423 AbstractCegarLoop]: === Iteration 41 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:12:56,922 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:12:56,923 INFO L82 PathProgramCache]: Analyzing trace with hash 2120095183, now seen corresponding path program 20 times [2018-11-23 13:12:56,923 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:12:56,923 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:12:56,923 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:12:56,923 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:12:56,923 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:12:56,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:12:57,484 INFO L256 TraceCheckUtils]: 0: Hoare triple {30132#true} call ULTIMATE.init(); {30132#true} is VALID [2018-11-23 13:12:57,484 INFO L273 TraceCheckUtils]: 1: Hoare triple {30132#true} assume true; {30132#true} is VALID [2018-11-23 13:12:57,484 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {30132#true} {30132#true} #66#return; {30132#true} is VALID [2018-11-23 13:12:57,484 INFO L256 TraceCheckUtils]: 3: Hoare triple {30132#true} call #t~ret9 := main(); {30132#true} is VALID [2018-11-23 13:12:57,485 INFO L273 TraceCheckUtils]: 4: Hoare triple {30132#true} havoc ~n0~0;havoc ~n1~0;~i0~0 := 0;~k~0 := 0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n0~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~n1~0 := #t~nondet2;havoc #t~nondet2; {30134#(<= main_~i0~0 0)} is VALID [2018-11-23 13:12:57,485 INFO L273 TraceCheckUtils]: 5: Hoare triple {30134#(<= main_~i0~0 0)} assume !!(-1000000 <= ~n0~0 && ~n0~0 < 1000000); {30134#(<= main_~i0~0 0)} is VALID [2018-11-23 13:12:57,486 INFO L273 TraceCheckUtils]: 6: Hoare triple {30134#(<= main_~i0~0 0)} assume !!(-1000000 <= ~n1~0 && ~n1~0 < 1000000); {30134#(<= main_~i0~0 0)} is VALID [2018-11-23 13:12:57,487 INFO L273 TraceCheckUtils]: 7: Hoare triple {30134#(<= main_~i0~0 0)} assume !!(~i0~0 < ~n0~0);#t~post3 := ~i0~0;~i0~0 := 1 + #t~post3;havoc #t~post3;#t~post4 := ~k~0;~k~0 := 1 + #t~post4;havoc #t~post4; {30135#(<= main_~i0~0 1)} is VALID [2018-11-23 13:12:57,488 INFO L273 TraceCheckUtils]: 8: Hoare triple {30135#(<= main_~i0~0 1)} assume !!(~i0~0 < ~n0~0);#t~post3 := ~i0~0;~i0~0 := 1 + #t~post3;havoc #t~post3;#t~post4 := ~k~0;~k~0 := 1 + #t~post4;havoc #t~post4; {30136#(<= main_~i0~0 2)} is VALID [2018-11-23 13:12:57,489 INFO L273 TraceCheckUtils]: 9: Hoare triple {30136#(<= main_~i0~0 2)} assume !!(~i0~0 < ~n0~0);#t~post3 := ~i0~0;~i0~0 := 1 + #t~post3;havoc #t~post3;#t~post4 := ~k~0;~k~0 := 1 + #t~post4;havoc #t~post4; {30137#(<= main_~i0~0 3)} is VALID [2018-11-23 13:12:57,489 INFO L273 TraceCheckUtils]: 10: Hoare triple {30137#(<= main_~i0~0 3)} assume !!(~i0~0 < ~n0~0);#t~post3 := ~i0~0;~i0~0 := 1 + #t~post3;havoc #t~post3;#t~post4 := ~k~0;~k~0 := 1 + #t~post4;havoc #t~post4; {30138#(<= main_~i0~0 4)} is VALID [2018-11-23 13:12:57,490 INFO L273 TraceCheckUtils]: 11: Hoare triple {30138#(<= main_~i0~0 4)} assume !!(~i0~0 < ~n0~0);#t~post3 := ~i0~0;~i0~0 := 1 + #t~post3;havoc #t~post3;#t~post4 := ~k~0;~k~0 := 1 + #t~post4;havoc #t~post4; {30139#(<= main_~i0~0 5)} is VALID [2018-11-23 13:12:57,491 INFO L273 TraceCheckUtils]: 12: Hoare triple {30139#(<= main_~i0~0 5)} assume !(~i0~0 < ~n0~0); {30140#(<= main_~n0~0 5)} is VALID [2018-11-23 13:12:57,492 INFO L273 TraceCheckUtils]: 13: Hoare triple {30140#(<= main_~n0~0 5)} ~i1~0 := 0; {30141#(<= (+ main_~i1~0 main_~n0~0) 5)} is VALID [2018-11-23 13:12:57,493 INFO L273 TraceCheckUtils]: 14: Hoare triple {30141#(<= (+ main_~i1~0 main_~n0~0) 5)} assume !!(~i1~0 < ~n1~0);#t~post5 := ~i1~0;~i1~0 := 1 + #t~post5;havoc #t~post5;#t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {30142#(<= (+ main_~i1~0 main_~n0~0) 6)} is VALID [2018-11-23 13:12:57,493 INFO L273 TraceCheckUtils]: 15: Hoare triple {30142#(<= (+ main_~i1~0 main_~n0~0) 6)} assume !!(~i1~0 < ~n1~0);#t~post5 := ~i1~0;~i1~0 := 1 + #t~post5;havoc #t~post5;#t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {30143#(<= (+ main_~i1~0 main_~n0~0) 7)} is VALID [2018-11-23 13:12:57,494 INFO L273 TraceCheckUtils]: 16: Hoare triple {30143#(<= (+ main_~i1~0 main_~n0~0) 7)} assume !(~i1~0 < ~n1~0); {30144#(<= (+ main_~n0~0 main_~n1~0) 7)} is VALID [2018-11-23 13:12:57,495 INFO L273 TraceCheckUtils]: 17: Hoare triple {30144#(<= (+ main_~n0~0 main_~n1~0) 7)} ~j1~0 := 0; {30145#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 7))} is VALID [2018-11-23 13:12:57,495 INFO L273 TraceCheckUtils]: 18: Hoare triple {30145#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 7))} assume !!(~j1~0 < ~n0~0 + ~n1~0); {30145#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 7))} is VALID [2018-11-23 13:12:57,496 INFO L256 TraceCheckUtils]: 19: Hoare triple {30145#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 7))} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {30132#true} is VALID [2018-11-23 13:12:57,496 INFO L273 TraceCheckUtils]: 20: Hoare triple {30132#true} ~cond := #in~cond; {30132#true} is VALID [2018-11-23 13:12:57,496 INFO L273 TraceCheckUtils]: 21: Hoare triple {30132#true} assume !(0 == ~cond); {30132#true} is VALID [2018-11-23 13:12:57,496 INFO L273 TraceCheckUtils]: 22: Hoare triple {30132#true} assume true; {30132#true} is VALID [2018-11-23 13:12:57,497 INFO L268 TraceCheckUtils]: 23: Hoare quadruple {30132#true} {30145#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 7))} #70#return; {30145#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 7))} is VALID [2018-11-23 13:12:57,498 INFO L273 TraceCheckUtils]: 24: Hoare triple {30145#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 7))} #t~post7 := ~j1~0;~j1~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~k~0;~k~0 := #t~post8 - 1;havoc #t~post8; {30146#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 6))} is VALID [2018-11-23 13:12:57,499 INFO L273 TraceCheckUtils]: 25: Hoare triple {30146#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 6))} assume !!(~j1~0 < ~n0~0 + ~n1~0); {30146#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 6))} is VALID [2018-11-23 13:12:57,499 INFO L256 TraceCheckUtils]: 26: Hoare triple {30146#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 6))} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {30132#true} is VALID [2018-11-23 13:12:57,499 INFO L273 TraceCheckUtils]: 27: Hoare triple {30132#true} ~cond := #in~cond; {30132#true} is VALID [2018-11-23 13:12:57,499 INFO L273 TraceCheckUtils]: 28: Hoare triple {30132#true} assume !(0 == ~cond); {30132#true} is VALID [2018-11-23 13:12:57,500 INFO L273 TraceCheckUtils]: 29: Hoare triple {30132#true} assume true; {30132#true} is VALID [2018-11-23 13:12:57,501 INFO L268 TraceCheckUtils]: 30: Hoare quadruple {30132#true} {30146#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 6))} #70#return; {30146#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 6))} is VALID [2018-11-23 13:12:57,502 INFO L273 TraceCheckUtils]: 31: Hoare triple {30146#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 6))} #t~post7 := ~j1~0;~j1~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~k~0;~k~0 := #t~post8 - 1;havoc #t~post8; {30147#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 5))} is VALID [2018-11-23 13:12:57,502 INFO L273 TraceCheckUtils]: 32: Hoare triple {30147#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 5))} assume !!(~j1~0 < ~n0~0 + ~n1~0); {30147#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 5))} is VALID [2018-11-23 13:12:57,502 INFO L256 TraceCheckUtils]: 33: Hoare triple {30147#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 5))} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {30132#true} is VALID [2018-11-23 13:12:57,503 INFO L273 TraceCheckUtils]: 34: Hoare triple {30132#true} ~cond := #in~cond; {30132#true} is VALID [2018-11-23 13:12:57,503 INFO L273 TraceCheckUtils]: 35: Hoare triple {30132#true} assume !(0 == ~cond); {30132#true} is VALID [2018-11-23 13:12:57,503 INFO L273 TraceCheckUtils]: 36: Hoare triple {30132#true} assume true; {30132#true} is VALID [2018-11-23 13:12:57,504 INFO L268 TraceCheckUtils]: 37: Hoare quadruple {30132#true} {30147#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 5))} #70#return; {30147#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 5))} is VALID [2018-11-23 13:12:57,505 INFO L273 TraceCheckUtils]: 38: Hoare triple {30147#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 5))} #t~post7 := ~j1~0;~j1~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~k~0;~k~0 := #t~post8 - 1;havoc #t~post8; {30148#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 4))} is VALID [2018-11-23 13:12:57,505 INFO L273 TraceCheckUtils]: 39: Hoare triple {30148#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 4))} assume !!(~j1~0 < ~n0~0 + ~n1~0); {30148#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 4))} is VALID [2018-11-23 13:12:57,506 INFO L256 TraceCheckUtils]: 40: Hoare triple {30148#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 4))} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {30132#true} is VALID [2018-11-23 13:12:57,506 INFO L273 TraceCheckUtils]: 41: Hoare triple {30132#true} ~cond := #in~cond; {30132#true} is VALID [2018-11-23 13:12:57,506 INFO L273 TraceCheckUtils]: 42: Hoare triple {30132#true} assume !(0 == ~cond); {30132#true} is VALID [2018-11-23 13:12:57,506 INFO L273 TraceCheckUtils]: 43: Hoare triple {30132#true} assume true; {30132#true} is VALID [2018-11-23 13:12:57,507 INFO L268 TraceCheckUtils]: 44: Hoare quadruple {30132#true} {30148#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 4))} #70#return; {30148#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 4))} is VALID [2018-11-23 13:12:57,508 INFO L273 TraceCheckUtils]: 45: Hoare triple {30148#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 4))} #t~post7 := ~j1~0;~j1~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~k~0;~k~0 := #t~post8 - 1;havoc #t~post8; {30149#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 3))} is VALID [2018-11-23 13:12:57,508 INFO L273 TraceCheckUtils]: 46: Hoare triple {30149#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 3))} assume !!(~j1~0 < ~n0~0 + ~n1~0); {30149#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 3))} is VALID [2018-11-23 13:12:57,509 INFO L256 TraceCheckUtils]: 47: Hoare triple {30149#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 3))} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {30132#true} is VALID [2018-11-23 13:12:57,509 INFO L273 TraceCheckUtils]: 48: Hoare triple {30132#true} ~cond := #in~cond; {30132#true} is VALID [2018-11-23 13:12:57,509 INFO L273 TraceCheckUtils]: 49: Hoare triple {30132#true} assume !(0 == ~cond); {30132#true} is VALID [2018-11-23 13:12:57,509 INFO L273 TraceCheckUtils]: 50: Hoare triple {30132#true} assume true; {30132#true} is VALID [2018-11-23 13:12:57,510 INFO L268 TraceCheckUtils]: 51: Hoare quadruple {30132#true} {30149#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 3))} #70#return; {30149#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 3))} is VALID [2018-11-23 13:12:57,511 INFO L273 TraceCheckUtils]: 52: Hoare triple {30149#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 3))} #t~post7 := ~j1~0;~j1~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~k~0;~k~0 := #t~post8 - 1;havoc #t~post8; {30150#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 2))} is VALID [2018-11-23 13:12:57,511 INFO L273 TraceCheckUtils]: 53: Hoare triple {30150#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 2))} assume !!(~j1~0 < ~n0~0 + ~n1~0); {30150#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 2))} is VALID [2018-11-23 13:12:57,512 INFO L256 TraceCheckUtils]: 54: Hoare triple {30150#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 2))} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {30132#true} is VALID [2018-11-23 13:12:57,512 INFO L273 TraceCheckUtils]: 55: Hoare triple {30132#true} ~cond := #in~cond; {30132#true} is VALID [2018-11-23 13:12:57,512 INFO L273 TraceCheckUtils]: 56: Hoare triple {30132#true} assume !(0 == ~cond); {30132#true} is VALID [2018-11-23 13:12:57,512 INFO L273 TraceCheckUtils]: 57: Hoare triple {30132#true} assume true; {30132#true} is VALID [2018-11-23 13:12:57,513 INFO L268 TraceCheckUtils]: 58: Hoare quadruple {30132#true} {30150#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 2))} #70#return; {30150#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 2))} is VALID [2018-11-23 13:12:57,514 INFO L273 TraceCheckUtils]: 59: Hoare triple {30150#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 2))} #t~post7 := ~j1~0;~j1~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~k~0;~k~0 := #t~post8 - 1;havoc #t~post8; {30151#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 1))} is VALID [2018-11-23 13:12:57,515 INFO L273 TraceCheckUtils]: 60: Hoare triple {30151#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 1))} assume !!(~j1~0 < ~n0~0 + ~n1~0); {30151#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 1))} is VALID [2018-11-23 13:12:57,515 INFO L256 TraceCheckUtils]: 61: Hoare triple {30151#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 1))} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {30132#true} is VALID [2018-11-23 13:12:57,515 INFO L273 TraceCheckUtils]: 62: Hoare triple {30132#true} ~cond := #in~cond; {30132#true} is VALID [2018-11-23 13:12:57,515 INFO L273 TraceCheckUtils]: 63: Hoare triple {30132#true} assume !(0 == ~cond); {30132#true} is VALID [2018-11-23 13:12:57,515 INFO L273 TraceCheckUtils]: 64: Hoare triple {30132#true} assume true; {30132#true} is VALID [2018-11-23 13:12:57,516 INFO L268 TraceCheckUtils]: 65: Hoare quadruple {30132#true} {30151#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 1))} #70#return; {30151#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 1))} is VALID [2018-11-23 13:12:57,517 INFO L273 TraceCheckUtils]: 66: Hoare triple {30151#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 1))} #t~post7 := ~j1~0;~j1~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~k~0;~k~0 := #t~post8 - 1;havoc #t~post8; {30152#(<= (+ main_~n0~0 main_~n1~0) main_~j1~0)} is VALID [2018-11-23 13:12:57,518 INFO L273 TraceCheckUtils]: 67: Hoare triple {30152#(<= (+ main_~n0~0 main_~n1~0) main_~j1~0)} assume !!(~j1~0 < ~n0~0 + ~n1~0); {30133#false} is VALID [2018-11-23 13:12:57,518 INFO L256 TraceCheckUtils]: 68: Hoare triple {30133#false} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {30133#false} is VALID [2018-11-23 13:12:57,518 INFO L273 TraceCheckUtils]: 69: Hoare triple {30133#false} ~cond := #in~cond; {30133#false} is VALID [2018-11-23 13:12:57,518 INFO L273 TraceCheckUtils]: 70: Hoare triple {30133#false} assume 0 == ~cond; {30133#false} is VALID [2018-11-23 13:12:57,519 INFO L273 TraceCheckUtils]: 71: Hoare triple {30133#false} assume !false; {30133#false} is VALID [2018-11-23 13:12:57,525 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 91 proven. 18 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2018-11-23 13:12:57,526 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:12:57,526 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:12:57,546 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 13:12:57,565 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 13:12:57,565 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:12:57,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:12:57,580 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:12:58,037 INFO L256 TraceCheckUtils]: 0: Hoare triple {30132#true} call ULTIMATE.init(); {30132#true} is VALID [2018-11-23 13:12:58,038 INFO L273 TraceCheckUtils]: 1: Hoare triple {30132#true} assume true; {30132#true} is VALID [2018-11-23 13:12:58,038 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {30132#true} {30132#true} #66#return; {30132#true} is VALID [2018-11-23 13:12:58,038 INFO L256 TraceCheckUtils]: 3: Hoare triple {30132#true} call #t~ret9 := main(); {30132#true} is VALID [2018-11-23 13:12:58,039 INFO L273 TraceCheckUtils]: 4: Hoare triple {30132#true} havoc ~n0~0;havoc ~n1~0;~i0~0 := 0;~k~0 := 0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n0~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~n1~0 := #t~nondet2;havoc #t~nondet2; {30134#(<= main_~i0~0 0)} is VALID [2018-11-23 13:12:58,039 INFO L273 TraceCheckUtils]: 5: Hoare triple {30134#(<= main_~i0~0 0)} assume !!(-1000000 <= ~n0~0 && ~n0~0 < 1000000); {30134#(<= main_~i0~0 0)} is VALID [2018-11-23 13:12:58,039 INFO L273 TraceCheckUtils]: 6: Hoare triple {30134#(<= main_~i0~0 0)} assume !!(-1000000 <= ~n1~0 && ~n1~0 < 1000000); {30134#(<= main_~i0~0 0)} is VALID [2018-11-23 13:12:58,040 INFO L273 TraceCheckUtils]: 7: Hoare triple {30134#(<= main_~i0~0 0)} assume !!(~i0~0 < ~n0~0);#t~post3 := ~i0~0;~i0~0 := 1 + #t~post3;havoc #t~post3;#t~post4 := ~k~0;~k~0 := 1 + #t~post4;havoc #t~post4; {30135#(<= main_~i0~0 1)} is VALID [2018-11-23 13:12:58,040 INFO L273 TraceCheckUtils]: 8: Hoare triple {30135#(<= main_~i0~0 1)} assume !!(~i0~0 < ~n0~0);#t~post3 := ~i0~0;~i0~0 := 1 + #t~post3;havoc #t~post3;#t~post4 := ~k~0;~k~0 := 1 + #t~post4;havoc #t~post4; {30136#(<= main_~i0~0 2)} is VALID [2018-11-23 13:12:58,041 INFO L273 TraceCheckUtils]: 9: Hoare triple {30136#(<= main_~i0~0 2)} assume !!(~i0~0 < ~n0~0);#t~post3 := ~i0~0;~i0~0 := 1 + #t~post3;havoc #t~post3;#t~post4 := ~k~0;~k~0 := 1 + #t~post4;havoc #t~post4; {30137#(<= main_~i0~0 3)} is VALID [2018-11-23 13:12:58,041 INFO L273 TraceCheckUtils]: 10: Hoare triple {30137#(<= main_~i0~0 3)} assume !!(~i0~0 < ~n0~0);#t~post3 := ~i0~0;~i0~0 := 1 + #t~post3;havoc #t~post3;#t~post4 := ~k~0;~k~0 := 1 + #t~post4;havoc #t~post4; {30138#(<= main_~i0~0 4)} is VALID [2018-11-23 13:12:58,042 INFO L273 TraceCheckUtils]: 11: Hoare triple {30138#(<= main_~i0~0 4)} assume !!(~i0~0 < ~n0~0);#t~post3 := ~i0~0;~i0~0 := 1 + #t~post3;havoc #t~post3;#t~post4 := ~k~0;~k~0 := 1 + #t~post4;havoc #t~post4; {30139#(<= main_~i0~0 5)} is VALID [2018-11-23 13:12:58,043 INFO L273 TraceCheckUtils]: 12: Hoare triple {30139#(<= main_~i0~0 5)} assume !(~i0~0 < ~n0~0); {30140#(<= main_~n0~0 5)} is VALID [2018-11-23 13:12:58,043 INFO L273 TraceCheckUtils]: 13: Hoare triple {30140#(<= main_~n0~0 5)} ~i1~0 := 0; {30195#(and (<= main_~i1~0 0) (<= main_~n0~0 5))} is VALID [2018-11-23 13:12:58,044 INFO L273 TraceCheckUtils]: 14: Hoare triple {30195#(and (<= main_~i1~0 0) (<= main_~n0~0 5))} assume !!(~i1~0 < ~n1~0);#t~post5 := ~i1~0;~i1~0 := 1 + #t~post5;havoc #t~post5;#t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {30199#(and (<= main_~i1~0 1) (<= main_~n0~0 5))} is VALID [2018-11-23 13:12:58,045 INFO L273 TraceCheckUtils]: 15: Hoare triple {30199#(and (<= main_~i1~0 1) (<= main_~n0~0 5))} assume !!(~i1~0 < ~n1~0);#t~post5 := ~i1~0;~i1~0 := 1 + #t~post5;havoc #t~post5;#t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {30203#(and (<= main_~i1~0 2) (<= main_~n0~0 5))} is VALID [2018-11-23 13:12:58,046 INFO L273 TraceCheckUtils]: 16: Hoare triple {30203#(and (<= main_~i1~0 2) (<= main_~n0~0 5))} assume !(~i1~0 < ~n1~0); {30207#(and (<= main_~n1~0 2) (<= main_~n0~0 5))} is VALID [2018-11-23 13:12:58,046 INFO L273 TraceCheckUtils]: 17: Hoare triple {30207#(and (<= main_~n1~0 2) (<= main_~n0~0 5))} ~j1~0 := 0; {30211#(and (<= main_~n1~0 2) (<= 0 main_~j1~0) (<= main_~n0~0 5))} is VALID [2018-11-23 13:12:58,047 INFO L273 TraceCheckUtils]: 18: Hoare triple {30211#(and (<= main_~n1~0 2) (<= 0 main_~j1~0) (<= main_~n0~0 5))} assume !!(~j1~0 < ~n0~0 + ~n1~0); {30211#(and (<= main_~n1~0 2) (<= 0 main_~j1~0) (<= main_~n0~0 5))} is VALID [2018-11-23 13:12:58,047 INFO L256 TraceCheckUtils]: 19: Hoare triple {30211#(and (<= main_~n1~0 2) (<= 0 main_~j1~0) (<= main_~n0~0 5))} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {30132#true} is VALID [2018-11-23 13:12:58,047 INFO L273 TraceCheckUtils]: 20: Hoare triple {30132#true} ~cond := #in~cond; {30132#true} is VALID [2018-11-23 13:12:58,047 INFO L273 TraceCheckUtils]: 21: Hoare triple {30132#true} assume !(0 == ~cond); {30132#true} is VALID [2018-11-23 13:12:58,048 INFO L273 TraceCheckUtils]: 22: Hoare triple {30132#true} assume true; {30132#true} is VALID [2018-11-23 13:12:58,049 INFO L268 TraceCheckUtils]: 23: Hoare quadruple {30132#true} {30211#(and (<= main_~n1~0 2) (<= 0 main_~j1~0) (<= main_~n0~0 5))} #70#return; {30211#(and (<= main_~n1~0 2) (<= 0 main_~j1~0) (<= main_~n0~0 5))} is VALID [2018-11-23 13:12:58,050 INFO L273 TraceCheckUtils]: 24: Hoare triple {30211#(and (<= main_~n1~0 2) (<= 0 main_~j1~0) (<= main_~n0~0 5))} #t~post7 := ~j1~0;~j1~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~k~0;~k~0 := #t~post8 - 1;havoc #t~post8; {30233#(and (<= 1 main_~j1~0) (<= main_~n1~0 2) (<= main_~n0~0 5))} is VALID [2018-11-23 13:12:58,050 INFO L273 TraceCheckUtils]: 25: Hoare triple {30233#(and (<= 1 main_~j1~0) (<= main_~n1~0 2) (<= main_~n0~0 5))} assume !!(~j1~0 < ~n0~0 + ~n1~0); {30233#(and (<= 1 main_~j1~0) (<= main_~n1~0 2) (<= main_~n0~0 5))} is VALID [2018-11-23 13:12:58,050 INFO L256 TraceCheckUtils]: 26: Hoare triple {30233#(and (<= 1 main_~j1~0) (<= main_~n1~0 2) (<= main_~n0~0 5))} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {30132#true} is VALID [2018-11-23 13:12:58,051 INFO L273 TraceCheckUtils]: 27: Hoare triple {30132#true} ~cond := #in~cond; {30132#true} is VALID [2018-11-23 13:12:58,051 INFO L273 TraceCheckUtils]: 28: Hoare triple {30132#true} assume !(0 == ~cond); {30132#true} is VALID [2018-11-23 13:12:58,051 INFO L273 TraceCheckUtils]: 29: Hoare triple {30132#true} assume true; {30132#true} is VALID [2018-11-23 13:12:58,052 INFO L268 TraceCheckUtils]: 30: Hoare quadruple {30132#true} {30233#(and (<= 1 main_~j1~0) (<= main_~n1~0 2) (<= main_~n0~0 5))} #70#return; {30233#(and (<= 1 main_~j1~0) (<= main_~n1~0 2) (<= main_~n0~0 5))} is VALID [2018-11-23 13:12:58,053 INFO L273 TraceCheckUtils]: 31: Hoare triple {30233#(and (<= 1 main_~j1~0) (<= main_~n1~0 2) (<= main_~n0~0 5))} #t~post7 := ~j1~0;~j1~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~k~0;~k~0 := #t~post8 - 1;havoc #t~post8; {30255#(and (<= main_~n1~0 2) (<= main_~n0~0 5) (<= 2 main_~j1~0))} is VALID [2018-11-23 13:12:58,053 INFO L273 TraceCheckUtils]: 32: Hoare triple {30255#(and (<= main_~n1~0 2) (<= main_~n0~0 5) (<= 2 main_~j1~0))} assume !!(~j1~0 < ~n0~0 + ~n1~0); {30255#(and (<= main_~n1~0 2) (<= main_~n0~0 5) (<= 2 main_~j1~0))} is VALID [2018-11-23 13:12:58,054 INFO L256 TraceCheckUtils]: 33: Hoare triple {30255#(and (<= main_~n1~0 2) (<= main_~n0~0 5) (<= 2 main_~j1~0))} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {30132#true} is VALID [2018-11-23 13:12:58,054 INFO L273 TraceCheckUtils]: 34: Hoare triple {30132#true} ~cond := #in~cond; {30132#true} is VALID [2018-11-23 13:12:58,054 INFO L273 TraceCheckUtils]: 35: Hoare triple {30132#true} assume !(0 == ~cond); {30132#true} is VALID [2018-11-23 13:12:58,054 INFO L273 TraceCheckUtils]: 36: Hoare triple {30132#true} assume true; {30132#true} is VALID [2018-11-23 13:12:58,055 INFO L268 TraceCheckUtils]: 37: Hoare quadruple {30132#true} {30255#(and (<= main_~n1~0 2) (<= main_~n0~0 5) (<= 2 main_~j1~0))} #70#return; {30255#(and (<= main_~n1~0 2) (<= main_~n0~0 5) (<= 2 main_~j1~0))} is VALID [2018-11-23 13:12:58,056 INFO L273 TraceCheckUtils]: 38: Hoare triple {30255#(and (<= main_~n1~0 2) (<= main_~n0~0 5) (<= 2 main_~j1~0))} #t~post7 := ~j1~0;~j1~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~k~0;~k~0 := #t~post8 - 1;havoc #t~post8; {30277#(and (<= main_~n1~0 2) (<= 3 main_~j1~0) (<= main_~n0~0 5))} is VALID [2018-11-23 13:12:58,056 INFO L273 TraceCheckUtils]: 39: Hoare triple {30277#(and (<= main_~n1~0 2) (<= 3 main_~j1~0) (<= main_~n0~0 5))} assume !!(~j1~0 < ~n0~0 + ~n1~0); {30277#(and (<= main_~n1~0 2) (<= 3 main_~j1~0) (<= main_~n0~0 5))} is VALID [2018-11-23 13:12:58,057 INFO L256 TraceCheckUtils]: 40: Hoare triple {30277#(and (<= main_~n1~0 2) (<= 3 main_~j1~0) (<= main_~n0~0 5))} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {30132#true} is VALID [2018-11-23 13:12:58,057 INFO L273 TraceCheckUtils]: 41: Hoare triple {30132#true} ~cond := #in~cond; {30132#true} is VALID [2018-11-23 13:12:58,057 INFO L273 TraceCheckUtils]: 42: Hoare triple {30132#true} assume !(0 == ~cond); {30132#true} is VALID [2018-11-23 13:12:58,057 INFO L273 TraceCheckUtils]: 43: Hoare triple {30132#true} assume true; {30132#true} is VALID [2018-11-23 13:12:58,058 INFO L268 TraceCheckUtils]: 44: Hoare quadruple {30132#true} {30277#(and (<= main_~n1~0 2) (<= 3 main_~j1~0) (<= main_~n0~0 5))} #70#return; {30277#(and (<= main_~n1~0 2) (<= 3 main_~j1~0) (<= main_~n0~0 5))} is VALID [2018-11-23 13:12:58,059 INFO L273 TraceCheckUtils]: 45: Hoare triple {30277#(and (<= main_~n1~0 2) (<= 3 main_~j1~0) (<= main_~n0~0 5))} #t~post7 := ~j1~0;~j1~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~k~0;~k~0 := #t~post8 - 1;havoc #t~post8; {30299#(and (<= main_~n1~0 2) (<= 4 main_~j1~0) (<= main_~n0~0 5))} is VALID [2018-11-23 13:12:58,060 INFO L273 TraceCheckUtils]: 46: Hoare triple {30299#(and (<= main_~n1~0 2) (<= 4 main_~j1~0) (<= main_~n0~0 5))} assume !!(~j1~0 < ~n0~0 + ~n1~0); {30299#(and (<= main_~n1~0 2) (<= 4 main_~j1~0) (<= main_~n0~0 5))} is VALID [2018-11-23 13:12:58,060 INFO L256 TraceCheckUtils]: 47: Hoare triple {30299#(and (<= main_~n1~0 2) (<= 4 main_~j1~0) (<= main_~n0~0 5))} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {30132#true} is VALID [2018-11-23 13:12:58,060 INFO L273 TraceCheckUtils]: 48: Hoare triple {30132#true} ~cond := #in~cond; {30132#true} is VALID [2018-11-23 13:12:58,060 INFO L273 TraceCheckUtils]: 49: Hoare triple {30132#true} assume !(0 == ~cond); {30132#true} is VALID [2018-11-23 13:12:58,060 INFO L273 TraceCheckUtils]: 50: Hoare triple {30132#true} assume true; {30132#true} is VALID [2018-11-23 13:12:58,061 INFO L268 TraceCheckUtils]: 51: Hoare quadruple {30132#true} {30299#(and (<= main_~n1~0 2) (<= 4 main_~j1~0) (<= main_~n0~0 5))} #70#return; {30299#(and (<= main_~n1~0 2) (<= 4 main_~j1~0) (<= main_~n0~0 5))} is VALID [2018-11-23 13:12:58,061 INFO L273 TraceCheckUtils]: 52: Hoare triple {30299#(and (<= main_~n1~0 2) (<= 4 main_~j1~0) (<= main_~n0~0 5))} #t~post7 := ~j1~0;~j1~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~k~0;~k~0 := #t~post8 - 1;havoc #t~post8; {30321#(and (<= main_~n1~0 2) (<= main_~n0~0 5) (<= 5 main_~j1~0))} is VALID [2018-11-23 13:12:58,062 INFO L273 TraceCheckUtils]: 53: Hoare triple {30321#(and (<= main_~n1~0 2) (<= main_~n0~0 5) (<= 5 main_~j1~0))} assume !!(~j1~0 < ~n0~0 + ~n1~0); {30321#(and (<= main_~n1~0 2) (<= main_~n0~0 5) (<= 5 main_~j1~0))} is VALID [2018-11-23 13:12:58,062 INFO L256 TraceCheckUtils]: 54: Hoare triple {30321#(and (<= main_~n1~0 2) (<= main_~n0~0 5) (<= 5 main_~j1~0))} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {30132#true} is VALID [2018-11-23 13:12:58,062 INFO L273 TraceCheckUtils]: 55: Hoare triple {30132#true} ~cond := #in~cond; {30132#true} is VALID [2018-11-23 13:12:58,062 INFO L273 TraceCheckUtils]: 56: Hoare triple {30132#true} assume !(0 == ~cond); {30132#true} is VALID [2018-11-23 13:12:58,062 INFO L273 TraceCheckUtils]: 57: Hoare triple {30132#true} assume true; {30132#true} is VALID [2018-11-23 13:12:58,063 INFO L268 TraceCheckUtils]: 58: Hoare quadruple {30132#true} {30321#(and (<= main_~n1~0 2) (<= main_~n0~0 5) (<= 5 main_~j1~0))} #70#return; {30321#(and (<= main_~n1~0 2) (<= main_~n0~0 5) (<= 5 main_~j1~0))} is VALID [2018-11-23 13:12:58,064 INFO L273 TraceCheckUtils]: 59: Hoare triple {30321#(and (<= main_~n1~0 2) (<= main_~n0~0 5) (<= 5 main_~j1~0))} #t~post7 := ~j1~0;~j1~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~k~0;~k~0 := #t~post8 - 1;havoc #t~post8; {30343#(and (<= 6 main_~j1~0) (<= main_~n1~0 2) (<= main_~n0~0 5))} is VALID [2018-11-23 13:12:58,064 INFO L273 TraceCheckUtils]: 60: Hoare triple {30343#(and (<= 6 main_~j1~0) (<= main_~n1~0 2) (<= main_~n0~0 5))} assume !!(~j1~0 < ~n0~0 + ~n1~0); {30343#(and (<= 6 main_~j1~0) (<= main_~n1~0 2) (<= main_~n0~0 5))} is VALID [2018-11-23 13:12:58,065 INFO L256 TraceCheckUtils]: 61: Hoare triple {30343#(and (<= 6 main_~j1~0) (<= main_~n1~0 2) (<= main_~n0~0 5))} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {30132#true} is VALID [2018-11-23 13:12:58,065 INFO L273 TraceCheckUtils]: 62: Hoare triple {30132#true} ~cond := #in~cond; {30132#true} is VALID [2018-11-23 13:12:58,065 INFO L273 TraceCheckUtils]: 63: Hoare triple {30132#true} assume !(0 == ~cond); {30132#true} is VALID [2018-11-23 13:12:58,065 INFO L273 TraceCheckUtils]: 64: Hoare triple {30132#true} assume true; {30132#true} is VALID [2018-11-23 13:12:58,066 INFO L268 TraceCheckUtils]: 65: Hoare quadruple {30132#true} {30343#(and (<= 6 main_~j1~0) (<= main_~n1~0 2) (<= main_~n0~0 5))} #70#return; {30343#(and (<= 6 main_~j1~0) (<= main_~n1~0 2) (<= main_~n0~0 5))} is VALID [2018-11-23 13:12:58,067 INFO L273 TraceCheckUtils]: 66: Hoare triple {30343#(and (<= 6 main_~j1~0) (<= main_~n1~0 2) (<= main_~n0~0 5))} #t~post7 := ~j1~0;~j1~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~k~0;~k~0 := #t~post8 - 1;havoc #t~post8; {30365#(and (<= main_~n1~0 2) (<= 7 main_~j1~0) (<= main_~n0~0 5))} is VALID [2018-11-23 13:12:58,068 INFO L273 TraceCheckUtils]: 67: Hoare triple {30365#(and (<= main_~n1~0 2) (<= 7 main_~j1~0) (<= main_~n0~0 5))} assume !!(~j1~0 < ~n0~0 + ~n1~0); {30133#false} is VALID [2018-11-23 13:12:58,068 INFO L256 TraceCheckUtils]: 68: Hoare triple {30133#false} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {30133#false} is VALID [2018-11-23 13:12:58,068 INFO L273 TraceCheckUtils]: 69: Hoare triple {30133#false} ~cond := #in~cond; {30133#false} is VALID [2018-11-23 13:12:58,068 INFO L273 TraceCheckUtils]: 70: Hoare triple {30133#false} assume 0 == ~cond; {30133#false} is VALID [2018-11-23 13:12:58,068 INFO L273 TraceCheckUtils]: 71: Hoare triple {30133#false} assume !false; {30133#false} is VALID [2018-11-23 13:12:58,075 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 91 proven. 18 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2018-11-23 13:12:58,093 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:12:58,094 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 33 [2018-11-23 13:12:58,094 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 72 [2018-11-23 13:12:58,094 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:12:58,094 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 33 states. [2018-11-23 13:12:58,176 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 88 edges. 88 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:12:58,176 INFO L459 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-11-23 13:12:58,177 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-11-23 13:12:58,177 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=211, Invalid=845, Unknown=0, NotChecked=0, Total=1056 [2018-11-23 13:12:58,177 INFO L87 Difference]: Start difference. First operand 90 states and 99 transitions. Second operand 33 states. [2018-11-23 13:13:02,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:13:02,765 INFO L93 Difference]: Finished difference Result 298 states and 369 transitions. [2018-11-23 13:13:02,765 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-11-23 13:13:02,765 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 72 [2018-11-23 13:13:02,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:13:02,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-11-23 13:13:02,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 140 transitions. [2018-11-23 13:13:02,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-11-23 13:13:02,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 140 transitions. [2018-11-23 13:13:02,768 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 41 states and 140 transitions. [2018-11-23 13:13:02,905 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 140 edges. 140 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:13:02,911 INFO L225 Difference]: With dead ends: 298 [2018-11-23 13:13:02,911 INFO L226 Difference]: Without dead ends: 266 [2018-11-23 13:13:02,912 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1256 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=823, Invalid=3467, Unknown=0, NotChecked=0, Total=4290 [2018-11-23 13:13:02,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2018-11-23 13:13:03,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 90. [2018-11-23 13:13:03,474 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:13:03,474 INFO L82 GeneralOperation]: Start isEquivalent. First operand 266 states. Second operand 90 states. [2018-11-23 13:13:03,474 INFO L74 IsIncluded]: Start isIncluded. First operand 266 states. Second operand 90 states. [2018-11-23 13:13:03,474 INFO L87 Difference]: Start difference. First operand 266 states. Second operand 90 states. [2018-11-23 13:13:03,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:13:03,480 INFO L93 Difference]: Finished difference Result 266 states and 329 transitions. [2018-11-23 13:13:03,480 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 329 transitions. [2018-11-23 13:13:03,480 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:13:03,480 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:13:03,480 INFO L74 IsIncluded]: Start isIncluded. First operand 90 states. Second operand 266 states. [2018-11-23 13:13:03,480 INFO L87 Difference]: Start difference. First operand 90 states. Second operand 266 states. [2018-11-23 13:13:03,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:13:03,486 INFO L93 Difference]: Finished difference Result 266 states and 329 transitions. [2018-11-23 13:13:03,487 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 329 transitions. [2018-11-23 13:13:03,487 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:13:03,487 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:13:03,487 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:13:03,487 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:13:03,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2018-11-23 13:13:03,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 99 transitions. [2018-11-23 13:13:03,488 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 99 transitions. Word has length 72 [2018-11-23 13:13:03,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:13:03,489 INFO L480 AbstractCegarLoop]: Abstraction has 90 states and 99 transitions. [2018-11-23 13:13:03,489 INFO L481 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-11-23 13:13:03,489 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 99 transitions. [2018-11-23 13:13:03,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-11-23 13:13:03,489 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:13:03,489 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 8, 7, 7, 7, 7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:13:03,490 INFO L423 AbstractCegarLoop]: === Iteration 42 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:13:03,490 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:13:03,490 INFO L82 PathProgramCache]: Analyzing trace with hash 835522544, now seen corresponding path program 21 times [2018-11-23 13:13:03,490 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:13:03,490 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:13:03,491 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:13:03,491 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:13:03,491 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:13:03,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:13:03,838 INFO L256 TraceCheckUtils]: 0: Hoare triple {31602#true} call ULTIMATE.init(); {31602#true} is VALID [2018-11-23 13:13:03,838 INFO L273 TraceCheckUtils]: 1: Hoare triple {31602#true} assume true; {31602#true} is VALID [2018-11-23 13:13:03,838 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {31602#true} {31602#true} #66#return; {31602#true} is VALID [2018-11-23 13:13:03,838 INFO L256 TraceCheckUtils]: 3: Hoare triple {31602#true} call #t~ret9 := main(); {31602#true} is VALID [2018-11-23 13:13:03,839 INFO L273 TraceCheckUtils]: 4: Hoare triple {31602#true} havoc ~n0~0;havoc ~n1~0;~i0~0 := 0;~k~0 := 0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n0~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~n1~0 := #t~nondet2;havoc #t~nondet2; {31604#(<= main_~i0~0 0)} is VALID [2018-11-23 13:13:03,840 INFO L273 TraceCheckUtils]: 5: Hoare triple {31604#(<= main_~i0~0 0)} assume !!(-1000000 <= ~n0~0 && ~n0~0 < 1000000); {31604#(<= main_~i0~0 0)} is VALID [2018-11-23 13:13:03,840 INFO L273 TraceCheckUtils]: 6: Hoare triple {31604#(<= main_~i0~0 0)} assume !!(-1000000 <= ~n1~0 && ~n1~0 < 1000000); {31604#(<= main_~i0~0 0)} is VALID [2018-11-23 13:13:03,840 INFO L273 TraceCheckUtils]: 7: Hoare triple {31604#(<= main_~i0~0 0)} assume !!(~i0~0 < ~n0~0);#t~post3 := ~i0~0;~i0~0 := 1 + #t~post3;havoc #t~post3;#t~post4 := ~k~0;~k~0 := 1 + #t~post4;havoc #t~post4; {31605#(<= main_~i0~0 1)} is VALID [2018-11-23 13:13:03,841 INFO L273 TraceCheckUtils]: 8: Hoare triple {31605#(<= main_~i0~0 1)} assume !!(~i0~0 < ~n0~0);#t~post3 := ~i0~0;~i0~0 := 1 + #t~post3;havoc #t~post3;#t~post4 := ~k~0;~k~0 := 1 + #t~post4;havoc #t~post4; {31606#(<= main_~i0~0 2)} is VALID [2018-11-23 13:13:03,841 INFO L273 TraceCheckUtils]: 9: Hoare triple {31606#(<= main_~i0~0 2)} assume !!(~i0~0 < ~n0~0);#t~post3 := ~i0~0;~i0~0 := 1 + #t~post3;havoc #t~post3;#t~post4 := ~k~0;~k~0 := 1 + #t~post4;havoc #t~post4; {31607#(<= main_~i0~0 3)} is VALID [2018-11-23 13:13:03,842 INFO L273 TraceCheckUtils]: 10: Hoare triple {31607#(<= main_~i0~0 3)} assume !!(~i0~0 < ~n0~0);#t~post3 := ~i0~0;~i0~0 := 1 + #t~post3;havoc #t~post3;#t~post4 := ~k~0;~k~0 := 1 + #t~post4;havoc #t~post4; {31608#(<= main_~i0~0 4)} is VALID [2018-11-23 13:13:03,843 INFO L273 TraceCheckUtils]: 11: Hoare triple {31608#(<= main_~i0~0 4)} assume !!(~i0~0 < ~n0~0);#t~post3 := ~i0~0;~i0~0 := 1 + #t~post3;havoc #t~post3;#t~post4 := ~k~0;~k~0 := 1 + #t~post4;havoc #t~post4; {31609#(<= main_~i0~0 5)} is VALID [2018-11-23 13:13:03,844 INFO L273 TraceCheckUtils]: 12: Hoare triple {31609#(<= main_~i0~0 5)} assume !!(~i0~0 < ~n0~0);#t~post3 := ~i0~0;~i0~0 := 1 + #t~post3;havoc #t~post3;#t~post4 := ~k~0;~k~0 := 1 + #t~post4;havoc #t~post4; {31610#(<= main_~i0~0 6)} is VALID [2018-11-23 13:13:03,844 INFO L273 TraceCheckUtils]: 13: Hoare triple {31610#(<= main_~i0~0 6)} assume !(~i0~0 < ~n0~0); {31611#(<= main_~n0~0 6)} is VALID [2018-11-23 13:13:03,845 INFO L273 TraceCheckUtils]: 14: Hoare triple {31611#(<= main_~n0~0 6)} ~i1~0 := 0; {31612#(<= (+ main_~i1~0 main_~n0~0) 6)} is VALID [2018-11-23 13:13:03,846 INFO L273 TraceCheckUtils]: 15: Hoare triple {31612#(<= (+ main_~i1~0 main_~n0~0) 6)} assume !!(~i1~0 < ~n1~0);#t~post5 := ~i1~0;~i1~0 := 1 + #t~post5;havoc #t~post5;#t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {31613#(<= (+ main_~i1~0 main_~n0~0) 7)} is VALID [2018-11-23 13:13:03,846 INFO L273 TraceCheckUtils]: 16: Hoare triple {31613#(<= (+ main_~i1~0 main_~n0~0) 7)} assume !(~i1~0 < ~n1~0); {31614#(<= (+ main_~n0~0 main_~n1~0) 7)} is VALID [2018-11-23 13:13:03,847 INFO L273 TraceCheckUtils]: 17: Hoare triple {31614#(<= (+ main_~n0~0 main_~n1~0) 7)} ~j1~0 := 0; {31615#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 7))} is VALID [2018-11-23 13:13:03,848 INFO L273 TraceCheckUtils]: 18: Hoare triple {31615#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 7))} assume !!(~j1~0 < ~n0~0 + ~n1~0); {31615#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 7))} is VALID [2018-11-23 13:13:03,848 INFO L256 TraceCheckUtils]: 19: Hoare triple {31615#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 7))} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {31602#true} is VALID [2018-11-23 13:13:03,848 INFO L273 TraceCheckUtils]: 20: Hoare triple {31602#true} ~cond := #in~cond; {31602#true} is VALID [2018-11-23 13:13:03,848 INFO L273 TraceCheckUtils]: 21: Hoare triple {31602#true} assume !(0 == ~cond); {31602#true} is VALID [2018-11-23 13:13:03,849 INFO L273 TraceCheckUtils]: 22: Hoare triple {31602#true} assume true; {31602#true} is VALID [2018-11-23 13:13:03,850 INFO L268 TraceCheckUtils]: 23: Hoare quadruple {31602#true} {31615#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 7))} #70#return; {31615#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 7))} is VALID [2018-11-23 13:13:03,851 INFO L273 TraceCheckUtils]: 24: Hoare triple {31615#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 7))} #t~post7 := ~j1~0;~j1~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~k~0;~k~0 := #t~post8 - 1;havoc #t~post8; {31616#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 6))} is VALID [2018-11-23 13:13:03,852 INFO L273 TraceCheckUtils]: 25: Hoare triple {31616#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 6))} assume !!(~j1~0 < ~n0~0 + ~n1~0); {31616#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 6))} is VALID [2018-11-23 13:13:03,852 INFO L256 TraceCheckUtils]: 26: Hoare triple {31616#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 6))} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {31602#true} is VALID [2018-11-23 13:13:03,852 INFO L273 TraceCheckUtils]: 27: Hoare triple {31602#true} ~cond := #in~cond; {31602#true} is VALID [2018-11-23 13:13:03,853 INFO L273 TraceCheckUtils]: 28: Hoare triple {31602#true} assume !(0 == ~cond); {31602#true} is VALID [2018-11-23 13:13:03,853 INFO L273 TraceCheckUtils]: 29: Hoare triple {31602#true} assume true; {31602#true} is VALID [2018-11-23 13:13:03,854 INFO L268 TraceCheckUtils]: 30: Hoare quadruple {31602#true} {31616#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 6))} #70#return; {31616#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 6))} is VALID [2018-11-23 13:13:03,855 INFO L273 TraceCheckUtils]: 31: Hoare triple {31616#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 6))} #t~post7 := ~j1~0;~j1~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~k~0;~k~0 := #t~post8 - 1;havoc #t~post8; {31617#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 5))} is VALID [2018-11-23 13:13:03,855 INFO L273 TraceCheckUtils]: 32: Hoare triple {31617#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 5))} assume !!(~j1~0 < ~n0~0 + ~n1~0); {31617#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 5))} is VALID [2018-11-23 13:13:03,856 INFO L256 TraceCheckUtils]: 33: Hoare triple {31617#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 5))} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {31602#true} is VALID [2018-11-23 13:13:03,856 INFO L273 TraceCheckUtils]: 34: Hoare triple {31602#true} ~cond := #in~cond; {31602#true} is VALID [2018-11-23 13:13:03,856 INFO L273 TraceCheckUtils]: 35: Hoare triple {31602#true} assume !(0 == ~cond); {31602#true} is VALID [2018-11-23 13:13:03,856 INFO L273 TraceCheckUtils]: 36: Hoare triple {31602#true} assume true; {31602#true} is VALID [2018-11-23 13:13:03,857 INFO L268 TraceCheckUtils]: 37: Hoare quadruple {31602#true} {31617#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 5))} #70#return; {31617#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 5))} is VALID [2018-11-23 13:13:03,858 INFO L273 TraceCheckUtils]: 38: Hoare triple {31617#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 5))} #t~post7 := ~j1~0;~j1~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~k~0;~k~0 := #t~post8 - 1;havoc #t~post8; {31618#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 4))} is VALID [2018-11-23 13:13:03,859 INFO L273 TraceCheckUtils]: 39: Hoare triple {31618#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 4))} assume !!(~j1~0 < ~n0~0 + ~n1~0); {31618#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 4))} is VALID [2018-11-23 13:13:03,859 INFO L256 TraceCheckUtils]: 40: Hoare triple {31618#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 4))} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {31602#true} is VALID [2018-11-23 13:13:03,859 INFO L273 TraceCheckUtils]: 41: Hoare triple {31602#true} ~cond := #in~cond; {31602#true} is VALID [2018-11-23 13:13:03,859 INFO L273 TraceCheckUtils]: 42: Hoare triple {31602#true} assume !(0 == ~cond); {31602#true} is VALID [2018-11-23 13:13:03,859 INFO L273 TraceCheckUtils]: 43: Hoare triple {31602#true} assume true; {31602#true} is VALID [2018-11-23 13:13:03,860 INFO L268 TraceCheckUtils]: 44: Hoare quadruple {31602#true} {31618#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 4))} #70#return; {31618#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 4))} is VALID [2018-11-23 13:13:03,861 INFO L273 TraceCheckUtils]: 45: Hoare triple {31618#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 4))} #t~post7 := ~j1~0;~j1~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~k~0;~k~0 := #t~post8 - 1;havoc #t~post8; {31619#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 3))} is VALID [2018-11-23 13:13:03,862 INFO L273 TraceCheckUtils]: 46: Hoare triple {31619#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 3))} assume !!(~j1~0 < ~n0~0 + ~n1~0); {31619#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 3))} is VALID [2018-11-23 13:13:03,862 INFO L256 TraceCheckUtils]: 47: Hoare triple {31619#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 3))} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {31602#true} is VALID [2018-11-23 13:13:03,862 INFO L273 TraceCheckUtils]: 48: Hoare triple {31602#true} ~cond := #in~cond; {31602#true} is VALID [2018-11-23 13:13:03,862 INFO L273 TraceCheckUtils]: 49: Hoare triple {31602#true} assume !(0 == ~cond); {31602#true} is VALID [2018-11-23 13:13:03,863 INFO L273 TraceCheckUtils]: 50: Hoare triple {31602#true} assume true; {31602#true} is VALID [2018-11-23 13:13:03,864 INFO L268 TraceCheckUtils]: 51: Hoare quadruple {31602#true} {31619#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 3))} #70#return; {31619#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 3))} is VALID [2018-11-23 13:13:03,864 INFO L273 TraceCheckUtils]: 52: Hoare triple {31619#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 3))} #t~post7 := ~j1~0;~j1~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~k~0;~k~0 := #t~post8 - 1;havoc #t~post8; {31620#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 2))} is VALID [2018-11-23 13:13:03,865 INFO L273 TraceCheckUtils]: 53: Hoare triple {31620#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 2))} assume !!(~j1~0 < ~n0~0 + ~n1~0); {31620#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 2))} is VALID [2018-11-23 13:13:03,865 INFO L256 TraceCheckUtils]: 54: Hoare triple {31620#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 2))} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {31602#true} is VALID [2018-11-23 13:13:03,865 INFO L273 TraceCheckUtils]: 55: Hoare triple {31602#true} ~cond := #in~cond; {31602#true} is VALID [2018-11-23 13:13:03,866 INFO L273 TraceCheckUtils]: 56: Hoare triple {31602#true} assume !(0 == ~cond); {31602#true} is VALID [2018-11-23 13:13:03,866 INFO L273 TraceCheckUtils]: 57: Hoare triple {31602#true} assume true; {31602#true} is VALID [2018-11-23 13:13:03,867 INFO L268 TraceCheckUtils]: 58: Hoare quadruple {31602#true} {31620#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 2))} #70#return; {31620#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 2))} is VALID [2018-11-23 13:13:03,868 INFO L273 TraceCheckUtils]: 59: Hoare triple {31620#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 2))} #t~post7 := ~j1~0;~j1~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~k~0;~k~0 := #t~post8 - 1;havoc #t~post8; {31621#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 1))} is VALID [2018-11-23 13:13:03,868 INFO L273 TraceCheckUtils]: 60: Hoare triple {31621#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 1))} assume !!(~j1~0 < ~n0~0 + ~n1~0); {31621#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 1))} is VALID [2018-11-23 13:13:03,868 INFO L256 TraceCheckUtils]: 61: Hoare triple {31621#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 1))} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {31602#true} is VALID [2018-11-23 13:13:03,868 INFO L273 TraceCheckUtils]: 62: Hoare triple {31602#true} ~cond := #in~cond; {31602#true} is VALID [2018-11-23 13:13:03,869 INFO L273 TraceCheckUtils]: 63: Hoare triple {31602#true} assume !(0 == ~cond); {31602#true} is VALID [2018-11-23 13:13:03,869 INFO L273 TraceCheckUtils]: 64: Hoare triple {31602#true} assume true; {31602#true} is VALID [2018-11-23 13:13:03,870 INFO L268 TraceCheckUtils]: 65: Hoare quadruple {31602#true} {31621#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 1))} #70#return; {31621#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 1))} is VALID [2018-11-23 13:13:03,871 INFO L273 TraceCheckUtils]: 66: Hoare triple {31621#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 1))} #t~post7 := ~j1~0;~j1~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~k~0;~k~0 := #t~post8 - 1;havoc #t~post8; {31622#(<= (+ main_~n0~0 main_~n1~0) main_~j1~0)} is VALID [2018-11-23 13:13:03,871 INFO L273 TraceCheckUtils]: 67: Hoare triple {31622#(<= (+ main_~n0~0 main_~n1~0) main_~j1~0)} assume !!(~j1~0 < ~n0~0 + ~n1~0); {31603#false} is VALID [2018-11-23 13:13:03,872 INFO L256 TraceCheckUtils]: 68: Hoare triple {31603#false} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {31603#false} is VALID [2018-11-23 13:13:03,872 INFO L273 TraceCheckUtils]: 69: Hoare triple {31603#false} ~cond := #in~cond; {31603#false} is VALID [2018-11-23 13:13:03,872 INFO L273 TraceCheckUtils]: 70: Hoare triple {31603#false} assume 0 == ~cond; {31603#false} is VALID [2018-11-23 13:13:03,872 INFO L273 TraceCheckUtils]: 71: Hoare triple {31603#false} assume !false; {31603#false} is VALID [2018-11-23 13:13:03,877 INFO L134 CoverageAnalysis]: Checked inductivity of 197 backedges. 91 proven. 22 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2018-11-23 13:13:03,877 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:13:03,878 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:13:03,886 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 13:13:03,910 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2018-11-23 13:13:03,910 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:13:03,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:13:03,927 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:13:04,364 INFO L256 TraceCheckUtils]: 0: Hoare triple {31602#true} call ULTIMATE.init(); {31602#true} is VALID [2018-11-23 13:13:04,365 INFO L273 TraceCheckUtils]: 1: Hoare triple {31602#true} assume true; {31602#true} is VALID [2018-11-23 13:13:04,365 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {31602#true} {31602#true} #66#return; {31602#true} is VALID [2018-11-23 13:13:04,365 INFO L256 TraceCheckUtils]: 3: Hoare triple {31602#true} call #t~ret9 := main(); {31602#true} is VALID [2018-11-23 13:13:04,366 INFO L273 TraceCheckUtils]: 4: Hoare triple {31602#true} havoc ~n0~0;havoc ~n1~0;~i0~0 := 0;~k~0 := 0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n0~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~n1~0 := #t~nondet2;havoc #t~nondet2; {31604#(<= main_~i0~0 0)} is VALID [2018-11-23 13:13:04,366 INFO L273 TraceCheckUtils]: 5: Hoare triple {31604#(<= main_~i0~0 0)} assume !!(-1000000 <= ~n0~0 && ~n0~0 < 1000000); {31604#(<= main_~i0~0 0)} is VALID [2018-11-23 13:13:04,367 INFO L273 TraceCheckUtils]: 6: Hoare triple {31604#(<= main_~i0~0 0)} assume !!(-1000000 <= ~n1~0 && ~n1~0 < 1000000); {31604#(<= main_~i0~0 0)} is VALID [2018-11-23 13:13:04,367 INFO L273 TraceCheckUtils]: 7: Hoare triple {31604#(<= main_~i0~0 0)} assume !!(~i0~0 < ~n0~0);#t~post3 := ~i0~0;~i0~0 := 1 + #t~post3;havoc #t~post3;#t~post4 := ~k~0;~k~0 := 1 + #t~post4;havoc #t~post4; {31605#(<= main_~i0~0 1)} is VALID [2018-11-23 13:13:04,368 INFO L273 TraceCheckUtils]: 8: Hoare triple {31605#(<= main_~i0~0 1)} assume !!(~i0~0 < ~n0~0);#t~post3 := ~i0~0;~i0~0 := 1 + #t~post3;havoc #t~post3;#t~post4 := ~k~0;~k~0 := 1 + #t~post4;havoc #t~post4; {31606#(<= main_~i0~0 2)} is VALID [2018-11-23 13:13:04,368 INFO L273 TraceCheckUtils]: 9: Hoare triple {31606#(<= main_~i0~0 2)} assume !!(~i0~0 < ~n0~0);#t~post3 := ~i0~0;~i0~0 := 1 + #t~post3;havoc #t~post3;#t~post4 := ~k~0;~k~0 := 1 + #t~post4;havoc #t~post4; {31607#(<= main_~i0~0 3)} is VALID [2018-11-23 13:13:04,369 INFO L273 TraceCheckUtils]: 10: Hoare triple {31607#(<= main_~i0~0 3)} assume !!(~i0~0 < ~n0~0);#t~post3 := ~i0~0;~i0~0 := 1 + #t~post3;havoc #t~post3;#t~post4 := ~k~0;~k~0 := 1 + #t~post4;havoc #t~post4; {31608#(<= main_~i0~0 4)} is VALID [2018-11-23 13:13:04,370 INFO L273 TraceCheckUtils]: 11: Hoare triple {31608#(<= main_~i0~0 4)} assume !!(~i0~0 < ~n0~0);#t~post3 := ~i0~0;~i0~0 := 1 + #t~post3;havoc #t~post3;#t~post4 := ~k~0;~k~0 := 1 + #t~post4;havoc #t~post4; {31609#(<= main_~i0~0 5)} is VALID [2018-11-23 13:13:04,371 INFO L273 TraceCheckUtils]: 12: Hoare triple {31609#(<= main_~i0~0 5)} assume !!(~i0~0 < ~n0~0);#t~post3 := ~i0~0;~i0~0 := 1 + #t~post3;havoc #t~post3;#t~post4 := ~k~0;~k~0 := 1 + #t~post4;havoc #t~post4; {31610#(<= main_~i0~0 6)} is VALID [2018-11-23 13:13:04,371 INFO L273 TraceCheckUtils]: 13: Hoare triple {31610#(<= main_~i0~0 6)} assume !(~i0~0 < ~n0~0); {31611#(<= main_~n0~0 6)} is VALID [2018-11-23 13:13:04,372 INFO L273 TraceCheckUtils]: 14: Hoare triple {31611#(<= main_~n0~0 6)} ~i1~0 := 0; {31668#(and (<= main_~i1~0 0) (<= main_~n0~0 6))} is VALID [2018-11-23 13:13:04,373 INFO L273 TraceCheckUtils]: 15: Hoare triple {31668#(and (<= main_~i1~0 0) (<= main_~n0~0 6))} assume !!(~i1~0 < ~n1~0);#t~post5 := ~i1~0;~i1~0 := 1 + #t~post5;havoc #t~post5;#t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {31672#(and (<= main_~i1~0 1) (<= main_~n0~0 6))} is VALID [2018-11-23 13:13:04,374 INFO L273 TraceCheckUtils]: 16: Hoare triple {31672#(and (<= main_~i1~0 1) (<= main_~n0~0 6))} assume !(~i1~0 < ~n1~0); {31676#(and (<= main_~n1~0 1) (<= main_~n0~0 6))} is VALID [2018-11-23 13:13:04,374 INFO L273 TraceCheckUtils]: 17: Hoare triple {31676#(and (<= main_~n1~0 1) (<= main_~n0~0 6))} ~j1~0 := 0; {31680#(and (<= main_~n1~0 1) (<= 0 main_~j1~0) (<= main_~n0~0 6))} is VALID [2018-11-23 13:13:04,375 INFO L273 TraceCheckUtils]: 18: Hoare triple {31680#(and (<= main_~n1~0 1) (<= 0 main_~j1~0) (<= main_~n0~0 6))} assume !!(~j1~0 < ~n0~0 + ~n1~0); {31680#(and (<= main_~n1~0 1) (<= 0 main_~j1~0) (<= main_~n0~0 6))} is VALID [2018-11-23 13:13:04,375 INFO L256 TraceCheckUtils]: 19: Hoare triple {31680#(and (<= main_~n1~0 1) (<= 0 main_~j1~0) (<= main_~n0~0 6))} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {31602#true} is VALID [2018-11-23 13:13:04,375 INFO L273 TraceCheckUtils]: 20: Hoare triple {31602#true} ~cond := #in~cond; {31602#true} is VALID [2018-11-23 13:13:04,376 INFO L273 TraceCheckUtils]: 21: Hoare triple {31602#true} assume !(0 == ~cond); {31602#true} is VALID [2018-11-23 13:13:04,376 INFO L273 TraceCheckUtils]: 22: Hoare triple {31602#true} assume true; {31602#true} is VALID [2018-11-23 13:13:04,377 INFO L268 TraceCheckUtils]: 23: Hoare quadruple {31602#true} {31680#(and (<= main_~n1~0 1) (<= 0 main_~j1~0) (<= main_~n0~0 6))} #70#return; {31680#(and (<= main_~n1~0 1) (<= 0 main_~j1~0) (<= main_~n0~0 6))} is VALID [2018-11-23 13:13:04,378 INFO L273 TraceCheckUtils]: 24: Hoare triple {31680#(and (<= main_~n1~0 1) (<= 0 main_~j1~0) (<= main_~n0~0 6))} #t~post7 := ~j1~0;~j1~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~k~0;~k~0 := #t~post8 - 1;havoc #t~post8; {31702#(and (<= main_~n1~0 1) (<= 1 main_~j1~0) (<= main_~n0~0 6))} is VALID [2018-11-23 13:13:04,378 INFO L273 TraceCheckUtils]: 25: Hoare triple {31702#(and (<= main_~n1~0 1) (<= 1 main_~j1~0) (<= main_~n0~0 6))} assume !!(~j1~0 < ~n0~0 + ~n1~0); {31702#(and (<= main_~n1~0 1) (<= 1 main_~j1~0) (<= main_~n0~0 6))} is VALID [2018-11-23 13:13:04,378 INFO L256 TraceCheckUtils]: 26: Hoare triple {31702#(and (<= main_~n1~0 1) (<= 1 main_~j1~0) (<= main_~n0~0 6))} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {31602#true} is VALID [2018-11-23 13:13:04,379 INFO L273 TraceCheckUtils]: 27: Hoare triple {31602#true} ~cond := #in~cond; {31602#true} is VALID [2018-11-23 13:13:04,379 INFO L273 TraceCheckUtils]: 28: Hoare triple {31602#true} assume !(0 == ~cond); {31602#true} is VALID [2018-11-23 13:13:04,379 INFO L273 TraceCheckUtils]: 29: Hoare triple {31602#true} assume true; {31602#true} is VALID [2018-11-23 13:13:04,379 INFO L268 TraceCheckUtils]: 30: Hoare quadruple {31602#true} {31702#(and (<= main_~n1~0 1) (<= 1 main_~j1~0) (<= main_~n0~0 6))} #70#return; {31702#(and (<= main_~n1~0 1) (<= 1 main_~j1~0) (<= main_~n0~0 6))} is VALID [2018-11-23 13:13:04,380 INFO L273 TraceCheckUtils]: 31: Hoare triple {31702#(and (<= main_~n1~0 1) (<= 1 main_~j1~0) (<= main_~n0~0 6))} #t~post7 := ~j1~0;~j1~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~k~0;~k~0 := #t~post8 - 1;havoc #t~post8; {31724#(and (<= main_~n1~0 1) (<= main_~n0~0 6) (<= 2 main_~j1~0))} is VALID [2018-11-23 13:13:04,380 INFO L273 TraceCheckUtils]: 32: Hoare triple {31724#(and (<= main_~n1~0 1) (<= main_~n0~0 6) (<= 2 main_~j1~0))} assume !!(~j1~0 < ~n0~0 + ~n1~0); {31724#(and (<= main_~n1~0 1) (<= main_~n0~0 6) (<= 2 main_~j1~0))} is VALID [2018-11-23 13:13:04,380 INFO L256 TraceCheckUtils]: 33: Hoare triple {31724#(and (<= main_~n1~0 1) (<= main_~n0~0 6) (<= 2 main_~j1~0))} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {31602#true} is VALID [2018-11-23 13:13:04,380 INFO L273 TraceCheckUtils]: 34: Hoare triple {31602#true} ~cond := #in~cond; {31602#true} is VALID [2018-11-23 13:13:04,381 INFO L273 TraceCheckUtils]: 35: Hoare triple {31602#true} assume !(0 == ~cond); {31602#true} is VALID [2018-11-23 13:13:04,381 INFO L273 TraceCheckUtils]: 36: Hoare triple {31602#true} assume true; {31602#true} is VALID [2018-11-23 13:13:04,381 INFO L268 TraceCheckUtils]: 37: Hoare quadruple {31602#true} {31724#(and (<= main_~n1~0 1) (<= main_~n0~0 6) (<= 2 main_~j1~0))} #70#return; {31724#(and (<= main_~n1~0 1) (<= main_~n0~0 6) (<= 2 main_~j1~0))} is VALID [2018-11-23 13:13:04,382 INFO L273 TraceCheckUtils]: 38: Hoare triple {31724#(and (<= main_~n1~0 1) (<= main_~n0~0 6) (<= 2 main_~j1~0))} #t~post7 := ~j1~0;~j1~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~k~0;~k~0 := #t~post8 - 1;havoc #t~post8; {31746#(and (<= main_~n1~0 1) (<= 3 main_~j1~0) (<= main_~n0~0 6))} is VALID [2018-11-23 13:13:04,383 INFO L273 TraceCheckUtils]: 39: Hoare triple {31746#(and (<= main_~n1~0 1) (<= 3 main_~j1~0) (<= main_~n0~0 6))} assume !!(~j1~0 < ~n0~0 + ~n1~0); {31746#(and (<= main_~n1~0 1) (<= 3 main_~j1~0) (<= main_~n0~0 6))} is VALID [2018-11-23 13:13:04,383 INFO L256 TraceCheckUtils]: 40: Hoare triple {31746#(and (<= main_~n1~0 1) (<= 3 main_~j1~0) (<= main_~n0~0 6))} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {31602#true} is VALID [2018-11-23 13:13:04,383 INFO L273 TraceCheckUtils]: 41: Hoare triple {31602#true} ~cond := #in~cond; {31602#true} is VALID [2018-11-23 13:13:04,384 INFO L273 TraceCheckUtils]: 42: Hoare triple {31602#true} assume !(0 == ~cond); {31602#true} is VALID [2018-11-23 13:13:04,384 INFO L273 TraceCheckUtils]: 43: Hoare triple {31602#true} assume true; {31602#true} is VALID [2018-11-23 13:13:04,385 INFO L268 TraceCheckUtils]: 44: Hoare quadruple {31602#true} {31746#(and (<= main_~n1~0 1) (<= 3 main_~j1~0) (<= main_~n0~0 6))} #70#return; {31746#(and (<= main_~n1~0 1) (<= 3 main_~j1~0) (<= main_~n0~0 6))} is VALID [2018-11-23 13:13:04,386 INFO L273 TraceCheckUtils]: 45: Hoare triple {31746#(and (<= main_~n1~0 1) (<= 3 main_~j1~0) (<= main_~n0~0 6))} #t~post7 := ~j1~0;~j1~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~k~0;~k~0 := #t~post8 - 1;havoc #t~post8; {31768#(and (<= main_~n1~0 1) (<= 4 main_~j1~0) (<= main_~n0~0 6))} is VALID [2018-11-23 13:13:04,386 INFO L273 TraceCheckUtils]: 46: Hoare triple {31768#(and (<= main_~n1~0 1) (<= 4 main_~j1~0) (<= main_~n0~0 6))} assume !!(~j1~0 < ~n0~0 + ~n1~0); {31768#(and (<= main_~n1~0 1) (<= 4 main_~j1~0) (<= main_~n0~0 6))} is VALID [2018-11-23 13:13:04,386 INFO L256 TraceCheckUtils]: 47: Hoare triple {31768#(and (<= main_~n1~0 1) (<= 4 main_~j1~0) (<= main_~n0~0 6))} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {31602#true} is VALID [2018-11-23 13:13:04,387 INFO L273 TraceCheckUtils]: 48: Hoare triple {31602#true} ~cond := #in~cond; {31602#true} is VALID [2018-11-23 13:13:04,387 INFO L273 TraceCheckUtils]: 49: Hoare triple {31602#true} assume !(0 == ~cond); {31602#true} is VALID [2018-11-23 13:13:04,387 INFO L273 TraceCheckUtils]: 50: Hoare triple {31602#true} assume true; {31602#true} is VALID [2018-11-23 13:13:04,388 INFO L268 TraceCheckUtils]: 51: Hoare quadruple {31602#true} {31768#(and (<= main_~n1~0 1) (<= 4 main_~j1~0) (<= main_~n0~0 6))} #70#return; {31768#(and (<= main_~n1~0 1) (<= 4 main_~j1~0) (<= main_~n0~0 6))} is VALID [2018-11-23 13:13:04,389 INFO L273 TraceCheckUtils]: 52: Hoare triple {31768#(and (<= main_~n1~0 1) (<= 4 main_~j1~0) (<= main_~n0~0 6))} #t~post7 := ~j1~0;~j1~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~k~0;~k~0 := #t~post8 - 1;havoc #t~post8; {31790#(and (<= main_~n1~0 1) (<= main_~n0~0 6) (<= 5 main_~j1~0))} is VALID [2018-11-23 13:13:04,390 INFO L273 TraceCheckUtils]: 53: Hoare triple {31790#(and (<= main_~n1~0 1) (<= main_~n0~0 6) (<= 5 main_~j1~0))} assume !!(~j1~0 < ~n0~0 + ~n1~0); {31790#(and (<= main_~n1~0 1) (<= main_~n0~0 6) (<= 5 main_~j1~0))} is VALID [2018-11-23 13:13:04,390 INFO L256 TraceCheckUtils]: 54: Hoare triple {31790#(and (<= main_~n1~0 1) (<= main_~n0~0 6) (<= 5 main_~j1~0))} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {31602#true} is VALID [2018-11-23 13:13:04,390 INFO L273 TraceCheckUtils]: 55: Hoare triple {31602#true} ~cond := #in~cond; {31602#true} is VALID [2018-11-23 13:13:04,390 INFO L273 TraceCheckUtils]: 56: Hoare triple {31602#true} assume !(0 == ~cond); {31602#true} is VALID [2018-11-23 13:13:04,390 INFO L273 TraceCheckUtils]: 57: Hoare triple {31602#true} assume true; {31602#true} is VALID [2018-11-23 13:13:04,391 INFO L268 TraceCheckUtils]: 58: Hoare quadruple {31602#true} {31790#(and (<= main_~n1~0 1) (<= main_~n0~0 6) (<= 5 main_~j1~0))} #70#return; {31790#(and (<= main_~n1~0 1) (<= main_~n0~0 6) (<= 5 main_~j1~0))} is VALID [2018-11-23 13:13:04,392 INFO L273 TraceCheckUtils]: 59: Hoare triple {31790#(and (<= main_~n1~0 1) (<= main_~n0~0 6) (<= 5 main_~j1~0))} #t~post7 := ~j1~0;~j1~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~k~0;~k~0 := #t~post8 - 1;havoc #t~post8; {31812#(and (<= main_~n1~0 1) (<= 6 main_~j1~0) (<= main_~n0~0 6))} is VALID [2018-11-23 13:13:04,393 INFO L273 TraceCheckUtils]: 60: Hoare triple {31812#(and (<= main_~n1~0 1) (<= 6 main_~j1~0) (<= main_~n0~0 6))} assume !!(~j1~0 < ~n0~0 + ~n1~0); {31812#(and (<= main_~n1~0 1) (<= 6 main_~j1~0) (<= main_~n0~0 6))} is VALID [2018-11-23 13:13:04,393 INFO L256 TraceCheckUtils]: 61: Hoare triple {31812#(and (<= main_~n1~0 1) (<= 6 main_~j1~0) (<= main_~n0~0 6))} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {31602#true} is VALID [2018-11-23 13:13:04,393 INFO L273 TraceCheckUtils]: 62: Hoare triple {31602#true} ~cond := #in~cond; {31602#true} is VALID [2018-11-23 13:13:04,393 INFO L273 TraceCheckUtils]: 63: Hoare triple {31602#true} assume !(0 == ~cond); {31602#true} is VALID [2018-11-23 13:13:04,393 INFO L273 TraceCheckUtils]: 64: Hoare triple {31602#true} assume true; {31602#true} is VALID [2018-11-23 13:13:04,394 INFO L268 TraceCheckUtils]: 65: Hoare quadruple {31602#true} {31812#(and (<= main_~n1~0 1) (<= 6 main_~j1~0) (<= main_~n0~0 6))} #70#return; {31812#(and (<= main_~n1~0 1) (<= 6 main_~j1~0) (<= main_~n0~0 6))} is VALID [2018-11-23 13:13:04,395 INFO L273 TraceCheckUtils]: 66: Hoare triple {31812#(and (<= main_~n1~0 1) (<= 6 main_~j1~0) (<= main_~n0~0 6))} #t~post7 := ~j1~0;~j1~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~k~0;~k~0 := #t~post8 - 1;havoc #t~post8; {31834#(and (<= main_~n1~0 1) (<= 7 main_~j1~0) (<= main_~n0~0 6))} is VALID [2018-11-23 13:13:04,396 INFO L273 TraceCheckUtils]: 67: Hoare triple {31834#(and (<= main_~n1~0 1) (<= 7 main_~j1~0) (<= main_~n0~0 6))} assume !!(~j1~0 < ~n0~0 + ~n1~0); {31603#false} is VALID [2018-11-23 13:13:04,396 INFO L256 TraceCheckUtils]: 68: Hoare triple {31603#false} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {31603#false} is VALID [2018-11-23 13:13:04,396 INFO L273 TraceCheckUtils]: 69: Hoare triple {31603#false} ~cond := #in~cond; {31603#false} is VALID [2018-11-23 13:13:04,397 INFO L273 TraceCheckUtils]: 70: Hoare triple {31603#false} assume 0 == ~cond; {31603#false} is VALID [2018-11-23 13:13:04,397 INFO L273 TraceCheckUtils]: 71: Hoare triple {31603#false} assume !false; {31603#false} is VALID [2018-11-23 13:13:04,403 INFO L134 CoverageAnalysis]: Checked inductivity of 197 backedges. 91 proven. 22 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2018-11-23 13:13:04,421 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:13:04,422 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 32 [2018-11-23 13:13:04,422 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 72 [2018-11-23 13:13:04,422 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:13:04,422 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 32 states. [2018-11-23 13:13:04,507 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 87 edges. 87 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:13:04,507 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-11-23 13:13:04,508 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-11-23 13:13:04,508 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=207, Invalid=785, Unknown=0, NotChecked=0, Total=992 [2018-11-23 13:13:04,508 INFO L87 Difference]: Start difference. First operand 90 states and 99 transitions. Second operand 32 states. [2018-11-23 13:13:09,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:13:09,702 INFO L93 Difference]: Finished difference Result 324 states and 404 transitions. [2018-11-23 13:13:09,702 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-11-23 13:13:09,702 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 72 [2018-11-23 13:13:09,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:13:09,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-11-23 13:13:09,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 146 transitions. [2018-11-23 13:13:09,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-11-23 13:13:09,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 146 transitions. [2018-11-23 13:13:09,707 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 39 states and 146 transitions. [2018-11-23 13:13:09,860 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 146 edges. 146 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:13:09,867 INFO L225 Difference]: With dead ends: 324 [2018-11-23 13:13:09,867 INFO L226 Difference]: Without dead ends: 292 [2018-11-23 13:13:09,868 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1062 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=741, Invalid=3041, Unknown=0, NotChecked=0, Total=3782 [2018-11-23 13:13:09,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2018-11-23 13:13:10,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 90. [2018-11-23 13:13:10,474 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:13:10,474 INFO L82 GeneralOperation]: Start isEquivalent. First operand 292 states. Second operand 90 states. [2018-11-23 13:13:10,474 INFO L74 IsIncluded]: Start isIncluded. First operand 292 states. Second operand 90 states. [2018-11-23 13:13:10,474 INFO L87 Difference]: Start difference. First operand 292 states. Second operand 90 states. [2018-11-23 13:13:10,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:13:10,482 INFO L93 Difference]: Finished difference Result 292 states and 364 transitions. [2018-11-23 13:13:10,482 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 364 transitions. [2018-11-23 13:13:10,482 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:13:10,482 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:13:10,483 INFO L74 IsIncluded]: Start isIncluded. First operand 90 states. Second operand 292 states. [2018-11-23 13:13:10,483 INFO L87 Difference]: Start difference. First operand 90 states. Second operand 292 states. [2018-11-23 13:13:10,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:13:10,490 INFO L93 Difference]: Finished difference Result 292 states and 364 transitions. [2018-11-23 13:13:10,490 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 364 transitions. [2018-11-23 13:13:10,491 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:13:10,491 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:13:10,491 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:13:10,491 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:13:10,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2018-11-23 13:13:10,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 99 transitions. [2018-11-23 13:13:10,493 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 99 transitions. Word has length 72 [2018-11-23 13:13:10,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:13:10,493 INFO L480 AbstractCegarLoop]: Abstraction has 90 states and 99 transitions. [2018-11-23 13:13:10,493 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-11-23 13:13:10,493 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 99 transitions. [2018-11-23 13:13:10,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-11-23 13:13:10,494 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:13:10,494 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 8, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:13:10,494 INFO L423 AbstractCegarLoop]: === Iteration 43 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:13:10,494 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:13:10,494 INFO L82 PathProgramCache]: Analyzing trace with hash -1284125265, now seen corresponding path program 7 times [2018-11-23 13:13:10,494 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:13:10,494 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:13:10,495 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:13:10,495 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:13:10,495 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:13:10,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:13:11,309 INFO L256 TraceCheckUtils]: 0: Hoare triple {33161#true} call ULTIMATE.init(); {33161#true} is VALID [2018-11-23 13:13:11,310 INFO L273 TraceCheckUtils]: 1: Hoare triple {33161#true} assume true; {33161#true} is VALID [2018-11-23 13:13:11,310 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {33161#true} {33161#true} #66#return; {33161#true} is VALID [2018-11-23 13:13:11,310 INFO L256 TraceCheckUtils]: 3: Hoare triple {33161#true} call #t~ret9 := main(); {33161#true} is VALID [2018-11-23 13:13:11,311 INFO L273 TraceCheckUtils]: 4: Hoare triple {33161#true} havoc ~n0~0;havoc ~n1~0;~i0~0 := 0;~k~0 := 0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n0~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~n1~0 := #t~nondet2;havoc #t~nondet2; {33163#(<= main_~i0~0 0)} is VALID [2018-11-23 13:13:11,311 INFO L273 TraceCheckUtils]: 5: Hoare triple {33163#(<= main_~i0~0 0)} assume !!(-1000000 <= ~n0~0 && ~n0~0 < 1000000); {33163#(<= main_~i0~0 0)} is VALID [2018-11-23 13:13:11,312 INFO L273 TraceCheckUtils]: 6: Hoare triple {33163#(<= main_~i0~0 0)} assume !!(-1000000 <= ~n1~0 && ~n1~0 < 1000000); {33163#(<= main_~i0~0 0)} is VALID [2018-11-23 13:13:11,312 INFO L273 TraceCheckUtils]: 7: Hoare triple {33163#(<= main_~i0~0 0)} assume !!(~i0~0 < ~n0~0);#t~post3 := ~i0~0;~i0~0 := 1 + #t~post3;havoc #t~post3;#t~post4 := ~k~0;~k~0 := 1 + #t~post4;havoc #t~post4; {33164#(<= main_~i0~0 1)} is VALID [2018-11-23 13:13:11,313 INFO L273 TraceCheckUtils]: 8: Hoare triple {33164#(<= main_~i0~0 1)} assume !!(~i0~0 < ~n0~0);#t~post3 := ~i0~0;~i0~0 := 1 + #t~post3;havoc #t~post3;#t~post4 := ~k~0;~k~0 := 1 + #t~post4;havoc #t~post4; {33165#(<= main_~i0~0 2)} is VALID [2018-11-23 13:13:11,313 INFO L273 TraceCheckUtils]: 9: Hoare triple {33165#(<= main_~i0~0 2)} assume !!(~i0~0 < ~n0~0);#t~post3 := ~i0~0;~i0~0 := 1 + #t~post3;havoc #t~post3;#t~post4 := ~k~0;~k~0 := 1 + #t~post4;havoc #t~post4; {33166#(<= main_~i0~0 3)} is VALID [2018-11-23 13:13:11,314 INFO L273 TraceCheckUtils]: 10: Hoare triple {33166#(<= main_~i0~0 3)} assume !!(~i0~0 < ~n0~0);#t~post3 := ~i0~0;~i0~0 := 1 + #t~post3;havoc #t~post3;#t~post4 := ~k~0;~k~0 := 1 + #t~post4;havoc #t~post4; {33167#(<= main_~i0~0 4)} is VALID [2018-11-23 13:13:11,315 INFO L273 TraceCheckUtils]: 11: Hoare triple {33167#(<= main_~i0~0 4)} assume !!(~i0~0 < ~n0~0);#t~post3 := ~i0~0;~i0~0 := 1 + #t~post3;havoc #t~post3;#t~post4 := ~k~0;~k~0 := 1 + #t~post4;havoc #t~post4; {33168#(<= main_~i0~0 5)} is VALID [2018-11-23 13:13:11,316 INFO L273 TraceCheckUtils]: 12: Hoare triple {33168#(<= main_~i0~0 5)} assume !!(~i0~0 < ~n0~0);#t~post3 := ~i0~0;~i0~0 := 1 + #t~post3;havoc #t~post3;#t~post4 := ~k~0;~k~0 := 1 + #t~post4;havoc #t~post4; {33169#(<= main_~i0~0 6)} is VALID [2018-11-23 13:13:11,317 INFO L273 TraceCheckUtils]: 13: Hoare triple {33169#(<= main_~i0~0 6)} assume !!(~i0~0 < ~n0~0);#t~post3 := ~i0~0;~i0~0 := 1 + #t~post3;havoc #t~post3;#t~post4 := ~k~0;~k~0 := 1 + #t~post4;havoc #t~post4; {33170#(<= main_~i0~0 7)} is VALID [2018-11-23 13:13:11,317 INFO L273 TraceCheckUtils]: 14: Hoare triple {33170#(<= main_~i0~0 7)} assume !(~i0~0 < ~n0~0); {33171#(<= main_~n0~0 7)} is VALID [2018-11-23 13:13:11,318 INFO L273 TraceCheckUtils]: 15: Hoare triple {33171#(<= main_~n0~0 7)} ~i1~0 := 0; {33172#(<= (+ main_~i1~0 main_~n0~0) 7)} is VALID [2018-11-23 13:13:11,319 INFO L273 TraceCheckUtils]: 16: Hoare triple {33172#(<= (+ main_~i1~0 main_~n0~0) 7)} assume !(~i1~0 < ~n1~0); {33173#(<= (+ main_~n0~0 main_~n1~0) 7)} is VALID [2018-11-23 13:13:11,319 INFO L273 TraceCheckUtils]: 17: Hoare triple {33173#(<= (+ main_~n0~0 main_~n1~0) 7)} ~j1~0 := 0; {33174#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 7))} is VALID [2018-11-23 13:13:11,320 INFO L273 TraceCheckUtils]: 18: Hoare triple {33174#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 7))} assume !!(~j1~0 < ~n0~0 + ~n1~0); {33174#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 7))} is VALID [2018-11-23 13:13:11,320 INFO L256 TraceCheckUtils]: 19: Hoare triple {33174#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 7))} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {33161#true} is VALID [2018-11-23 13:13:11,320 INFO L273 TraceCheckUtils]: 20: Hoare triple {33161#true} ~cond := #in~cond; {33161#true} is VALID [2018-11-23 13:13:11,321 INFO L273 TraceCheckUtils]: 21: Hoare triple {33161#true} assume !(0 == ~cond); {33161#true} is VALID [2018-11-23 13:13:11,321 INFO L273 TraceCheckUtils]: 22: Hoare triple {33161#true} assume true; {33161#true} is VALID [2018-11-23 13:13:11,322 INFO L268 TraceCheckUtils]: 23: Hoare quadruple {33161#true} {33174#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 7))} #70#return; {33174#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 7))} is VALID [2018-11-23 13:13:11,323 INFO L273 TraceCheckUtils]: 24: Hoare triple {33174#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 7))} #t~post7 := ~j1~0;~j1~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~k~0;~k~0 := #t~post8 - 1;havoc #t~post8; {33175#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 6))} is VALID [2018-11-23 13:13:11,323 INFO L273 TraceCheckUtils]: 25: Hoare triple {33175#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 6))} assume !!(~j1~0 < ~n0~0 + ~n1~0); {33175#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 6))} is VALID [2018-11-23 13:13:11,324 INFO L256 TraceCheckUtils]: 26: Hoare triple {33175#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 6))} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {33161#true} is VALID [2018-11-23 13:13:11,324 INFO L273 TraceCheckUtils]: 27: Hoare triple {33161#true} ~cond := #in~cond; {33161#true} is VALID [2018-11-23 13:13:11,324 INFO L273 TraceCheckUtils]: 28: Hoare triple {33161#true} assume !(0 == ~cond); {33161#true} is VALID [2018-11-23 13:13:11,324 INFO L273 TraceCheckUtils]: 29: Hoare triple {33161#true} assume true; {33161#true} is VALID [2018-11-23 13:13:11,325 INFO L268 TraceCheckUtils]: 30: Hoare quadruple {33161#true} {33175#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 6))} #70#return; {33175#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 6))} is VALID [2018-11-23 13:13:11,326 INFO L273 TraceCheckUtils]: 31: Hoare triple {33175#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 6))} #t~post7 := ~j1~0;~j1~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~k~0;~k~0 := #t~post8 - 1;havoc #t~post8; {33176#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 5))} is VALID [2018-11-23 13:13:11,327 INFO L273 TraceCheckUtils]: 32: Hoare triple {33176#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 5))} assume !!(~j1~0 < ~n0~0 + ~n1~0); {33176#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 5))} is VALID [2018-11-23 13:13:11,327 INFO L256 TraceCheckUtils]: 33: Hoare triple {33176#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 5))} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {33161#true} is VALID [2018-11-23 13:13:11,327 INFO L273 TraceCheckUtils]: 34: Hoare triple {33161#true} ~cond := #in~cond; {33161#true} is VALID [2018-11-23 13:13:11,327 INFO L273 TraceCheckUtils]: 35: Hoare triple {33161#true} assume !(0 == ~cond); {33161#true} is VALID [2018-11-23 13:13:11,327 INFO L273 TraceCheckUtils]: 36: Hoare triple {33161#true} assume true; {33161#true} is VALID [2018-11-23 13:13:11,328 INFO L268 TraceCheckUtils]: 37: Hoare quadruple {33161#true} {33176#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 5))} #70#return; {33176#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 5))} is VALID [2018-11-23 13:13:11,329 INFO L273 TraceCheckUtils]: 38: Hoare triple {33176#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 5))} #t~post7 := ~j1~0;~j1~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~k~0;~k~0 := #t~post8 - 1;havoc #t~post8; {33177#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 4))} is VALID [2018-11-23 13:13:11,330 INFO L273 TraceCheckUtils]: 39: Hoare triple {33177#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 4))} assume !!(~j1~0 < ~n0~0 + ~n1~0); {33177#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 4))} is VALID [2018-11-23 13:13:11,330 INFO L256 TraceCheckUtils]: 40: Hoare triple {33177#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 4))} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {33161#true} is VALID [2018-11-23 13:13:11,330 INFO L273 TraceCheckUtils]: 41: Hoare triple {33161#true} ~cond := #in~cond; {33161#true} is VALID [2018-11-23 13:13:11,330 INFO L273 TraceCheckUtils]: 42: Hoare triple {33161#true} assume !(0 == ~cond); {33161#true} is VALID [2018-11-23 13:13:11,330 INFO L273 TraceCheckUtils]: 43: Hoare triple {33161#true} assume true; {33161#true} is VALID [2018-11-23 13:13:11,331 INFO L268 TraceCheckUtils]: 44: Hoare quadruple {33161#true} {33177#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 4))} #70#return; {33177#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 4))} is VALID [2018-11-23 13:13:11,332 INFO L273 TraceCheckUtils]: 45: Hoare triple {33177#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 4))} #t~post7 := ~j1~0;~j1~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~k~0;~k~0 := #t~post8 - 1;havoc #t~post8; {33178#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 3))} is VALID [2018-11-23 13:13:11,333 INFO L273 TraceCheckUtils]: 46: Hoare triple {33178#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 3))} assume !!(~j1~0 < ~n0~0 + ~n1~0); {33178#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 3))} is VALID [2018-11-23 13:13:11,333 INFO L256 TraceCheckUtils]: 47: Hoare triple {33178#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 3))} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {33161#true} is VALID [2018-11-23 13:13:11,333 INFO L273 TraceCheckUtils]: 48: Hoare triple {33161#true} ~cond := #in~cond; {33161#true} is VALID [2018-11-23 13:13:11,333 INFO L273 TraceCheckUtils]: 49: Hoare triple {33161#true} assume !(0 == ~cond); {33161#true} is VALID [2018-11-23 13:13:11,334 INFO L273 TraceCheckUtils]: 50: Hoare triple {33161#true} assume true; {33161#true} is VALID [2018-11-23 13:13:11,335 INFO L268 TraceCheckUtils]: 51: Hoare quadruple {33161#true} {33178#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 3))} #70#return; {33178#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 3))} is VALID [2018-11-23 13:13:11,335 INFO L273 TraceCheckUtils]: 52: Hoare triple {33178#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 3))} #t~post7 := ~j1~0;~j1~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~k~0;~k~0 := #t~post8 - 1;havoc #t~post8; {33179#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 2))} is VALID [2018-11-23 13:13:11,336 INFO L273 TraceCheckUtils]: 53: Hoare triple {33179#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 2))} assume !!(~j1~0 < ~n0~0 + ~n1~0); {33179#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 2))} is VALID [2018-11-23 13:13:11,336 INFO L256 TraceCheckUtils]: 54: Hoare triple {33179#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 2))} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {33161#true} is VALID [2018-11-23 13:13:11,336 INFO L273 TraceCheckUtils]: 55: Hoare triple {33161#true} ~cond := #in~cond; {33161#true} is VALID [2018-11-23 13:13:11,337 INFO L273 TraceCheckUtils]: 56: Hoare triple {33161#true} assume !(0 == ~cond); {33161#true} is VALID [2018-11-23 13:13:11,337 INFO L273 TraceCheckUtils]: 57: Hoare triple {33161#true} assume true; {33161#true} is VALID [2018-11-23 13:13:11,338 INFO L268 TraceCheckUtils]: 58: Hoare quadruple {33161#true} {33179#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 2))} #70#return; {33179#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 2))} is VALID [2018-11-23 13:13:11,339 INFO L273 TraceCheckUtils]: 59: Hoare triple {33179#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 2))} #t~post7 := ~j1~0;~j1~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~k~0;~k~0 := #t~post8 - 1;havoc #t~post8; {33180#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 1))} is VALID [2018-11-23 13:13:11,339 INFO L273 TraceCheckUtils]: 60: Hoare triple {33180#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 1))} assume !!(~j1~0 < ~n0~0 + ~n1~0); {33180#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 1))} is VALID [2018-11-23 13:13:11,339 INFO L256 TraceCheckUtils]: 61: Hoare triple {33180#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 1))} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {33161#true} is VALID [2018-11-23 13:13:11,340 INFO L273 TraceCheckUtils]: 62: Hoare triple {33161#true} ~cond := #in~cond; {33161#true} is VALID [2018-11-23 13:13:11,340 INFO L273 TraceCheckUtils]: 63: Hoare triple {33161#true} assume !(0 == ~cond); {33161#true} is VALID [2018-11-23 13:13:11,340 INFO L273 TraceCheckUtils]: 64: Hoare triple {33161#true} assume true; {33161#true} is VALID [2018-11-23 13:13:11,341 INFO L268 TraceCheckUtils]: 65: Hoare quadruple {33161#true} {33180#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 1))} #70#return; {33180#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 1))} is VALID [2018-11-23 13:13:11,342 INFO L273 TraceCheckUtils]: 66: Hoare triple {33180#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 1))} #t~post7 := ~j1~0;~j1~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~k~0;~k~0 := #t~post8 - 1;havoc #t~post8; {33181#(<= (+ main_~n0~0 main_~n1~0) main_~j1~0)} is VALID [2018-11-23 13:13:11,342 INFO L273 TraceCheckUtils]: 67: Hoare triple {33181#(<= (+ main_~n0~0 main_~n1~0) main_~j1~0)} assume !!(~j1~0 < ~n0~0 + ~n1~0); {33162#false} is VALID [2018-11-23 13:13:11,343 INFO L256 TraceCheckUtils]: 68: Hoare triple {33162#false} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {33162#false} is VALID [2018-11-23 13:13:11,343 INFO L273 TraceCheckUtils]: 69: Hoare triple {33162#false} ~cond := #in~cond; {33162#false} is VALID [2018-11-23 13:13:11,343 INFO L273 TraceCheckUtils]: 70: Hoare triple {33162#false} assume 0 == ~cond; {33162#false} is VALID [2018-11-23 13:13:11,343 INFO L273 TraceCheckUtils]: 71: Hoare triple {33162#false} assume !false; {33162#false} is VALID [2018-11-23 13:13:11,381 INFO L134 CoverageAnalysis]: Checked inductivity of 203 backedges. 91 proven. 28 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2018-11-23 13:13:11,381 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:13:11,381 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:13:11,394 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:13:11,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:13:11,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:13:11,433 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:13:11,926 INFO L256 TraceCheckUtils]: 0: Hoare triple {33161#true} call ULTIMATE.init(); {33161#true} is VALID [2018-11-23 13:13:11,927 INFO L273 TraceCheckUtils]: 1: Hoare triple {33161#true} assume true; {33161#true} is VALID [2018-11-23 13:13:11,927 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {33161#true} {33161#true} #66#return; {33161#true} is VALID [2018-11-23 13:13:11,927 INFO L256 TraceCheckUtils]: 3: Hoare triple {33161#true} call #t~ret9 := main(); {33161#true} is VALID [2018-11-23 13:13:11,928 INFO L273 TraceCheckUtils]: 4: Hoare triple {33161#true} havoc ~n0~0;havoc ~n1~0;~i0~0 := 0;~k~0 := 0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n0~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~n1~0 := #t~nondet2;havoc #t~nondet2; {33163#(<= main_~i0~0 0)} is VALID [2018-11-23 13:13:11,928 INFO L273 TraceCheckUtils]: 5: Hoare triple {33163#(<= main_~i0~0 0)} assume !!(-1000000 <= ~n0~0 && ~n0~0 < 1000000); {33163#(<= main_~i0~0 0)} is VALID [2018-11-23 13:13:11,929 INFO L273 TraceCheckUtils]: 6: Hoare triple {33163#(<= main_~i0~0 0)} assume !!(-1000000 <= ~n1~0 && ~n1~0 < 1000000); {33163#(<= main_~i0~0 0)} is VALID [2018-11-23 13:13:11,930 INFO L273 TraceCheckUtils]: 7: Hoare triple {33163#(<= main_~i0~0 0)} assume !!(~i0~0 < ~n0~0);#t~post3 := ~i0~0;~i0~0 := 1 + #t~post3;havoc #t~post3;#t~post4 := ~k~0;~k~0 := 1 + #t~post4;havoc #t~post4; {33164#(<= main_~i0~0 1)} is VALID [2018-11-23 13:13:11,930 INFO L273 TraceCheckUtils]: 8: Hoare triple {33164#(<= main_~i0~0 1)} assume !!(~i0~0 < ~n0~0);#t~post3 := ~i0~0;~i0~0 := 1 + #t~post3;havoc #t~post3;#t~post4 := ~k~0;~k~0 := 1 + #t~post4;havoc #t~post4; {33165#(<= main_~i0~0 2)} is VALID [2018-11-23 13:13:11,931 INFO L273 TraceCheckUtils]: 9: Hoare triple {33165#(<= main_~i0~0 2)} assume !!(~i0~0 < ~n0~0);#t~post3 := ~i0~0;~i0~0 := 1 + #t~post3;havoc #t~post3;#t~post4 := ~k~0;~k~0 := 1 + #t~post4;havoc #t~post4; {33166#(<= main_~i0~0 3)} is VALID [2018-11-23 13:13:11,932 INFO L273 TraceCheckUtils]: 10: Hoare triple {33166#(<= main_~i0~0 3)} assume !!(~i0~0 < ~n0~0);#t~post3 := ~i0~0;~i0~0 := 1 + #t~post3;havoc #t~post3;#t~post4 := ~k~0;~k~0 := 1 + #t~post4;havoc #t~post4; {33167#(<= main_~i0~0 4)} is VALID [2018-11-23 13:13:11,933 INFO L273 TraceCheckUtils]: 11: Hoare triple {33167#(<= main_~i0~0 4)} assume !!(~i0~0 < ~n0~0);#t~post3 := ~i0~0;~i0~0 := 1 + #t~post3;havoc #t~post3;#t~post4 := ~k~0;~k~0 := 1 + #t~post4;havoc #t~post4; {33168#(<= main_~i0~0 5)} is VALID [2018-11-23 13:13:11,934 INFO L273 TraceCheckUtils]: 12: Hoare triple {33168#(<= main_~i0~0 5)} assume !!(~i0~0 < ~n0~0);#t~post3 := ~i0~0;~i0~0 := 1 + #t~post3;havoc #t~post3;#t~post4 := ~k~0;~k~0 := 1 + #t~post4;havoc #t~post4; {33169#(<= main_~i0~0 6)} is VALID [2018-11-23 13:13:11,934 INFO L273 TraceCheckUtils]: 13: Hoare triple {33169#(<= main_~i0~0 6)} assume !!(~i0~0 < ~n0~0);#t~post3 := ~i0~0;~i0~0 := 1 + #t~post3;havoc #t~post3;#t~post4 := ~k~0;~k~0 := 1 + #t~post4;havoc #t~post4; {33170#(<= main_~i0~0 7)} is VALID [2018-11-23 13:13:11,935 INFO L273 TraceCheckUtils]: 14: Hoare triple {33170#(<= main_~i0~0 7)} assume !(~i0~0 < ~n0~0); {33171#(<= main_~n0~0 7)} is VALID [2018-11-23 13:13:11,936 INFO L273 TraceCheckUtils]: 15: Hoare triple {33171#(<= main_~n0~0 7)} ~i1~0 := 0; {33230#(and (<= main_~i1~0 0) (<= main_~n0~0 7))} is VALID [2018-11-23 13:13:11,936 INFO L273 TraceCheckUtils]: 16: Hoare triple {33230#(and (<= main_~i1~0 0) (<= main_~n0~0 7))} assume !(~i1~0 < ~n1~0); {33234#(and (<= main_~n1~0 0) (<= main_~n0~0 7))} is VALID [2018-11-23 13:13:11,937 INFO L273 TraceCheckUtils]: 17: Hoare triple {33234#(and (<= main_~n1~0 0) (<= main_~n0~0 7))} ~j1~0 := 0; {33238#(and (<= main_~n1~0 0) (<= 0 main_~j1~0) (<= main_~n0~0 7))} is VALID [2018-11-23 13:13:11,938 INFO L273 TraceCheckUtils]: 18: Hoare triple {33238#(and (<= main_~n1~0 0) (<= 0 main_~j1~0) (<= main_~n0~0 7))} assume !!(~j1~0 < ~n0~0 + ~n1~0); {33238#(and (<= main_~n1~0 0) (<= 0 main_~j1~0) (<= main_~n0~0 7))} is VALID [2018-11-23 13:13:11,938 INFO L256 TraceCheckUtils]: 19: Hoare triple {33238#(and (<= main_~n1~0 0) (<= 0 main_~j1~0) (<= main_~n0~0 7))} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {33161#true} is VALID [2018-11-23 13:13:11,938 INFO L273 TraceCheckUtils]: 20: Hoare triple {33161#true} ~cond := #in~cond; {33161#true} is VALID [2018-11-23 13:13:11,938 INFO L273 TraceCheckUtils]: 21: Hoare triple {33161#true} assume !(0 == ~cond); {33161#true} is VALID [2018-11-23 13:13:11,938 INFO L273 TraceCheckUtils]: 22: Hoare triple {33161#true} assume true; {33161#true} is VALID [2018-11-23 13:13:11,939 INFO L268 TraceCheckUtils]: 23: Hoare quadruple {33161#true} {33238#(and (<= main_~n1~0 0) (<= 0 main_~j1~0) (<= main_~n0~0 7))} #70#return; {33238#(and (<= main_~n1~0 0) (<= 0 main_~j1~0) (<= main_~n0~0 7))} is VALID [2018-11-23 13:13:11,940 INFO L273 TraceCheckUtils]: 24: Hoare triple {33238#(and (<= main_~n1~0 0) (<= 0 main_~j1~0) (<= main_~n0~0 7))} #t~post7 := ~j1~0;~j1~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~k~0;~k~0 := #t~post8 - 1;havoc #t~post8; {33260#(and (<= main_~n1~0 0) (<= 1 main_~j1~0) (<= main_~n0~0 7))} is VALID [2018-11-23 13:13:11,940 INFO L273 TraceCheckUtils]: 25: Hoare triple {33260#(and (<= main_~n1~0 0) (<= 1 main_~j1~0) (<= main_~n0~0 7))} assume !!(~j1~0 < ~n0~0 + ~n1~0); {33260#(and (<= main_~n1~0 0) (<= 1 main_~j1~0) (<= main_~n0~0 7))} is VALID [2018-11-23 13:13:11,941 INFO L256 TraceCheckUtils]: 26: Hoare triple {33260#(and (<= main_~n1~0 0) (<= 1 main_~j1~0) (<= main_~n0~0 7))} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {33161#true} is VALID [2018-11-23 13:13:11,941 INFO L273 TraceCheckUtils]: 27: Hoare triple {33161#true} ~cond := #in~cond; {33161#true} is VALID [2018-11-23 13:13:11,941 INFO L273 TraceCheckUtils]: 28: Hoare triple {33161#true} assume !(0 == ~cond); {33161#true} is VALID [2018-11-23 13:13:11,941 INFO L273 TraceCheckUtils]: 29: Hoare triple {33161#true} assume true; {33161#true} is VALID [2018-11-23 13:13:11,942 INFO L268 TraceCheckUtils]: 30: Hoare quadruple {33161#true} {33260#(and (<= main_~n1~0 0) (<= 1 main_~j1~0) (<= main_~n0~0 7))} #70#return; {33260#(and (<= main_~n1~0 0) (<= 1 main_~j1~0) (<= main_~n0~0 7))} is VALID [2018-11-23 13:13:11,943 INFO L273 TraceCheckUtils]: 31: Hoare triple {33260#(and (<= main_~n1~0 0) (<= 1 main_~j1~0) (<= main_~n0~0 7))} #t~post7 := ~j1~0;~j1~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~k~0;~k~0 := #t~post8 - 1;havoc #t~post8; {33282#(and (<= main_~n1~0 0) (<= main_~n0~0 7) (<= 2 main_~j1~0))} is VALID [2018-11-23 13:13:11,943 INFO L273 TraceCheckUtils]: 32: Hoare triple {33282#(and (<= main_~n1~0 0) (<= main_~n0~0 7) (<= 2 main_~j1~0))} assume !!(~j1~0 < ~n0~0 + ~n1~0); {33282#(and (<= main_~n1~0 0) (<= main_~n0~0 7) (<= 2 main_~j1~0))} is VALID [2018-11-23 13:13:11,943 INFO L256 TraceCheckUtils]: 33: Hoare triple {33282#(and (<= main_~n1~0 0) (<= main_~n0~0 7) (<= 2 main_~j1~0))} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {33161#true} is VALID [2018-11-23 13:13:11,944 INFO L273 TraceCheckUtils]: 34: Hoare triple {33161#true} ~cond := #in~cond; {33161#true} is VALID [2018-11-23 13:13:11,944 INFO L273 TraceCheckUtils]: 35: Hoare triple {33161#true} assume !(0 == ~cond); {33161#true} is VALID [2018-11-23 13:13:11,944 INFO L273 TraceCheckUtils]: 36: Hoare triple {33161#true} assume true; {33161#true} is VALID [2018-11-23 13:13:11,945 INFO L268 TraceCheckUtils]: 37: Hoare quadruple {33161#true} {33282#(and (<= main_~n1~0 0) (<= main_~n0~0 7) (<= 2 main_~j1~0))} #70#return; {33282#(and (<= main_~n1~0 0) (<= main_~n0~0 7) (<= 2 main_~j1~0))} is VALID [2018-11-23 13:13:11,946 INFO L273 TraceCheckUtils]: 38: Hoare triple {33282#(and (<= main_~n1~0 0) (<= main_~n0~0 7) (<= 2 main_~j1~0))} #t~post7 := ~j1~0;~j1~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~k~0;~k~0 := #t~post8 - 1;havoc #t~post8; {33304#(and (<= main_~n1~0 0) (<= main_~n0~0 7) (<= 3 main_~j1~0))} is VALID [2018-11-23 13:13:11,946 INFO L273 TraceCheckUtils]: 39: Hoare triple {33304#(and (<= main_~n1~0 0) (<= main_~n0~0 7) (<= 3 main_~j1~0))} assume !!(~j1~0 < ~n0~0 + ~n1~0); {33304#(and (<= main_~n1~0 0) (<= main_~n0~0 7) (<= 3 main_~j1~0))} is VALID [2018-11-23 13:13:11,946 INFO L256 TraceCheckUtils]: 40: Hoare triple {33304#(and (<= main_~n1~0 0) (<= main_~n0~0 7) (<= 3 main_~j1~0))} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {33161#true} is VALID [2018-11-23 13:13:11,947 INFO L273 TraceCheckUtils]: 41: Hoare triple {33161#true} ~cond := #in~cond; {33161#true} is VALID [2018-11-23 13:13:11,947 INFO L273 TraceCheckUtils]: 42: Hoare triple {33161#true} assume !(0 == ~cond); {33161#true} is VALID [2018-11-23 13:13:11,947 INFO L273 TraceCheckUtils]: 43: Hoare triple {33161#true} assume true; {33161#true} is VALID [2018-11-23 13:13:11,948 INFO L268 TraceCheckUtils]: 44: Hoare quadruple {33161#true} {33304#(and (<= main_~n1~0 0) (<= main_~n0~0 7) (<= 3 main_~j1~0))} #70#return; {33304#(and (<= main_~n1~0 0) (<= main_~n0~0 7) (<= 3 main_~j1~0))} is VALID [2018-11-23 13:13:11,948 INFO L273 TraceCheckUtils]: 45: Hoare triple {33304#(and (<= main_~n1~0 0) (<= main_~n0~0 7) (<= 3 main_~j1~0))} #t~post7 := ~j1~0;~j1~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~k~0;~k~0 := #t~post8 - 1;havoc #t~post8; {33326#(and (<= main_~n1~0 0) (<= main_~n0~0 7) (<= 4 main_~j1~0))} is VALID [2018-11-23 13:13:11,949 INFO L273 TraceCheckUtils]: 46: Hoare triple {33326#(and (<= main_~n1~0 0) (<= main_~n0~0 7) (<= 4 main_~j1~0))} assume !!(~j1~0 < ~n0~0 + ~n1~0); {33326#(and (<= main_~n1~0 0) (<= main_~n0~0 7) (<= 4 main_~j1~0))} is VALID [2018-11-23 13:13:11,949 INFO L256 TraceCheckUtils]: 47: Hoare triple {33326#(and (<= main_~n1~0 0) (<= main_~n0~0 7) (<= 4 main_~j1~0))} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {33161#true} is VALID [2018-11-23 13:13:11,949 INFO L273 TraceCheckUtils]: 48: Hoare triple {33161#true} ~cond := #in~cond; {33161#true} is VALID [2018-11-23 13:13:11,950 INFO L273 TraceCheckUtils]: 49: Hoare triple {33161#true} assume !(0 == ~cond); {33161#true} is VALID [2018-11-23 13:13:11,950 INFO L273 TraceCheckUtils]: 50: Hoare triple {33161#true} assume true; {33161#true} is VALID [2018-11-23 13:13:11,950 INFO L268 TraceCheckUtils]: 51: Hoare quadruple {33161#true} {33326#(and (<= main_~n1~0 0) (<= main_~n0~0 7) (<= 4 main_~j1~0))} #70#return; {33326#(and (<= main_~n1~0 0) (<= main_~n0~0 7) (<= 4 main_~j1~0))} is VALID [2018-11-23 13:13:11,951 INFO L273 TraceCheckUtils]: 52: Hoare triple {33326#(and (<= main_~n1~0 0) (<= main_~n0~0 7) (<= 4 main_~j1~0))} #t~post7 := ~j1~0;~j1~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~k~0;~k~0 := #t~post8 - 1;havoc #t~post8; {33348#(and (<= main_~n1~0 0) (<= main_~n0~0 7) (<= 5 main_~j1~0))} is VALID [2018-11-23 13:13:11,952 INFO L273 TraceCheckUtils]: 53: Hoare triple {33348#(and (<= main_~n1~0 0) (<= main_~n0~0 7) (<= 5 main_~j1~0))} assume !!(~j1~0 < ~n0~0 + ~n1~0); {33348#(and (<= main_~n1~0 0) (<= main_~n0~0 7) (<= 5 main_~j1~0))} is VALID [2018-11-23 13:13:11,952 INFO L256 TraceCheckUtils]: 54: Hoare triple {33348#(and (<= main_~n1~0 0) (<= main_~n0~0 7) (<= 5 main_~j1~0))} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {33161#true} is VALID [2018-11-23 13:13:11,952 INFO L273 TraceCheckUtils]: 55: Hoare triple {33161#true} ~cond := #in~cond; {33161#true} is VALID [2018-11-23 13:13:11,952 INFO L273 TraceCheckUtils]: 56: Hoare triple {33161#true} assume !(0 == ~cond); {33161#true} is VALID [2018-11-23 13:13:11,953 INFO L273 TraceCheckUtils]: 57: Hoare triple {33161#true} assume true; {33161#true} is VALID [2018-11-23 13:13:11,953 INFO L268 TraceCheckUtils]: 58: Hoare quadruple {33161#true} {33348#(and (<= main_~n1~0 0) (<= main_~n0~0 7) (<= 5 main_~j1~0))} #70#return; {33348#(and (<= main_~n1~0 0) (<= main_~n0~0 7) (<= 5 main_~j1~0))} is VALID [2018-11-23 13:13:11,954 INFO L273 TraceCheckUtils]: 59: Hoare triple {33348#(and (<= main_~n1~0 0) (<= main_~n0~0 7) (<= 5 main_~j1~0))} #t~post7 := ~j1~0;~j1~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~k~0;~k~0 := #t~post8 - 1;havoc #t~post8; {33370#(and (<= main_~n1~0 0) (<= 6 main_~j1~0) (<= main_~n0~0 7))} is VALID [2018-11-23 13:13:11,955 INFO L273 TraceCheckUtils]: 60: Hoare triple {33370#(and (<= main_~n1~0 0) (<= 6 main_~j1~0) (<= main_~n0~0 7))} assume !!(~j1~0 < ~n0~0 + ~n1~0); {33370#(and (<= main_~n1~0 0) (<= 6 main_~j1~0) (<= main_~n0~0 7))} is VALID [2018-11-23 13:13:11,955 INFO L256 TraceCheckUtils]: 61: Hoare triple {33370#(and (<= main_~n1~0 0) (<= 6 main_~j1~0) (<= main_~n0~0 7))} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {33161#true} is VALID [2018-11-23 13:13:11,955 INFO L273 TraceCheckUtils]: 62: Hoare triple {33161#true} ~cond := #in~cond; {33161#true} is VALID [2018-11-23 13:13:11,955 INFO L273 TraceCheckUtils]: 63: Hoare triple {33161#true} assume !(0 == ~cond); {33161#true} is VALID [2018-11-23 13:13:11,956 INFO L273 TraceCheckUtils]: 64: Hoare triple {33161#true} assume true; {33161#true} is VALID [2018-11-23 13:13:11,956 INFO L268 TraceCheckUtils]: 65: Hoare quadruple {33161#true} {33370#(and (<= main_~n1~0 0) (<= 6 main_~j1~0) (<= main_~n0~0 7))} #70#return; {33370#(and (<= main_~n1~0 0) (<= 6 main_~j1~0) (<= main_~n0~0 7))} is VALID [2018-11-23 13:13:11,957 INFO L273 TraceCheckUtils]: 66: Hoare triple {33370#(and (<= main_~n1~0 0) (<= 6 main_~j1~0) (<= main_~n0~0 7))} #t~post7 := ~j1~0;~j1~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~k~0;~k~0 := #t~post8 - 1;havoc #t~post8; {33392#(and (<= main_~n1~0 0) (<= main_~n0~0 7) (<= 7 main_~j1~0))} is VALID [2018-11-23 13:13:11,958 INFO L273 TraceCheckUtils]: 67: Hoare triple {33392#(and (<= main_~n1~0 0) (<= main_~n0~0 7) (<= 7 main_~j1~0))} assume !!(~j1~0 < ~n0~0 + ~n1~0); {33162#false} is VALID [2018-11-23 13:13:11,958 INFO L256 TraceCheckUtils]: 68: Hoare triple {33162#false} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {33162#false} is VALID [2018-11-23 13:13:11,958 INFO L273 TraceCheckUtils]: 69: Hoare triple {33162#false} ~cond := #in~cond; {33162#false} is VALID [2018-11-23 13:13:11,958 INFO L273 TraceCheckUtils]: 70: Hoare triple {33162#false} assume 0 == ~cond; {33162#false} is VALID [2018-11-23 13:13:11,958 INFO L273 TraceCheckUtils]: 71: Hoare triple {33162#false} assume !false; {33162#false} is VALID [2018-11-23 13:13:11,965 INFO L134 CoverageAnalysis]: Checked inductivity of 203 backedges. 91 proven. 28 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2018-11-23 13:13:11,984 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:13:11,985 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 31 [2018-11-23 13:13:11,985 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 72 [2018-11-23 13:13:11,985 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:13:11,985 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 31 states. [2018-11-23 13:13:12,081 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 86 edges. 86 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:13:12,081 INFO L459 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-11-23 13:13:12,082 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-11-23 13:13:12,082 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=207, Invalid=723, Unknown=0, NotChecked=0, Total=930 [2018-11-23 13:13:12,082 INFO L87 Difference]: Start difference. First operand 90 states and 99 transitions. Second operand 31 states. [2018-11-23 13:13:17,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:13:17,406 INFO L93 Difference]: Finished difference Result 352 states and 442 transitions. [2018-11-23 13:13:17,407 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-11-23 13:13:17,407 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 72 [2018-11-23 13:13:17,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:13:17,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-11-23 13:13:17,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 150 transitions. [2018-11-23 13:13:17,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-11-23 13:13:17,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 150 transitions. [2018-11-23 13:13:17,410 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 35 states and 150 transitions. [2018-11-23 13:13:17,599 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 150 edges. 150 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:13:17,609 INFO L225 Difference]: With dead ends: 352 [2018-11-23 13:13:17,609 INFO L226 Difference]: Without dead ends: 320 [2018-11-23 13:13:17,610 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 785 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=633, Invalid=2447, Unknown=0, NotChecked=0, Total=3080 [2018-11-23 13:13:17,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2018-11-23 13:13:18,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 92. [2018-11-23 13:13:18,188 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:13:18,188 INFO L82 GeneralOperation]: Start isEquivalent. First operand 320 states. Second operand 92 states. [2018-11-23 13:13:18,188 INFO L74 IsIncluded]: Start isIncluded. First operand 320 states. Second operand 92 states. [2018-11-23 13:13:18,188 INFO L87 Difference]: Start difference. First operand 320 states. Second operand 92 states. [2018-11-23 13:13:18,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:13:18,196 INFO L93 Difference]: Finished difference Result 320 states and 402 transitions. [2018-11-23 13:13:18,196 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 402 transitions. [2018-11-23 13:13:18,196 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:13:18,196 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:13:18,197 INFO L74 IsIncluded]: Start isIncluded. First operand 92 states. Second operand 320 states. [2018-11-23 13:13:18,197 INFO L87 Difference]: Start difference. First operand 92 states. Second operand 320 states. [2018-11-23 13:13:18,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:13:18,203 INFO L93 Difference]: Finished difference Result 320 states and 402 transitions. [2018-11-23 13:13:18,203 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 402 transitions. [2018-11-23 13:13:18,204 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:13:18,204 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:13:18,204 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:13:18,204 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:13:18,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2018-11-23 13:13:18,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 102 transitions. [2018-11-23 13:13:18,205 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 102 transitions. Word has length 72 [2018-11-23 13:13:18,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:13:18,205 INFO L480 AbstractCegarLoop]: Abstraction has 92 states and 102 transitions. [2018-11-23 13:13:18,205 INFO L481 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-11-23 13:13:18,205 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 102 transitions. [2018-11-23 13:13:18,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-11-23 13:13:18,206 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:13:18,206 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:13:18,206 INFO L423 AbstractCegarLoop]: === Iteration 44 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:13:18,206 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:13:18,206 INFO L82 PathProgramCache]: Analyzing trace with hash 1709472552, now seen corresponding path program 14 times [2018-11-23 13:13:18,206 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:13:18,207 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:13:18,207 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:13:18,207 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:13:18,207 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:13:18,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:13:18,662 INFO L256 TraceCheckUtils]: 0: Hoare triple {34815#true} call ULTIMATE.init(); {34815#true} is VALID [2018-11-23 13:13:18,662 INFO L273 TraceCheckUtils]: 1: Hoare triple {34815#true} assume true; {34815#true} is VALID [2018-11-23 13:13:18,662 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {34815#true} {34815#true} #66#return; {34815#true} is VALID [2018-11-23 13:13:18,663 INFO L256 TraceCheckUtils]: 3: Hoare triple {34815#true} call #t~ret9 := main(); {34815#true} is VALID [2018-11-23 13:13:18,663 INFO L273 TraceCheckUtils]: 4: Hoare triple {34815#true} havoc ~n0~0;havoc ~n1~0;~i0~0 := 0;~k~0 := 0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n0~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~n1~0 := #t~nondet2;havoc #t~nondet2; {34817#(<= 0 main_~k~0)} is VALID [2018-11-23 13:13:18,664 INFO L273 TraceCheckUtils]: 5: Hoare triple {34817#(<= 0 main_~k~0)} assume !!(-1000000 <= ~n0~0 && ~n0~0 < 1000000); {34817#(<= 0 main_~k~0)} is VALID [2018-11-23 13:13:18,664 INFO L273 TraceCheckUtils]: 6: Hoare triple {34817#(<= 0 main_~k~0)} assume !!(-1000000 <= ~n1~0 && ~n1~0 < 1000000); {34817#(<= 0 main_~k~0)} is VALID [2018-11-23 13:13:18,665 INFO L273 TraceCheckUtils]: 7: Hoare triple {34817#(<= 0 main_~k~0)} assume !(~i0~0 < ~n0~0); {34817#(<= 0 main_~k~0)} is VALID [2018-11-23 13:13:18,665 INFO L273 TraceCheckUtils]: 8: Hoare triple {34817#(<= 0 main_~k~0)} ~i1~0 := 0; {34817#(<= 0 main_~k~0)} is VALID [2018-11-23 13:13:18,666 INFO L273 TraceCheckUtils]: 9: Hoare triple {34817#(<= 0 main_~k~0)} assume !!(~i1~0 < ~n1~0);#t~post5 := ~i1~0;~i1~0 := 1 + #t~post5;havoc #t~post5;#t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {34818#(<= 1 main_~k~0)} is VALID [2018-11-23 13:13:18,667 INFO L273 TraceCheckUtils]: 10: Hoare triple {34818#(<= 1 main_~k~0)} assume !!(~i1~0 < ~n1~0);#t~post5 := ~i1~0;~i1~0 := 1 + #t~post5;havoc #t~post5;#t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {34819#(<= 2 main_~k~0)} is VALID [2018-11-23 13:13:18,667 INFO L273 TraceCheckUtils]: 11: Hoare triple {34819#(<= 2 main_~k~0)} assume !!(~i1~0 < ~n1~0);#t~post5 := ~i1~0;~i1~0 := 1 + #t~post5;havoc #t~post5;#t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {34820#(<= 3 main_~k~0)} is VALID [2018-11-23 13:13:18,668 INFO L273 TraceCheckUtils]: 12: Hoare triple {34820#(<= 3 main_~k~0)} assume !!(~i1~0 < ~n1~0);#t~post5 := ~i1~0;~i1~0 := 1 + #t~post5;havoc #t~post5;#t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {34821#(<= 4 main_~k~0)} is VALID [2018-11-23 13:13:18,669 INFO L273 TraceCheckUtils]: 13: Hoare triple {34821#(<= 4 main_~k~0)} assume !!(~i1~0 < ~n1~0);#t~post5 := ~i1~0;~i1~0 := 1 + #t~post5;havoc #t~post5;#t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {34822#(<= 5 main_~k~0)} is VALID [2018-11-23 13:13:18,670 INFO L273 TraceCheckUtils]: 14: Hoare triple {34822#(<= 5 main_~k~0)} assume !!(~i1~0 < ~n1~0);#t~post5 := ~i1~0;~i1~0 := 1 + #t~post5;havoc #t~post5;#t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {34823#(<= 6 main_~k~0)} is VALID [2018-11-23 13:13:18,671 INFO L273 TraceCheckUtils]: 15: Hoare triple {34823#(<= 6 main_~k~0)} assume !!(~i1~0 < ~n1~0);#t~post5 := ~i1~0;~i1~0 := 1 + #t~post5;havoc #t~post5;#t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {34824#(<= 7 main_~k~0)} is VALID [2018-11-23 13:13:18,671 INFO L273 TraceCheckUtils]: 16: Hoare triple {34824#(<= 7 main_~k~0)} assume !!(~i1~0 < ~n1~0);#t~post5 := ~i1~0;~i1~0 := 1 + #t~post5;havoc #t~post5;#t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {34825#(<= 8 main_~k~0)} is VALID [2018-11-23 13:13:18,672 INFO L273 TraceCheckUtils]: 17: Hoare triple {34825#(<= 8 main_~k~0)} assume !(~i1~0 < ~n1~0); {34825#(<= 8 main_~k~0)} is VALID [2018-11-23 13:13:18,672 INFO L273 TraceCheckUtils]: 18: Hoare triple {34825#(<= 8 main_~k~0)} ~j1~0 := 0; {34825#(<= 8 main_~k~0)} is VALID [2018-11-23 13:13:18,673 INFO L273 TraceCheckUtils]: 19: Hoare triple {34825#(<= 8 main_~k~0)} assume !!(~j1~0 < ~n0~0 + ~n1~0); {34825#(<= 8 main_~k~0)} is VALID [2018-11-23 13:13:18,673 INFO L256 TraceCheckUtils]: 20: Hoare triple {34825#(<= 8 main_~k~0)} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {34815#true} is VALID [2018-11-23 13:13:18,673 INFO L273 TraceCheckUtils]: 21: Hoare triple {34815#true} ~cond := #in~cond; {34826#(= __VERIFIER_assert_~cond |__VERIFIER_assert_#in~cond|)} is VALID [2018-11-23 13:13:18,674 INFO L273 TraceCheckUtils]: 22: Hoare triple {34826#(= __VERIFIER_assert_~cond |__VERIFIER_assert_#in~cond|)} assume !(0 == ~cond); {34827#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2018-11-23 13:13:18,675 INFO L273 TraceCheckUtils]: 23: Hoare triple {34827#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {34827#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2018-11-23 13:13:18,675 INFO L268 TraceCheckUtils]: 24: Hoare quadruple {34827#(not (= |__VERIFIER_assert_#in~cond| 0))} {34825#(<= 8 main_~k~0)} #70#return; {34825#(<= 8 main_~k~0)} is VALID [2018-11-23 13:13:18,676 INFO L273 TraceCheckUtils]: 25: Hoare triple {34825#(<= 8 main_~k~0)} #t~post7 := ~j1~0;~j1~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~k~0;~k~0 := #t~post8 - 1;havoc #t~post8; {34824#(<= 7 main_~k~0)} is VALID [2018-11-23 13:13:18,676 INFO L273 TraceCheckUtils]: 26: Hoare triple {34824#(<= 7 main_~k~0)} assume !!(~j1~0 < ~n0~0 + ~n1~0); {34824#(<= 7 main_~k~0)} is VALID [2018-11-23 13:13:18,677 INFO L256 TraceCheckUtils]: 27: Hoare triple {34824#(<= 7 main_~k~0)} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {34815#true} is VALID [2018-11-23 13:13:18,677 INFO L273 TraceCheckUtils]: 28: Hoare triple {34815#true} ~cond := #in~cond; {34815#true} is VALID [2018-11-23 13:13:18,677 INFO L273 TraceCheckUtils]: 29: Hoare triple {34815#true} assume !(0 == ~cond); {34815#true} is VALID [2018-11-23 13:13:18,677 INFO L273 TraceCheckUtils]: 30: Hoare triple {34815#true} assume true; {34815#true} is VALID [2018-11-23 13:13:18,678 INFO L268 TraceCheckUtils]: 31: Hoare quadruple {34815#true} {34824#(<= 7 main_~k~0)} #70#return; {34824#(<= 7 main_~k~0)} is VALID [2018-11-23 13:13:18,678 INFO L273 TraceCheckUtils]: 32: Hoare triple {34824#(<= 7 main_~k~0)} #t~post7 := ~j1~0;~j1~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~k~0;~k~0 := #t~post8 - 1;havoc #t~post8; {34823#(<= 6 main_~k~0)} is VALID [2018-11-23 13:13:18,679 INFO L273 TraceCheckUtils]: 33: Hoare triple {34823#(<= 6 main_~k~0)} assume !!(~j1~0 < ~n0~0 + ~n1~0); {34823#(<= 6 main_~k~0)} is VALID [2018-11-23 13:13:18,679 INFO L256 TraceCheckUtils]: 34: Hoare triple {34823#(<= 6 main_~k~0)} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {34815#true} is VALID [2018-11-23 13:13:18,679 INFO L273 TraceCheckUtils]: 35: Hoare triple {34815#true} ~cond := #in~cond; {34815#true} is VALID [2018-11-23 13:13:18,679 INFO L273 TraceCheckUtils]: 36: Hoare triple {34815#true} assume !(0 == ~cond); {34815#true} is VALID [2018-11-23 13:13:18,680 INFO L273 TraceCheckUtils]: 37: Hoare triple {34815#true} assume true; {34815#true} is VALID [2018-11-23 13:13:18,680 INFO L268 TraceCheckUtils]: 38: Hoare quadruple {34815#true} {34823#(<= 6 main_~k~0)} #70#return; {34823#(<= 6 main_~k~0)} is VALID [2018-11-23 13:13:18,681 INFO L273 TraceCheckUtils]: 39: Hoare triple {34823#(<= 6 main_~k~0)} #t~post7 := ~j1~0;~j1~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~k~0;~k~0 := #t~post8 - 1;havoc #t~post8; {34822#(<= 5 main_~k~0)} is VALID [2018-11-23 13:13:18,681 INFO L273 TraceCheckUtils]: 40: Hoare triple {34822#(<= 5 main_~k~0)} assume !!(~j1~0 < ~n0~0 + ~n1~0); {34822#(<= 5 main_~k~0)} is VALID [2018-11-23 13:13:18,682 INFO L256 TraceCheckUtils]: 41: Hoare triple {34822#(<= 5 main_~k~0)} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {34815#true} is VALID [2018-11-23 13:13:18,682 INFO L273 TraceCheckUtils]: 42: Hoare triple {34815#true} ~cond := #in~cond; {34815#true} is VALID [2018-11-23 13:13:18,682 INFO L273 TraceCheckUtils]: 43: Hoare triple {34815#true} assume !(0 == ~cond); {34815#true} is VALID [2018-11-23 13:13:18,682 INFO L273 TraceCheckUtils]: 44: Hoare triple {34815#true} assume true; {34815#true} is VALID [2018-11-23 13:13:18,683 INFO L268 TraceCheckUtils]: 45: Hoare quadruple {34815#true} {34822#(<= 5 main_~k~0)} #70#return; {34822#(<= 5 main_~k~0)} is VALID [2018-11-23 13:13:18,683 INFO L273 TraceCheckUtils]: 46: Hoare triple {34822#(<= 5 main_~k~0)} #t~post7 := ~j1~0;~j1~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~k~0;~k~0 := #t~post8 - 1;havoc #t~post8; {34821#(<= 4 main_~k~0)} is VALID [2018-11-23 13:13:18,684 INFO L273 TraceCheckUtils]: 47: Hoare triple {34821#(<= 4 main_~k~0)} assume !!(~j1~0 < ~n0~0 + ~n1~0); {34821#(<= 4 main_~k~0)} is VALID [2018-11-23 13:13:18,684 INFO L256 TraceCheckUtils]: 48: Hoare triple {34821#(<= 4 main_~k~0)} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {34815#true} is VALID [2018-11-23 13:13:18,684 INFO L273 TraceCheckUtils]: 49: Hoare triple {34815#true} ~cond := #in~cond; {34815#true} is VALID [2018-11-23 13:13:18,684 INFO L273 TraceCheckUtils]: 50: Hoare triple {34815#true} assume !(0 == ~cond); {34815#true} is VALID [2018-11-23 13:13:18,685 INFO L273 TraceCheckUtils]: 51: Hoare triple {34815#true} assume true; {34815#true} is VALID [2018-11-23 13:13:18,685 INFO L268 TraceCheckUtils]: 52: Hoare quadruple {34815#true} {34821#(<= 4 main_~k~0)} #70#return; {34821#(<= 4 main_~k~0)} is VALID [2018-11-23 13:13:18,686 INFO L273 TraceCheckUtils]: 53: Hoare triple {34821#(<= 4 main_~k~0)} #t~post7 := ~j1~0;~j1~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~k~0;~k~0 := #t~post8 - 1;havoc #t~post8; {34820#(<= 3 main_~k~0)} is VALID [2018-11-23 13:13:18,686 INFO L273 TraceCheckUtils]: 54: Hoare triple {34820#(<= 3 main_~k~0)} assume !!(~j1~0 < ~n0~0 + ~n1~0); {34820#(<= 3 main_~k~0)} is VALID [2018-11-23 13:13:18,687 INFO L256 TraceCheckUtils]: 55: Hoare triple {34820#(<= 3 main_~k~0)} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {34815#true} is VALID [2018-11-23 13:13:18,687 INFO L273 TraceCheckUtils]: 56: Hoare triple {34815#true} ~cond := #in~cond; {34815#true} is VALID [2018-11-23 13:13:18,687 INFO L273 TraceCheckUtils]: 57: Hoare triple {34815#true} assume !(0 == ~cond); {34815#true} is VALID [2018-11-23 13:13:18,687 INFO L273 TraceCheckUtils]: 58: Hoare triple {34815#true} assume true; {34815#true} is VALID [2018-11-23 13:13:18,688 INFO L268 TraceCheckUtils]: 59: Hoare quadruple {34815#true} {34820#(<= 3 main_~k~0)} #70#return; {34820#(<= 3 main_~k~0)} is VALID [2018-11-23 13:13:18,688 INFO L273 TraceCheckUtils]: 60: Hoare triple {34820#(<= 3 main_~k~0)} #t~post7 := ~j1~0;~j1~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~k~0;~k~0 := #t~post8 - 1;havoc #t~post8; {34819#(<= 2 main_~k~0)} is VALID [2018-11-23 13:13:18,689 INFO L273 TraceCheckUtils]: 61: Hoare triple {34819#(<= 2 main_~k~0)} assume !!(~j1~0 < ~n0~0 + ~n1~0); {34819#(<= 2 main_~k~0)} is VALID [2018-11-23 13:13:18,689 INFO L256 TraceCheckUtils]: 62: Hoare triple {34819#(<= 2 main_~k~0)} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {34815#true} is VALID [2018-11-23 13:13:18,689 INFO L273 TraceCheckUtils]: 63: Hoare triple {34815#true} ~cond := #in~cond; {34815#true} is VALID [2018-11-23 13:13:18,689 INFO L273 TraceCheckUtils]: 64: Hoare triple {34815#true} assume !(0 == ~cond); {34815#true} is VALID [2018-11-23 13:13:18,689 INFO L273 TraceCheckUtils]: 65: Hoare triple {34815#true} assume true; {34815#true} is VALID [2018-11-23 13:13:18,690 INFO L268 TraceCheckUtils]: 66: Hoare quadruple {34815#true} {34819#(<= 2 main_~k~0)} #70#return; {34819#(<= 2 main_~k~0)} is VALID [2018-11-23 13:13:18,691 INFO L273 TraceCheckUtils]: 67: Hoare triple {34819#(<= 2 main_~k~0)} #t~post7 := ~j1~0;~j1~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~k~0;~k~0 := #t~post8 - 1;havoc #t~post8; {34818#(<= 1 main_~k~0)} is VALID [2018-11-23 13:13:18,691 INFO L273 TraceCheckUtils]: 68: Hoare triple {34818#(<= 1 main_~k~0)} assume !!(~j1~0 < ~n0~0 + ~n1~0); {34818#(<= 1 main_~k~0)} is VALID [2018-11-23 13:13:18,692 INFO L256 TraceCheckUtils]: 69: Hoare triple {34818#(<= 1 main_~k~0)} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {34827#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2018-11-23 13:13:18,693 INFO L273 TraceCheckUtils]: 70: Hoare triple {34827#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {34828#(not (= __VERIFIER_assert_~cond 0))} is VALID [2018-11-23 13:13:18,693 INFO L273 TraceCheckUtils]: 71: Hoare triple {34828#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {34816#false} is VALID [2018-11-23 13:13:18,693 INFO L273 TraceCheckUtils]: 72: Hoare triple {34816#false} assume !false; {34816#false} is VALID [2018-11-23 13:13:18,698 INFO L134 CoverageAnalysis]: Checked inductivity of 211 backedges. 49 proven. 96 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2018-11-23 13:13:18,698 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:13:18,698 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:13:18,707 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 13:13:18,729 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 13:13:18,729 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:13:18,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:13:18,743 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:13:18,909 INFO L256 TraceCheckUtils]: 0: Hoare triple {34815#true} call ULTIMATE.init(); {34815#true} is VALID [2018-11-23 13:13:18,910 INFO L273 TraceCheckUtils]: 1: Hoare triple {34815#true} assume true; {34815#true} is VALID [2018-11-23 13:13:18,910 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {34815#true} {34815#true} #66#return; {34815#true} is VALID [2018-11-23 13:13:18,910 INFO L256 TraceCheckUtils]: 3: Hoare triple {34815#true} call #t~ret9 := main(); {34815#true} is VALID [2018-11-23 13:13:18,911 INFO L273 TraceCheckUtils]: 4: Hoare triple {34815#true} havoc ~n0~0;havoc ~n1~0;~i0~0 := 0;~k~0 := 0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n0~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~n1~0 := #t~nondet2;havoc #t~nondet2; {34817#(<= 0 main_~k~0)} is VALID [2018-11-23 13:13:18,911 INFO L273 TraceCheckUtils]: 5: Hoare triple {34817#(<= 0 main_~k~0)} assume !!(-1000000 <= ~n0~0 && ~n0~0 < 1000000); {34817#(<= 0 main_~k~0)} is VALID [2018-11-23 13:13:18,912 INFO L273 TraceCheckUtils]: 6: Hoare triple {34817#(<= 0 main_~k~0)} assume !!(-1000000 <= ~n1~0 && ~n1~0 < 1000000); {34817#(<= 0 main_~k~0)} is VALID [2018-11-23 13:13:18,912 INFO L273 TraceCheckUtils]: 7: Hoare triple {34817#(<= 0 main_~k~0)} assume !(~i0~0 < ~n0~0); {34817#(<= 0 main_~k~0)} is VALID [2018-11-23 13:13:18,912 INFO L273 TraceCheckUtils]: 8: Hoare triple {34817#(<= 0 main_~k~0)} ~i1~0 := 0; {34817#(<= 0 main_~k~0)} is VALID [2018-11-23 13:13:18,913 INFO L273 TraceCheckUtils]: 9: Hoare triple {34817#(<= 0 main_~k~0)} assume !!(~i1~0 < ~n1~0);#t~post5 := ~i1~0;~i1~0 := 1 + #t~post5;havoc #t~post5;#t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {34818#(<= 1 main_~k~0)} is VALID [2018-11-23 13:13:18,913 INFO L273 TraceCheckUtils]: 10: Hoare triple {34818#(<= 1 main_~k~0)} assume !!(~i1~0 < ~n1~0);#t~post5 := ~i1~0;~i1~0 := 1 + #t~post5;havoc #t~post5;#t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {34819#(<= 2 main_~k~0)} is VALID [2018-11-23 13:13:18,914 INFO L273 TraceCheckUtils]: 11: Hoare triple {34819#(<= 2 main_~k~0)} assume !!(~i1~0 < ~n1~0);#t~post5 := ~i1~0;~i1~0 := 1 + #t~post5;havoc #t~post5;#t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {34820#(<= 3 main_~k~0)} is VALID [2018-11-23 13:13:18,914 INFO L273 TraceCheckUtils]: 12: Hoare triple {34820#(<= 3 main_~k~0)} assume !!(~i1~0 < ~n1~0);#t~post5 := ~i1~0;~i1~0 := 1 + #t~post5;havoc #t~post5;#t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {34821#(<= 4 main_~k~0)} is VALID [2018-11-23 13:13:18,915 INFO L273 TraceCheckUtils]: 13: Hoare triple {34821#(<= 4 main_~k~0)} assume !!(~i1~0 < ~n1~0);#t~post5 := ~i1~0;~i1~0 := 1 + #t~post5;havoc #t~post5;#t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {34822#(<= 5 main_~k~0)} is VALID [2018-11-23 13:13:18,916 INFO L273 TraceCheckUtils]: 14: Hoare triple {34822#(<= 5 main_~k~0)} assume !!(~i1~0 < ~n1~0);#t~post5 := ~i1~0;~i1~0 := 1 + #t~post5;havoc #t~post5;#t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {34823#(<= 6 main_~k~0)} is VALID [2018-11-23 13:13:18,916 INFO L273 TraceCheckUtils]: 15: Hoare triple {34823#(<= 6 main_~k~0)} assume !!(~i1~0 < ~n1~0);#t~post5 := ~i1~0;~i1~0 := 1 + #t~post5;havoc #t~post5;#t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {34824#(<= 7 main_~k~0)} is VALID [2018-11-23 13:13:18,917 INFO L273 TraceCheckUtils]: 16: Hoare triple {34824#(<= 7 main_~k~0)} assume !!(~i1~0 < ~n1~0);#t~post5 := ~i1~0;~i1~0 := 1 + #t~post5;havoc #t~post5;#t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {34825#(<= 8 main_~k~0)} is VALID [2018-11-23 13:13:18,918 INFO L273 TraceCheckUtils]: 17: Hoare triple {34825#(<= 8 main_~k~0)} assume !(~i1~0 < ~n1~0); {34825#(<= 8 main_~k~0)} is VALID [2018-11-23 13:13:18,918 INFO L273 TraceCheckUtils]: 18: Hoare triple {34825#(<= 8 main_~k~0)} ~j1~0 := 0; {34825#(<= 8 main_~k~0)} is VALID [2018-11-23 13:13:18,919 INFO L273 TraceCheckUtils]: 19: Hoare triple {34825#(<= 8 main_~k~0)} assume !!(~j1~0 < ~n0~0 + ~n1~0); {34825#(<= 8 main_~k~0)} is VALID [2018-11-23 13:13:18,919 INFO L256 TraceCheckUtils]: 20: Hoare triple {34825#(<= 8 main_~k~0)} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {34815#true} is VALID [2018-11-23 13:13:18,919 INFO L273 TraceCheckUtils]: 21: Hoare triple {34815#true} ~cond := #in~cond; {34815#true} is VALID [2018-11-23 13:13:18,919 INFO L273 TraceCheckUtils]: 22: Hoare triple {34815#true} assume !(0 == ~cond); {34815#true} is VALID [2018-11-23 13:13:18,919 INFO L273 TraceCheckUtils]: 23: Hoare triple {34815#true} assume true; {34815#true} is VALID [2018-11-23 13:13:18,920 INFO L268 TraceCheckUtils]: 24: Hoare quadruple {34815#true} {34825#(<= 8 main_~k~0)} #70#return; {34825#(<= 8 main_~k~0)} is VALID [2018-11-23 13:13:18,921 INFO L273 TraceCheckUtils]: 25: Hoare triple {34825#(<= 8 main_~k~0)} #t~post7 := ~j1~0;~j1~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~k~0;~k~0 := #t~post8 - 1;havoc #t~post8; {34824#(<= 7 main_~k~0)} is VALID [2018-11-23 13:13:18,921 INFO L273 TraceCheckUtils]: 26: Hoare triple {34824#(<= 7 main_~k~0)} assume !!(~j1~0 < ~n0~0 + ~n1~0); {34824#(<= 7 main_~k~0)} is VALID [2018-11-23 13:13:18,921 INFO L256 TraceCheckUtils]: 27: Hoare triple {34824#(<= 7 main_~k~0)} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {34815#true} is VALID [2018-11-23 13:13:18,921 INFO L273 TraceCheckUtils]: 28: Hoare triple {34815#true} ~cond := #in~cond; {34815#true} is VALID [2018-11-23 13:13:18,921 INFO L273 TraceCheckUtils]: 29: Hoare triple {34815#true} assume !(0 == ~cond); {34815#true} is VALID [2018-11-23 13:13:18,921 INFO L273 TraceCheckUtils]: 30: Hoare triple {34815#true} assume true; {34815#true} is VALID [2018-11-23 13:13:18,922 INFO L268 TraceCheckUtils]: 31: Hoare quadruple {34815#true} {34824#(<= 7 main_~k~0)} #70#return; {34824#(<= 7 main_~k~0)} is VALID [2018-11-23 13:13:18,922 INFO L273 TraceCheckUtils]: 32: Hoare triple {34824#(<= 7 main_~k~0)} #t~post7 := ~j1~0;~j1~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~k~0;~k~0 := #t~post8 - 1;havoc #t~post8; {34823#(<= 6 main_~k~0)} is VALID [2018-11-23 13:13:18,923 INFO L273 TraceCheckUtils]: 33: Hoare triple {34823#(<= 6 main_~k~0)} assume !!(~j1~0 < ~n0~0 + ~n1~0); {34823#(<= 6 main_~k~0)} is VALID [2018-11-23 13:13:18,923 INFO L256 TraceCheckUtils]: 34: Hoare triple {34823#(<= 6 main_~k~0)} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {34815#true} is VALID [2018-11-23 13:13:18,923 INFO L273 TraceCheckUtils]: 35: Hoare triple {34815#true} ~cond := #in~cond; {34815#true} is VALID [2018-11-23 13:13:18,923 INFO L273 TraceCheckUtils]: 36: Hoare triple {34815#true} assume !(0 == ~cond); {34815#true} is VALID [2018-11-23 13:13:18,923 INFO L273 TraceCheckUtils]: 37: Hoare triple {34815#true} assume true; {34815#true} is VALID [2018-11-23 13:13:18,924 INFO L268 TraceCheckUtils]: 38: Hoare quadruple {34815#true} {34823#(<= 6 main_~k~0)} #70#return; {34823#(<= 6 main_~k~0)} is VALID [2018-11-23 13:13:18,925 INFO L273 TraceCheckUtils]: 39: Hoare triple {34823#(<= 6 main_~k~0)} #t~post7 := ~j1~0;~j1~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~k~0;~k~0 := #t~post8 - 1;havoc #t~post8; {34822#(<= 5 main_~k~0)} is VALID [2018-11-23 13:13:18,925 INFO L273 TraceCheckUtils]: 40: Hoare triple {34822#(<= 5 main_~k~0)} assume !!(~j1~0 < ~n0~0 + ~n1~0); {34822#(<= 5 main_~k~0)} is VALID [2018-11-23 13:13:18,926 INFO L256 TraceCheckUtils]: 41: Hoare triple {34822#(<= 5 main_~k~0)} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {34815#true} is VALID [2018-11-23 13:13:18,926 INFO L273 TraceCheckUtils]: 42: Hoare triple {34815#true} ~cond := #in~cond; {34815#true} is VALID [2018-11-23 13:13:18,926 INFO L273 TraceCheckUtils]: 43: Hoare triple {34815#true} assume !(0 == ~cond); {34815#true} is VALID [2018-11-23 13:13:18,926 INFO L273 TraceCheckUtils]: 44: Hoare triple {34815#true} assume true; {34815#true} is VALID [2018-11-23 13:13:18,927 INFO L268 TraceCheckUtils]: 45: Hoare quadruple {34815#true} {34822#(<= 5 main_~k~0)} #70#return; {34822#(<= 5 main_~k~0)} is VALID [2018-11-23 13:13:18,928 INFO L273 TraceCheckUtils]: 46: Hoare triple {34822#(<= 5 main_~k~0)} #t~post7 := ~j1~0;~j1~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~k~0;~k~0 := #t~post8 - 1;havoc #t~post8; {34821#(<= 4 main_~k~0)} is VALID [2018-11-23 13:13:18,928 INFO L273 TraceCheckUtils]: 47: Hoare triple {34821#(<= 4 main_~k~0)} assume !!(~j1~0 < ~n0~0 + ~n1~0); {34821#(<= 4 main_~k~0)} is VALID [2018-11-23 13:13:18,928 INFO L256 TraceCheckUtils]: 48: Hoare triple {34821#(<= 4 main_~k~0)} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {34815#true} is VALID [2018-11-23 13:13:18,928 INFO L273 TraceCheckUtils]: 49: Hoare triple {34815#true} ~cond := #in~cond; {34815#true} is VALID [2018-11-23 13:13:18,929 INFO L273 TraceCheckUtils]: 50: Hoare triple {34815#true} assume !(0 == ~cond); {34815#true} is VALID [2018-11-23 13:13:18,929 INFO L273 TraceCheckUtils]: 51: Hoare triple {34815#true} assume true; {34815#true} is VALID [2018-11-23 13:13:18,929 INFO L268 TraceCheckUtils]: 52: Hoare quadruple {34815#true} {34821#(<= 4 main_~k~0)} #70#return; {34821#(<= 4 main_~k~0)} is VALID [2018-11-23 13:13:18,930 INFO L273 TraceCheckUtils]: 53: Hoare triple {34821#(<= 4 main_~k~0)} #t~post7 := ~j1~0;~j1~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~k~0;~k~0 := #t~post8 - 1;havoc #t~post8; {34820#(<= 3 main_~k~0)} is VALID [2018-11-23 13:13:18,931 INFO L273 TraceCheckUtils]: 54: Hoare triple {34820#(<= 3 main_~k~0)} assume !!(~j1~0 < ~n0~0 + ~n1~0); {34820#(<= 3 main_~k~0)} is VALID [2018-11-23 13:13:18,931 INFO L256 TraceCheckUtils]: 55: Hoare triple {34820#(<= 3 main_~k~0)} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {34815#true} is VALID [2018-11-23 13:13:18,931 INFO L273 TraceCheckUtils]: 56: Hoare triple {34815#true} ~cond := #in~cond; {34815#true} is VALID [2018-11-23 13:13:18,931 INFO L273 TraceCheckUtils]: 57: Hoare triple {34815#true} assume !(0 == ~cond); {34815#true} is VALID [2018-11-23 13:13:18,932 INFO L273 TraceCheckUtils]: 58: Hoare triple {34815#true} assume true; {34815#true} is VALID [2018-11-23 13:13:18,932 INFO L268 TraceCheckUtils]: 59: Hoare quadruple {34815#true} {34820#(<= 3 main_~k~0)} #70#return; {34820#(<= 3 main_~k~0)} is VALID [2018-11-23 13:13:18,933 INFO L273 TraceCheckUtils]: 60: Hoare triple {34820#(<= 3 main_~k~0)} #t~post7 := ~j1~0;~j1~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~k~0;~k~0 := #t~post8 - 1;havoc #t~post8; {34819#(<= 2 main_~k~0)} is VALID [2018-11-23 13:13:18,933 INFO L273 TraceCheckUtils]: 61: Hoare triple {34819#(<= 2 main_~k~0)} assume !!(~j1~0 < ~n0~0 + ~n1~0); {34819#(<= 2 main_~k~0)} is VALID [2018-11-23 13:13:18,934 INFO L256 TraceCheckUtils]: 62: Hoare triple {34819#(<= 2 main_~k~0)} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {34815#true} is VALID [2018-11-23 13:13:18,934 INFO L273 TraceCheckUtils]: 63: Hoare triple {34815#true} ~cond := #in~cond; {34815#true} is VALID [2018-11-23 13:13:18,934 INFO L273 TraceCheckUtils]: 64: Hoare triple {34815#true} assume !(0 == ~cond); {34815#true} is VALID [2018-11-23 13:13:18,934 INFO L273 TraceCheckUtils]: 65: Hoare triple {34815#true} assume true; {34815#true} is VALID [2018-11-23 13:13:18,935 INFO L268 TraceCheckUtils]: 66: Hoare quadruple {34815#true} {34819#(<= 2 main_~k~0)} #70#return; {34819#(<= 2 main_~k~0)} is VALID [2018-11-23 13:13:18,935 INFO L273 TraceCheckUtils]: 67: Hoare triple {34819#(<= 2 main_~k~0)} #t~post7 := ~j1~0;~j1~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~k~0;~k~0 := #t~post8 - 1;havoc #t~post8; {34818#(<= 1 main_~k~0)} is VALID [2018-11-23 13:13:18,936 INFO L273 TraceCheckUtils]: 68: Hoare triple {34818#(<= 1 main_~k~0)} assume !!(~j1~0 < ~n0~0 + ~n1~0); {34818#(<= 1 main_~k~0)} is VALID [2018-11-23 13:13:18,937 INFO L256 TraceCheckUtils]: 69: Hoare triple {34818#(<= 1 main_~k~0)} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {35039#(= |__VERIFIER_assert_#in~cond| 1)} is VALID [2018-11-23 13:13:18,937 INFO L273 TraceCheckUtils]: 70: Hoare triple {35039#(= |__VERIFIER_assert_#in~cond| 1)} ~cond := #in~cond; {35043#(= 1 __VERIFIER_assert_~cond)} is VALID [2018-11-23 13:13:18,938 INFO L273 TraceCheckUtils]: 71: Hoare triple {35043#(= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {34816#false} is VALID [2018-11-23 13:13:18,938 INFO L273 TraceCheckUtils]: 72: Hoare triple {34816#false} assume !false; {34816#false} is VALID [2018-11-23 13:13:18,942 INFO L134 CoverageAnalysis]: Checked inductivity of 211 backedges. 50 proven. 77 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2018-11-23 13:13:18,960 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:13:18,961 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13] total 16 [2018-11-23 13:13:18,961 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 73 [2018-11-23 13:13:18,961 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:13:18,961 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states. [2018-11-23 13:13:19,013 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:13:19,013 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-11-23 13:13:19,014 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-11-23 13:13:19,014 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=173, Unknown=0, NotChecked=0, Total=240 [2018-11-23 13:13:19,014 INFO L87 Difference]: Start difference. First operand 92 states and 102 transitions. Second operand 16 states. [2018-11-23 13:13:20,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:13:20,122 INFO L93 Difference]: Finished difference Result 101 states and 111 transitions. [2018-11-23 13:13:20,122 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-23 13:13:20,122 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 73 [2018-11-23 13:13:20,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:13:20,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-23 13:13:20,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 90 transitions. [2018-11-23 13:13:20,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-23 13:13:20,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 90 transitions. [2018-11-23 13:13:20,125 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states and 90 transitions. [2018-11-23 13:13:20,215 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 90 edges. 90 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:13:20,217 INFO L225 Difference]: With dead ends: 101 [2018-11-23 13:13:20,217 INFO L226 Difference]: Without dead ends: 99 [2018-11-23 13:13:20,217 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=80, Invalid=226, Unknown=0, NotChecked=0, Total=306 [2018-11-23 13:13:20,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2018-11-23 13:13:20,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2018-11-23 13:13:20,713 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:13:20,713 INFO L82 GeneralOperation]: Start isEquivalent. First operand 99 states. Second operand 99 states. [2018-11-23 13:13:20,713 INFO L74 IsIncluded]: Start isIncluded. First operand 99 states. Second operand 99 states. [2018-11-23 13:13:20,714 INFO L87 Difference]: Start difference. First operand 99 states. Second operand 99 states. [2018-11-23 13:13:20,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:13:20,715 INFO L93 Difference]: Finished difference Result 99 states and 109 transitions. [2018-11-23 13:13:20,715 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 109 transitions. [2018-11-23 13:13:20,715 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:13:20,715 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:13:20,715 INFO L74 IsIncluded]: Start isIncluded. First operand 99 states. Second operand 99 states. [2018-11-23 13:13:20,715 INFO L87 Difference]: Start difference. First operand 99 states. Second operand 99 states. [2018-11-23 13:13:20,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:13:20,717 INFO L93 Difference]: Finished difference Result 99 states and 109 transitions. [2018-11-23 13:13:20,717 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 109 transitions. [2018-11-23 13:13:20,717 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:13:20,717 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:13:20,717 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:13:20,718 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:13:20,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-11-23 13:13:20,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 109 transitions. [2018-11-23 13:13:20,719 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 109 transitions. Word has length 73 [2018-11-23 13:13:20,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:13:20,719 INFO L480 AbstractCegarLoop]: Abstraction has 99 states and 109 transitions. [2018-11-23 13:13:20,719 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-11-23 13:13:20,719 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 109 transitions. [2018-11-23 13:13:20,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-11-23 13:13:20,720 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:13:20,720 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 9, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:13:20,720 INFO L423 AbstractCegarLoop]: === Iteration 45 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:13:20,720 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:13:20,720 INFO L82 PathProgramCache]: Analyzing trace with hash 392060303, now seen corresponding path program 15 times [2018-11-23 13:13:20,720 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:13:20,720 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:13:20,721 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:13:20,721 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:13:20,721 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:13:20,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:13:21,163 INFO L256 TraceCheckUtils]: 0: Hoare triple {35549#true} call ULTIMATE.init(); {35549#true} is VALID [2018-11-23 13:13:21,163 INFO L273 TraceCheckUtils]: 1: Hoare triple {35549#true} assume true; {35549#true} is VALID [2018-11-23 13:13:21,163 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {35549#true} {35549#true} #66#return; {35549#true} is VALID [2018-11-23 13:13:21,164 INFO L256 TraceCheckUtils]: 3: Hoare triple {35549#true} call #t~ret9 := main(); {35549#true} is VALID [2018-11-23 13:13:21,164 INFO L273 TraceCheckUtils]: 4: Hoare triple {35549#true} havoc ~n0~0;havoc ~n1~0;~i0~0 := 0;~k~0 := 0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n0~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~n1~0 := #t~nondet2;havoc #t~nondet2; {35551#(<= main_~i0~0 0)} is VALID [2018-11-23 13:13:21,165 INFO L273 TraceCheckUtils]: 5: Hoare triple {35551#(<= main_~i0~0 0)} assume !!(-1000000 <= ~n0~0 && ~n0~0 < 1000000); {35551#(<= main_~i0~0 0)} is VALID [2018-11-23 13:13:21,165 INFO L273 TraceCheckUtils]: 6: Hoare triple {35551#(<= main_~i0~0 0)} assume !!(-1000000 <= ~n1~0 && ~n1~0 < 1000000); {35551#(<= main_~i0~0 0)} is VALID [2018-11-23 13:13:21,166 INFO L273 TraceCheckUtils]: 7: Hoare triple {35551#(<= main_~i0~0 0)} assume !(~i0~0 < ~n0~0); {35552#(<= main_~n0~0 0)} is VALID [2018-11-23 13:13:21,167 INFO L273 TraceCheckUtils]: 8: Hoare triple {35552#(<= main_~n0~0 0)} ~i1~0 := 0; {35553#(<= (+ main_~i1~0 main_~n0~0) 0)} is VALID [2018-11-23 13:13:21,167 INFO L273 TraceCheckUtils]: 9: Hoare triple {35553#(<= (+ main_~i1~0 main_~n0~0) 0)} assume !!(~i1~0 < ~n1~0);#t~post5 := ~i1~0;~i1~0 := 1 + #t~post5;havoc #t~post5;#t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {35554#(<= (+ main_~i1~0 main_~n0~0) 1)} is VALID [2018-11-23 13:13:21,168 INFO L273 TraceCheckUtils]: 10: Hoare triple {35554#(<= (+ main_~i1~0 main_~n0~0) 1)} assume !!(~i1~0 < ~n1~0);#t~post5 := ~i1~0;~i1~0 := 1 + #t~post5;havoc #t~post5;#t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {35555#(<= (+ main_~i1~0 main_~n0~0) 2)} is VALID [2018-11-23 13:13:21,169 INFO L273 TraceCheckUtils]: 11: Hoare triple {35555#(<= (+ main_~i1~0 main_~n0~0) 2)} assume !!(~i1~0 < ~n1~0);#t~post5 := ~i1~0;~i1~0 := 1 + #t~post5;havoc #t~post5;#t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {35556#(<= (+ main_~i1~0 main_~n0~0) 3)} is VALID [2018-11-23 13:13:21,170 INFO L273 TraceCheckUtils]: 12: Hoare triple {35556#(<= (+ main_~i1~0 main_~n0~0) 3)} assume !!(~i1~0 < ~n1~0);#t~post5 := ~i1~0;~i1~0 := 1 + #t~post5;havoc #t~post5;#t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {35557#(<= (+ main_~i1~0 main_~n0~0) 4)} is VALID [2018-11-23 13:13:21,171 INFO L273 TraceCheckUtils]: 13: Hoare triple {35557#(<= (+ main_~i1~0 main_~n0~0) 4)} assume !!(~i1~0 < ~n1~0);#t~post5 := ~i1~0;~i1~0 := 1 + #t~post5;havoc #t~post5;#t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {35558#(<= (+ main_~i1~0 main_~n0~0) 5)} is VALID [2018-11-23 13:13:21,172 INFO L273 TraceCheckUtils]: 14: Hoare triple {35558#(<= (+ main_~i1~0 main_~n0~0) 5)} assume !!(~i1~0 < ~n1~0);#t~post5 := ~i1~0;~i1~0 := 1 + #t~post5;havoc #t~post5;#t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {35559#(<= (+ main_~i1~0 main_~n0~0) 6)} is VALID [2018-11-23 13:13:21,172 INFO L273 TraceCheckUtils]: 15: Hoare triple {35559#(<= (+ main_~i1~0 main_~n0~0) 6)} assume !!(~i1~0 < ~n1~0);#t~post5 := ~i1~0;~i1~0 := 1 + #t~post5;havoc #t~post5;#t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {35560#(<= (+ main_~i1~0 main_~n0~0) 7)} is VALID [2018-11-23 13:13:21,173 INFO L273 TraceCheckUtils]: 16: Hoare triple {35560#(<= (+ main_~i1~0 main_~n0~0) 7)} assume !!(~i1~0 < ~n1~0);#t~post5 := ~i1~0;~i1~0 := 1 + #t~post5;havoc #t~post5;#t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {35561#(<= (+ main_~i1~0 main_~n0~0) 8)} is VALID [2018-11-23 13:13:21,174 INFO L273 TraceCheckUtils]: 17: Hoare triple {35561#(<= (+ main_~i1~0 main_~n0~0) 8)} assume !(~i1~0 < ~n1~0); {35562#(<= (+ main_~n0~0 main_~n1~0) 8)} is VALID [2018-11-23 13:13:21,175 INFO L273 TraceCheckUtils]: 18: Hoare triple {35562#(<= (+ main_~n0~0 main_~n1~0) 8)} ~j1~0 := 0; {35563#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 8))} is VALID [2018-11-23 13:13:21,175 INFO L273 TraceCheckUtils]: 19: Hoare triple {35563#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 8))} assume !!(~j1~0 < ~n0~0 + ~n1~0); {35563#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 8))} is VALID [2018-11-23 13:13:21,175 INFO L256 TraceCheckUtils]: 20: Hoare triple {35563#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 8))} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {35549#true} is VALID [2018-11-23 13:13:21,176 INFO L273 TraceCheckUtils]: 21: Hoare triple {35549#true} ~cond := #in~cond; {35549#true} is VALID [2018-11-23 13:13:21,176 INFO L273 TraceCheckUtils]: 22: Hoare triple {35549#true} assume !(0 == ~cond); {35549#true} is VALID [2018-11-23 13:13:21,176 INFO L273 TraceCheckUtils]: 23: Hoare triple {35549#true} assume true; {35549#true} is VALID [2018-11-23 13:13:21,177 INFO L268 TraceCheckUtils]: 24: Hoare quadruple {35549#true} {35563#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 8))} #70#return; {35563#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 8))} is VALID [2018-11-23 13:13:21,178 INFO L273 TraceCheckUtils]: 25: Hoare triple {35563#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 8))} #t~post7 := ~j1~0;~j1~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~k~0;~k~0 := #t~post8 - 1;havoc #t~post8; {35564#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 7))} is VALID [2018-11-23 13:13:21,178 INFO L273 TraceCheckUtils]: 26: Hoare triple {35564#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 7))} assume !!(~j1~0 < ~n0~0 + ~n1~0); {35564#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 7))} is VALID [2018-11-23 13:13:21,178 INFO L256 TraceCheckUtils]: 27: Hoare triple {35564#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 7))} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {35549#true} is VALID [2018-11-23 13:13:21,178 INFO L273 TraceCheckUtils]: 28: Hoare triple {35549#true} ~cond := #in~cond; {35549#true} is VALID [2018-11-23 13:13:21,179 INFO L273 TraceCheckUtils]: 29: Hoare triple {35549#true} assume !(0 == ~cond); {35549#true} is VALID [2018-11-23 13:13:21,179 INFO L273 TraceCheckUtils]: 30: Hoare triple {35549#true} assume true; {35549#true} is VALID [2018-11-23 13:13:21,179 INFO L268 TraceCheckUtils]: 31: Hoare quadruple {35549#true} {35564#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 7))} #70#return; {35564#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 7))} is VALID [2018-11-23 13:13:21,180 INFO L273 TraceCheckUtils]: 32: Hoare triple {35564#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 7))} #t~post7 := ~j1~0;~j1~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~k~0;~k~0 := #t~post8 - 1;havoc #t~post8; {35565#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 6))} is VALID [2018-11-23 13:13:21,181 INFO L273 TraceCheckUtils]: 33: Hoare triple {35565#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 6))} assume !!(~j1~0 < ~n0~0 + ~n1~0); {35565#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 6))} is VALID [2018-11-23 13:13:21,181 INFO L256 TraceCheckUtils]: 34: Hoare triple {35565#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 6))} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {35549#true} is VALID [2018-11-23 13:13:21,181 INFO L273 TraceCheckUtils]: 35: Hoare triple {35549#true} ~cond := #in~cond; {35549#true} is VALID [2018-11-23 13:13:21,181 INFO L273 TraceCheckUtils]: 36: Hoare triple {35549#true} assume !(0 == ~cond); {35549#true} is VALID [2018-11-23 13:13:21,182 INFO L273 TraceCheckUtils]: 37: Hoare triple {35549#true} assume true; {35549#true} is VALID [2018-11-23 13:13:21,182 INFO L268 TraceCheckUtils]: 38: Hoare quadruple {35549#true} {35565#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 6))} #70#return; {35565#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 6))} is VALID [2018-11-23 13:13:21,183 INFO L273 TraceCheckUtils]: 39: Hoare triple {35565#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 6))} #t~post7 := ~j1~0;~j1~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~k~0;~k~0 := #t~post8 - 1;havoc #t~post8; {35566#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 5))} is VALID [2018-11-23 13:13:21,184 INFO L273 TraceCheckUtils]: 40: Hoare triple {35566#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 5))} assume !!(~j1~0 < ~n0~0 + ~n1~0); {35566#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 5))} is VALID [2018-11-23 13:13:21,184 INFO L256 TraceCheckUtils]: 41: Hoare triple {35566#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 5))} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {35549#true} is VALID [2018-11-23 13:13:21,184 INFO L273 TraceCheckUtils]: 42: Hoare triple {35549#true} ~cond := #in~cond; {35549#true} is VALID [2018-11-23 13:13:21,184 INFO L273 TraceCheckUtils]: 43: Hoare triple {35549#true} assume !(0 == ~cond); {35549#true} is VALID [2018-11-23 13:13:21,184 INFO L273 TraceCheckUtils]: 44: Hoare triple {35549#true} assume true; {35549#true} is VALID [2018-11-23 13:13:21,185 INFO L268 TraceCheckUtils]: 45: Hoare quadruple {35549#true} {35566#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 5))} #70#return; {35566#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 5))} is VALID [2018-11-23 13:13:21,186 INFO L273 TraceCheckUtils]: 46: Hoare triple {35566#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 5))} #t~post7 := ~j1~0;~j1~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~k~0;~k~0 := #t~post8 - 1;havoc #t~post8; {35567#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 4))} is VALID [2018-11-23 13:13:21,186 INFO L273 TraceCheckUtils]: 47: Hoare triple {35567#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 4))} assume !!(~j1~0 < ~n0~0 + ~n1~0); {35567#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 4))} is VALID [2018-11-23 13:13:21,186 INFO L256 TraceCheckUtils]: 48: Hoare triple {35567#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 4))} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {35549#true} is VALID [2018-11-23 13:13:21,186 INFO L273 TraceCheckUtils]: 49: Hoare triple {35549#true} ~cond := #in~cond; {35549#true} is VALID [2018-11-23 13:13:21,186 INFO L273 TraceCheckUtils]: 50: Hoare triple {35549#true} assume !(0 == ~cond); {35549#true} is VALID [2018-11-23 13:13:21,187 INFO L273 TraceCheckUtils]: 51: Hoare triple {35549#true} assume true; {35549#true} is VALID [2018-11-23 13:13:21,187 INFO L268 TraceCheckUtils]: 52: Hoare quadruple {35549#true} {35567#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 4))} #70#return; {35567#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 4))} is VALID [2018-11-23 13:13:21,188 INFO L273 TraceCheckUtils]: 53: Hoare triple {35567#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 4))} #t~post7 := ~j1~0;~j1~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~k~0;~k~0 := #t~post8 - 1;havoc #t~post8; {35568#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 3))} is VALID [2018-11-23 13:13:21,188 INFO L273 TraceCheckUtils]: 54: Hoare triple {35568#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 3))} assume !!(~j1~0 < ~n0~0 + ~n1~0); {35568#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 3))} is VALID [2018-11-23 13:13:21,188 INFO L256 TraceCheckUtils]: 55: Hoare triple {35568#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 3))} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {35549#true} is VALID [2018-11-23 13:13:21,188 INFO L273 TraceCheckUtils]: 56: Hoare triple {35549#true} ~cond := #in~cond; {35549#true} is VALID [2018-11-23 13:13:21,188 INFO L273 TraceCheckUtils]: 57: Hoare triple {35549#true} assume !(0 == ~cond); {35549#true} is VALID [2018-11-23 13:13:21,189 INFO L273 TraceCheckUtils]: 58: Hoare triple {35549#true} assume true; {35549#true} is VALID [2018-11-23 13:13:21,189 INFO L268 TraceCheckUtils]: 59: Hoare quadruple {35549#true} {35568#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 3))} #70#return; {35568#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 3))} is VALID [2018-11-23 13:13:21,190 INFO L273 TraceCheckUtils]: 60: Hoare triple {35568#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 3))} #t~post7 := ~j1~0;~j1~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~k~0;~k~0 := #t~post8 - 1;havoc #t~post8; {35569#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 2))} is VALID [2018-11-23 13:13:21,191 INFO L273 TraceCheckUtils]: 61: Hoare triple {35569#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 2))} assume !!(~j1~0 < ~n0~0 + ~n1~0); {35569#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 2))} is VALID [2018-11-23 13:13:21,191 INFO L256 TraceCheckUtils]: 62: Hoare triple {35569#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 2))} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {35549#true} is VALID [2018-11-23 13:13:21,191 INFO L273 TraceCheckUtils]: 63: Hoare triple {35549#true} ~cond := #in~cond; {35549#true} is VALID [2018-11-23 13:13:21,191 INFO L273 TraceCheckUtils]: 64: Hoare triple {35549#true} assume !(0 == ~cond); {35549#true} is VALID [2018-11-23 13:13:21,191 INFO L273 TraceCheckUtils]: 65: Hoare triple {35549#true} assume true; {35549#true} is VALID [2018-11-23 13:13:21,192 INFO L268 TraceCheckUtils]: 66: Hoare quadruple {35549#true} {35569#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 2))} #70#return; {35569#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 2))} is VALID [2018-11-23 13:13:21,193 INFO L273 TraceCheckUtils]: 67: Hoare triple {35569#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 2))} #t~post7 := ~j1~0;~j1~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~k~0;~k~0 := #t~post8 - 1;havoc #t~post8; {35570#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 1))} is VALID [2018-11-23 13:13:21,193 INFO L273 TraceCheckUtils]: 68: Hoare triple {35570#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 1))} assume !!(~j1~0 < ~n0~0 + ~n1~0); {35570#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 1))} is VALID [2018-11-23 13:13:21,194 INFO L256 TraceCheckUtils]: 69: Hoare triple {35570#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 1))} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {35549#true} is VALID [2018-11-23 13:13:21,194 INFO L273 TraceCheckUtils]: 70: Hoare triple {35549#true} ~cond := #in~cond; {35549#true} is VALID [2018-11-23 13:13:21,194 INFO L273 TraceCheckUtils]: 71: Hoare triple {35549#true} assume !(0 == ~cond); {35549#true} is VALID [2018-11-23 13:13:21,194 INFO L273 TraceCheckUtils]: 72: Hoare triple {35549#true} assume true; {35549#true} is VALID [2018-11-23 13:13:21,195 INFO L268 TraceCheckUtils]: 73: Hoare quadruple {35549#true} {35570#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 1))} #70#return; {35570#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 1))} is VALID [2018-11-23 13:13:21,196 INFO L273 TraceCheckUtils]: 74: Hoare triple {35570#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 1))} #t~post7 := ~j1~0;~j1~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~k~0;~k~0 := #t~post8 - 1;havoc #t~post8; {35571#(<= (+ main_~n0~0 main_~n1~0) main_~j1~0)} is VALID [2018-11-23 13:13:21,196 INFO L273 TraceCheckUtils]: 75: Hoare triple {35571#(<= (+ main_~n0~0 main_~n1~0) main_~j1~0)} assume !!(~j1~0 < ~n0~0 + ~n1~0); {35550#false} is VALID [2018-11-23 13:13:21,196 INFO L256 TraceCheckUtils]: 76: Hoare triple {35550#false} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {35550#false} is VALID [2018-11-23 13:13:21,197 INFO L273 TraceCheckUtils]: 77: Hoare triple {35550#false} ~cond := #in~cond; {35550#false} is VALID [2018-11-23 13:13:21,197 INFO L273 TraceCheckUtils]: 78: Hoare triple {35550#false} assume 0 == ~cond; {35550#false} is VALID [2018-11-23 13:13:21,197 INFO L273 TraceCheckUtils]: 79: Hoare triple {35550#false} assume !false; {35550#false} is VALID [2018-11-23 13:13:21,204 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 116 proven. 36 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2018-11-23 13:13:21,204 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:13:21,204 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:13:21,214 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 13:13:21,250 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2018-11-23 13:13:21,250 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:13:21,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:13:21,264 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:13:21,957 INFO L256 TraceCheckUtils]: 0: Hoare triple {35549#true} call ULTIMATE.init(); {35549#true} is VALID [2018-11-23 13:13:21,958 INFO L273 TraceCheckUtils]: 1: Hoare triple {35549#true} assume true; {35549#true} is VALID [2018-11-23 13:13:21,958 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {35549#true} {35549#true} #66#return; {35549#true} is VALID [2018-11-23 13:13:21,958 INFO L256 TraceCheckUtils]: 3: Hoare triple {35549#true} call #t~ret9 := main(); {35549#true} is VALID [2018-11-23 13:13:21,959 INFO L273 TraceCheckUtils]: 4: Hoare triple {35549#true} havoc ~n0~0;havoc ~n1~0;~i0~0 := 0;~k~0 := 0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n0~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~n1~0 := #t~nondet2;havoc #t~nondet2; {35551#(<= main_~i0~0 0)} is VALID [2018-11-23 13:13:21,959 INFO L273 TraceCheckUtils]: 5: Hoare triple {35551#(<= main_~i0~0 0)} assume !!(-1000000 <= ~n0~0 && ~n0~0 < 1000000); {35551#(<= main_~i0~0 0)} is VALID [2018-11-23 13:13:21,959 INFO L273 TraceCheckUtils]: 6: Hoare triple {35551#(<= main_~i0~0 0)} assume !!(-1000000 <= ~n1~0 && ~n1~0 < 1000000); {35551#(<= main_~i0~0 0)} is VALID [2018-11-23 13:13:21,960 INFO L273 TraceCheckUtils]: 7: Hoare triple {35551#(<= main_~i0~0 0)} assume !(~i0~0 < ~n0~0); {35552#(<= main_~n0~0 0)} is VALID [2018-11-23 13:13:21,960 INFO L273 TraceCheckUtils]: 8: Hoare triple {35552#(<= main_~n0~0 0)} ~i1~0 := 0; {35599#(and (<= main_~i1~0 0) (<= main_~n0~0 0))} is VALID [2018-11-23 13:13:21,961 INFO L273 TraceCheckUtils]: 9: Hoare triple {35599#(and (<= main_~i1~0 0) (<= main_~n0~0 0))} assume !!(~i1~0 < ~n1~0);#t~post5 := ~i1~0;~i1~0 := 1 + #t~post5;havoc #t~post5;#t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {35603#(and (<= main_~i1~0 1) (<= main_~n0~0 0))} is VALID [2018-11-23 13:13:21,961 INFO L273 TraceCheckUtils]: 10: Hoare triple {35603#(and (<= main_~i1~0 1) (<= main_~n0~0 0))} assume !!(~i1~0 < ~n1~0);#t~post5 := ~i1~0;~i1~0 := 1 + #t~post5;havoc #t~post5;#t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {35607#(and (<= main_~i1~0 2) (<= main_~n0~0 0))} is VALID [2018-11-23 13:13:21,962 INFO L273 TraceCheckUtils]: 11: Hoare triple {35607#(and (<= main_~i1~0 2) (<= main_~n0~0 0))} assume !!(~i1~0 < ~n1~0);#t~post5 := ~i1~0;~i1~0 := 1 + #t~post5;havoc #t~post5;#t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {35611#(and (<= main_~n0~0 0) (<= main_~i1~0 3))} is VALID [2018-11-23 13:13:21,963 INFO L273 TraceCheckUtils]: 12: Hoare triple {35611#(and (<= main_~n0~0 0) (<= main_~i1~0 3))} assume !!(~i1~0 < ~n1~0);#t~post5 := ~i1~0;~i1~0 := 1 + #t~post5;havoc #t~post5;#t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {35615#(and (<= main_~i1~0 4) (<= main_~n0~0 0))} is VALID [2018-11-23 13:13:21,964 INFO L273 TraceCheckUtils]: 13: Hoare triple {35615#(and (<= main_~i1~0 4) (<= main_~n0~0 0))} assume !!(~i1~0 < ~n1~0);#t~post5 := ~i1~0;~i1~0 := 1 + #t~post5;havoc #t~post5;#t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {35619#(and (<= main_~i1~0 5) (<= main_~n0~0 0))} is VALID [2018-11-23 13:13:21,964 INFO L273 TraceCheckUtils]: 14: Hoare triple {35619#(and (<= main_~i1~0 5) (<= main_~n0~0 0))} assume !!(~i1~0 < ~n1~0);#t~post5 := ~i1~0;~i1~0 := 1 + #t~post5;havoc #t~post5;#t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {35623#(and (<= main_~n0~0 0) (<= main_~i1~0 6))} is VALID [2018-11-23 13:13:21,965 INFO L273 TraceCheckUtils]: 15: Hoare triple {35623#(and (<= main_~n0~0 0) (<= main_~i1~0 6))} assume !!(~i1~0 < ~n1~0);#t~post5 := ~i1~0;~i1~0 := 1 + #t~post5;havoc #t~post5;#t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {35627#(and (<= main_~i1~0 7) (<= main_~n0~0 0))} is VALID [2018-11-23 13:13:21,966 INFO L273 TraceCheckUtils]: 16: Hoare triple {35627#(and (<= main_~i1~0 7) (<= main_~n0~0 0))} assume !!(~i1~0 < ~n1~0);#t~post5 := ~i1~0;~i1~0 := 1 + #t~post5;havoc #t~post5;#t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {35631#(and (<= main_~i1~0 8) (<= main_~n0~0 0))} is VALID [2018-11-23 13:13:21,967 INFO L273 TraceCheckUtils]: 17: Hoare triple {35631#(and (<= main_~i1~0 8) (<= main_~n0~0 0))} assume !(~i1~0 < ~n1~0); {35635#(and (<= main_~n1~0 8) (<= main_~n0~0 0))} is VALID [2018-11-23 13:13:21,967 INFO L273 TraceCheckUtils]: 18: Hoare triple {35635#(and (<= main_~n1~0 8) (<= main_~n0~0 0))} ~j1~0 := 0; {35639#(and (<= 0 main_~j1~0) (<= main_~n1~0 8) (<= main_~n0~0 0))} is VALID [2018-11-23 13:13:21,968 INFO L273 TraceCheckUtils]: 19: Hoare triple {35639#(and (<= 0 main_~j1~0) (<= main_~n1~0 8) (<= main_~n0~0 0))} assume !!(~j1~0 < ~n0~0 + ~n1~0); {35639#(and (<= 0 main_~j1~0) (<= main_~n1~0 8) (<= main_~n0~0 0))} is VALID [2018-11-23 13:13:21,968 INFO L256 TraceCheckUtils]: 20: Hoare triple {35639#(and (<= 0 main_~j1~0) (<= main_~n1~0 8) (<= main_~n0~0 0))} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {35549#true} is VALID [2018-11-23 13:13:21,969 INFO L273 TraceCheckUtils]: 21: Hoare triple {35549#true} ~cond := #in~cond; {35549#true} is VALID [2018-11-23 13:13:21,969 INFO L273 TraceCheckUtils]: 22: Hoare triple {35549#true} assume !(0 == ~cond); {35549#true} is VALID [2018-11-23 13:13:21,969 INFO L273 TraceCheckUtils]: 23: Hoare triple {35549#true} assume true; {35549#true} is VALID [2018-11-23 13:13:21,970 INFO L268 TraceCheckUtils]: 24: Hoare quadruple {35549#true} {35639#(and (<= 0 main_~j1~0) (<= main_~n1~0 8) (<= main_~n0~0 0))} #70#return; {35639#(and (<= 0 main_~j1~0) (<= main_~n1~0 8) (<= main_~n0~0 0))} is VALID [2018-11-23 13:13:21,970 INFO L273 TraceCheckUtils]: 25: Hoare triple {35639#(and (<= 0 main_~j1~0) (<= main_~n1~0 8) (<= main_~n0~0 0))} #t~post7 := ~j1~0;~j1~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~k~0;~k~0 := #t~post8 - 1;havoc #t~post8; {35661#(and (<= 1 main_~j1~0) (<= main_~n1~0 8) (<= main_~n0~0 0))} is VALID [2018-11-23 13:13:21,971 INFO L273 TraceCheckUtils]: 26: Hoare triple {35661#(and (<= 1 main_~j1~0) (<= main_~n1~0 8) (<= main_~n0~0 0))} assume !!(~j1~0 < ~n0~0 + ~n1~0); {35661#(and (<= 1 main_~j1~0) (<= main_~n1~0 8) (<= main_~n0~0 0))} is VALID [2018-11-23 13:13:21,971 INFO L256 TraceCheckUtils]: 27: Hoare triple {35661#(and (<= 1 main_~j1~0) (<= main_~n1~0 8) (<= main_~n0~0 0))} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {35549#true} is VALID [2018-11-23 13:13:21,972 INFO L273 TraceCheckUtils]: 28: Hoare triple {35549#true} ~cond := #in~cond; {35549#true} is VALID [2018-11-23 13:13:21,972 INFO L273 TraceCheckUtils]: 29: Hoare triple {35549#true} assume !(0 == ~cond); {35549#true} is VALID [2018-11-23 13:13:21,972 INFO L273 TraceCheckUtils]: 30: Hoare triple {35549#true} assume true; {35549#true} is VALID [2018-11-23 13:13:21,973 INFO L268 TraceCheckUtils]: 31: Hoare quadruple {35549#true} {35661#(and (<= 1 main_~j1~0) (<= main_~n1~0 8) (<= main_~n0~0 0))} #70#return; {35661#(and (<= 1 main_~j1~0) (<= main_~n1~0 8) (<= main_~n0~0 0))} is VALID [2018-11-23 13:13:21,973 INFO L273 TraceCheckUtils]: 32: Hoare triple {35661#(and (<= 1 main_~j1~0) (<= main_~n1~0 8) (<= main_~n0~0 0))} #t~post7 := ~j1~0;~j1~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~k~0;~k~0 := #t~post8 - 1;havoc #t~post8; {35683#(and (<= main_~n1~0 8) (<= main_~n0~0 0) (<= 2 main_~j1~0))} is VALID [2018-11-23 13:13:21,974 INFO L273 TraceCheckUtils]: 33: Hoare triple {35683#(and (<= main_~n1~0 8) (<= main_~n0~0 0) (<= 2 main_~j1~0))} assume !!(~j1~0 < ~n0~0 + ~n1~0); {35683#(and (<= main_~n1~0 8) (<= main_~n0~0 0) (<= 2 main_~j1~0))} is VALID [2018-11-23 13:13:21,974 INFO L256 TraceCheckUtils]: 34: Hoare triple {35683#(and (<= main_~n1~0 8) (<= main_~n0~0 0) (<= 2 main_~j1~0))} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {35549#true} is VALID [2018-11-23 13:13:21,974 INFO L273 TraceCheckUtils]: 35: Hoare triple {35549#true} ~cond := #in~cond; {35549#true} is VALID [2018-11-23 13:13:21,975 INFO L273 TraceCheckUtils]: 36: Hoare triple {35549#true} assume !(0 == ~cond); {35549#true} is VALID [2018-11-23 13:13:21,975 INFO L273 TraceCheckUtils]: 37: Hoare triple {35549#true} assume true; {35549#true} is VALID [2018-11-23 13:13:21,975 INFO L268 TraceCheckUtils]: 38: Hoare quadruple {35549#true} {35683#(and (<= main_~n1~0 8) (<= main_~n0~0 0) (<= 2 main_~j1~0))} #70#return; {35683#(and (<= main_~n1~0 8) (<= main_~n0~0 0) (<= 2 main_~j1~0))} is VALID [2018-11-23 13:13:21,976 INFO L273 TraceCheckUtils]: 39: Hoare triple {35683#(and (<= main_~n1~0 8) (<= main_~n0~0 0) (<= 2 main_~j1~0))} #t~post7 := ~j1~0;~j1~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~k~0;~k~0 := #t~post8 - 1;havoc #t~post8; {35705#(and (<= 3 main_~j1~0) (<= main_~n1~0 8) (<= main_~n0~0 0))} is VALID [2018-11-23 13:13:21,976 INFO L273 TraceCheckUtils]: 40: Hoare triple {35705#(and (<= 3 main_~j1~0) (<= main_~n1~0 8) (<= main_~n0~0 0))} assume !!(~j1~0 < ~n0~0 + ~n1~0); {35705#(and (<= 3 main_~j1~0) (<= main_~n1~0 8) (<= main_~n0~0 0))} is VALID [2018-11-23 13:13:21,976 INFO L256 TraceCheckUtils]: 41: Hoare triple {35705#(and (<= 3 main_~j1~0) (<= main_~n1~0 8) (<= main_~n0~0 0))} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {35549#true} is VALID [2018-11-23 13:13:21,976 INFO L273 TraceCheckUtils]: 42: Hoare triple {35549#true} ~cond := #in~cond; {35549#true} is VALID [2018-11-23 13:13:21,976 INFO L273 TraceCheckUtils]: 43: Hoare triple {35549#true} assume !(0 == ~cond); {35549#true} is VALID [2018-11-23 13:13:21,976 INFO L273 TraceCheckUtils]: 44: Hoare triple {35549#true} assume true; {35549#true} is VALID [2018-11-23 13:13:21,977 INFO L268 TraceCheckUtils]: 45: Hoare quadruple {35549#true} {35705#(and (<= 3 main_~j1~0) (<= main_~n1~0 8) (<= main_~n0~0 0))} #70#return; {35705#(and (<= 3 main_~j1~0) (<= main_~n1~0 8) (<= main_~n0~0 0))} is VALID [2018-11-23 13:13:21,978 INFO L273 TraceCheckUtils]: 46: Hoare triple {35705#(and (<= 3 main_~j1~0) (<= main_~n1~0 8) (<= main_~n0~0 0))} #t~post7 := ~j1~0;~j1~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~k~0;~k~0 := #t~post8 - 1;havoc #t~post8; {35727#(and (<= 4 main_~j1~0) (<= main_~n1~0 8) (<= main_~n0~0 0))} is VALID [2018-11-23 13:13:21,978 INFO L273 TraceCheckUtils]: 47: Hoare triple {35727#(and (<= 4 main_~j1~0) (<= main_~n1~0 8) (<= main_~n0~0 0))} assume !!(~j1~0 < ~n0~0 + ~n1~0); {35727#(and (<= 4 main_~j1~0) (<= main_~n1~0 8) (<= main_~n0~0 0))} is VALID [2018-11-23 13:13:21,978 INFO L256 TraceCheckUtils]: 48: Hoare triple {35727#(and (<= 4 main_~j1~0) (<= main_~n1~0 8) (<= main_~n0~0 0))} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {35549#true} is VALID [2018-11-23 13:13:21,979 INFO L273 TraceCheckUtils]: 49: Hoare triple {35549#true} ~cond := #in~cond; {35549#true} is VALID [2018-11-23 13:13:21,979 INFO L273 TraceCheckUtils]: 50: Hoare triple {35549#true} assume !(0 == ~cond); {35549#true} is VALID [2018-11-23 13:13:21,979 INFO L273 TraceCheckUtils]: 51: Hoare triple {35549#true} assume true; {35549#true} is VALID [2018-11-23 13:13:21,980 INFO L268 TraceCheckUtils]: 52: Hoare quadruple {35549#true} {35727#(and (<= 4 main_~j1~0) (<= main_~n1~0 8) (<= main_~n0~0 0))} #70#return; {35727#(and (<= 4 main_~j1~0) (<= main_~n1~0 8) (<= main_~n0~0 0))} is VALID [2018-11-23 13:13:21,981 INFO L273 TraceCheckUtils]: 53: Hoare triple {35727#(and (<= 4 main_~j1~0) (<= main_~n1~0 8) (<= main_~n0~0 0))} #t~post7 := ~j1~0;~j1~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~k~0;~k~0 := #t~post8 - 1;havoc #t~post8; {35749#(and (<= main_~n1~0 8) (<= main_~n0~0 0) (<= 5 main_~j1~0))} is VALID [2018-11-23 13:13:21,981 INFO L273 TraceCheckUtils]: 54: Hoare triple {35749#(and (<= main_~n1~0 8) (<= main_~n0~0 0) (<= 5 main_~j1~0))} assume !!(~j1~0 < ~n0~0 + ~n1~0); {35749#(and (<= main_~n1~0 8) (<= main_~n0~0 0) (<= 5 main_~j1~0))} is VALID [2018-11-23 13:13:21,981 INFO L256 TraceCheckUtils]: 55: Hoare triple {35749#(and (<= main_~n1~0 8) (<= main_~n0~0 0) (<= 5 main_~j1~0))} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {35549#true} is VALID [2018-11-23 13:13:21,982 INFO L273 TraceCheckUtils]: 56: Hoare triple {35549#true} ~cond := #in~cond; {35549#true} is VALID [2018-11-23 13:13:21,982 INFO L273 TraceCheckUtils]: 57: Hoare triple {35549#true} assume !(0 == ~cond); {35549#true} is VALID [2018-11-23 13:13:21,982 INFO L273 TraceCheckUtils]: 58: Hoare triple {35549#true} assume true; {35549#true} is VALID [2018-11-23 13:13:21,983 INFO L268 TraceCheckUtils]: 59: Hoare quadruple {35549#true} {35749#(and (<= main_~n1~0 8) (<= main_~n0~0 0) (<= 5 main_~j1~0))} #70#return; {35749#(and (<= main_~n1~0 8) (<= main_~n0~0 0) (<= 5 main_~j1~0))} is VALID [2018-11-23 13:13:21,983 INFO L273 TraceCheckUtils]: 60: Hoare triple {35749#(and (<= main_~n1~0 8) (<= main_~n0~0 0) (<= 5 main_~j1~0))} #t~post7 := ~j1~0;~j1~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~k~0;~k~0 := #t~post8 - 1;havoc #t~post8; {35771#(and (<= 6 main_~j1~0) (<= main_~n1~0 8) (<= main_~n0~0 0))} is VALID [2018-11-23 13:13:21,984 INFO L273 TraceCheckUtils]: 61: Hoare triple {35771#(and (<= 6 main_~j1~0) (<= main_~n1~0 8) (<= main_~n0~0 0))} assume !!(~j1~0 < ~n0~0 + ~n1~0); {35771#(and (<= 6 main_~j1~0) (<= main_~n1~0 8) (<= main_~n0~0 0))} is VALID [2018-11-23 13:13:21,984 INFO L256 TraceCheckUtils]: 62: Hoare triple {35771#(and (<= 6 main_~j1~0) (<= main_~n1~0 8) (<= main_~n0~0 0))} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {35549#true} is VALID [2018-11-23 13:13:21,985 INFO L273 TraceCheckUtils]: 63: Hoare triple {35549#true} ~cond := #in~cond; {35549#true} is VALID [2018-11-23 13:13:21,985 INFO L273 TraceCheckUtils]: 64: Hoare triple {35549#true} assume !(0 == ~cond); {35549#true} is VALID [2018-11-23 13:13:21,985 INFO L273 TraceCheckUtils]: 65: Hoare triple {35549#true} assume true; {35549#true} is VALID [2018-11-23 13:13:21,986 INFO L268 TraceCheckUtils]: 66: Hoare quadruple {35549#true} {35771#(and (<= 6 main_~j1~0) (<= main_~n1~0 8) (<= main_~n0~0 0))} #70#return; {35771#(and (<= 6 main_~j1~0) (<= main_~n1~0 8) (<= main_~n0~0 0))} is VALID [2018-11-23 13:13:21,986 INFO L273 TraceCheckUtils]: 67: Hoare triple {35771#(and (<= 6 main_~j1~0) (<= main_~n1~0 8) (<= main_~n0~0 0))} #t~post7 := ~j1~0;~j1~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~k~0;~k~0 := #t~post8 - 1;havoc #t~post8; {35793#(and (<= 7 main_~j1~0) (<= main_~n1~0 8) (<= main_~n0~0 0))} is VALID [2018-11-23 13:13:21,987 INFO L273 TraceCheckUtils]: 68: Hoare triple {35793#(and (<= 7 main_~j1~0) (<= main_~n1~0 8) (<= main_~n0~0 0))} assume !!(~j1~0 < ~n0~0 + ~n1~0); {35793#(and (<= 7 main_~j1~0) (<= main_~n1~0 8) (<= main_~n0~0 0))} is VALID [2018-11-23 13:13:21,987 INFO L256 TraceCheckUtils]: 69: Hoare triple {35793#(and (<= 7 main_~j1~0) (<= main_~n1~0 8) (<= main_~n0~0 0))} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {35549#true} is VALID [2018-11-23 13:13:21,987 INFO L273 TraceCheckUtils]: 70: Hoare triple {35549#true} ~cond := #in~cond; {35549#true} is VALID [2018-11-23 13:13:21,988 INFO L273 TraceCheckUtils]: 71: Hoare triple {35549#true} assume !(0 == ~cond); {35549#true} is VALID [2018-11-23 13:13:21,988 INFO L273 TraceCheckUtils]: 72: Hoare triple {35549#true} assume true; {35549#true} is VALID [2018-11-23 13:13:21,988 INFO L268 TraceCheckUtils]: 73: Hoare quadruple {35549#true} {35793#(and (<= 7 main_~j1~0) (<= main_~n1~0 8) (<= main_~n0~0 0))} #70#return; {35793#(and (<= 7 main_~j1~0) (<= main_~n1~0 8) (<= main_~n0~0 0))} is VALID [2018-11-23 13:13:21,989 INFO L273 TraceCheckUtils]: 74: Hoare triple {35793#(and (<= 7 main_~j1~0) (<= main_~n1~0 8) (<= main_~n0~0 0))} #t~post7 := ~j1~0;~j1~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~k~0;~k~0 := #t~post8 - 1;havoc #t~post8; {35815#(and (<= 8 main_~j1~0) (<= main_~n1~0 8) (<= main_~n0~0 0))} is VALID [2018-11-23 13:13:21,989 INFO L273 TraceCheckUtils]: 75: Hoare triple {35815#(and (<= 8 main_~j1~0) (<= main_~n1~0 8) (<= main_~n0~0 0))} assume !!(~j1~0 < ~n0~0 + ~n1~0); {35550#false} is VALID [2018-11-23 13:13:21,989 INFO L256 TraceCheckUtils]: 76: Hoare triple {35550#false} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {35550#false} is VALID [2018-11-23 13:13:21,989 INFO L273 TraceCheckUtils]: 77: Hoare triple {35550#false} ~cond := #in~cond; {35550#false} is VALID [2018-11-23 13:13:21,989 INFO L273 TraceCheckUtils]: 78: Hoare triple {35550#false} assume 0 == ~cond; {35550#false} is VALID [2018-11-23 13:13:21,990 INFO L273 TraceCheckUtils]: 79: Hoare triple {35550#false} assume !false; {35550#false} is VALID [2018-11-23 13:13:21,997 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 116 proven. 36 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2018-11-23 13:13:22,017 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:13:22,018 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 42 [2018-11-23 13:13:22,018 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 80 [2018-11-23 13:13:22,018 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:13:22,019 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 42 states. [2018-11-23 13:13:22,112 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 103 edges. 103 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:13:22,112 INFO L459 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-11-23 13:13:22,113 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-11-23 13:13:22,113 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=353, Invalid=1369, Unknown=0, NotChecked=0, Total=1722 [2018-11-23 13:13:22,114 INFO L87 Difference]: Start difference. First operand 99 states and 109 transitions. Second operand 42 states. [2018-11-23 13:13:25,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:13:25,680 INFO L93 Difference]: Finished difference Result 170 states and 199 transitions. [2018-11-23 13:13:25,680 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-11-23 13:13:25,680 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 80 [2018-11-23 13:13:25,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:13:25,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-11-23 13:13:25,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 85 transitions. [2018-11-23 13:13:25,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-11-23 13:13:25,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 85 transitions. [2018-11-23 13:13:25,683 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 23 states and 85 transitions. [2018-11-23 13:13:25,762 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 85 edges. 85 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:13:25,765 INFO L225 Difference]: With dead ends: 170 [2018-11-23 13:13:25,766 INFO L226 Difference]: Without dead ends: 135 [2018-11-23 13:13:25,766 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1084 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=763, Invalid=3019, Unknown=0, NotChecked=0, Total=3782 [2018-11-23 13:13:25,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2018-11-23 13:13:26,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 100. [2018-11-23 13:13:26,683 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:13:26,683 INFO L82 GeneralOperation]: Start isEquivalent. First operand 135 states. Second operand 100 states. [2018-11-23 13:13:26,683 INFO L74 IsIncluded]: Start isIncluded. First operand 135 states. Second operand 100 states. [2018-11-23 13:13:26,683 INFO L87 Difference]: Start difference. First operand 135 states. Second operand 100 states. [2018-11-23 13:13:26,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:13:26,685 INFO L93 Difference]: Finished difference Result 135 states and 155 transitions. [2018-11-23 13:13:26,685 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 155 transitions. [2018-11-23 13:13:26,686 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:13:26,686 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:13:26,686 INFO L74 IsIncluded]: Start isIncluded. First operand 100 states. Second operand 135 states. [2018-11-23 13:13:26,686 INFO L87 Difference]: Start difference. First operand 100 states. Second operand 135 states. [2018-11-23 13:13:26,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:13:26,688 INFO L93 Difference]: Finished difference Result 135 states and 155 transitions. [2018-11-23 13:13:26,688 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 155 transitions. [2018-11-23 13:13:26,688 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:13:26,688 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:13:26,688 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:13:26,688 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:13:26,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-11-23 13:13:26,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 110 transitions. [2018-11-23 13:13:26,690 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 110 transitions. Word has length 80 [2018-11-23 13:13:26,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:13:26,690 INFO L480 AbstractCegarLoop]: Abstraction has 100 states and 110 transitions. [2018-11-23 13:13:26,690 INFO L481 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-11-23 13:13:26,690 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 110 transitions. [2018-11-23 13:13:26,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-11-23 13:13:26,690 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:13:26,691 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 9, 8, 8, 8, 8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:13:26,691 INFO L423 AbstractCegarLoop]: === Iteration 46 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:13:26,691 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:13:26,691 INFO L82 PathProgramCache]: Analyzing trace with hash -1691574002, now seen corresponding path program 22 times [2018-11-23 13:13:26,691 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:13:26,692 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:13:26,692 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:13:26,692 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:13:26,692 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:13:26,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:13:27,031 INFO L256 TraceCheckUtils]: 0: Hoare triple {36556#true} call ULTIMATE.init(); {36556#true} is VALID [2018-11-23 13:13:27,032 INFO L273 TraceCheckUtils]: 1: Hoare triple {36556#true} assume true; {36556#true} is VALID [2018-11-23 13:13:27,032 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {36556#true} {36556#true} #66#return; {36556#true} is VALID [2018-11-23 13:13:27,032 INFO L256 TraceCheckUtils]: 3: Hoare triple {36556#true} call #t~ret9 := main(); {36556#true} is VALID [2018-11-23 13:13:27,033 INFO L273 TraceCheckUtils]: 4: Hoare triple {36556#true} havoc ~n0~0;havoc ~n1~0;~i0~0 := 0;~k~0 := 0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n0~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~n1~0 := #t~nondet2;havoc #t~nondet2; {36558#(<= main_~i0~0 0)} is VALID [2018-11-23 13:13:27,033 INFO L273 TraceCheckUtils]: 5: Hoare triple {36558#(<= main_~i0~0 0)} assume !!(-1000000 <= ~n0~0 && ~n0~0 < 1000000); {36558#(<= main_~i0~0 0)} is VALID [2018-11-23 13:13:27,034 INFO L273 TraceCheckUtils]: 6: Hoare triple {36558#(<= main_~i0~0 0)} assume !!(-1000000 <= ~n1~0 && ~n1~0 < 1000000); {36558#(<= main_~i0~0 0)} is VALID [2018-11-23 13:13:27,035 INFO L273 TraceCheckUtils]: 7: Hoare triple {36558#(<= main_~i0~0 0)} assume !!(~i0~0 < ~n0~0);#t~post3 := ~i0~0;~i0~0 := 1 + #t~post3;havoc #t~post3;#t~post4 := ~k~0;~k~0 := 1 + #t~post4;havoc #t~post4; {36559#(<= main_~i0~0 1)} is VALID [2018-11-23 13:13:27,035 INFO L273 TraceCheckUtils]: 8: Hoare triple {36559#(<= main_~i0~0 1)} assume !(~i0~0 < ~n0~0); {36560#(<= main_~n0~0 1)} is VALID [2018-11-23 13:13:27,036 INFO L273 TraceCheckUtils]: 9: Hoare triple {36560#(<= main_~n0~0 1)} ~i1~0 := 0; {36561#(<= (+ main_~i1~0 main_~n0~0) 1)} is VALID [2018-11-23 13:13:27,037 INFO L273 TraceCheckUtils]: 10: Hoare triple {36561#(<= (+ main_~i1~0 main_~n0~0) 1)} assume !!(~i1~0 < ~n1~0);#t~post5 := ~i1~0;~i1~0 := 1 + #t~post5;havoc #t~post5;#t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {36562#(<= (+ main_~i1~0 main_~n0~0) 2)} is VALID [2018-11-23 13:13:27,037 INFO L273 TraceCheckUtils]: 11: Hoare triple {36562#(<= (+ main_~i1~0 main_~n0~0) 2)} assume !!(~i1~0 < ~n1~0);#t~post5 := ~i1~0;~i1~0 := 1 + #t~post5;havoc #t~post5;#t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {36563#(<= (+ main_~i1~0 main_~n0~0) 3)} is VALID [2018-11-23 13:13:27,038 INFO L273 TraceCheckUtils]: 12: Hoare triple {36563#(<= (+ main_~i1~0 main_~n0~0) 3)} assume !!(~i1~0 < ~n1~0);#t~post5 := ~i1~0;~i1~0 := 1 + #t~post5;havoc #t~post5;#t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {36564#(<= (+ main_~i1~0 main_~n0~0) 4)} is VALID [2018-11-23 13:13:27,039 INFO L273 TraceCheckUtils]: 13: Hoare triple {36564#(<= (+ main_~i1~0 main_~n0~0) 4)} assume !!(~i1~0 < ~n1~0);#t~post5 := ~i1~0;~i1~0 := 1 + #t~post5;havoc #t~post5;#t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {36565#(<= (+ main_~i1~0 main_~n0~0) 5)} is VALID [2018-11-23 13:13:27,040 INFO L273 TraceCheckUtils]: 14: Hoare triple {36565#(<= (+ main_~i1~0 main_~n0~0) 5)} assume !!(~i1~0 < ~n1~0);#t~post5 := ~i1~0;~i1~0 := 1 + #t~post5;havoc #t~post5;#t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {36566#(<= (+ main_~i1~0 main_~n0~0) 6)} is VALID [2018-11-23 13:13:27,041 INFO L273 TraceCheckUtils]: 15: Hoare triple {36566#(<= (+ main_~i1~0 main_~n0~0) 6)} assume !!(~i1~0 < ~n1~0);#t~post5 := ~i1~0;~i1~0 := 1 + #t~post5;havoc #t~post5;#t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {36567#(<= (+ main_~i1~0 main_~n0~0) 7)} is VALID [2018-11-23 13:13:27,042 INFO L273 TraceCheckUtils]: 16: Hoare triple {36567#(<= (+ main_~i1~0 main_~n0~0) 7)} assume !!(~i1~0 < ~n1~0);#t~post5 := ~i1~0;~i1~0 := 1 + #t~post5;havoc #t~post5;#t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {36568#(<= (+ main_~i1~0 main_~n0~0) 8)} is VALID [2018-11-23 13:13:27,042 INFO L273 TraceCheckUtils]: 17: Hoare triple {36568#(<= (+ main_~i1~0 main_~n0~0) 8)} assume !(~i1~0 < ~n1~0); {36569#(<= (+ main_~n0~0 main_~n1~0) 8)} is VALID [2018-11-23 13:13:27,043 INFO L273 TraceCheckUtils]: 18: Hoare triple {36569#(<= (+ main_~n0~0 main_~n1~0) 8)} ~j1~0 := 0; {36570#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 8))} is VALID [2018-11-23 13:13:27,044 INFO L273 TraceCheckUtils]: 19: Hoare triple {36570#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 8))} assume !!(~j1~0 < ~n0~0 + ~n1~0); {36570#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 8))} is VALID [2018-11-23 13:13:27,044 INFO L256 TraceCheckUtils]: 20: Hoare triple {36570#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 8))} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {36556#true} is VALID [2018-11-23 13:13:27,044 INFO L273 TraceCheckUtils]: 21: Hoare triple {36556#true} ~cond := #in~cond; {36556#true} is VALID [2018-11-23 13:13:27,044 INFO L273 TraceCheckUtils]: 22: Hoare triple {36556#true} assume !(0 == ~cond); {36556#true} is VALID [2018-11-23 13:13:27,044 INFO L273 TraceCheckUtils]: 23: Hoare triple {36556#true} assume true; {36556#true} is VALID [2018-11-23 13:13:27,045 INFO L268 TraceCheckUtils]: 24: Hoare quadruple {36556#true} {36570#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 8))} #70#return; {36570#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 8))} is VALID [2018-11-23 13:13:27,046 INFO L273 TraceCheckUtils]: 25: Hoare triple {36570#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 8))} #t~post7 := ~j1~0;~j1~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~k~0;~k~0 := #t~post8 - 1;havoc #t~post8; {36571#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 7))} is VALID [2018-11-23 13:13:27,047 INFO L273 TraceCheckUtils]: 26: Hoare triple {36571#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 7))} assume !!(~j1~0 < ~n0~0 + ~n1~0); {36571#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 7))} is VALID [2018-11-23 13:13:27,047 INFO L256 TraceCheckUtils]: 27: Hoare triple {36571#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 7))} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {36556#true} is VALID [2018-11-23 13:13:27,047 INFO L273 TraceCheckUtils]: 28: Hoare triple {36556#true} ~cond := #in~cond; {36556#true} is VALID [2018-11-23 13:13:27,047 INFO L273 TraceCheckUtils]: 29: Hoare triple {36556#true} assume !(0 == ~cond); {36556#true} is VALID [2018-11-23 13:13:27,048 INFO L273 TraceCheckUtils]: 30: Hoare triple {36556#true} assume true; {36556#true} is VALID [2018-11-23 13:13:27,048 INFO L268 TraceCheckUtils]: 31: Hoare quadruple {36556#true} {36571#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 7))} #70#return; {36571#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 7))} is VALID [2018-11-23 13:13:27,049 INFO L273 TraceCheckUtils]: 32: Hoare triple {36571#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 7))} #t~post7 := ~j1~0;~j1~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~k~0;~k~0 := #t~post8 - 1;havoc #t~post8; {36572#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 6))} is VALID [2018-11-23 13:13:27,050 INFO L273 TraceCheckUtils]: 33: Hoare triple {36572#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 6))} assume !!(~j1~0 < ~n0~0 + ~n1~0); {36572#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 6))} is VALID [2018-11-23 13:13:27,050 INFO L256 TraceCheckUtils]: 34: Hoare triple {36572#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 6))} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {36556#true} is VALID [2018-11-23 13:13:27,050 INFO L273 TraceCheckUtils]: 35: Hoare triple {36556#true} ~cond := #in~cond; {36556#true} is VALID [2018-11-23 13:13:27,050 INFO L273 TraceCheckUtils]: 36: Hoare triple {36556#true} assume !(0 == ~cond); {36556#true} is VALID [2018-11-23 13:13:27,051 INFO L273 TraceCheckUtils]: 37: Hoare triple {36556#true} assume true; {36556#true} is VALID [2018-11-23 13:13:27,051 INFO L268 TraceCheckUtils]: 38: Hoare quadruple {36556#true} {36572#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 6))} #70#return; {36572#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 6))} is VALID [2018-11-23 13:13:27,052 INFO L273 TraceCheckUtils]: 39: Hoare triple {36572#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 6))} #t~post7 := ~j1~0;~j1~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~k~0;~k~0 := #t~post8 - 1;havoc #t~post8; {36573#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 5))} is VALID [2018-11-23 13:13:27,053 INFO L273 TraceCheckUtils]: 40: Hoare triple {36573#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 5))} assume !!(~j1~0 < ~n0~0 + ~n1~0); {36573#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 5))} is VALID [2018-11-23 13:13:27,053 INFO L256 TraceCheckUtils]: 41: Hoare triple {36573#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 5))} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {36556#true} is VALID [2018-11-23 13:13:27,053 INFO L273 TraceCheckUtils]: 42: Hoare triple {36556#true} ~cond := #in~cond; {36556#true} is VALID [2018-11-23 13:13:27,053 INFO L273 TraceCheckUtils]: 43: Hoare triple {36556#true} assume !(0 == ~cond); {36556#true} is VALID [2018-11-23 13:13:27,053 INFO L273 TraceCheckUtils]: 44: Hoare triple {36556#true} assume true; {36556#true} is VALID [2018-11-23 13:13:27,054 INFO L268 TraceCheckUtils]: 45: Hoare quadruple {36556#true} {36573#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 5))} #70#return; {36573#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 5))} is VALID [2018-11-23 13:13:27,055 INFO L273 TraceCheckUtils]: 46: Hoare triple {36573#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 5))} #t~post7 := ~j1~0;~j1~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~k~0;~k~0 := #t~post8 - 1;havoc #t~post8; {36574#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 4))} is VALID [2018-11-23 13:13:27,056 INFO L273 TraceCheckUtils]: 47: Hoare triple {36574#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 4))} assume !!(~j1~0 < ~n0~0 + ~n1~0); {36574#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 4))} is VALID [2018-11-23 13:13:27,056 INFO L256 TraceCheckUtils]: 48: Hoare triple {36574#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 4))} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {36556#true} is VALID [2018-11-23 13:13:27,056 INFO L273 TraceCheckUtils]: 49: Hoare triple {36556#true} ~cond := #in~cond; {36556#true} is VALID [2018-11-23 13:13:27,056 INFO L273 TraceCheckUtils]: 50: Hoare triple {36556#true} assume !(0 == ~cond); {36556#true} is VALID [2018-11-23 13:13:27,056 INFO L273 TraceCheckUtils]: 51: Hoare triple {36556#true} assume true; {36556#true} is VALID [2018-11-23 13:13:27,057 INFO L268 TraceCheckUtils]: 52: Hoare quadruple {36556#true} {36574#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 4))} #70#return; {36574#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 4))} is VALID [2018-11-23 13:13:27,058 INFO L273 TraceCheckUtils]: 53: Hoare triple {36574#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 4))} #t~post7 := ~j1~0;~j1~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~k~0;~k~0 := #t~post8 - 1;havoc #t~post8; {36575#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 3))} is VALID [2018-11-23 13:13:27,059 INFO L273 TraceCheckUtils]: 54: Hoare triple {36575#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 3))} assume !!(~j1~0 < ~n0~0 + ~n1~0); {36575#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 3))} is VALID [2018-11-23 13:13:27,059 INFO L256 TraceCheckUtils]: 55: Hoare triple {36575#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 3))} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {36556#true} is VALID [2018-11-23 13:13:27,059 INFO L273 TraceCheckUtils]: 56: Hoare triple {36556#true} ~cond := #in~cond; {36556#true} is VALID [2018-11-23 13:13:27,059 INFO L273 TraceCheckUtils]: 57: Hoare triple {36556#true} assume !(0 == ~cond); {36556#true} is VALID [2018-11-23 13:13:27,059 INFO L273 TraceCheckUtils]: 58: Hoare triple {36556#true} assume true; {36556#true} is VALID [2018-11-23 13:13:27,060 INFO L268 TraceCheckUtils]: 59: Hoare quadruple {36556#true} {36575#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 3))} #70#return; {36575#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 3))} is VALID [2018-11-23 13:13:27,061 INFO L273 TraceCheckUtils]: 60: Hoare triple {36575#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 3))} #t~post7 := ~j1~0;~j1~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~k~0;~k~0 := #t~post8 - 1;havoc #t~post8; {36576#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 2))} is VALID [2018-11-23 13:13:27,062 INFO L273 TraceCheckUtils]: 61: Hoare triple {36576#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 2))} assume !!(~j1~0 < ~n0~0 + ~n1~0); {36576#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 2))} is VALID [2018-11-23 13:13:27,062 INFO L256 TraceCheckUtils]: 62: Hoare triple {36576#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 2))} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {36556#true} is VALID [2018-11-23 13:13:27,062 INFO L273 TraceCheckUtils]: 63: Hoare triple {36556#true} ~cond := #in~cond; {36556#true} is VALID [2018-11-23 13:13:27,062 INFO L273 TraceCheckUtils]: 64: Hoare triple {36556#true} assume !(0 == ~cond); {36556#true} is VALID [2018-11-23 13:13:27,062 INFO L273 TraceCheckUtils]: 65: Hoare triple {36556#true} assume true; {36556#true} is VALID [2018-11-23 13:13:27,063 INFO L268 TraceCheckUtils]: 66: Hoare quadruple {36556#true} {36576#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 2))} #70#return; {36576#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 2))} is VALID [2018-11-23 13:13:27,064 INFO L273 TraceCheckUtils]: 67: Hoare triple {36576#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 2))} #t~post7 := ~j1~0;~j1~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~k~0;~k~0 := #t~post8 - 1;havoc #t~post8; {36577#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 1))} is VALID [2018-11-23 13:13:27,064 INFO L273 TraceCheckUtils]: 68: Hoare triple {36577#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 1))} assume !!(~j1~0 < ~n0~0 + ~n1~0); {36577#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 1))} is VALID [2018-11-23 13:13:27,065 INFO L256 TraceCheckUtils]: 69: Hoare triple {36577#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 1))} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {36556#true} is VALID [2018-11-23 13:13:27,065 INFO L273 TraceCheckUtils]: 70: Hoare triple {36556#true} ~cond := #in~cond; {36556#true} is VALID [2018-11-23 13:13:27,065 INFO L273 TraceCheckUtils]: 71: Hoare triple {36556#true} assume !(0 == ~cond); {36556#true} is VALID [2018-11-23 13:13:27,065 INFO L273 TraceCheckUtils]: 72: Hoare triple {36556#true} assume true; {36556#true} is VALID [2018-11-23 13:13:27,066 INFO L268 TraceCheckUtils]: 73: Hoare quadruple {36556#true} {36577#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 1))} #70#return; {36577#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 1))} is VALID [2018-11-23 13:13:27,067 INFO L273 TraceCheckUtils]: 74: Hoare triple {36577#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 1))} #t~post7 := ~j1~0;~j1~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~k~0;~k~0 := #t~post8 - 1;havoc #t~post8; {36578#(<= (+ main_~n0~0 main_~n1~0) main_~j1~0)} is VALID [2018-11-23 13:13:27,067 INFO L273 TraceCheckUtils]: 75: Hoare triple {36578#(<= (+ main_~n0~0 main_~n1~0) main_~j1~0)} assume !!(~j1~0 < ~n0~0 + ~n1~0); {36557#false} is VALID [2018-11-23 13:13:27,068 INFO L256 TraceCheckUtils]: 76: Hoare triple {36557#false} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {36557#false} is VALID [2018-11-23 13:13:27,068 INFO L273 TraceCheckUtils]: 77: Hoare triple {36557#false} ~cond := #in~cond; {36557#false} is VALID [2018-11-23 13:13:27,068 INFO L273 TraceCheckUtils]: 78: Hoare triple {36557#false} assume 0 == ~cond; {36557#false} is VALID [2018-11-23 13:13:27,068 INFO L273 TraceCheckUtils]: 79: Hoare triple {36557#false} assume !false; {36557#false} is VALID [2018-11-23 13:13:27,075 INFO L134 CoverageAnalysis]: Checked inductivity of 257 backedges. 116 proven. 29 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2018-11-23 13:13:27,075 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:13:27,075 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:13:27,084 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 13:13:27,110 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 13:13:27,110 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:13:27,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:13:27,122 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:13:28,047 INFO L256 TraceCheckUtils]: 0: Hoare triple {36556#true} call ULTIMATE.init(); {36556#true} is VALID [2018-11-23 13:13:28,047 INFO L273 TraceCheckUtils]: 1: Hoare triple {36556#true} assume true; {36556#true} is VALID [2018-11-23 13:13:28,047 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {36556#true} {36556#true} #66#return; {36556#true} is VALID [2018-11-23 13:13:28,048 INFO L256 TraceCheckUtils]: 3: Hoare triple {36556#true} call #t~ret9 := main(); {36556#true} is VALID [2018-11-23 13:13:28,048 INFO L273 TraceCheckUtils]: 4: Hoare triple {36556#true} havoc ~n0~0;havoc ~n1~0;~i0~0 := 0;~k~0 := 0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n0~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~n1~0 := #t~nondet2;havoc #t~nondet2; {36558#(<= main_~i0~0 0)} is VALID [2018-11-23 13:13:28,048 INFO L273 TraceCheckUtils]: 5: Hoare triple {36558#(<= main_~i0~0 0)} assume !!(-1000000 <= ~n0~0 && ~n0~0 < 1000000); {36558#(<= main_~i0~0 0)} is VALID [2018-11-23 13:13:28,049 INFO L273 TraceCheckUtils]: 6: Hoare triple {36558#(<= main_~i0~0 0)} assume !!(-1000000 <= ~n1~0 && ~n1~0 < 1000000); {36558#(<= main_~i0~0 0)} is VALID [2018-11-23 13:13:28,049 INFO L273 TraceCheckUtils]: 7: Hoare triple {36558#(<= main_~i0~0 0)} assume !!(~i0~0 < ~n0~0);#t~post3 := ~i0~0;~i0~0 := 1 + #t~post3;havoc #t~post3;#t~post4 := ~k~0;~k~0 := 1 + #t~post4;havoc #t~post4; {36559#(<= main_~i0~0 1)} is VALID [2018-11-23 13:13:28,050 INFO L273 TraceCheckUtils]: 8: Hoare triple {36559#(<= main_~i0~0 1)} assume !(~i0~0 < ~n0~0); {36560#(<= main_~n0~0 1)} is VALID [2018-11-23 13:13:28,050 INFO L273 TraceCheckUtils]: 9: Hoare triple {36560#(<= main_~n0~0 1)} ~i1~0 := 0; {36609#(and (<= main_~i1~0 0) (<= main_~n0~0 1))} is VALID [2018-11-23 13:13:28,050 INFO L273 TraceCheckUtils]: 10: Hoare triple {36609#(and (<= main_~i1~0 0) (<= main_~n0~0 1))} assume !!(~i1~0 < ~n1~0);#t~post5 := ~i1~0;~i1~0 := 1 + #t~post5;havoc #t~post5;#t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {36613#(and (<= main_~i1~0 1) (<= main_~n0~0 1))} is VALID [2018-11-23 13:13:28,051 INFO L273 TraceCheckUtils]: 11: Hoare triple {36613#(and (<= main_~i1~0 1) (<= main_~n0~0 1))} assume !!(~i1~0 < ~n1~0);#t~post5 := ~i1~0;~i1~0 := 1 + #t~post5;havoc #t~post5;#t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {36617#(and (<= main_~i1~0 2) (<= main_~n0~0 1))} is VALID [2018-11-23 13:13:28,052 INFO L273 TraceCheckUtils]: 12: Hoare triple {36617#(and (<= main_~i1~0 2) (<= main_~n0~0 1))} assume !!(~i1~0 < ~n1~0);#t~post5 := ~i1~0;~i1~0 := 1 + #t~post5;havoc #t~post5;#t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {36621#(and (<= main_~i1~0 3) (<= main_~n0~0 1))} is VALID [2018-11-23 13:13:28,052 INFO L273 TraceCheckUtils]: 13: Hoare triple {36621#(and (<= main_~i1~0 3) (<= main_~n0~0 1))} assume !!(~i1~0 < ~n1~0);#t~post5 := ~i1~0;~i1~0 := 1 + #t~post5;havoc #t~post5;#t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {36625#(and (<= main_~i1~0 4) (<= main_~n0~0 1))} is VALID [2018-11-23 13:13:28,053 INFO L273 TraceCheckUtils]: 14: Hoare triple {36625#(and (<= main_~i1~0 4) (<= main_~n0~0 1))} assume !!(~i1~0 < ~n1~0);#t~post5 := ~i1~0;~i1~0 := 1 + #t~post5;havoc #t~post5;#t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {36629#(and (<= main_~i1~0 5) (<= main_~n0~0 1))} is VALID [2018-11-23 13:13:28,054 INFO L273 TraceCheckUtils]: 15: Hoare triple {36629#(and (<= main_~i1~0 5) (<= main_~n0~0 1))} assume !!(~i1~0 < ~n1~0);#t~post5 := ~i1~0;~i1~0 := 1 + #t~post5;havoc #t~post5;#t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {36633#(and (<= main_~n0~0 1) (<= main_~i1~0 6))} is VALID [2018-11-23 13:13:28,055 INFO L273 TraceCheckUtils]: 16: Hoare triple {36633#(and (<= main_~n0~0 1) (<= main_~i1~0 6))} assume !!(~i1~0 < ~n1~0);#t~post5 := ~i1~0;~i1~0 := 1 + #t~post5;havoc #t~post5;#t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {36637#(and (<= main_~i1~0 7) (<= main_~n0~0 1))} is VALID [2018-11-23 13:13:28,056 INFO L273 TraceCheckUtils]: 17: Hoare triple {36637#(and (<= main_~i1~0 7) (<= main_~n0~0 1))} assume !(~i1~0 < ~n1~0); {36641#(and (<= main_~n0~0 1) (<= main_~n1~0 7))} is VALID [2018-11-23 13:13:28,057 INFO L273 TraceCheckUtils]: 18: Hoare triple {36641#(and (<= main_~n0~0 1) (<= main_~n1~0 7))} ~j1~0 := 0; {36645#(and (<= 0 main_~j1~0) (<= main_~n0~0 1) (<= main_~n1~0 7))} is VALID [2018-11-23 13:13:28,057 INFO L273 TraceCheckUtils]: 19: Hoare triple {36645#(and (<= 0 main_~j1~0) (<= main_~n0~0 1) (<= main_~n1~0 7))} assume !!(~j1~0 < ~n0~0 + ~n1~0); {36645#(and (<= 0 main_~j1~0) (<= main_~n0~0 1) (<= main_~n1~0 7))} is VALID [2018-11-23 13:13:28,057 INFO L256 TraceCheckUtils]: 20: Hoare triple {36645#(and (<= 0 main_~j1~0) (<= main_~n0~0 1) (<= main_~n1~0 7))} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {36556#true} is VALID [2018-11-23 13:13:28,058 INFO L273 TraceCheckUtils]: 21: Hoare triple {36556#true} ~cond := #in~cond; {36556#true} is VALID [2018-11-23 13:13:28,058 INFO L273 TraceCheckUtils]: 22: Hoare triple {36556#true} assume !(0 == ~cond); {36556#true} is VALID [2018-11-23 13:13:28,058 INFO L273 TraceCheckUtils]: 23: Hoare triple {36556#true} assume true; {36556#true} is VALID [2018-11-23 13:13:28,059 INFO L268 TraceCheckUtils]: 24: Hoare quadruple {36556#true} {36645#(and (<= 0 main_~j1~0) (<= main_~n0~0 1) (<= main_~n1~0 7))} #70#return; {36645#(and (<= 0 main_~j1~0) (<= main_~n0~0 1) (<= main_~n1~0 7))} is VALID [2018-11-23 13:13:28,060 INFO L273 TraceCheckUtils]: 25: Hoare triple {36645#(and (<= 0 main_~j1~0) (<= main_~n0~0 1) (<= main_~n1~0 7))} #t~post7 := ~j1~0;~j1~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~k~0;~k~0 := #t~post8 - 1;havoc #t~post8; {36667#(and (<= 1 main_~j1~0) (<= main_~n0~0 1) (<= main_~n1~0 7))} is VALID [2018-11-23 13:13:28,061 INFO L273 TraceCheckUtils]: 26: Hoare triple {36667#(and (<= 1 main_~j1~0) (<= main_~n0~0 1) (<= main_~n1~0 7))} assume !!(~j1~0 < ~n0~0 + ~n1~0); {36667#(and (<= 1 main_~j1~0) (<= main_~n0~0 1) (<= main_~n1~0 7))} is VALID [2018-11-23 13:13:28,061 INFO L256 TraceCheckUtils]: 27: Hoare triple {36667#(and (<= 1 main_~j1~0) (<= main_~n0~0 1) (<= main_~n1~0 7))} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {36556#true} is VALID [2018-11-23 13:13:28,061 INFO L273 TraceCheckUtils]: 28: Hoare triple {36556#true} ~cond := #in~cond; {36556#true} is VALID [2018-11-23 13:13:28,061 INFO L273 TraceCheckUtils]: 29: Hoare triple {36556#true} assume !(0 == ~cond); {36556#true} is VALID [2018-11-23 13:13:28,061 INFO L273 TraceCheckUtils]: 30: Hoare triple {36556#true} assume true; {36556#true} is VALID [2018-11-23 13:13:28,062 INFO L268 TraceCheckUtils]: 31: Hoare quadruple {36556#true} {36667#(and (<= 1 main_~j1~0) (<= main_~n0~0 1) (<= main_~n1~0 7))} #70#return; {36667#(and (<= 1 main_~j1~0) (<= main_~n0~0 1) (<= main_~n1~0 7))} is VALID [2018-11-23 13:13:28,063 INFO L273 TraceCheckUtils]: 32: Hoare triple {36667#(and (<= 1 main_~j1~0) (<= main_~n0~0 1) (<= main_~n1~0 7))} #t~post7 := ~j1~0;~j1~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~k~0;~k~0 := #t~post8 - 1;havoc #t~post8; {36689#(and (<= main_~n0~0 1) (<= 2 main_~j1~0) (<= main_~n1~0 7))} is VALID [2018-11-23 13:13:28,064 INFO L273 TraceCheckUtils]: 33: Hoare triple {36689#(and (<= main_~n0~0 1) (<= 2 main_~j1~0) (<= main_~n1~0 7))} assume !!(~j1~0 < ~n0~0 + ~n1~0); {36689#(and (<= main_~n0~0 1) (<= 2 main_~j1~0) (<= main_~n1~0 7))} is VALID [2018-11-23 13:13:28,064 INFO L256 TraceCheckUtils]: 34: Hoare triple {36689#(and (<= main_~n0~0 1) (<= 2 main_~j1~0) (<= main_~n1~0 7))} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {36556#true} is VALID [2018-11-23 13:13:28,064 INFO L273 TraceCheckUtils]: 35: Hoare triple {36556#true} ~cond := #in~cond; {36556#true} is VALID [2018-11-23 13:13:28,065 INFO L273 TraceCheckUtils]: 36: Hoare triple {36556#true} assume !(0 == ~cond); {36556#true} is VALID [2018-11-23 13:13:28,065 INFO L273 TraceCheckUtils]: 37: Hoare triple {36556#true} assume true; {36556#true} is VALID [2018-11-23 13:13:28,066 INFO L268 TraceCheckUtils]: 38: Hoare quadruple {36556#true} {36689#(and (<= main_~n0~0 1) (<= 2 main_~j1~0) (<= main_~n1~0 7))} #70#return; {36689#(and (<= main_~n0~0 1) (<= 2 main_~j1~0) (<= main_~n1~0 7))} is VALID [2018-11-23 13:13:28,067 INFO L273 TraceCheckUtils]: 39: Hoare triple {36689#(and (<= main_~n0~0 1) (<= 2 main_~j1~0) (<= main_~n1~0 7))} #t~post7 := ~j1~0;~j1~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~k~0;~k~0 := #t~post8 - 1;havoc #t~post8; {36711#(and (<= 3 main_~j1~0) (<= main_~n0~0 1) (<= main_~n1~0 7))} is VALID [2018-11-23 13:13:28,067 INFO L273 TraceCheckUtils]: 40: Hoare triple {36711#(and (<= 3 main_~j1~0) (<= main_~n0~0 1) (<= main_~n1~0 7))} assume !!(~j1~0 < ~n0~0 + ~n1~0); {36711#(and (<= 3 main_~j1~0) (<= main_~n0~0 1) (<= main_~n1~0 7))} is VALID [2018-11-23 13:13:28,067 INFO L256 TraceCheckUtils]: 41: Hoare triple {36711#(and (<= 3 main_~j1~0) (<= main_~n0~0 1) (<= main_~n1~0 7))} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {36556#true} is VALID [2018-11-23 13:13:28,068 INFO L273 TraceCheckUtils]: 42: Hoare triple {36556#true} ~cond := #in~cond; {36556#true} is VALID [2018-11-23 13:13:28,068 INFO L273 TraceCheckUtils]: 43: Hoare triple {36556#true} assume !(0 == ~cond); {36556#true} is VALID [2018-11-23 13:13:28,068 INFO L273 TraceCheckUtils]: 44: Hoare triple {36556#true} assume true; {36556#true} is VALID [2018-11-23 13:13:28,069 INFO L268 TraceCheckUtils]: 45: Hoare quadruple {36556#true} {36711#(and (<= 3 main_~j1~0) (<= main_~n0~0 1) (<= main_~n1~0 7))} #70#return; {36711#(and (<= 3 main_~j1~0) (<= main_~n0~0 1) (<= main_~n1~0 7))} is VALID [2018-11-23 13:13:28,070 INFO L273 TraceCheckUtils]: 46: Hoare triple {36711#(and (<= 3 main_~j1~0) (<= main_~n0~0 1) (<= main_~n1~0 7))} #t~post7 := ~j1~0;~j1~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~k~0;~k~0 := #t~post8 - 1;havoc #t~post8; {36733#(and (<= 4 main_~j1~0) (<= main_~n0~0 1) (<= main_~n1~0 7))} is VALID [2018-11-23 13:13:28,070 INFO L273 TraceCheckUtils]: 47: Hoare triple {36733#(and (<= 4 main_~j1~0) (<= main_~n0~0 1) (<= main_~n1~0 7))} assume !!(~j1~0 < ~n0~0 + ~n1~0); {36733#(and (<= 4 main_~j1~0) (<= main_~n0~0 1) (<= main_~n1~0 7))} is VALID [2018-11-23 13:13:28,071 INFO L256 TraceCheckUtils]: 48: Hoare triple {36733#(and (<= 4 main_~j1~0) (<= main_~n0~0 1) (<= main_~n1~0 7))} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {36556#true} is VALID [2018-11-23 13:13:28,071 INFO L273 TraceCheckUtils]: 49: Hoare triple {36556#true} ~cond := #in~cond; {36556#true} is VALID [2018-11-23 13:13:28,071 INFO L273 TraceCheckUtils]: 50: Hoare triple {36556#true} assume !(0 == ~cond); {36556#true} is VALID [2018-11-23 13:13:28,071 INFO L273 TraceCheckUtils]: 51: Hoare triple {36556#true} assume true; {36556#true} is VALID [2018-11-23 13:13:28,072 INFO L268 TraceCheckUtils]: 52: Hoare quadruple {36556#true} {36733#(and (<= 4 main_~j1~0) (<= main_~n0~0 1) (<= main_~n1~0 7))} #70#return; {36733#(and (<= 4 main_~j1~0) (<= main_~n0~0 1) (<= main_~n1~0 7))} is VALID [2018-11-23 13:13:28,073 INFO L273 TraceCheckUtils]: 53: Hoare triple {36733#(and (<= 4 main_~j1~0) (<= main_~n0~0 1) (<= main_~n1~0 7))} #t~post7 := ~j1~0;~j1~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~k~0;~k~0 := #t~post8 - 1;havoc #t~post8; {36755#(and (<= 5 main_~j1~0) (<= main_~n0~0 1) (<= main_~n1~0 7))} is VALID [2018-11-23 13:13:28,074 INFO L273 TraceCheckUtils]: 54: Hoare triple {36755#(and (<= 5 main_~j1~0) (<= main_~n0~0 1) (<= main_~n1~0 7))} assume !!(~j1~0 < ~n0~0 + ~n1~0); {36755#(and (<= 5 main_~j1~0) (<= main_~n0~0 1) (<= main_~n1~0 7))} is VALID [2018-11-23 13:13:28,074 INFO L256 TraceCheckUtils]: 55: Hoare triple {36755#(and (<= 5 main_~j1~0) (<= main_~n0~0 1) (<= main_~n1~0 7))} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {36556#true} is VALID [2018-11-23 13:13:28,074 INFO L273 TraceCheckUtils]: 56: Hoare triple {36556#true} ~cond := #in~cond; {36556#true} is VALID [2018-11-23 13:13:28,074 INFO L273 TraceCheckUtils]: 57: Hoare triple {36556#true} assume !(0 == ~cond); {36556#true} is VALID [2018-11-23 13:13:28,074 INFO L273 TraceCheckUtils]: 58: Hoare triple {36556#true} assume true; {36556#true} is VALID [2018-11-23 13:13:28,075 INFO L268 TraceCheckUtils]: 59: Hoare quadruple {36556#true} {36755#(and (<= 5 main_~j1~0) (<= main_~n0~0 1) (<= main_~n1~0 7))} #70#return; {36755#(and (<= 5 main_~j1~0) (<= main_~n0~0 1) (<= main_~n1~0 7))} is VALID [2018-11-23 13:13:28,076 INFO L273 TraceCheckUtils]: 60: Hoare triple {36755#(and (<= 5 main_~j1~0) (<= main_~n0~0 1) (<= main_~n1~0 7))} #t~post7 := ~j1~0;~j1~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~k~0;~k~0 := #t~post8 - 1;havoc #t~post8; {36777#(and (<= 6 main_~j1~0) (<= main_~n0~0 1) (<= main_~n1~0 7))} is VALID [2018-11-23 13:13:28,077 INFO L273 TraceCheckUtils]: 61: Hoare triple {36777#(and (<= 6 main_~j1~0) (<= main_~n0~0 1) (<= main_~n1~0 7))} assume !!(~j1~0 < ~n0~0 + ~n1~0); {36777#(and (<= 6 main_~j1~0) (<= main_~n0~0 1) (<= main_~n1~0 7))} is VALID [2018-11-23 13:13:28,077 INFO L256 TraceCheckUtils]: 62: Hoare triple {36777#(and (<= 6 main_~j1~0) (<= main_~n0~0 1) (<= main_~n1~0 7))} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {36556#true} is VALID [2018-11-23 13:13:28,077 INFO L273 TraceCheckUtils]: 63: Hoare triple {36556#true} ~cond := #in~cond; {36556#true} is VALID [2018-11-23 13:13:28,077 INFO L273 TraceCheckUtils]: 64: Hoare triple {36556#true} assume !(0 == ~cond); {36556#true} is VALID [2018-11-23 13:13:28,078 INFO L273 TraceCheckUtils]: 65: Hoare triple {36556#true} assume true; {36556#true} is VALID [2018-11-23 13:13:28,079 INFO L268 TraceCheckUtils]: 66: Hoare quadruple {36556#true} {36777#(and (<= 6 main_~j1~0) (<= main_~n0~0 1) (<= main_~n1~0 7))} #70#return; {36777#(and (<= 6 main_~j1~0) (<= main_~n0~0 1) (<= main_~n1~0 7))} is VALID [2018-11-23 13:13:28,080 INFO L273 TraceCheckUtils]: 67: Hoare triple {36777#(and (<= 6 main_~j1~0) (<= main_~n0~0 1) (<= main_~n1~0 7))} #t~post7 := ~j1~0;~j1~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~k~0;~k~0 := #t~post8 - 1;havoc #t~post8; {36799#(and (<= 7 main_~j1~0) (<= main_~n0~0 1) (<= main_~n1~0 7))} is VALID [2018-11-23 13:13:28,080 INFO L273 TraceCheckUtils]: 68: Hoare triple {36799#(and (<= 7 main_~j1~0) (<= main_~n0~0 1) (<= main_~n1~0 7))} assume !!(~j1~0 < ~n0~0 + ~n1~0); {36799#(and (<= 7 main_~j1~0) (<= main_~n0~0 1) (<= main_~n1~0 7))} is VALID [2018-11-23 13:13:28,080 INFO L256 TraceCheckUtils]: 69: Hoare triple {36799#(and (<= 7 main_~j1~0) (<= main_~n0~0 1) (<= main_~n1~0 7))} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {36556#true} is VALID [2018-11-23 13:13:28,081 INFO L273 TraceCheckUtils]: 70: Hoare triple {36556#true} ~cond := #in~cond; {36556#true} is VALID [2018-11-23 13:13:28,081 INFO L273 TraceCheckUtils]: 71: Hoare triple {36556#true} assume !(0 == ~cond); {36556#true} is VALID [2018-11-23 13:13:28,081 INFO L273 TraceCheckUtils]: 72: Hoare triple {36556#true} assume true; {36556#true} is VALID [2018-11-23 13:13:28,082 INFO L268 TraceCheckUtils]: 73: Hoare quadruple {36556#true} {36799#(and (<= 7 main_~j1~0) (<= main_~n0~0 1) (<= main_~n1~0 7))} #70#return; {36799#(and (<= 7 main_~j1~0) (<= main_~n0~0 1) (<= main_~n1~0 7))} is VALID [2018-11-23 13:13:28,083 INFO L273 TraceCheckUtils]: 74: Hoare triple {36799#(and (<= 7 main_~j1~0) (<= main_~n0~0 1) (<= main_~n1~0 7))} #t~post7 := ~j1~0;~j1~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~k~0;~k~0 := #t~post8 - 1;havoc #t~post8; {36821#(and (<= 8 main_~j1~0) (<= main_~n0~0 1) (<= main_~n1~0 7))} is VALID [2018-11-23 13:13:28,083 INFO L273 TraceCheckUtils]: 75: Hoare triple {36821#(and (<= 8 main_~j1~0) (<= main_~n0~0 1) (<= main_~n1~0 7))} assume !!(~j1~0 < ~n0~0 + ~n1~0); {36557#false} is VALID [2018-11-23 13:13:28,084 INFO L256 TraceCheckUtils]: 76: Hoare triple {36557#false} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {36557#false} is VALID [2018-11-23 13:13:28,084 INFO L273 TraceCheckUtils]: 77: Hoare triple {36557#false} ~cond := #in~cond; {36557#false} is VALID [2018-11-23 13:13:28,084 INFO L273 TraceCheckUtils]: 78: Hoare triple {36557#false} assume 0 == ~cond; {36557#false} is VALID [2018-11-23 13:13:28,084 INFO L273 TraceCheckUtils]: 79: Hoare triple {36557#false} assume !false; {36557#false} is VALID [2018-11-23 13:13:28,091 INFO L134 CoverageAnalysis]: Checked inductivity of 257 backedges. 116 proven. 29 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2018-11-23 13:13:28,109 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:13:28,109 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 41 [2018-11-23 13:13:28,110 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 80 [2018-11-23 13:13:28,110 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:13:28,110 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 41 states. [2018-11-23 13:13:28,207 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 102 edges. 102 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:13:28,207 INFO L459 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-11-23 13:13:28,208 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-11-23 13:13:28,208 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=326, Invalid=1314, Unknown=0, NotChecked=0, Total=1640 [2018-11-23 13:13:28,208 INFO L87 Difference]: Start difference. First operand 100 states and 110 transitions. Second operand 41 states. [2018-11-23 13:13:32,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:13:32,401 INFO L93 Difference]: Finished difference Result 205 states and 244 transitions. [2018-11-23 13:13:32,401 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-11-23 13:13:32,401 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 80 [2018-11-23 13:13:32,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:13:32,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-11-23 13:13:32,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 102 transitions. [2018-11-23 13:13:32,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-11-23 13:13:32,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 102 transitions. [2018-11-23 13:13:32,404 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 32 states and 102 transitions. [2018-11-23 13:13:32,499 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 102 edges. 102 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:13:32,503 INFO L225 Difference]: With dead ends: 205 [2018-11-23 13:13:32,503 INFO L226 Difference]: Without dead ends: 170 [2018-11-23 13:13:32,503 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1384 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=903, Invalid=3789, Unknown=0, NotChecked=0, Total=4692 [2018-11-23 13:13:32,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2018-11-23 13:13:33,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 100. [2018-11-23 13:13:33,285 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:13:33,285 INFO L82 GeneralOperation]: Start isEquivalent. First operand 170 states. Second operand 100 states. [2018-11-23 13:13:33,285 INFO L74 IsIncluded]: Start isIncluded. First operand 170 states. Second operand 100 states. [2018-11-23 13:13:33,285 INFO L87 Difference]: Start difference. First operand 170 states. Second operand 100 states. [2018-11-23 13:13:33,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:13:33,288 INFO L93 Difference]: Finished difference Result 170 states and 200 transitions. [2018-11-23 13:13:33,288 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 200 transitions. [2018-11-23 13:13:33,289 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:13:33,289 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:13:33,289 INFO L74 IsIncluded]: Start isIncluded. First operand 100 states. Second operand 170 states. [2018-11-23 13:13:33,289 INFO L87 Difference]: Start difference. First operand 100 states. Second operand 170 states. [2018-11-23 13:13:33,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:13:33,291 INFO L93 Difference]: Finished difference Result 170 states and 200 transitions. [2018-11-23 13:13:33,292 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 200 transitions. [2018-11-23 13:13:33,292 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:13:33,292 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:13:33,292 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:13:33,292 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:13:33,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-11-23 13:13:33,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 110 transitions. [2018-11-23 13:13:33,293 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 110 transitions. Word has length 80 [2018-11-23 13:13:33,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:13:33,294 INFO L480 AbstractCegarLoop]: Abstraction has 100 states and 110 transitions. [2018-11-23 13:13:33,294 INFO L481 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-11-23 13:13:33,294 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 110 transitions. [2018-11-23 13:13:33,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-11-23 13:13:33,294 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:13:33,294 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 9, 8, 8, 8, 8, 6, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:13:33,294 INFO L423 AbstractCegarLoop]: === Iteration 47 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:13:33,295 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:13:33,295 INFO L82 PathProgramCache]: Analyzing trace with hash 1289253295, now seen corresponding path program 23 times [2018-11-23 13:13:33,295 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:13:33,295 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:13:33,295 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:13:33,296 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:13:33,296 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:13:33,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:13:33,649 INFO L256 TraceCheckUtils]: 0: Hoare triple {37709#true} call ULTIMATE.init(); {37709#true} is VALID [2018-11-23 13:13:33,650 INFO L273 TraceCheckUtils]: 1: Hoare triple {37709#true} assume true; {37709#true} is VALID [2018-11-23 13:13:33,650 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {37709#true} {37709#true} #66#return; {37709#true} is VALID [2018-11-23 13:13:33,650 INFO L256 TraceCheckUtils]: 3: Hoare triple {37709#true} call #t~ret9 := main(); {37709#true} is VALID [2018-11-23 13:13:33,651 INFO L273 TraceCheckUtils]: 4: Hoare triple {37709#true} havoc ~n0~0;havoc ~n1~0;~i0~0 := 0;~k~0 := 0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n0~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~n1~0 := #t~nondet2;havoc #t~nondet2; {37711#(<= main_~i0~0 0)} is VALID [2018-11-23 13:13:33,651 INFO L273 TraceCheckUtils]: 5: Hoare triple {37711#(<= main_~i0~0 0)} assume !!(-1000000 <= ~n0~0 && ~n0~0 < 1000000); {37711#(<= main_~i0~0 0)} is VALID [2018-11-23 13:13:33,652 INFO L273 TraceCheckUtils]: 6: Hoare triple {37711#(<= main_~i0~0 0)} assume !!(-1000000 <= ~n1~0 && ~n1~0 < 1000000); {37711#(<= main_~i0~0 0)} is VALID [2018-11-23 13:13:33,653 INFO L273 TraceCheckUtils]: 7: Hoare triple {37711#(<= main_~i0~0 0)} assume !!(~i0~0 < ~n0~0);#t~post3 := ~i0~0;~i0~0 := 1 + #t~post3;havoc #t~post3;#t~post4 := ~k~0;~k~0 := 1 + #t~post4;havoc #t~post4; {37712#(<= main_~i0~0 1)} is VALID [2018-11-23 13:13:33,653 INFO L273 TraceCheckUtils]: 8: Hoare triple {37712#(<= main_~i0~0 1)} assume !!(~i0~0 < ~n0~0);#t~post3 := ~i0~0;~i0~0 := 1 + #t~post3;havoc #t~post3;#t~post4 := ~k~0;~k~0 := 1 + #t~post4;havoc #t~post4; {37713#(<= main_~i0~0 2)} is VALID [2018-11-23 13:13:33,654 INFO L273 TraceCheckUtils]: 9: Hoare triple {37713#(<= main_~i0~0 2)} assume !(~i0~0 < ~n0~0); {37714#(<= main_~n0~0 2)} is VALID [2018-11-23 13:13:33,655 INFO L273 TraceCheckUtils]: 10: Hoare triple {37714#(<= main_~n0~0 2)} ~i1~0 := 0; {37715#(<= (+ main_~i1~0 main_~n0~0) 2)} is VALID [2018-11-23 13:13:33,655 INFO L273 TraceCheckUtils]: 11: Hoare triple {37715#(<= (+ main_~i1~0 main_~n0~0) 2)} assume !!(~i1~0 < ~n1~0);#t~post5 := ~i1~0;~i1~0 := 1 + #t~post5;havoc #t~post5;#t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {37716#(<= (+ main_~i1~0 main_~n0~0) 3)} is VALID [2018-11-23 13:13:33,656 INFO L273 TraceCheckUtils]: 12: Hoare triple {37716#(<= (+ main_~i1~0 main_~n0~0) 3)} assume !!(~i1~0 < ~n1~0);#t~post5 := ~i1~0;~i1~0 := 1 + #t~post5;havoc #t~post5;#t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {37717#(<= (+ main_~i1~0 main_~n0~0) 4)} is VALID [2018-11-23 13:13:33,657 INFO L273 TraceCheckUtils]: 13: Hoare triple {37717#(<= (+ main_~i1~0 main_~n0~0) 4)} assume !!(~i1~0 < ~n1~0);#t~post5 := ~i1~0;~i1~0 := 1 + #t~post5;havoc #t~post5;#t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {37718#(<= (+ main_~i1~0 main_~n0~0) 5)} is VALID [2018-11-23 13:13:33,658 INFO L273 TraceCheckUtils]: 14: Hoare triple {37718#(<= (+ main_~i1~0 main_~n0~0) 5)} assume !!(~i1~0 < ~n1~0);#t~post5 := ~i1~0;~i1~0 := 1 + #t~post5;havoc #t~post5;#t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {37719#(<= (+ main_~i1~0 main_~n0~0) 6)} is VALID [2018-11-23 13:13:33,659 INFO L273 TraceCheckUtils]: 15: Hoare triple {37719#(<= (+ main_~i1~0 main_~n0~0) 6)} assume !!(~i1~0 < ~n1~0);#t~post5 := ~i1~0;~i1~0 := 1 + #t~post5;havoc #t~post5;#t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {37720#(<= (+ main_~i1~0 main_~n0~0) 7)} is VALID [2018-11-23 13:13:33,660 INFO L273 TraceCheckUtils]: 16: Hoare triple {37720#(<= (+ main_~i1~0 main_~n0~0) 7)} assume !!(~i1~0 < ~n1~0);#t~post5 := ~i1~0;~i1~0 := 1 + #t~post5;havoc #t~post5;#t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {37721#(<= (+ main_~i1~0 main_~n0~0) 8)} is VALID [2018-11-23 13:13:33,660 INFO L273 TraceCheckUtils]: 17: Hoare triple {37721#(<= (+ main_~i1~0 main_~n0~0) 8)} assume !(~i1~0 < ~n1~0); {37722#(<= (+ main_~n0~0 main_~n1~0) 8)} is VALID [2018-11-23 13:13:33,661 INFO L273 TraceCheckUtils]: 18: Hoare triple {37722#(<= (+ main_~n0~0 main_~n1~0) 8)} ~j1~0 := 0; {37723#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 8))} is VALID [2018-11-23 13:13:33,662 INFO L273 TraceCheckUtils]: 19: Hoare triple {37723#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 8))} assume !!(~j1~0 < ~n0~0 + ~n1~0); {37723#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 8))} is VALID [2018-11-23 13:13:33,662 INFO L256 TraceCheckUtils]: 20: Hoare triple {37723#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 8))} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {37709#true} is VALID [2018-11-23 13:13:33,662 INFO L273 TraceCheckUtils]: 21: Hoare triple {37709#true} ~cond := #in~cond; {37709#true} is VALID [2018-11-23 13:13:33,662 INFO L273 TraceCheckUtils]: 22: Hoare triple {37709#true} assume !(0 == ~cond); {37709#true} is VALID [2018-11-23 13:13:33,662 INFO L273 TraceCheckUtils]: 23: Hoare triple {37709#true} assume true; {37709#true} is VALID [2018-11-23 13:13:33,663 INFO L268 TraceCheckUtils]: 24: Hoare quadruple {37709#true} {37723#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 8))} #70#return; {37723#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 8))} is VALID [2018-11-23 13:13:33,664 INFO L273 TraceCheckUtils]: 25: Hoare triple {37723#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 8))} #t~post7 := ~j1~0;~j1~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~k~0;~k~0 := #t~post8 - 1;havoc #t~post8; {37724#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 7))} is VALID [2018-11-23 13:13:33,665 INFO L273 TraceCheckUtils]: 26: Hoare triple {37724#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 7))} assume !!(~j1~0 < ~n0~0 + ~n1~0); {37724#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 7))} is VALID [2018-11-23 13:13:33,665 INFO L256 TraceCheckUtils]: 27: Hoare triple {37724#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 7))} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {37709#true} is VALID [2018-11-23 13:13:33,665 INFO L273 TraceCheckUtils]: 28: Hoare triple {37709#true} ~cond := #in~cond; {37709#true} is VALID [2018-11-23 13:13:33,665 INFO L273 TraceCheckUtils]: 29: Hoare triple {37709#true} assume !(0 == ~cond); {37709#true} is VALID [2018-11-23 13:13:33,666 INFO L273 TraceCheckUtils]: 30: Hoare triple {37709#true} assume true; {37709#true} is VALID [2018-11-23 13:13:33,666 INFO L268 TraceCheckUtils]: 31: Hoare quadruple {37709#true} {37724#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 7))} #70#return; {37724#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 7))} is VALID [2018-11-23 13:13:33,667 INFO L273 TraceCheckUtils]: 32: Hoare triple {37724#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 7))} #t~post7 := ~j1~0;~j1~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~k~0;~k~0 := #t~post8 - 1;havoc #t~post8; {37725#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 6))} is VALID [2018-11-23 13:13:33,668 INFO L273 TraceCheckUtils]: 33: Hoare triple {37725#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 6))} assume !!(~j1~0 < ~n0~0 + ~n1~0); {37725#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 6))} is VALID [2018-11-23 13:13:33,668 INFO L256 TraceCheckUtils]: 34: Hoare triple {37725#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 6))} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {37709#true} is VALID [2018-11-23 13:13:33,668 INFO L273 TraceCheckUtils]: 35: Hoare triple {37709#true} ~cond := #in~cond; {37709#true} is VALID [2018-11-23 13:13:33,668 INFO L273 TraceCheckUtils]: 36: Hoare triple {37709#true} assume !(0 == ~cond); {37709#true} is VALID [2018-11-23 13:13:33,669 INFO L273 TraceCheckUtils]: 37: Hoare triple {37709#true} assume true; {37709#true} is VALID [2018-11-23 13:13:33,669 INFO L268 TraceCheckUtils]: 38: Hoare quadruple {37709#true} {37725#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 6))} #70#return; {37725#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 6))} is VALID [2018-11-23 13:13:33,670 INFO L273 TraceCheckUtils]: 39: Hoare triple {37725#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 6))} #t~post7 := ~j1~0;~j1~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~k~0;~k~0 := #t~post8 - 1;havoc #t~post8; {37726#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 5))} is VALID [2018-11-23 13:13:33,671 INFO L273 TraceCheckUtils]: 40: Hoare triple {37726#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 5))} assume !!(~j1~0 < ~n0~0 + ~n1~0); {37726#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 5))} is VALID [2018-11-23 13:13:33,671 INFO L256 TraceCheckUtils]: 41: Hoare triple {37726#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 5))} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {37709#true} is VALID [2018-11-23 13:13:33,671 INFO L273 TraceCheckUtils]: 42: Hoare triple {37709#true} ~cond := #in~cond; {37709#true} is VALID [2018-11-23 13:13:33,671 INFO L273 TraceCheckUtils]: 43: Hoare triple {37709#true} assume !(0 == ~cond); {37709#true} is VALID [2018-11-23 13:13:33,671 INFO L273 TraceCheckUtils]: 44: Hoare triple {37709#true} assume true; {37709#true} is VALID [2018-11-23 13:13:33,672 INFO L268 TraceCheckUtils]: 45: Hoare quadruple {37709#true} {37726#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 5))} #70#return; {37726#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 5))} is VALID [2018-11-23 13:13:33,673 INFO L273 TraceCheckUtils]: 46: Hoare triple {37726#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 5))} #t~post7 := ~j1~0;~j1~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~k~0;~k~0 := #t~post8 - 1;havoc #t~post8; {37727#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 4))} is VALID [2018-11-23 13:13:33,674 INFO L273 TraceCheckUtils]: 47: Hoare triple {37727#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 4))} assume !!(~j1~0 < ~n0~0 + ~n1~0); {37727#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 4))} is VALID [2018-11-23 13:13:33,674 INFO L256 TraceCheckUtils]: 48: Hoare triple {37727#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 4))} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {37709#true} is VALID [2018-11-23 13:13:33,674 INFO L273 TraceCheckUtils]: 49: Hoare triple {37709#true} ~cond := #in~cond; {37709#true} is VALID [2018-11-23 13:13:33,674 INFO L273 TraceCheckUtils]: 50: Hoare triple {37709#true} assume !(0 == ~cond); {37709#true} is VALID [2018-11-23 13:13:33,674 INFO L273 TraceCheckUtils]: 51: Hoare triple {37709#true} assume true; {37709#true} is VALID [2018-11-23 13:13:33,675 INFO L268 TraceCheckUtils]: 52: Hoare quadruple {37709#true} {37727#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 4))} #70#return; {37727#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 4))} is VALID [2018-11-23 13:13:33,676 INFO L273 TraceCheckUtils]: 53: Hoare triple {37727#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 4))} #t~post7 := ~j1~0;~j1~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~k~0;~k~0 := #t~post8 - 1;havoc #t~post8; {37728#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 3))} is VALID [2018-11-23 13:13:33,677 INFO L273 TraceCheckUtils]: 54: Hoare triple {37728#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 3))} assume !!(~j1~0 < ~n0~0 + ~n1~0); {37728#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 3))} is VALID [2018-11-23 13:13:33,677 INFO L256 TraceCheckUtils]: 55: Hoare triple {37728#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 3))} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {37709#true} is VALID [2018-11-23 13:13:33,677 INFO L273 TraceCheckUtils]: 56: Hoare triple {37709#true} ~cond := #in~cond; {37709#true} is VALID [2018-11-23 13:13:33,677 INFO L273 TraceCheckUtils]: 57: Hoare triple {37709#true} assume !(0 == ~cond); {37709#true} is VALID [2018-11-23 13:13:33,677 INFO L273 TraceCheckUtils]: 58: Hoare triple {37709#true} assume true; {37709#true} is VALID [2018-11-23 13:13:33,678 INFO L268 TraceCheckUtils]: 59: Hoare quadruple {37709#true} {37728#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 3))} #70#return; {37728#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 3))} is VALID [2018-11-23 13:13:33,679 INFO L273 TraceCheckUtils]: 60: Hoare triple {37728#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 3))} #t~post7 := ~j1~0;~j1~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~k~0;~k~0 := #t~post8 - 1;havoc #t~post8; {37729#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 2))} is VALID [2018-11-23 13:13:33,680 INFO L273 TraceCheckUtils]: 61: Hoare triple {37729#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 2))} assume !!(~j1~0 < ~n0~0 + ~n1~0); {37729#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 2))} is VALID [2018-11-23 13:13:33,680 INFO L256 TraceCheckUtils]: 62: Hoare triple {37729#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 2))} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {37709#true} is VALID [2018-11-23 13:13:33,680 INFO L273 TraceCheckUtils]: 63: Hoare triple {37709#true} ~cond := #in~cond; {37709#true} is VALID [2018-11-23 13:13:33,680 INFO L273 TraceCheckUtils]: 64: Hoare triple {37709#true} assume !(0 == ~cond); {37709#true} is VALID [2018-11-23 13:13:33,680 INFO L273 TraceCheckUtils]: 65: Hoare triple {37709#true} assume true; {37709#true} is VALID [2018-11-23 13:13:33,681 INFO L268 TraceCheckUtils]: 66: Hoare quadruple {37709#true} {37729#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 2))} #70#return; {37729#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 2))} is VALID [2018-11-23 13:13:33,682 INFO L273 TraceCheckUtils]: 67: Hoare triple {37729#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 2))} #t~post7 := ~j1~0;~j1~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~k~0;~k~0 := #t~post8 - 1;havoc #t~post8; {37730#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 1))} is VALID [2018-11-23 13:13:33,682 INFO L273 TraceCheckUtils]: 68: Hoare triple {37730#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 1))} assume !!(~j1~0 < ~n0~0 + ~n1~0); {37730#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 1))} is VALID [2018-11-23 13:13:33,683 INFO L256 TraceCheckUtils]: 69: Hoare triple {37730#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 1))} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {37709#true} is VALID [2018-11-23 13:13:33,683 INFO L273 TraceCheckUtils]: 70: Hoare triple {37709#true} ~cond := #in~cond; {37709#true} is VALID [2018-11-23 13:13:33,683 INFO L273 TraceCheckUtils]: 71: Hoare triple {37709#true} assume !(0 == ~cond); {37709#true} is VALID [2018-11-23 13:13:33,683 INFO L273 TraceCheckUtils]: 72: Hoare triple {37709#true} assume true; {37709#true} is VALID [2018-11-23 13:13:33,684 INFO L268 TraceCheckUtils]: 73: Hoare quadruple {37709#true} {37730#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 1))} #70#return; {37730#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 1))} is VALID [2018-11-23 13:13:33,685 INFO L273 TraceCheckUtils]: 74: Hoare triple {37730#(<= (+ main_~n0~0 main_~n1~0) (+ main_~j1~0 1))} #t~post7 := ~j1~0;~j1~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~k~0;~k~0 := #t~post8 - 1;havoc #t~post8; {37731#(<= (+ main_~n0~0 main_~n1~0) main_~j1~0)} is VALID [2018-11-23 13:13:33,685 INFO L273 TraceCheckUtils]: 75: Hoare triple {37731#(<= (+ main_~n0~0 main_~n1~0) main_~j1~0)} assume !!(~j1~0 < ~n0~0 + ~n1~0); {37710#false} is VALID [2018-11-23 13:13:33,686 INFO L256 TraceCheckUtils]: 76: Hoare triple {37710#false} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {37710#false} is VALID [2018-11-23 13:13:33,686 INFO L273 TraceCheckUtils]: 77: Hoare triple {37710#false} ~cond := #in~cond; {37710#false} is VALID [2018-11-23 13:13:33,686 INFO L273 TraceCheckUtils]: 78: Hoare triple {37710#false} assume 0 == ~cond; {37710#false} is VALID [2018-11-23 13:13:33,686 INFO L273 TraceCheckUtils]: 79: Hoare triple {37710#false} assume !false; {37710#false} is VALID [2018-11-23 13:13:33,693 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 116 proven. 24 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2018-11-23 13:13:33,693 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:13:33,693 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:13:33,733 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 13:13:33,764 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 9 check-sat command(s) [2018-11-23 13:13:33,765 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:13:33,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:13:33,779 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:13:34,359 INFO L256 TraceCheckUtils]: 0: Hoare triple {37709#true} call ULTIMATE.init(); {37709#true} is VALID [2018-11-23 13:13:34,360 INFO L273 TraceCheckUtils]: 1: Hoare triple {37709#true} assume true; {37709#true} is VALID [2018-11-23 13:13:34,360 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {37709#true} {37709#true} #66#return; {37709#true} is VALID [2018-11-23 13:13:34,360 INFO L256 TraceCheckUtils]: 3: Hoare triple {37709#true} call #t~ret9 := main(); {37709#true} is VALID [2018-11-23 13:13:34,361 INFO L273 TraceCheckUtils]: 4: Hoare triple {37709#true} havoc ~n0~0;havoc ~n1~0;~i0~0 := 0;~k~0 := 0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n0~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~n1~0 := #t~nondet2;havoc #t~nondet2; {37711#(<= main_~i0~0 0)} is VALID [2018-11-23 13:13:34,361 INFO L273 TraceCheckUtils]: 5: Hoare triple {37711#(<= main_~i0~0 0)} assume !!(-1000000 <= ~n0~0 && ~n0~0 < 1000000); {37711#(<= main_~i0~0 0)} is VALID [2018-11-23 13:13:34,361 INFO L273 TraceCheckUtils]: 6: Hoare triple {37711#(<= main_~i0~0 0)} assume !!(-1000000 <= ~n1~0 && ~n1~0 < 1000000); {37711#(<= main_~i0~0 0)} is VALID [2018-11-23 13:13:34,362 INFO L273 TraceCheckUtils]: 7: Hoare triple {37711#(<= main_~i0~0 0)} assume !!(~i0~0 < ~n0~0);#t~post3 := ~i0~0;~i0~0 := 1 + #t~post3;havoc #t~post3;#t~post4 := ~k~0;~k~0 := 1 + #t~post4;havoc #t~post4; {37712#(<= main_~i0~0 1)} is VALID [2018-11-23 13:13:34,362 INFO L273 TraceCheckUtils]: 8: Hoare triple {37712#(<= main_~i0~0 1)} assume !!(~i0~0 < ~n0~0);#t~post3 := ~i0~0;~i0~0 := 1 + #t~post3;havoc #t~post3;#t~post4 := ~k~0;~k~0 := 1 + #t~post4;havoc #t~post4; {37713#(<= main_~i0~0 2)} is VALID [2018-11-23 13:13:34,363 INFO L273 TraceCheckUtils]: 9: Hoare triple {37713#(<= main_~i0~0 2)} assume !(~i0~0 < ~n0~0); {37714#(<= main_~n0~0 2)} is VALID [2018-11-23 13:13:34,363 INFO L273 TraceCheckUtils]: 10: Hoare triple {37714#(<= main_~n0~0 2)} ~i1~0 := 0; {37765#(and (<= main_~n0~0 2) (<= main_~i1~0 0))} is VALID [2018-11-23 13:13:34,364 INFO L273 TraceCheckUtils]: 11: Hoare triple {37765#(and (<= main_~n0~0 2) (<= main_~i1~0 0))} assume !!(~i1~0 < ~n1~0);#t~post5 := ~i1~0;~i1~0 := 1 + #t~post5;havoc #t~post5;#t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {37769#(and (<= main_~n0~0 2) (<= main_~i1~0 1))} is VALID [2018-11-23 13:13:34,365 INFO L273 TraceCheckUtils]: 12: Hoare triple {37769#(and (<= main_~n0~0 2) (<= main_~i1~0 1))} assume !!(~i1~0 < ~n1~0);#t~post5 := ~i1~0;~i1~0 := 1 + #t~post5;havoc #t~post5;#t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {37773#(and (<= main_~n0~0 2) (<= main_~i1~0 2))} is VALID [2018-11-23 13:13:34,366 INFO L273 TraceCheckUtils]: 13: Hoare triple {37773#(and (<= main_~n0~0 2) (<= main_~i1~0 2))} assume !!(~i1~0 < ~n1~0);#t~post5 := ~i1~0;~i1~0 := 1 + #t~post5;havoc #t~post5;#t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {37777#(and (<= main_~n0~0 2) (<= main_~i1~0 3))} is VALID [2018-11-23 13:13:34,367 INFO L273 TraceCheckUtils]: 14: Hoare triple {37777#(and (<= main_~n0~0 2) (<= main_~i1~0 3))} assume !!(~i1~0 < ~n1~0);#t~post5 := ~i1~0;~i1~0 := 1 + #t~post5;havoc #t~post5;#t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {37781#(and (<= main_~n0~0 2) (<= main_~i1~0 4))} is VALID [2018-11-23 13:13:34,368 INFO L273 TraceCheckUtils]: 15: Hoare triple {37781#(and (<= main_~n0~0 2) (<= main_~i1~0 4))} assume !!(~i1~0 < ~n1~0);#t~post5 := ~i1~0;~i1~0 := 1 + #t~post5;havoc #t~post5;#t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {37785#(and (<= main_~n0~0 2) (<= main_~i1~0 5))} is VALID [2018-11-23 13:13:34,368 INFO L273 TraceCheckUtils]: 16: Hoare triple {37785#(and (<= main_~n0~0 2) (<= main_~i1~0 5))} assume !!(~i1~0 < ~n1~0);#t~post5 := ~i1~0;~i1~0 := 1 + #t~post5;havoc #t~post5;#t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {37789#(and (<= main_~n0~0 2) (<= main_~i1~0 6))} is VALID [2018-11-23 13:13:34,369 INFO L273 TraceCheckUtils]: 17: Hoare triple {37789#(and (<= main_~n0~0 2) (<= main_~i1~0 6))} assume !(~i1~0 < ~n1~0); {37793#(and (<= main_~n0~0 2) (<= main_~n1~0 6))} is VALID [2018-11-23 13:13:34,370 INFO L273 TraceCheckUtils]: 18: Hoare triple {37793#(and (<= main_~n0~0 2) (<= main_~n1~0 6))} ~j1~0 := 0; {37797#(and (<= main_~n0~0 2) (<= main_~n1~0 6) (<= 0 main_~j1~0))} is VALID [2018-11-23 13:13:34,370 INFO L273 TraceCheckUtils]: 19: Hoare triple {37797#(and (<= main_~n0~0 2) (<= main_~n1~0 6) (<= 0 main_~j1~0))} assume !!(~j1~0 < ~n0~0 + ~n1~0); {37797#(and (<= main_~n0~0 2) (<= main_~n1~0 6) (<= 0 main_~j1~0))} is VALID [2018-11-23 13:13:34,371 INFO L256 TraceCheckUtils]: 20: Hoare triple {37797#(and (<= main_~n0~0 2) (<= main_~n1~0 6) (<= 0 main_~j1~0))} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {37709#true} is VALID [2018-11-23 13:13:34,371 INFO L273 TraceCheckUtils]: 21: Hoare triple {37709#true} ~cond := #in~cond; {37709#true} is VALID [2018-11-23 13:13:34,371 INFO L273 TraceCheckUtils]: 22: Hoare triple {37709#true} assume !(0 == ~cond); {37709#true} is VALID [2018-11-23 13:13:34,371 INFO L273 TraceCheckUtils]: 23: Hoare triple {37709#true} assume true; {37709#true} is VALID [2018-11-23 13:13:34,372 INFO L268 TraceCheckUtils]: 24: Hoare quadruple {37709#true} {37797#(and (<= main_~n0~0 2) (<= main_~n1~0 6) (<= 0 main_~j1~0))} #70#return; {37797#(and (<= main_~n0~0 2) (<= main_~n1~0 6) (<= 0 main_~j1~0))} is VALID [2018-11-23 13:13:34,373 INFO L273 TraceCheckUtils]: 25: Hoare triple {37797#(and (<= main_~n0~0 2) (<= main_~n1~0 6) (<= 0 main_~j1~0))} #t~post7 := ~j1~0;~j1~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~k~0;~k~0 := #t~post8 - 1;havoc #t~post8; {37819#(and (<= 1 main_~j1~0) (<= main_~n0~0 2) (<= main_~n1~0 6))} is VALID [2018-11-23 13:13:34,373 INFO L273 TraceCheckUtils]: 26: Hoare triple {37819#(and (<= 1 main_~j1~0) (<= main_~n0~0 2) (<= main_~n1~0 6))} assume !!(~j1~0 < ~n0~0 + ~n1~0); {37819#(and (<= 1 main_~j1~0) (<= main_~n0~0 2) (<= main_~n1~0 6))} is VALID [2018-11-23 13:13:34,374 INFO L256 TraceCheckUtils]: 27: Hoare triple {37819#(and (<= 1 main_~j1~0) (<= main_~n0~0 2) (<= main_~n1~0 6))} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {37709#true} is VALID [2018-11-23 13:13:34,374 INFO L273 TraceCheckUtils]: 28: Hoare triple {37709#true} ~cond := #in~cond; {37709#true} is VALID [2018-11-23 13:13:34,374 INFO L273 TraceCheckUtils]: 29: Hoare triple {37709#true} assume !(0 == ~cond); {37709#true} is VALID [2018-11-23 13:13:34,374 INFO L273 TraceCheckUtils]: 30: Hoare triple {37709#true} assume true; {37709#true} is VALID [2018-11-23 13:13:34,375 INFO L268 TraceCheckUtils]: 31: Hoare quadruple {37709#true} {37819#(and (<= 1 main_~j1~0) (<= main_~n0~0 2) (<= main_~n1~0 6))} #70#return; {37819#(and (<= 1 main_~j1~0) (<= main_~n0~0 2) (<= main_~n1~0 6))} is VALID [2018-11-23 13:13:34,376 INFO L273 TraceCheckUtils]: 32: Hoare triple {37819#(and (<= 1 main_~j1~0) (<= main_~n0~0 2) (<= main_~n1~0 6))} #t~post7 := ~j1~0;~j1~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~k~0;~k~0 := #t~post8 - 1;havoc #t~post8; {37841#(and (<= main_~n0~0 2) (<= main_~n1~0 6) (<= 2 main_~j1~0))} is VALID [2018-11-23 13:13:34,376 INFO L273 TraceCheckUtils]: 33: Hoare triple {37841#(and (<= main_~n0~0 2) (<= main_~n1~0 6) (<= 2 main_~j1~0))} assume !!(~j1~0 < ~n0~0 + ~n1~0); {37841#(and (<= main_~n0~0 2) (<= main_~n1~0 6) (<= 2 main_~j1~0))} is VALID [2018-11-23 13:13:34,377 INFO L256 TraceCheckUtils]: 34: Hoare triple {37841#(and (<= main_~n0~0 2) (<= main_~n1~0 6) (<= 2 main_~j1~0))} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {37709#true} is VALID [2018-11-23 13:13:34,377 INFO L273 TraceCheckUtils]: 35: Hoare triple {37709#true} ~cond := #in~cond; {37709#true} is VALID [2018-11-23 13:13:34,377 INFO L273 TraceCheckUtils]: 36: Hoare triple {37709#true} assume !(0 == ~cond); {37709#true} is VALID [2018-11-23 13:13:34,377 INFO L273 TraceCheckUtils]: 37: Hoare triple {37709#true} assume true; {37709#true} is VALID [2018-11-23 13:13:34,378 INFO L268 TraceCheckUtils]: 38: Hoare quadruple {37709#true} {37841#(and (<= main_~n0~0 2) (<= main_~n1~0 6) (<= 2 main_~j1~0))} #70#return; {37841#(and (<= main_~n0~0 2) (<= main_~n1~0 6) (<= 2 main_~j1~0))} is VALID [2018-11-23 13:13:34,379 INFO L273 TraceCheckUtils]: 39: Hoare triple {37841#(and (<= main_~n0~0 2) (<= main_~n1~0 6) (<= 2 main_~j1~0))} #t~post7 := ~j1~0;~j1~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~k~0;~k~0 := #t~post8 - 1;havoc #t~post8; {37863#(and (<= main_~n0~0 2) (<= main_~n1~0 6) (<= 3 main_~j1~0))} is VALID [2018-11-23 13:13:34,379 INFO L273 TraceCheckUtils]: 40: Hoare triple {37863#(and (<= main_~n0~0 2) (<= main_~n1~0 6) (<= 3 main_~j1~0))} assume !!(~j1~0 < ~n0~0 + ~n1~0); {37863#(and (<= main_~n0~0 2) (<= main_~n1~0 6) (<= 3 main_~j1~0))} is VALID [2018-11-23 13:13:34,379 INFO L256 TraceCheckUtils]: 41: Hoare triple {37863#(and (<= main_~n0~0 2) (<= main_~n1~0 6) (<= 3 main_~j1~0))} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {37709#true} is VALID [2018-11-23 13:13:34,380 INFO L273 TraceCheckUtils]: 42: Hoare triple {37709#true} ~cond := #in~cond; {37709#true} is VALID [2018-11-23 13:13:34,380 INFO L273 TraceCheckUtils]: 43: Hoare triple {37709#true} assume !(0 == ~cond); {37709#true} is VALID [2018-11-23 13:13:34,380 INFO L273 TraceCheckUtils]: 44: Hoare triple {37709#true} assume true; {37709#true} is VALID [2018-11-23 13:13:34,381 INFO L268 TraceCheckUtils]: 45: Hoare quadruple {37709#true} {37863#(and (<= main_~n0~0 2) (<= main_~n1~0 6) (<= 3 main_~j1~0))} #70#return; {37863#(and (<= main_~n0~0 2) (<= main_~n1~0 6) (<= 3 main_~j1~0))} is VALID [2018-11-23 13:13:34,381 INFO L273 TraceCheckUtils]: 46: Hoare triple {37863#(and (<= main_~n0~0 2) (<= main_~n1~0 6) (<= 3 main_~j1~0))} #t~post7 := ~j1~0;~j1~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~k~0;~k~0 := #t~post8 - 1;havoc #t~post8; {37885#(and (<= main_~n0~0 2) (<= main_~n1~0 6) (<= 4 main_~j1~0))} is VALID [2018-11-23 13:13:34,382 INFO L273 TraceCheckUtils]: 47: Hoare triple {37885#(and (<= main_~n0~0 2) (<= main_~n1~0 6) (<= 4 main_~j1~0))} assume !!(~j1~0 < ~n0~0 + ~n1~0); {37885#(and (<= main_~n0~0 2) (<= main_~n1~0 6) (<= 4 main_~j1~0))} is VALID [2018-11-23 13:13:34,382 INFO L256 TraceCheckUtils]: 48: Hoare triple {37885#(and (<= main_~n0~0 2) (<= main_~n1~0 6) (<= 4 main_~j1~0))} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {37709#true} is VALID [2018-11-23 13:13:34,383 INFO L273 TraceCheckUtils]: 49: Hoare triple {37709#true} ~cond := #in~cond; {37709#true} is VALID [2018-11-23 13:13:34,383 INFO L273 TraceCheckUtils]: 50: Hoare triple {37709#true} assume !(0 == ~cond); {37709#true} is VALID [2018-11-23 13:13:34,383 INFO L273 TraceCheckUtils]: 51: Hoare triple {37709#true} assume true; {37709#true} is VALID [2018-11-23 13:13:34,384 INFO L268 TraceCheckUtils]: 52: Hoare quadruple {37709#true} {37885#(and (<= main_~n0~0 2) (<= main_~n1~0 6) (<= 4 main_~j1~0))} #70#return; {37885#(and (<= main_~n0~0 2) (<= main_~n1~0 6) (<= 4 main_~j1~0))} is VALID [2018-11-23 13:13:34,384 INFO L273 TraceCheckUtils]: 53: Hoare triple {37885#(and (<= main_~n0~0 2) (<= main_~n1~0 6) (<= 4 main_~j1~0))} #t~post7 := ~j1~0;~j1~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~k~0;~k~0 := #t~post8 - 1;havoc #t~post8; {37907#(and (<= main_~n0~0 2) (<= main_~n1~0 6) (<= 5 main_~j1~0))} is VALID [2018-11-23 13:13:34,385 INFO L273 TraceCheckUtils]: 54: Hoare triple {37907#(and (<= main_~n0~0 2) (<= main_~n1~0 6) (<= 5 main_~j1~0))} assume !!(~j1~0 < ~n0~0 + ~n1~0); {37907#(and (<= main_~n0~0 2) (<= main_~n1~0 6) (<= 5 main_~j1~0))} is VALID [2018-11-23 13:13:34,385 INFO L256 TraceCheckUtils]: 55: Hoare triple {37907#(and (<= main_~n0~0 2) (<= main_~n1~0 6) (<= 5 main_~j1~0))} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {37709#true} is VALID [2018-11-23 13:13:34,385 INFO L273 TraceCheckUtils]: 56: Hoare triple {37709#true} ~cond := #in~cond; {37709#true} is VALID [2018-11-23 13:13:34,386 INFO L273 TraceCheckUtils]: 57: Hoare triple {37709#true} assume !(0 == ~cond); {37709#true} is VALID [2018-11-23 13:13:34,386 INFO L273 TraceCheckUtils]: 58: Hoare triple {37709#true} assume true; {37709#true} is VALID [2018-11-23 13:13:34,386 INFO L268 TraceCheckUtils]: 59: Hoare quadruple {37709#true} {37907#(and (<= main_~n0~0 2) (<= main_~n1~0 6) (<= 5 main_~j1~0))} #70#return; {37907#(and (<= main_~n0~0 2) (<= main_~n1~0 6) (<= 5 main_~j1~0))} is VALID [2018-11-23 13:13:34,387 INFO L273 TraceCheckUtils]: 60: Hoare triple {37907#(and (<= main_~n0~0 2) (<= main_~n1~0 6) (<= 5 main_~j1~0))} #t~post7 := ~j1~0;~j1~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~k~0;~k~0 := #t~post8 - 1;havoc #t~post8; {37929#(and (<= 6 main_~j1~0) (<= main_~n0~0 2) (<= main_~n1~0 6))} is VALID [2018-11-23 13:13:34,388 INFO L273 TraceCheckUtils]: 61: Hoare triple {37929#(and (<= 6 main_~j1~0) (<= main_~n0~0 2) (<= main_~n1~0 6))} assume !!(~j1~0 < ~n0~0 + ~n1~0); {37929#(and (<= 6 main_~j1~0) (<= main_~n0~0 2) (<= main_~n1~0 6))} is VALID [2018-11-23 13:13:34,388 INFO L256 TraceCheckUtils]: 62: Hoare triple {37929#(and (<= 6 main_~j1~0) (<= main_~n0~0 2) (<= main_~n1~0 6))} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {37709#true} is VALID [2018-11-23 13:13:34,388 INFO L273 TraceCheckUtils]: 63: Hoare triple {37709#true} ~cond := #in~cond; {37709#true} is VALID [2018-11-23 13:13:34,389 INFO L273 TraceCheckUtils]: 64: Hoare triple {37709#true} assume !(0 == ~cond); {37709#true} is VALID [2018-11-23 13:13:34,389 INFO L273 TraceCheckUtils]: 65: Hoare triple {37709#true} assume true; {37709#true} is VALID [2018-11-23 13:13:34,389 INFO L268 TraceCheckUtils]: 66: Hoare quadruple {37709#true} {37929#(and (<= 6 main_~j1~0) (<= main_~n0~0 2) (<= main_~n1~0 6))} #70#return; {37929#(and (<= 6 main_~j1~0) (<= main_~n0~0 2) (<= main_~n1~0 6))} is VALID [2018-11-23 13:13:34,390 INFO L273 TraceCheckUtils]: 67: Hoare triple {37929#(and (<= 6 main_~j1~0) (<= main_~n0~0 2) (<= main_~n1~0 6))} #t~post7 := ~j1~0;~j1~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~k~0;~k~0 := #t~post8 - 1;havoc #t~post8; {37951#(and (<= main_~n0~0 2) (<= main_~n1~0 6) (<= 7 main_~j1~0))} is VALID [2018-11-23 13:13:34,391 INFO L273 TraceCheckUtils]: 68: Hoare triple {37951#(and (<= main_~n0~0 2) (<= main_~n1~0 6) (<= 7 main_~j1~0))} assume !!(~j1~0 < ~n0~0 + ~n1~0); {37951#(and (<= main_~n0~0 2) (<= main_~n1~0 6) (<= 7 main_~j1~0))} is VALID [2018-11-23 13:13:34,391 INFO L256 TraceCheckUtils]: 69: Hoare triple {37951#(and (<= main_~n0~0 2) (<= main_~n1~0 6) (<= 7 main_~j1~0))} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {37709#true} is VALID [2018-11-23 13:13:34,391 INFO L273 TraceCheckUtils]: 70: Hoare triple {37709#true} ~cond := #in~cond; {37709#true} is VALID [2018-11-23 13:13:34,391 INFO L273 TraceCheckUtils]: 71: Hoare triple {37709#true} assume !(0 == ~cond); {37709#true} is VALID [2018-11-23 13:13:34,392 INFO L273 TraceCheckUtils]: 72: Hoare triple {37709#true} assume true; {37709#true} is VALID [2018-11-23 13:13:34,392 INFO L268 TraceCheckUtils]: 73: Hoare quadruple {37709#true} {37951#(and (<= main_~n0~0 2) (<= main_~n1~0 6) (<= 7 main_~j1~0))} #70#return; {37951#(and (<= main_~n0~0 2) (<= main_~n1~0 6) (<= 7 main_~j1~0))} is VALID [2018-11-23 13:13:34,393 INFO L273 TraceCheckUtils]: 74: Hoare triple {37951#(and (<= main_~n0~0 2) (<= main_~n1~0 6) (<= 7 main_~j1~0))} #t~post7 := ~j1~0;~j1~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~k~0;~k~0 := #t~post8 - 1;havoc #t~post8; {37973#(and (<= main_~n0~0 2) (<= 8 main_~j1~0) (<= main_~n1~0 6))} is VALID [2018-11-23 13:13:34,394 INFO L273 TraceCheckUtils]: 75: Hoare triple {37973#(and (<= main_~n0~0 2) (<= 8 main_~j1~0) (<= main_~n1~0 6))} assume !!(~j1~0 < ~n0~0 + ~n1~0); {37710#false} is VALID [2018-11-23 13:13:34,394 INFO L256 TraceCheckUtils]: 76: Hoare triple {37710#false} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {37710#false} is VALID [2018-11-23 13:13:34,394 INFO L273 TraceCheckUtils]: 77: Hoare triple {37710#false} ~cond := #in~cond; {37710#false} is VALID [2018-11-23 13:13:34,394 INFO L273 TraceCheckUtils]: 78: Hoare triple {37710#false} assume 0 == ~cond; {37710#false} is VALID [2018-11-23 13:13:34,395 INFO L273 TraceCheckUtils]: 79: Hoare triple {37710#false} assume !false; {37710#false} is VALID [2018-11-23 13:13:34,402 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 116 proven. 24 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2018-11-23 13:13:34,420 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:13:34,420 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 40 [2018-11-23 13:13:34,421 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 80 [2018-11-23 13:13:34,421 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:13:34,421 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 40 states. [2018-11-23 13:13:34,513 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 101 edges. 101 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:13:34,513 INFO L459 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-11-23 13:13:34,514 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-11-23 13:13:34,514 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=303, Invalid=1257, Unknown=0, NotChecked=0, Total=1560 [2018-11-23 13:13:34,514 INFO L87 Difference]: Start difference. First operand 100 states and 110 transitions. Second operand 40 states.