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_compound_exp_cong.epf -i ../../../trunk/examples/programs/20170304-DifficultPathPrograms/sum02.i_3.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-c78c21b [2018-12-03 15:42:04,895 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-03 15:42:04,897 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-03 15:42:04,910 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-03 15:42:04,910 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-03 15:42:04,911 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-03 15:42:04,913 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-03 15:42:04,915 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-03 15:42:04,917 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-03 15:42:04,924 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-03 15:42:04,925 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-03 15:42:04,925 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-03 15:42:04,926 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-03 15:42:04,927 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-03 15:42:04,928 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-03 15:42:04,930 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-03 15:42:04,931 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-03 15:42:04,933 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-03 15:42:04,943 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-03 15:42:04,947 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-03 15:42:04,948 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-03 15:42:04,950 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-03 15:42:04,952 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-03 15:42:04,952 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-03 15:42:04,953 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-03 15:42:04,954 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-03 15:42:04,955 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-03 15:42:04,955 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-03 15:42:04,956 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-03 15:42:04,957 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-03 15:42:04,958 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-03 15:42:04,958 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-03 15:42:04,959 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-03 15:42:04,959 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-03 15:42:04,960 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-03 15:42:04,961 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-03 15:42:04,961 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/array-bench/reach_32bit_compound_exp_cong.epf [2018-12-03 15:42:04,978 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-03 15:42:04,978 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-03 15:42:04,980 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2018-12-03 15:42:04,980 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2018-12-03 15:42:04,980 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-03 15:42:04,981 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-03 15:42:04,981 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-03 15:42:04,981 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-03 15:42:04,981 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-03 15:42:04,982 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-03 15:42:04,983 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-03 15:42:04,983 INFO L133 SettingsManager]: * Abstract domain=ArrayDomain [2018-12-03 15:42:04,983 INFO L133 SettingsManager]: * Log string format=TERM [2018-12-03 15:42:04,983 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-03 15:42:04,984 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-03 15:42:04,984 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-03 15:42:04,986 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-03 15:42:04,987 INFO L133 SettingsManager]: * Use SBE=true [2018-12-03 15:42:04,987 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-03 15:42:04,987 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-03 15:42:04,987 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-03 15:42:04,988 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-03 15:42:04,988 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-03 15:42:04,988 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-03 15:42:04,988 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-03 15:42:04,989 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-03 15:42:04,989 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-03 15:42:04,989 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-03 15:42:04,989 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-03 15:42:04,990 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-03 15:42:04,990 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-03 15:42:04,990 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-03 15:42:04,990 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-03 15:42:04,991 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-03 15:42:04,991 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-03 15:42:04,991 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-03 15:42:04,991 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-03 15:42:04,991 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-03 15:42:04,992 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-03 15:42:04,992 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-03 15:42:04,992 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-12-03 15:42:05,041 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-03 15:42:05,053 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-03 15:42:05,057 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-03 15:42:05,058 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-12-03 15:42:05,059 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-12-03 15:42:05,060 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 15:42:05,060 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/sum02.i_3.bpl' [2018-12-03 15:42:05,100 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-03 15:42:05,102 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-12-03 15:42:05,103 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-03 15:42:05,103 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-03 15:42:05,103 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-03 15:42:05,124 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 03:42:05" (1/1) ... [2018-12-03 15:42:05,136 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 03:42:05" (1/1) ... [2018-12-03 15:42:05,148 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-03 15:42:05,149 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-03 15:42:05,149 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-03 15:42:05,149 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-03 15:42:05,161 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 03:42:05" (1/1) ... [2018-12-03 15:42:05,161 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 03:42:05" (1/1) ... [2018-12-03 15:42:05,162 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 03:42:05" (1/1) ... [2018-12-03 15:42:05,162 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 03:42:05" (1/1) ... [2018-12-03 15:42:05,166 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 03:42:05" (1/1) ... [2018-12-03 15:42:05,168 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 03:42:05" (1/1) ... [2018-12-03 15:42:05,169 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 03:42:05" (1/1) ... [2018-12-03 15:42:05,170 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-03 15:42:05,171 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-03 15:42:05,171 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-03 15:42:05,171 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-03 15:42:05,173 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 03:42:05" (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 15:42:05,240 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-03 15:42:05,241 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-03 15:42:05,523 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-03 15:42:05,524 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-12-03 15:42:05,524 INFO L202 PluginConnector]: Adding new model sum02.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 03:42:05 BoogieIcfgContainer [2018-12-03 15:42:05,524 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-03 15:42:05,525 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-03 15:42:05,525 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-03 15:42:05,529 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-03 15:42:05,530 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 03:42:05" (1/2) ... [2018-12-03 15:42:05,532 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d48bb9e and model type sum02.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.12 03:42:05, skipping insertion in model container [2018-12-03 15:42:05,532 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 03:42:05" (2/2) ... [2018-12-03 15:42:05,534 INFO L112 eAbstractionObserver]: Analyzing ICFG sum02.i_3.bpl [2018-12-03 15:42:05,545 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-03 15:42:05,556 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-03 15:42:05,574 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-03 15:42:05,617 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-03 15:42:05,617 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-03 15:42:05,617 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-03 15:42:05,618 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-03 15:42:05,618 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-03 15:42:05,618 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-03 15:42:05,618 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-03 15:42:05,618 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-03 15:42:05,637 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states. [2018-12-03 15:42:05,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-12-03 15:42:05,645 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:42:05,646 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2018-12-03 15:42:05,649 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:42:05,659 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:42:05,659 INFO L82 PathProgramCache]: Analyzing trace with hash 29955, now seen corresponding path program 1 times [2018-12-03 15:42:05,661 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:42:05,710 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:42:05,710 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:42:05,710 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:42:05,710 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:42:05,743 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-12-03 15:42:05,744 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-12-03 15:42:05,744 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 15:42:05,758 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:42:05,759 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_NO_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: null) [2018-12-03 15:42:05,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:42:05,786 INFO L193 CegarAbsIntRunner]: Skipping current iteration for AI because the path program does not contain any loops [2018-12-03 15:42:05,789 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:42:05,789 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:42:05,789 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 15:42:05,806 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:42:05,806 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:42:05,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:42:05,842 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:42:05,874 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 15:42:05,874 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:42:06,019 WARN L180 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 10 DAG size of output: 5 [2018-12-03 15:42:06,020 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 15:42:06,048 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-12-03 15:42:06,048 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 3 [2018-12-03 15:42:06,049 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 15:42:06,053 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 15:42:06,068 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 15:42:06,069 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-03 15:42:06,071 INFO L87 Difference]: Start difference. First operand 6 states. Second operand 3 states. [2018-12-03 15:42:06,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:42:06,110 INFO L93 Difference]: Finished difference Result 9 states and 10 transitions. [2018-12-03 15:42:06,111 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 15:42:06,112 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2018-12-03 15:42:06,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:42:06,124 INFO L225 Difference]: With dead ends: 9 [2018-12-03 15:42:06,125 INFO L226 Difference]: Without dead ends: 5 [2018-12-03 15:42:06,128 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 15:42:06,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5 states. [2018-12-03 15:42:06,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5 to 5. [2018-12-03 15:42:06,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-12-03 15:42:06,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 5 transitions. [2018-12-03 15:42:06,171 INFO L78 Accepts]: Start accepts. Automaton has 5 states and 5 transitions. Word has length 3 [2018-12-03 15:42:06,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:42:06,172 INFO L480 AbstractCegarLoop]: Abstraction has 5 states and 5 transitions. [2018-12-03 15:42:06,172 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 15:42:06,172 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states and 5 transitions. [2018-12-03 15:42:06,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-12-03 15:42:06,173 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:42:06,173 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-12-03 15:42:06,174 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:42:06,174 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:42:06,174 INFO L82 PathProgramCache]: Analyzing trace with hash 930412, now seen corresponding path program 1 times [2018-12-03 15:42:06,174 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:42:06,175 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:42:06,176 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:42:06,176 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:42:06,176 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:42:06,186 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-12-03 15:42:06,186 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-12-03 15:42:06,186 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 15:42:06,203 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:42:06,203 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_NO_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: null) [2018-12-03 15:42:06,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:42:06,239 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2018-12-03 15:42:06,241 INFO L205 CegarAbsIntRunner]: [0], [5], [7], [9] [2018-12-03 15:42:06,291 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 15:42:06,292 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 15:42:06,682 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 15:42:06,686 INFO L272 AbstractInterpreter]: Visited 4 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 15:42:06,732 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:42:06,732 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 15:42:06,732 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:42:06,732 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 15:42:06,748 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:42:06,749 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:42:06,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:42:06,774 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:42:06,871 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 15:42:06,871 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:42:07,045 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 15:42:07,071 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-03 15:42:07,071 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 5 [2018-12-03 15:42:07,072 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:42:07,073 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-03 15:42:07,073 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-03 15:42:07,073 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-03 15:42:07,075 INFO L87 Difference]: Start difference. First operand 5 states and 5 transitions. Second operand 6 states. [2018-12-03 15:42:07,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:42:07,149 INFO L93 Difference]: Finished difference Result 8 states and 8 transitions. [2018-12-03 15:42:07,150 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 15:42:07,150 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 4 [2018-12-03 15:42:07,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:42:07,151 INFO L225 Difference]: With dead ends: 8 [2018-12-03 15:42:07,151 INFO L226 Difference]: Without dead ends: 6 [2018-12-03 15:42:07,152 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-03 15:42:07,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6 states. [2018-12-03 15:42:07,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6 to 6. [2018-12-03 15:42:07,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-12-03 15:42:07,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 6 transitions. [2018-12-03 15:42:07,159 INFO L78 Accepts]: Start accepts. Automaton has 6 states and 6 transitions. Word has length 4 [2018-12-03 15:42:07,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:42:07,159 INFO L480 AbstractCegarLoop]: Abstraction has 6 states and 6 transitions. [2018-12-03 15:42:07,160 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-03 15:42:07,160 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 6 transitions. [2018-12-03 15:42:07,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-12-03 15:42:07,160 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:42:07,161 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1] [2018-12-03 15:42:07,161 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:42:07,161 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:42:07,162 INFO L82 PathProgramCache]: Analyzing trace with hash 28844579, now seen corresponding path program 2 times [2018-12-03 15:42:07,162 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:42:07,163 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:42:07,163 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:42:07,163 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:42:07,163 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:42:07,180 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-12-03 15:42:07,182 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-12-03 15:42:07,182 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 15:42:07,198 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:42:07,199 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_NO_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: null) [2018-12-03 15:42:07,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:42:07,231 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:42:07,231 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:42:07,232 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:42:07,232 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 15:42:07,241 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:42:07,241 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:42:07,276 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-12-03 15:42:07,277 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:42:07,279 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:42:07,555 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 15:42:07,555 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:42:09,819 WARN L180 SmtUtils]: Spent 2.19 s on a formula simplification. DAG size of input: 32 DAG size of output: 20 [2018-12-03 15:42:14,120 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 15:42:14,148 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-03 15:42:14,149 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 7 [2018-12-03 15:42:14,149 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:42:14,149 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-03 15:42:14,150 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-03 15:42:14,150 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=32, Unknown=2, NotChecked=0, Total=56 [2018-12-03 15:42:14,150 INFO L87 Difference]: Start difference. First operand 6 states and 6 transitions. Second operand 8 states. [2018-12-03 15:42:35,991 WARN L180 SmtUtils]: Spent 19.40 s on a formula simplification that was a NOOP. DAG size: 41 [2018-12-03 15:42:42,356 WARN L180 SmtUtils]: Spent 2.13 s on a formula simplification that was a NOOP. DAG size: 30 [2018-12-03 15:42:43,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:42:43,348 INFO L93 Difference]: Finished difference Result 12 states and 15 transitions. [2018-12-03 15:42:43,349 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-03 15:42:43,349 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2018-12-03 15:42:43,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:42:43,350 INFO L225 Difference]: With dead ends: 12 [2018-12-03 15:42:43,350 INFO L226 Difference]: Without dead ends: 10 [2018-12-03 15:42:43,351 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 34.6s TimeCoverageRelationStatistics Valid=38, Invalid=47, Unknown=5, NotChecked=0, Total=90 [2018-12-03 15:42:43,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2018-12-03 15:42:43,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2018-12-03 15:42:43,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-12-03 15:42:43,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2018-12-03 15:42:43,355 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 5 [2018-12-03 15:42:43,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:42:43,356 INFO L480 AbstractCegarLoop]: Abstraction has 10 states and 10 transitions. [2018-12-03 15:42:43,356 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-03 15:42:43,356 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2018-12-03 15:42:43,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-12-03 15:42:43,357 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:42:43,357 INFO L402 BasicCegarLoop]: trace histogram [6, 1, 1, 1] [2018-12-03 15:42:43,357 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:42:43,358 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:42:43,358 INFO L82 PathProgramCache]: Analyzing trace with hash 1242899555, now seen corresponding path program 3 times [2018-12-03 15:42:43,358 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:42:43,359 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:42:43,359 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:42:43,359 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:42:43,359 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:42:43,379 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-12-03 15:42:43,379 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-12-03 15:42:43,379 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 15:42:43,389 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:42:43,389 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_NO_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: null) [2018-12-03 15:42:43,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:42:43,453 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:42:43,453 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:42:43,453 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:42:43,453 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 15:42:43,463 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:42:43,464 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:42:43,567 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:42:43,567 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:42:43,570 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:42:43,923 WARN L180 SmtUtils]: Spent 223.00 ms on a formula simplification. DAG size of input: 14 DAG size of output: 12 [2018-12-03 15:42:44,136 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 15:42:44,136 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:42:46,318 WARN L180 SmtUtils]: Spent 2.12 s on a formula simplification. DAG size of input: 32 DAG size of output: 20 [2018-12-03 15:42:46,730 WARN L180 SmtUtils]: Spent 158.00 ms on a formula simplification that was a NOOP. DAG size: 27 [2018-12-03 15:42:51,338 WARN L180 SmtUtils]: Spent 4.45 s on a formula simplification. DAG size of input: 31 DAG size of output: 30 [2018-12-03 15:42:53,417 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 1) 4294967296))) (let ((.cse0 (mod (+ .cse3 .cse2 c_ULTIMATE.start_main_~sn~6 .cse4 (mod (+ c_ULTIMATE.start_main_~i~6 2) 4294967296)) 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 15:43:18,001 WARN L180 SmtUtils]: Spent 18.39 s on a formula simplification. DAG size of input: 38 DAG size of output: 37 [2018-12-03 15:43:42,499 WARN L180 SmtUtils]: Spent 6.13 s on a formula simplification that was a NOOP. DAG size: 43 [2018-12-03 15:43:42,501 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 11 refuted. 4 times theorem prover too weak. 0 trivial. 6 not checked. [2018-12-03 15:43:42,521 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-03 15:43:42,522 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 15 [2018-12-03 15:43:42,522 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:43:42,522 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-12-03 15:43:42,523 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-12-03 15:43:42,523 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=132, Unknown=11, NotChecked=26, Total=240 [2018-12-03 15:43:42,523 INFO L87 Difference]: Start difference. First operand 10 states and 10 transitions. Second operand 16 states. [2018-12-03 15:43:48,671 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse5 (mod (+ c_ULTIMATE.start_main_~i~6 2) 4294967296)) (.cse0 (mod c_ULTIMATE.start_main_~i~6 4294967296)) (.cse13 (mod c_ULTIMATE.start_main_~n~6 4294967296)) (.cse4 (mod (+ c_ULTIMATE.start_main_~i~6 1) 4294967296))) (let ((.cse15 (< .cse13 .cse4)) (.cse14 (< .cse13 .cse0)) (.cse11 (mod (div (mod (* .cse13 (+ .cse13 1)) 18446744073709551616) 2) 18446744073709551616)) (.cse17 (< .cse13 .cse5)) (.cse1 (mod (+ c_ULTIMATE.start_main_~i~6 5) 4294967296)) (.cse2 (mod (+ c_ULTIMATE.start_main_~i~6 3) 4294967296)) (.cse3 (mod (+ c_ULTIMATE.start_main_~i~6 4) 4294967296))) (and (or (= 0 (mod (+ .cse0 .cse1 .cse2 .cse3 c_ULTIMATE.start_main_~sn~6 .cse4 .cse5) 18446744073709551616)) (forall ((ULTIMATE.start_main_~n~6 Int)) (let ((.cse7 (mod (+ c_ULTIMATE.start_main_~i~6 3) 4294967296)) (.cse8 (mod c_ULTIMATE.start_main_~i~6 4294967296)) (.cse10 (mod (+ c_ULTIMATE.start_main_~i~6 1) 4294967296)) (.cse6 (mod ULTIMATE.start_main_~n~6 4294967296)) (.cse9 (mod (+ c_ULTIMATE.start_main_~i~6 5) 4294967296))) (or (<= (mod (+ c_ULTIMATE.start_main_~i~6 6) 4294967296) .cse6) (< .cse6 .cse7) (= (mod (div (mod (* .cse6 (+ .cse6 1)) 18446744073709551616) 2) 18446744073709551616) (mod (+ .cse8 .cse9 .cse7 (mod (+ c_ULTIMATE.start_main_~i~6 4) 4294967296) c_ULTIMATE.start_main_~sn~6 .cse10 (mod (+ c_ULTIMATE.start_main_~i~6 2) 4294967296)) 18446744073709551616)) (< .cse6 .cse8) (< .cse6 .cse10) (< .cse6 .cse9))))) (let ((.cse12 (mod (+ .cse0 c_ULTIMATE.start_main_~sn~6 .cse4) 18446744073709551616))) (or (= .cse11 .cse12) (<= .cse5 .cse13) .cse14 .cse15 (= 0 .cse12))) (let ((.cse16 (mod (+ .cse0 c_ULTIMATE.start_main_~sn~6 .cse4 .cse5) 18446744073709551616))) (or (<= .cse2 .cse13) (= 0 .cse16) .cse14 (= .cse11 .cse16) .cse17)) (let ((.cse18 (mod (+ .cse0 .cse2 c_ULTIMATE.start_main_~sn~6 .cse4 .cse5) 18446744073709551616))) (or (= .cse18 .cse11) (= .cse18 0) (< .cse13 .cse2) .cse14 (<= .cse3 .cse13) .cse15)) (let ((.cse19 (mod c_ULTIMATE.start_main_~sn~6 18446744073709551616))) (or (= .cse19 .cse11) (= .cse19 0) (<= .cse0 .cse13))) (let ((.cse20 (mod (+ .cse0 c_ULTIMATE.start_main_~sn~6) 18446744073709551616))) (or .cse14 (<= .cse4 .cse13) (= .cse11 .cse20) (= 0 .cse20))) (let ((.cse21 (mod (+ .cse0 .cse2 .cse3 c_ULTIMATE.start_main_~sn~6 .cse4 .cse5) 18446744073709551616))) (or (= 0 .cse21) .cse14 (< .cse13 .cse3) (= .cse11 .cse21) .cse17 (<= .cse1 .cse13)))))) is different from false [2018-12-03 15:43:50,701 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse5 (mod (+ c_ULTIMATE.start_main_~i~6 2) 4294967296)) (.cse0 (mod c_ULTIMATE.start_main_~i~6 4294967296)) (.cse13 (mod c_ULTIMATE.start_main_~n~6 4294967296)) (.cse4 (mod (+ c_ULTIMATE.start_main_~i~6 1) 4294967296))) (let ((.cse15 (< .cse13 .cse4)) (.cse14 (< .cse13 .cse0)) (.cse11 (mod (div (mod (* .cse13 (+ .cse13 1)) 18446744073709551616) 2) 18446744073709551616)) (.cse17 (< .cse13 .cse5)) (.cse1 (mod (+ c_ULTIMATE.start_main_~i~6 5) 4294967296)) (.cse2 (mod (+ c_ULTIMATE.start_main_~i~6 3) 4294967296)) (.cse3 (mod (+ c_ULTIMATE.start_main_~i~6 4) 4294967296))) (and (or (= 0 (mod (+ .cse0 .cse1 .cse2 .cse3 c_ULTIMATE.start_main_~sn~6 .cse4 .cse5) 18446744073709551616)) (forall ((ULTIMATE.start_main_~n~6 Int)) (let ((.cse7 (mod (+ c_ULTIMATE.start_main_~i~6 3) 4294967296)) (.cse8 (mod c_ULTIMATE.start_main_~i~6 4294967296)) (.cse10 (mod (+ c_ULTIMATE.start_main_~i~6 1) 4294967296)) (.cse6 (mod ULTIMATE.start_main_~n~6 4294967296)) (.cse9 (mod (+ c_ULTIMATE.start_main_~i~6 5) 4294967296))) (or (<= (mod (+ c_ULTIMATE.start_main_~i~6 6) 4294967296) .cse6) (< .cse6 .cse7) (= (mod (div (mod (* .cse6 (+ .cse6 1)) 18446744073709551616) 2) 18446744073709551616) (mod (+ .cse8 .cse9 .cse7 (mod (+ c_ULTIMATE.start_main_~i~6 4) 4294967296) c_ULTIMATE.start_main_~sn~6 .cse10 (mod (+ c_ULTIMATE.start_main_~i~6 2) 4294967296)) 18446744073709551616)) (< .cse6 .cse8) (< .cse6 .cse10) (< .cse6 .cse9))))) (let ((.cse12 (mod (+ .cse0 c_ULTIMATE.start_main_~sn~6 .cse4) 18446744073709551616))) (or (= .cse11 .cse12) (<= .cse5 .cse13) .cse14 .cse15 (= 0 .cse12))) (let ((.cse16 (mod (+ .cse0 c_ULTIMATE.start_main_~sn~6 .cse4 .cse5) 18446744073709551616))) (or (<= .cse2 .cse13) (= 0 .cse16) .cse14 (= .cse11 .cse16) .cse17)) (let ((.cse18 (mod (+ .cse0 .cse2 c_ULTIMATE.start_main_~sn~6 .cse4 .cse5) 18446744073709551616))) (or (= .cse18 .cse11) (= .cse18 0) (< .cse13 .cse2) .cse14 (<= .cse3 .cse13) .cse15)) (let ((.cse19 (mod c_ULTIMATE.start_main_~sn~6 18446744073709551616))) (or (= .cse19 .cse11) (= .cse19 0) (<= .cse0 .cse13))) (let ((.cse20 (mod (+ .cse0 c_ULTIMATE.start_main_~sn~6) 18446744073709551616))) (or .cse14 (<= .cse4 .cse13) (= .cse11 .cse20) (= 0 .cse20))) (let ((.cse21 (mod (+ .cse0 .cse2 .cse3 c_ULTIMATE.start_main_~sn~6 .cse4 .cse5) 18446744073709551616))) (or (= 0 .cse21) .cse14 (< .cse13 .cse3) (= .cse11 .cse21) .cse17 (<= .cse1 .cse13)))))) is different from true [2018-12-03 15:44:57,969 WARN L180 SmtUtils]: Spent 1.04 m on a formula simplification that was a NOOP. DAG size: 69 [2018-12-03 15:45:48,789 WARN L180 SmtUtils]: Spent 40.00 s on a formula simplification that was a NOOP. DAG size: 59 [2018-12-03 15:46:09,296 WARN L180 SmtUtils]: Spent 9.42 s on a formula simplification that was a NOOP. DAG size: 49 [2018-12-03 15:46:34,899 WARN L180 SmtUtils]: Spent 7.38 s on a formula simplification that was a NOOP. DAG size: 39 [2018-12-03 15:46:44,331 WARN L180 SmtUtils]: Spent 169.00 ms on a formula simplification that was a NOOP. DAG size: 30 [2018-12-03 15:46:50,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:46:50,651 INFO L93 Difference]: Finished difference Result 20 states and 27 transitions. [2018-12-03 15:46:50,654 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-12-03 15:46:50,654 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 9 [2018-12-03 15:46:50,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:46:50,655 INFO L225 Difference]: With dead ends: 20 [2018-12-03 15:46:50,655 INFO L226 Difference]: Without dead ends: 18 [2018-12-03 15:46:50,658 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 2 SyntacticMatches, 6 SemanticMatches, 20 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 222.6s TimeCoverageRelationStatistics Valid=146, Invalid=214, Unknown=28, NotChecked=74, Total=462 [2018-12-03 15:46:50,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2018-12-03 15:46:50,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2018-12-03 15:46:50,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-12-03 15:46:50,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2018-12-03 15:46:50,666 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 9 [2018-12-03 15:46:50,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:46:50,666 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions. [2018-12-03 15:46:50,666 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-12-03 15:46:50,666 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2018-12-03 15:46:50,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-12-03 15:46:50,667 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:46:50,667 INFO L402 BasicCegarLoop]: trace histogram [14, 1, 1, 1] [2018-12-03 15:46:50,667 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:46:50,668 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:46:50,668 INFO L82 PathProgramCache]: Analyzing trace with hash 1895680227, now seen corresponding path program 4 times [2018-12-03 15:46:50,668 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:46:50,669 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:46:50,669 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:46:50,669 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:46:50,669 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:46:50,695 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-12-03 15:46:50,696 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-12-03 15:46:50,696 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 15:46:50,709 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:46:50,710 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_NO_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: null) [2018-12-03 15:46:51,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:46:51,052 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:46:51,052 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:46:51,052 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:46:51,052 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 15:46:51,068 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:46:51,069 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:46:53,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:46:53,200 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:46:53,632 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 15:46:53,632 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:46:55,830 WARN L180 SmtUtils]: Spent 2.10 s on a formula simplification. DAG size of input: 32 DAG size of output: 20 [2018-12-03 15:46:57,556 WARN L180 SmtUtils]: Spent 141.00 ms on a formula simplification that was a NOOP. DAG size: 30 [2018-12-03 15:47:07,788 WARN L180 SmtUtils]: Spent 7.78 s on a formula simplification. DAG size of input: 34 DAG size of output: 33 [2018-12-03 15:47:13,648 WARN L180 SmtUtils]: Spent 534.00 ms on a formula simplification that was a NOOP. DAG size: 36 [2018-12-03 15:47:42,623 WARN L180 SmtUtils]: Spent 15.96 s on a formula simplification. DAG size of input: 40 DAG size of output: 39 [2018-12-03 15:47:44,632 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (mod c_ULTIMATE.start_main_~i~6 4294967296)) (.cse3 (mod (+ c_ULTIMATE.start_main_~i~6 6) 4294967296)) (.cse4 (mod (+ c_ULTIMATE.start_main_~i~6 1) 4294967296))) (let ((.cse0 (mod (+ .cse2 (mod (+ c_ULTIMATE.start_main_~i~6 5) 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 .cse3 .cse4 (mod (+ c_ULTIMATE.start_main_~i~6 2) 4294967296)) 18446744073709551616)) (.cse1 (mod c_ULTIMATE.start_main_~n~6 4294967296))) (or (= .cse0 0) (< .cse1 .cse2) (<= (mod (+ c_ULTIMATE.start_main_~i~6 7) 4294967296) .cse1) (= .cse0 (mod (div (mod (* .cse1 (+ .cse1 1)) 18446744073709551616) 2) 18446744073709551616)) (< .cse1 .cse3) (< .cse1 .cse4)))) is different from true [2018-12-03 15:48:13,042 WARN L180 SmtUtils]: Spent 11.77 s on a formula simplification that was a NOOP. DAG size: 46 [2018-12-03 15:48:15,095 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (mod c_ULTIMATE.start_main_~i~6 4294967296)) (.cse1 (mod (+ c_ULTIMATE.start_main_~i~6 3) 4294967296)) (.cse4 (mod (+ c_ULTIMATE.start_main_~i~6 8) 4294967296)) (.cse5 (mod (+ c_ULTIMATE.start_main_~i~6 2) 4294967296))) (let ((.cse2 (mod (+ .cse3 (mod (+ c_ULTIMATE.start_main_~i~6 7) 4294967296) (mod (+ c_ULTIMATE.start_main_~i~6 5) 4294967296) .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) .cse4 .cse5) 18446744073709551616)) (.cse0 (mod c_ULTIMATE.start_main_~n~6 4294967296))) (or (< .cse0 .cse1) (= .cse2 0) (< .cse0 .cse3) (<= (mod (+ c_ULTIMATE.start_main_~i~6 9) 4294967296) .cse0) (< .cse0 .cse4) (< .cse0 .cse5) (= .cse2 (mod (div (mod (* .cse0 (+ .cse0 1)) 18446744073709551616) 2) 18446744073709551616))))) is different from true [2018-12-03 15:48:17,127 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (mod (+ c_ULTIMATE.start_main_~i~6 3) 4294967296)) (.cse5 (mod (+ c_ULTIMATE.start_main_~i~6 9) 4294967296)) (.cse3 (mod (+ c_ULTIMATE.start_main_~i~6 4) 4294967296)) (.cse4 (mod (+ c_ULTIMATE.start_main_~i~6 1) 4294967296))) (let ((.cse0 (mod c_ULTIMATE.start_main_~n~6 4294967296)) (.cse2 (mod (+ (mod c_ULTIMATE.start_main_~i~6 4294967296) (mod (+ c_ULTIMATE.start_main_~i~6 7) 4294967296) (mod (+ c_ULTIMATE.start_main_~i~6 5) 4294967296) .cse1 .cse5 .cse3 c_ULTIMATE.start_main_~sn~6 (mod (+ c_ULTIMATE.start_main_~i~6 6) 4294967296) .cse4 (mod (+ c_ULTIMATE.start_main_~i~6 8) 4294967296) (mod (+ c_ULTIMATE.start_main_~i~6 2) 4294967296)) 18446744073709551616))) (or (<= (mod (+ c_ULTIMATE.start_main_~i~6 10) 4294967296) .cse0) (< .cse0 .cse1) (= .cse2 (mod (div (mod (* .cse0 (+ .cse0 1)) 18446744073709551616) 2) 18446744073709551616)) (< .cse0 .cse3) (< .cse0 .cse4) (< .cse0 .cse5) (= .cse2 0)))) is different from true [2018-12-03 15:48:19,259 WARN L854 $PredicateComparison]: unable to prove that (or (forall ((ULTIMATE.start_main_~n~6 Int)) (let ((.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)) (.cse4 (mod (+ c_ULTIMATE.start_main_~i~6 2) 4294967296)) (.cse5 (mod ULTIMATE.start_main_~n~6 4294967296)) (.cse2 (mod (+ c_ULTIMATE.start_main_~i~6 5) 4294967296))) (or (= (mod (+ .cse0 .cse1 .cse2 (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) .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 .cse0) (<= (mod (+ c_ULTIMATE.start_main_~i~6 11) 4294967296) .cse5) (< .cse5 .cse3) (< .cse5 .cse1) (< .cse5 .cse4) (< .cse5 .cse2)))) (= (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 15:49:12,246 WARN L180 SmtUtils]: Spent 12.13 s on a formula simplification that was a NOOP. DAG size: 62 [2018-12-03 15:49:14,270 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 ((.cse1 (mod (+ c_ULTIMATE.start_main_~i~6 12) 4294967296)) (.cse3 (mod (+ c_ULTIMATE.start_main_~i~6 7) 4294967296)) (.cse4 (mod (+ c_ULTIMATE.start_main_~i~6 6) 4294967296)) (.cse2 (mod (+ c_ULTIMATE.start_main_~i~6 4) 4294967296)) (.cse0 (mod ULTIMATE.start_main_~n~6 4294967296)) (.cse5 (mod (+ c_ULTIMATE.start_main_~i~6 2) 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) (mod (+ c_ULTIMATE.start_main_~i~6 9) 4294967296) (mod (+ c_ULTIMATE.start_main_~i~6 3) 4294967296) .cse1 .cse2 (mod (+ c_ULTIMATE.start_main_~i~6 8) 4294967296) .cse3 (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 .cse1) (< .cse0 .cse3) (<= (mod (+ c_ULTIMATE.start_main_~i~6 13) 4294967296) .cse0) (< .cse0 .cse4) (< .cse0 .cse2) (< .cse0 .cse5))))) is different from true [2018-12-03 15:49:16,304 WARN L854 $PredicateComparison]: unable to prove that (or (forall ((ULTIMATE.start_main_~n~6 Int)) (let ((.cse1 (mod (+ c_ULTIMATE.start_main_~i~6 3) 4294967296)) (.cse3 (mod (+ c_ULTIMATE.start_main_~i~6 8) 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) (<= (mod (+ c_ULTIMATE.start_main_~i~6 14) 4294967296) .cse0) (< .cse0 .cse3) (= (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) .cse1 (mod (+ c_ULTIMATE.start_main_~i~6 4) 4294967296) .cse4 .cse3 .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 15:49:16,311 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 17 refuted. 19 times theorem prover too weak. 0 trivial. 69 not checked. [2018-12-03 15:49:16,331 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-03 15:49:16,332 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 31 [2018-12-03 15:49:16,332 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:49:16,332 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-12-03 15:49:16,332 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-12-03 15:49:16,333 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=444, Unknown=40, NotChecked=318, Total=992 [2018-12-03 15:49:16,333 INFO L87 Difference]: Start difference. First operand 18 states and 18 transitions. Second operand 32 states. [2018-12-03 15:49:21,558 WARN L180 SmtUtils]: Spent 839.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 21 [2018-12-03 15:49:26,345 WARN L180 SmtUtils]: Spent 800.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 22 [2018-12-03 15:49:29,837 WARN L180 SmtUtils]: Spent 2.16 s on a formula simplification. DAG size of input: 91 DAG size of output: 23 [2018-12-03 15:49:37,602 WARN L180 SmtUtils]: Spent 2.32 s on a formula simplification. DAG size of input: 92 DAG size of output: 23 [2018-12-03 15:49:46,712 WARN L180 SmtUtils]: Spent 6.15 s on a formula simplification. DAG size of input: 92 DAG size of output: 23 [2018-12-03 15:49:52,906 WARN L180 SmtUtils]: Spent 2.14 s on a formula simplification. DAG size of input: 93 DAG size of output: 23 [2018-12-03 15:49:57,773 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse9 (mod (+ c_ULTIMATE.start_main_~i~6 1) 4294967296)) (.cse10 (mod (+ c_ULTIMATE.start_main_~i~6 2) 4294967296)) (.cse6 (mod c_ULTIMATE.start_main_~i~6 4294967296)) (.cse7 (mod (+ c_ULTIMATE.start_main_~i~6 3) 4294967296)) (.cse1 (mod c_ULTIMATE.start_main_~n~6 4294967296)) (.cse8 (mod (+ c_ULTIMATE.start_main_~i~6 4) 4294967296))) (let ((.cse19 (< .cse1 .cse8)) (.cse16 (mod (+ c_ULTIMATE.start_main_~i~6 10) 4294967296)) (.cse17 (< .cse1 .cse7)) (.cse20 (mod (+ c_ULTIMATE.start_main_~i~6 9) 4294967296)) (.cse11 (mod (+ c_ULTIMATE.start_main_~i~6 7) 4294967296)) (.cse5 (mod (+ c_ULTIMATE.start_main_~i~6 5) 4294967296)) (.cse0 (mod (+ c_ULTIMATE.start_main_~i~6 6) 4294967296)) (.cse12 (mod (+ c_ULTIMATE.start_main_~i~6 8) 4294967296)) (.cse4 (< .cse1 .cse6)) (.cse2 (mod (div (mod (* .cse1 (+ .cse1 1)) 18446744073709551616) 2) 18446744073709551616)) (.cse14 (< .cse1 .cse10)) (.cse15 (< .cse1 .cse9))) (and (let ((.cse3 (mod (+ .cse6 .cse5 .cse7 .cse8 c_ULTIMATE.start_main_~sn~6 .cse9 .cse10) 18446744073709551616))) (or (<= .cse0 .cse1) (= .cse2 .cse3) .cse4 (= 0 .cse3) (< .cse1 .cse5))) (let ((.cse13 (mod (+ .cse6 .cse5 .cse11 .cse7 .cse8 c_ULTIMATE.start_main_~sn~6 .cse9 .cse0 .cse10) 18446744073709551616))) (or (< .cse1 .cse11) (<= .cse12 .cse1) (= .cse13 0) (= .cse13 .cse2) .cse14 .cse15)) (let ((.cse18 (mod (+ .cse6 .cse11 .cse5 .cse7 .cse20 .cse8 c_ULTIMATE.start_main_~sn~6 .cse0 .cse9 .cse12 .cse10) 18446744073709551616))) (or (<= .cse16 .cse1) .cse17 (= .cse18 .cse2) .cse19 .cse15 (< .cse1 .cse20) (= .cse18 0))) (or (forall ((ULTIMATE.start_main_~n~6 Int)) (let ((.cse23 (mod (+ c_ULTIMATE.start_main_~i~6 3) 4294967296)) (.cse22 (mod (+ c_ULTIMATE.start_main_~i~6 11) 4294967296)) (.cse24 (mod (+ c_ULTIMATE.start_main_~i~6 6) 4294967296)) (.cse25 (mod (+ c_ULTIMATE.start_main_~i~6 1) 4294967296)) (.cse21 (mod ULTIMATE.start_main_~n~6 4294967296)) (.cse26 (mod (+ c_ULTIMATE.start_main_~i~6 5) 4294967296))) (or (< .cse21 .cse22) (< .cse21 .cse23) (< .cse21 .cse24) (<= (mod (+ c_ULTIMATE.start_main_~i~6 12) 4294967296) .cse21) (< .cse21 .cse25) (= (mod (div (mod (* .cse21 (+ .cse21 1)) 18446744073709551616) 2) 18446744073709551616) (mod (+ (mod c_ULTIMATE.start_main_~i~6 4294967296) (mod (+ c_ULTIMATE.start_main_~i~6 10) 4294967296) .cse23 (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) .cse26 .cse22 c_ULTIMATE.start_main_~sn~6 .cse24 .cse25 (mod (+ c_ULTIMATE.start_main_~i~6 2) 4294967296)) 18446744073709551616)) (< .cse21 .cse26)))) (= 0 (mod (+ .cse6 .cse16 .cse7 .cse20 .cse8 .cse12 .cse11 .cse5 (mod (+ c_ULTIMATE.start_main_~i~6 11) 4294967296) c_ULTIMATE.start_main_~sn~6 .cse0 .cse9 .cse10) 18446744073709551616))) (let ((.cse27 (mod (+ .cse6 .cse7 .cse8 c_ULTIMATE.start_main_~sn~6 .cse9 .cse10) 18446744073709551616))) (or (= 0 .cse27) .cse19 (= .cse2 .cse27) .cse15 (<= .cse5 .cse1))) (or (forall ((ULTIMATE.start_main_~n~6 Int)) (let ((.cse28 (mod c_ULTIMATE.start_main_~i~6 4294967296)) (.cse31 (mod (+ c_ULTIMATE.start_main_~i~6 4) 4294967296)) (.cse29 (mod (+ c_ULTIMATE.start_main_~i~6 10) 4294967296)) (.cse32 (mod (+ c_ULTIMATE.start_main_~i~6 2) 4294967296)) (.cse33 (mod ULTIMATE.start_main_~n~6 4294967296)) (.cse30 (mod (+ c_ULTIMATE.start_main_~i~6 5) 4294967296))) (or (= (mod (+ .cse28 .cse29 .cse30 (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) .cse31 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) .cse32) 18446744073709551616) (mod (div (mod (* .cse33 (+ .cse33 1)) 18446744073709551616) 2) 18446744073709551616)) (< .cse33 .cse28) (<= (mod (+ c_ULTIMATE.start_main_~i~6 11) 4294967296) .cse33) (< .cse33 .cse31) (< .cse33 .cse29) (< .cse33 .cse32) (< .cse33 .cse30)))) (= (mod (+ .cse6 .cse16 .cse5 .cse11 .cse20 .cse7 .cse8 c_ULTIMATE.start_main_~sn~6 .cse0 .cse9 .cse12 .cse10) 18446744073709551616) 0)) (let ((.cse34 (mod (+ .cse6 c_ULTIMATE.start_main_~sn~6 .cse9) 18446744073709551616))) (or (= .cse2 .cse34) (<= .cse10 .cse1) .cse4 .cse15 (= 0 .cse34))) (let ((.cse35 (mod (+ .cse6 .cse7 c_ULTIMATE.start_main_~sn~6 .cse9 .cse10) 18446744073709551616))) (or (= .cse35 .cse2) (= .cse35 0) .cse17 .cse4 (<= .cse8 .cse1))) (let ((.cse36 (mod (+ .cse6 .cse5 .cse7 .cse8 c_ULTIMATE.start_main_~sn~6 .cse0 .cse9 .cse10) 18446744073709551616))) (or (= .cse36 0) .cse4 (<= .cse11 .cse1) (= .cse36 .cse2) (< .cse1 .cse0) .cse15)) (let ((.cse37 (mod c_ULTIMATE.start_main_~sn~6 18446744073709551616))) (or (= .cse37 .cse2) (= .cse37 0) (<= .cse6 .cse1))) (let ((.cse38 (mod (+ .cse6 .cse11 .cse5 .cse7 .cse8 c_ULTIMATE.start_main_~sn~6 .cse9 .cse0 .cse12 .cse10) 18446744073709551616))) (or .cse17 (= .cse38 0) .cse4 (<= .cse20 .cse1) (< .cse1 .cse12) .cse14 (= .cse38 .cse2))) (let ((.cse39 (mod (+ .cse6 c_ULTIMATE.start_main_~sn~6) 18446744073709551616))) (or .cse4 (<= .cse9 .cse1) (= .cse2 .cse39) (= 0 .cse39))) (let ((.cse40 (mod (+ .cse6 c_ULTIMATE.start_main_~sn~6 .cse9 .cse10) 18446744073709551616))) (or (<= .cse7 .cse1) (= 0 .cse40) (= .cse2 .cse40) .cse14 .cse15))))) is different from false [2018-12-03 15:49:59,795 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse9 (mod (+ c_ULTIMATE.start_main_~i~6 1) 4294967296)) (.cse10 (mod (+ c_ULTIMATE.start_main_~i~6 2) 4294967296)) (.cse6 (mod c_ULTIMATE.start_main_~i~6 4294967296)) (.cse7 (mod (+ c_ULTIMATE.start_main_~i~6 3) 4294967296)) (.cse1 (mod c_ULTIMATE.start_main_~n~6 4294967296)) (.cse8 (mod (+ c_ULTIMATE.start_main_~i~6 4) 4294967296))) (let ((.cse19 (< .cse1 .cse8)) (.cse16 (mod (+ c_ULTIMATE.start_main_~i~6 10) 4294967296)) (.cse17 (< .cse1 .cse7)) (.cse20 (mod (+ c_ULTIMATE.start_main_~i~6 9) 4294967296)) (.cse11 (mod (+ c_ULTIMATE.start_main_~i~6 7) 4294967296)) (.cse5 (mod (+ c_ULTIMATE.start_main_~i~6 5) 4294967296)) (.cse0 (mod (+ c_ULTIMATE.start_main_~i~6 6) 4294967296)) (.cse12 (mod (+ c_ULTIMATE.start_main_~i~6 8) 4294967296)) (.cse4 (< .cse1 .cse6)) (.cse2 (mod (div (mod (* .cse1 (+ .cse1 1)) 18446744073709551616) 2) 18446744073709551616)) (.cse14 (< .cse1 .cse10)) (.cse15 (< .cse1 .cse9))) (and (let ((.cse3 (mod (+ .cse6 .cse5 .cse7 .cse8 c_ULTIMATE.start_main_~sn~6 .cse9 .cse10) 18446744073709551616))) (or (<= .cse0 .cse1) (= .cse2 .cse3) .cse4 (= 0 .cse3) (< .cse1 .cse5))) (let ((.cse13 (mod (+ .cse6 .cse5 .cse11 .cse7 .cse8 c_ULTIMATE.start_main_~sn~6 .cse9 .cse0 .cse10) 18446744073709551616))) (or (< .cse1 .cse11) (<= .cse12 .cse1) (= .cse13 0) (= .cse13 .cse2) .cse14 .cse15)) (let ((.cse18 (mod (+ .cse6 .cse11 .cse5 .cse7 .cse20 .cse8 c_ULTIMATE.start_main_~sn~6 .cse0 .cse9 .cse12 .cse10) 18446744073709551616))) (or (<= .cse16 .cse1) .cse17 (= .cse18 .cse2) .cse19 .cse15 (< .cse1 .cse20) (= .cse18 0))) (or (forall ((ULTIMATE.start_main_~n~6 Int)) (let ((.cse23 (mod (+ c_ULTIMATE.start_main_~i~6 3) 4294967296)) (.cse22 (mod (+ c_ULTIMATE.start_main_~i~6 11) 4294967296)) (.cse24 (mod (+ c_ULTIMATE.start_main_~i~6 6) 4294967296)) (.cse25 (mod (+ c_ULTIMATE.start_main_~i~6 1) 4294967296)) (.cse21 (mod ULTIMATE.start_main_~n~6 4294967296)) (.cse26 (mod (+ c_ULTIMATE.start_main_~i~6 5) 4294967296))) (or (< .cse21 .cse22) (< .cse21 .cse23) (< .cse21 .cse24) (<= (mod (+ c_ULTIMATE.start_main_~i~6 12) 4294967296) .cse21) (< .cse21 .cse25) (= (mod (div (mod (* .cse21 (+ .cse21 1)) 18446744073709551616) 2) 18446744073709551616) (mod (+ (mod c_ULTIMATE.start_main_~i~6 4294967296) (mod (+ c_ULTIMATE.start_main_~i~6 10) 4294967296) .cse23 (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) .cse26 .cse22 c_ULTIMATE.start_main_~sn~6 .cse24 .cse25 (mod (+ c_ULTIMATE.start_main_~i~6 2) 4294967296)) 18446744073709551616)) (< .cse21 .cse26)))) (= 0 (mod (+ .cse6 .cse16 .cse7 .cse20 .cse8 .cse12 .cse11 .cse5 (mod (+ c_ULTIMATE.start_main_~i~6 11) 4294967296) c_ULTIMATE.start_main_~sn~6 .cse0 .cse9 .cse10) 18446744073709551616))) (let ((.cse27 (mod (+ .cse6 .cse7 .cse8 c_ULTIMATE.start_main_~sn~6 .cse9 .cse10) 18446744073709551616))) (or (= 0 .cse27) .cse19 (= .cse2 .cse27) .cse15 (<= .cse5 .cse1))) (or (forall ((ULTIMATE.start_main_~n~6 Int)) (let ((.cse28 (mod c_ULTIMATE.start_main_~i~6 4294967296)) (.cse31 (mod (+ c_ULTIMATE.start_main_~i~6 4) 4294967296)) (.cse29 (mod (+ c_ULTIMATE.start_main_~i~6 10) 4294967296)) (.cse32 (mod (+ c_ULTIMATE.start_main_~i~6 2) 4294967296)) (.cse33 (mod ULTIMATE.start_main_~n~6 4294967296)) (.cse30 (mod (+ c_ULTIMATE.start_main_~i~6 5) 4294967296))) (or (= (mod (+ .cse28 .cse29 .cse30 (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) .cse31 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) .cse32) 18446744073709551616) (mod (div (mod (* .cse33 (+ .cse33 1)) 18446744073709551616) 2) 18446744073709551616)) (< .cse33 .cse28) (<= (mod (+ c_ULTIMATE.start_main_~i~6 11) 4294967296) .cse33) (< .cse33 .cse31) (< .cse33 .cse29) (< .cse33 .cse32) (< .cse33 .cse30)))) (= (mod (+ .cse6 .cse16 .cse5 .cse11 .cse20 .cse7 .cse8 c_ULTIMATE.start_main_~sn~6 .cse0 .cse9 .cse12 .cse10) 18446744073709551616) 0)) (let ((.cse34 (mod (+ .cse6 c_ULTIMATE.start_main_~sn~6 .cse9) 18446744073709551616))) (or (= .cse2 .cse34) (<= .cse10 .cse1) .cse4 .cse15 (= 0 .cse34))) (let ((.cse35 (mod (+ .cse6 .cse7 c_ULTIMATE.start_main_~sn~6 .cse9 .cse10) 18446744073709551616))) (or (= .cse35 .cse2) (= .cse35 0) .cse17 .cse4 (<= .cse8 .cse1))) (let ((.cse36 (mod (+ .cse6 .cse5 .cse7 .cse8 c_ULTIMATE.start_main_~sn~6 .cse0 .cse9 .cse10) 18446744073709551616))) (or (= .cse36 0) .cse4 (<= .cse11 .cse1) (= .cse36 .cse2) (< .cse1 .cse0) .cse15)) (let ((.cse37 (mod c_ULTIMATE.start_main_~sn~6 18446744073709551616))) (or (= .cse37 .cse2) (= .cse37 0) (<= .cse6 .cse1))) (let ((.cse38 (mod (+ .cse6 .cse11 .cse5 .cse7 .cse8 c_ULTIMATE.start_main_~sn~6 .cse9 .cse0 .cse12 .cse10) 18446744073709551616))) (or .cse17 (= .cse38 0) .cse4 (<= .cse20 .cse1) (< .cse1 .cse12) .cse14 (= .cse38 .cse2))) (let ((.cse39 (mod (+ .cse6 c_ULTIMATE.start_main_~sn~6) 18446744073709551616))) (or .cse4 (<= .cse9 .cse1) (= .cse2 .cse39) (= 0 .cse39))) (let ((.cse40 (mod (+ .cse6 c_ULTIMATE.start_main_~sn~6 .cse9 .cse10) 18446744073709551616))) (or (<= .cse7 .cse1) (= 0 .cse40) (= .cse2 .cse40) .cse14 .cse15))))) is different from true [2018-12-03 15:50:01,805 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse9 (mod (+ c_ULTIMATE.start_main_~i~6 1) 4294967296)) (.cse10 (mod (+ c_ULTIMATE.start_main_~i~6 2) 4294967296)) (.cse6 (mod c_ULTIMATE.start_main_~i~6 4294967296)) (.cse7 (mod (+ c_ULTIMATE.start_main_~i~6 3) 4294967296)) (.cse1 (mod c_ULTIMATE.start_main_~n~6 4294967296)) (.cse8 (mod (+ c_ULTIMATE.start_main_~i~6 4) 4294967296))) (let ((.cse19 (< .cse1 .cse8)) (.cse16 (mod (+ c_ULTIMATE.start_main_~i~6 10) 4294967296)) (.cse17 (< .cse1 .cse7)) (.cse20 (mod (+ c_ULTIMATE.start_main_~i~6 9) 4294967296)) (.cse11 (mod (+ c_ULTIMATE.start_main_~i~6 7) 4294967296)) (.cse5 (mod (+ c_ULTIMATE.start_main_~i~6 5) 4294967296)) (.cse0 (mod (+ c_ULTIMATE.start_main_~i~6 6) 4294967296)) (.cse12 (mod (+ c_ULTIMATE.start_main_~i~6 8) 4294967296)) (.cse4 (< .cse1 .cse6)) (.cse2 (mod (div (mod (* .cse1 (+ .cse1 1)) 18446744073709551616) 2) 18446744073709551616)) (.cse14 (< .cse1 .cse10)) (.cse15 (< .cse1 .cse9))) (and (let ((.cse3 (mod (+ .cse6 .cse5 .cse7 .cse8 c_ULTIMATE.start_main_~sn~6 .cse9 .cse10) 18446744073709551616))) (or (<= .cse0 .cse1) (= .cse2 .cse3) .cse4 (= 0 .cse3) (< .cse1 .cse5))) (let ((.cse13 (mod (+ .cse6 .cse5 .cse11 .cse7 .cse8 c_ULTIMATE.start_main_~sn~6 .cse9 .cse0 .cse10) 18446744073709551616))) (or (< .cse1 .cse11) (<= .cse12 .cse1) (= .cse13 0) (= .cse13 .cse2) .cse14 .cse15)) (let ((.cse18 (mod (+ .cse6 .cse11 .cse5 .cse7 .cse20 .cse8 c_ULTIMATE.start_main_~sn~6 .cse0 .cse9 .cse12 .cse10) 18446744073709551616))) (or (<= .cse16 .cse1) .cse17 (= .cse18 .cse2) .cse19 .cse15 (< .cse1 .cse20) (= .cse18 0))) (let ((.cse21 (mod (+ .cse6 .cse7 .cse8 c_ULTIMATE.start_main_~sn~6 .cse9 .cse10) 18446744073709551616))) (or (= 0 .cse21) .cse19 (= .cse2 .cse21) .cse15 (<= .cse5 .cse1))) (or (forall ((ULTIMATE.start_main_~n~6 Int)) (let ((.cse22 (mod c_ULTIMATE.start_main_~i~6 4294967296)) (.cse25 (mod (+ c_ULTIMATE.start_main_~i~6 4) 4294967296)) (.cse23 (mod (+ c_ULTIMATE.start_main_~i~6 10) 4294967296)) (.cse26 (mod (+ c_ULTIMATE.start_main_~i~6 2) 4294967296)) (.cse27 (mod ULTIMATE.start_main_~n~6 4294967296)) (.cse24 (mod (+ c_ULTIMATE.start_main_~i~6 5) 4294967296))) (or (= (mod (+ .cse22 .cse23 .cse24 (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) .cse25 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) .cse26) 18446744073709551616) (mod (div (mod (* .cse27 (+ .cse27 1)) 18446744073709551616) 2) 18446744073709551616)) (< .cse27 .cse22) (<= (mod (+ c_ULTIMATE.start_main_~i~6 11) 4294967296) .cse27) (< .cse27 .cse25) (< .cse27 .cse23) (< .cse27 .cse26) (< .cse27 .cse24)))) (= (mod (+ .cse6 .cse16 .cse5 .cse11 .cse20 .cse7 .cse8 c_ULTIMATE.start_main_~sn~6 .cse0 .cse9 .cse12 .cse10) 18446744073709551616) 0)) (let ((.cse28 (mod (+ .cse6 c_ULTIMATE.start_main_~sn~6 .cse9) 18446744073709551616))) (or (= .cse2 .cse28) (<= .cse10 .cse1) .cse4 .cse15 (= 0 .cse28))) (let ((.cse29 (mod (+ .cse6 .cse7 c_ULTIMATE.start_main_~sn~6 .cse9 .cse10) 18446744073709551616))) (or (= .cse29 .cse2) (= .cse29 0) .cse17 .cse4 (<= .cse8 .cse1))) (let ((.cse30 (mod (+ .cse6 .cse5 .cse7 .cse8 c_ULTIMATE.start_main_~sn~6 .cse0 .cse9 .cse10) 18446744073709551616))) (or (= .cse30 0) .cse4 (<= .cse11 .cse1) (= .cse30 .cse2) (< .cse1 .cse0) .cse15)) (let ((.cse31 (mod c_ULTIMATE.start_main_~sn~6 18446744073709551616))) (or (= .cse31 .cse2) (= .cse31 0) (<= .cse6 .cse1))) (let ((.cse32 (mod (+ .cse6 .cse11 .cse5 .cse7 .cse8 c_ULTIMATE.start_main_~sn~6 .cse9 .cse0 .cse12 .cse10) 18446744073709551616))) (or .cse17 (= .cse32 0) .cse4 (<= .cse20 .cse1) (< .cse1 .cse12) .cse14 (= .cse32 .cse2))) (let ((.cse33 (mod (+ .cse6 c_ULTIMATE.start_main_~sn~6) 18446744073709551616))) (or .cse4 (<= .cse9 .cse1) (= .cse2 .cse33) (= 0 .cse33))) (let ((.cse34 (mod (+ .cse6 c_ULTIMATE.start_main_~sn~6 .cse9 .cse10) 18446744073709551616))) (or (<= .cse7 .cse1) (= 0 .cse34) (= .cse2 .cse34) .cse14 .cse15))))) is different from false [2018-12-03 15:50:03,912 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse9 (mod (+ c_ULTIMATE.start_main_~i~6 1) 4294967296)) (.cse10 (mod (+ c_ULTIMATE.start_main_~i~6 2) 4294967296)) (.cse6 (mod c_ULTIMATE.start_main_~i~6 4294967296)) (.cse7 (mod (+ c_ULTIMATE.start_main_~i~6 3) 4294967296)) (.cse1 (mod c_ULTIMATE.start_main_~n~6 4294967296)) (.cse8 (mod (+ c_ULTIMATE.start_main_~i~6 4) 4294967296))) (let ((.cse18 (< .cse1 .cse8)) (.cse16 (< .cse1 .cse7)) (.cse19 (mod (+ c_ULTIMATE.start_main_~i~6 9) 4294967296)) (.cse11 (mod (+ c_ULTIMATE.start_main_~i~6 7) 4294967296)) (.cse5 (mod (+ c_ULTIMATE.start_main_~i~6 5) 4294967296)) (.cse0 (mod (+ c_ULTIMATE.start_main_~i~6 6) 4294967296)) (.cse12 (mod (+ c_ULTIMATE.start_main_~i~6 8) 4294967296)) (.cse4 (< .cse1 .cse6)) (.cse2 (mod (div (mod (* .cse1 (+ .cse1 1)) 18446744073709551616) 2) 18446744073709551616)) (.cse14 (< .cse1 .cse10)) (.cse15 (< .cse1 .cse9))) (and (let ((.cse3 (mod (+ .cse6 .cse5 .cse7 .cse8 c_ULTIMATE.start_main_~sn~6 .cse9 .cse10) 18446744073709551616))) (or (<= .cse0 .cse1) (= .cse2 .cse3) .cse4 (= 0 .cse3) (< .cse1 .cse5))) (let ((.cse13 (mod (+ .cse6 .cse5 .cse11 .cse7 .cse8 c_ULTIMATE.start_main_~sn~6 .cse9 .cse0 .cse10) 18446744073709551616))) (or (< .cse1 .cse11) (<= .cse12 .cse1) (= .cse13 0) (= .cse13 .cse2) .cse14 .cse15)) (let ((.cse17 (mod (+ .cse6 .cse11 .cse5 .cse7 .cse19 .cse8 c_ULTIMATE.start_main_~sn~6 .cse0 .cse9 .cse12 .cse10) 18446744073709551616))) (or (<= (mod (+ c_ULTIMATE.start_main_~i~6 10) 4294967296) .cse1) .cse16 (= .cse17 .cse2) .cse18 .cse15 (< .cse1 .cse19) (= .cse17 0))) (let ((.cse20 (mod (+ .cse6 .cse7 .cse8 c_ULTIMATE.start_main_~sn~6 .cse9 .cse10) 18446744073709551616))) (or (= 0 .cse20) .cse18 (= .cse2 .cse20) .cse15 (<= .cse5 .cse1))) (let ((.cse21 (mod (+ .cse6 c_ULTIMATE.start_main_~sn~6 .cse9) 18446744073709551616))) (or (= .cse2 .cse21) (<= .cse10 .cse1) .cse4 .cse15 (= 0 .cse21))) (let ((.cse22 (mod (+ .cse6 .cse7 c_ULTIMATE.start_main_~sn~6 .cse9 .cse10) 18446744073709551616))) (or (= .cse22 .cse2) (= .cse22 0) .cse16 .cse4 (<= .cse8 .cse1))) (let ((.cse23 (mod (+ .cse6 .cse5 .cse7 .cse8 c_ULTIMATE.start_main_~sn~6 .cse0 .cse9 .cse10) 18446744073709551616))) (or (= .cse23 0) .cse4 (<= .cse11 .cse1) (= .cse23 .cse2) (< .cse1 .cse0) .cse15)) (let ((.cse24 (mod c_ULTIMATE.start_main_~sn~6 18446744073709551616))) (or (= .cse24 .cse2) (= .cse24 0) (<= .cse6 .cse1))) (let ((.cse25 (mod (+ .cse6 .cse11 .cse5 .cse7 .cse8 c_ULTIMATE.start_main_~sn~6 .cse9 .cse0 .cse12 .cse10) 18446744073709551616))) (or .cse16 (= .cse25 0) .cse4 (<= .cse19 .cse1) (< .cse1 .cse12) .cse14 (= .cse25 .cse2))) (let ((.cse26 (mod (+ .cse6 c_ULTIMATE.start_main_~sn~6) 18446744073709551616))) (or .cse4 (<= .cse9 .cse1) (= .cse2 .cse26) (= 0 .cse26))) (let ((.cse27 (mod (+ .cse6 c_ULTIMATE.start_main_~sn~6 .cse9 .cse10) 18446744073709551616))) (or (<= .cse7 .cse1) (= 0 .cse27) (= .cse2 .cse27) .cse14 .cse15))))) is different from false [2018-12-03 15:50:05,978 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse9 (mod (+ c_ULTIMATE.start_main_~i~6 1) 4294967296)) (.cse10 (mod (+ c_ULTIMATE.start_main_~i~6 2) 4294967296)) (.cse6 (mod c_ULTIMATE.start_main_~i~6 4294967296)) (.cse7 (mod (+ c_ULTIMATE.start_main_~i~6 3) 4294967296)) (.cse1 (mod c_ULTIMATE.start_main_~n~6 4294967296)) (.cse8 (mod (+ c_ULTIMATE.start_main_~i~6 4) 4294967296))) (let ((.cse18 (< .cse1 .cse8)) (.cse16 (< .cse1 .cse7)) (.cse19 (mod (+ c_ULTIMATE.start_main_~i~6 9) 4294967296)) (.cse11 (mod (+ c_ULTIMATE.start_main_~i~6 7) 4294967296)) (.cse5 (mod (+ c_ULTIMATE.start_main_~i~6 5) 4294967296)) (.cse0 (mod (+ c_ULTIMATE.start_main_~i~6 6) 4294967296)) (.cse12 (mod (+ c_ULTIMATE.start_main_~i~6 8) 4294967296)) (.cse4 (< .cse1 .cse6)) (.cse2 (mod (div (mod (* .cse1 (+ .cse1 1)) 18446744073709551616) 2) 18446744073709551616)) (.cse14 (< .cse1 .cse10)) (.cse15 (< .cse1 .cse9))) (and (let ((.cse3 (mod (+ .cse6 .cse5 .cse7 .cse8 c_ULTIMATE.start_main_~sn~6 .cse9 .cse10) 18446744073709551616))) (or (<= .cse0 .cse1) (= .cse2 .cse3) .cse4 (= 0 .cse3) (< .cse1 .cse5))) (let ((.cse13 (mod (+ .cse6 .cse5 .cse11 .cse7 .cse8 c_ULTIMATE.start_main_~sn~6 .cse9 .cse0 .cse10) 18446744073709551616))) (or (< .cse1 .cse11) (<= .cse12 .cse1) (= .cse13 0) (= .cse13 .cse2) .cse14 .cse15)) (let ((.cse17 (mod (+ .cse6 .cse11 .cse5 .cse7 .cse19 .cse8 c_ULTIMATE.start_main_~sn~6 .cse0 .cse9 .cse12 .cse10) 18446744073709551616))) (or (<= (mod (+ c_ULTIMATE.start_main_~i~6 10) 4294967296) .cse1) .cse16 (= .cse17 .cse2) .cse18 .cse15 (< .cse1 .cse19) (= .cse17 0))) (let ((.cse20 (mod (+ .cse6 .cse7 .cse8 c_ULTIMATE.start_main_~sn~6 .cse9 .cse10) 18446744073709551616))) (or (= 0 .cse20) .cse18 (= .cse2 .cse20) .cse15 (<= .cse5 .cse1))) (let ((.cse21 (mod (+ .cse6 c_ULTIMATE.start_main_~sn~6 .cse9) 18446744073709551616))) (or (= .cse2 .cse21) (<= .cse10 .cse1) .cse4 .cse15 (= 0 .cse21))) (let ((.cse22 (mod (+ .cse6 .cse7 c_ULTIMATE.start_main_~sn~6 .cse9 .cse10) 18446744073709551616))) (or (= .cse22 .cse2) (= .cse22 0) .cse16 .cse4 (<= .cse8 .cse1))) (let ((.cse23 (mod (+ .cse6 .cse5 .cse7 .cse8 c_ULTIMATE.start_main_~sn~6 .cse0 .cse9 .cse10) 18446744073709551616))) (or (= .cse23 0) .cse4 (<= .cse11 .cse1) (= .cse23 .cse2) (< .cse1 .cse0) .cse15)) (let ((.cse24 (mod c_ULTIMATE.start_main_~sn~6 18446744073709551616))) (or (= .cse24 .cse2) (= .cse24 0) (<= .cse6 .cse1))) (let ((.cse25 (mod (+ .cse6 .cse11 .cse5 .cse7 .cse8 c_ULTIMATE.start_main_~sn~6 .cse9 .cse0 .cse12 .cse10) 18446744073709551616))) (or .cse16 (= .cse25 0) .cse4 (<= .cse19 .cse1) (< .cse1 .cse12) .cse14 (= .cse25 .cse2))) (let ((.cse26 (mod (+ .cse6 c_ULTIMATE.start_main_~sn~6) 18446744073709551616))) (or .cse4 (<= .cse9 .cse1) (= .cse2 .cse26) (= 0 .cse26))) (let ((.cse27 (mod (+ .cse6 c_ULTIMATE.start_main_~sn~6 .cse9 .cse10) 18446744073709551616))) (or (<= .cse7 .cse1) (= 0 .cse27) (= .cse2 .cse27) .cse14 .cse15))))) is different from true [2018-12-03 15:53:59,739 WARN L180 SmtUtils]: Spent 3.61 m on a formula simplification that was a NOOP. DAG size: 109