java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -s ../../../trunk/examples/settings/ai/array-bench/reach_32bit_array_compound_exp_cong.epf -i ../../../trunk/examples/programs/toy/nonlinear/Mult1-Safe.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-c78c21b [2018-12-03 17:02:14,684 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-03 17:02:14,686 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-03 17:02:14,703 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-03 17:02:14,703 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-03 17:02:14,705 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-03 17:02:14,706 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-03 17:02:14,709 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-03 17:02:14,712 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-03 17:02:14,721 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-03 17:02:14,722 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-03 17:02:14,722 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-03 17:02:14,723 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-03 17:02:14,724 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-03 17:02:14,727 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-03 17:02:14,728 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-03 17:02:14,729 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-03 17:02:14,731 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-03 17:02:14,733 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-03 17:02:14,734 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-03 17:02:14,735 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-03 17:02:14,736 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-03 17:02:14,741 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-03 17:02:14,742 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-03 17:02:14,742 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-03 17:02:14,744 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-03 17:02:14,745 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-03 17:02:14,748 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-03 17:02:14,749 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-03 17:02:14,750 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-03 17:02:14,750 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-03 17:02:14,751 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-03 17:02:14,751 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-03 17:02:14,751 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-03 17:02:14,753 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-03 17:02:14,753 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-03 17:02:14,754 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/array-bench/reach_32bit_array_compound_exp_cong.epf [2018-12-03 17:02:14,777 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-03 17:02:14,777 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-03 17:02:14,778 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2018-12-03 17:02:14,778 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2018-12-03 17:02:14,778 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-03 17:02:14,778 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-03 17:02:14,779 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-03 17:02:14,779 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-03 17:02:14,779 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-03 17:02:14,779 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-03 17:02:14,779 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-03 17:02:14,780 INFO L133 SettingsManager]: * Abstract domain=ArrayDomain [2018-12-03 17:02:14,780 INFO L133 SettingsManager]: * Log string format=TERM [2018-12-03 17:02:14,780 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-03 17:02:14,780 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-03 17:02:14,781 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-03 17:02:14,781 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-03 17:02:14,781 INFO L133 SettingsManager]: * Use SBE=true [2018-12-03 17:02:14,781 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-03 17:02:14,782 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-03 17:02:14,782 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-03 17:02:14,782 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-03 17:02:14,782 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-03 17:02:14,782 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-03 17:02:14,783 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-03 17:02:14,783 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-03 17:02:14,783 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-03 17:02:14,783 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-03 17:02:14,783 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-03 17:02:14,784 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-03 17:02:14,784 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-03 17:02:14,784 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-03 17:02:14,784 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-03 17:02:14,784 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-03 17:02:14,784 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-03 17:02:14,785 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-03 17:02:14,785 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-03 17:02:14,785 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-03 17:02:14,785 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-03 17:02:14,785 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-03 17:02:14,786 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-12-03 17:02:14,821 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-03 17:02:14,834 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-03 17:02:14,843 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-03 17:02:14,845 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-12-03 17:02:14,845 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-12-03 17:02:14,846 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/nonlinear/Mult1-Safe.bpl [2018-12-03 17:02:14,846 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/nonlinear/Mult1-Safe.bpl' [2018-12-03 17:02:14,885 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-03 17:02:14,888 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-12-03 17:02:14,888 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-03 17:02:14,889 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-03 17:02:14,889 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-03 17:02:14,908 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "Mult1-Safe.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 05:02:14" (1/1) ... [2018-12-03 17:02:14,918 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "Mult1-Safe.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 05:02:14" (1/1) ... [2018-12-03 17:02:14,926 WARN L165 Inliner]: Program contained no entry procedure! [2018-12-03 17:02:14,926 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2018-12-03 17:02:14,926 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2018-12-03 17:02:14,930 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-03 17:02:14,931 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-03 17:02:14,931 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-03 17:02:14,931 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-03 17:02:14,944 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "Mult1-Safe.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 05:02:14" (1/1) ... [2018-12-03 17:02:14,944 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "Mult1-Safe.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 05:02:14" (1/1) ... [2018-12-03 17:02:14,945 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "Mult1-Safe.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 05:02:14" (1/1) ... [2018-12-03 17:02:14,945 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "Mult1-Safe.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 05:02:14" (1/1) ... [2018-12-03 17:02:14,949 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "Mult1-Safe.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 05:02:14" (1/1) ... [2018-12-03 17:02:14,955 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "Mult1-Safe.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 05:02:14" (1/1) ... [2018-12-03 17:02:14,956 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "Mult1-Safe.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 05:02:14" (1/1) ... [2018-12-03 17:02:14,957 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-03 17:02:14,958 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-03 17:02:14,958 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-03 17:02:14,958 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-03 17:02:14,959 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "Mult1-Safe.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 05:02:14" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-03 17:02:15,034 INFO L124 BoogieDeclarations]: Specification and implementation of procedure mult given in one single declaration [2018-12-03 17:02:15,035 INFO L130 BoogieDeclarations]: Found specification of procedure mult [2018-12-03 17:02:15,035 INFO L138 BoogieDeclarations]: Found implementation of procedure mult [2018-12-03 17:02:15,105 WARN L615 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-12-03 17:02:15,219 INFO L272 CfgBuilder]: Using library mode [2018-12-03 17:02:15,220 INFO L280 CfgBuilder]: Removed 0 assue(true) statements. [2018-12-03 17:02:15,220 INFO L202 PluginConnector]: Adding new model Mult1-Safe.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 05:02:15 BoogieIcfgContainer [2018-12-03 17:02:15,221 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-03 17:02:15,222 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-03 17:02:15,222 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-03 17:02:15,225 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-03 17:02:15,226 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "Mult1-Safe.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 05:02:14" (1/2) ... [2018-12-03 17:02:15,227 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3cdb7877 and model type Mult1-Safe.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.12 05:02:15, skipping insertion in model container [2018-12-03 17:02:15,227 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "Mult1-Safe.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 05:02:15" (2/2) ... [2018-12-03 17:02:15,229 INFO L112 eAbstractionObserver]: Analyzing ICFG Mult1-Safe.bpl [2018-12-03 17:02:15,240 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-03 17:02:15,248 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-03 17:02:15,267 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-03 17:02:15,302 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-03 17:02:15,303 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-03 17:02:15,303 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-03 17:02:15,303 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-03 17:02:15,303 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-03 17:02:15,303 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-03 17:02:15,304 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-03 17:02:15,304 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-03 17:02:15,319 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states. [2018-12-03 17:02:15,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-12-03 17:02:15,326 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:02:15,327 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-12-03 17:02:15,332 INFO L423 AbstractCegarLoop]: === Iteration 1 === [multErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2018-12-03 17:02:15,341 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:02:15,342 INFO L82 PathProgramCache]: Analyzing trace with hash 924708, now seen corresponding path program 1 times [2018-12-03 17:02:15,345 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:02:15,405 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:02:15,405 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:02:15,405 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:02:15,405 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:02:15,447 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-12-03 17:02:15,448 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-12-03 17:02:15,448 INFO L169 anRefinementStrategy]: Switched to traceCheck mode Z3_NO_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-12-03 17:02:15,461 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:02:15,461 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_NO_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: null) [2018-12-03 17:02:15,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:02:15,488 INFO L193 CegarAbsIntRunner]: Skipping current iteration for AI because the path program does not contain any loops [2018-12-03 17:02:15,489 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:02:15,490 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:02:15,490 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG 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-12-03 17:02:15,500 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:02:15,500 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:02:15,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:02:15,518 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:02:15,786 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:02:15,786 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:02:15,902 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:02:15,922 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-12-03 17:02:15,922 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2018-12-03 17:02:15,922 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:02:15,927 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-03 17:02:15,939 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-03 17:02:15,940 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-12-03 17:02:15,942 INFO L87 Difference]: Start difference. First operand 6 states. Second operand 5 states. [2018-12-03 17:02:16,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:02:16,073 INFO L93 Difference]: Finished difference Result 10 states and 10 transitions. [2018-12-03 17:02:16,073 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-03 17:02:16,074 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 4 [2018-12-03 17:02:16,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:02:16,085 INFO L225 Difference]: With dead ends: 10 [2018-12-03 17:02:16,085 INFO L226 Difference]: Without dead ends: 6 [2018-12-03 17:02:16,089 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2018-12-03 17:02:16,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6 states. [2018-12-03 17:02:16,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6 to 6. [2018-12-03 17:02:16,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-12-03 17:02:16,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 6 transitions. [2018-12-03 17:02:16,124 INFO L78 Accepts]: Start accepts. Automaton has 6 states and 6 transitions. Word has length 4 [2018-12-03 17:02:16,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:02:16,124 INFO L480 AbstractCegarLoop]: Abstraction has 6 states and 6 transitions. [2018-12-03 17:02:16,125 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-03 17:02:16,125 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 6 transitions. [2018-12-03 17:02:16,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-12-03 17:02:16,125 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:02:16,126 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2018-12-03 17:02:16,126 INFO L423 AbstractCegarLoop]: === Iteration 2 === [multErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2018-12-03 17:02:16,126 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:02:16,127 INFO L82 PathProgramCache]: Analyzing trace with hash 28663973, now seen corresponding path program 1 times [2018-12-03 17:02:16,127 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:02:16,128 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:02:16,128 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:02:16,128 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:02:16,129 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:02:16,133 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-12-03 17:02:16,133 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-12-03 17:02:16,134 INFO L169 anRefinementStrategy]: Switched to traceCheck mode Z3_NO_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2018-12-03 17:02:16,153 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:02:16,153 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_NO_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-12-03 17:02:16,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:02:16,197 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2018-12-03 17:02:16,200 INFO L205 CegarAbsIntRunner]: [0], [1], [5], [7], [9] [2018-12-03 17:02:16,257 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 17:02:16,258 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 17:02:16,400 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 17:02:16,401 INFO L272 AbstractInterpreter]: Visited 5 different actions 8 times. Merged at 3 different actions 3 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2018-12-03 17:02:16,448 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:02:16,448 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 17:02:16,449 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:02:16,449 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG 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-12-03 17:02:16,464 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:02:16,464 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:02:16,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:02:16,485 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:02:16,626 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:02:16,627 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:02:16,995 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:02:17,014 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-03 17:02:17,014 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 7 [2018-12-03 17:02:17,015 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:02:17,015 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-03 17:02:17,016 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-03 17:02:17,016 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2018-12-03 17:02:17,016 INFO L87 Difference]: Start difference. First operand 6 states and 6 transitions. Second operand 8 states. [2018-12-03 17:02:17,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:02:17,116 INFO L93 Difference]: Finished difference Result 9 states and 9 transitions. [2018-12-03 17:02:17,117 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-03 17:02:17,117 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2018-12-03 17:02:17,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:02:17,119 INFO L225 Difference]: With dead ends: 9 [2018-12-03 17:02:17,119 INFO L226 Difference]: Without dead ends: 7 [2018-12-03 17:02:17,120 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2018-12-03 17:02:17,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2018-12-03 17:02:17,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-12-03 17:02:17,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-12-03 17:02:17,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2018-12-03 17:02:17,124 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 7 transitions. Word has length 5 [2018-12-03 17:02:17,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:02:17,124 INFO L480 AbstractCegarLoop]: Abstraction has 7 states and 7 transitions. [2018-12-03 17:02:17,124 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-03 17:02:17,125 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2018-12-03 17:02:17,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-12-03 17:02:17,125 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:02:17,126 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1] [2018-12-03 17:02:17,126 INFO L423 AbstractCegarLoop]: === Iteration 3 === [multErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2018-12-03 17:02:17,126 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:02:17,126 INFO L82 PathProgramCache]: Analyzing trace with hash 888581188, now seen corresponding path program 2 times [2018-12-03 17:02:17,127 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:02:17,128 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:02:17,128 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:02:17,128 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:02:17,128 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:02:17,133 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-12-03 17:02:17,134 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-12-03 17:02:17,134 INFO L169 anRefinementStrategy]: Switched to traceCheck mode Z3_NO_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-12-03 17:02:17,151 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:02:17,152 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_NO_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: null) [2018-12-03 17:02:17,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:02:17,195 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:02:17,195 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:02:17,195 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:02:17,195 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:02:17,204 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:02:17,204 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:02:17,215 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-12-03 17:02:17,215 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:02:17,217 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:02:17,420 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:02:17,421 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:02:17,581 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:02:17,599 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-03 17:02:17,600 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 9 [2018-12-03 17:02:17,600 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:02:17,600 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-03 17:02:17,600 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-03 17:02:17,601 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2018-12-03 17:02:17,601 INFO L87 Difference]: Start difference. First operand 7 states and 7 transitions. Second operand 10 states. [2018-12-03 17:02:17,834 WARN L180 SmtUtils]: Spent 124.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2018-12-03 17:02:18,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:02:18,346 INFO L93 Difference]: Finished difference Result 12 states and 13 transitions. [2018-12-03 17:02:18,346 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-03 17:02:18,346 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2018-12-03 17:02:18,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:02:18,347 INFO L225 Difference]: With dead ends: 12 [2018-12-03 17:02:18,347 INFO L226 Difference]: Without dead ends: 9 [2018-12-03 17:02:18,348 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2018-12-03 17:02:18,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2018-12-03 17:02:18,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2018-12-03 17:02:18,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-12-03 17:02:18,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2018-12-03 17:02:18,353 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 6 [2018-12-03 17:02:18,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:02:18,353 INFO L480 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2018-12-03 17:02:18,353 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-03 17:02:18,354 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2018-12-03 17:02:18,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-12-03 17:02:18,354 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:02:18,354 INFO L402 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1] [2018-12-03 17:02:18,355 INFO L423 AbstractCegarLoop]: === Iteration 4 === [multErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2018-12-03 17:02:18,355 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:02:18,355 INFO L82 PathProgramCache]: Analyzing trace with hash -772033436, now seen corresponding path program 3 times [2018-12-03 17:02:18,355 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:02:18,356 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:02:18,356 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:02:18,357 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:02:18,357 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:02:18,365 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-12-03 17:02:18,365 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-12-03 17:02:18,365 INFO L169 anRefinementStrategy]: Switched to traceCheck mode Z3_NO_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-12-03 17:02:18,375 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:02:18,375 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_NO_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: null) [2018-12-03 17:02:18,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:02:18,401 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:02:18,402 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:02:18,402 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:02:18,402 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:02:18,412 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:02:18,412 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:02:18,422 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:02:18,423 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:02:18,425 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:02:18,519 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:02:18,519 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:02:18,706 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:02:18,725 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-03 17:02:18,725 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 13 [2018-12-03 17:02:18,726 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:02:18,726 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-12-03 17:02:18,726 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-12-03 17:02:18,727 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2018-12-03 17:02:18,727 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand 14 states. [2018-12-03 17:02:19,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:02:19,357 INFO L93 Difference]: Finished difference Result 16 states and 19 transitions. [2018-12-03 17:02:19,357 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-03 17:02:19,358 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 8 [2018-12-03 17:02:19,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:02:19,359 INFO L225 Difference]: With dead ends: 16 [2018-12-03 17:02:19,359 INFO L226 Difference]: Without dead ends: 13 [2018-12-03 17:02:19,360 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=121, Invalid=385, Unknown=0, NotChecked=0, Total=506 [2018-12-03 17:02:19,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2018-12-03 17:02:19,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-12-03 17:02:19,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-12-03 17:02:19,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2018-12-03 17:02:19,366 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 8 [2018-12-03 17:02:19,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:02:19,367 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2018-12-03 17:02:19,367 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-12-03 17:02:19,367 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2018-12-03 17:02:19,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-03 17:02:19,367 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:02:19,368 INFO L402 BasicCegarLoop]: trace histogram [8, 1, 1, 1, 1] [2018-12-03 17:02:19,368 INFO L423 AbstractCegarLoop]: === Iteration 5 === [multErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2018-12-03 17:02:19,368 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:02:19,368 INFO L82 PathProgramCache]: Analyzing trace with hash 1189293220, now seen corresponding path program 4 times [2018-12-03 17:02:19,369 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:02:19,370 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:02:19,370 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:02:19,370 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:02:19,370 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:02:19,380 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-12-03 17:02:19,381 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-12-03 17:02:19,381 INFO L169 anRefinementStrategy]: Switched to traceCheck mode Z3_NO_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-12-03 17:02:19,399 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:02:19,400 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_NO_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: null) [2018-12-03 17:02:19,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:02:19,430 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:02:19,430 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:02:19,430 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:02:19,430 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:02:19,440 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:02:19,440 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:02:19,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:02:19,462 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:02:19,628 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:02:19,628 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:02:20,076 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:02:20,095 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-03 17:02:20,095 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 21 [2018-12-03 17:02:20,096 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:02:20,096 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-12-03 17:02:20,096 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-12-03 17:02:20,097 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=360, Unknown=0, NotChecked=0, Total=462 [2018-12-03 17:02:20,097 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand 22 states. [2018-12-03 17:02:21,107 WARN L180 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 64 [2018-12-03 17:02:21,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:02:21,633 INFO L93 Difference]: Finished difference Result 24 states and 31 transitions. [2018-12-03 17:02:21,634 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-12-03 17:02:21,634 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 12 [2018-12-03 17:02:21,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:02:21,635 INFO L225 Difference]: With dead ends: 24 [2018-12-03 17:02:21,635 INFO L226 Difference]: Without dead ends: 21 [2018-12-03 17:02:21,637 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 166 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=345, Invalid=1137, Unknown=0, NotChecked=0, Total=1482 [2018-12-03 17:02:21,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2018-12-03 17:02:21,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2018-12-03 17:02:21,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-12-03 17:02:21,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2018-12-03 17:02:21,648 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 12 [2018-12-03 17:02:21,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:02:21,648 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2018-12-03 17:02:21,648 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-12-03 17:02:21,648 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2018-12-03 17:02:21,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-12-03 17:02:21,649 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:02:21,649 INFO L402 BasicCegarLoop]: trace histogram [16, 1, 1, 1, 1] [2018-12-03 17:02:21,649 INFO L423 AbstractCegarLoop]: === Iteration 6 === [multErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2018-12-03 17:02:21,650 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:02:21,650 INFO L82 PathProgramCache]: Analyzing trace with hash 1373617444, now seen corresponding path program 5 times [2018-12-03 17:02:21,650 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:02:21,651 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:02:21,651 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:02:21,651 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:02:21,651 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:02:21,669 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-12-03 17:02:21,669 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-12-03 17:02:21,669 INFO L169 anRefinementStrategy]: Switched to traceCheck mode Z3_NO_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-12-03 17:02:21,686 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:02:21,687 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_NO_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: null) [2018-12-03 17:02:21,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:02:21,755 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:02:21,755 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:02:21,755 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:02:21,755 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:02:21,764 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:02:21,765 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:02:21,894 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2018-12-03 17:02:21,894 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:02:21,897 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:02:22,548 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:02:22,548 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:02:23,471 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:02:23,491 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-03 17:02:23,492 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 37 [2018-12-03 17:02:23,492 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:02:23,492 INFO L459 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-12-03 17:02:23,493 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-12-03 17:02:23,493 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=318, Invalid=1088, Unknown=0, NotChecked=0, Total=1406 [2018-12-03 17:02:23,494 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand 38 states. [2018-12-03 17:02:23,860 WARN L180 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2018-12-03 17:02:25,412 WARN L180 SmtUtils]: Spent 254.00 ms on a formula simplification that was a NOOP. DAG size: 117 [2018-12-03 17:02:25,727 WARN L180 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 107 [2018-12-03 17:02:26,007 WARN L180 SmtUtils]: Spent 186.00 ms on a formula simplification that was a NOOP. DAG size: 124 [2018-12-03 17:02:26,239 WARN L180 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 100 [2018-12-03 17:02:26,496 WARN L180 SmtUtils]: Spent 151.00 ms on a formula simplification that was a NOOP. DAG size: 120 [2018-12-03 17:02:26,689 WARN L180 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 93 [2018-12-03 17:02:28,496 WARN L180 SmtUtils]: Spent 135.00 ms on a formula simplification that was a NOOP. DAG size: 119 [2018-12-03 17:02:28,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:02:28,541 INFO L93 Difference]: Finished difference Result 40 states and 55 transitions. [2018-12-03 17:02:28,542 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-12-03 17:02:28,542 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 20 [2018-12-03 17:02:28,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:02:28,544 INFO L225 Difference]: With dead ends: 40 [2018-12-03 17:02:28,544 INFO L226 Difference]: Without dead ends: 37 [2018-12-03 17:02:28,547 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 598 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=1177, Invalid=3793, Unknown=0, NotChecked=0, Total=4970 [2018-12-03 17:02:28,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-12-03 17:02:28,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2018-12-03 17:02:28,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-12-03 17:02:28,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 37 transitions. [2018-12-03 17:02:28,571 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 37 transitions. Word has length 20 [2018-12-03 17:02:28,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:02:28,572 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 37 transitions. [2018-12-03 17:02:28,572 INFO L481 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-12-03 17:02:28,572 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2018-12-03 17:02:28,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-12-03 17:02:28,573 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:02:28,573 INFO L402 BasicCegarLoop]: trace histogram [32, 1, 1, 1, 1] [2018-12-03 17:02:28,573 INFO L423 AbstractCegarLoop]: === Iteration 7 === [multErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2018-12-03 17:02:28,574 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:02:28,574 INFO L82 PathProgramCache]: Analyzing trace with hash -1236312540, now seen corresponding path program 6 times [2018-12-03 17:02:28,574 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:02:28,575 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:02:28,575 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:02:28,575 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:02:28,575 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:02:28,606 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-12-03 17:02:28,607 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-12-03 17:02:28,607 INFO L169 anRefinementStrategy]: Switched to traceCheck mode Z3_NO_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-12-03 17:02:28,639 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:02:28,639 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_NO_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: null) [2018-12-03 17:02:29,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:02:29,128 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:02:29,129 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:02:29,129 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:02:29,129 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:02:29,137 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:02:29,137 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:02:29,656 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:02:29,656 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:02:29,664 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:02:30,971 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:02:30,971 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:02:34,572 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:02:34,609 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-03 17:02:34,609 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35] total 69 [2018-12-03 17:02:34,609 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:02:34,610 INFO L459 AbstractCegarLoop]: Interpolant automaton has 70 states [2018-12-03 17:02:34,611 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2018-12-03 17:02:34,615 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1134, Invalid=3696, Unknown=0, NotChecked=0, Total=4830 [2018-12-03 17:02:34,615 INFO L87 Difference]: Start difference. First operand 37 states and 37 transitions. Second operand 70 states. [2018-12-03 17:02:38,084 WARN L180 SmtUtils]: Spent 724.00 ms on a formula simplification that was a NOOP. DAG size: 229 [2018-12-03 17:02:38,878 WARN L180 SmtUtils]: Spent 322.00 ms on a formula simplification that was a NOOP. DAG size: 219 [2018-12-03 17:02:39,476 WARN L180 SmtUtils]: Spent 419.00 ms on a formula simplification that was a NOOP. DAG size: 244 [2018-12-03 17:02:40,179 WARN L180 SmtUtils]: Spent 296.00 ms on a formula simplification that was a NOOP. DAG size: 212 [2018-12-03 17:02:40,815 WARN L180 SmtUtils]: Spent 414.00 ms on a formula simplification that was a NOOP. DAG size: 239 [2018-12-03 17:02:41,662 WARN L180 SmtUtils]: Spent 458.00 ms on a formula simplification that was a NOOP. DAG size: 205 [2018-12-03 17:02:42,663 WARN L180 SmtUtils]: Spent 294.00 ms on a formula simplification that was a NOOP. DAG size: 198 [2018-12-03 17:02:43,309 WARN L180 SmtUtils]: Spent 259.00 ms on a formula simplification that was a NOOP. DAG size: 191 [2018-12-03 17:02:43,917 WARN L180 SmtUtils]: Spent 241.00 ms on a formula simplification that was a NOOP. DAG size: 184 [2018-12-03 17:02:44,514 WARN L180 SmtUtils]: Spent 238.00 ms on a formula simplification that was a NOOP. DAG size: 177 [2018-12-03 17:02:45,118 WARN L180 SmtUtils]: Spent 231.00 ms on a formula simplification that was a NOOP. DAG size: 170 [2018-12-03 17:02:45,719 WARN L180 SmtUtils]: Spent 247.00 ms on a formula simplification that was a NOOP. DAG size: 163 [2018-12-03 17:02:46,249 WARN L180 SmtUtils]: Spent 199.00 ms on a formula simplification that was a NOOP. DAG size: 156 [2018-12-03 17:02:46,783 WARN L180 SmtUtils]: Spent 219.00 ms on a formula simplification that was a NOOP. DAG size: 149 [2018-12-03 17:02:47,401 WARN L180 SmtUtils]: Spent 171.00 ms on a formula simplification that was a NOOP. DAG size: 142 [2018-12-03 17:02:47,859 WARN L180 SmtUtils]: Spent 158.00 ms on a formula simplification that was a NOOP. DAG size: 135 [2018-12-03 17:02:48,299 WARN L180 SmtUtils]: Spent 153.00 ms on a formula simplification that was a NOOP. DAG size: 128 [2018-12-03 17:02:48,713 WARN L180 SmtUtils]: Spent 140.00 ms on a formula simplification that was a NOOP. DAG size: 121 [2018-12-03 17:02:49,420 WARN L180 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2018-12-03 17:02:49,779 WARN L180 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 107 [2018-12-03 17:02:50,154 WARN L180 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 100 [2018-12-03 17:02:53,654 WARN L180 SmtUtils]: Spent 377.00 ms on a formula simplification that was a NOOP. DAG size: 238 [2018-12-03 17:02:53,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:02:53,697 INFO L93 Difference]: Finished difference Result 72 states and 103 transitions. [2018-12-03 17:02:53,697 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2018-12-03 17:02:53,698 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 36 [2018-12-03 17:02:53,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:02:53,700 INFO L225 Difference]: With dead ends: 72 [2018-12-03 17:02:53,700 INFO L226 Difference]: Without dead ends: 69 [2018-12-03 17:02:53,705 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 133 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2230 ImplicationChecksByTransitivity, 21.4s TimeCoverageRelationStatistics Valid=4377, Invalid=13713, Unknown=0, NotChecked=0, Total=18090 [2018-12-03 17:02:53,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-12-03 17:02:53,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2018-12-03 17:02:53,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-12-03 17:02:53,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 69 transitions. [2018-12-03 17:02:53,760 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 69 transitions. Word has length 36 [2018-12-03 17:02:53,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:02:53,760 INFO L480 AbstractCegarLoop]: Abstraction has 69 states and 69 transitions. [2018-12-03 17:02:53,760 INFO L481 AbstractCegarLoop]: Interpolant automaton has 70 states. [2018-12-03 17:02:53,760 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 69 transitions. [2018-12-03 17:02:53,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-12-03 17:02:53,762 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:02:53,763 INFO L402 BasicCegarLoop]: trace histogram [64, 1, 1, 1, 1] [2018-12-03 17:02:53,763 INFO L423 AbstractCegarLoop]: === Iteration 8 === [multErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2018-12-03 17:02:53,763 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:02:53,763 INFO L82 PathProgramCache]: Analyzing trace with hash -955736028, now seen corresponding path program 7 times [2018-12-03 17:02:53,763 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:02:53,764 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:02:53,764 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:02:53,765 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:02:53,765 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:02:53,817 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-12-03 17:02:53,817 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-12-03 17:02:53,817 INFO L169 anRefinementStrategy]: Switched to traceCheck mode Z3_NO_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-12-03 17:02:53,827 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:02:53,827 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_NO_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: null) [2018-12-03 17:02:54,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:02:54,128 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:02:54,129 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:02:54,129 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:02:54,129 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:02:54,138 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:02:54,138 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:02:59,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:02:59,697 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:03:02,502 INFO L134 CoverageAnalysis]: Checked inductivity of 2080 backedges. 0 proven. 2080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:03:02,502 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:03:11,865 INFO L134 CoverageAnalysis]: Checked inductivity of 2080 backedges. 0 proven. 2080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:03:11,884 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-03 17:03:11,884 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67, 67] total 133 [2018-12-03 17:03:11,884 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:03:11,885 INFO L459 AbstractCegarLoop]: Interpolant automaton has 134 states [2018-12-03 17:03:11,886 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 134 interpolants. [2018-12-03 17:03:11,891 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4302, Invalid=13520, Unknown=0, NotChecked=0, Total=17822 [2018-12-03 17:03:11,891 INFO L87 Difference]: Start difference. First operand 69 states and 69 transitions. Second operand 134 states. [2018-12-03 17:03:22,148 WARN L180 SmtUtils]: Spent 2.57 s on a formula simplification that was a NOOP. DAG size: 453 [2018-12-03 17:03:25,463 WARN L180 SmtUtils]: Spent 848.00 ms on a formula simplification that was a NOOP. DAG size: 443 [2018-12-03 17:03:27,217 WARN L180 SmtUtils]: Spent 1.27 s on a formula simplification that was a NOOP. DAG size: 460 [2018-12-03 17:03:30,488 WARN L180 SmtUtils]: Spent 908.00 ms on a formula simplification that was a NOOP. DAG size: 436 [2018-12-03 17:03:32,070 WARN L180 SmtUtils]: Spent 1.16 s on a formula simplification that was a NOOP. DAG size: 456 [2018-12-03 17:03:35,154 WARN L180 SmtUtils]: Spent 853.00 ms on a formula simplification that was a NOOP. DAG size: 429 [2018-12-03 17:03:38,306 WARN L180 SmtUtils]: Spent 880.00 ms on a formula simplification that was a NOOP. DAG size: 422 [2018-12-03 17:03:41,306 WARN L180 SmtUtils]: Spent 839.00 ms on a formula simplification that was a NOOP. DAG size: 415 [2018-12-03 17:03:44,249 WARN L180 SmtUtils]: Spent 813.00 ms on a formula simplification that was a NOOP. DAG size: 408 [2018-12-03 17:03:47,155 WARN L180 SmtUtils]: Spent 766.00 ms on a formula simplification that was a NOOP. DAG size: 401 [2018-12-03 17:03:49,967 WARN L180 SmtUtils]: Spent 786.00 ms on a formula simplification that was a NOOP. DAG size: 394 [2018-12-03 17:03:52,693 WARN L180 SmtUtils]: Spent 746.00 ms on a formula simplification that was a NOOP. DAG size: 387 [2018-12-03 17:03:55,317 WARN L180 SmtUtils]: Spent 665.00 ms on a formula simplification that was a NOOP. DAG size: 380 [2018-12-03 17:03:57,871 WARN L180 SmtUtils]: Spent 659.00 ms on a formula simplification that was a NOOP. DAG size: 373 [2018-12-03 17:04:00,466 WARN L180 SmtUtils]: Spent 700.00 ms on a formula simplification that was a NOOP. DAG size: 366 [2018-12-03 17:04:02,909 WARN L180 SmtUtils]: Spent 615.00 ms on a formula simplification that was a NOOP. DAG size: 359 [2018-12-03 17:04:05,341 WARN L180 SmtUtils]: Spent 632.00 ms on a formula simplification that was a NOOP. DAG size: 352 [2018-12-03 17:04:07,711 WARN L180 SmtUtils]: Spent 601.00 ms on a formula simplification that was a NOOP. DAG size: 345 [2018-12-03 17:04:10,019 WARN L180 SmtUtils]: Spent 605.00 ms on a formula simplification that was a NOOP. DAG size: 338 [2018-12-03 17:04:12,233 WARN L180 SmtUtils]: Spent 578.00 ms on a formula simplification that was a NOOP. DAG size: 331 [2018-12-03 17:04:14,529 WARN L180 SmtUtils]: Spent 573.00 ms on a formula simplification that was a NOOP. DAG size: 324 [2018-12-03 17:04:16,626 WARN L180 SmtUtils]: Spent 501.00 ms on a formula simplification that was a NOOP. DAG size: 317 [2018-12-03 17:04:18,771 WARN L180 SmtUtils]: Spent 597.00 ms on a formula simplification that was a NOOP. DAG size: 310 [2018-12-03 17:04:20,820 WARN L180 SmtUtils]: Spent 500.00 ms on a formula simplification that was a NOOP. DAG size: 303 [2018-12-03 17:04:22,770 WARN L180 SmtUtils]: Spent 497.00 ms on a formula simplification that was a NOOP. DAG size: 296 [2018-12-03 17:04:24,637 WARN L180 SmtUtils]: Spent 450.00 ms on a formula simplification that was a NOOP. DAG size: 289 [2018-12-03 17:04:26,478 WARN L180 SmtUtils]: Spent 459.00 ms on a formula simplification that was a NOOP. DAG size: 282 [2018-12-03 17:04:28,294 WARN L180 SmtUtils]: Spent 449.00 ms on a formula simplification that was a NOOP. DAG size: 275 [2018-12-03 17:04:30,043 WARN L180 SmtUtils]: Spent 437.00 ms on a formula simplification that was a NOOP. DAG size: 268 [2018-12-03 17:04:31,684 WARN L180 SmtUtils]: Spent 401.00 ms on a formula simplification that was a NOOP. DAG size: 261 [2018-12-03 17:04:33,305 WARN L180 SmtUtils]: Spent 389.00 ms on a formula simplification that was a NOOP. DAG size: 254 [2018-12-03 17:04:34,863 WARN L180 SmtUtils]: Spent 350.00 ms on a formula simplification that was a NOOP. DAG size: 247 [2018-12-03 17:04:36,394 WARN L180 SmtUtils]: Spent 362.00 ms on a formula simplification that was a NOOP. DAG size: 240 [2018-12-03 17:04:37,863 WARN L180 SmtUtils]: Spent 341.00 ms on a formula simplification that was a NOOP. DAG size: 233 [2018-12-03 17:04:39,274 WARN L180 SmtUtils]: Spent 354.00 ms on a formula simplification that was a NOOP. DAG size: 226 [2018-12-03 17:04:40,655 WARN L180 SmtUtils]: Spent 318.00 ms on a formula simplification that was a NOOP. DAG size: 219 [2018-12-03 17:04:41,962 WARN L180 SmtUtils]: Spent 311.00 ms on a formula simplification that was a NOOP. DAG size: 212 [2018-12-03 17:04:43,228 WARN L180 SmtUtils]: Spent 279.00 ms on a formula simplification that was a NOOP. DAG size: 205 [2018-12-03 17:04:44,444 WARN L180 SmtUtils]: Spent 274.00 ms on a formula simplification that was a NOOP. DAG size: 198 [2018-12-03 17:04:45,604 WARN L180 SmtUtils]: Spent 252.00 ms on a formula simplification that was a NOOP. DAG size: 191 [2018-12-03 17:04:46,736 WARN L180 SmtUtils]: Spent 235.00 ms on a formula simplification that was a NOOP. DAG size: 184 [2018-12-03 17:04:47,841 WARN L180 SmtUtils]: Spent 240.00 ms on a formula simplification that was a NOOP. DAG size: 177 [2018-12-03 17:04:48,907 WARN L180 SmtUtils]: Spent 215.00 ms on a formula simplification that was a NOOP. DAG size: 170 [2018-12-03 17:04:49,930 WARN L180 SmtUtils]: Spent 204.00 ms on a formula simplification that was a NOOP. DAG size: 163 [2018-12-03 17:04:50,911 WARN L180 SmtUtils]: Spent 199.00 ms on a formula simplification that was a NOOP. DAG size: 156 [2018-12-03 17:04:51,844 WARN L180 SmtUtils]: Spent 180.00 ms on a formula simplification that was a NOOP. DAG size: 149 [2018-12-03 17:04:52,722 WARN L180 SmtUtils]: Spent 169.00 ms on a formula simplification that was a NOOP. DAG size: 142 [2018-12-03 17:04:53,593 WARN L180 SmtUtils]: Spent 164.00 ms on a formula simplification that was a NOOP. DAG size: 135 [2018-12-03 17:04:54,439 WARN L180 SmtUtils]: Spent 170.00 ms on a formula simplification that was a NOOP. DAG size: 128 [2018-12-03 17:04:55,324 WARN L180 SmtUtils]: Spent 140.00 ms on a formula simplification that was a NOOP. DAG size: 121 [2018-12-03 17:04:56,077 WARN L180 SmtUtils]: Spent 129.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2018-12-03 17:04:56,798 WARN L180 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 107 [2018-12-03 17:04:57,468 WARN L180 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 100 [2018-12-03 17:05:04,707 WARN L180 SmtUtils]: Spent 955.00 ms on a formula simplification that was a NOOP. DAG size: 455 [2018-12-03 17:05:04,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:05:04,816 INFO L93 Difference]: Finished difference Result 136 states and 199 transitions. [2018-12-03 17:05:04,816 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 133 states. [2018-12-03 17:05:04,816 INFO L78 Accepts]: Start accepts. Automaton has 134 states. Word has length 68 [2018-12-03 17:05:04,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:05:04,820 INFO L225 Difference]: With dead ends: 136 [2018-12-03 17:05:04,820 INFO L226 Difference]: Without dead ends: 133 [2018-12-03 17:05:04,826 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 263 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 261 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8566 ImplicationChecksByTransitivity, 118.9s TimeCoverageRelationStatistics Valid=16921, Invalid=51985, Unknown=0, NotChecked=0, Total=68906 [2018-12-03 17:05:04,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2018-12-03 17:05:05,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 133. [2018-12-03 17:05:05,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2018-12-03 17:05:05,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 133 transitions. [2018-12-03 17:05:05,009 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 133 transitions. Word has length 68 [2018-12-03 17:05:05,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:05:05,010 INFO L480 AbstractCegarLoop]: Abstraction has 133 states and 133 transitions. [2018-12-03 17:05:05,010 INFO L481 AbstractCegarLoop]: Interpolant automaton has 134 states. [2018-12-03 17:05:05,010 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 133 transitions. [2018-12-03 17:05:05,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2018-12-03 17:05:05,013 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:05:05,013 INFO L402 BasicCegarLoop]: trace histogram [128, 1, 1, 1, 1] [2018-12-03 17:05:05,013 INFO L423 AbstractCegarLoop]: === Iteration 9 === [multErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2018-12-03 17:05:05,013 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:05:05,013 INFO L82 PathProgramCache]: Analyzing trace with hash 2011374628, now seen corresponding path program 8 times [2018-12-03 17:05:05,013 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:05:05,014 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:05:05,014 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:05:05,014 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:05:05,014 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:05:05,075 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-12-03 17:05:05,076 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-12-03 17:05:05,076 INFO L169 anRefinementStrategy]: Switched to traceCheck mode Z3_NO_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-12-03 17:05:05,089 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:05:05,089 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_NO_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: null) [2018-12-03 17:05:07,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2018-12-03 17:05:07,143 INFO L285 seRefinementStrategy]: Strategy TaipanRefinementStrategy was unsuccessful and could not determine trace feasibility. [2018-12-03 17:05:07,143 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-03 17:05:07,319 WARN L228 ceAbstractionStarter]: Unable to decide correctness. Please check the following counterexample manually. [2018-12-03 17:05:07,319 INFO L202 PluginConnector]: Adding new model Mult1-Safe.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.12 05:05:07 BoogieIcfgContainer [2018-12-03 17:05:07,319 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-03 17:05:07,320 INFO L168 Benchmark]: Toolchain (without parser) took 172433.82 ms. Allocated memory was 1.5 GB in the beginning and 2.5 GB in the end (delta: 989.3 MB). Free memory was 1.4 GB in the beginning and 2.5 GB in the end (delta: -1.0 GB). Peak memory consumption was 408.8 MB. Max. memory is 7.1 GB. [2018-12-03 17:05:07,324 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.19 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-12-03 17:05:07,325 INFO L168 Benchmark]: Boogie Procedure Inliner took 41.84 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-12-03 17:05:07,325 INFO L168 Benchmark]: Boogie Preprocessor took 26.58 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-12-03 17:05:07,326 INFO L168 Benchmark]: RCFGBuilder took 263.11 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: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. [2018-12-03 17:05:07,326 INFO L168 Benchmark]: TraceAbstraction took 172097.59 ms. Allocated memory was 1.5 GB in the beginning and 2.5 GB in the end (delta: 989.3 MB). Free memory was 1.4 GB in the beginning and 2.5 GB in the end (delta: -1.0 GB). Peak memory consumption was 387.6 MB. Max. memory is 7.1 GB. [2018-12-03 17:05:07,331 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.19 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 41.84 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 26.58 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 263.11 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: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 172097.59 ms. Allocated memory was 1.5 GB in the beginning and 2.5 GB in the end (delta: 989.3 MB). Free memory was 1.4 GB in the beginning and 2.5 GB in the end (delta: -1.0 GB). Peak memory consumption was 387.6 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 9]: Unable to prove that procedure postcondition always holds Unable to prove that procedure postcondition always holds Reason: unable to decide satisfiability of path constraint. Possible FailurePath: [L9-L10] requires b >= 0; [L15] res := 0; [L16] tmp := b; [L18] COND TRUE tmp > 0 [L20] res := res + a; [L21] tmp := tmp - 1; [L18] COND TRUE tmp > 0 [L20] res := res + a; [L21] tmp := tmp - 1; [L18] COND TRUE tmp > 0 [L20] res := res + a; [L21] tmp := tmp - 1; [L18] COND TRUE tmp > 0 [L20] res := res + a; [L21] tmp := tmp - 1; [L18] COND TRUE tmp > 0 [L20] res := res + a; [L21] tmp := tmp - 1; [L18] COND TRUE tmp > 0 [L20] res := res + a; [L21] tmp := tmp - 1; [L18] COND TRUE tmp > 0 [L20] res := res + a; [L21] tmp := tmp - 1; [L18] COND TRUE tmp > 0 [L20] res := res + a; [L21] tmp := tmp - 1; [L18] COND TRUE tmp > 0 [L20] res := res + a; [L21] tmp := tmp - 1; [L18] COND TRUE tmp > 0 [L20] res := res + a; [L21] tmp := tmp - 1; [L18] COND TRUE tmp > 0 [L20] res := res + a; [L21] tmp := tmp - 1; [L18] COND TRUE tmp > 0 [L20] res := res + a; [L21] tmp := tmp - 1; [L18] COND TRUE tmp > 0 [L20] res := res + a; [L21] tmp := tmp - 1; [L18] COND TRUE tmp > 0 [L20] res := res + a; [L21] tmp := tmp - 1; [L18] COND TRUE tmp > 0 [L20] res := res + a; [L21] tmp := tmp - 1; [L18] COND TRUE tmp > 0 [L20] res := res + a; [L21] tmp := tmp - 1; [L18] COND TRUE tmp > 0 [L20] res := res + a; [L21] tmp := tmp - 1; [L18] COND TRUE tmp > 0 [L20] res := res + a; [L21] tmp := tmp - 1; [L18] COND TRUE tmp > 0 [L20] res := res + a; [L21] tmp := tmp - 1; [L18] COND TRUE tmp > 0 [L20] res := res + a; [L21] tmp := tmp - 1; [L18] COND TRUE tmp > 0 [L20] res := res + a; [L21] tmp := tmp - 1; [L18] COND TRUE tmp > 0 [L20] res := res + a; [L21] tmp := tmp - 1; [L18] COND TRUE tmp > 0 [L20] res := res + a; [L21] tmp := tmp - 1; [L18] COND TRUE tmp > 0 [L20] res := res + a; [L21] tmp := tmp - 1; [L18] COND TRUE tmp > 0 [L20] res := res + a; [L21] tmp := tmp - 1; [L18] COND TRUE tmp > 0 [L20] res := res + a; [L21] tmp := tmp - 1; [L18] COND TRUE tmp > 0 [L20] res := res + a; [L21] tmp := tmp - 1; [L18] COND TRUE tmp > 0 [L20] res := res + a; [L21] tmp := tmp - 1; [L18] COND TRUE tmp > 0 [L20] res := res + a; [L21] tmp := tmp - 1; [L18] COND TRUE tmp > 0 [L20] res := res + a; [L21] tmp := tmp - 1; [L18] COND TRUE tmp > 0 [L20] res := res + a; [L21] tmp := tmp - 1; [L18] COND TRUE tmp > 0 [L20] res := res + a; [L21] tmp := tmp - 1; [L18] COND TRUE tmp > 0 [L20] res := res + a; [L21] tmp := tmp - 1; [L18] COND TRUE tmp > 0 [L20] res := res + a; [L21] tmp := tmp - 1; [L18] COND TRUE tmp > 0 [L20] res := res + a; [L21] tmp := tmp - 1; [L18] COND TRUE tmp > 0 [L20] res := res + a; [L21] tmp := tmp - 1; [L18] COND TRUE tmp > 0 [L20] res := res + a; [L21] tmp := tmp - 1; [L18] COND TRUE tmp > 0 [L20] res := res + a; [L21] tmp := tmp - 1; [L18] COND TRUE tmp > 0 [L20] res := res + a; [L21] tmp := tmp - 1; [L18] COND TRUE tmp > 0 [L20] res := res + a; [L21] tmp := tmp - 1; [L18] COND TRUE tmp > 0 [L20] res := res + a; [L21] tmp := tmp - 1; [L18] COND TRUE tmp > 0 [L20] res := res + a; [L21] tmp := tmp - 1; [L18] COND TRUE tmp > 0 [L20] res := res + a; [L21] tmp := tmp - 1; [L18] COND TRUE tmp > 0 [L20] res := res + a; [L21] tmp := tmp - 1; [L18] COND TRUE tmp > 0 [L20] res := res + a; [L21] tmp := tmp - 1; [L18] COND TRUE tmp > 0 [L20] res := res + a; [L21] tmp := tmp - 1; [L18] COND TRUE tmp > 0 [L20] res := res + a; [L21] tmp := tmp - 1; [L18] COND TRUE tmp > 0 [L20] res := res + a; [L21] tmp := tmp - 1; [L18] COND TRUE tmp > 0 [L20] res := res + a; [L21] tmp := tmp - 1; [L18] COND TRUE tmp > 0 [L20] res := res + a; [L21] tmp := tmp - 1; [L18] COND TRUE tmp > 0 [L20] res := res + a; [L21] tmp := tmp - 1; [L18] COND TRUE tmp > 0 [L20] res := res + a; [L21] tmp := tmp - 1; [L18] COND TRUE tmp > 0 [L20] res := res + a; [L21] tmp := tmp - 1; [L18] COND TRUE tmp > 0 [L20] res := res + a; [L21] tmp := tmp - 1; [L18] COND TRUE tmp > 0 [L20] res := res + a; [L21] tmp := tmp - 1; [L18] COND TRUE tmp > 0 [L20] res := res + a; [L21] tmp := tmp - 1; [L18] COND TRUE tmp > 0 [L20] res := res + a; [L21] tmp := tmp - 1; [L18] COND TRUE tmp > 0 [L20] res := res + a; [L21] tmp := tmp - 1; [L18] COND TRUE tmp > 0 [L20] res := res + a; [L21] tmp := tmp - 1; [L18] COND TRUE tmp > 0 [L20] res := res + a; [L21] tmp := tmp - 1; [L18] COND TRUE tmp > 0 [L20] res := res + a; [L21] tmp := tmp - 1; [L18] COND TRUE tmp > 0 [L20] res := res + a; [L21] tmp := tmp - 1; [L18] COND TRUE tmp > 0 [L20] res := res + a; [L21] tmp := tmp - 1; [L18] COND TRUE tmp > 0 [L20] res := res + a; [L21] tmp := tmp - 1; [L18] COND TRUE tmp > 0 [L20] res := res + a; [L21] tmp := tmp - 1; [L18] COND TRUE tmp > 0 [L20] res := res + a; [L21] tmp := tmp - 1; [L18] COND TRUE tmp > 0 [L20] res := res + a; [L21] tmp := tmp - 1; [L18] COND TRUE tmp > 0 [L20] res := res + a; [L21] tmp := tmp - 1; [L18] COND TRUE tmp > 0 [L20] res := res + a; [L21] tmp := tmp - 1; [L18] COND TRUE tmp > 0 [L20] res := res + a; [L21] tmp := tmp - 1; [L18] COND TRUE tmp > 0 [L20] res := res + a; [L21] tmp := tmp - 1; [L18] COND TRUE tmp > 0 [L20] res := res + a; [L21] tmp := tmp - 1; [L18] COND TRUE tmp > 0 [L20] res := res + a; [L21] tmp := tmp - 1; [L18] COND TRUE tmp > 0 [L20] res := res + a; [L21] tmp := tmp - 1; [L18] COND TRUE tmp > 0 [L20] res := res + a; [L21] tmp := tmp - 1; [L18] COND TRUE tmp > 0 [L20] res := res + a; [L21] tmp := tmp - 1; [L18] COND TRUE tmp > 0 [L20] res := res + a; [L21] tmp := tmp - 1; [L18] COND TRUE tmp > 0 [L20] res := res + a; [L21] tmp := tmp - 1; [L18] COND TRUE tmp > 0 [L20] res := res + a; [L21] tmp := tmp - 1; [L18] COND TRUE tmp > 0 [L20] res := res + a; [L21] tmp := tmp - 1; [L18] COND TRUE tmp > 0 [L20] res := res + a; [L21] tmp := tmp - 1; [L18] COND TRUE tmp > 0 [L20] res := res + a; [L21] tmp := tmp - 1; [L18] COND TRUE tmp > 0 [L20] res := res + a; [L21] tmp := tmp - 1; [L18] COND TRUE tmp > 0 [L20] res := res + a; [L21] tmp := tmp - 1; [L18] COND TRUE tmp > 0 [L20] res := res + a; [L21] tmp := tmp - 1; [L18] COND TRUE tmp > 0 [L20] res := res + a; [L21] tmp := tmp - 1; [L18] COND TRUE tmp > 0 [L20] res := res + a; [L21] tmp := tmp - 1; [L18] COND TRUE tmp > 0 [L20] res := res + a; [L21] tmp := tmp - 1; [L18] COND TRUE tmp > 0 [L20] res := res + a; [L21] tmp := tmp - 1; [L18] COND TRUE tmp > 0 [L20] res := res + a; [L21] tmp := tmp - 1; [L18] COND TRUE tmp > 0 [L20] res := res + a; [L21] tmp := tmp - 1; [L18] COND TRUE tmp > 0 [L20] res := res + a; [L21] tmp := tmp - 1; [L18] COND TRUE tmp > 0 [L20] res := res + a; [L21] tmp := tmp - 1; [L18] COND TRUE tmp > 0 [L20] res := res + a; [L21] tmp := tmp - 1; [L18] COND TRUE tmp > 0 [L20] res := res + a; [L21] tmp := tmp - 1; [L18] COND TRUE tmp > 0 [L20] res := res + a; [L21] tmp := tmp - 1; [L18] COND TRUE tmp > 0 [L20] res := res + a; [L21] tmp := tmp - 1; [L18] COND TRUE tmp > 0 [L20] res := res + a; [L21] tmp := tmp - 1; [L18] COND TRUE tmp > 0 [L20] res := res + a; [L21] tmp := tmp - 1; [L18] COND TRUE tmp > 0 [L20] res := res + a; [L21] tmp := tmp - 1; [L18] COND TRUE tmp > 0 [L20] res := res + a; [L21] tmp := tmp - 1; [L18] COND TRUE tmp > 0 [L20] res := res + a; [L21] tmp := tmp - 1; [L18] COND TRUE tmp > 0 [L20] res := res + a; [L21] tmp := tmp - 1; [L18] COND TRUE tmp > 0 [L20] res := res + a; [L21] tmp := tmp - 1; [L18] COND TRUE tmp > 0 [L20] res := res + a; [L21] tmp := tmp - 1; [L18] COND TRUE tmp > 0 [L20] res := res + a; [L21] tmp := tmp - 1; [L18] COND TRUE tmp > 0 [L20] res := res + a; [L21] tmp := tmp - 1; [L18] COND TRUE tmp > 0 [L20] res := res + a; [L21] tmp := tmp - 1; [L18] COND TRUE tmp > 0 [L20] res := res + a; [L21] tmp := tmp - 1; [L18] COND TRUE tmp > 0 [L20] res := res + a; [L21] tmp := tmp - 1; [L18] COND TRUE tmp > 0 [L20] res := res + a; [L21] tmp := tmp - 1; [L18] COND TRUE tmp > 0 [L20] res := res + a; [L21] tmp := tmp - 1; [L18] COND TRUE tmp > 0 [L20] res := res + a; [L21] tmp := tmp - 1; [L18] COND TRUE tmp > 0 [L20] res := res + a; [L21] tmp := tmp - 1; [L18] COND TRUE tmp > 0 [L20] res := res + a; [L21] tmp := tmp - 1; [L18] COND TRUE tmp > 0 [L20] res := res + a; [L21] tmp := tmp - 1; [L18] COND TRUE tmp > 0 [L20] res := res + a; [L21] tmp := tmp - 1; [L18] COND TRUE tmp > 0 [L20] res := res + a; [L21] tmp := tmp - 1; [L18] COND TRUE tmp > 0 [L20] res := res + a; [L21] tmp := tmp - 1; [L18] COND TRUE tmp > 0 [L20] res := res + a; [L21] tmp := tmp - 1; [L18] COND TRUE tmp > 0 [L20] res := res + a; [L21] tmp := tmp - 1; [L18] COND TRUE tmp > 0 [L20] res := res + a; [L21] tmp := tmp - 1; [L18] COND TRUE tmp > 0 [L20] res := res + a; [L21] tmp := tmp - 1; [L18] COND TRUE tmp > 0 [L20] res := res + a; [L21] tmp := tmp - 1; [L18] COND TRUE tmp > 0 [L20] res := res + a; [L21] tmp := tmp - 1; [L18] COND TRUE tmp > 0 [L20] res := res + a; [L21] tmp := tmp - 1; [L18] COND TRUE tmp > 0 [L20] res := res + a; [L21] tmp := tmp - 1; [L18] COND TRUE tmp > 0 [L20] res := res + a; [L21] tmp := tmp - 1; [L18] COND FALSE !(tmp > 0) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 6 locations, 1 error locations. UNKNOWN Result, 172.0s OverallTime, 9 OverallIterations, 128 TraceHistogramMax, 140.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 15 SDtfs, 2931 SDslu, 9 SDs, 0 SdLazy, 6801 SolverSat, 3162 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 8.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 562 GetRequests, 14 SyntacticMatches, 2 SemanticMatches, 546 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11626 ImplicationChecksByTransitivity, 150.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=133occurred in iteration=8, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.2s AbstIntTime, 1 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 8 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 9.0s SatisfiabilityAnalysisTime, 20.8s InterpolantComputationTime, 450 NumberOfCodeBlocks, 450 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 302 ConstructedInterpolants, 7 QuantifiedInterpolants, 163296 SizeOfPredicates, 23 NumberOfNonLiveVariables, 707 ConjunctsInSsa, 556 ConjunctsInUnsatCore, 16 InterpolantComputations, 2 PerfectInterpolantSequences, 0/5588 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Received shutdown request...