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/20170304-DifficultPathPrograms/sum02.i_3.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-c78c21b [2018-12-03 18:01:52,602 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-03 18:01:52,604 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-03 18:01:52,616 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-03 18:01:52,617 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-03 18:01:52,618 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-03 18:01:52,619 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-03 18:01:52,621 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-03 18:01:52,622 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-03 18:01:52,623 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-03 18:01:52,625 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-03 18:01:52,625 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-03 18:01:52,626 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-03 18:01:52,629 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-03 18:01:52,633 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-03 18:01:52,634 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-03 18:01:52,634 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-03 18:01:52,642 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-03 18:01:52,644 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-03 18:01:52,647 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-03 18:01:52,649 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-03 18:01:52,649 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-03 18:01:52,653 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-03 18:01:52,653 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-03 18:01:52,653 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-03 18:01:52,654 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-03 18:01:52,657 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-03 18:01:52,658 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-03 18:01:52,658 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-03 18:01:52,659 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-03 18:01:52,660 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-03 18:01:52,660 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-03 18:01:52,660 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-03 18:01:52,660 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-03 18:01:52,661 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-03 18:01:52,663 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-03 18:01:52,663 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:01:52,685 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-03 18:01:52,686 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-03 18:01:52,686 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2018-12-03 18:01:52,687 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2018-12-03 18:01:52,687 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-03 18:01:52,687 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-03 18:01:52,687 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-03 18:01:52,688 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-03 18:01:52,688 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-03 18:01:52,688 INFO L133 SettingsManager]: * Abstract domain=ArrayDomain [2018-12-03 18:01:52,688 INFO L133 SettingsManager]: * Log string format=TERM [2018-12-03 18:01:52,688 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-03 18:01:52,688 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-03 18:01:52,690 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-03 18:01:52,690 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-03 18:01:52,690 INFO L133 SettingsManager]: * Use SBE=true [2018-12-03 18:01:52,690 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-03 18:01:52,690 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-03 18:01:52,690 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-03 18:01:52,692 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-03 18:01:52,692 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-03 18:01:52,692 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-03 18:01:52,692 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-03 18:01:52,693 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-03 18:01:52,693 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-03 18:01:52,693 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-03 18:01:52,693 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-03 18:01:52,693 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-03 18:01:52,694 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-03 18:01:52,694 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-03 18:01:52,694 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-03 18:01:52,694 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-03 18:01:52,694 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-03 18:01:52,694 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-03 18:01:52,695 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-03 18:01:52,695 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-03 18:01:52,695 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-03 18:01:52,695 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-03 18:01:52,696 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-12-03 18:01:52,740 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-03 18:01:52,752 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-03 18:01:52,756 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-03 18:01:52,757 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-12-03 18:01:52,758 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-12-03 18:01:52,758 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/sum02.i_3.bpl [2018-12-03 18:01:52,759 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/sum02.i_3.bpl' [2018-12-03 18:01:52,798 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-03 18:01:52,801 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-12-03 18:01:52,801 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-03 18:01:52,801 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-03 18:01:52,802 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-03 18:01:52,818 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "sum02.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 06:01:52" (1/1) ... [2018-12-03 18:01:52,827 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "sum02.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 06:01:52" (1/1) ... [2018-12-03 18:01:52,835 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-03 18:01:52,836 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-03 18:01:52,836 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-03 18:01:52,836 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-03 18:01:52,848 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "sum02.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 06:01:52" (1/1) ... [2018-12-03 18:01:52,848 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "sum02.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 06:01:52" (1/1) ... [2018-12-03 18:01:52,849 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "sum02.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 06:01:52" (1/1) ... [2018-12-03 18:01:52,849 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "sum02.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 06:01:52" (1/1) ... [2018-12-03 18:01:52,853 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "sum02.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 06:01:52" (1/1) ... [2018-12-03 18:01:52,854 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "sum02.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 06:01:52" (1/1) ... [2018-12-03 18:01:52,855 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "sum02.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 06:01:52" (1/1) ... [2018-12-03 18:01:52,857 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-03 18:01:52,857 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-03 18:01:52,857 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-03 18:01:52,858 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-03 18:01:52,859 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "sum02.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 06:01:52" (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:01:52,922 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-03 18:01:52,922 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-03 18:01:53,181 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-03 18:01:53,181 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-12-03 18:01:53,181 INFO L202 PluginConnector]: Adding new model sum02.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 06:01:53 BoogieIcfgContainer [2018-12-03 18:01:53,182 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-03 18:01:53,182 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-03 18:01:53,183 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-03 18:01:53,186 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-03 18:01:53,186 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "sum02.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 06:01:52" (1/2) ... [2018-12-03 18:01:53,187 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@48d595a4 and model type sum02.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.12 06:01:53, skipping insertion in model container [2018-12-03 18:01:53,187 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "sum02.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 06:01:53" (2/2) ... [2018-12-03 18:01:53,189 INFO L112 eAbstractionObserver]: Analyzing ICFG sum02.i_3.bpl [2018-12-03 18:01:53,199 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-03 18:01:53,207 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-03 18:01:53,222 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-03 18:01:53,252 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-03 18:01:53,253 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-03 18:01:53,253 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-03 18:01:53,253 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-03 18:01:53,253 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-03 18:01:53,253 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-03 18:01:53,254 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-03 18:01:53,254 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-03 18:01:53,269 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states. [2018-12-03 18:01:53,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-12-03 18:01:53,275 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:01:53,276 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2018-12-03 18:01:53,279 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:01:53,285 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:01:53,285 INFO L82 PathProgramCache]: Analyzing trace with hash 29955, now seen corresponding path program 1 times [2018-12-03 18:01:53,288 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:01:53,333 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:01:53,333 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:01:53,333 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:01:53,333 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:01:53,364 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-12-03 18:01:53,365 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-12-03 18:01:53,365 INFO L169 anRefinementStrategy]: Switched to traceCheck mode Z3_NO_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:01:53,379 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:01:53,379 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_NO_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: null) [2018-12-03 18:01:53,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:01:53,410 INFO L193 CegarAbsIntRunner]: Skipping current iteration for AI because the path program does not contain any loops [2018-12-03 18:01:53,411 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:01:53,411 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:01:53,412 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:01:53,421 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:01:53,422 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 18:01:53,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:01:53,465 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:01:53,547 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:01:53,547 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:01:53,650 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:01:53,670 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-12-03 18:01:53,670 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 3 [2018-12-03 18:01:53,670 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 18:01:53,674 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 18:01:53,686 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 18:01:53,687 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-03 18:01:53,689 INFO L87 Difference]: Start difference. First operand 6 states. Second operand 3 states. [2018-12-03 18:01:53,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:01:53,741 INFO L93 Difference]: Finished difference Result 9 states and 10 transitions. [2018-12-03 18:01:53,742 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 18:01:53,744 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2018-12-03 18:01:53,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:01:53,766 INFO L225 Difference]: With dead ends: 9 [2018-12-03 18:01:53,766 INFO L226 Difference]: Without dead ends: 5 [2018-12-03 18:01:53,773 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-03 18:01:53,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5 states. [2018-12-03 18:01:53,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5 to 5. [2018-12-03 18:01:53,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-12-03 18:01:53,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 5 transitions. [2018-12-03 18:01:53,808 INFO L78 Accepts]: Start accepts. Automaton has 5 states and 5 transitions. Word has length 3 [2018-12-03 18:01:53,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:01:53,809 INFO L480 AbstractCegarLoop]: Abstraction has 5 states and 5 transitions. [2018-12-03 18:01:53,809 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 18:01:53,809 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states and 5 transitions. [2018-12-03 18:01:53,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-12-03 18:01:53,810 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:01:53,810 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-12-03 18:01:53,810 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:01:53,811 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:01:53,811 INFO L82 PathProgramCache]: Analyzing trace with hash 930412, now seen corresponding path program 1 times [2018-12-03 18:01:53,811 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:01:53,812 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:01:53,812 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:01:53,813 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:01:53,813 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:01:53,822 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-12-03 18:01:53,823 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-12-03 18:01:53,823 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:01:53,841 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:01:53,841 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_NO_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: null) [2018-12-03 18:01:53,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:01:53,896 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2018-12-03 18:01:53,898 INFO L205 CegarAbsIntRunner]: [0], [5], [7], [9] [2018-12-03 18:01:53,971 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 18:01:53,971 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 18:01:54,070 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-12-03 18:01:55,036 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 18:01:55,038 INFO L272 AbstractInterpreter]: Visited 4 different actions 29 times. Merged at 3 different actions 23 times. Widened at 2 different actions 9 times. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2018-12-03 18:01:55,179 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:01:55,179 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 18:01:55,180 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:01:55,180 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:01:55,195 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:01:55,195 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 18:01:55,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:01:55,230 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:01:55,451 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:01:55,451 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:01:55,648 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:01:55,674 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-03 18:01:55,674 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 5 [2018-12-03 18:01:55,674 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:01:55,676 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-03 18:01:55,676 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-03 18:01:55,676 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-03 18:01:55,676 INFO L87 Difference]: Start difference. First operand 5 states and 5 transitions. Second operand 6 states. [2018-12-03 18:01:55,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:01:55,730 INFO L93 Difference]: Finished difference Result 8 states and 8 transitions. [2018-12-03 18:01:55,731 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 18:01:55,731 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 4 [2018-12-03 18:01:55,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:01:55,732 INFO L225 Difference]: With dead ends: 8 [2018-12-03 18:01:55,732 INFO L226 Difference]: Without dead ends: 6 [2018-12-03 18:01:55,733 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-03 18:01:55,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6 states. [2018-12-03 18:01:55,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6 to 6. [2018-12-03 18:01:55,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-12-03 18:01:55,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 6 transitions. [2018-12-03 18:01:55,736 INFO L78 Accepts]: Start accepts. Automaton has 6 states and 6 transitions. Word has length 4 [2018-12-03 18:01:55,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:01:55,736 INFO L480 AbstractCegarLoop]: Abstraction has 6 states and 6 transitions. [2018-12-03 18:01:55,736 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-03 18:01:55,737 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 6 transitions. [2018-12-03 18:01:55,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-12-03 18:01:55,737 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:01:55,737 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1] [2018-12-03 18:01:55,739 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:01:55,740 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:01:55,740 INFO L82 PathProgramCache]: Analyzing trace with hash 28844579, now seen corresponding path program 2 times [2018-12-03 18:01:55,740 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:01:55,741 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:01:55,741 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:01:55,742 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:01:55,742 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:01:55,752 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-12-03 18:01:55,753 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-12-03 18:01:55,753 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:01:55,770 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:01:55,770 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_NO_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: null) [2018-12-03 18:01:55,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:01:55,801 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:01:55,801 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:01:55,801 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:01:55,801 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:01:55,812 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 18:01:55,812 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 18:01:55,861 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-12-03 18:01:55,861 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:01:55,863 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:01:56,069 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:01:56,070 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:01:58,325 WARN L180 SmtUtils]: Spent 2.23 s on a formula simplification. DAG size of input: 32 DAG size of output: 20 [2018-12-03 18:02:02,663 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 1 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:02:02,687 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-03 18:02:02,687 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 7 [2018-12-03 18:02:02,688 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:02:02,688 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-03 18:02:02,688 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-03 18:02:02,689 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=32, Unknown=2, NotChecked=0, Total=56 [2018-12-03 18:02:02,689 INFO L87 Difference]: Start difference. First operand 6 states and 6 transitions. Second operand 8 states. [2018-12-03 18:02:14,911 WARN L180 SmtUtils]: Spent 11.84 s on a formula simplification that was a NOOP. DAG size: 41 [2018-12-03 18:02:15,572 WARN L180 SmtUtils]: Spent 129.00 ms on a formula simplification that was a NOOP. DAG size: 30 [2018-12-03 18:02:15,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:02:15,631 INFO L93 Difference]: Finished difference Result 12 states and 15 transitions. [2018-12-03 18:02:15,632 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-03 18:02:15,632 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2018-12-03 18:02:15,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:02:15,633 INFO L225 Difference]: With dead ends: 12 [2018-12-03 18:02:15,633 INFO L226 Difference]: Without dead ends: 10 [2018-12-03 18:02:15,634 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 18.9s TimeCoverageRelationStatistics Valid=38, Invalid=50, Unknown=2, NotChecked=0, Total=90 [2018-12-03 18:02:15,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2018-12-03 18:02:15,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2018-12-03 18:02:15,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-12-03 18:02:15,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2018-12-03 18:02:15,639 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 5 [2018-12-03 18:02:15,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:02:15,642 INFO L480 AbstractCegarLoop]: Abstraction has 10 states and 10 transitions. [2018-12-03 18:02:15,642 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-03 18:02:15,642 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2018-12-03 18:02:15,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-12-03 18:02:15,643 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:02:15,643 INFO L402 BasicCegarLoop]: trace histogram [6, 1, 1, 1] [2018-12-03 18:02:15,643 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:02:15,644 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:02:15,644 INFO L82 PathProgramCache]: Analyzing trace with hash 1242899555, now seen corresponding path program 3 times [2018-12-03 18:02:15,644 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:02:15,645 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:02:15,645 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:02:15,645 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:02:15,645 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:02:15,667 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-12-03 18:02:15,667 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-12-03 18:02:15,667 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:02:15,682 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:02:15,682 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_NO_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: null) [2018-12-03 18:02:15,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:02:15,827 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:02:15,828 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:02:15,828 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:02:15,828 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:02:15,841 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 18:02:15,841 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 18:02:15,961 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 18:02:15,962 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:02:15,965 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:02:16,354 WARN L180 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 14 DAG size of output: 12 [2018-12-03 18:02:16,416 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:02:16,416 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:02:18,560 WARN L180 SmtUtils]: Spent 2.10 s on a formula simplification. DAG size of input: 32 DAG size of output: 20 [2018-12-03 18:02:21,989 WARN L180 SmtUtils]: Spent 2.86 s on a formula simplification. DAG size of input: 31 DAG size of output: 30 [2018-12-03 18:02:30,783 WARN L180 SmtUtils]: Spent 8.16 s on a formula simplification. DAG size of input: 34 DAG size of output: 33 [2018-12-03 18:02:50,744 WARN L180 SmtUtils]: Spent 12.71 s on a formula simplification that was a NOOP. DAG size: 37 [2018-12-03 18:03:09,532 WARN L180 SmtUtils]: Spent 4.70 s on a formula simplification that was a NOOP. DAG size: 43 [2018-12-03 18:03:09,534 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 17 refuted. 4 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:03:09,560 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-03 18:03:09,560 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 15 [2018-12-03 18:03:09,560 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:03:09,561 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-12-03 18:03:09,561 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-12-03 18:03:09,562 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=153, Unknown=9, NotChecked=0, Total=240 [2018-12-03 18:03:09,562 INFO L87 Difference]: Start difference. First operand 10 states and 10 transitions. Second operand 16 states. [2018-12-03 18:03:15,165 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse5 (mod c_ULTIMATE.start_main_~i~6 4294967296)) (.cse13 (mod c_ULTIMATE.start_main_~n~6 4294967296)) (.cse9 (mod (+ c_ULTIMATE.start_main_~i~6 1) 4294967296))) (let ((.cse15 (< .cse13 .cse9)) (.cse6 (mod (+ c_ULTIMATE.start_main_~i~6 5) 4294967296)) (.cse8 (mod (+ c_ULTIMATE.start_main_~i~6 4) 4294967296)) (.cse7 (mod (+ c_ULTIMATE.start_main_~i~6 3) 4294967296)) (.cse10 (mod (+ c_ULTIMATE.start_main_~i~6 2) 4294967296)) (.cse14 (< .cse13 .cse5)) (.cse11 (mod (div (mod (* .cse13 (+ .cse13 1)) 18446744073709551616) 2) 18446744073709551616))) (and (or (forall ((ULTIMATE.start_main_~n~6 Int)) (let ((.cse1 (mod c_ULTIMATE.start_main_~i~6 4294967296)) (.cse4 (mod (+ c_ULTIMATE.start_main_~i~6 2) 4294967296)) (.cse3 (mod (+ c_ULTIMATE.start_main_~i~6 1) 4294967296)) (.cse0 (mod ULTIMATE.start_main_~n~6 4294967296)) (.cse2 (mod (+ c_ULTIMATE.start_main_~i~6 5) 4294967296))) (or (<= (mod (+ c_ULTIMATE.start_main_~i~6 6) 4294967296) .cse0) (= (mod (div (mod (* .cse0 (+ .cse0 1)) 18446744073709551616) 2) 18446744073709551616) (mod (+ .cse1 .cse2 (mod (+ c_ULTIMATE.start_main_~i~6 3) 4294967296) (mod (+ c_ULTIMATE.start_main_~i~6 4) 4294967296) c_ULTIMATE.start_main_~sn~6 .cse3 .cse4) 18446744073709551616)) (< .cse0 .cse1) (< .cse0 .cse4) (< .cse0 .cse3) (< .cse0 .cse2)))) (= 0 (mod (+ .cse5 .cse6 .cse7 .cse8 c_ULTIMATE.start_main_~sn~6 .cse9 .cse10) 18446744073709551616))) (let ((.cse12 (mod (+ .cse5 c_ULTIMATE.start_main_~sn~6 .cse9) 18446744073709551616))) (or (= .cse11 .cse12) (<= .cse10 .cse13) .cse14 .cse15 (= 0 .cse12))) (let ((.cse16 (mod (+ .cse5 .cse7 c_ULTIMATE.start_main_~sn~6 .cse9 .cse10) 18446744073709551616))) (or (= .cse16 .cse11) (= .cse16 0) (< .cse13 .cse7) .cse14 (<= .cse8 .cse13))) (let ((.cse17 (mod (+ .cse5 .cse7 .cse8 c_ULTIMATE.start_main_~sn~6 .cse9 .cse10) 18446744073709551616))) (or (= 0 .cse17) .cse14 (< .cse13 .cse8) (= .cse11 .cse17) .cse15 (<= .cse6 .cse13))) (let ((.cse18 (mod (+ .cse5 c_ULTIMATE.start_main_~sn~6 .cse9 .cse10) 18446744073709551616))) (or (<= .cse7 .cse13) (= 0 .cse18) .cse14 (= .cse11 .cse18) (< .cse13 .cse10))) (let ((.cse19 (mod c_ULTIMATE.start_main_~sn~6 18446744073709551616))) (or (= .cse19 .cse11) (= .cse19 0) (<= .cse5 .cse13))) (let ((.cse20 (mod (+ .cse5 c_ULTIMATE.start_main_~sn~6) 18446744073709551616))) (or .cse14 (<= .cse9 .cse13) (= .cse11 .cse20) (= 0 .cse20)))))) is different from false [2018-12-03 18:04:15,383 WARN L180 SmtUtils]: Spent 56.43 s on a formula simplification that was a NOOP. DAG size: 69 [2018-12-03 18:05:20,983 WARN L180 SmtUtils]: Spent 56.82 s on a formula simplification that was a NOOP. DAG size: 59 [2018-12-03 18:05:40,527 WARN L180 SmtUtils]: Spent 9.00 s on a formula simplification that was a NOOP. DAG size: 49 [2018-12-03 18:06:00,045 WARN L180 SmtUtils]: Spent 7.30 s on a formula simplification that was a NOOP. DAG size: 39 [2018-12-03 18:06:09,196 WARN L180 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 30 [2018-12-03 18:06:12,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:06:12,849 INFO L93 Difference]: Finished difference Result 20 states and 27 transitions. [2018-12-03 18:06:12,851 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-12-03 18:06:12,851 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 9 [2018-12-03 18:06:12,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:06:12,852 INFO L225 Difference]: With dead ends: 20 [2018-12-03 18:06:12,852 INFO L226 Difference]: Without dead ends: 18 [2018-12-03 18:06:12,854 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 218.9s TimeCoverageRelationStatistics Valid=155, Invalid=247, Unknown=22, NotChecked=38, Total=462 [2018-12-03 18:06:12,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2018-12-03 18:06:12,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2018-12-03 18:06:12,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-12-03 18:06:12,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2018-12-03 18:06:12,862 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 9 [2018-12-03 18:06:12,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:06:12,863 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions. [2018-12-03 18:06:12,863 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-12-03 18:06:12,863 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2018-12-03 18:06:12,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-12-03 18:06:12,864 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:06:12,864 INFO L402 BasicCegarLoop]: trace histogram [14, 1, 1, 1] [2018-12-03 18:06:12,864 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:06:12,864 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:06:12,864 INFO L82 PathProgramCache]: Analyzing trace with hash 1895680227, now seen corresponding path program 4 times [2018-12-03 18:06:12,865 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:06:12,865 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:06:12,866 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:06:12,866 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:06:12,866 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:06:12,893 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-12-03 18:06:12,893 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-12-03 18:06:12,893 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:06:12,906 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:06:12,906 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_NO_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: null) [2018-12-03 18:06:13,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:06:13,093 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:06:13,093 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:06:13,093 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:06:13,093 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:06:13,102 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:06:13,103 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 18:06:15,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:06:15,209 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:06:15,603 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:06:15,603 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:06:17,810 WARN L180 SmtUtils]: Spent 2.09 s on a formula simplification. DAG size of input: 32 DAG size of output: 20 [2018-12-03 18:06:20,752 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (mod c_ULTIMATE.start_main_~i~6 4294967296)) (.cse2 (mod (+ c_ULTIMATE.start_main_~i~6 3) 4294967296)) (.cse4 (mod (+ c_ULTIMATE.start_main_~i~6 2) 4294967296))) (let ((.cse0 (mod (+ .cse3 .cse2 c_ULTIMATE.start_main_~sn~6 (mod (+ c_ULTIMATE.start_main_~i~6 1) 4294967296) .cse4) 18446744073709551616)) (.cse1 (mod c_ULTIMATE.start_main_~n~6 4294967296))) (or (= .cse0 (mod (div (mod (* .cse1 (+ .cse1 1)) 18446744073709551616) 2) 18446744073709551616)) (= .cse0 0) (< .cse1 .cse2) (< .cse1 .cse3) (<= (mod (+ c_ULTIMATE.start_main_~i~6 4) 4294967296) .cse1) (< .cse1 .cse4)))) is different from true [2018-12-03 18:06:26,201 WARN L180 SmtUtils]: Spent 3.01 s on a formula simplification that was a NOOP. DAG size: 37 [2018-12-03 18:06:28,239 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (mod c_ULTIMATE.start_main_~i~6 4294967296)) (.cse5 (mod (+ c_ULTIMATE.start_main_~i~6 5) 4294967296)) (.cse3 (mod (+ c_ULTIMATE.start_main_~i~6 4) 4294967296)) (.cse4 (mod (+ c_ULTIMATE.start_main_~i~6 2) 4294967296))) (let ((.cse1 (mod (+ .cse2 .cse5 (mod (+ c_ULTIMATE.start_main_~i~6 3) 4294967296) .cse3 c_ULTIMATE.start_main_~sn~6 (mod (+ c_ULTIMATE.start_main_~i~6 1) 4294967296) .cse4) 18446744073709551616)) (.cse0 (mod c_ULTIMATE.start_main_~n~6 4294967296))) (or (<= (mod (+ c_ULTIMATE.start_main_~i~6 6) 4294967296) .cse0) (= (mod (div (mod (* .cse0 (+ .cse0 1)) 18446744073709551616) 2) 18446744073709551616) .cse1) (< .cse0 .cse2) (< .cse0 .cse3) (= 0 .cse1) (< .cse0 .cse4) (< .cse0 .cse5)))) is different from true [2018-12-03 18:06:30,253 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (mod c_ULTIMATE.start_main_~i~6 4294967296)) (.cse6 (mod (+ c_ULTIMATE.start_main_~i~6 5) 4294967296)) (.cse2 (mod (+ c_ULTIMATE.start_main_~i~6 3) 4294967296)) (.cse4 (mod (+ c_ULTIMATE.start_main_~i~6 6) 4294967296)) (.cse5 (mod (+ c_ULTIMATE.start_main_~i~6 1) 4294967296))) (let ((.cse0 (mod (+ .cse3 .cse6 .cse2 (mod (+ c_ULTIMATE.start_main_~i~6 4) 4294967296) c_ULTIMATE.start_main_~sn~6 .cse4 .cse5 (mod (+ c_ULTIMATE.start_main_~i~6 2) 4294967296)) 18446744073709551616)) (.cse1 (mod c_ULTIMATE.start_main_~n~6 4294967296))) (or (= .cse0 0) (< .cse1 .cse2) (< .cse1 .cse3) (<= (mod (+ c_ULTIMATE.start_main_~i~6 7) 4294967296) .cse1) (= .cse0 (mod (div (mod (* .cse1 (+ .cse1 1)) 18446744073709551616) 2) 18446744073709551616)) (< .cse1 .cse4) (< .cse1 .cse5) (< .cse1 .cse6)))) is different from true [2018-12-03 18:06:32,314 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (mod (+ c_ULTIMATE.start_main_~i~6 7) 4294967296)) (.cse4 (mod (+ c_ULTIMATE.start_main_~i~6 4) 4294967296)) (.cse6 (mod (+ c_ULTIMATE.start_main_~i~6 1) 4294967296)) (.cse2 (mod (+ c_ULTIMATE.start_main_~i~6 6) 4294967296)) (.cse5 (mod (+ c_ULTIMATE.start_main_~i~6 2) 4294967296))) (let ((.cse3 (mod (+ (mod c_ULTIMATE.start_main_~i~6 4294967296) (mod (+ c_ULTIMATE.start_main_~i~6 5) 4294967296) .cse1 (mod (+ c_ULTIMATE.start_main_~i~6 3) 4294967296) .cse4 c_ULTIMATE.start_main_~sn~6 .cse6 .cse2 .cse5) 18446744073709551616)) (.cse0 (mod c_ULTIMATE.start_main_~n~6 4294967296))) (or (< .cse0 .cse1) (<= (mod (+ c_ULTIMATE.start_main_~i~6 8) 4294967296) .cse0) (< .cse0 .cse2) (= .cse3 0) (< .cse0 .cse4) (= .cse3 (mod (div (mod (* .cse0 (+ .cse0 1)) 18446744073709551616) 2) 18446744073709551616)) (< .cse0 .cse5) (< .cse0 .cse6)))) is different from true [2018-12-03 18:06:34,448 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse4 (mod c_ULTIMATE.start_main_~i~6 4294967296)) (.cse2 (mod (+ c_ULTIMATE.start_main_~i~6 7) 4294967296)) (.cse7 (mod (+ c_ULTIMATE.start_main_~i~6 5) 4294967296)) (.cse1 (mod (+ c_ULTIMATE.start_main_~i~6 3) 4294967296)) (.cse5 (mod (+ c_ULTIMATE.start_main_~i~6 8) 4294967296)) (.cse6 (mod (+ c_ULTIMATE.start_main_~i~6 2) 4294967296))) (let ((.cse3 (mod (+ .cse4 .cse2 .cse7 .cse1 (mod (+ c_ULTIMATE.start_main_~i~6 4) 4294967296) c_ULTIMATE.start_main_~sn~6 (mod (+ c_ULTIMATE.start_main_~i~6 1) 4294967296) (mod (+ c_ULTIMATE.start_main_~i~6 6) 4294967296) .cse5 .cse6) 18446744073709551616)) (.cse0 (mod c_ULTIMATE.start_main_~n~6 4294967296))) (or (< .cse0 .cse1) (< .cse0 .cse2) (= .cse3 0) (< .cse0 .cse4) (<= (mod (+ c_ULTIMATE.start_main_~i~6 9) 4294967296) .cse0) (< .cse0 .cse5) (< .cse0 .cse6) (= .cse3 (mod (div (mod (* .cse0 (+ .cse0 1)) 18446744073709551616) 2) 18446744073709551616)) (< .cse0 .cse7)))) is different from true [2018-12-03 18:08:14,016 WARN L180 SmtUtils]: Spent 1.43 m on a formula simplification. DAG size of input: 55 DAG size of output: 53 [2018-12-03 18:08:16,123 WARN L854 $PredicateComparison]: unable to prove that (or (forall ((ULTIMATE.start_main_~n~6 Int)) (let ((.cse2 (mod (+ c_ULTIMATE.start_main_~i~6 7) 4294967296)) (.cse0 (mod c_ULTIMATE.start_main_~i~6 4294967296)) (.cse3 (mod (+ c_ULTIMATE.start_main_~i~6 4) 4294967296)) (.cse1 (mod (+ c_ULTIMATE.start_main_~i~6 10) 4294967296)) (.cse5 (mod ULTIMATE.start_main_~n~6 4294967296)) (.cse4 (mod (+ c_ULTIMATE.start_main_~i~6 2) 4294967296))) (or (= (mod (+ .cse0 .cse1 (mod (+ c_ULTIMATE.start_main_~i~6 5) 4294967296) .cse2 (mod (+ c_ULTIMATE.start_main_~i~6 9) 4294967296) (mod (+ c_ULTIMATE.start_main_~i~6 3) 4294967296) .cse3 c_ULTIMATE.start_main_~sn~6 (mod (+ c_ULTIMATE.start_main_~i~6 6) 4294967296) (mod (+ c_ULTIMATE.start_main_~i~6 1) 4294967296) (mod (+ c_ULTIMATE.start_main_~i~6 8) 4294967296) .cse4) 18446744073709551616) (mod (div (mod (* .cse5 (+ .cse5 1)) 18446744073709551616) 2) 18446744073709551616)) (< .cse5 .cse2) (< .cse5 .cse0) (<= (mod (+ c_ULTIMATE.start_main_~i~6 11) 4294967296) .cse5) (< .cse5 .cse3) (< .cse5 .cse1) (< .cse5 .cse4)))) (= (mod (+ (mod c_ULTIMATE.start_main_~i~6 4294967296) (mod (+ c_ULTIMATE.start_main_~i~6 10) 4294967296) (mod (+ c_ULTIMATE.start_main_~i~6 5) 4294967296) (mod (+ c_ULTIMATE.start_main_~i~6 7) 4294967296) (mod (+ c_ULTIMATE.start_main_~i~6 9) 4294967296) (mod (+ c_ULTIMATE.start_main_~i~6 3) 4294967296) (mod (+ c_ULTIMATE.start_main_~i~6 4) 4294967296) c_ULTIMATE.start_main_~sn~6 (mod (+ c_ULTIMATE.start_main_~i~6 6) 4294967296) (mod (+ c_ULTIMATE.start_main_~i~6 1) 4294967296) (mod (+ c_ULTIMATE.start_main_~i~6 8) 4294967296) (mod (+ c_ULTIMATE.start_main_~i~6 2) 4294967296)) 18446744073709551616) 0)) is different from true [2018-12-03 18:08:18,302 WARN L854 $PredicateComparison]: unable to prove that (or (forall ((ULTIMATE.start_main_~n~6 Int)) (let ((.cse2 (mod (+ c_ULTIMATE.start_main_~i~6 3) 4294967296)) (.cse3 (mod (+ c_ULTIMATE.start_main_~i~6 8) 4294967296)) (.cse1 (mod (+ c_ULTIMATE.start_main_~i~6 11) 4294967296)) (.cse4 (mod (+ c_ULTIMATE.start_main_~i~6 1) 4294967296)) (.cse0 (mod ULTIMATE.start_main_~n~6 4294967296)) (.cse5 (mod (+ c_ULTIMATE.start_main_~i~6 5) 4294967296))) (or (< .cse0 .cse1) (< .cse0 .cse2) (<= (mod (+ c_ULTIMATE.start_main_~i~6 12) 4294967296) .cse0) (< .cse0 .cse3) (< .cse0 .cse4) (= (mod (div (mod (* .cse0 (+ .cse0 1)) 18446744073709551616) 2) 18446744073709551616) (mod (+ (mod c_ULTIMATE.start_main_~i~6 4294967296) (mod (+ c_ULTIMATE.start_main_~i~6 10) 4294967296) .cse2 (mod (+ c_ULTIMATE.start_main_~i~6 9) 4294967296) (mod (+ c_ULTIMATE.start_main_~i~6 4) 4294967296) .cse3 (mod (+ c_ULTIMATE.start_main_~i~6 7) 4294967296) .cse5 .cse1 c_ULTIMATE.start_main_~sn~6 (mod (+ c_ULTIMATE.start_main_~i~6 6) 4294967296) .cse4 (mod (+ c_ULTIMATE.start_main_~i~6 2) 4294967296)) 18446744073709551616)) (< .cse0 .cse5)))) (= 0 (mod (+ (mod c_ULTIMATE.start_main_~i~6 4294967296) (mod (+ c_ULTIMATE.start_main_~i~6 10) 4294967296) (mod (+ c_ULTIMATE.start_main_~i~6 3) 4294967296) (mod (+ c_ULTIMATE.start_main_~i~6 9) 4294967296) (mod (+ c_ULTIMATE.start_main_~i~6 4) 4294967296) (mod (+ c_ULTIMATE.start_main_~i~6 8) 4294967296) (mod (+ c_ULTIMATE.start_main_~i~6 7) 4294967296) (mod (+ c_ULTIMATE.start_main_~i~6 5) 4294967296) (mod (+ c_ULTIMATE.start_main_~i~6 11) 4294967296) c_ULTIMATE.start_main_~sn~6 (mod (+ c_ULTIMATE.start_main_~i~6 6) 4294967296) (mod (+ c_ULTIMATE.start_main_~i~6 1) 4294967296) (mod (+ c_ULTIMATE.start_main_~i~6 2) 4294967296)) 18446744073709551616))) is different from true [2018-12-03 18:08:20,346 WARN L854 $PredicateComparison]: unable to prove that (or (= 0 (mod (+ (mod c_ULTIMATE.start_main_~i~6 4294967296) (mod (+ c_ULTIMATE.start_main_~i~6 10) 4294967296) (mod (+ c_ULTIMATE.start_main_~i~6 9) 4294967296) (mod (+ c_ULTIMATE.start_main_~i~6 3) 4294967296) (mod (+ c_ULTIMATE.start_main_~i~6 12) 4294967296) (mod (+ c_ULTIMATE.start_main_~i~6 4) 4294967296) (mod (+ c_ULTIMATE.start_main_~i~6 8) 4294967296) (mod (+ c_ULTIMATE.start_main_~i~6 7) 4294967296) (mod (+ c_ULTIMATE.start_main_~i~6 5) 4294967296) (mod (+ c_ULTIMATE.start_main_~i~6 11) 4294967296) c_ULTIMATE.start_main_~sn~6 (mod (+ c_ULTIMATE.start_main_~i~6 6) 4294967296) (mod (+ c_ULTIMATE.start_main_~i~6 1) 4294967296) (mod (+ c_ULTIMATE.start_main_~i~6 2) 4294967296)) 18446744073709551616)) (forall ((ULTIMATE.start_main_~n~6 Int)) (let ((.cse2 (mod (+ c_ULTIMATE.start_main_~i~6 12) 4294967296)) (.cse4 (mod (+ c_ULTIMATE.start_main_~i~6 6) 4294967296)) (.cse3 (mod (+ c_ULTIMATE.start_main_~i~6 4) 4294967296)) (.cse5 (mod (+ c_ULTIMATE.start_main_~i~6 2) 4294967296)) (.cse0 (mod ULTIMATE.start_main_~n~6 4294967296)) (.cse1 (mod (+ c_ULTIMATE.start_main_~i~6 9) 4294967296))) (or (= (mod (div (mod (* .cse0 (+ .cse0 1)) 18446744073709551616) 2) 18446744073709551616) (mod (+ (mod c_ULTIMATE.start_main_~i~6 4294967296) (mod (+ c_ULTIMATE.start_main_~i~6 10) 4294967296) .cse1 (mod (+ c_ULTIMATE.start_main_~i~6 3) 4294967296) .cse2 .cse3 (mod (+ c_ULTIMATE.start_main_~i~6 8) 4294967296) (mod (+ c_ULTIMATE.start_main_~i~6 7) 4294967296) (mod (+ c_ULTIMATE.start_main_~i~6 5) 4294967296) (mod (+ c_ULTIMATE.start_main_~i~6 11) 4294967296) c_ULTIMATE.start_main_~sn~6 .cse4 (mod (+ c_ULTIMATE.start_main_~i~6 1) 4294967296) .cse5) 18446744073709551616)) (< .cse0 .cse2) (<= (mod (+ c_ULTIMATE.start_main_~i~6 13) 4294967296) .cse0) (< .cse0 .cse4) (< .cse0 .cse3) (< .cse0 .cse5) (< .cse0 .cse1))))) is different from true [2018-12-03 18:08:22,380 WARN L854 $PredicateComparison]: unable to prove that (or (forall ((ULTIMATE.start_main_~n~6 Int)) (let ((.cse3 (mod (+ c_ULTIMATE.start_main_~i~6 10) 4294967296)) (.cse1 (mod (+ c_ULTIMATE.start_main_~i~6 3) 4294967296)) (.cse2 (mod (+ c_ULTIMATE.start_main_~i~6 7) 4294967296)) (.cse4 (mod (+ c_ULTIMATE.start_main_~i~6 13) 4294967296)) (.cse0 (mod ULTIMATE.start_main_~n~6 4294967296)) (.cse5 (mod (+ c_ULTIMATE.start_main_~i~6 5) 4294967296))) (or (< .cse0 .cse1) (< .cse0 .cse2) (< .cse0 .cse3) (<= (mod (+ c_ULTIMATE.start_main_~i~6 14) 4294967296) .cse0) (= (mod (+ (mod c_ULTIMATE.start_main_~i~6 4294967296) .cse3 (mod (+ c_ULTIMATE.start_main_~i~6 9) 4294967296) (mod (+ c_ULTIMATE.start_main_~i~6 12) 4294967296) .cse1 (mod (+ c_ULTIMATE.start_main_~i~6 4) 4294967296) .cse4 (mod (+ c_ULTIMATE.start_main_~i~6 8) 4294967296) .cse2 .cse5 (mod (+ c_ULTIMATE.start_main_~i~6 11) 4294967296) c_ULTIMATE.start_main_~sn~6 (mod (+ c_ULTIMATE.start_main_~i~6 6) 4294967296) (mod (+ c_ULTIMATE.start_main_~i~6 1) 4294967296) (mod (+ c_ULTIMATE.start_main_~i~6 2) 4294967296)) 18446744073709551616) (mod (div (mod (* .cse0 (+ .cse0 1)) 18446744073709551616) 2) 18446744073709551616)) (< .cse0 .cse4) (< .cse0 .cse5)))) (= (mod (+ (mod c_ULTIMATE.start_main_~i~6 4294967296) (mod (+ c_ULTIMATE.start_main_~i~6 10) 4294967296) (mod (+ c_ULTIMATE.start_main_~i~6 9) 4294967296) (mod (+ c_ULTIMATE.start_main_~i~6 12) 4294967296) (mod (+ c_ULTIMATE.start_main_~i~6 3) 4294967296) (mod (+ c_ULTIMATE.start_main_~i~6 4) 4294967296) (mod (+ c_ULTIMATE.start_main_~i~6 13) 4294967296) (mod (+ c_ULTIMATE.start_main_~i~6 8) 4294967296) (mod (+ c_ULTIMATE.start_main_~i~6 7) 4294967296) (mod (+ c_ULTIMATE.start_main_~i~6 5) 4294967296) (mod (+ c_ULTIMATE.start_main_~i~6 11) 4294967296) c_ULTIMATE.start_main_~sn~6 (mod (+ c_ULTIMATE.start_main_~i~6 6) 4294967296) (mod (+ c_ULTIMATE.start_main_~i~6 1) 4294967296) (mod (+ c_ULTIMATE.start_main_~i~6 2) 4294967296)) 18446744073709551616) 0)) is different from true [2018-12-03 18:08:22,388 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 10 refuted. 5 times theorem prover too weak. 0 trivial. 90 not checked. [2018-12-03 18:08:22,407 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-03 18:08:22,407 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 31 [2018-12-03 18:08:22,407 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:08:22,408 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-12-03 18:08:22,408 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-12-03 18:08:22,409 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=145, Invalid=381, Unknown=16, NotChecked=450, Total=992 [2018-12-03 18:08:22,409 INFO L87 Difference]: Start difference. First operand 18 states and 18 transitions. Second operand 32 states. [2018-12-03 18:08:25,315 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse15 (mod (+ c_ULTIMATE.start_main_~i~6 2) 4294967296)) (.cse10 (mod c_ULTIMATE.start_main_~i~6 4294967296)) (.cse11 (mod (+ c_ULTIMATE.start_main_~i~6 3) 4294967296)) (.cse1 (mod c_ULTIMATE.start_main_~n~6 4294967296))) (let ((.cse8 (mod (div (mod (* .cse1 (+ .cse1 1)) 18446744073709551616) 2) 18446744073709551616)) (.cse0 (< .cse1 .cse11)) (.cse4 (< .cse1 .cse10)) (.cse7 (< .cse1 .cse15)) (.cse5 (mod (+ c_ULTIMATE.start_main_~i~6 9) 4294967296)) (.cse12 (mod (+ c_ULTIMATE.start_main_~i~6 4) 4294967296)) (.cse6 (mod (+ c_ULTIMATE.start_main_~i~6 8) 4294967296)) (.cse2 (mod (+ c_ULTIMATE.start_main_~i~6 7) 4294967296)) (.cse9 (mod (+ c_ULTIMATE.start_main_~i~6 5) 4294967296)) (.cse14 (mod (+ c_ULTIMATE.start_main_~i~6 6) 4294967296)) (.cse13 (mod (+ c_ULTIMATE.start_main_~i~6 1) 4294967296))) (and (let ((.cse3 (mod (+ .cse10 .cse2 .cse9 .cse11 .cse12 c_ULTIMATE.start_main_~sn~6 .cse13 .cse14 .cse6 .cse15) 18446744073709551616))) (or .cse0 (< .cse1 .cse2) (= .cse3 0) .cse4 (<= .cse5 .cse1) (< .cse1 .cse6) .cse7 (= .cse3 .cse8) (< .cse1 .cse9))) (let ((.cse16 (mod (+ .cse10 .cse11 c_ULTIMATE.start_main_~sn~6 .cse13 .cse15) 18446744073709551616))) (or (= .cse16 .cse8) (= .cse16 0) .cse0 .cse4 (<= .cse12 .cse1) .cse7)) (= c_ULTIMATE.start_main_~sn~6 0) (= c_ULTIMATE.start_main_~i~6 1) (or (= 0 (mod (+ .cse10 (mod (+ c_ULTIMATE.start_main_~i~6 10) 4294967296) .cse5 .cse11 (mod (+ c_ULTIMATE.start_main_~i~6 12) 4294967296) .cse12 .cse6 .cse2 .cse9 (mod (+ c_ULTIMATE.start_main_~i~6 11) 4294967296) c_ULTIMATE.start_main_~sn~6 .cse14 .cse13 .cse15) 18446744073709551616)) (forall ((ULTIMATE.start_main_~n~6 Int)) (let ((.cse19 (mod (+ c_ULTIMATE.start_main_~i~6 12) 4294967296)) (.cse21 (mod (+ c_ULTIMATE.start_main_~i~6 6) 4294967296)) (.cse20 (mod (+ c_ULTIMATE.start_main_~i~6 4) 4294967296)) (.cse22 (mod (+ c_ULTIMATE.start_main_~i~6 2) 4294967296)) (.cse17 (mod ULTIMATE.start_main_~n~6 4294967296)) (.cse18 (mod (+ c_ULTIMATE.start_main_~i~6 9) 4294967296))) (or (= (mod (div (mod (* .cse17 (+ .cse17 1)) 18446744073709551616) 2) 18446744073709551616) (mod (+ (mod c_ULTIMATE.start_main_~i~6 4294967296) (mod (+ c_ULTIMATE.start_main_~i~6 10) 4294967296) .cse18 (mod (+ c_ULTIMATE.start_main_~i~6 3) 4294967296) .cse19 .cse20 (mod (+ c_ULTIMATE.start_main_~i~6 8) 4294967296) (mod (+ c_ULTIMATE.start_main_~i~6 7) 4294967296) (mod (+ c_ULTIMATE.start_main_~i~6 5) 4294967296) (mod (+ c_ULTIMATE.start_main_~i~6 11) 4294967296) c_ULTIMATE.start_main_~sn~6 .cse21 (mod (+ c_ULTIMATE.start_main_~i~6 1) 4294967296) .cse22) 18446744073709551616)) (< .cse17 .cse19) (<= (mod (+ c_ULTIMATE.start_main_~i~6 13) 4294967296) .cse17) (< .cse17 .cse21) (< .cse17 .cse20) (< .cse17 .cse22) (< .cse17 .cse18)))))))) is different from true [2018-12-03 18:08:27,743 WARN L180 SmtUtils]: Spent 2.24 s on a formula simplification. DAG size of input: 93 DAG size of output: 21 [2018-12-03 18:08:28,730 WARN L180 SmtUtils]: Spent 326.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 22 [2018-12-03 18:08:35,048 WARN L180 SmtUtils]: Spent 3.60 s on a formula simplification. DAG size of input: 89 DAG size of output: 23 [2018-12-03 18:08:40,624 WARN L180 SmtUtils]: Spent 2.91 s on a formula simplification. DAG size of input: 89 DAG size of output: 23 [2018-12-03 18:08:43,002 WARN L180 SmtUtils]: Spent 781.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 23 [2018-12-03 18:08:47,096 WARN L180 SmtUtils]: Spent 204.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 23 [2018-12-03 18:08:51,671 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse15 (mod (+ c_ULTIMATE.start_main_~i~6 1) 4294967296)) (.cse17 (mod (+ c_ULTIMATE.start_main_~i~6 2) 4294967296)) (.cse12 (mod (+ c_ULTIMATE.start_main_~i~6 5) 4294967296)) (.cse16 (mod (+ c_ULTIMATE.start_main_~i~6 6) 4294967296)) (.cse10 (mod c_ULTIMATE.start_main_~i~6 4294967296)) (.cse13 (mod (+ c_ULTIMATE.start_main_~i~6 3) 4294967296)) (.cse14 (mod (+ c_ULTIMATE.start_main_~i~6 4) 4294967296)) (.cse5 (mod c_ULTIMATE.start_main_~n~6 4294967296)) (.cse11 (mod (+ c_ULTIMATE.start_main_~i~6 7) 4294967296))) (let ((.cse4 (mod (+ c_ULTIMATE.start_main_~i~6 9) 4294967296)) (.cse1 (< .cse5 .cse11)) (.cse6 (mod (+ c_ULTIMATE.start_main_~i~6 8) 4294967296)) (.cse23 (< .cse5 .cse14)) (.cse0 (< .cse5 .cse13)) (.cse3 (< .cse5 .cse10)) (.cse19 (< .cse5 .cse16)) (.cse9 (< .cse5 .cse12)) (.cse8 (mod (div (mod (* .cse5 (+ .cse5 1)) 18446744073709551616) 2) 18446744073709551616)) (.cse7 (< .cse5 .cse17)) (.cse21 (< .cse5 .cse15))) (and (let ((.cse2 (mod (+ .cse10 .cse11 .cse12 .cse13 .cse14 c_ULTIMATE.start_main_~sn~6 .cse15 .cse16 .cse6 .cse17) 18446744073709551616))) (or .cse0 .cse1 (= .cse2 0) .cse3 (<= .cse4 .cse5) (< .cse5 .cse6) .cse7 (= .cse2 .cse8) .cse9)) (let ((.cse18 (mod (+ .cse10 .cse13 c_ULTIMATE.start_main_~sn~6 .cse15 .cse17) 18446744073709551616))) (or (= .cse18 .cse8) (= .cse18 0) .cse0 .cse3 (<= .cse14 .cse5) .cse7)) (let ((.cse20 (mod (+ .cse10 .cse11 .cse12 .cse13 .cse4 .cse14 c_ULTIMATE.start_main_~sn~6 .cse16 .cse15 .cse6 .cse17) 18446744073709551616))) (or (<= (mod (+ c_ULTIMATE.start_main_~i~6 10) 4294967296) .cse5) .cse0 .cse19 (= .cse20 .cse8) .cse21 (< .cse5 .cse4) (= .cse20 0))) (let ((.cse22 (mod (+ .cse10 .cse12 .cse13 .cse14 c_ULTIMATE.start_main_~sn~6 .cse15 .cse17) 18446744073709551616))) (or (<= .cse16 .cse5) (= .cse8 .cse22) .cse3 .cse23 (= 0 .cse22) .cse7 .cse9)) (let ((.cse24 (mod (+ .cse10 .cse13 .cse14 c_ULTIMATE.start_main_~sn~6 .cse15 .cse17) 18446744073709551616))) (or .cse0 (= 0 .cse24) .cse23 (= .cse8 .cse24) .cse21 (<= .cse12 .cse5))) (let ((.cse25 (mod (+ .cse10 c_ULTIMATE.start_main_~sn~6 .cse15) 18446744073709551616))) (or (= .cse8 .cse25) (<= .cse17 .cse5) .cse3 .cse21 (= 0 .cse25))) (let ((.cse26 (mod (+ .cse10 .cse12 .cse11 .cse13 .cse14 c_ULTIMATE.start_main_~sn~6 .cse15 .cse16 .cse17) 18446744073709551616))) (or .cse1 (<= .cse6 .cse5) .cse19 (= .cse26 0) .cse23 (= .cse26 .cse8) .cse7 .cse21)) (let ((.cse27 (mod c_ULTIMATE.start_main_~sn~6 18446744073709551616))) (or (= .cse27 .cse8) (= .cse27 0) (<= .cse10 .cse5))) (let ((.cse28 (mod (+ .cse10 c_ULTIMATE.start_main_~sn~6) 18446744073709551616))) (or .cse3 (<= .cse15 .cse5) (= .cse8 .cse28) (= 0 .cse28))) (let ((.cse29 (mod (+ .cse10 .cse12 .cse13 .cse14 c_ULTIMATE.start_main_~sn~6 .cse16 .cse15 .cse17) 18446744073709551616))) (or (= .cse29 0) .cse0 .cse3 (<= .cse11 .cse5) (= .cse29 .cse8) .cse19 .cse21 .cse9)) (let ((.cse30 (mod (+ .cse10 c_ULTIMATE.start_main_~sn~6 .cse15 .cse17) 18446744073709551616))) (or (<= .cse13 .cse5) (= 0 .cse30) (= .cse8 .cse30) .cse7 .cse21))))) is different from true