java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data --generate-csv --csv-dir csv -tc ../../../trunk/examples/toolchains/AutomizerBplTransformed.xml -s ../../../trunk/examples/settings/heapseparator/heapsep-2018-09-18.epf -i ../../../trunk/examples/programs/20181015-LoopsPathprograms/diamond_true-unreach-call2.i_6.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-2d08e6e [2018-10-15 13:03:45,573 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-15 13:03:45,576 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-15 13:03:45,589 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-15 13:03:45,589 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-15 13:03:45,590 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-15 13:03:45,592 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-15 13:03:45,594 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-15 13:03:45,596 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-15 13:03:45,598 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-15 13:03:45,599 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-15 13:03:45,599 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-15 13:03:45,602 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-15 13:03:45,605 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-15 13:03:45,606 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-15 13:03:45,613 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-15 13:03:45,614 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-15 13:03:45,618 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-15 13:03:45,622 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-15 13:03:45,625 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-15 13:03:45,627 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-15 13:03:45,629 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-15 13:03:45,633 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-15 13:03:45,633 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-15 13:03:45,633 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-15 13:03:45,634 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-15 13:03:45,635 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-15 13:03:45,636 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-15 13:03:45,637 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-15 13:03:45,639 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-15 13:03:45,639 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-15 13:03:45,640 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-15 13:03:45,640 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-15 13:03:45,641 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-15 13:03:45,643 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-15 13:03:45,645 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-15 13:03:45,646 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/heapseparator/heapsep-2018-09-18.epf [2018-10-15 13:03:45,661 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-15 13:03:45,661 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-15 13:03:45,664 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-15 13:03:45,664 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-10-15 13:03:45,664 INFO L133 SettingsManager]: * Parallel states before merging=1 [2018-10-15 13:03:45,665 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-15 13:03:45,666 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-15 13:03:45,666 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-10-15 13:03:45,667 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-15 13:03:45,667 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_TreeInterpolation [2018-10-15 13:03:45,667 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-15 13:03:45,667 INFO L133 SettingsManager]: * Order in Petri net unfolding=Ken McMillan [2018-10-15 13:03:45,667 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-10-15 13:03:45,668 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-10-15 13:03:45,669 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-10-15 13:03:45,731 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-15 13:03:45,744 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-15 13:03:45,751 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-15 13:03:45,752 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-10-15 13:03:45,753 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-10-15 13:03:45,754 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20181015-LoopsPathprograms/diamond_true-unreach-call2.i_6.bpl [2018-10-15 13:03:45,754 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20181015-LoopsPathprograms/diamond_true-unreach-call2.i_6.bpl' [2018-10-15 13:03:45,828 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-15 13:03:45,829 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-10-15 13:03:45,830 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-15 13:03:45,830 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-15 13:03:45,830 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-15 13:03:45,855 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "diamond_true-unreach-call2.i_6.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 01:03:45" (1/1) ... [2018-10-15 13:03:45,857 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "diamond_true-unreach-call2.i_6.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 01:03:45" (1/1) ... [2018-10-15 13:03:45,867 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "diamond_true-unreach-call2.i_6.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 01:03:45" (1/1) ... [2018-10-15 13:03:45,868 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "diamond_true-unreach-call2.i_6.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 01:03:45" (1/1) ... [2018-10-15 13:03:45,874 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "diamond_true-unreach-call2.i_6.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 01:03:45" (1/1) ... [2018-10-15 13:03:45,877 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "diamond_true-unreach-call2.i_6.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 01:03:45" (1/1) ... [2018-10-15 13:03:45,879 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "diamond_true-unreach-call2.i_6.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 01:03:45" (1/1) ... [2018-10-15 13:03:45,881 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-15 13:03:45,882 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-15 13:03:45,882 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-15 13:03:45,883 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-15 13:03:45,884 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "diamond_true-unreach-call2.i_6.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 01:03:45" (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:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-15 13:03:45,953 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2018-10-15 13:03:45,954 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-15 13:03:45,954 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-15 13:03:46,507 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-15 13:03:46,508 INFO L202 PluginConnector]: Adding new model diamond_true-unreach-call2.i_6.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 01:03:46 BoogieIcfgContainer [2018-10-15 13:03:46,508 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-15 13:03:46,509 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2018-10-15 13:03:46,509 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2018-10-15 13:03:46,510 INFO L276 PluginConnector]: IcfgTransformer initialized [2018-10-15 13:03:46,514 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "diamond_true-unreach-call2.i_6.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 01:03:46" (1/1) ... [2018-10-15 13:03:46,520 WARN L219 ansformationObserver]: HeapSeparator: input icfg has no '#valid' array -- returning unchanged Icfg! [2018-10-15 13:03:46,537 INFO L202 PluginConnector]: Adding new model diamond_true-unreach-call2.i_6.bpl de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 15.10 01:03:46 BasicIcfg [2018-10-15 13:03:46,538 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2018-10-15 13:03:46,539 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-15 13:03:46,539 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-15 13:03:46,542 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-15 13:03:46,542 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "diamond_true-unreach-call2.i_6.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 01:03:45" (1/3) ... [2018-10-15 13:03:46,544 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@172c0e6e and model type diamond_true-unreach-call2.i_6.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 01:03:46, skipping insertion in model container [2018-10-15 13:03:46,544 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "diamond_true-unreach-call2.i_6.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 01:03:46" (2/3) ... [2018-10-15 13:03:46,544 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@172c0e6e and model type diamond_true-unreach-call2.i_6.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.10 01:03:46, skipping insertion in model container [2018-10-15 13:03:46,545 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "diamond_true-unreach-call2.i_6.bpl de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 15.10 01:03:46" (3/3) ... [2018-10-15 13:03:46,546 INFO L112 eAbstractionObserver]: Analyzing ICFG diamond_true-unreach-call2.i_6.bplleft_unchanged_by_heapseparator [2018-10-15 13:03:46,556 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_TreeInterpolation Determinization: PREDICATE_ABSTRACTION [2018-10-15 13:03:46,566 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-15 13:03:46,585 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-15 13:03:46,613 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-15 13:03:46,613 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-15 13:03:46,613 INFO L383 AbstractCegarLoop]: Hoare is false [2018-10-15 13:03:46,614 INFO L384 AbstractCegarLoop]: Compute interpolants for Craig_TreeInterpolation [2018-10-15 13:03:46,614 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-15 13:03:46,614 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-15 13:03:46,614 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-15 13:03:46,614 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-15 13:03:46,614 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-15 13:03:46,628 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states. [2018-10-15 13:03:46,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-10-15 13:03:46,637 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:03:46,638 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:03:46,639 INFO L424 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:03:46,645 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:03:46,645 INFO L82 PathProgramCache]: Analyzing trace with hash -1146605782, now seen corresponding path program 1 times [2018-10-15 13:03:46,693 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:03:46,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:03:46,872 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:03:46,875 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-15 13:03:46,875 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-15 13:03:46,880 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-15 13:03:46,894 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-15 13:03:46,895 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-15 13:03:46,898 INFO L87 Difference]: Start difference. First operand 37 states. Second operand 3 states. [2018-10-15 13:03:47,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:03:47,060 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2018-10-15 13:03:47,060 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-15 13:03:47,062 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2018-10-15 13:03:47,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:03:47,074 INFO L225 Difference]: With dead ends: 39 [2018-10-15 13:03:47,074 INFO L226 Difference]: Without dead ends: 39 [2018-10-15 13:03:47,076 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-15 13:03:47,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-10-15 13:03:47,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 36. [2018-10-15 13:03:47,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-10-15 13:03:47,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 36 transitions. [2018-10-15 13:03:47,109 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 36 transitions. Word has length 12 [2018-10-15 13:03:47,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:03:47,110 INFO L481 AbstractCegarLoop]: Abstraction has 36 states and 36 transitions. [2018-10-15 13:03:47,110 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-15 13:03:47,110 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2018-10-15 13:03:47,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-10-15 13:03:47,111 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:03:47,112 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:03:47,112 INFO L424 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:03:47,112 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:03:47,113 INFO L82 PathProgramCache]: Analyzing trace with hash -163179102, now seen corresponding path program 1 times [2018-10-15 13:03:47,114 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:03:47,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:03:59,740 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse19 (div c_ULTIMATE.start_main_~y~0 2))) (let ((.cse2 (* 2 .cse19))) (let ((.cse18 (* (- 2) .cse19)) (.cse5 (= .cse2 c_ULTIMATE.start_main_~y~0)) (.cse0 (* 4294967296 (div c_ULTIMATE.start_main_~y~0 4294967296)))) (let ((.cse3 (<= .cse0 c_ULTIMATE.start_main_~y~0)) (.cse9 (not .cse5)) (.cse10 (< c_ULTIMATE.start_main_~y~0 .cse0)) (.cse7 (div (+ c_ULTIMATE.start_main_~y~0 .cse18) 4294967296)) (.cse4 (div (+ c_ULTIMATE.start_main_~y~0 .cse18 (- 2)) 4294967296))) (let ((.cse17 (+ .cse4 1)) (.cse16 (+ .cse7 1)) (.cse6 (and .cse9 .cse10)) (.cse8 (or .cse3 .cse5)) (.cse14 (<= 0 c_ULTIMATE.start_main_~x~0))) (and (< .cse0 (+ c_ULTIMATE.start_main_~y~0 1)) (or (let ((.cse1 (<= c_ULTIMATE.start_main_~x~0 0)) (.cse12 (+ (* 4294967296 .cse4) .cse2 2)) (.cse11 (+ .cse2 (* 4294967296 .cse7))) (.cse13 (+ .cse2 1))) (and (or (and .cse1 (<= .cse2 c_ULTIMATE.start_main_~y~0)) (and (or .cse3 (< 0 .cse4) .cse5) (or .cse6 (< 0 .cse7)))) (or (and (<= .cse7 0) .cse8) (and .cse9 .cse10 (<= .cse4 0))) (or (and (<= .cse11 c_ULTIMATE.start_main_~y~0) .cse8) (and (or .cse3 (< .cse12 c_ULTIMATE.start_main_~y~0) .cse5) (or .cse6 (< .cse11 c_ULTIMATE.start_main_~y~0))) (and .cse9 .cse10 (<= .cse12 c_ULTIMATE.start_main_~y~0))) .cse1 (or (not (= .cse11 c_ULTIMATE.start_main_~y~0)) .cse6) (<= c_ULTIMATE.start_main_~y~0 .cse13) (or .cse3 .cse5 (not (= .cse12 c_ULTIMATE.start_main_~y~0))) .cse14 (let ((.cse15 (+ c_ULTIMATE.start_main_~x~0 c_ULTIMATE.start_main_~y~0))) (or (and .cse9 .cse10 (<= .cse15 (+ .cse2 3))) (and .cse9 .cse10 (<= c_ULTIMATE.start_main_~y~0 .cse12)) (and (<= c_ULTIMATE.start_main_~y~0 .cse11) .cse8) (and (<= .cse15 .cse13) .cse8))))) (and (<= .cse16 0) .cse8) (and (<= .cse17 0) .cse9 .cse10)) (or (and (or .cse3 (< 0 .cse17) .cse5) (or (< 0 .cse16) .cse6)) (and .cse9 .cse10 (<= 0 .cse4)) (and (<= 0 .cse7) .cse8)) .cse14)))))) is different from false [2018-10-15 13:04:11,813 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse19 (div c_ULTIMATE.start_main_~y~0 2))) (let ((.cse4 (* 2 .cse19))) (let ((.cse18 (* (- 2) .cse19)) (.cse11 (= .cse4 c_ULTIMATE.start_main_~y~0)) (.cse17 (* 4294967296 (div c_ULTIMATE.start_main_~y~0 4294967296)))) (let ((.cse10 (<= .cse17 c_ULTIMATE.start_main_~y~0)) (.cse0 (not .cse11)) (.cse1 (< c_ULTIMATE.start_main_~y~0 .cse17)) (.cse8 (div (+ c_ULTIMATE.start_main_~y~0 .cse18) 4294967296)) (.cse9 (div (+ c_ULTIMATE.start_main_~y~0 .cse18 (- 2)) 4294967296))) (let ((.cse13 (<= 0 |c_ULTIMATE.start_main_#t~post1|)) (.cse16 (+ .cse9 1)) (.cse15 (+ .cse8 1)) (.cse12 (and .cse0 .cse1)) (.cse6 (or .cse10 .cse11))) (and (or (let ((.cse7 (+ .cse4 (* 4294967296 .cse8))) (.cse5 (+ .cse4 1)) (.cse2 (+ (* 4294967296 .cse9) .cse4 2)) (.cse14 (<= |c_ULTIMATE.start_main_#t~post1| 0))) (and (let ((.cse3 (+ |c_ULTIMATE.start_main_#t~post1| c_ULTIMATE.start_main_~y~0))) (or (and .cse0 .cse1 (<= c_ULTIMATE.start_main_~y~0 .cse2)) (and .cse0 (<= .cse3 (+ .cse4 3)) .cse1) (and (<= .cse3 .cse5) .cse6) (and (<= c_ULTIMATE.start_main_~y~0 .cse7) .cse6))) (or (and (<= .cse8 0) .cse6) (and .cse0 .cse1 (<= .cse9 0))) (or (and (<= .cse7 c_ULTIMATE.start_main_~y~0) .cse6) (and (or .cse10 (< .cse2 c_ULTIMATE.start_main_~y~0) .cse11) (or .cse12 (< .cse7 c_ULTIMATE.start_main_~y~0))) (and .cse0 .cse1 (<= .cse2 c_ULTIMATE.start_main_~y~0))) (or (not (= .cse7 c_ULTIMATE.start_main_~y~0)) .cse12) (<= c_ULTIMATE.start_main_~y~0 .cse5) .cse13 (or .cse10 .cse11 (not (= .cse2 c_ULTIMATE.start_main_~y~0))) (or (and (<= .cse4 c_ULTIMATE.start_main_~y~0) .cse14) (and (or .cse10 (< 0 .cse9) .cse11) (or .cse12 (< 0 .cse8)))) .cse14)) (and (<= .cse15 0) .cse6) (and (<= .cse16 0) .cse0 .cse1)) (< .cse17 (+ c_ULTIMATE.start_main_~y~0 1)) .cse13 (or (and (or .cse10 (< 0 .cse16) .cse11) (or (< 0 .cse15) .cse12)) (and .cse0 .cse1 (<= 0 .cse9)) (and (<= 0 .cse8) .cse6)))))))) is different from false [2018-10-15 13:04:23,874 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse18 (div c_ULTIMATE.start_main_~y~0 2))) (let ((.cse5 (* 2 .cse18))) (let ((.cse17 (* (- 2) .cse18)) (.cse12 (= .cse5 c_ULTIMATE.start_main_~y~0)) (.cse1 (* 4294967296 (div c_ULTIMATE.start_main_~y~0 4294967296)))) (let ((.cse10 (<= .cse1 c_ULTIMATE.start_main_~y~0)) (.cse2 (not .cse12)) (.cse3 (< c_ULTIMATE.start_main_~y~0 .cse1)) (.cse14 (div (+ c_ULTIMATE.start_main_~y~0 .cse17) 4294967296)) (.cse11 (div (+ c_ULTIMATE.start_main_~y~0 .cse17 (- 2)) 4294967296))) (let ((.cse0 (<= 1 c_ULTIMATE.start_main_~x~0)) (.cse16 (+ .cse11 1)) (.cse15 (+ .cse14 1)) (.cse13 (and .cse2 .cse3)) (.cse6 (or .cse10 .cse12))) (and .cse0 (< .cse1 (+ c_ULTIMATE.start_main_~y~0 1)) (or (let ((.cse9 (<= c_ULTIMATE.start_main_~x~0 1)) (.cse8 (+ .cse5 (* 4294967296 .cse14))) (.cse7 (+ (* 4294967296 .cse11) .cse5 2))) (and (let ((.cse4 (+ c_ULTIMATE.start_main_~x~0 c_ULTIMATE.start_main_~y~0))) (or (and .cse2 .cse3 (<= .cse4 (+ .cse5 4))) (and (<= .cse4 (+ .cse5 2)) .cse6) (and .cse2 .cse3 (<= c_ULTIMATE.start_main_~y~0 .cse7)) (and (<= c_ULTIMATE.start_main_~y~0 .cse8) .cse6))) .cse0 (or (and .cse9 (<= .cse5 c_ULTIMATE.start_main_~y~0)) (and (or .cse10 (< 0 .cse11) .cse12) (or .cse13 (< 0 .cse14)))) (or (and (<= .cse14 0) .cse6) (and .cse2 .cse3 (<= .cse11 0))) (or (and (<= .cse8 c_ULTIMATE.start_main_~y~0) .cse6) (and (or .cse10 (< .cse7 c_ULTIMATE.start_main_~y~0) .cse12) (or .cse13 (< .cse8 c_ULTIMATE.start_main_~y~0))) (and .cse2 .cse3 (<= .cse7 c_ULTIMATE.start_main_~y~0))) .cse9 (or (not (= .cse8 c_ULTIMATE.start_main_~y~0)) .cse13) (<= c_ULTIMATE.start_main_~y~0 (+ .cse5 1)) (or .cse10 .cse12 (not (= .cse7 c_ULTIMATE.start_main_~y~0))))) (and (<= .cse15 0) .cse6) (and (<= .cse16 0) .cse2 .cse3)) (or (and (or .cse10 (< 0 .cse16) .cse12) (or (< 0 .cse15) .cse13)) (and .cse2 .cse3 (<= 0 .cse11)) (and (<= 0 .cse14) .cse6)))))))) is different from false [2018-10-15 13:04:35,952 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse26 (div c_ULTIMATE.start_main_~y~0 2))) (let ((.cse16 (* 2 .cse26))) (let ((.cse25 (* (- 2) .cse26)) (.cse8 (= .cse16 c_ULTIMATE.start_main_~y~0)) (.cse1 (* 4294967296 (div c_ULTIMATE.start_main_~y~0 4294967296)))) (let ((.cse6 (<= .cse1 c_ULTIMATE.start_main_~y~0)) (.cse13 (not .cse8)) (.cse14 (< c_ULTIMATE.start_main_~y~0 .cse1)) (.cse10 (div (+ c_ULTIMATE.start_main_~y~0 .cse25) 4294967296)) (.cse7 (div (+ c_ULTIMATE.start_main_~y~0 .cse25 (- 2)) 4294967296))) (let ((.cse23 (+ .cse7 1)) (.cse24 (+ .cse10 1)) (.cse9 (and .cse13 .cse14)) (.cse17 (or .cse6 .cse8))) (let ((.cse0 (<= 1 c_ULTIMATE.start_main_~x~0)) (.cse4 (or (and (or .cse6 (< 0 .cse23) .cse8) (or (< 0 .cse24) .cse9)) (and .cse13 .cse14 (<= 0 .cse7)) (and (<= 0 .cse10) .cse17)))) (and .cse0 (< .cse1 (+ c_ULTIMATE.start_main_~y~0 1)) (let ((.cse2 (and (<= .cse24 0) .cse17)) (.cse3 (and (<= .cse23 0) .cse13 .cse14))) (or .cse2 .cse3 (let ((.cse21 (+ .cse16 (* 4294967296 .cse10))) (.cse22 (+ (* 4294967296 .cse7) .cse16 2))) (let ((.cse20 (or (and (<= .cse21 c_ULTIMATE.start_main_~y~0) .cse17) (and (or .cse6 (< .cse22 c_ULTIMATE.start_main_~y~0) .cse8) (or .cse9 (< .cse21 c_ULTIMATE.start_main_~y~0))) (and .cse13 .cse14 (<= .cse22 c_ULTIMATE.start_main_~y~0)))) (.cse5 (<= c_ULTIMATE.start_main_~x~0 1)) (.cse11 (+ .cse16 3)) (.cse12 (+ .cse16 1))) (and (or (and .cse4 (or .cse5 .cse2 .cse3)) (and (or .cse6 (< 0 .cse7) .cse8) (or .cse9 (< 0 .cse10)))) (or .cse0 (and (or (< .cse11 c_ULTIMATE.start_main_~y~0) .cse6 .cse8) (or .cse9 (< .cse12 c_ULTIMATE.start_main_~y~0)))) (let ((.cse18 (and .cse13 .cse14 (<= c_ULTIMATE.start_main_~y~0 .cse22))) (.cse19 (and (<= c_ULTIMATE.start_main_~y~0 .cse21) .cse17))) (or (and (let ((.cse15 (+ c_ULTIMATE.start_main_~x~0 c_ULTIMATE.start_main_~y~0))) (or (and .cse13 .cse14 (<= .cse15 (+ .cse16 4))) (and (<= .cse15 (+ .cse16 2)) .cse17) .cse18 .cse19)) .cse20) .cse18 .cse19)) .cse0 (or (and (<= .cse10 0) .cse17) (and .cse13 .cse14 (<= .cse7 0))) .cse20 .cse5 (or (not (= .cse21 c_ULTIMATE.start_main_~y~0)) .cse9) (or .cse6 .cse8 (not (= .cse22 c_ULTIMATE.start_main_~y~0))) (or (and (<= c_ULTIMATE.start_main_~y~0 .cse11) .cse13 .cse14) (and (<= c_ULTIMATE.start_main_~y~0 .cse12) .cse17))))))) .cse4))))))) is different from false [2018-10-15 13:04:48,024 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse27 (div c_ULTIMATE.start_main_~y~0 2))) (let ((.cse6 (* 2 .cse27))) (let ((.cse26 (* (- 2) .cse27)) (.cse15 (= .cse6 c_ULTIMATE.start_main_~y~0)) (.cse25 (* 4294967296 (div c_ULTIMATE.start_main_~y~0 4294967296)))) (let ((.cse14 (<= .cse25 c_ULTIMATE.start_main_~y~0)) (.cse7 (not .cse15)) (.cse8 (< c_ULTIMATE.start_main_~y~0 .cse25)) (.cse21 (div (+ c_ULTIMATE.start_main_~y~0 .cse26) 4294967296)) (.cse20 (div (+ c_ULTIMATE.start_main_~y~0 .cse26 (- 2)) 4294967296))) (let ((.cse23 (+ .cse20 1)) (.cse24 (+ .cse21 1)) (.cse16 (and .cse7 .cse8)) (.cse9 (or .cse14 .cse15)) (.cse22 (+ c_ULTIMATE.start_main_~x~0 1))) (let ((.cse0 (<= 0 .cse22)) (.cse19 (or (and (or .cse14 (< 0 .cse23) .cse15) (or (< 0 .cse24) .cse16)) (and .cse7 .cse8 (<= 0 .cse20)) (and (<= 0 .cse21) .cse9)))) (and .cse0 (let ((.cse1 (and (<= .cse24 0) .cse9)) (.cse2 (and (<= .cse23 0) .cse7 .cse8))) (or .cse1 .cse2 (let ((.cse11 (+ .cse6 (* 4294967296 .cse21))) (.cse12 (+ (* 4294967296 .cse20) .cse6 2))) (let ((.cse4 (or (and (<= .cse11 c_ULTIMATE.start_main_~y~0) .cse9) (and (or .cse14 (< .cse12 c_ULTIMATE.start_main_~y~0) .cse15) (or .cse16 (< .cse11 c_ULTIMATE.start_main_~y~0))) (and .cse7 .cse8 (<= .cse12 c_ULTIMATE.start_main_~y~0)))) (.cse18 (<= .cse22 0)) (.cse13 (+ .cse6 3)) (.cse17 (+ .cse6 1))) (and .cse0 (let ((.cse3 (and .cse7 .cse8 (<= c_ULTIMATE.start_main_~y~0 .cse12))) (.cse10 (and (<= c_ULTIMATE.start_main_~y~0 .cse11) .cse9))) (or .cse3 (and .cse4 (let ((.cse5 (+ c_ULTIMATE.start_main_~x~0 c_ULTIMATE.start_main_~y~0))) (or (and (<= .cse5 (+ .cse6 2)) .cse7 .cse8) (and (<= .cse5 .cse6) .cse9) .cse3 .cse10))) .cse10)) (or .cse0 (and (or (< .cse13 c_ULTIMATE.start_main_~y~0) .cse14 .cse15) (or .cse16 (< .cse17 c_ULTIMATE.start_main_~y~0)))) (or (and (or .cse1 .cse2 .cse18) .cse19) (and (or .cse14 (< 0 .cse20) .cse15) (or .cse16 (< 0 .cse21)))) (or (and (<= .cse21 0) .cse9) (and .cse7 .cse8 (<= .cse20 0))) .cse4 (or (not (= .cse11 c_ULTIMATE.start_main_~y~0)) .cse16) (or .cse14 .cse15 (not (= .cse12 c_ULTIMATE.start_main_~y~0))) .cse18 (or (and (<= c_ULTIMATE.start_main_~y~0 .cse13) .cse7 .cse8) (and (<= c_ULTIMATE.start_main_~y~0 .cse17) .cse9))))))) (< .cse25 (+ c_ULTIMATE.start_main_~y~0 1)) .cse19))))))) is different from false [2018-10-15 13:05:00,133 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse28 (div c_ULTIMATE.start_main_~y~0 2))) (let ((.cse15 (* 2 .cse28))) (let ((.cse27 (* (- 2) .cse28)) (.cse7 (= .cse15 c_ULTIMATE.start_main_~y~0)) (.cse26 (* 4294967296 (div c_ULTIMATE.start_main_~y~0 4294967296)))) (let ((.cse5 (<= .cse26 c_ULTIMATE.start_main_~y~0)) (.cse12 (not .cse7)) (.cse13 (< c_ULTIMATE.start_main_~y~0 .cse26)) (.cse9 (div (+ c_ULTIMATE.start_main_~y~0 .cse27) 4294967296)) (.cse6 (div (+ c_ULTIMATE.start_main_~y~0 .cse27 (- 2)) 4294967296))) (let ((.cse24 (+ .cse6 1)) (.cse25 (+ .cse9 1)) (.cse8 (and .cse12 .cse13)) (.cse16 (or .cse5 .cse7))) (let ((.cse0 (<= 1 c_ULTIMATE.start_main_~x~0)) (.cse1 (or (and (or .cse5 (< 0 .cse24) .cse7) (or (< 0 .cse25) .cse8)) (and .cse12 .cse13 (<= 0 .cse6)) (and (<= 0 .cse9) .cse16)))) (and .cse0 (let ((.cse3 (and (<= .cse25 0) .cse16)) (.cse4 (and (<= .cse24 0) .cse12 .cse13))) (or (let ((.cse23 (* 4294967296 .cse9)) (.cse22 (* 4294967296 .cse6))) (let ((.cse21 (+ .cse22 .cse15 2)) (.cse19 (+ .cse15 .cse23))) (let ((.cse2 (<= c_ULTIMATE.start_main_~x~0 1)) (.cse20 (and (or .cse5 (< .cse21 c_ULTIMATE.start_main_~y~0) .cse7) (or .cse8 (< .cse19 c_ULTIMATE.start_main_~y~0)))) (.cse10 (+ .cse15 3)) (.cse11 (+ .cse15 1))) (and (or (and .cse1 (or .cse2 .cse3 .cse4)) (and (or .cse5 (< 0 .cse6) .cse7) (or .cse8 (< 0 .cse9)))) (or .cse0 (and (or (< .cse10 c_ULTIMATE.start_main_~y~0) .cse5 .cse7) (or .cse8 (< .cse11 c_ULTIMATE.start_main_~y~0)))) (let ((.cse17 (and .cse12 .cse13 (<= c_ULTIMATE.start_main_~y~0 .cse21))) (.cse18 (and (<= c_ULTIMATE.start_main_~y~0 .cse19) .cse16))) (or (and (let ((.cse14 (+ c_ULTIMATE.start_main_~x~0 c_ULTIMATE.start_main_~y~0))) (or (and .cse12 .cse13 (<= .cse14 (+ .cse15 4))) (and (<= .cse14 (+ .cse15 2)) .cse16) .cse17 .cse18)) (or (and (<= .cse19 c_ULTIMATE.start_main_~y~0) .cse16) .cse20 (and .cse12 .cse13 (<= .cse21 c_ULTIMATE.start_main_~y~0)))) .cse17 .cse18)) .cse0 (or (and (<= .cse9 0) .cse16) (and .cse12 .cse13 (<= .cse6 0))) .cse2 (or (and .cse12 .cse13 (<= (+ .cse22 .cse15 3) c_ULTIMATE.start_main_~y~0)) (and (<= (+ .cse15 .cse23 1) c_ULTIMATE.start_main_~y~0) .cse16) .cse20) (or (not (= .cse19 c_ULTIMATE.start_main_~y~0)) .cse8) (or .cse5 .cse7 (not (= .cse21 c_ULTIMATE.start_main_~y~0))) (or (and (<= c_ULTIMATE.start_main_~y~0 .cse10) .cse12 .cse13) (and (<= c_ULTIMATE.start_main_~y~0 .cse11) .cse16)))))) .cse3 .cse4)) (< .cse26 (+ c_ULTIMATE.start_main_~y~0 1)) .cse1))))))) is different from false [2018-10-15 13:05:12,193 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse28 (div c_ULTIMATE.start_main_~y~0 2))) (let ((.cse6 (* 2 .cse28))) (let ((.cse27 (* (- 2) .cse28)) (.cse12 (= .cse6 c_ULTIMATE.start_main_~y~0)) (.cse26 (* 4294967296 (div c_ULTIMATE.start_main_~y~0 4294967296)))) (let ((.cse11 (<= .cse26 c_ULTIMATE.start_main_~y~0)) (.cse2 (not .cse12)) (.cse3 (< c_ULTIMATE.start_main_~y~0 .cse26)) (.cse0 (div (+ c_ULTIMATE.start_main_~y~0 .cse27) 4294967296)) (.cse4 (div (+ c_ULTIMATE.start_main_~y~0 .cse27 (- 2)) 4294967296))) (let ((.cse24 (+ .cse4 1)) (.cse25 (+ .cse0 1)) (.cse13 (and .cse2 .cse3)) (.cse1 (or .cse11 .cse12)) (.cse23 (+ c_ULTIMATE.start_main_~x~0 3))) (let ((.cse9 (<= 0 .cse23)) (.cse22 (or (and (or .cse11 (< 0 .cse24) .cse12) (or (< 0 .cse25) .cse13)) (and .cse2 .cse3 (<= 0 .cse4)) (and (<= 0 .cse0) .cse1)))) (and (let ((.cse20 (and (<= .cse25 0) .cse1)) (.cse21 (and (<= .cse24 0) .cse2 .cse3))) (or (let ((.cse7 (* 4294967296 .cse0)) (.cse5 (* 4294967296 .cse4))) (let ((.cse17 (+ .cse5 .cse6 2)) (.cse15 (+ .cse6 .cse7))) (let ((.cse8 (and (or .cse11 (< .cse17 c_ULTIMATE.start_main_~y~0) .cse12) (or .cse13 (< .cse15 c_ULTIMATE.start_main_~y~0)))) (.cse16 (<= .cse23 0)) (.cse10 (+ .cse6 3)) (.cse14 (+ .cse6 1))) (and (or (and (<= .cse0 0) .cse1) (and .cse2 .cse3 (<= .cse4 0))) (or (and .cse2 .cse3 (<= (+ .cse5 .cse6 3) c_ULTIMATE.start_main_~y~0)) (and (<= (+ .cse6 .cse7 1) c_ULTIMATE.start_main_~y~0) .cse1) .cse8) (or .cse9 (and (or (< .cse10 c_ULTIMATE.start_main_~y~0) .cse11 .cse12) (or .cse13 (< .cse14 c_ULTIMATE.start_main_~y~0)))) (or (not (= .cse15 c_ULTIMATE.start_main_~y~0)) .cse13) .cse9 .cse16 (let ((.cse18 (and .cse2 .cse3 (<= c_ULTIMATE.start_main_~y~0 .cse17))) (.cse19 (and (<= c_ULTIMATE.start_main_~y~0 .cse15) .cse1))) (or (and (or (and (<= .cse15 c_ULTIMATE.start_main_~y~0) .cse1) .cse8 (and .cse2 .cse3 (<= .cse17 c_ULTIMATE.start_main_~y~0))) (or (and .cse2 .cse3 (<= (+ c_ULTIMATE.start_main_~x~0 c_ULTIMATE.start_main_~y~0) .cse6)) .cse18 .cse19 (and .cse1 (<= (+ c_ULTIMATE.start_main_~x~0 c_ULTIMATE.start_main_~y~0 2) .cse6)))) .cse18 .cse19)) (or .cse11 .cse12 (not (= .cse17 c_ULTIMATE.start_main_~y~0))) (or (and (or .cse16 .cse20 .cse21) .cse22) (and (or .cse11 (< 0 .cse4) .cse12) (or .cse13 (< 0 .cse0)))) (or (and (<= c_ULTIMATE.start_main_~y~0 .cse10) .cse2 .cse3) (and (<= c_ULTIMATE.start_main_~y~0 .cse14) .cse1)))))) .cse20 .cse21)) (< .cse26 (+ c_ULTIMATE.start_main_~y~0 1)) .cse9 .cse22))))))) is different from false [2018-10-15 13:05:24,236 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse28 (div c_ULTIMATE.start_main_~y~0 2))) (let ((.cse6 (* 2 .cse28))) (let ((.cse27 (* (- 2) .cse28)) (.cse12 (= .cse6 c_ULTIMATE.start_main_~y~0)) (.cse26 (* 4294967296 (div c_ULTIMATE.start_main_~y~0 4294967296)))) (let ((.cse11 (<= .cse26 c_ULTIMATE.start_main_~y~0)) (.cse2 (not .cse12)) (.cse3 (< c_ULTIMATE.start_main_~y~0 .cse26)) (.cse0 (div (+ c_ULTIMATE.start_main_~y~0 .cse27) 4294967296)) (.cse4 (div (+ c_ULTIMATE.start_main_~y~0 .cse27 (- 2)) 4294967296))) (let ((.cse24 (+ .cse4 1)) (.cse25 (+ .cse0 1)) (.cse13 (and .cse2 .cse3)) (.cse1 (or .cse11 .cse12)) (.cse23 (+ c_ULTIMATE.start_main_~x~0 3))) (let ((.cse9 (<= 0 .cse23)) (.cse22 (or (and (or .cse11 (< 0 .cse24) .cse12) (or (< 0 .cse25) .cse13)) (and .cse2 .cse3 (<= 0 .cse4)) (and (<= 0 .cse0) .cse1)))) (and (let ((.cse20 (and (<= .cse25 0) .cse1)) (.cse21 (and (<= .cse24 0) .cse2 .cse3))) (or (let ((.cse7 (* 4294967296 .cse0)) (.cse5 (* 4294967296 .cse4))) (let ((.cse17 (+ .cse5 .cse6 2)) (.cse15 (+ .cse6 .cse7))) (let ((.cse8 (and (or .cse11 (< .cse17 c_ULTIMATE.start_main_~y~0) .cse12) (or .cse13 (< .cse15 c_ULTIMATE.start_main_~y~0)))) (.cse16 (<= .cse23 0)) (.cse10 (+ .cse6 3)) (.cse14 (+ .cse6 1))) (and (or (and (<= .cse0 0) .cse1) (and .cse2 .cse3 (<= .cse4 0))) (or (and .cse2 .cse3 (<= (+ .cse5 .cse6 3) c_ULTIMATE.start_main_~y~0)) (and (<= (+ .cse6 .cse7 1) c_ULTIMATE.start_main_~y~0) .cse1) .cse8) (or .cse9 (and (or (< .cse10 c_ULTIMATE.start_main_~y~0) .cse11 .cse12) (or .cse13 (< .cse14 c_ULTIMATE.start_main_~y~0)))) (or (not (= .cse15 c_ULTIMATE.start_main_~y~0)) .cse13) .cse9 .cse16 (let ((.cse18 (and .cse2 .cse3 (<= c_ULTIMATE.start_main_~y~0 .cse17))) (.cse19 (and (<= c_ULTIMATE.start_main_~y~0 .cse15) .cse1))) (or (and (or (and (<= .cse15 c_ULTIMATE.start_main_~y~0) .cse1) .cse8 (and .cse2 .cse3 (<= .cse17 c_ULTIMATE.start_main_~y~0))) (or (and .cse2 .cse3 (<= (+ c_ULTIMATE.start_main_~x~0 c_ULTIMATE.start_main_~y~0) .cse6)) .cse18 .cse19 (and .cse1 (<= (+ c_ULTIMATE.start_main_~x~0 c_ULTIMATE.start_main_~y~0 2) .cse6)))) .cse18 .cse19)) (or .cse11 .cse12 (not (= .cse17 c_ULTIMATE.start_main_~y~0))) (or (and (or .cse16 .cse20 .cse21) .cse22) (and (or .cse11 (< 0 .cse4) .cse12) (or .cse13 (< 0 .cse0)))) (or (and (<= c_ULTIMATE.start_main_~y~0 .cse10) .cse2 .cse3) (and (<= c_ULTIMATE.start_main_~y~0 .cse14) .cse1)))))) .cse20 .cse21)) (< .cse26 (+ c_ULTIMATE.start_main_~y~0 1)) .cse9 .cse22))))))) is different from true [2018-10-15 13:05:36,293 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse28 (div c_ULTIMATE.start_main_~y~0 2))) (let ((.cse14 (* 2 .cse28))) (let ((.cse27 (* (- 2) .cse28)) (.cse4 (= .cse14 c_ULTIMATE.start_main_~y~0)) (.cse26 (* 4294967296 (div c_ULTIMATE.start_main_~y~0 4294967296)))) (let ((.cse3 (<= .cse26 c_ULTIMATE.start_main_~y~0)) (.cse9 (not .cse4)) (.cse10 (< c_ULTIMATE.start_main_~y~0 .cse26)) (.cse7 (div (+ c_ULTIMATE.start_main_~y~0 .cse27) 4294967296)) (.cse11 (div (+ c_ULTIMATE.start_main_~y~0 .cse27 (- 2)) 4294967296))) (let ((.cse24 (+ .cse11 1)) (.cse25 (+ .cse7 1)) (.cse5 (and .cse9 .cse10)) (.cse8 (or .cse3 .cse4))) (let ((.cse1 (<= 3 c_ULTIMATE.start_main_~x~0)) (.cse23 (or (and (or .cse3 (< 0 .cse24) .cse4) (or (< 0 .cse25) .cse5)) (and .cse9 .cse10 (<= 0 .cse11)) (and (<= 0 .cse7) .cse8)))) (and (let ((.cse21 (and (<= .cse25 0) .cse8)) (.cse22 (and (<= .cse24 0) .cse9 .cse10))) (or (let ((.cse20 (* 4294967296 .cse7)) (.cse19 (* 4294967296 .cse11))) (let ((.cse18 (+ .cse19 .cse14 2)) (.cse16 (+ .cse14 .cse20))) (let ((.cse17 (and (or .cse3 (< .cse18 c_ULTIMATE.start_main_~y~0) .cse4) (or .cse5 (< .cse16 c_ULTIMATE.start_main_~y~0)))) (.cse0 (<= c_ULTIMATE.start_main_~x~0 3)) (.cse2 (+ .cse14 3)) (.cse6 (+ .cse14 1))) (and .cse0 (or .cse1 (and (or (< .cse2 c_ULTIMATE.start_main_~y~0) .cse3 .cse4) (or .cse5 (< .cse6 c_ULTIMATE.start_main_~y~0)))) (or (and (<= .cse7 0) .cse8) (and .cse9 .cse10 (<= .cse11 0))) (let ((.cse12 (and .cse9 .cse10 (<= c_ULTIMATE.start_main_~y~0 .cse18))) (.cse15 (and (<= c_ULTIMATE.start_main_~y~0 .cse16) .cse8))) (or .cse12 (and (let ((.cse13 (+ c_ULTIMATE.start_main_~x~0 c_ULTIMATE.start_main_~y~0))) (or (and (<= .cse13 (+ .cse14 4)) .cse8) .cse12 .cse15 (and (<= .cse13 (+ .cse14 6)) .cse9 .cse10))) (or (and (<= .cse16 c_ULTIMATE.start_main_~y~0) .cse8) .cse17 (and .cse9 .cse10 (<= .cse18 c_ULTIMATE.start_main_~y~0)))) .cse15)) (or (and .cse9 .cse10 (<= (+ .cse19 .cse14 3) c_ULTIMATE.start_main_~y~0)) (and (<= (+ .cse14 .cse20 1) c_ULTIMATE.start_main_~y~0) .cse8) .cse17) .cse1 (or (not (= .cse16 c_ULTIMATE.start_main_~y~0)) .cse5) (or (and (or .cse0 .cse21 .cse22) .cse23) (and (or .cse3 (< 0 .cse11) .cse4) (or .cse5 (< 0 .cse7)))) (or .cse3 .cse4 (not (= .cse18 c_ULTIMATE.start_main_~y~0))) (or (and (<= c_ULTIMATE.start_main_~y~0 .cse2) .cse9 .cse10) (and (<= c_ULTIMATE.start_main_~y~0 .cse6) .cse8)))))) .cse21 .cse22)) (< .cse26 (+ c_ULTIMATE.start_main_~y~0 1)) .cse1 .cse23))))))) is different from false [2018-10-15 13:05:48,359 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse28 (div c_ULTIMATE.start_main_~y~0 2))) (let ((.cse20 (* 2 .cse28))) (let ((.cse27 (* (- 2) .cse28)) (.cse6 (= .cse20 c_ULTIMATE.start_main_~y~0)) (.cse0 (* 4294967296 (div c_ULTIMATE.start_main_~y~0 4294967296)))) (let ((.cse5 (<= .cse0 c_ULTIMATE.start_main_~y~0)) (.cse11 (not .cse6)) (.cse12 (< c_ULTIMATE.start_main_~y~0 .cse0)) (.cse9 (div (+ c_ULTIMATE.start_main_~y~0 .cse27) 4294967296)) (.cse13 (div (+ c_ULTIMATE.start_main_~y~0 .cse27 (- 2)) 4294967296))) (let ((.cse25 (+ .cse13 1)) (.cse26 (+ .cse9 1)) (.cse7 (and .cse11 .cse12)) (.cse10 (or .cse5 .cse6))) (let ((.cse1 (<= 3 c_ULTIMATE.start_main_~x~0)) (.cse2 (or (and (or .cse5 (< 0 .cse25) .cse6) (or (< 0 .cse26) .cse7)) (and .cse11 .cse12 (<= 0 .cse13)) (and (<= 0 .cse9) .cse10)))) (and (< .cse0 (+ c_ULTIMATE.start_main_~y~0 1)) .cse1 .cse2 (let ((.cse15 (and (<= .cse26 0) .cse10)) (.cse16 (and (<= .cse25 0) .cse11 .cse12))) (or (let ((.cse24 (* 4294967296 .cse9)) (.cse23 (* 4294967296 .cse13))) (let ((.cse22 (+ .cse23 .cse20 2)) (.cse21 (+ .cse20 .cse24))) (let ((.cse3 (<= c_ULTIMATE.start_main_~x~0 3)) (.cse4 (+ .cse20 3)) (.cse8 (+ .cse20 1)) (.cse14 (or (and .cse11 .cse12 (<= (+ .cse23 .cse20 3) c_ULTIMATE.start_main_~y~0)) (and (<= (+ .cse20 .cse24 1) c_ULTIMATE.start_main_~y~0) .cse10) (and (or .cse5 (< .cse22 c_ULTIMATE.start_main_~y~0) .cse6) (or .cse7 (< .cse21 c_ULTIMATE.start_main_~y~0)))))) (and .cse3 (or .cse1 (and (or (< .cse4 c_ULTIMATE.start_main_~y~0) .cse5 .cse6) (or .cse7 (< .cse8 c_ULTIMATE.start_main_~y~0)))) (or (and (<= .cse9 0) .cse10) (and .cse11 .cse12 (<= .cse13 0))) .cse14 .cse1 (or (and (or .cse3 .cse15 .cse16) .cse2) (and (or .cse5 (< 0 .cse13) .cse6) (or .cse7 (< 0 .cse9)))) (or (and (<= c_ULTIMATE.start_main_~y~0 .cse4) .cse11 .cse12) (and (<= c_ULTIMATE.start_main_~y~0 .cse8) .cse10)) (let ((.cse17 (and .cse11 .cse12 (<= c_ULTIMATE.start_main_~y~0 .cse22))) (.cse18 (and (<= c_ULTIMATE.start_main_~y~0 .cse21) .cse10))) (or .cse17 .cse18 (and (let ((.cse19 (+ c_ULTIMATE.start_main_~x~0 c_ULTIMATE.start_main_~y~0))) (or (and (<= .cse19 (+ .cse20 4)) .cse10) .cse17 .cse18 (and (<= .cse19 (+ .cse20 6)) .cse11 .cse12))) .cse14))))))) .cse15 .cse16))))))))) is different from false [2018-10-15 13:06:00,381 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse28 (div c_ULTIMATE.start_main_~y~0 2))) (let ((.cse20 (* 2 .cse28))) (let ((.cse27 (* (- 2) .cse28)) (.cse6 (= .cse20 c_ULTIMATE.start_main_~y~0)) (.cse0 (* 4294967296 (div c_ULTIMATE.start_main_~y~0 4294967296)))) (let ((.cse5 (<= .cse0 c_ULTIMATE.start_main_~y~0)) (.cse11 (not .cse6)) (.cse12 (< c_ULTIMATE.start_main_~y~0 .cse0)) (.cse9 (div (+ c_ULTIMATE.start_main_~y~0 .cse27) 4294967296)) (.cse13 (div (+ c_ULTIMATE.start_main_~y~0 .cse27 (- 2)) 4294967296))) (let ((.cse25 (+ .cse13 1)) (.cse26 (+ .cse9 1)) (.cse7 (and .cse11 .cse12)) (.cse10 (or .cse5 .cse6))) (let ((.cse1 (<= 3 c_ULTIMATE.start_main_~x~0)) (.cse2 (or (and (or .cse5 (< 0 .cse25) .cse6) (or (< 0 .cse26) .cse7)) (and .cse11 .cse12 (<= 0 .cse13)) (and (<= 0 .cse9) .cse10)))) (and (< .cse0 (+ c_ULTIMATE.start_main_~y~0 1)) .cse1 .cse2 (let ((.cse15 (and (<= .cse26 0) .cse10)) (.cse16 (and (<= .cse25 0) .cse11 .cse12))) (or (let ((.cse24 (* 4294967296 .cse9)) (.cse23 (* 4294967296 .cse13))) (let ((.cse22 (+ .cse23 .cse20 2)) (.cse21 (+ .cse20 .cse24))) (let ((.cse3 (<= c_ULTIMATE.start_main_~x~0 3)) (.cse4 (+ .cse20 3)) (.cse8 (+ .cse20 1)) (.cse14 (or (and .cse11 .cse12 (<= (+ .cse23 .cse20 3) c_ULTIMATE.start_main_~y~0)) (and (<= (+ .cse20 .cse24 1) c_ULTIMATE.start_main_~y~0) .cse10) (and (or .cse5 (< .cse22 c_ULTIMATE.start_main_~y~0) .cse6) (or .cse7 (< .cse21 c_ULTIMATE.start_main_~y~0)))))) (and .cse3 (or .cse1 (and (or (< .cse4 c_ULTIMATE.start_main_~y~0) .cse5 .cse6) (or .cse7 (< .cse8 c_ULTIMATE.start_main_~y~0)))) (or (and (<= .cse9 0) .cse10) (and .cse11 .cse12 (<= .cse13 0))) .cse14 .cse1 (or (and (or .cse3 .cse15 .cse16) .cse2) (and (or .cse5 (< 0 .cse13) .cse6) (or .cse7 (< 0 .cse9)))) (or (and (<= c_ULTIMATE.start_main_~y~0 .cse4) .cse11 .cse12) (and (<= c_ULTIMATE.start_main_~y~0 .cse8) .cse10)) (let ((.cse17 (and .cse11 .cse12 (<= c_ULTIMATE.start_main_~y~0 .cse22))) (.cse18 (and (<= c_ULTIMATE.start_main_~y~0 .cse21) .cse10))) (or .cse17 .cse18 (and (let ((.cse19 (+ c_ULTIMATE.start_main_~x~0 c_ULTIMATE.start_main_~y~0))) (or (and (<= .cse19 (+ .cse20 4)) .cse10) .cse17 .cse18 (and (<= .cse19 (+ .cse20 6)) .cse11 .cse12))) .cse14))))))) .cse15 .cse16))))))))) is different from true [2018-10-15 13:06:12,436 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse29 (div c_ULTIMATE.start_main_~y~0 2))) (let ((.cse20 (* 2 .cse29))) (let ((.cse28 (* (- 2) .cse29)) (.cse4 (= .cse20 c_ULTIMATE.start_main_~y~0)) (.cse1 (* 4294967296 (div c_ULTIMATE.start_main_~y~0 4294967296)))) (let ((.cse3 (<= .cse1 c_ULTIMATE.start_main_~y~0)) (.cse14 (not .cse4)) (.cse15 (< c_ULTIMATE.start_main_~y~0 .cse1)) (.cse12 (div (+ c_ULTIMATE.start_main_~y~0 .cse28) 4294967296)) (.cse11 (div (+ c_ULTIMATE.start_main_~y~0 .cse28 (- 2)) 4294967296))) (let ((.cse26 (+ .cse11 1)) (.cse27 (+ .cse12 1)) (.cse5 (and .cse14 .cse15)) (.cse13 (or .cse3 .cse4)) (.cse25 (+ c_ULTIMATE.start_main_~x~0 1))) (let ((.cse0 (<= 0 .cse25)) (.cse10 (or (and (or .cse3 (< 0 .cse26) .cse4) (or (< 0 .cse27) .cse5)) (and .cse14 .cse15 (<= 0 .cse11)) (and (<= 0 .cse12) .cse13)))) (and .cse0 (< .cse1 (+ c_ULTIMATE.start_main_~y~0 1)) (let ((.cse7 (and (<= .cse27 0) .cse13)) (.cse8 (and (<= .cse26 0) .cse14 .cse15))) (or (let ((.cse24 (* 4294967296 .cse12)) (.cse23 (* 4294967296 .cse11))) (let ((.cse22 (+ .cse23 .cse20 2)) (.cse21 (+ .cse20 .cse24))) (let ((.cse9 (<= .cse25 0)) (.cse16 (or (and .cse14 .cse15 (<= (+ .cse23 .cse20 3) c_ULTIMATE.start_main_~y~0)) (and (<= (+ .cse20 .cse24 1) c_ULTIMATE.start_main_~y~0) .cse13) (and (or .cse3 (< .cse22 c_ULTIMATE.start_main_~y~0) .cse4) (or .cse5 (< .cse21 c_ULTIMATE.start_main_~y~0))))) (.cse2 (+ .cse20 3)) (.cse6 (+ .cse20 1))) (and .cse0 (or .cse0 (and (or (< .cse2 c_ULTIMATE.start_main_~y~0) .cse3 .cse4) (or .cse5 (< .cse6 c_ULTIMATE.start_main_~y~0)))) (or (and (or .cse7 .cse8 .cse9) .cse10) (and (or .cse3 (< 0 .cse11) .cse4) (or .cse5 (< 0 .cse12)))) (or (and (<= .cse12 0) .cse13) (and .cse14 .cse15 (<= .cse11 0))) .cse16 .cse9 (let ((.cse17 (and .cse14 .cse15 (<= c_ULTIMATE.start_main_~y~0 .cse22))) (.cse18 (and (<= c_ULTIMATE.start_main_~y~0 .cse21) .cse13))) (or .cse17 .cse18 (and (let ((.cse19 (+ c_ULTIMATE.start_main_~x~0 c_ULTIMATE.start_main_~y~0))) (or (and (<= .cse19 (+ .cse20 2)) .cse14 .cse15) (and (<= .cse19 .cse20) .cse13) .cse17 .cse18)) .cse16))) (or (and (<= c_ULTIMATE.start_main_~y~0 .cse2) .cse14 .cse15) (and (<= c_ULTIMATE.start_main_~y~0 .cse6) .cse13)))))) .cse7 .cse8)) .cse10))))))) is different from false [2018-10-15 13:06:24,487 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse28 (div c_ULTIMATE.start_main_~y~0 2))) (let ((.cse16 (* 2 .cse28))) (let ((.cse27 (* (- 2) .cse28)) (.cse10 (= .cse16 c_ULTIMATE.start_main_~y~0)) (.cse26 (* 4294967296 (div c_ULTIMATE.start_main_~y~0 4294967296)))) (let ((.cse9 (<= .cse26 c_ULTIMATE.start_main_~y~0)) (.cse3 (not .cse10)) (.cse4 (< c_ULTIMATE.start_main_~y~0 .cse26)) (.cse1 (div (+ c_ULTIMATE.start_main_~y~0 .cse27) 4294967296)) (.cse5 (div (+ c_ULTIMATE.start_main_~y~0 .cse27 (- 2)) 4294967296))) (let ((.cse24 (+ .cse5 1)) (.cse25 (+ .cse1 1)) (.cse11 (and .cse3 .cse4)) (.cse2 (or .cse9 .cse10)) (.cse23 (+ c_ULTIMATE.start_main_~x~0 5))) (let ((.cse0 (<= 0 .cse23)) (.cse15 (or (and (or .cse9 (< 0 .cse24) .cse10) (or (< 0 .cse25) .cse11)) (and .cse3 .cse4 (<= 0 .cse5)) (and (<= 0 .cse1) .cse2)))) (and .cse0 (let ((.cse13 (and (<= .cse25 0) .cse2)) (.cse14 (and (<= .cse24 0) .cse3 .cse4))) (or (let ((.cse22 (* 4294967296 .cse1)) (.cse21 (* 4294967296 .cse5))) (let ((.cse20 (+ .cse21 .cse16 2)) (.cse19 (+ .cse16 .cse22))) (let ((.cse8 (+ .cse16 3)) (.cse12 (+ .cse16 1)) (.cse6 (<= .cse23 0)) (.cse7 (or (and .cse3 .cse4 (<= (+ .cse21 .cse16 3) c_ULTIMATE.start_main_~y~0)) (and (<= (+ .cse16 .cse22 1) c_ULTIMATE.start_main_~y~0) .cse2) (and (or .cse9 (< .cse20 c_ULTIMATE.start_main_~y~0) .cse10) (or .cse11 (< .cse19 c_ULTIMATE.start_main_~y~0)))))) (and .cse0 (or (and (<= .cse1 0) .cse2) (and .cse3 .cse4 (<= .cse5 0))) .cse6 .cse7 (or .cse0 (and (or (< .cse8 c_ULTIMATE.start_main_~y~0) .cse9 .cse10) (or .cse11 (< .cse12 c_ULTIMATE.start_main_~y~0)))) (or (and (<= c_ULTIMATE.start_main_~y~0 .cse8) .cse3 .cse4) (and (<= c_ULTIMATE.start_main_~y~0 .cse12) .cse2)) (or (and (or .cse6 .cse13 .cse14) .cse15) (and (or .cse9 (< 0 .cse5) .cse10) (or .cse11 (< 0 .cse1)))) (let ((.cse17 (and .cse3 .cse4 (<= c_ULTIMATE.start_main_~y~0 .cse20))) (.cse18 (and (<= c_ULTIMATE.start_main_~y~0 .cse19) .cse2))) (or (and (or (and (<= (+ c_ULTIMATE.start_main_~x~0 c_ULTIMATE.start_main_~y~0 4) .cse16) .cse2) .cse17 .cse18 (and .cse3 .cse4 (<= (+ c_ULTIMATE.start_main_~x~0 c_ULTIMATE.start_main_~y~0 2) .cse16))) .cse7) .cse17 .cse18)))))) .cse13 .cse14)) (< .cse26 (+ c_ULTIMATE.start_main_~y~0 1)) .cse15))))))) is different from false [2018-10-15 13:08:01,017 WARN L179 SmtUtils]: Spent 1.41 m on a formula simplification. DAG size of input: 108 DAG size of output: 21 [2018-10-15 13:08:01,396 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2018-10-15 13:08:01,396 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:08:01,397 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-10-15 13:08:01,401 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-10-15 13:08:01,401 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-10-15 13:08:01,402 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=29, Unknown=14, NotChecked=198, Total=272 [2018-10-15 13:08:01,403 INFO L87 Difference]: Start difference. First operand 36 states and 36 transitions. Second operand 17 states. [2018-10-15 13:08:13,478 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse19 (div c_ULTIMATE.start_main_~y~0 2))) (let ((.cse2 (* 2 .cse19))) (let ((.cse18 (* (- 2) .cse19)) (.cse5 (= .cse2 c_ULTIMATE.start_main_~y~0)) (.cse1 (* 4294967296 (div c_ULTIMATE.start_main_~y~0 4294967296)))) (let ((.cse3 (<= .cse1 c_ULTIMATE.start_main_~y~0)) (.cse9 (not .cse5)) (.cse10 (< c_ULTIMATE.start_main_~y~0 .cse1)) (.cse7 (div (+ c_ULTIMATE.start_main_~y~0 .cse18) 4294967296)) (.cse4 (div (+ c_ULTIMATE.start_main_~y~0 .cse18 (- 2)) 4294967296))) (let ((.cse0 (<= c_ULTIMATE.start_main_~x~0 0)) (.cse17 (+ .cse4 1)) (.cse16 (+ .cse7 1)) (.cse6 (and .cse9 .cse10)) (.cse8 (or .cse3 .cse5)) (.cse14 (<= 0 c_ULTIMATE.start_main_~x~0))) (and .cse0 (< .cse1 (+ c_ULTIMATE.start_main_~y~0 1)) (or (let ((.cse12 (+ (* 4294967296 .cse4) .cse2 2)) (.cse11 (+ .cse2 (* 4294967296 .cse7))) (.cse13 (+ .cse2 1))) (and (or (and .cse0 (<= .cse2 c_ULTIMATE.start_main_~y~0)) (and (or .cse3 (< 0 .cse4) .cse5) (or .cse6 (< 0 .cse7)))) (or (and (<= .cse7 0) .cse8) (and .cse9 .cse10 (<= .cse4 0))) (or (and (<= .cse11 c_ULTIMATE.start_main_~y~0) .cse8) (and (or .cse3 (< .cse12 c_ULTIMATE.start_main_~y~0) .cse5) (or .cse6 (< .cse11 c_ULTIMATE.start_main_~y~0))) (and .cse9 .cse10 (<= .cse12 c_ULTIMATE.start_main_~y~0))) .cse0 (or (not (= .cse11 c_ULTIMATE.start_main_~y~0)) .cse6) (<= c_ULTIMATE.start_main_~y~0 .cse13) (or .cse3 .cse5 (not (= .cse12 c_ULTIMATE.start_main_~y~0))) .cse14 (let ((.cse15 (+ c_ULTIMATE.start_main_~x~0 c_ULTIMATE.start_main_~y~0))) (or (and .cse9 .cse10 (<= .cse15 (+ .cse2 3))) (and .cse9 .cse10 (<= c_ULTIMATE.start_main_~y~0 .cse12)) (and (<= c_ULTIMATE.start_main_~y~0 .cse11) .cse8) (and (<= .cse15 .cse13) .cse8))))) (and (<= .cse16 0) .cse8) (and (<= .cse17 0) .cse9 .cse10)) (or (and (or .cse3 (< 0 .cse17) .cse5) (or (< 0 .cse16) .cse6)) (and .cse9 .cse10 (<= 0 .cse4)) (and (<= 0 .cse7) .cse8)) .cse14)))))) is different from false [2018-10-15 13:08:13,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:08:13,717 INFO L93 Difference]: Finished difference Result 64 states and 64 transitions. [2018-10-15 13:08:13,718 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-10-15 13:08:13,718 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 35 [2018-10-15 13:08:13,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:08:13,720 INFO L225 Difference]: With dead ends: 64 [2018-10-15 13:08:13,720 INFO L226 Difference]: Without dead ends: 59 [2018-10-15 13:08:13,722 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 12 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 265.7s TimeCoverageRelationStatistics Valid=43, Invalid=46, Unknown=15, NotChecked=276, Total=380 [2018-10-15 13:08:13,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-10-15 13:08:13,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2018-10-15 13:08:13,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-10-15 13:08:13,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 59 transitions. [2018-10-15 13:08:13,731 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 59 transitions. Word has length 35 [2018-10-15 13:08:13,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:08:13,733 INFO L481 AbstractCegarLoop]: Abstraction has 59 states and 59 transitions. [2018-10-15 13:08:13,733 INFO L482 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-10-15 13:08:13,734 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 59 transitions. [2018-10-15 13:08:13,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-10-15 13:08:13,736 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:08:13,736 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:08:13,736 INFO L424 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:08:13,737 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:08:13,737 INFO L82 PathProgramCache]: Analyzing trace with hash -1574934486, now seen corresponding path program 2 times [2018-10-15 13:08:13,738 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:08:13,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:08:14,058 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 24 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:08:14,059 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:08:14,059 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-10-15 13:08:14,059 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-15 13:08:14,060 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-15 13:08:14,060 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-10-15 13:08:14,061 INFO L87 Difference]: Start difference. First operand 59 states and 59 transitions. Second operand 9 states. [2018-10-15 13:08:14,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:08:14,575 INFO L93 Difference]: Finished difference Result 29 states and 28 transitions. [2018-10-15 13:08:14,576 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-15 13:08:14,576 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 58 [2018-10-15 13:08:14,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:08:14,577 INFO L225 Difference]: With dead ends: 29 [2018-10-15 13:08:14,577 INFO L226 Difference]: Without dead ends: 0 [2018-10-15 13:08:14,577 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-10-15 13:08:14,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-10-15 13:08:14,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-10-15 13:08:14,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-10-15 13:08:14,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-10-15 13:08:14,579 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 58 [2018-10-15 13:08:14,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:08:14,579 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-15 13:08:14,579 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-15 13:08:14,579 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-10-15 13:08:14,580 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-10-15 13:08:14,585 INFO L202 PluginConnector]: Adding new model diamond_true-unreach-call2.i_6.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.10 01:08:14 BasicIcfg [2018-10-15 13:08:14,585 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-15 13:08:14,586 INFO L168 Benchmark]: Toolchain (without parser) took 268757.37 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.2 GB in the end (delta: 211.5 MB). Peak memory consumption was 211.5 MB. Max. memory is 7.1 GB. [2018-10-15 13:08:14,587 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.19 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-15 13:08:14,588 INFO L168 Benchmark]: Boogie Preprocessor took 52.02 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-15 13:08:14,589 INFO L168 Benchmark]: RCFGBuilder took 626.37 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. [2018-10-15 13:08:14,590 INFO L168 Benchmark]: IcfgTransformer took 28.85 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-15 13:08:14,590 INFO L168 Benchmark]: TraceAbstraction took 268046.31 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.2 GB in the end (delta: 190.3 MB). Peak memory consumption was 190.3 MB. Max. memory is 7.1 GB. [2018-10-15 13:08:14,595 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.19 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 52.02 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 626.37 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. * IcfgTransformer took 28.85 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * TraceAbstraction took 268046.31 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.2 GB in the end (delta: 190.3 MB). Peak memory consumption was 190.3 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 57]: assertion always holds For all program executions holds that assertion always holds at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 37 locations, 1 error locations. SAFE Result, 267.9s OverallTime, 3 OverallIterations, 2 TraceHistogramMax, 13.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 80 SDtfs, 9 SDslu, 248 SDs, 0 SdLazy, 172 SolverSat, 1 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 46 GetRequests, 15 SyntacticMatches, 3 SemanticMatches, 28 ConstructedPredicates, 12 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 266.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=59occurred in iteration=2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 3 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 254.5s InterpolantComputationTime, 105 NumberOfCodeBlocks, 105 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 102 ConstructedInterpolants, 0 QuantifiedInterpolants, 814124 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 3 InterpolantComputations, 1 PerfectInterpolantSequences, 24/26 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/diamond_true-unreach-call2.i_6.bpl_heapsep-2018-09-18.epf_AutomizerBplTransformed.xml/Csv-Benchmark-0-2018-10-15_13-08-14-607.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/diamond_true-unreach-call2.i_6.bpl_heapsep-2018-09-18.epf_AutomizerBplTransformed.xml/Csv-TraceAbstractionBenchmarks-0-2018-10-15_13-08-14-607.csv Received shutdown request...