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/nested9_true-unreach-call_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-61f4311 [2018-11-23 13:10:21,944 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 13:10:21,947 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 13:10:21,962 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 13:10:21,963 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 13:10:21,964 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 13:10:21,966 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 13:10:21,968 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 13:10:21,971 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 13:10:21,972 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 13:10:21,973 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 13:10:21,974 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 13:10:21,975 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 13:10:21,977 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 13:10:21,979 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 13:10:21,980 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 13:10:21,987 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 13:10:21,990 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 13:10:21,994 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 13:10:21,996 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 13:10:21,997 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 13:10:21,998 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 13:10:22,000 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 13:10:22,000 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 13:10:22,000 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 13:10:22,001 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 13:10:22,002 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 13:10:22,003 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 13:10:22,004 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 13:10:22,004 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 13:10:22,005 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 13:10:22,005 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 13:10:22,005 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 13:10:22,006 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 13:10:22,007 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 13:10:22,007 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 13:10:22,008 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:22,026 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 13:10:22,026 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 13:10:22,029 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 13:10:22,030 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 13:10:22,030 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 13:10:22,030 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 13:10:22,031 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 13:10:22,031 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 13:10:22,031 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 13:10:22,031 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 13:10:22,031 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 13:10:22,032 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 13:10:22,033 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 13:10:22,033 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 13:10:22,033 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 13:10:22,033 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 13:10:22,033 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 13:10:22,033 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 13:10:22,034 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 13:10:22,034 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 13:10:22,034 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 13:10:22,034 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 13:10:22,034 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 13:10:22,036 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 13:10:22,036 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 13:10:22,036 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 13:10:22,036 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 13:10:22,037 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 13:10:22,037 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 13:10:22,037 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 13:10:22,037 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 13:10:22,090 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 13:10:22,102 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 13:10:22,106 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 13:10:22,107 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 13:10:22,108 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 13:10:22,108 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-invgen/nested9_true-unreach-call_true-termination.i [2018-11-23 13:10:22,164 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/143f32a7f/e92f1e9fdf95429ea1fe2f63d4ca9a42/FLAGc630261cd [2018-11-23 13:10:22,607 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 13:10:22,608 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/nested9_true-unreach-call_true-termination.i [2018-11-23 13:10:22,613 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/143f32a7f/e92f1e9fdf95429ea1fe2f63d4ca9a42/FLAGc630261cd [2018-11-23 13:10:22,948 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/143f32a7f/e92f1e9fdf95429ea1fe2f63d4ca9a42 [2018-11-23 13:10:22,956 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 13:10:22,958 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 13:10:22,958 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 13:10:22,959 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 13:10:22,964 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 13:10:22,965 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 01:10:22" (1/1) ... [2018-11-23 13:10:22,968 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@47b53697 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:10:22, skipping insertion in model container [2018-11-23 13:10:22,968 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 01:10:22" (1/1) ... [2018-11-23 13:10:22,979 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 13:10:23,004 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 13:10:23,245 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 13:10:23,251 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 13:10:23,282 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 13:10:23,302 INFO L195 MainTranslator]: Completed translation [2018-11-23 13:10:23,302 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:10:23 WrapperNode [2018-11-23 13:10:23,303 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 13:10:23,303 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 13:10:23,305 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 13:10:23,305 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 13:10:23,312 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:23" (1/1) ... [2018-11-23 13:10:23,317 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:23" (1/1) ... [2018-11-23 13:10:23,324 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 13:10:23,324 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 13:10:23,325 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 13:10:23,325 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 13:10:23,332 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:23" (1/1) ... [2018-11-23 13:10:23,332 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:23" (1/1) ... [2018-11-23 13:10:23,333 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:23" (1/1) ... [2018-11-23 13:10:23,334 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:23" (1/1) ... [2018-11-23 13:10:23,338 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:23" (1/1) ... [2018-11-23 13:10:23,346 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:23" (1/1) ... [2018-11-23 13:10:23,347 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:23" (1/1) ... [2018-11-23 13:10:23,348 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 13:10:23,349 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 13:10:23,349 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 13:10:23,349 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 13:10:23,350 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:10:23" (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:23,476 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 13:10:23,476 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 13:10:23,476 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 13:10:23,477 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 13:10:23,477 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 13:10:23,477 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 13:10:23,477 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-23 13:10:23,477 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-23 13:10:24,070 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 13:10:24,070 INFO L280 CfgBuilder]: Removed 3 assue(true) statements. [2018-11-23 13:10:24,071 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:10:24 BoogieIcfgContainer [2018-11-23 13:10:24,071 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 13:10:24,072 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 13:10:24,072 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 13:10:24,075 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 13:10:24,076 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 01:10:22" (1/3) ... [2018-11-23 13:10:24,077 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@749f1cf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 01:10:24, skipping insertion in model container [2018-11-23 13:10:24,077 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:10:23" (2/3) ... [2018-11-23 13:10:24,077 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@749f1cf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 01:10:24, skipping insertion in model container [2018-11-23 13:10:24,078 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:10:24" (3/3) ... [2018-11-23 13:10:24,079 INFO L112 eAbstractionObserver]: Analyzing ICFG nested9_true-unreach-call_true-termination.i [2018-11-23 13:10:24,089 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 13:10:24,095 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 13:10:24,111 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 13:10:24,142 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 13:10:24,143 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 13:10:24,143 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 13:10:24,144 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 13:10:24,144 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 13:10:24,144 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 13:10:24,144 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 13:10:24,144 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 13:10:24,145 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 13:10:24,164 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states. [2018-11-23 13:10:24,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-23 13:10:24,171 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:10:24,172 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:10:24,175 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:10:24,180 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:10:24,181 INFO L82 PathProgramCache]: Analyzing trace with hash -810471198, now seen corresponding path program 1 times [2018-11-23 13:10:24,182 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:10:24,183 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:10:24,233 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:10:24,234 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:10:24,234 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:10:24,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:10:24,514 INFO L256 TraceCheckUtils]: 0: Hoare triple {32#true} call ULTIMATE.init(); {32#true} is VALID [2018-11-23 13:10:24,518 INFO L273 TraceCheckUtils]: 1: Hoare triple {32#true} ~__BLAST_NONDET~0 := 0; {32#true} is VALID [2018-11-23 13:10:24,519 INFO L273 TraceCheckUtils]: 2: Hoare triple {32#true} assume true; {32#true} is VALID [2018-11-23 13:10:24,519 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {32#true} {32#true} #77#return; {32#true} is VALID [2018-11-23 13:10:24,519 INFO L256 TraceCheckUtils]: 4: Hoare triple {32#true} call #t~ret7 := main(); {32#true} is VALID [2018-11-23 13:10:24,520 INFO L273 TraceCheckUtils]: 5: Hoare triple {32#true} havoc ~i~0;havoc ~j~0;havoc ~k~0;havoc ~n~0;havoc ~l~0;havoc ~m~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~m~0 := #t~nondet2;havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~l~0 := #t~nondet3;havoc #t~nondet3; {32#true} is VALID [2018-11-23 13:10:24,520 INFO L273 TraceCheckUtils]: 6: Hoare triple {32#true} assume !!(-1000000 < ~n~0 && ~n~0 < 1000000); {32#true} is VALID [2018-11-23 13:10:24,520 INFO L273 TraceCheckUtils]: 7: Hoare triple {32#true} assume !!(-1000000 < ~m~0 && ~m~0 < 1000000); {32#true} is VALID [2018-11-23 13:10:24,521 INFO L273 TraceCheckUtils]: 8: Hoare triple {32#true} assume !!(-1000000 < ~l~0 && ~l~0 < 1000000); {32#true} is VALID [2018-11-23 13:10:24,521 INFO L273 TraceCheckUtils]: 9: Hoare triple {32#true} assume 3 * ~n~0 <= ~m~0 + ~l~0; {32#true} is VALID [2018-11-23 13:10:24,522 INFO L273 TraceCheckUtils]: 10: Hoare triple {32#true} ~i~0 := 0; {34#(<= main_~i~0 0)} is VALID [2018-11-23 13:10:24,524 INFO L273 TraceCheckUtils]: 11: Hoare triple {34#(<= main_~i~0 0)} assume !!(~i~0 < ~n~0);~j~0 := 2 * ~i~0; {35#(<= (* 3 main_~i~0) main_~j~0)} is VALID [2018-11-23 13:10:24,532 INFO L273 TraceCheckUtils]: 12: Hoare triple {35#(<= (* 3 main_~i~0) main_~j~0)} assume !!(~j~0 < 3 * ~i~0);~k~0 := ~i~0; {33#false} is VALID [2018-11-23 13:10:24,532 INFO L273 TraceCheckUtils]: 13: Hoare triple {33#false} assume !!(~k~0 < ~j~0); {33#false} is VALID [2018-11-23 13:10:24,532 INFO L256 TraceCheckUtils]: 14: Hoare triple {33#false} call __VERIFIER_assert((if ~k~0 - ~i~0 <= 2 * ~n~0 then 1 else 0)); {33#false} is VALID [2018-11-23 13:10:24,533 INFO L273 TraceCheckUtils]: 15: Hoare triple {33#false} ~cond := #in~cond; {33#false} is VALID [2018-11-23 13:10:24,533 INFO L273 TraceCheckUtils]: 16: Hoare triple {33#false} assume 0 == ~cond; {33#false} is VALID [2018-11-23 13:10:24,533 INFO L273 TraceCheckUtils]: 17: Hoare triple {33#false} assume !false; {33#false} is VALID [2018-11-23 13:10:24,537 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:24,540 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 13:10:24,540 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 13:10:24,545 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2018-11-23 13:10:24,548 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:10:24,552 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2018-11-23 13:10:24,770 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:10:24,771 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 13:10:24,778 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 13:10:24,779 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 13:10:24,781 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 4 states. [2018-11-23 13:10:25,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:10:25,167 INFO L93 Difference]: Finished difference Result 53 states and 74 transitions. [2018-11-23 13:10:25,168 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 13:10:25,168 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2018-11-23 13:10:25,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:10:25,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 13:10:25,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 74 transitions. [2018-11-23 13:10:25,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 13:10:25,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 74 transitions. [2018-11-23 13:10:25,185 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 74 transitions. [2018-11-23 13:10:25,577 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:10:25,594 INFO L225 Difference]: With dead ends: 53 [2018-11-23 13:10:25,594 INFO L226 Difference]: Without dead ends: 27 [2018-11-23 13:10:25,602 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-23 13:10:25,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-11-23 13:10:25,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 26. [2018-11-23 13:10:25,676 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:10:25,677 INFO L82 GeneralOperation]: Start isEquivalent. First operand 27 states. Second operand 26 states. [2018-11-23 13:10:25,678 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand 26 states. [2018-11-23 13:10:25,678 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 26 states. [2018-11-23 13:10:25,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:10:25,682 INFO L93 Difference]: Finished difference Result 27 states and 29 transitions. [2018-11-23 13:10:25,682 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 29 transitions. [2018-11-23 13:10:25,683 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:10:25,683 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:10:25,684 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand 27 states. [2018-11-23 13:10:25,684 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 27 states. [2018-11-23 13:10:25,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:10:25,688 INFO L93 Difference]: Finished difference Result 27 states and 29 transitions. [2018-11-23 13:10:25,688 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 29 transitions. [2018-11-23 13:10:25,689 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:10:25,689 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:10:25,690 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:10:25,690 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:10:25,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-23 13:10:25,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 28 transitions. [2018-11-23 13:10:25,695 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 28 transitions. Word has length 18 [2018-11-23 13:10:25,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:10:25,695 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 28 transitions. [2018-11-23 13:10:25,695 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 13:10:25,695 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 28 transitions. [2018-11-23 13:10:25,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-23 13:10:25,696 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:10:25,697 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:10:25,697 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:10:25,697 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:10:25,698 INFO L82 PathProgramCache]: Analyzing trace with hash -1809643041, now seen corresponding path program 1 times [2018-11-23 13:10:25,698 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:10:25,698 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:10:25,699 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:10:25,699 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:10:25,700 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:10:25,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:10:26,152 INFO L256 TraceCheckUtils]: 0: Hoare triple {203#true} call ULTIMATE.init(); {203#true} is VALID [2018-11-23 13:10:26,153 INFO L273 TraceCheckUtils]: 1: Hoare triple {203#true} ~__BLAST_NONDET~0 := 0; {203#true} is VALID [2018-11-23 13:10:26,153 INFO L273 TraceCheckUtils]: 2: Hoare triple {203#true} assume true; {203#true} is VALID [2018-11-23 13:10:26,154 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {203#true} {203#true} #77#return; {203#true} is VALID [2018-11-23 13:10:26,154 INFO L256 TraceCheckUtils]: 4: Hoare triple {203#true} call #t~ret7 := main(); {203#true} is VALID [2018-11-23 13:10:26,154 INFO L273 TraceCheckUtils]: 5: Hoare triple {203#true} havoc ~i~0;havoc ~j~0;havoc ~k~0;havoc ~n~0;havoc ~l~0;havoc ~m~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~m~0 := #t~nondet2;havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~l~0 := #t~nondet3;havoc #t~nondet3; {203#true} is VALID [2018-11-23 13:10:26,155 INFO L273 TraceCheckUtils]: 6: Hoare triple {203#true} assume !!(-1000000 < ~n~0 && ~n~0 < 1000000); {203#true} is VALID [2018-11-23 13:10:26,155 INFO L273 TraceCheckUtils]: 7: Hoare triple {203#true} assume !!(-1000000 < ~m~0 && ~m~0 < 1000000); {203#true} is VALID [2018-11-23 13:10:26,155 INFO L273 TraceCheckUtils]: 8: Hoare triple {203#true} assume !!(-1000000 < ~l~0 && ~l~0 < 1000000); {203#true} is VALID [2018-11-23 13:10:26,155 INFO L273 TraceCheckUtils]: 9: Hoare triple {203#true} assume 3 * ~n~0 <= ~m~0 + ~l~0; {203#true} is VALID [2018-11-23 13:10:26,174 INFO L273 TraceCheckUtils]: 10: Hoare triple {203#true} ~i~0 := 0; {205#(<= 0 main_~i~0)} is VALID [2018-11-23 13:10:26,175 INFO L273 TraceCheckUtils]: 11: Hoare triple {205#(<= 0 main_~i~0)} assume !!(~i~0 < ~n~0);~j~0 := 2 * ~i~0; {205#(<= 0 main_~i~0)} is VALID [2018-11-23 13:10:26,176 INFO L273 TraceCheckUtils]: 12: Hoare triple {205#(<= 0 main_~i~0)} assume !(~j~0 < 3 * ~i~0); {205#(<= 0 main_~i~0)} is VALID [2018-11-23 13:10:26,177 INFO L273 TraceCheckUtils]: 13: Hoare triple {205#(<= 0 main_~i~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {206#(<= 1 main_~i~0)} is VALID [2018-11-23 13:10:26,178 INFO L273 TraceCheckUtils]: 14: Hoare triple {206#(<= 1 main_~i~0)} assume !!(~i~0 < ~n~0);~j~0 := 2 * ~i~0; {207#(<= 2 main_~n~0)} is VALID [2018-11-23 13:10:26,191 INFO L273 TraceCheckUtils]: 15: Hoare triple {207#(<= 2 main_~n~0)} assume !!(~j~0 < 3 * ~i~0);~k~0 := ~i~0; {208#(<= (+ main_~k~0 4) (+ main_~i~0 (* 2 main_~n~0)))} is VALID [2018-11-23 13:10:26,192 INFO L273 TraceCheckUtils]: 16: Hoare triple {208#(<= (+ main_~k~0 4) (+ main_~i~0 (* 2 main_~n~0)))} assume !!(~k~0 < ~j~0); {208#(<= (+ main_~k~0 4) (+ main_~i~0 (* 2 main_~n~0)))} is VALID [2018-11-23 13:10:26,194 INFO L256 TraceCheckUtils]: 17: Hoare triple {208#(<= (+ main_~k~0 4) (+ main_~i~0 (* 2 main_~n~0)))} call __VERIFIER_assert((if ~k~0 - ~i~0 <= 2 * ~n~0 then 1 else 0)); {209#(= |__VERIFIER_assert_#in~cond| 1)} is VALID [2018-11-23 13:10:26,200 INFO L273 TraceCheckUtils]: 18: Hoare triple {209#(= |__VERIFIER_assert_#in~cond| 1)} ~cond := #in~cond; {210#(= __VERIFIER_assert_~cond 1)} is VALID [2018-11-23 13:10:26,201 INFO L273 TraceCheckUtils]: 19: Hoare triple {210#(= __VERIFIER_assert_~cond 1)} assume 0 == ~cond; {204#false} is VALID [2018-11-23 13:10:26,201 INFO L273 TraceCheckUtils]: 20: Hoare triple {204#false} assume !false; {204#false} is VALID [2018-11-23 13:10:26,203 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:10:26,204 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:10:26,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 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:26,217 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:10:26,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:10:26,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:10:26,253 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:10:26,676 INFO L256 TraceCheckUtils]: 0: Hoare triple {203#true} call ULTIMATE.init(); {203#true} is VALID [2018-11-23 13:10:26,676 INFO L273 TraceCheckUtils]: 1: Hoare triple {203#true} ~__BLAST_NONDET~0 := 0; {203#true} is VALID [2018-11-23 13:10:26,677 INFO L273 TraceCheckUtils]: 2: Hoare triple {203#true} assume true; {203#true} is VALID [2018-11-23 13:10:26,677 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {203#true} {203#true} #77#return; {203#true} is VALID [2018-11-23 13:10:26,677 INFO L256 TraceCheckUtils]: 4: Hoare triple {203#true} call #t~ret7 := main(); {203#true} is VALID [2018-11-23 13:10:26,677 INFO L273 TraceCheckUtils]: 5: Hoare triple {203#true} havoc ~i~0;havoc ~j~0;havoc ~k~0;havoc ~n~0;havoc ~l~0;havoc ~m~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~m~0 := #t~nondet2;havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~l~0 := #t~nondet3;havoc #t~nondet3; {203#true} is VALID [2018-11-23 13:10:26,678 INFO L273 TraceCheckUtils]: 6: Hoare triple {203#true} assume !!(-1000000 < ~n~0 && ~n~0 < 1000000); {203#true} is VALID [2018-11-23 13:10:26,678 INFO L273 TraceCheckUtils]: 7: Hoare triple {203#true} assume !!(-1000000 < ~m~0 && ~m~0 < 1000000); {203#true} is VALID [2018-11-23 13:10:26,678 INFO L273 TraceCheckUtils]: 8: Hoare triple {203#true} assume !!(-1000000 < ~l~0 && ~l~0 < 1000000); {203#true} is VALID [2018-11-23 13:10:26,678 INFO L273 TraceCheckUtils]: 9: Hoare triple {203#true} assume 3 * ~n~0 <= ~m~0 + ~l~0; {203#true} is VALID [2018-11-23 13:10:26,681 INFO L273 TraceCheckUtils]: 10: Hoare triple {203#true} ~i~0 := 0; {205#(<= 0 main_~i~0)} is VALID [2018-11-23 13:10:26,681 INFO L273 TraceCheckUtils]: 11: Hoare triple {205#(<= 0 main_~i~0)} assume !!(~i~0 < ~n~0);~j~0 := 2 * ~i~0; {205#(<= 0 main_~i~0)} is VALID [2018-11-23 13:10:26,685 INFO L273 TraceCheckUtils]: 12: Hoare triple {205#(<= 0 main_~i~0)} assume !(~j~0 < 3 * ~i~0); {205#(<= 0 main_~i~0)} is VALID [2018-11-23 13:10:26,686 INFO L273 TraceCheckUtils]: 13: Hoare triple {205#(<= 0 main_~i~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {206#(<= 1 main_~i~0)} is VALID [2018-11-23 13:10:26,687 INFO L273 TraceCheckUtils]: 14: Hoare triple {206#(<= 1 main_~i~0)} assume !!(~i~0 < ~n~0);~j~0 := 2 * ~i~0; {256#(and (<= 1 main_~i~0) (< main_~i~0 main_~n~0))} is VALID [2018-11-23 13:10:26,687 INFO L273 TraceCheckUtils]: 15: Hoare triple {256#(and (<= 1 main_~i~0) (< main_~i~0 main_~n~0))} assume !!(~j~0 < 3 * ~i~0);~k~0 := ~i~0; {260#(and (<= 1 main_~i~0) (< main_~i~0 main_~n~0) (<= main_~k~0 main_~i~0))} is VALID [2018-11-23 13:10:26,688 INFO L273 TraceCheckUtils]: 16: Hoare triple {260#(and (<= 1 main_~i~0) (< main_~i~0 main_~n~0) (<= main_~k~0 main_~i~0))} assume !!(~k~0 < ~j~0); {260#(and (<= 1 main_~i~0) (< main_~i~0 main_~n~0) (<= main_~k~0 main_~i~0))} is VALID [2018-11-23 13:10:26,689 INFO L256 TraceCheckUtils]: 17: Hoare triple {260#(and (<= 1 main_~i~0) (< main_~i~0 main_~n~0) (<= main_~k~0 main_~i~0))} call __VERIFIER_assert((if ~k~0 - ~i~0 <= 2 * ~n~0 then 1 else 0)); {209#(= |__VERIFIER_assert_#in~cond| 1)} is VALID [2018-11-23 13:10:26,690 INFO L273 TraceCheckUtils]: 18: Hoare triple {209#(= |__VERIFIER_assert_#in~cond| 1)} ~cond := #in~cond; {210#(= __VERIFIER_assert_~cond 1)} is VALID [2018-11-23 13:10:26,708 INFO L273 TraceCheckUtils]: 19: Hoare triple {210#(= __VERIFIER_assert_~cond 1)} assume 0 == ~cond; {204#false} is VALID [2018-11-23 13:10:26,708 INFO L273 TraceCheckUtils]: 20: Hoare triple {204#false} assume !false; {204#false} is VALID [2018-11-23 13:10:26,710 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:10:26,736 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-23 13:10:26,736 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [8] total 10 [2018-11-23 13:10:26,737 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 21 [2018-11-23 13:10:26,737 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:10:26,737 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2018-11-23 13:10:26,802 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:10:26,802 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-23 13:10:26,803 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-23 13:10:26,803 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2018-11-23 13:10:26,803 INFO L87 Difference]: Start difference. First operand 26 states and 28 transitions. Second operand 10 states. [2018-11-23 13:10:27,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:10:27,587 INFO L93 Difference]: Finished difference Result 43 states and 48 transitions. [2018-11-23 13:10:27,587 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-23 13:10:27,587 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 21 [2018-11-23 13:10:27,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:10:27,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-23 13:10:27,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 48 transitions. [2018-11-23 13:10:27,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-23 13:10:27,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 48 transitions. [2018-11-23 13:10:27,594 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 48 transitions. [2018-11-23 13:10:27,690 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:10:27,693 INFO L225 Difference]: With dead ends: 43 [2018-11-23 13:10:27,693 INFO L226 Difference]: Without dead ends: 41 [2018-11-23 13:10:27,694 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 19 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2018-11-23 13:10:27,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-11-23 13:10:27,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 32. [2018-11-23 13:10:27,796 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:10:27,797 INFO L82 GeneralOperation]: Start isEquivalent. First operand 41 states. Second operand 32 states. [2018-11-23 13:10:27,797 INFO L74 IsIncluded]: Start isIncluded. First operand 41 states. Second operand 32 states. [2018-11-23 13:10:27,797 INFO L87 Difference]: Start difference. First operand 41 states. Second operand 32 states. [2018-11-23 13:10:27,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:10:27,802 INFO L93 Difference]: Finished difference Result 41 states and 46 transitions. [2018-11-23 13:10:27,802 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 46 transitions. [2018-11-23 13:10:27,803 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:10:27,803 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:10:27,803 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand 41 states. [2018-11-23 13:10:27,803 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 41 states. [2018-11-23 13:10:27,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:10:27,807 INFO L93 Difference]: Finished difference Result 41 states and 46 transitions. [2018-11-23 13:10:27,807 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 46 transitions. [2018-11-23 13:10:27,808 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:10:27,808 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:10:27,808 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:10:27,808 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:10:27,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-11-23 13:10:27,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 35 transitions. [2018-11-23 13:10:27,811 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 35 transitions. Word has length 21 [2018-11-23 13:10:27,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:10:27,811 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 35 transitions. [2018-11-23 13:10:27,811 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-23 13:10:27,812 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 35 transitions. [2018-11-23 13:10:27,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-23 13:10:27,813 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:10:27,813 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, 1, 1, 1] [2018-11-23 13:10:27,813 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:10:27,813 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:10:27,814 INFO L82 PathProgramCache]: Analyzing trace with hash 2040308290, now seen corresponding path program 1 times [2018-11-23 13:10:27,814 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:10:27,814 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:10:27,815 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:10:27,815 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:10:27,815 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:10:27,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:10:27,969 INFO L256 TraceCheckUtils]: 0: Hoare triple {472#true} call ULTIMATE.init(); {472#true} is VALID [2018-11-23 13:10:27,970 INFO L273 TraceCheckUtils]: 1: Hoare triple {472#true} ~__BLAST_NONDET~0 := 0; {472#true} is VALID [2018-11-23 13:10:27,971 INFO L273 TraceCheckUtils]: 2: Hoare triple {472#true} assume true; {472#true} is VALID [2018-11-23 13:10:27,971 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {472#true} {472#true} #77#return; {472#true} is VALID [2018-11-23 13:10:27,972 INFO L256 TraceCheckUtils]: 4: Hoare triple {472#true} call #t~ret7 := main(); {472#true} is VALID [2018-11-23 13:10:27,972 INFO L273 TraceCheckUtils]: 5: Hoare triple {472#true} havoc ~i~0;havoc ~j~0;havoc ~k~0;havoc ~n~0;havoc ~l~0;havoc ~m~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~m~0 := #t~nondet2;havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~l~0 := #t~nondet3;havoc #t~nondet3; {472#true} is VALID [2018-11-23 13:10:27,973 INFO L273 TraceCheckUtils]: 6: Hoare triple {472#true} assume !!(-1000000 < ~n~0 && ~n~0 < 1000000); {472#true} is VALID [2018-11-23 13:10:27,973 INFO L273 TraceCheckUtils]: 7: Hoare triple {472#true} assume !!(-1000000 < ~m~0 && ~m~0 < 1000000); {472#true} is VALID [2018-11-23 13:10:27,973 INFO L273 TraceCheckUtils]: 8: Hoare triple {472#true} assume !!(-1000000 < ~l~0 && ~l~0 < 1000000); {472#true} is VALID [2018-11-23 13:10:27,974 INFO L273 TraceCheckUtils]: 9: Hoare triple {472#true} assume 3 * ~n~0 <= ~m~0 + ~l~0; {472#true} is VALID [2018-11-23 13:10:27,982 INFO L273 TraceCheckUtils]: 10: Hoare triple {472#true} ~i~0 := 0; {474#(<= main_~i~0 0)} is VALID [2018-11-23 13:10:27,983 INFO L273 TraceCheckUtils]: 11: Hoare triple {474#(<= main_~i~0 0)} assume !!(~i~0 < ~n~0);~j~0 := 2 * ~i~0; {474#(<= main_~i~0 0)} is VALID [2018-11-23 13:10:27,987 INFO L273 TraceCheckUtils]: 12: Hoare triple {474#(<= main_~i~0 0)} assume !(~j~0 < 3 * ~i~0); {474#(<= main_~i~0 0)} is VALID [2018-11-23 13:10:27,987 INFO L273 TraceCheckUtils]: 13: Hoare triple {474#(<= main_~i~0 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {475#(<= main_~i~0 1)} is VALID [2018-11-23 13:10:27,989 INFO L273 TraceCheckUtils]: 14: Hoare triple {475#(<= main_~i~0 1)} assume !!(~i~0 < ~n~0);~j~0 := 2 * ~i~0; {476#(<= main_~j~0 (+ main_~i~0 1))} is VALID [2018-11-23 13:10:27,991 INFO L273 TraceCheckUtils]: 15: Hoare triple {476#(<= main_~j~0 (+ main_~i~0 1))} assume !!(~j~0 < 3 * ~i~0);~k~0 := ~i~0; {477#(<= main_~j~0 (+ main_~k~0 1))} is VALID [2018-11-23 13:10:27,991 INFO L273 TraceCheckUtils]: 16: Hoare triple {477#(<= main_~j~0 (+ main_~k~0 1))} assume !!(~k~0 < ~j~0); {477#(<= main_~j~0 (+ main_~k~0 1))} is VALID [2018-11-23 13:10:27,991 INFO L256 TraceCheckUtils]: 17: Hoare triple {477#(<= main_~j~0 (+ main_~k~0 1))} call __VERIFIER_assert((if ~k~0 - ~i~0 <= 2 * ~n~0 then 1 else 0)); {472#true} is VALID [2018-11-23 13:10:27,992 INFO L273 TraceCheckUtils]: 18: Hoare triple {472#true} ~cond := #in~cond; {472#true} is VALID [2018-11-23 13:10:27,992 INFO L273 TraceCheckUtils]: 19: Hoare triple {472#true} assume !(0 == ~cond); {472#true} is VALID [2018-11-23 13:10:27,992 INFO L273 TraceCheckUtils]: 20: Hoare triple {472#true} assume true; {472#true} is VALID [2018-11-23 13:10:27,994 INFO L268 TraceCheckUtils]: 21: Hoare quadruple {472#true} {477#(<= main_~j~0 (+ main_~k~0 1))} #81#return; {477#(<= main_~j~0 (+ main_~k~0 1))} is VALID [2018-11-23 13:10:27,998 INFO L273 TraceCheckUtils]: 22: Hoare triple {477#(<= main_~j~0 (+ main_~k~0 1))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {478#(<= main_~j~0 main_~k~0)} is VALID [2018-11-23 13:10:28,007 INFO L273 TraceCheckUtils]: 23: Hoare triple {478#(<= main_~j~0 main_~k~0)} assume !!(~k~0 < ~j~0); {473#false} is VALID [2018-11-23 13:10:28,008 INFO L256 TraceCheckUtils]: 24: Hoare triple {473#false} call __VERIFIER_assert((if ~k~0 - ~i~0 <= 2 * ~n~0 then 1 else 0)); {473#false} is VALID [2018-11-23 13:10:28,008 INFO L273 TraceCheckUtils]: 25: Hoare triple {473#false} ~cond := #in~cond; {473#false} is VALID [2018-11-23 13:10:28,008 INFO L273 TraceCheckUtils]: 26: Hoare triple {473#false} assume 0 == ~cond; {473#false} is VALID [2018-11-23 13:10:28,008 INFO L273 TraceCheckUtils]: 27: Hoare triple {473#false} assume !false; {473#false} is VALID [2018-11-23 13:10:28,010 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:10:28,010 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:10:28,011 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:28,025 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:10:28,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:10:28,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:10:28,051 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:10:28,268 INFO L256 TraceCheckUtils]: 0: Hoare triple {472#true} call ULTIMATE.init(); {472#true} is VALID [2018-11-23 13:10:28,269 INFO L273 TraceCheckUtils]: 1: Hoare triple {472#true} ~__BLAST_NONDET~0 := 0; {472#true} is VALID [2018-11-23 13:10:28,269 INFO L273 TraceCheckUtils]: 2: Hoare triple {472#true} assume true; {472#true} is VALID [2018-11-23 13:10:28,269 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {472#true} {472#true} #77#return; {472#true} is VALID [2018-11-23 13:10:28,269 INFO L256 TraceCheckUtils]: 4: Hoare triple {472#true} call #t~ret7 := main(); {472#true} is VALID [2018-11-23 13:10:28,270 INFO L273 TraceCheckUtils]: 5: Hoare triple {472#true} havoc ~i~0;havoc ~j~0;havoc ~k~0;havoc ~n~0;havoc ~l~0;havoc ~m~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~m~0 := #t~nondet2;havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~l~0 := #t~nondet3;havoc #t~nondet3; {472#true} is VALID [2018-11-23 13:10:28,270 INFO L273 TraceCheckUtils]: 6: Hoare triple {472#true} assume !!(-1000000 < ~n~0 && ~n~0 < 1000000); {472#true} is VALID [2018-11-23 13:10:28,271 INFO L273 TraceCheckUtils]: 7: Hoare triple {472#true} assume !!(-1000000 < ~m~0 && ~m~0 < 1000000); {472#true} is VALID [2018-11-23 13:10:28,271 INFO L273 TraceCheckUtils]: 8: Hoare triple {472#true} assume !!(-1000000 < ~l~0 && ~l~0 < 1000000); {472#true} is VALID [2018-11-23 13:10:28,271 INFO L273 TraceCheckUtils]: 9: Hoare triple {472#true} assume 3 * ~n~0 <= ~m~0 + ~l~0; {472#true} is VALID [2018-11-23 13:10:28,277 INFO L273 TraceCheckUtils]: 10: Hoare triple {472#true} ~i~0 := 0; {474#(<= main_~i~0 0)} is VALID [2018-11-23 13:10:28,278 INFO L273 TraceCheckUtils]: 11: Hoare triple {474#(<= main_~i~0 0)} assume !!(~i~0 < ~n~0);~j~0 := 2 * ~i~0; {474#(<= main_~i~0 0)} is VALID [2018-11-23 13:10:28,280 INFO L273 TraceCheckUtils]: 12: Hoare triple {474#(<= main_~i~0 0)} assume !(~j~0 < 3 * ~i~0); {474#(<= main_~i~0 0)} is VALID [2018-11-23 13:10:28,280 INFO L273 TraceCheckUtils]: 13: Hoare triple {474#(<= main_~i~0 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {475#(<= main_~i~0 1)} is VALID [2018-11-23 13:10:28,281 INFO L273 TraceCheckUtils]: 14: Hoare triple {475#(<= main_~i~0 1)} assume !!(~i~0 < ~n~0);~j~0 := 2 * ~i~0; {524#(and (<= main_~j~0 (* 2 main_~i~0)) (<= main_~i~0 1))} is VALID [2018-11-23 13:10:28,283 INFO L273 TraceCheckUtils]: 15: Hoare triple {524#(and (<= main_~j~0 (* 2 main_~i~0)) (<= main_~i~0 1))} assume !!(~j~0 < 3 * ~i~0);~k~0 := ~i~0; {528#(exists ((main_~i~0 Int)) (and (<= main_~j~0 (* 2 main_~i~0)) (<= main_~i~0 1) (<= main_~i~0 main_~k~0)))} is VALID [2018-11-23 13:10:28,283 INFO L273 TraceCheckUtils]: 16: Hoare triple {528#(exists ((main_~i~0 Int)) (and (<= main_~j~0 (* 2 main_~i~0)) (<= main_~i~0 1) (<= main_~i~0 main_~k~0)))} assume !!(~k~0 < ~j~0); {528#(exists ((main_~i~0 Int)) (and (<= main_~j~0 (* 2 main_~i~0)) (<= main_~i~0 1) (<= main_~i~0 main_~k~0)))} is VALID [2018-11-23 13:10:28,284 INFO L256 TraceCheckUtils]: 17: Hoare triple {528#(exists ((main_~i~0 Int)) (and (<= main_~j~0 (* 2 main_~i~0)) (<= main_~i~0 1) (<= main_~i~0 main_~k~0)))} call __VERIFIER_assert((if ~k~0 - ~i~0 <= 2 * ~n~0 then 1 else 0)); {472#true} is VALID [2018-11-23 13:10:28,285 INFO L273 TraceCheckUtils]: 18: Hoare triple {472#true} ~cond := #in~cond; {472#true} is VALID [2018-11-23 13:10:28,285 INFO L273 TraceCheckUtils]: 19: Hoare triple {472#true} assume !(0 == ~cond); {472#true} is VALID [2018-11-23 13:10:28,286 INFO L273 TraceCheckUtils]: 20: Hoare triple {472#true} assume true; {472#true} is VALID [2018-11-23 13:10:28,290 INFO L268 TraceCheckUtils]: 21: Hoare quadruple {472#true} {528#(exists ((main_~i~0 Int)) (and (<= main_~j~0 (* 2 main_~i~0)) (<= main_~i~0 1) (<= main_~i~0 main_~k~0)))} #81#return; {528#(exists ((main_~i~0 Int)) (and (<= main_~j~0 (* 2 main_~i~0)) (<= main_~i~0 1) (<= main_~i~0 main_~k~0)))} is VALID [2018-11-23 13:10:28,292 INFO L273 TraceCheckUtils]: 22: Hoare triple {528#(exists ((main_~i~0 Int)) (and (<= main_~j~0 (* 2 main_~i~0)) (<= main_~i~0 1) (<= main_~i~0 main_~k~0)))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {550#(exists ((main_~i~0 Int)) (and (<= main_~j~0 (* 2 main_~i~0)) (<= main_~i~0 1) (<= (+ main_~i~0 1) main_~k~0)))} is VALID [2018-11-23 13:10:28,294 INFO L273 TraceCheckUtils]: 23: Hoare triple {550#(exists ((main_~i~0 Int)) (and (<= main_~j~0 (* 2 main_~i~0)) (<= main_~i~0 1) (<= (+ main_~i~0 1) main_~k~0)))} assume !!(~k~0 < ~j~0); {473#false} is VALID [2018-11-23 13:10:28,294 INFO L256 TraceCheckUtils]: 24: Hoare triple {473#false} call __VERIFIER_assert((if ~k~0 - ~i~0 <= 2 * ~n~0 then 1 else 0)); {473#false} is VALID [2018-11-23 13:10:28,294 INFO L273 TraceCheckUtils]: 25: Hoare triple {473#false} ~cond := #in~cond; {473#false} is VALID [2018-11-23 13:10:28,294 INFO L273 TraceCheckUtils]: 26: Hoare triple {473#false} assume 0 == ~cond; {473#false} is VALID [2018-11-23 13:10:28,295 INFO L273 TraceCheckUtils]: 27: Hoare triple {473#false} assume !false; {473#false} is VALID [2018-11-23 13:10:28,297 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:10:28,320 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:10:28,320 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2018-11-23 13:10:28,320 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 28 [2018-11-23 13:10:28,321 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:10:28,321 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2018-11-23 13:10:28,523 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:10:28,523 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-23 13:10:28,523 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-23 13:10:28,523 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-11-23 13:10:28,524 INFO L87 Difference]: Start difference. First operand 32 states and 35 transitions. Second operand 10 states. [2018-11-23 13:10:29,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:10:29,279 INFO L93 Difference]: Finished difference Result 65 states and 77 transitions. [2018-11-23 13:10:29,279 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-23 13:10:29,279 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 28 [2018-11-23 13:10:29,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:10:29,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-23 13:10:29,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 63 transitions. [2018-11-23 13:10:29,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-23 13:10:29,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 63 transitions. [2018-11-23 13:10:29,287 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 63 transitions. [2018-11-23 13:10:29,376 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:10:29,380 INFO L225 Difference]: With dead ends: 65 [2018-11-23 13:10:29,380 INFO L226 Difference]: Without dead ends: 46 [2018-11-23 13:10:29,381 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=65, Invalid=145, Unknown=0, NotChecked=0, Total=210 [2018-11-23 13:10:29,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-11-23 13:10:29,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 41. [2018-11-23 13:10:29,470 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:10:29,470 INFO L82 GeneralOperation]: Start isEquivalent. First operand 46 states. Second operand 41 states. [2018-11-23 13:10:29,470 INFO L74 IsIncluded]: Start isIncluded. First operand 46 states. Second operand 41 states. [2018-11-23 13:10:29,470 INFO L87 Difference]: Start difference. First operand 46 states. Second operand 41 states. [2018-11-23 13:10:29,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:10:29,475 INFO L93 Difference]: Finished difference Result 46 states and 54 transitions. [2018-11-23 13:10:29,476 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 54 transitions. [2018-11-23 13:10:29,477 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:10:29,477 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:10:29,477 INFO L74 IsIncluded]: Start isIncluded. First operand 41 states. Second operand 46 states. [2018-11-23 13:10:29,477 INFO L87 Difference]: Start difference. First operand 41 states. Second operand 46 states. [2018-11-23 13:10:29,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:10:29,481 INFO L93 Difference]: Finished difference Result 46 states and 54 transitions. [2018-11-23 13:10:29,481 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 54 transitions. [2018-11-23 13:10:29,482 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:10:29,482 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:10:29,482 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:10:29,482 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:10:29,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-11-23 13:10:29,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 48 transitions. [2018-11-23 13:10:29,485 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 48 transitions. Word has length 28 [2018-11-23 13:10:29,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:10:29,486 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 48 transitions. [2018-11-23 13:10:29,486 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-23 13:10:29,486 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 48 transitions. [2018-11-23 13:10:29,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-11-23 13:10:29,487 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:10:29,487 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:10:29,488 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:10:29,488 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:10:29,488 INFO L82 PathProgramCache]: Analyzing trace with hash 911329064, now seen corresponding path program 1 times [2018-11-23 13:10:29,488 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:10:29,489 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:10:29,490 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:10:29,490 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:10:29,490 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:10:29,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:10:29,709 INFO L256 TraceCheckUtils]: 0: Hoare triple {823#true} call ULTIMATE.init(); {823#true} is VALID [2018-11-23 13:10:29,709 INFO L273 TraceCheckUtils]: 1: Hoare triple {823#true} ~__BLAST_NONDET~0 := 0; {823#true} is VALID [2018-11-23 13:10:29,710 INFO L273 TraceCheckUtils]: 2: Hoare triple {823#true} assume true; {823#true} is VALID [2018-11-23 13:10:29,710 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {823#true} {823#true} #77#return; {823#true} is VALID [2018-11-23 13:10:29,710 INFO L256 TraceCheckUtils]: 4: Hoare triple {823#true} call #t~ret7 := main(); {823#true} is VALID [2018-11-23 13:10:29,711 INFO L273 TraceCheckUtils]: 5: Hoare triple {823#true} havoc ~i~0;havoc ~j~0;havoc ~k~0;havoc ~n~0;havoc ~l~0;havoc ~m~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~m~0 := #t~nondet2;havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~l~0 := #t~nondet3;havoc #t~nondet3; {823#true} is VALID [2018-11-23 13:10:29,711 INFO L273 TraceCheckUtils]: 6: Hoare triple {823#true} assume !!(-1000000 < ~n~0 && ~n~0 < 1000000); {823#true} is VALID [2018-11-23 13:10:29,711 INFO L273 TraceCheckUtils]: 7: Hoare triple {823#true} assume !!(-1000000 < ~m~0 && ~m~0 < 1000000); {823#true} is VALID [2018-11-23 13:10:29,712 INFO L273 TraceCheckUtils]: 8: Hoare triple {823#true} assume !!(-1000000 < ~l~0 && ~l~0 < 1000000); {823#true} is VALID [2018-11-23 13:10:29,712 INFO L273 TraceCheckUtils]: 9: Hoare triple {823#true} assume 3 * ~n~0 <= ~m~0 + ~l~0; {823#true} is VALID [2018-11-23 13:10:29,726 INFO L273 TraceCheckUtils]: 10: Hoare triple {823#true} ~i~0 := 0; {825#(<= 0 main_~i~0)} is VALID [2018-11-23 13:10:29,729 INFO L273 TraceCheckUtils]: 11: Hoare triple {825#(<= 0 main_~i~0)} assume !!(~i~0 < ~n~0);~j~0 := 2 * ~i~0; {825#(<= 0 main_~i~0)} is VALID [2018-11-23 13:10:29,732 INFO L273 TraceCheckUtils]: 12: Hoare triple {825#(<= 0 main_~i~0)} assume !(~j~0 < 3 * ~i~0); {825#(<= 0 main_~i~0)} is VALID [2018-11-23 13:10:29,733 INFO L273 TraceCheckUtils]: 13: Hoare triple {825#(<= 0 main_~i~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {826#(<= 1 main_~i~0)} is VALID [2018-11-23 13:10:29,737 INFO L273 TraceCheckUtils]: 14: Hoare triple {826#(<= 1 main_~i~0)} assume !!(~i~0 < ~n~0);~j~0 := 2 * ~i~0; {826#(<= 1 main_~i~0)} is VALID [2018-11-23 13:10:29,737 INFO L273 TraceCheckUtils]: 15: Hoare triple {826#(<= 1 main_~i~0)} assume !!(~j~0 < 3 * ~i~0);~k~0 := ~i~0; {827#(<= (+ main_~k~0 2) (* 3 main_~i~0))} is VALID [2018-11-23 13:10:29,738 INFO L273 TraceCheckUtils]: 16: Hoare triple {827#(<= (+ main_~k~0 2) (* 3 main_~i~0))} assume !(~k~0 < ~j~0); {828#(<= (+ main_~j~0 2) (* 3 main_~i~0))} is VALID [2018-11-23 13:10:29,739 INFO L273 TraceCheckUtils]: 17: Hoare triple {828#(<= (+ main_~j~0 2) (* 3 main_~i~0))} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {829#(<= (+ main_~j~0 1) (* 3 main_~i~0))} is VALID [2018-11-23 13:10:29,758 INFO L273 TraceCheckUtils]: 18: Hoare triple {829#(<= (+ main_~j~0 1) (* 3 main_~i~0))} assume !(~j~0 < 3 * ~i~0); {824#false} is VALID [2018-11-23 13:10:29,758 INFO L273 TraceCheckUtils]: 19: Hoare triple {824#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {824#false} is VALID [2018-11-23 13:10:29,758 INFO L273 TraceCheckUtils]: 20: Hoare triple {824#false} assume !!(~i~0 < ~n~0);~j~0 := 2 * ~i~0; {824#false} is VALID [2018-11-23 13:10:29,759 INFO L273 TraceCheckUtils]: 21: Hoare triple {824#false} assume !!(~j~0 < 3 * ~i~0);~k~0 := ~i~0; {824#false} is VALID [2018-11-23 13:10:29,759 INFO L273 TraceCheckUtils]: 22: Hoare triple {824#false} assume !!(~k~0 < ~j~0); {824#false} is VALID [2018-11-23 13:10:29,759 INFO L256 TraceCheckUtils]: 23: Hoare triple {824#false} call __VERIFIER_assert((if ~k~0 - ~i~0 <= 2 * ~n~0 then 1 else 0)); {823#true} is VALID [2018-11-23 13:10:29,760 INFO L273 TraceCheckUtils]: 24: Hoare triple {823#true} ~cond := #in~cond; {823#true} is VALID [2018-11-23 13:10:29,760 INFO L273 TraceCheckUtils]: 25: Hoare triple {823#true} assume !(0 == ~cond); {823#true} is VALID [2018-11-23 13:10:29,760 INFO L273 TraceCheckUtils]: 26: Hoare triple {823#true} assume true; {823#true} is VALID [2018-11-23 13:10:29,760 INFO L268 TraceCheckUtils]: 27: Hoare quadruple {823#true} {824#false} #81#return; {824#false} is VALID [2018-11-23 13:10:29,761 INFO L273 TraceCheckUtils]: 28: Hoare triple {824#false} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {824#false} is VALID [2018-11-23 13:10:29,761 INFO L273 TraceCheckUtils]: 29: Hoare triple {824#false} assume !!(~k~0 < ~j~0); {824#false} is VALID [2018-11-23 13:10:29,761 INFO L256 TraceCheckUtils]: 30: Hoare triple {824#false} call __VERIFIER_assert((if ~k~0 - ~i~0 <= 2 * ~n~0 then 1 else 0)); {824#false} is VALID [2018-11-23 13:10:29,761 INFO L273 TraceCheckUtils]: 31: Hoare triple {824#false} ~cond := #in~cond; {824#false} is VALID [2018-11-23 13:10:29,762 INFO L273 TraceCheckUtils]: 32: Hoare triple {824#false} assume 0 == ~cond; {824#false} is VALID [2018-11-23 13:10:29,762 INFO L273 TraceCheckUtils]: 33: Hoare triple {824#false} assume !false; {824#false} is VALID [2018-11-23 13:10:29,764 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 12 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-23 13:10:29,765 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:10:29,765 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:29,779 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:10:29,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:10:29,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:10:29,836 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:10:30,039 INFO L256 TraceCheckUtils]: 0: Hoare triple {823#true} call ULTIMATE.init(); {823#true} is VALID [2018-11-23 13:10:30,039 INFO L273 TraceCheckUtils]: 1: Hoare triple {823#true} ~__BLAST_NONDET~0 := 0; {823#true} is VALID [2018-11-23 13:10:30,040 INFO L273 TraceCheckUtils]: 2: Hoare triple {823#true} assume true; {823#true} is VALID [2018-11-23 13:10:30,040 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {823#true} {823#true} #77#return; {823#true} is VALID [2018-11-23 13:10:30,041 INFO L256 TraceCheckUtils]: 4: Hoare triple {823#true} call #t~ret7 := main(); {823#true} is VALID [2018-11-23 13:10:30,041 INFO L273 TraceCheckUtils]: 5: Hoare triple {823#true} havoc ~i~0;havoc ~j~0;havoc ~k~0;havoc ~n~0;havoc ~l~0;havoc ~m~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~m~0 := #t~nondet2;havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~l~0 := #t~nondet3;havoc #t~nondet3; {823#true} is VALID [2018-11-23 13:10:30,041 INFO L273 TraceCheckUtils]: 6: Hoare triple {823#true} assume !!(-1000000 < ~n~0 && ~n~0 < 1000000); {823#true} is VALID [2018-11-23 13:10:30,041 INFO L273 TraceCheckUtils]: 7: Hoare triple {823#true} assume !!(-1000000 < ~m~0 && ~m~0 < 1000000); {823#true} is VALID [2018-11-23 13:10:30,041 INFO L273 TraceCheckUtils]: 8: Hoare triple {823#true} assume !!(-1000000 < ~l~0 && ~l~0 < 1000000); {823#true} is VALID [2018-11-23 13:10:30,042 INFO L273 TraceCheckUtils]: 9: Hoare triple {823#true} assume 3 * ~n~0 <= ~m~0 + ~l~0; {823#true} is VALID [2018-11-23 13:10:30,042 INFO L273 TraceCheckUtils]: 10: Hoare triple {823#true} ~i~0 := 0; {825#(<= 0 main_~i~0)} is VALID [2018-11-23 13:10:30,043 INFO L273 TraceCheckUtils]: 11: Hoare triple {825#(<= 0 main_~i~0)} assume !!(~i~0 < ~n~0);~j~0 := 2 * ~i~0; {825#(<= 0 main_~i~0)} is VALID [2018-11-23 13:10:30,043 INFO L273 TraceCheckUtils]: 12: Hoare triple {825#(<= 0 main_~i~0)} assume !(~j~0 < 3 * ~i~0); {825#(<= 0 main_~i~0)} is VALID [2018-11-23 13:10:30,044 INFO L273 TraceCheckUtils]: 13: Hoare triple {825#(<= 0 main_~i~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {826#(<= 1 main_~i~0)} is VALID [2018-11-23 13:10:30,044 INFO L273 TraceCheckUtils]: 14: Hoare triple {826#(<= 1 main_~i~0)} assume !!(~i~0 < ~n~0);~j~0 := 2 * ~i~0; {875#(and (<= 1 main_~i~0) (<= (* 2 main_~i~0) main_~j~0))} is VALID [2018-11-23 13:10:30,047 INFO L273 TraceCheckUtils]: 15: Hoare triple {875#(and (<= 1 main_~i~0) (<= (* 2 main_~i~0) main_~j~0))} assume !!(~j~0 < 3 * ~i~0);~k~0 := ~i~0; {879#(exists ((main_~i~0 Int)) (and (<= 1 main_~i~0) (<= (* 2 main_~i~0) main_~j~0) (<= main_~k~0 main_~i~0)))} is VALID [2018-11-23 13:10:30,048 INFO L273 TraceCheckUtils]: 16: Hoare triple {879#(exists ((main_~i~0 Int)) (and (<= 1 main_~i~0) (<= (* 2 main_~i~0) main_~j~0) (<= main_~k~0 main_~i~0)))} assume !(~k~0 < ~j~0); {824#false} is VALID [2018-11-23 13:10:30,048 INFO L273 TraceCheckUtils]: 17: Hoare triple {824#false} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {824#false} is VALID [2018-11-23 13:10:30,048 INFO L273 TraceCheckUtils]: 18: Hoare triple {824#false} assume !(~j~0 < 3 * ~i~0); {824#false} is VALID [2018-11-23 13:10:30,048 INFO L273 TraceCheckUtils]: 19: Hoare triple {824#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {824#false} is VALID [2018-11-23 13:10:30,049 INFO L273 TraceCheckUtils]: 20: Hoare triple {824#false} assume !!(~i~0 < ~n~0);~j~0 := 2 * ~i~0; {824#false} is VALID [2018-11-23 13:10:30,049 INFO L273 TraceCheckUtils]: 21: Hoare triple {824#false} assume !!(~j~0 < 3 * ~i~0);~k~0 := ~i~0; {824#false} is VALID [2018-11-23 13:10:30,049 INFO L273 TraceCheckUtils]: 22: Hoare triple {824#false} assume !!(~k~0 < ~j~0); {824#false} is VALID [2018-11-23 13:10:30,049 INFO L256 TraceCheckUtils]: 23: Hoare triple {824#false} call __VERIFIER_assert((if ~k~0 - ~i~0 <= 2 * ~n~0 then 1 else 0)); {824#false} is VALID [2018-11-23 13:10:30,049 INFO L273 TraceCheckUtils]: 24: Hoare triple {824#false} ~cond := #in~cond; {824#false} is VALID [2018-11-23 13:10:30,050 INFO L273 TraceCheckUtils]: 25: Hoare triple {824#false} assume !(0 == ~cond); {824#false} is VALID [2018-11-23 13:10:30,050 INFO L273 TraceCheckUtils]: 26: Hoare triple {824#false} assume true; {824#false} is VALID [2018-11-23 13:10:30,050 INFO L268 TraceCheckUtils]: 27: Hoare quadruple {824#false} {824#false} #81#return; {824#false} is VALID [2018-11-23 13:10:30,050 INFO L273 TraceCheckUtils]: 28: Hoare triple {824#false} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {824#false} is VALID [2018-11-23 13:10:30,050 INFO L273 TraceCheckUtils]: 29: Hoare triple {824#false} assume !!(~k~0 < ~j~0); {824#false} is VALID [2018-11-23 13:10:30,051 INFO L256 TraceCheckUtils]: 30: Hoare triple {824#false} call __VERIFIER_assert((if ~k~0 - ~i~0 <= 2 * ~n~0 then 1 else 0)); {824#false} is VALID [2018-11-23 13:10:30,051 INFO L273 TraceCheckUtils]: 31: Hoare triple {824#false} ~cond := #in~cond; {824#false} is VALID [2018-11-23 13:10:30,051 INFO L273 TraceCheckUtils]: 32: Hoare triple {824#false} assume 0 == ~cond; {824#false} is VALID [2018-11-23 13:10:30,051 INFO L273 TraceCheckUtils]: 33: Hoare triple {824#false} assume !false; {824#false} is VALID [2018-11-23 13:10:30,053 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-23 13:10:30,073 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-23 13:10:30,073 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 9 [2018-11-23 13:10:30,073 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 34 [2018-11-23 13:10:30,074 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:10:30,074 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2018-11-23 13:10:30,118 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:30,118 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-23 13:10:30,118 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-23 13:10:30,119 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-11-23 13:10:30,119 INFO L87 Difference]: Start difference. First operand 41 states and 48 transitions. Second operand 9 states. [2018-11-23 13:10:30,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:10:30,710 INFO L93 Difference]: Finished difference Result 71 states and 86 transitions. [2018-11-23 13:10:30,710 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-23 13:10:30,710 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 34 [2018-11-23 13:10:30,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:10:30,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-23 13:10:30,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 51 transitions. [2018-11-23 13:10:30,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-23 13:10:30,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 51 transitions. [2018-11-23 13:10:30,716 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 51 transitions. [2018-11-23 13:10:30,853 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:30,855 INFO L225 Difference]: With dead ends: 71 [2018-11-23 13:10:30,855 INFO L226 Difference]: Without dead ends: 43 [2018-11-23 13:10:30,856 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2018-11-23 13:10:30,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-11-23 13:10:30,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 42. [2018-11-23 13:10:30,990 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:10:30,991 INFO L82 GeneralOperation]: Start isEquivalent. First operand 43 states. Second operand 42 states. [2018-11-23 13:10:30,991 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states. Second operand 42 states. [2018-11-23 13:10:30,991 INFO L87 Difference]: Start difference. First operand 43 states. Second operand 42 states. [2018-11-23 13:10:30,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:10:30,995 INFO L93 Difference]: Finished difference Result 43 states and 47 transitions. [2018-11-23 13:10:30,995 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 47 transitions. [2018-11-23 13:10:30,996 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:10:30,996 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:10:30,996 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand 43 states. [2018-11-23 13:10:30,997 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 43 states. [2018-11-23 13:10:31,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:10:31,000 INFO L93 Difference]: Finished difference Result 43 states and 47 transitions. [2018-11-23 13:10:31,000 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 47 transitions. [2018-11-23 13:10:31,001 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:10:31,001 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:10:31,002 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:10:31,002 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:10:31,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-11-23 13:10:31,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 46 transitions. [2018-11-23 13:10:31,004 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 46 transitions. Word has length 34 [2018-11-23 13:10:31,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:10:31,005 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 46 transitions. [2018-11-23 13:10:31,005 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-23 13:10:31,005 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 46 transitions. [2018-11-23 13:10:31,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-11-23 13:10:31,006 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:10:31,007 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:10:31,007 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:10:31,007 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:10:31,007 INFO L82 PathProgramCache]: Analyzing trace with hash -973854811, now seen corresponding path program 2 times [2018-11-23 13:10:31,007 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:10:31,008 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:10:31,008 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:10:31,008 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:10:31,008 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:10:31,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:10:31,280 INFO L256 TraceCheckUtils]: 0: Hoare triple {1194#true} call ULTIMATE.init(); {1194#true} is VALID [2018-11-23 13:10:31,280 INFO L273 TraceCheckUtils]: 1: Hoare triple {1194#true} ~__BLAST_NONDET~0 := 0; {1194#true} is VALID [2018-11-23 13:10:31,281 INFO L273 TraceCheckUtils]: 2: Hoare triple {1194#true} assume true; {1194#true} is VALID [2018-11-23 13:10:31,281 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1194#true} {1194#true} #77#return; {1194#true} is VALID [2018-11-23 13:10:31,281 INFO L256 TraceCheckUtils]: 4: Hoare triple {1194#true} call #t~ret7 := main(); {1194#true} is VALID [2018-11-23 13:10:31,282 INFO L273 TraceCheckUtils]: 5: Hoare triple {1194#true} havoc ~i~0;havoc ~j~0;havoc ~k~0;havoc ~n~0;havoc ~l~0;havoc ~m~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~m~0 := #t~nondet2;havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~l~0 := #t~nondet3;havoc #t~nondet3; {1194#true} is VALID [2018-11-23 13:10:31,282 INFO L273 TraceCheckUtils]: 6: Hoare triple {1194#true} assume !!(-1000000 < ~n~0 && ~n~0 < 1000000); {1194#true} is VALID [2018-11-23 13:10:31,282 INFO L273 TraceCheckUtils]: 7: Hoare triple {1194#true} assume !!(-1000000 < ~m~0 && ~m~0 < 1000000); {1194#true} is VALID [2018-11-23 13:10:31,282 INFO L273 TraceCheckUtils]: 8: Hoare triple {1194#true} assume !!(-1000000 < ~l~0 && ~l~0 < 1000000); {1194#true} is VALID [2018-11-23 13:10:31,283 INFO L273 TraceCheckUtils]: 9: Hoare triple {1194#true} assume 3 * ~n~0 <= ~m~0 + ~l~0; {1194#true} is VALID [2018-11-23 13:10:31,284 INFO L273 TraceCheckUtils]: 10: Hoare triple {1194#true} ~i~0 := 0; {1196#(<= 0 main_~i~0)} is VALID [2018-11-23 13:10:31,284 INFO L273 TraceCheckUtils]: 11: Hoare triple {1196#(<= 0 main_~i~0)} assume !!(~i~0 < ~n~0);~j~0 := 2 * ~i~0; {1196#(<= 0 main_~i~0)} is VALID [2018-11-23 13:10:31,285 INFO L273 TraceCheckUtils]: 12: Hoare triple {1196#(<= 0 main_~i~0)} assume !(~j~0 < 3 * ~i~0); {1196#(<= 0 main_~i~0)} is VALID [2018-11-23 13:10:31,285 INFO L273 TraceCheckUtils]: 13: Hoare triple {1196#(<= 0 main_~i~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1197#(<= 1 main_~i~0)} is VALID [2018-11-23 13:10:31,286 INFO L273 TraceCheckUtils]: 14: Hoare triple {1197#(<= 1 main_~i~0)} assume !!(~i~0 < ~n~0);~j~0 := 2 * ~i~0; {1197#(<= 1 main_~i~0)} is VALID [2018-11-23 13:10:31,286 INFO L273 TraceCheckUtils]: 15: Hoare triple {1197#(<= 1 main_~i~0)} assume !!(~j~0 < 3 * ~i~0);~k~0 := ~i~0; {1197#(<= 1 main_~i~0)} is VALID [2018-11-23 13:10:31,286 INFO L273 TraceCheckUtils]: 16: Hoare triple {1197#(<= 1 main_~i~0)} assume !!(~k~0 < ~j~0); {1197#(<= 1 main_~i~0)} is VALID [2018-11-23 13:10:31,287 INFO L256 TraceCheckUtils]: 17: Hoare triple {1197#(<= 1 main_~i~0)} call __VERIFIER_assert((if ~k~0 - ~i~0 <= 2 * ~n~0 then 1 else 0)); {1194#true} is VALID [2018-11-23 13:10:31,289 INFO L273 TraceCheckUtils]: 18: Hoare triple {1194#true} ~cond := #in~cond; {1198#(= __VERIFIER_assert_~cond |__VERIFIER_assert_#in~cond|)} is VALID [2018-11-23 13:10:31,294 INFO L273 TraceCheckUtils]: 19: Hoare triple {1198#(= __VERIFIER_assert_~cond |__VERIFIER_assert_#in~cond|)} assume !(0 == ~cond); {1199#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2018-11-23 13:10:31,295 INFO L273 TraceCheckUtils]: 20: Hoare triple {1199#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {1199#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2018-11-23 13:10:31,296 INFO L268 TraceCheckUtils]: 21: Hoare quadruple {1199#(not (= |__VERIFIER_assert_#in~cond| 0))} {1197#(<= 1 main_~i~0)} #81#return; {1197#(<= 1 main_~i~0)} is VALID [2018-11-23 13:10:31,296 INFO L273 TraceCheckUtils]: 22: Hoare triple {1197#(<= 1 main_~i~0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {1197#(<= 1 main_~i~0)} is VALID [2018-11-23 13:10:31,297 INFO L273 TraceCheckUtils]: 23: Hoare triple {1197#(<= 1 main_~i~0)} assume !(~k~0 < ~j~0); {1197#(<= 1 main_~i~0)} is VALID [2018-11-23 13:10:31,297 INFO L273 TraceCheckUtils]: 24: Hoare triple {1197#(<= 1 main_~i~0)} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {1197#(<= 1 main_~i~0)} is VALID [2018-11-23 13:10:31,297 INFO L273 TraceCheckUtils]: 25: Hoare triple {1197#(<= 1 main_~i~0)} assume !(~j~0 < 3 * ~i~0); {1197#(<= 1 main_~i~0)} is VALID [2018-11-23 13:10:31,298 INFO L273 TraceCheckUtils]: 26: Hoare triple {1197#(<= 1 main_~i~0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1200#(<= 2 main_~i~0)} is VALID [2018-11-23 13:10:31,299 INFO L273 TraceCheckUtils]: 27: Hoare triple {1200#(<= 2 main_~i~0)} assume !!(~i~0 < ~n~0);~j~0 := 2 * ~i~0; {1201#(<= 3 main_~n~0)} is VALID [2018-11-23 13:10:31,300 INFO L273 TraceCheckUtils]: 28: Hoare triple {1201#(<= 3 main_~n~0)} assume !!(~j~0 < 3 * ~i~0);~k~0 := ~i~0; {1202#(<= (+ main_~k~0 6) (+ main_~i~0 (* 2 main_~n~0)))} is VALID [2018-11-23 13:10:31,301 INFO L273 TraceCheckUtils]: 29: Hoare triple {1202#(<= (+ main_~k~0 6) (+ main_~i~0 (* 2 main_~n~0)))} assume !!(~k~0 < ~j~0); {1202#(<= (+ main_~k~0 6) (+ main_~i~0 (* 2 main_~n~0)))} is VALID [2018-11-23 13:10:31,301 INFO L256 TraceCheckUtils]: 30: Hoare triple {1202#(<= (+ main_~k~0 6) (+ main_~i~0 (* 2 main_~n~0)))} call __VERIFIER_assert((if ~k~0 - ~i~0 <= 2 * ~n~0 then 1 else 0)); {1194#true} is VALID [2018-11-23 13:10:31,302 INFO L273 TraceCheckUtils]: 31: Hoare triple {1194#true} ~cond := #in~cond; {1194#true} is VALID [2018-11-23 13:10:31,302 INFO L273 TraceCheckUtils]: 32: Hoare triple {1194#true} assume !(0 == ~cond); {1194#true} is VALID [2018-11-23 13:10:31,302 INFO L273 TraceCheckUtils]: 33: Hoare triple {1194#true} assume true; {1194#true} is VALID [2018-11-23 13:10:31,303 INFO L268 TraceCheckUtils]: 34: Hoare quadruple {1194#true} {1202#(<= (+ main_~k~0 6) (+ main_~i~0 (* 2 main_~n~0)))} #81#return; {1202#(<= (+ main_~k~0 6) (+ main_~i~0 (* 2 main_~n~0)))} is VALID [2018-11-23 13:10:31,304 INFO L273 TraceCheckUtils]: 35: Hoare triple {1202#(<= (+ main_~k~0 6) (+ main_~i~0 (* 2 main_~n~0)))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {1203#(<= (+ main_~k~0 5) (+ main_~i~0 (* 2 main_~n~0)))} is VALID [2018-11-23 13:10:31,304 INFO L273 TraceCheckUtils]: 36: Hoare triple {1203#(<= (+ main_~k~0 5) (+ main_~i~0 (* 2 main_~n~0)))} assume !!(~k~0 < ~j~0); {1203#(<= (+ main_~k~0 5) (+ main_~i~0 (* 2 main_~n~0)))} is VALID [2018-11-23 13:10:31,305 INFO L256 TraceCheckUtils]: 37: Hoare triple {1203#(<= (+ main_~k~0 5) (+ main_~i~0 (* 2 main_~n~0)))} call __VERIFIER_assert((if ~k~0 - ~i~0 <= 2 * ~n~0 then 1 else 0)); {1199#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2018-11-23 13:10:31,306 INFO L273 TraceCheckUtils]: 38: Hoare triple {1199#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {1204#(not (= __VERIFIER_assert_~cond 0))} is VALID [2018-11-23 13:10:31,306 INFO L273 TraceCheckUtils]: 39: Hoare triple {1204#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {1195#false} is VALID [2018-11-23 13:10:31,307 INFO L273 TraceCheckUtils]: 40: Hoare triple {1195#false} assume !false; {1195#false} is VALID [2018-11-23 13:10:31,310 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 9 proven. 16 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-23 13:10:31,311 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:10:31,311 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:31,327 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 13:10:31,347 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2018-11-23 13:10:31,347 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:10:31,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:10:31,381 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:10:31,631 INFO L256 TraceCheckUtils]: 0: Hoare triple {1194#true} call ULTIMATE.init(); {1194#true} is VALID [2018-11-23 13:10:31,631 INFO L273 TraceCheckUtils]: 1: Hoare triple {1194#true} ~__BLAST_NONDET~0 := 0; {1194#true} is VALID [2018-11-23 13:10:31,631 INFO L273 TraceCheckUtils]: 2: Hoare triple {1194#true} assume true; {1194#true} is VALID [2018-11-23 13:10:31,632 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1194#true} {1194#true} #77#return; {1194#true} is VALID [2018-11-23 13:10:31,632 INFO L256 TraceCheckUtils]: 4: Hoare triple {1194#true} call #t~ret7 := main(); {1194#true} is VALID [2018-11-23 13:10:31,632 INFO L273 TraceCheckUtils]: 5: Hoare triple {1194#true} havoc ~i~0;havoc ~j~0;havoc ~k~0;havoc ~n~0;havoc ~l~0;havoc ~m~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~m~0 := #t~nondet2;havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~l~0 := #t~nondet3;havoc #t~nondet3; {1194#true} is VALID [2018-11-23 13:10:31,632 INFO L273 TraceCheckUtils]: 6: Hoare triple {1194#true} assume !!(-1000000 < ~n~0 && ~n~0 < 1000000); {1194#true} is VALID [2018-11-23 13:10:31,633 INFO L273 TraceCheckUtils]: 7: Hoare triple {1194#true} assume !!(-1000000 < ~m~0 && ~m~0 < 1000000); {1194#true} is VALID [2018-11-23 13:10:31,633 INFO L273 TraceCheckUtils]: 8: Hoare triple {1194#true} assume !!(-1000000 < ~l~0 && ~l~0 < 1000000); {1194#true} is VALID [2018-11-23 13:10:31,633 INFO L273 TraceCheckUtils]: 9: Hoare triple {1194#true} assume 3 * ~n~0 <= ~m~0 + ~l~0; {1194#true} is VALID [2018-11-23 13:10:31,633 INFO L273 TraceCheckUtils]: 10: Hoare triple {1194#true} ~i~0 := 0; {1194#true} is VALID [2018-11-23 13:10:31,634 INFO L273 TraceCheckUtils]: 11: Hoare triple {1194#true} assume !!(~i~0 < ~n~0);~j~0 := 2 * ~i~0; {1194#true} is VALID [2018-11-23 13:10:31,634 INFO L273 TraceCheckUtils]: 12: Hoare triple {1194#true} assume !(~j~0 < 3 * ~i~0); {1194#true} is VALID [2018-11-23 13:10:31,634 INFO L273 TraceCheckUtils]: 13: Hoare triple {1194#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1194#true} is VALID [2018-11-23 13:10:31,634 INFO L273 TraceCheckUtils]: 14: Hoare triple {1194#true} assume !!(~i~0 < ~n~0);~j~0 := 2 * ~i~0; {1194#true} is VALID [2018-11-23 13:10:31,634 INFO L273 TraceCheckUtils]: 15: Hoare triple {1194#true} assume !!(~j~0 < 3 * ~i~0);~k~0 := ~i~0; {1194#true} is VALID [2018-11-23 13:10:31,635 INFO L273 TraceCheckUtils]: 16: Hoare triple {1194#true} assume !!(~k~0 < ~j~0); {1194#true} is VALID [2018-11-23 13:10:31,635 INFO L256 TraceCheckUtils]: 17: Hoare triple {1194#true} call __VERIFIER_assert((if ~k~0 - ~i~0 <= 2 * ~n~0 then 1 else 0)); {1194#true} is VALID [2018-11-23 13:10:31,635 INFO L273 TraceCheckUtils]: 18: Hoare triple {1194#true} ~cond := #in~cond; {1194#true} is VALID [2018-11-23 13:10:31,635 INFO L273 TraceCheckUtils]: 19: Hoare triple {1194#true} assume !(0 == ~cond); {1194#true} is VALID [2018-11-23 13:10:31,635 INFO L273 TraceCheckUtils]: 20: Hoare triple {1194#true} assume true; {1194#true} is VALID [2018-11-23 13:10:31,636 INFO L268 TraceCheckUtils]: 21: Hoare quadruple {1194#true} {1194#true} #81#return; {1194#true} is VALID [2018-11-23 13:10:31,636 INFO L273 TraceCheckUtils]: 22: Hoare triple {1194#true} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {1194#true} is VALID [2018-11-23 13:10:31,636 INFO L273 TraceCheckUtils]: 23: Hoare triple {1194#true} assume !(~k~0 < ~j~0); {1194#true} is VALID [2018-11-23 13:10:31,636 INFO L273 TraceCheckUtils]: 24: Hoare triple {1194#true} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {1194#true} is VALID [2018-11-23 13:10:31,636 INFO L273 TraceCheckUtils]: 25: Hoare triple {1194#true} assume !(~j~0 < 3 * ~i~0); {1194#true} is VALID [2018-11-23 13:10:31,636 INFO L273 TraceCheckUtils]: 26: Hoare triple {1194#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1194#true} is VALID [2018-11-23 13:10:31,653 INFO L273 TraceCheckUtils]: 27: Hoare triple {1194#true} assume !!(~i~0 < ~n~0);~j~0 := 2 * ~i~0; {1289#(< main_~i~0 main_~n~0)} is VALID [2018-11-23 13:10:31,662 INFO L273 TraceCheckUtils]: 28: Hoare triple {1289#(< main_~i~0 main_~n~0)} assume !!(~j~0 < 3 * ~i~0);~k~0 := ~i~0; {1293#(and (< main_~j~0 (* 3 main_~i~0)) (< main_~i~0 main_~n~0))} is VALID [2018-11-23 13:10:31,674 INFO L273 TraceCheckUtils]: 29: Hoare triple {1293#(and (< main_~j~0 (* 3 main_~i~0)) (< main_~i~0 main_~n~0))} assume !!(~k~0 < ~j~0); {1293#(and (< main_~j~0 (* 3 main_~i~0)) (< main_~i~0 main_~n~0))} is VALID [2018-11-23 13:10:31,675 INFO L256 TraceCheckUtils]: 30: Hoare triple {1293#(and (< main_~j~0 (* 3 main_~i~0)) (< main_~i~0 main_~n~0))} call __VERIFIER_assert((if ~k~0 - ~i~0 <= 2 * ~n~0 then 1 else 0)); {1194#true} is VALID [2018-11-23 13:10:31,675 INFO L273 TraceCheckUtils]: 31: Hoare triple {1194#true} ~cond := #in~cond; {1194#true} is VALID [2018-11-23 13:10:31,675 INFO L273 TraceCheckUtils]: 32: Hoare triple {1194#true} assume !(0 == ~cond); {1194#true} is VALID [2018-11-23 13:10:31,676 INFO L273 TraceCheckUtils]: 33: Hoare triple {1194#true} assume true; {1194#true} is VALID [2018-11-23 13:10:31,689 INFO L268 TraceCheckUtils]: 34: Hoare quadruple {1194#true} {1293#(and (< main_~j~0 (* 3 main_~i~0)) (< main_~i~0 main_~n~0))} #81#return; {1293#(and (< main_~j~0 (* 3 main_~i~0)) (< main_~i~0 main_~n~0))} is VALID [2018-11-23 13:10:31,691 INFO L273 TraceCheckUtils]: 35: Hoare triple {1293#(and (< main_~j~0 (* 3 main_~i~0)) (< main_~i~0 main_~n~0))} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {1293#(and (< main_~j~0 (* 3 main_~i~0)) (< main_~i~0 main_~n~0))} is VALID [2018-11-23 13:10:31,692 INFO L273 TraceCheckUtils]: 36: Hoare triple {1293#(and (< main_~j~0 (* 3 main_~i~0)) (< main_~i~0 main_~n~0))} assume !!(~k~0 < ~j~0); {1318#(and (< main_~i~0 main_~n~0) (<= (+ main_~k~0 2) (* 3 main_~i~0)))} is VALID [2018-11-23 13:10:31,697 INFO L256 TraceCheckUtils]: 37: Hoare triple {1318#(and (< main_~i~0 main_~n~0) (<= (+ main_~k~0 2) (* 3 main_~i~0)))} call __VERIFIER_assert((if ~k~0 - ~i~0 <= 2 * ~n~0 then 1 else 0)); {1322#(= |__VERIFIER_assert_#in~cond| 1)} is VALID [2018-11-23 13:10:31,699 INFO L273 TraceCheckUtils]: 38: Hoare triple {1322#(= |__VERIFIER_assert_#in~cond| 1)} ~cond := #in~cond; {1326#(= 1 __VERIFIER_assert_~cond)} is VALID [2018-11-23 13:10:31,699 INFO L273 TraceCheckUtils]: 39: Hoare triple {1326#(= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1195#false} is VALID [2018-11-23 13:10:31,699 INFO L273 TraceCheckUtils]: 40: Hoare triple {1195#false} assume !false; {1195#false} is VALID [2018-11-23 13:10:31,716 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 14 proven. 1 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-11-23 13:10:31,741 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:10:31,741 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 7] total 16 [2018-11-23 13:10:31,741 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 41 [2018-11-23 13:10:31,742 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:10:31,742 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states. [2018-11-23 13:10:31,982 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:10:31,982 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-11-23 13:10:31,983 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-11-23 13:10:31,983 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2018-11-23 13:10:31,984 INFO L87 Difference]: Start difference. First operand 42 states and 46 transitions. Second operand 16 states. [2018-11-23 13:10:33,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:10:33,851 INFO L93 Difference]: Finished difference Result 53 states and 60 transitions. [2018-11-23 13:10:33,851 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-11-23 13:10:33,851 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 41 [2018-11-23 13:10:33,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:10:33,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-23 13:10:33,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 57 transitions. [2018-11-23 13:10:33,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-23 13:10:33,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 57 transitions. [2018-11-23 13:10:33,857 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 21 states and 57 transitions. [2018-11-23 13:10:33,963 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:10:33,963 INFO L225 Difference]: With dead ends: 53 [2018-11-23 13:10:33,964 INFO L226 Difference]: Without dead ends: 0 [2018-11-23 13:10:33,965 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 154 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=217, Invalid=713, Unknown=0, NotChecked=0, Total=930 [2018-11-23 13:10:33,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-23 13:10:33,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-23 13:10:33,966 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:10:33,966 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2018-11-23 13:10:33,966 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2018-11-23 13:10:33,966 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2018-11-23 13:10:33,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:10:33,966 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2018-11-23 13:10:33,966 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-23 13:10:33,966 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:10:33,966 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:10:33,967 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2018-11-23 13:10:33,967 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2018-11-23 13:10:33,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:10:33,967 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2018-11-23 13:10:33,967 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-23 13:10:33,967 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:10:33,967 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:10:33,968 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:10:33,968 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:10:33,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-23 13:10:33,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-23 13:10:33,968 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 41 [2018-11-23 13:10:33,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:10:33,968 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 13:10:33,969 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-11-23 13:10:33,969 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-23 13:10:33,969 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:10:33,974 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-23 13:10:34,429 WARN L180 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 33 [2018-11-23 13:10:34,440 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-11-23 13:10:34,441 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: true [2018-11-23 13:10:34,441 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-23 13:10:34,441 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-23 13:10:34,441 INFO L451 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-11-23 13:10:34,441 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-23 13:10:34,441 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-23 13:10:34,441 INFO L448 ceAbstractionStarter]: For program point mainEXIT(lines 11 26) no Hoare annotation was computed. [2018-11-23 13:10:34,442 INFO L444 ceAbstractionStarter]: At program point L23(line 23) the Hoare annotation is: (let ((.cse2 (* 3 main_~i~0))) (let ((.cse0 (< main_~i~0 main_~n~0)) (.cse1 (<= (+ main_~k~0 2) .cse2))) (or (and (exists ((main_~i~0 Int)) (and (<= main_~j~0 (* 2 main_~i~0)) (<= main_~i~0 1) (<= main_~i~0 main_~k~0))) .cse0 (exists ((main_~i~0 Int)) (and (<= 1 main_~i~0) (<= (* 2 main_~i~0) main_~j~0) (<= main_~k~0 main_~i~0))) (<= main_~i~0 1) .cse1) (and (<= 2 main_~i~0) .cse0 (<= (* 2 main_~i~0) main_~j~0) (<= (+ main_~j~0 1) .cse2) .cse1)))) [2018-11-23 13:10:34,442 INFO L448 ceAbstractionStarter]: For program point L23-1(lines 22 23) no Hoare annotation was computed. [2018-11-23 13:10:34,442 INFO L448 ceAbstractionStarter]: For program point L19(line 19) no Hoare annotation was computed. [2018-11-23 13:10:34,442 INFO L448 ceAbstractionStarter]: For program point L19-1(line 19) no Hoare annotation was computed. [2018-11-23 13:10:34,442 INFO L451 ceAbstractionStarter]: At program point L24(lines 11 26) the Hoare annotation is: true [2018-11-23 13:10:34,442 INFO L448 ceAbstractionStarter]: For program point L20-2(lines 20 23) no Hoare annotation was computed. [2018-11-23 13:10:34,442 INFO L444 ceAbstractionStarter]: At program point L20-3(lines 20 23) the Hoare annotation is: (or (and (<= 1 main_~i~0) (<= main_~j~0 (* 2 main_~i~0))) (<= 2 main_~i~0) (and (<= 0 main_~i~0) (<= main_~i~0 0))) [2018-11-23 13:10:34,442 INFO L448 ceAbstractionStarter]: For program point L16(line 16) no Hoare annotation was computed. [2018-11-23 13:10:34,443 INFO L448 ceAbstractionStarter]: For program point L21-2(lines 21 23) no Hoare annotation was computed. [2018-11-23 13:10:34,443 INFO L444 ceAbstractionStarter]: At program point L21-3(lines 21 23) the Hoare annotation is: (let ((.cse3 (* 2 main_~i~0))) (let ((.cse2 (* 3 main_~i~0)) (.cse0 (< main_~i~0 main_~n~0)) (.cse1 (<= .cse3 main_~j~0))) (or (and .cse0 .cse1 (<= (+ main_~j~0 1) .cse2)) (and (<= 1 main_~i~0) (<= main_~j~0 (+ main_~k~0 1)) .cse0 .cse1) (and (<= .cse2 main_~j~0) (<= 0 main_~i~0) .cse0 (<= main_~j~0 .cse3)) (and (<= 2 main_~i~0) .cse0 .cse1)))) [2018-11-23 13:10:34,443 INFO L448 ceAbstractionStarter]: For program point L17(line 17) no Hoare annotation was computed. [2018-11-23 13:10:34,443 INFO L448 ceAbstractionStarter]: For program point mainFINAL(lines 11 26) no Hoare annotation was computed. [2018-11-23 13:10:34,443 INFO L451 ceAbstractionStarter]: At program point mainENTRY(lines 11 26) the Hoare annotation is: true [2018-11-23 13:10:34,443 INFO L444 ceAbstractionStarter]: At program point L22-2(lines 22 23) the Hoare annotation is: (let ((.cse3 (* 3 main_~i~0))) (let ((.cse0 (< main_~i~0 main_~n~0)) (.cse1 (<= (* 2 main_~i~0) main_~j~0)) (.cse2 (<= (+ main_~j~0 1) .cse3))) (or (and (exists ((main_~i~0 Int)) (and (<= main_~j~0 (* 2 main_~i~0)) (<= main_~i~0 1) (<= (+ main_~i~0 1) main_~k~0))) .cse0 .cse1 .cse2) (and (exists ((main_~i~0 Int)) (and (<= main_~j~0 (* 2 main_~i~0)) (<= main_~i~0 1) (<= main_~i~0 main_~k~0))) .cse0 (exists ((main_~i~0 Int)) (and (<= 1 main_~i~0) (<= (* 2 main_~i~0) main_~j~0) (<= main_~k~0 main_~i~0))) (<= main_~i~0 1) (<= (+ main_~k~0 2) .cse3)) (and (<= 2 main_~i~0) .cse0 .cse1 .cse2)))) [2018-11-23 13:10:34,444 INFO L448 ceAbstractionStarter]: For program point L18(line 18) no Hoare annotation was computed. [2018-11-23 13:10:34,444 INFO L451 ceAbstractionStarter]: At program point __VERIFIER_assertENTRY(lines 3 8) the Hoare annotation is: true [2018-11-23 13:10:34,444 INFO L448 ceAbstractionStarter]: For program point __VERIFIER_assertEXIT(lines 3 8) no Hoare annotation was computed. [2018-11-23 13:10:34,444 INFO L448 ceAbstractionStarter]: For program point L5(line 5) no Hoare annotation was computed. [2018-11-23 13:10:34,444 INFO L448 ceAbstractionStarter]: For program point L4(lines 4 6) no Hoare annotation was computed. [2018-11-23 13:10:34,444 INFO L448 ceAbstractionStarter]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2018-11-23 13:10:34,444 INFO L448 ceAbstractionStarter]: For program point L4-2(lines 3 8) no Hoare annotation was computed. [2018-11-23 13:10:34,446 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2018-11-23 13:10:34,446 WARN L170 areAnnotationChecker]: L16 has no Hoare annotation [2018-11-23 13:10:34,446 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2018-11-23 13:10:34,446 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2018-11-23 13:10:34,447 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2018-11-23 13:10:34,447 WARN L170 areAnnotationChecker]: L16 has no Hoare annotation [2018-11-23 13:10:34,447 WARN L170 areAnnotationChecker]: L16 has no Hoare annotation [2018-11-23 13:10:34,447 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2018-11-23 13:10:34,447 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2018-11-23 13:10:34,447 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2018-11-23 13:10:34,447 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2018-11-23 13:10:34,447 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2018-11-23 13:10:34,447 WARN L170 areAnnotationChecker]: L17 has no Hoare annotation [2018-11-23 13:10:34,448 WARN L170 areAnnotationChecker]: L17 has no Hoare annotation [2018-11-23 13:10:34,448 WARN L170 areAnnotationChecker]: L5 has no Hoare annotation [2018-11-23 13:10:34,448 WARN L170 areAnnotationChecker]: L5 has no Hoare annotation [2018-11-23 13:10:34,448 WARN L170 areAnnotationChecker]: L4-2 has no Hoare annotation [2018-11-23 13:10:34,448 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2018-11-23 13:10:34,448 WARN L170 areAnnotationChecker]: L18 has no Hoare annotation [2018-11-23 13:10:34,448 WARN L170 areAnnotationChecker]: L18 has no Hoare annotation [2018-11-23 13:10:34,448 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2018-11-23 13:10:34,448 WARN L170 areAnnotationChecker]: L19 has no Hoare annotation [2018-11-23 13:10:34,449 WARN L170 areAnnotationChecker]: L19 has no Hoare annotation [2018-11-23 13:10:34,449 WARN L170 areAnnotationChecker]: L23-1 has no Hoare annotation [2018-11-23 13:10:34,449 WARN L170 areAnnotationChecker]: L19-1 has no Hoare annotation [2018-11-23 13:10:34,449 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2018-11-23 13:10:34,449 WARN L170 areAnnotationChecker]: L21-2 has no Hoare annotation [2018-11-23 13:10:34,449 WARN L170 areAnnotationChecker]: L21-2 has no Hoare annotation [2018-11-23 13:10:34,457 WARN L170 areAnnotationChecker]: L21-2 has no Hoare annotation [2018-11-23 13:10:34,457 WARN L170 areAnnotationChecker]: L23-1 has no Hoare annotation [2018-11-23 13:10:34,457 WARN L170 areAnnotationChecker]: L20-2 has no Hoare annotation [2018-11-23 13:10:34,457 WARN L170 areAnnotationChecker]: L20-2 has no Hoare annotation [2018-11-23 13:10:34,458 WARN L170 areAnnotationChecker]: L20-2 has no Hoare annotation [2018-11-23 13:10:34,459 INFO L163 areAnnotationChecker]: CFG has 8 edges. 8 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2018-11-23 13:10:34,470 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~i~0,QUANTIFIED] [2018-11-23 13:10:34,471 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~i~0,QUANTIFIED] [2018-11-23 13:10:34,471 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~i~0,QUANTIFIED] [2018-11-23 13:10:34,472 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~i~0,QUANTIFIED] [2018-11-23 13:10:34,472 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~i~0,QUANTIFIED] [2018-11-23 13:10:34,472 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~i~0,QUANTIFIED] [2018-11-23 13:10:34,472 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~i~0,QUANTIFIED] [2018-11-23 13:10:34,473 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~i~0,QUANTIFIED] [2018-11-23 13:10:34,473 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~i~0,QUANTIFIED] [2018-11-23 13:10:34,474 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~i~0,QUANTIFIED] [2018-11-23 13:10:34,474 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~i~0,QUANTIFIED] [2018-11-23 13:10:34,474 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~i~0,QUANTIFIED] [2018-11-23 13:10:34,474 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~i~0,QUANTIFIED] [2018-11-23 13:10:34,475 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~i~0,QUANTIFIED] [2018-11-23 13:10:34,475 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~i~0,QUANTIFIED] [2018-11-23 13:10:34,475 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~i~0,QUANTIFIED] [2018-11-23 13:10:34,475 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~i~0,QUANTIFIED] [2018-11-23 13:10:34,475 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~i~0,QUANTIFIED] [2018-11-23 13:10:34,478 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 01:10:34 BoogieIcfgContainer [2018-11-23 13:10:34,478 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-23 13:10:34,479 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 13:10:34,479 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 13:10:34,479 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 13:10:34,480 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:10:24" (3/4) ... [2018-11-23 13:10:34,483 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-23 13:10:34,490 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-23 13:10:34,490 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-23 13:10:34,490 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2018-11-23 13:10:34,495 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges [2018-11-23 13:10:34,495 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2018-11-23 13:10:34,495 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-11-23 13:10:34,496 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-11-23 13:10:34,522 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((\exists main_~i~0 : int :: (j <= 2 * main_~i~0 && main_~i~0 <= 1) && main_~i~0 + 1 <= k) && i < n) && 2 * i <= j) && j + 1 <= 3 * i) || (((((\exists main_~i~0 : int :: (j <= 2 * main_~i~0 && main_~i~0 <= 1) && main_~i~0 <= k) && i < n) && (\exists main_~i~0 : int :: (1 <= main_~i~0 && 2 * main_~i~0 <= j) && k <= main_~i~0)) && i <= 1) && k + 2 <= 3 * i)) || (((2 <= i && i < n) && 2 * i <= j) && j + 1 <= 3 * i) [2018-11-23 13:10:34,551 INFO L145 WitnessManager]: Wrote witness to /storage/repos/svcomp/c/loop-invgen/nested9_true-unreach-call_true-termination.i-witness.graphml [2018-11-23 13:10:34,551 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 13:10:34,556 INFO L168 Benchmark]: Toolchain (without parser) took 11598.93 ms. Allocated memory was 1.5 GB in the beginning and 2.4 GB in the end (delta: 858.8 MB). Free memory was 1.4 GB in the beginning and 2.1 GB in the end (delta: -620.0 MB). Peak memory consumption was 238.8 MB. Max. memory is 7.1 GB. [2018-11-23 13:10:34,557 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-23 13:10:34,557 INFO L168 Benchmark]: CACSL2BoogieTranslator took 344.58 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. [2018-11-23 13:10:34,559 INFO L168 Benchmark]: Boogie Procedure Inliner took 20.71 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-23 13:10:34,560 INFO L168 Benchmark]: Boogie Preprocessor took 24.20 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-23 13:10:34,560 INFO L168 Benchmark]: RCFGBuilder took 722.28 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 734.0 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -761.9 MB). Peak memory consumption was 26.5 MB. Max. memory is 7.1 GB. [2018-11-23 13:10:34,561 INFO L168 Benchmark]: TraceAbstraction took 10406.38 ms. Allocated memory was 2.3 GB in the beginning and 2.4 GB in the end (delta: 124.8 MB). Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 131.4 MB). Peak memory consumption was 256.2 MB. Max. memory is 7.1 GB. [2018-11-23 13:10:34,562 INFO L168 Benchmark]: Witness Printer took 72.92 ms. Allocated memory is still 2.4 GB. Free memory is still 2.1 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-23 13:10:34,571 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - GenericResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 344.58 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 20.71 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 24.20 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 722.28 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 734.0 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -761.9 MB). Peak memory consumption was 26.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 10406.38 ms. Allocated memory was 2.3 GB in the beginning and 2.4 GB in the end (delta: 124.8 MB). Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 131.4 MB). Peak memory consumption was 256.2 MB. Max. memory is 7.1 GB. * Witness Printer took 72.92 ms. Allocated memory is still 2.4 GB. Free memory is still 2.1 GB. There was no memory consumed. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~i~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~i~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~i~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~i~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~i~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~i~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~i~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~i~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~i~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~i~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~i~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~i~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~i~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~i~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~i~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~i~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~i~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~i~0,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 5]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 20]: Loop Invariant Derived loop invariant: ((1 <= i && j <= 2 * i) || 2 <= i) || (0 <= i && i <= 0) - InvariantResult [Line: 21]: Loop Invariant Derived loop invariant: ((((i < n && 2 * i <= j) && j + 1 <= 3 * i) || (((1 <= i && j <= k + 1) && i < n) && 2 * i <= j)) || (((3 * i <= j && 0 <= i) && i < n) && j <= 2 * i)) || ((2 <= i && i < n) && 2 * i <= j) - InvariantResult [Line: 11]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 22]: Loop Invariant [2018-11-23 13:10:34,586 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~i~0,QUANTIFIED] [2018-11-23 13:10:34,586 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~i~0,QUANTIFIED] [2018-11-23 13:10:34,586 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~i~0,QUANTIFIED] [2018-11-23 13:10:34,587 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~i~0,QUANTIFIED] [2018-11-23 13:10:34,587 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~i~0,QUANTIFIED] [2018-11-23 13:10:34,587 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~i~0,QUANTIFIED] [2018-11-23 13:10:34,587 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~i~0,QUANTIFIED] [2018-11-23 13:10:34,587 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~i~0,QUANTIFIED] [2018-11-23 13:10:34,588 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~i~0,QUANTIFIED] [2018-11-23 13:10:34,588 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~i~0,QUANTIFIED] [2018-11-23 13:10:34,588 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~i~0,QUANTIFIED] [2018-11-23 13:10:34,589 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~i~0,QUANTIFIED] [2018-11-23 13:10:34,589 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~i~0,QUANTIFIED] [2018-11-23 13:10:34,589 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~i~0,QUANTIFIED] [2018-11-23 13:10:34,589 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~i~0,QUANTIFIED] [2018-11-23 13:10:34,589 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~i~0,QUANTIFIED] [2018-11-23 13:10:34,589 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~i~0,QUANTIFIED] [2018-11-23 13:10:34,590 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~i~0,QUANTIFIED] Derived loop invariant: (((((\exists main_~i~0 : int :: (j <= 2 * main_~i~0 && main_~i~0 <= 1) && main_~i~0 + 1 <= k) && i < n) && 2 * i <= j) && j + 1 <= 3 * i) || (((((\exists main_~i~0 : int :: (j <= 2 * main_~i~0 && main_~i~0 <= 1) && main_~i~0 <= k) && i < n) && (\exists main_~i~0 : int :: (1 <= main_~i~0 && 2 * main_~i~0 <= j) && k <= main_~i~0)) && i <= 1) && k + 2 <= 3 * i)) || (((2 <= i && i < n) && 2 * i <= j) && j + 1 <= 3 * i) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 29 locations, 1 error locations. SAFE Result, 10.3s OverallTime, 5 OverallIterations, 3 TraceHistogramMax, 5.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.4s HoareAnnotationTime, HoareTripleCheckerStatistics: 104 SDtfs, 114 SDslu, 422 SDs, 0 SdLazy, 551 SolverSat, 101 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 187 GetRequests, 119 SyntacticMatches, 1 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 201 ImplicationChecksByTransitivity, 1.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=42occurred in iteration=4, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 5 MinimizatonAttempts, 16 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 10 LocationsWithAnnotation, 19 PreInvPairs, 42 NumberOfFragments, 247 HoareAnnotationTreeSize, 19 FomulaSimplifications, 869 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 10 FomulaSimplificationsInter, 120 FormulaSimplificationTreeSizeReductionInter, 0.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 2.7s InterpolantComputationTime, 266 NumberOfCodeBlocks, 243 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 257 ConstructedInterpolants, 5 QuantifiedInterpolants, 18879 SizeOfPredicates, 11 NumberOfNonLiveVariables, 258 ConjunctsInSsa, 30 ConjunctsInUnsatCore, 9 InterpolantComputations, 3 PerfectInterpolantSequences, 80/104 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...