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_oct_cong.epf -i ../../../trunk/examples/programs/toy/nonlinear/Mult1-Safe.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-c78c21b [2018-12-03 18:19:55,950 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-03 18:19:55,952 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-03 18:19:55,970 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-03 18:19:55,971 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-03 18:19:55,972 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-03 18:19:55,973 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-03 18:19:55,975 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-03 18:19:55,976 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-03 18:19:55,977 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-03 18:19:55,978 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-03 18:19:55,978 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-03 18:19:55,981 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-03 18:19:55,982 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-03 18:19:55,983 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-03 18:19:55,984 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-03 18:19:55,989 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-03 18:19:55,991 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-03 18:19:55,998 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-03 18:19:56,003 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-03 18:19:56,007 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-03 18:19:56,008 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-03 18:19:56,014 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-03 18:19:56,014 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-03 18:19:56,014 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-03 18:19:56,016 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-03 18:19:56,016 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-03 18:19:56,017 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-03 18:19:56,021 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-03 18:19:56,023 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-03 18:19:56,024 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-03 18:19:56,024 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-03 18:19:56,026 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-03 18:19:56,026 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-03 18:19:56,028 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-03 18:19:56,028 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-03 18:19:56,028 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/array-bench/reach_32bit_array_compound_oct_cong.epf [2018-12-03 18:19:56,057 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-03 18:19:56,057 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-03 18:19:56,058 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2018-12-03 18:19:56,058 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2018-12-03 18:19:56,059 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-03 18:19:56,059 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-03 18:19:56,059 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-03 18:19:56,059 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-03 18:19:56,059 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-03 18:19:56,060 INFO L133 SettingsManager]: * Abstract domain=ArrayDomain [2018-12-03 18:19:56,060 INFO L133 SettingsManager]: * Log string format=TERM [2018-12-03 18:19:56,060 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-03 18:19:56,061 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-03 18:19:56,061 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-03 18:19:56,061 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-03 18:19:56,062 INFO L133 SettingsManager]: * Use SBE=true [2018-12-03 18:19:56,062 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-03 18:19:56,062 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-03 18:19:56,062 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-03 18:19:56,063 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-03 18:19:56,064 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-03 18:19:56,065 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-03 18:19:56,065 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-03 18:19:56,065 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-03 18:19:56,065 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-03 18:19:56,065 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-03 18:19:56,066 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-03 18:19:56,066 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-03 18:19:56,066 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-03 18:19:56,066 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-03 18:19:56,066 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-03 18:19:56,067 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-03 18:19:56,067 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-03 18:19:56,067 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-03 18:19:56,067 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-03 18:19:56,067 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-03 18:19:56,068 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-03 18:19:56,068 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-03 18:19:56,068 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-12-03 18:19:56,116 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-03 18:19:56,132 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-03 18:19:56,140 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-03 18:19:56,141 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-12-03 18:19:56,142 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-12-03 18:19:56,143 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 18:19:56,143 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/nonlinear/Mult1-Safe.bpl' [2018-12-03 18:19:56,178 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-03 18:19:56,180 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-12-03 18:19:56,181 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-03 18:19:56,181 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-03 18:19:56,181 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-03 18:19:56,200 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 06:19:56" (1/1) ... [2018-12-03 18:19:56,209 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 06:19:56" (1/1) ... [2018-12-03 18:19:56,215 WARN L165 Inliner]: Program contained no entry procedure! [2018-12-03 18:19:56,216 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2018-12-03 18:19:56,216 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2018-12-03 18:19:56,218 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-03 18:19:56,219 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-03 18:19:56,219 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-03 18:19:56,220 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-03 18:19:56,232 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 06:19:56" (1/1) ... [2018-12-03 18:19:56,232 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 06:19:56" (1/1) ... [2018-12-03 18:19:56,233 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 06:19:56" (1/1) ... [2018-12-03 18:19:56,233 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 06:19:56" (1/1) ... [2018-12-03 18:19:56,236 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 06:19:56" (1/1) ... [2018-12-03 18:19:56,241 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 06:19:56" (1/1) ... [2018-12-03 18:19:56,242 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 06:19:56" (1/1) ... [2018-12-03 18:19:56,243 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-03 18:19:56,244 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-03 18:19:56,244 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-03 18:19:56,244 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-03 18:19:56,245 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "Mult1-Safe.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 06:19:56" (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 18:19:56,316 INFO L124 BoogieDeclarations]: Specification and implementation of procedure mult given in one single declaration [2018-12-03 18:19:56,316 INFO L130 BoogieDeclarations]: Found specification of procedure mult [2018-12-03 18:19:56,316 INFO L138 BoogieDeclarations]: Found implementation of procedure mult [2018-12-03 18:19:56,383 WARN L615 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-12-03 18:19:56,540 INFO L272 CfgBuilder]: Using library mode [2018-12-03 18:19:56,541 INFO L280 CfgBuilder]: Removed 0 assue(true) statements. [2018-12-03 18:19:56,541 INFO L202 PluginConnector]: Adding new model Mult1-Safe.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 06:19:56 BoogieIcfgContainer [2018-12-03 18:19:56,541 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-03 18:19:56,542 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-03 18:19:56,542 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-03 18:19:56,546 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-03 18:19:56,546 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "Mult1-Safe.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 06:19:56" (1/2) ... [2018-12-03 18:19:56,547 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70bea2d0 and model type Mult1-Safe.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.12 06:19:56, skipping insertion in model container [2018-12-03 18:19:56,547 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 06:19:56" (2/2) ... [2018-12-03 18:19:56,550 INFO L112 eAbstractionObserver]: Analyzing ICFG Mult1-Safe.bpl [2018-12-03 18:19:56,560 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-03 18:19:56,569 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-03 18:19:56,591 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-03 18:19:56,628 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-03 18:19:56,629 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-03 18:19:56,629 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-03 18:19:56,629 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-03 18:19:56,629 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-03 18:19:56,629 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-03 18:19:56,630 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-03 18:19:56,630 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-03 18:19:56,646 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states. [2018-12-03 18:19:56,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-12-03 18:19:56,652 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:19:56,653 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-12-03 18:19:56,656 INFO L423 AbstractCegarLoop]: === Iteration 1 === [multErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2018-12-03 18:19:56,662 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:19:56,663 INFO L82 PathProgramCache]: Analyzing trace with hash 924708, now seen corresponding path program 1 times [2018-12-03 18:19:56,666 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:19:56,719 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:19:56,720 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:19:56,720 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:19:56,720 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:19:56,749 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-12-03 18:19:56,749 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-12-03 18:19:56,749 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 18:19:56,770 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:19:56,770 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_NO_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: null) [2018-12-03 18:19:56,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:19:56,798 INFO L193 CegarAbsIntRunner]: Skipping current iteration for AI because the path program does not contain any loops [2018-12-03 18:19:56,800 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:19:56,800 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:19:56,800 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 18:19:56,819 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:19:56,820 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 18:19:56,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:19:56,842 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:19:57,095 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 18:19:57,095 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:19:57,240 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 18:19:57,260 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-12-03 18:19:57,260 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2018-12-03 18:19:57,260 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 18:19:57,264 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-03 18:19:57,276 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-03 18:19:57,277 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-12-03 18:19:57,279 INFO L87 Difference]: Start difference. First operand 6 states. Second operand 5 states. [2018-12-03 18:19:57,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:19:57,402 INFO L93 Difference]: Finished difference Result 10 states and 10 transitions. [2018-12-03 18:19:57,402 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-03 18:19:57,404 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 4 [2018-12-03 18:19:57,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:19:57,415 INFO L225 Difference]: With dead ends: 10 [2018-12-03 18:19:57,415 INFO L226 Difference]: Without dead ends: 6 [2018-12-03 18:19:57,419 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 18:19:57,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6 states. [2018-12-03 18:19:57,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6 to 6. [2018-12-03 18:19:57,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-12-03 18:19:57,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 6 transitions. [2018-12-03 18:19:57,454 INFO L78 Accepts]: Start accepts. Automaton has 6 states and 6 transitions. Word has length 4 [2018-12-03 18:19:57,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:19:57,454 INFO L480 AbstractCegarLoop]: Abstraction has 6 states and 6 transitions. [2018-12-03 18:19:57,454 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-03 18:19:57,455 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 6 transitions. [2018-12-03 18:19:57,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-12-03 18:19:57,455 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:19:57,455 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2018-12-03 18:19:57,456 INFO L423 AbstractCegarLoop]: === Iteration 2 === [multErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2018-12-03 18:19:57,456 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:19:57,456 INFO L82 PathProgramCache]: Analyzing trace with hash 28663973, now seen corresponding path program 1 times [2018-12-03 18:19:57,456 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:19:57,457 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:19:57,457 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:19:57,458 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:19:57,458 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:19:57,462 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-12-03 18:19:57,462 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-12-03 18:19:57,462 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) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-12-03 18:19:57,473 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:19:57,474 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_NO_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: null) [2018-12-03 18:19:57,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:19:57,498 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2018-12-03 18:19:57,500 INFO L205 CegarAbsIntRunner]: [0], [1], [5], [7], [9] [2018-12-03 18:19:57,572 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 18:19:57,572 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 18:19:57,879 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 18:19:57,881 INFO L272 AbstractInterpreter]: Visited 5 different actions 14 times. Merged at 3 different actions 8 times. Widened at 1 different actions 1 times. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2018-12-03 18:19:57,922 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:19:57,923 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 18:19:57,923 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:19:57,923 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 18:19:57,933 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:19:57,934 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 18:19:57,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:19:57,955 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:19:58,124 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 18:19:58,125 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:19:58,509 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 18:19:58,528 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-03 18:19:58,528 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 7 [2018-12-03 18:19:58,528 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:19:58,529 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-03 18:19:58,529 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-03 18:19:58,529 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2018-12-03 18:19:58,530 INFO L87 Difference]: Start difference. First operand 6 states and 6 transitions. Second operand 8 states. [2018-12-03 18:19:58,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:19:58,648 INFO L93 Difference]: Finished difference Result 9 states and 9 transitions. [2018-12-03 18:19:58,649 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-03 18:19:58,649 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2018-12-03 18:19:58,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:19:58,650 INFO L225 Difference]: With dead ends: 9 [2018-12-03 18:19:58,651 INFO L226 Difference]: Without dead ends: 7 [2018-12-03 18:19:58,652 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 18:19:58,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2018-12-03 18:19:58,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-12-03 18:19:58,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-12-03 18:19:58,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2018-12-03 18:19:58,658 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 7 transitions. Word has length 5 [2018-12-03 18:19:58,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:19:58,658 INFO L480 AbstractCegarLoop]: Abstraction has 7 states and 7 transitions. [2018-12-03 18:19:58,658 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-03 18:19:58,659 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2018-12-03 18:19:58,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-12-03 18:19:58,659 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:19:58,659 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1] [2018-12-03 18:19:58,660 INFO L423 AbstractCegarLoop]: === Iteration 3 === [multErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2018-12-03 18:19:58,660 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:19:58,660 INFO L82 PathProgramCache]: Analyzing trace with hash 888581188, now seen corresponding path program 2 times [2018-12-03 18:19:58,661 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:19:58,662 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:19:58,662 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:19:58,662 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:19:58,662 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:19:58,668 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-12-03 18:19:58,668 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-12-03 18:19:58,668 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 18:19:58,681 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:19:58,681 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_NO_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: null) [2018-12-03 18:19:58,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:19:58,718 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:19:58,718 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:19:58,719 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:19:58,719 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 18:19:58,729 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 18:19:58,730 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 18:19:58,757 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-12-03 18:19:58,757 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:19:58,759 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:19:58,929 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 18:19:58,930 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:19:59,136 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 18:19:59,156 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-03 18:19:59,156 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 9 [2018-12-03 18:19:59,156 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:19:59,157 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-03 18:19:59,157 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-03 18:19:59,157 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2018-12-03 18:19:59,158 INFO L87 Difference]: Start difference. First operand 7 states and 7 transitions. Second operand 10 states. [2018-12-03 18:19:59,651 WARN L180 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 32 [2018-12-03 18:19:59,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:19:59,820 INFO L93 Difference]: Finished difference Result 12 states and 13 transitions. [2018-12-03 18:19:59,821 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-03 18:19:59,821 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2018-12-03 18:19:59,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:19:59,821 INFO L225 Difference]: With dead ends: 12 [2018-12-03 18:19:59,821 INFO L226 Difference]: Without dead ends: 9 [2018-12-03 18:19:59,822 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 18:19:59,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2018-12-03 18:19:59,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2018-12-03 18:19:59,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-12-03 18:19:59,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2018-12-03 18:19:59,826 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 6 [2018-12-03 18:19:59,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:19:59,827 INFO L480 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2018-12-03 18:19:59,827 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-03 18:19:59,827 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2018-12-03 18:19:59,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-12-03 18:19:59,827 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:19:59,827 INFO L402 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1] [2018-12-03 18:19:59,828 INFO L423 AbstractCegarLoop]: === Iteration 4 === [multErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2018-12-03 18:19:59,828 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:19:59,828 INFO L82 PathProgramCache]: Analyzing trace with hash -772033436, now seen corresponding path program 3 times [2018-12-03 18:19:59,828 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:19:59,829 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:19:59,829 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:19:59,829 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:19:59,830 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:19:59,838 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-12-03 18:19:59,838 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-12-03 18:19:59,838 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 18:19:59,851 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:19:59,851 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_NO_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: null) [2018-12-03 18:19:59,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:19:59,875 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:19:59,876 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:19:59,876 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:19:59,876 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 18:19:59,884 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 18:19:59,885 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 18:19:59,894 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 18:19:59,894 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:19:59,896 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:20:00,036 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 18:20:00,037 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:20:00,373 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 18:20:00,392 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-03 18:20:00,393 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 13 [2018-12-03 18:20:00,393 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:20:00,393 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-12-03 18:20:00,394 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-12-03 18:20:00,394 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2018-12-03 18:20:00,394 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand 14 states. [2018-12-03 18:20:01,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:20:01,034 INFO L93 Difference]: Finished difference Result 16 states and 19 transitions. [2018-12-03 18:20:01,034 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-03 18:20:01,035 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 8 [2018-12-03 18:20:01,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:20:01,036 INFO L225 Difference]: With dead ends: 16 [2018-12-03 18:20:01,036 INFO L226 Difference]: Without dead ends: 13 [2018-12-03 18:20:01,037 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=121, Invalid=385, Unknown=0, NotChecked=0, Total=506 [2018-12-03 18:20:01,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2018-12-03 18:20:01,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-12-03 18:20:01,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-12-03 18:20:01,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2018-12-03 18:20:01,043 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 8 [2018-12-03 18:20:01,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:20:01,043 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2018-12-03 18:20:01,043 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-12-03 18:20:01,044 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2018-12-03 18:20:01,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-03 18:20:01,044 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:20:01,044 INFO L402 BasicCegarLoop]: trace histogram [8, 1, 1, 1, 1] [2018-12-03 18:20:01,044 INFO L423 AbstractCegarLoop]: === Iteration 5 === [multErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2018-12-03 18:20:01,045 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:20:01,045 INFO L82 PathProgramCache]: Analyzing trace with hash 1189293220, now seen corresponding path program 4 times [2018-12-03 18:20:01,045 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:20:01,046 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:20:01,046 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:20:01,046 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:20:01,046 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:20:01,057 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-12-03 18:20:01,058 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-12-03 18:20:01,058 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 18:20:01,067 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:20:01,067 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_NO_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: null) [2018-12-03 18:20:01,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:20:01,097 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:20:01,097 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:20:01,097 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:20:01,098 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 18:20:01,109 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:20:01,109 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 18:20:01,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:20:01,136 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:20:01,320 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 18:20:01,321 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:20:01,798 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 18:20:01,817 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-03 18:20:01,817 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 21 [2018-12-03 18:20:01,817 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:20:01,818 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-12-03 18:20:01,818 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-12-03 18:20:01,819 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=360, Unknown=0, NotChecked=0, Total=462 [2018-12-03 18:20:01,819 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand 22 states. [2018-12-03 18:20:03,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:20:03,173 INFO L93 Difference]: Finished difference Result 24 states and 31 transitions. [2018-12-03 18:20:03,174 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-12-03 18:20:03,174 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 12 [2018-12-03 18:20:03,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:20:03,175 INFO L225 Difference]: With dead ends: 24 [2018-12-03 18:20:03,176 INFO L226 Difference]: Without dead ends: 21 [2018-12-03 18:20:03,177 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 18:20:03,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2018-12-03 18:20:03,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2018-12-03 18:20:03,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-12-03 18:20:03,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2018-12-03 18:20:03,187 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 12 [2018-12-03 18:20:03,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:20:03,188 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2018-12-03 18:20:03,188 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-12-03 18:20:03,188 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2018-12-03 18:20:03,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-12-03 18:20:03,189 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:20:03,189 INFO L402 BasicCegarLoop]: trace histogram [16, 1, 1, 1, 1] [2018-12-03 18:20:03,189 INFO L423 AbstractCegarLoop]: === Iteration 6 === [multErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2018-12-03 18:20:03,189 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:20:03,190 INFO L82 PathProgramCache]: Analyzing trace with hash 1373617444, now seen corresponding path program 5 times [2018-12-03 18:20:03,190 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:20:03,191 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:20:03,191 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:20:03,191 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:20:03,191 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:20:03,207 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-12-03 18:20:03,208 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-12-03 18:20:03,208 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 18:20:03,222 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:20:03,222 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_NO_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: null) [2018-12-03 18:20:03,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:20:03,291 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:20:03,291 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:20:03,291 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:20:03,291 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 18:20:03,299 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 18:20:03,300 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 18:20:03,482 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2018-12-03 18:20:03,482 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:20:03,486 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:20:04,023 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 18:20:04,023 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:20:04,923 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 18:20:04,944 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-03 18:20:04,944 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 37 [2018-12-03 18:20:04,945 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:20:04,945 INFO L459 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-12-03 18:20:04,945 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-12-03 18:20:04,946 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=318, Invalid=1088, Unknown=0, NotChecked=0, Total=1406 [2018-12-03 18:20:04,946 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand 38 states. [2018-12-03 18:20:06,643 WARN L180 SmtUtils]: Spent 250.00 ms on a formula simplification that was a NOOP. DAG size: 117 [2018-12-03 18:20:06,986 WARN L180 SmtUtils]: Spent 124.00 ms on a formula simplification that was a NOOP. DAG size: 107 [2018-12-03 18:20:07,205 WARN L180 SmtUtils]: Spent 162.00 ms on a formula simplification that was a NOOP. DAG size: 124 [2018-12-03 18:20:07,413 WARN L180 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 100 [2018-12-03 18:20:07,675 WARN L180 SmtUtils]: Spent 144.00 ms on a formula simplification that was a NOOP. DAG size: 120 [2018-12-03 18:20:09,764 WARN L180 SmtUtils]: Spent 143.00 ms on a formula simplification that was a NOOP. DAG size: 119 [2018-12-03 18:20:09,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:20:09,795 INFO L93 Difference]: Finished difference Result 40 states and 55 transitions. [2018-12-03 18:20:09,796 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-12-03 18:20:09,796 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 20 [2018-12-03 18:20:09,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:20:09,797 INFO L225 Difference]: With dead ends: 40 [2018-12-03 18:20:09,798 INFO L226 Difference]: Without dead ends: 37 [2018-12-03 18:20:09,801 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 598 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=1177, Invalid=3793, Unknown=0, NotChecked=0, Total=4970 [2018-12-03 18:20:09,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-12-03 18:20:09,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2018-12-03 18:20:09,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-12-03 18:20:09,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 37 transitions. [2018-12-03 18:20:09,825 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 37 transitions. Word has length 20 [2018-12-03 18:20:09,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:20:09,826 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 37 transitions. [2018-12-03 18:20:09,826 INFO L481 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-12-03 18:20:09,826 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2018-12-03 18:20:09,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-12-03 18:20:09,827 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:20:09,827 INFO L402 BasicCegarLoop]: trace histogram [32, 1, 1, 1, 1] [2018-12-03 18:20:09,827 INFO L423 AbstractCegarLoop]: === Iteration 7 === [multErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2018-12-03 18:20:09,828 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:20:09,828 INFO L82 PathProgramCache]: Analyzing trace with hash -1236312540, now seen corresponding path program 6 times [2018-12-03 18:20:09,828 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:20:09,829 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:20:09,829 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:20:09,829 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:20:09,829 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:20:09,946 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-12-03 18:20:09,946 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-12-03 18:20:09,946 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 18:20:09,962 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:20:09,962 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_NO_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: null) [2018-12-03 18:20:10,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:20:10,451 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:20:10,452 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:20:10,452 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:20:10,452 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 18:20:10,460 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 18:20:10,460 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 18:20:10,973 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 18:20:10,974 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:20:10,984 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:20:12,393 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 18:20:12,393 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:20:15,943 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 18:20:15,971 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-03 18:20:15,971 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35] total 69 [2018-12-03 18:20:15,971 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:20:15,972 INFO L459 AbstractCegarLoop]: Interpolant automaton has 70 states [2018-12-03 18:20:15,973 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2018-12-03 18:20:15,974 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1134, Invalid=3696, Unknown=0, NotChecked=0, Total=4830 [2018-12-03 18:20:15,974 INFO L87 Difference]: Start difference. First operand 37 states and 37 transitions. Second operand 70 states. [2018-12-03 18:20:19,114 WARN L180 SmtUtils]: Spent 756.00 ms on a formula simplification that was a NOOP. DAG size: 229 [2018-12-03 18:20:19,963 WARN L180 SmtUtils]: Spent 321.00 ms on a formula simplification that was a NOOP. DAG size: 219 [2018-12-03 18:20:20,548 WARN L180 SmtUtils]: Spent 425.00 ms on a formula simplification that was a NOOP. DAG size: 244 [2018-12-03 18:20:21,265 WARN L180 SmtUtils]: Spent 306.00 ms on a formula simplification that was a NOOP. DAG size: 212 [2018-12-03 18:20:21,898 WARN L180 SmtUtils]: Spent 425.00 ms on a formula simplification that was a NOOP. DAG size: 239 [2018-12-03 18:20:22,766 WARN L180 SmtUtils]: Spent 484.00 ms on a formula simplification that was a NOOP. DAG size: 205 [2018-12-03 18:20:23,556 WARN L180 SmtUtils]: Spent 288.00 ms on a formula simplification that was a NOOP. DAG size: 198 [2018-12-03 18:20:24,205 WARN L180 SmtUtils]: Spent 263.00 ms on a formula simplification that was a NOOP. DAG size: 191 [2018-12-03 18:20:24,813 WARN L180 SmtUtils]: Spent 237.00 ms on a formula simplification that was a NOOP. DAG size: 184 [2018-12-03 18:20:25,403 WARN L180 SmtUtils]: Spent 230.00 ms on a formula simplification that was a NOOP. DAG size: 177 [2018-12-03 18:20:26,006 WARN L180 SmtUtils]: Spent 252.00 ms on a formula simplification that was a NOOP. DAG size: 170 [2018-12-03 18:20:26,580 WARN L180 SmtUtils]: Spent 235.00 ms on a formula simplification that was a NOOP. DAG size: 163 [2018-12-03 18:20:27,089 WARN L180 SmtUtils]: Spent 191.00 ms on a formula simplification that was a NOOP. DAG size: 156 [2018-12-03 18:20:27,577 WARN L180 SmtUtils]: Spent 184.00 ms on a formula simplification that was a NOOP. DAG size: 149 [2018-12-03 18:20:28,124 WARN L180 SmtUtils]: Spent 184.00 ms on a formula simplification that was a NOOP. DAG size: 142 [2018-12-03 18:20:28,589 WARN L180 SmtUtils]: Spent 155.00 ms on a formula simplification that was a NOOP. DAG size: 135 [2018-12-03 18:20:29,013 WARN L180 SmtUtils]: Spent 147.00 ms on a formula simplification that was a NOOP. DAG size: 128 [2018-12-03 18:20:29,421 WARN L180 SmtUtils]: Spent 138.00 ms on a formula simplification that was a NOOP. DAG size: 121 [2018-12-03 18:20:30,118 WARN L180 SmtUtils]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2018-12-03 18:20:30,473 WARN L180 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 107 [2018-12-03 18:20:30,856 WARN L180 SmtUtils]: Spent 145.00 ms on a formula simplification that was a NOOP. DAG size: 100 [2018-12-03 18:20:34,226 WARN L180 SmtUtils]: Spent 375.00 ms on a formula simplification that was a NOOP. DAG size: 238 [2018-12-03 18:20:34,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:20:34,267 INFO L93 Difference]: Finished difference Result 72 states and 103 transitions. [2018-12-03 18:20:34,267 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2018-12-03 18:20:34,268 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 36 [2018-12-03 18:20:34,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:20:34,270 INFO L225 Difference]: With dead ends: 72 [2018-12-03 18:20:34,270 INFO L226 Difference]: Without dead ends: 69 [2018-12-03 18:20:34,275 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 133 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2230 ImplicationChecksByTransitivity, 20.9s TimeCoverageRelationStatistics Valid=4377, Invalid=13713, Unknown=0, NotChecked=0, Total=18090 [2018-12-03 18:20:34,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-12-03 18:20:34,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2018-12-03 18:20:34,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-12-03 18:20:34,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 69 transitions. [2018-12-03 18:20:34,329 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 69 transitions. Word has length 36 [2018-12-03 18:20:34,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:20:34,329 INFO L480 AbstractCegarLoop]: Abstraction has 69 states and 69 transitions. [2018-12-03 18:20:34,329 INFO L481 AbstractCegarLoop]: Interpolant automaton has 70 states. [2018-12-03 18:20:34,329 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 69 transitions. [2018-12-03 18:20:34,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-12-03 18:20:34,331 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:20:34,332 INFO L402 BasicCegarLoop]: trace histogram [64, 1, 1, 1, 1] [2018-12-03 18:20:34,332 INFO L423 AbstractCegarLoop]: === Iteration 8 === [multErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2018-12-03 18:20:34,332 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:20:34,332 INFO L82 PathProgramCache]: Analyzing trace with hash -955736028, now seen corresponding path program 7 times [2018-12-03 18:20:34,332 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:20:34,333 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:20:34,333 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:20:34,333 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:20:34,334 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:20:34,377 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-12-03 18:20:34,377 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-12-03 18:20:34,377 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 18:20:34,386 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:20:34,386 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_NO_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: null) [2018-12-03 18:20:34,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:20:34,689 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:20:34,690 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:20:34,690 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:20:34,690 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 18:20:34,699 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:20:34,699 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 18:20:40,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:20:40,257 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:20:43,198 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 18:20:43,198 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:20:51,574 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 18:20:51,592 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-03 18:20:51,593 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67, 67] total 133 [2018-12-03 18:20:51,593 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:20:51,594 INFO L459 AbstractCegarLoop]: Interpolant automaton has 134 states [2018-12-03 18:20:51,595 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 134 interpolants. [2018-12-03 18:20:51,600 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4302, Invalid=13520, Unknown=0, NotChecked=0, Total=17822 [2018-12-03 18:20:51,601 INFO L87 Difference]: Start difference. First operand 69 states and 69 transitions. Second operand 134 states. [2018-12-03 18:21:01,716 WARN L180 SmtUtils]: Spent 2.55 s on a formula simplification that was a NOOP. DAG size: 453 [2018-12-03 18:21:05,118 WARN L180 SmtUtils]: Spent 926.00 ms on a formula simplification that was a NOOP. DAG size: 443 [2018-12-03 18:21:06,912 WARN L180 SmtUtils]: Spent 1.31 s on a formula simplification that was a NOOP. DAG size: 460 [2018-12-03 18:21:10,135 WARN L180 SmtUtils]: Spent 905.00 ms on a formula simplification that was a NOOP. DAG size: 436 [2018-12-03 18:21:11,700 WARN L180 SmtUtils]: Spent 1.15 s on a formula simplification that was a NOOP. DAG size: 456 [2018-12-03 18:21:14,831 WARN L180 SmtUtils]: Spent 876.00 ms on a formula simplification that was a NOOP. DAG size: 429 [2018-12-03 18:21:17,854 WARN L180 SmtUtils]: Spent 842.00 ms on a formula simplification that was a NOOP. DAG size: 422 [2018-12-03 18:21:20,816 WARN L180 SmtUtils]: Spent 811.00 ms on a formula simplification that was a NOOP. DAG size: 415 [2018-12-03 18:21:23,726 WARN L180 SmtUtils]: Spent 836.00 ms on a formula simplification that was a NOOP. DAG size: 408 [2018-12-03 18:21:26,554 WARN L180 SmtUtils]: Spent 766.00 ms on a formula simplification that was a NOOP. DAG size: 401 [2018-12-03 18:21:29,356 WARN L180 SmtUtils]: Spent 797.00 ms on a formula simplification that was a NOOP. DAG size: 394 [2018-12-03 18:21:32,084 WARN L180 SmtUtils]: Spent 753.00 ms on a formula simplification that was a NOOP. DAG size: 387 [2018-12-03 18:21:34,739 WARN L180 SmtUtils]: Spent 712.00 ms on a formula simplification that was a NOOP. DAG size: 380 [2018-12-03 18:21:37,274 WARN L180 SmtUtils]: Spent 668.00 ms on a formula simplification that was a NOOP. DAG size: 373 [2018-12-03 18:21:39,838 WARN L180 SmtUtils]: Spent 714.00 ms on a formula simplification that was a NOOP. DAG size: 366 [2018-12-03 18:21:42,294 WARN L180 SmtUtils]: Spent 622.00 ms on a formula simplification that was a NOOP. DAG size: 359 [2018-12-03 18:21:44,685 WARN L180 SmtUtils]: Spent 608.00 ms on a formula simplification that was a NOOP. DAG size: 352 [2018-12-03 18:21:47,045 WARN L180 SmtUtils]: Spent 592.00 ms on a formula simplification that was a NOOP. DAG size: 345 [2018-12-03 18:21:49,335 WARN L180 SmtUtils]: Spent 612.00 ms on a formula simplification that was a NOOP. DAG size: 338 [2018-12-03 18:21:51,553 WARN L180 SmtUtils]: Spent 589.00 ms on a formula simplification that was a NOOP. DAG size: 331 [2018-12-03 18:21:53,715 WARN L180 SmtUtils]: Spent 584.00 ms on a formula simplification that was a NOOP. DAG size: 324 [2018-12-03 18:21:55,809 WARN L180 SmtUtils]: Spent 513.00 ms on a formula simplification that was a NOOP. DAG size: 317 [2018-12-03 18:21:57,881 WARN L180 SmtUtils]: Spent 551.00 ms on a formula simplification that was a NOOP. DAG size: 310 [2018-12-03 18:21:59,924 WARN L180 SmtUtils]: Spent 498.00 ms on a formula simplification that was a NOOP. DAG size: 303 [2018-12-03 18:22:01,873 WARN L180 SmtUtils]: Spent 516.00 ms on a formula simplification that was a NOOP. DAG size: 296 [2018-12-03 18:22:03,721 WARN L180 SmtUtils]: Spent 440.00 ms on a formula simplification that was a NOOP. DAG size: 289 [2018-12-03 18:22:05,579 WARN L180 SmtUtils]: Spent 471.00 ms on a formula simplification that was a NOOP. DAG size: 282 [2018-12-03 18:22:07,376 WARN L180 SmtUtils]: Spent 447.00 ms on a formula simplification that was a NOOP. DAG size: 275 [2018-12-03 18:22:09,078 WARN L180 SmtUtils]: Spent 425.00 ms on a formula simplification that was a NOOP. DAG size: 268 [2018-12-03 18:22:10,768 WARN L180 SmtUtils]: Spent 428.00 ms on a formula simplification that was a NOOP. DAG size: 261 [2018-12-03 18:22:12,462 WARN L180 SmtUtils]: Spent 390.00 ms on a formula simplification that was a NOOP. DAG size: 254 [2018-12-03 18:22:13,983 WARN L180 SmtUtils]: Spent 346.00 ms on a formula simplification that was a NOOP. DAG size: 247 [2018-12-03 18:22:15,459 WARN L180 SmtUtils]: Spent 361.00 ms on a formula simplification that was a NOOP. DAG size: 240 [2018-12-03 18:22:16,873 WARN L180 SmtUtils]: Spent 342.00 ms on a formula simplification that was a NOOP. DAG size: 233 [2018-12-03 18:22:18,272 WARN L180 SmtUtils]: Spent 345.00 ms on a formula simplification that was a NOOP. DAG size: 226 [2018-12-03 18:22:19,618 WARN L180 SmtUtils]: Spent 314.00 ms on a formula simplification that was a NOOP. DAG size: 219 [2018-12-03 18:22:20,934 WARN L180 SmtUtils]: Spent 317.00 ms on a formula simplification that was a NOOP. DAG size: 212 [2018-12-03 18:22:22,190 WARN L180 SmtUtils]: Spent 281.00 ms on a formula simplification that was a NOOP. DAG size: 205 [2018-12-03 18:22:23,418 WARN L180 SmtUtils]: Spent 281.00 ms on a formula simplification that was a NOOP. DAG size: 198 [2018-12-03 18:22:24,624 WARN L180 SmtUtils]: Spent 258.00 ms on a formula simplification that was a NOOP. DAG size: 191 [2018-12-03 18:22:25,763 WARN L180 SmtUtils]: Spent 242.00 ms on a formula simplification that was a NOOP. DAG size: 184 [2018-12-03 18:22:26,869 WARN L180 SmtUtils]: Spent 236.00 ms on a formula simplification that was a NOOP. DAG size: 177 [2018-12-03 18:22:27,924 WARN L180 SmtUtils]: Spent 214.00 ms on a formula simplification that was a NOOP. DAG size: 170 [2018-12-03 18:22:28,982 WARN L180 SmtUtils]: Spent 218.00 ms on a formula simplification that was a NOOP. DAG size: 163 [2018-12-03 18:22:29,962 WARN L180 SmtUtils]: Spent 197.00 ms on a formula simplification that was a NOOP. DAG size: 156 [2018-12-03 18:22:30,887 WARN L180 SmtUtils]: Spent 185.00 ms on a formula simplification that was a NOOP. DAG size: 149 [2018-12-03 18:22:31,763 WARN L180 SmtUtils]: Spent 169.00 ms on a formula simplification that was a NOOP. DAG size: 142 [2018-12-03 18:22:32,618 WARN L180 SmtUtils]: Spent 162.00 ms on a formula simplification that was a NOOP. DAG size: 135 [2018-12-03 18:22:33,435 WARN L180 SmtUtils]: Spent 149.00 ms on a formula simplification that was a NOOP. DAG size: 128 [2018-12-03 18:22:34,267 WARN L180 SmtUtils]: Spent 143.00 ms on a formula simplification that was a NOOP. DAG size: 121 [2018-12-03 18:22:35,013 WARN L180 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2018-12-03 18:22:35,708 WARN L180 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 107 [2018-12-03 18:22:36,366 WARN L180 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 100 [2018-12-03 18:22:43,688 WARN L180 SmtUtils]: Spent 946.00 ms on a formula simplification that was a NOOP. DAG size: 455 [2018-12-03 18:22:43,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:22:43,791 INFO L93 Difference]: Finished difference Result 136 states and 199 transitions. [2018-12-03 18:22:43,792 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 133 states. [2018-12-03 18:22:43,792 INFO L78 Accepts]: Start accepts. Automaton has 134 states. Word has length 68 [2018-12-03 18:22:43,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:22:43,795 INFO L225 Difference]: With dead ends: 136 [2018-12-03 18:22:43,795 INFO L226 Difference]: Without dead ends: 133 [2018-12-03 18:22:43,803 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 263 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 261 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8566 ImplicationChecksByTransitivity, 117.3s TimeCoverageRelationStatistics Valid=16921, Invalid=51985, Unknown=0, NotChecked=0, Total=68906 [2018-12-03 18:22:43,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2018-12-03 18:22:43,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 133. [2018-12-03 18:22:43,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2018-12-03 18:22:43,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 133 transitions. [2018-12-03 18:22:43,987 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 133 transitions. Word has length 68 [2018-12-03 18:22:43,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:22:43,988 INFO L480 AbstractCegarLoop]: Abstraction has 133 states and 133 transitions. [2018-12-03 18:22:43,988 INFO L481 AbstractCegarLoop]: Interpolant automaton has 134 states. [2018-12-03 18:22:43,988 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 133 transitions. [2018-12-03 18:22:43,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2018-12-03 18:22:43,990 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:22:43,990 INFO L402 BasicCegarLoop]: trace histogram [128, 1, 1, 1, 1] [2018-12-03 18:22:43,990 INFO L423 AbstractCegarLoop]: === Iteration 9 === [multErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2018-12-03 18:22:43,991 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:22:43,991 INFO L82 PathProgramCache]: Analyzing trace with hash 2011374628, now seen corresponding path program 8 times [2018-12-03 18:22:43,991 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:22:43,992 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:22:43,992 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:22:43,992 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:22:43,992 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:22:44,055 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-12-03 18:22:44,056 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-12-03 18:22:44,056 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 18:22:44,070 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:22:44,070 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_NO_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: null) [2018-12-03 18:22:46,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2018-12-03 18:22:46,121 INFO L285 seRefinementStrategy]: Strategy TaipanRefinementStrategy was unsuccessful and could not determine trace feasibility. [2018-12-03 18:22:46,122 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-03 18:22:46,155 WARN L228 ceAbstractionStarter]: Unable to decide correctness. Please check the following counterexample manually. [2018-12-03 18:22:46,155 INFO L202 PluginConnector]: Adding new model Mult1-Safe.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.12 06:22:46 BoogieIcfgContainer [2018-12-03 18:22:46,156 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-03 18:22:46,157 INFO L168 Benchmark]: Toolchain (without parser) took 169977.48 ms. Allocated memory was 1.5 GB in the beginning and 3.1 GB in the end (delta: 1.5 GB). Free memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: -770.8 MB). Peak memory consumption was 779.0 MB. Max. memory is 7.1 GB. [2018-12-03 18:22:46,157 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.22 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-12-03 18:22:46,158 INFO L168 Benchmark]: Boogie Procedure Inliner took 37.91 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-12-03 18:22:46,158 INFO L168 Benchmark]: Boogie Preprocessor took 23.97 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-12-03 18:22:46,159 INFO L168 Benchmark]: RCFGBuilder took 297.75 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 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 18:22:46,159 INFO L168 Benchmark]: TraceAbstraction took 169613.41 ms. Allocated memory was 1.5 GB in the beginning and 3.1 GB in the end (delta: 1.5 GB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -791.9 MB). Peak memory consumption was 757.9 MB. Max. memory is 7.1 GB. [2018-12-03 18:22:46,163 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.22 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 37.91 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 23.97 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 297.75 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 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 169613.41 ms. Allocated memory was 1.5 GB in the beginning and 3.1 GB in the end (delta: 1.5 GB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -791.9 MB). Peak memory consumption was 757.9 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, 169.5s OverallTime, 9 OverallIterations, 128 TraceHistogramMax, 138.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.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 562 GetRequests, 14 SyntacticMatches, 2 SemanticMatches, 546 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11626 ImplicationChecksByTransitivity, 147.8s 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.4s 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.1s SatisfiabilityAnalysisTime, 20.2s 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...